Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (5830)
- China Simulation Federation (3924)
- TÜBİTAK (2852)
- Missouri University of Science and Technology (1081)
- University of Nebraska - Lincoln (1079)
-
- Old Dominion University (933)
- Edith Cowan University (829)
- Embry-Riddle Aeronautical University (693)
- Zayed University (683)
- Wright State University (648)
- Purdue University (560)
- University of Texas at El Paso (523)
- Technological University Dublin (456)
- Kennesaw State University (438)
- San Jose State University (371)
- Walden University (368)
- Dartmouth College (316)
- Marquette University (275)
- New Jersey Institute of Technology (264)
- Karbala International Journal of Modern Science (263)
- City University of New York (CUNY) (257)
- University of Nebraska at Omaha (257)
- MMU Press (252)
- Brigham Young University (238)
- Neutrosophic Systems with Applications (237)
- Smith College (208)
- Chulalongkorn University (207)
- Syracuse University (203)
- California Polytechnic State University, San Luis Obispo (198)
- Portland State University (196)
- Keyword
-
- Machine learning (860)
- Artificial intelligence (610)
- Deep learning (595)
- Machine Learning (351)
- Security (323)
-
- Cybersecurity (280)
- Computer Science (270)
- Artificial Intelligence (242)
- Simulation (240)
- Classification (231)
- Privacy (231)
- Deep Learning (212)
- Optimization (205)
- Neural networks (186)
- Data mining (182)
- Natural language processing (174)
- Technical Reports (166)
- UTEP Computer Science Department (166)
- AI (163)
- Blockchain (161)
- Computer science (157)
- Reinforcement learning (156)
- Cloud computing (155)
- Algorithms (154)
- Feature extraction (145)
- Social media (143)
- Clustering (142)
- Genetic algorithm (140)
- Engineering (133)
- Computer vision (131)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (5576)
- Journal of System Simulation (3924)
- Turkish Journal of Electrical Engineering and Computer Sciences (2852)
- The R Journal (708)
- All Works (681)
-
- Computer Science Faculty Research & Creative Works (590)
- Computer Science Faculty Publications (531)
- Journal of Digital Forensics, Security and Law (481)
- Departmental Technical Reports (CS) (469)
- Department of Computer Science Technical Reports (456)
- Theses and Dissertations (422)
- Walden Dissertations and Doctoral Studies (365)
- Faculty Publications (341)
- Master's Projects (288)
- Karbala International Journal of Modern Science (263)
- Computer Science Technical Reports (254)
- Dissertations (253)
- Journal of Informatics and Web Engineering (252)
- Neutrosophic Systems with Applications (237)
- Kno.e.sis Publications (232)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (207)
- Research outputs 2022 to 2026 (202)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (201)
- Computer Science Faculty Publications and Presentations (194)
- Conference papers (190)
- Articles (188)
- Computer Science: Faculty Publications (170)
- Electrical and Computer Engineering Faculty Research & Creative Works (168)
- Journal of Cybersecurity Education, Research and Practice (152)
- Computer Science and Engineering Faculty Publications (149)
- Publication Type
Articles 31651 - 31680 of 31901
Full-Text Articles in Entire DC Network
Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello
Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello
Research Collection School Of Computing and Information Systems
A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K bit DRAM's are organized in 32K ?? 8 bit-bytes. Byte-oriented codes such as Reed-Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this correspondence we present a special decoding technique for double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS …
Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski
Do We Really Need To Balance Patricia Tries?, Peter Kirschenhofer, Helmut Prodifger, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin
Parallel Construction Of A Suffix Tree With Applications, A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, U. Vishkin
Department of Computer Science Technical Reports
No abstract provided.
A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng
A Dynamic Majority Determination Algorithm For Reconfiguration Of Network Partitions, Bharat Bhargava, Peter Lei Ng
Department of Computer Science Technical Reports
No abstract provided.
Shells In An Interactive System, Balachander Krishnamurthy
Shells In An Interactive System, Balachander Krishnamurthy
Department of Computer Science Technical Reports
No abstract provided.
Supercomputing About Physical Objects, John R. Rice
Supercomputing About Physical Objects, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Automatic Parameterization Of Rational Curves And Surfaces Iv: Algebraic Space Curves, Shreeram S. Abhyankar, Chanderjit Bajaj
Automatic Parameterization Of Rational Curves And Surfaces Iv: Algebraic Space Curves, Shreeram S. Abhyankar, Chanderjit Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Power Series Solution To A Simple Pendulum With Oscillating Support, Mohammad Dadfar, James Geer
Power Series Solution To A Simple Pendulum With Oscillating Support, Mohammad Dadfar, James Geer
Computer Science Faculty Publications
The problem of determining some of the effects of a small forcing term on a regular perturbation solution to a nonlinear oscillation problem is studied via a simple example. In particular, we investigate the periodic solution of a simple pendulum with an oscillating support. A power series solution is constructed in terms of c-=( )2 L,where w0 and w are the natural and driving frequencies respectively, a is the amplitude of the support oscillation, and L is the length of the pendulum. These solutions are analyzed for three cases: above resonance (w > wo), below resonance (w < wo), and at resonance (w = wo). In each case, the approximate location of the nearest singularities which limit the convergence of the power series are obtained by using Pad6 approximants. Using this information, a new expansion parameter 6 is introduced, where the radius of convergence of the transformed series is greater than the original series. The effects of primary and higher order resonances on the convergence of the series solution is noted and discussed.
A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski
A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Convex Hull Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim
Convex Hull Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim
Department of Computer Science Technical Reports
No abstract provided.
Sorting With Efficient Use Of Special-Purpose Sorters, Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju
Sorting With Efficient Use Of Special-Purpose Sorters, Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju
Department of Computer Science Technical Reports
No abstract provided.
Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello
Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello
Research Collection School Of Computing and Information Systems
The performance of a concatenated coding scheme for error control in ARQ systems is analyzed for both random error and burst-error channels. In particular, the probability of undetected error and the system throughput are calculated. In this scheme, the inner code is used for both error correction and error detection, and the outer code is used for error detection only. Interleaving/deinterleaving of the outer code is assumed. A retransmission is requested if either the inner code or the outer code detects the Presence of errors. Various coding examples are considered. The results show that concatenated coding can provide extremely high …
An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo
An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo
Department of Computer Science Technical Reports
No abstract provided.
Reduced Coproducts Of Compact Hausdorff Spaces, Paul Bankston
Reduced Coproducts Of Compact Hausdorff Spaces, Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing with the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to …
Designing Networks With Compact Routing Tables Available In A Journal, Greg N. Frederickson, Ravi Janardan
Designing Networks With Compact Routing Tables Available In A Journal, Greg N. Frederickson, Ravi Janardan
Department of Computer Science Technical Reports
No abstract provided.
A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl
A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl
Department of Computer Science Technical Reports
No abstract provided.
Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin
Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin
Department of Computer Science Technical Reports
No abstract provided.
A Face Area Evaluation Algorithm For Solids In Csg Representation, Muh-Cherng Wu, Chanderjit Bajaj, C. R. Liu
A Face Area Evaluation Algorithm For Solids In Csg Representation, Muh-Cherng Wu, Chanderjit Bajaj, C. R. Liu
Department of Computer Science Technical Reports
No abstract provided.
Rise To Power Of Senator Joseph R. Mccarthy: Reflections Of The Cold War Mccarthy Era In American Film, Scott Lainer
Rise To Power Of Senator Joseph R. Mccarthy: Reflections Of The Cold War Mccarthy Era In American Film, Scott Lainer
Honors Theses
The common bond between much of the film industry and Joseph McCarthy was insecurity and the drive for national approval. If one grasps the specific characteristics of McCarthy the man, and the methods of these politically "inspired" movies, we can to better place the period into context and acknowledge the fact that, if the citizenry is not aware, and is again caught by an ever-building wave of trickle down sentiment, the 1950s might not prove to be an isolated period in American history. Insecurity was not a fifties novelty. It still exists, and could potentially escalate anti-Communist policy and sentiment …
A Representation For Serial Robotic Tasks, Barry Ross Fox, Arlan R. Dekock
A Representation For Serial Robotic Tasks, Barry Ross Fox, Arlan R. Dekock
Computer Science Technical Reports
The representation for serial robotic tasks proposed in this thesis is a language of temporal constraints derived directly from a model of the space of serial plans. It was specifically designed to encompass problems that include disjunctive ordering constraints. This guarantees that the proposed language can completely and, to a certain extent, compactly represent all possible serial robotic tasks. The generality of this language carries a penalty. The proposed language of temporal constraints is NP-Complete. Specific methods have been demonstrated for normalizing constraints posed in this language in order to make subsequent sequencing and analysis more tractable. Using this language, …
Triangulating A Polygon In Parallel, Michael T. Goodrich
Triangulating A Polygon In Parallel, Michael T. Goodrich
Department of Computer Science Technical Reports
No abstract provided.
Decompositions Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim
Decompositions Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim
Department of Computer Science Technical Reports
No abstract provided.
A Software Metrics Survey, S. D. Conte, Herbert E. Dunsmore, V. Y. Shen, W. M. Zage
A Software Metrics Survey, S. D. Conte, Herbert E. Dunsmore, V. Y. Shen, W. M. Zage
Department of Computer Science Technical Reports
No abstract provided.
Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski
Closed-Network Duals Of Multiques With Application To Token-Passing Systems, Vernon J. Rego, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Meta-Level Programming: A Compiled Approach, Hamid Bacha
Meta-Level Programming: A Compiled Approach, Hamid Bacha
Electrical Engineering and Computer Science - Technical Reports
There has been some intense research lately focused on the area of meta-level inference systems. In logic programming, the limitations of Prolog are widely recognized and a meta-level approach has been suggested. Unfortunately, only meta-interpreters have been considered so far. Moreover, these meta-interpreters are often themselves written on top of a Prolog interpreter. These cascaded layers of interpreters result in an enormous slow down, rendering the resulting system practically useless for all but a small number of toy applications. This paper will report on the implementation of a fast incremental metaProlog compiler. In the process, it will explore some of …
An Experimental Implementation Of The Tilde Naming System, Douglas E. Comer, Ralph E. Droms, Thomas P. Murtagh
An Experimental Implementation Of The Tilde Naming System, Douglas E. Comer, Ralph E. Droms, Thomas P. Murtagh
Department of Computer Science Technical Reports
No abstract provided.
A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson
A Logic Programming Model Of The Game Of Sprouts, Ralph M. Butler, Selden Y. Trimble, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
The Game of Sprouts Has Intrigued Mathematicians for Nearly Twenty Years. This Paper Describes a Representation Scheme Which Simplifies Much of the Geometry of the Game. using This Representation, We Develop a Prolog Program Which Will Play Sprouts. It is Hoped that the Program Will Prove to Be a Useful Research Tool in Finding the Key to a Winning Strategy for Sprouts and that the Representation Will Serve as a Useful Model for Studying Planar Graphs. © 1987, ACM. All Rights Reserved.
A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager
A Dynamic Caching Algorithm Based On C. C. Chang's Ordered Minimal Perfect Hashing Scheme, Thomas J. Sager
Computer Science Technical Reports
An algorithm for storage and retrieval in a small dynamic cache is presented. This algorithm is based on C.C. Chang’s ordered minimal perfect hashing scheme. Our algorithm has the property that it divides the set of objects that could occupy the cache into an arbitrary number of equivalence classes. The only restriction on which objects can occupy the cache are that no two objects in the same equivalence class can be in the cache at the same time. Retrieval from the cache is performed in constant time. Update of the cache is performed in logarithmic time.
An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa
An Attribute-Grammar Implementation Of Government-Binding Theory, Nelson Correa
Electrical Engineering and Computer Science - All Scholarship
The syntactic analysis of languages with respect to Government binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-le variant of Government "binding theory, briefly discussed by Chomsky (1981), in which the rule move-a is replaced by an interpretive rule. Here the interpretive rule is specified by …
Sorting And Selecting In Rounds, Nicholas Pippenger
Sorting And Selecting In Rounds, Nicholas Pippenger
All HMC Faculty Publications and Research
We present upper bounds for sorting and selecting the median in a fixed number of rounds. These bounds match the known lower bounds to within logarithmic factors. They also have the merit of being “explicit modulo expansion”; that is, probabilistic arguments are used only to obtain expanding graphs, and when explicit constructions for such graphs are found, explicit algorithms for sorting and selecting will follow. Using the best currently available explicit constructions for expanding graphs, we present the best currently known explicit algorithms for sorting and selecting in rounds.