Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9091)
- China Simulation Federation (3924)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2078)
-
- Old Dominion University (2035)
- Missouri University of Science and Technology (1929)
- University of Nebraska - Lincoln (1740)
- Edith Cowan University (1298)
- Air Force Institute of Technology (1283)
- University of Texas at El Paso (1198)
- Kennesaw State University (1175)
- Dartmouth College (1107)
- San Jose State University (1053)
- City University of New York (CUNY) (959)
- Embry-Riddle Aeronautical University (952)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (816)
- California Polytechnic State University, San Luis Obispo (788)
- Zayed University (690)
- University of Texas at Arlington (667)
- University for Business and Technology in Kosovo (637)
- Portland State University (630)
- Chulalongkorn University (618)
- Nova Southeastern University (579)
- New Jersey Institute of Technology (573)
- Syracuse University (532)
- University of Central Florida (501)
- University of Nebraska at Omaha (497)
- Keyword
-
- Machine learning (1686)
- Artificial intelligence (1038)
- Deep learning (1019)
- Machine Learning (831)
- Computer Science (723)
-
- Security (653)
- Cybersecurity (569)
- Artificial Intelligence (513)
- Deep Learning (469)
- Computer science (414)
- Privacy (414)
- Simulation (390)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (382)
- Algorithms (357)
- Optimization (356)
- Computer vision (355)
- Neural networks (347)
- Data mining (337)
- AI (309)
- Natural language processing (295)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (268)
- Reinforcement learning (262)
- Blockchain (260)
- Cloud computing (256)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8539)
- Journal of System Simulation (3924)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2742)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (945)
- Departmental Technical Reports (CS) (914)
- Computer Science Faculty Research & Creative Works (907)
- Master's Projects (859)
- Computer Science Technical Reports (772)
- The R Journal (708)
- All Works (688)
- All Computer Science and Engineering Research (683)
- Faculty Publications (655)
- C-Day Computing Showcase (653)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (618)
- Dissertations (573)
- Electronic Theses and Dissertations (567)
- Kno.e.sis Publications (542)
- Journal of Digital Forensics, Security and Law (536)
- CCAC Theses and Dissertations (514)
- Walden Dissertations and Doctoral Studies (469)
- Theses (407)
- Computer Science Faculty Publications and Presentations (406)
- USF Tampa Graduate Theses and Dissertations (398)
- Neutrosophic Systems with Applications (385)
- Computer Science and Engineering Theses - Archive (365)
- Student Works (2000-2009) (365)
- Browse all Theses and Dissertations (359)
- Publication Type
Articles 62911 - 62940 of 63883
Full-Text Articles in Entire DC Network
A Query Optimization Method For Use In A Generalized Database, Caroline D. Mautz
A Query Optimization Method For Use In A Generalized Database, Caroline D. Mautz
Masters Theses
Currently proposed methods for retrieval of records from a generalized file organization are not optimal, causing more I\0 retrievals than are necessary. This paper proposes another technique that has near optimal results and has a polynomial order of complexity.
The technique takes as input a query in disjunctive form, sorts the keys in the query in ascending order according to the number of records associated with them, then using a table much like a prime implicant table, systematically searches for a complete cover of the query conjuncts with a minimum total number of records associated with the keys that are …
A Model Of Syntax-Directed Transduction Of Unrestricted Grammars Using 2pda With Multisymbol Matching Production Rules, Steven William Cooke
A Model Of Syntax-Directed Transduction Of Unrestricted Grammars Using 2pda With Multisymbol Matching Production Rules, Steven William Cooke
Masters Theses
Syntax-directed transduction of unrestricted grammars is modeled by 2PDA automata with multisymbol matching production rules. Syntax-directed transduction normal form grammars (SDT) are constructed for unrestricted grammars. Transduction of sequences of derivation directives to sequences of derivation steps is defined for SDT grammars. E2PDA, a superset of 2PDA with input, output, and multi-symbol matching production rules, is formalized. The class of languages generated by unrestricted grammars. E2PDA syntax-directed transducers are conducted for SDT grammars.
Syntactic Representation And Analysis Of The Cognitive Structures Underlying Ritual Acts, Robert G. Hardin
Syntactic Representation And Analysis Of The Cognitive Structures Underlying Ritual Acts, Robert G. Hardin
Masters Theses
A formal grammar was proposed by Lawson and McCauley (1980) to model the cognitive structures underlying an informant's representation of religious ritual acts. This study classifies the language generated by that grammar as context-sensitive, presents an LR(1) parser for the language, and specifies a computer program to implement that model. The system functions as an Intelligent assistant using techniques involving rule-based systems, non-monotonic logic, and multiple levels of abstraction. Knowledge is represented in a parse tree, rules stored as patterns, and the inference engine uses a pattern matcher. The consequences of an act change over time and can change previous …
On Correspondence, Motion, Scale And Structure Of Two Views Of A Scene, Chia-Hoang Lee
On Correspondence, Motion, Scale And Structure Of Two Views Of A Scene, Chia-Hoang Lee
Department of Computer Science Technical Reports
No abstract provided.
The Costs And Benefits Of A Teaching Laboratory For The Operating Systems Course, Douglas E. Comer
The Costs And Benefits Of A Teaching Laboratory For The Operating Systems Course, Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.
Functions Returning Values Of Dynamic Size, Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David Alex Lamb
Functions Returning Values Of Dynamic Size, Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David Alex Lamb
Computer Science Technical Reports
Modern programming languages, such as Ada (Ichbiah 80), permit the definition of functions that return values whose size can not be determined until the function returns. This paper discusses five implementation techniques that can be used to implement this capability. Comparisons of the techniques are provided and guidelines for selecting a particular technique for a compiler are given.
Ellpack Project Status Report, John R. Rice, Wayne R. Dyksen, Elias N. Houstis, Calvin J. Ribbens
Ellpack Project Status Report, John R. Rice, Wayne R. Dyksen, Elias N. Houstis, Calvin J. Ribbens
Department of Computer Science Technical Reports
No abstract provided.
Generation Of Configuration Space Obstacles Ii: The Case Of Moving Algebraic Surfaces, Chanderjit Bqajajj, Myung-Soo Kim
Generation Of Configuration Space Obstacles Ii: The Case Of Moving Algebraic Surfaces, Chanderjit Bqajajj, Myung-Soo Kim
Department of Computer Science Technical Reports
No abstract provided.
Methods Of Factoring Large Integers, Samuel S. Wagstaff Jr, J. W. Smith
Methods Of Factoring Large Integers, Samuel S. Wagstaff Jr, J. W. Smith
Department of Computer Science Technical Reports
No abstract provided.
Some Results On V-Ary Asymmetric Tries, Wojciech Szpankowski
Some Results On V-Ary Asymmetric Tries, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Automatic Rational Parameterization Of Curves And Surfaces I: Conics And Conicoids, Shreeram S. Abhyankar, Chanderjit Bajaj
Automatic Rational Parameterization Of Curves And Surfaces I: Conics And Conicoids, Shreeram S. Abhyankar, Chanderjit Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura
Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura
All Computer Science and Engineering Research
The purpose of this report is to introduce essential features of the Show and Tell Language system to those computer users who are already familiar with some high-level programming language such as FORTRAN, BASIC or PASCAL. This manual is not intended for school children. Some familiarity with the Macintosh user interface and the MacPaint application program is assumed. It is also assumed that the Show and Tell application program disk and the Sample program are available to the reader. The basic programming concepts in Show and Tell are introduced in Chapter Three. The reader may find it easer to start …
A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura
A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura
All Computer Science and Engineering Research
In this paper we consider a problem of parsing a two-dimensional visual programming language Show and Tell on a two-dimensional array of processors. A program in Show and Tell is a bit-mapped, two-dimensional pattern satisfying a certain set of grammatical rules. The pattern consists of partially ordered set of rectilinear boxes and arrows distributed over the space of nxn pixel area. The corresponding directed graph, the box graph, where boxes are nodes and arrows are directed edges, may not have a cycle in a Show and Tell program. The cycle detection is the most computationally intensive stage of the parsing …
Early Cypress Performance Experiments, Douglas E. Comer, Gregory H. Smith
Early Cypress Performance Experiments, Douglas E. Comer, Gregory H. Smith
Department of Computer Science Technical Reports
No abstract provided.
The Design Of An Adaptable Distributed System, Bharat Bhargava, John Riedl
The Design Of An Adaptable Distributed System, Bharat Bhargava, John Riedl
Department of Computer Science Technical Reports
No abstract provided.
Instability Conditions Arising In Analysis Of Some Multiaccess Protocols, Wojciech Szpankowski, Vernon J. Rego
Instability Conditions Arising In Analysis Of Some Multiaccess Protocols, Wojciech Szpankowski, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
Two-Layer Channel Routing With Vertical Unit-Length Overlap, Shaodi Gao, Susanne E. Hambrusch
Two-Layer Channel Routing With Vertical Unit-Length Overlap, Shaodi Gao, Susanne E. Hambrusch
Department of Computer Science Technical Reports
No abstract provided.
Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee
Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee
Dartmouth Scholarship
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] takes $O(N^2 )$ worst-case and $O(N\log ^2 N)$ expected time. This paper presents an $O(N\log ^3 N)$ time, $O(N\log N)$ space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones …
Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist
Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist
Engineering Management and Systems Engineering Faculty Research & Creative Works
No abstract provided.
Performance Evaluation Modeling For Distributed Computing, Catherine E. Houstis, Elias N. Houstis, John R. Rice
Performance Evaluation Modeling For Distributed Computing, Catherine E. Houstis, Elias N. Houstis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Cypress Network Project Status Report, Douglas E. Comer, Thomas Narten
Cypress Network Project Status Report, Douglas E. Comer, Thomas Narten
Department of Computer Science Technical Reports
No abstract provided.
The Cypress Multifunction Packet Switch, Douglas E. Comer, Thomas Narten
The Cypress Multifunction Packet Switch, Douglas E. Comer, Thomas Narten
Department of Computer Science Technical Reports
No abstract provided.
An Architecture For A Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski
An Architecture For A Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
The Ellpack Performance Evaluation System, John P. Bonomo, Wayne R. Dyksen, John R. Rice
The Ellpack Performance Evaluation System, John P. Bonomo, Wayne R. Dyksen, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Analysis Of A Class Of Real-Time Control Systems, Dan Cristian Marinescu
Analysis Of A Class Of Real-Time Control Systems, Dan Cristian Marinescu
Department of Computer Science Technical Reports
No abstract provided.
Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu
Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu
Department of Computer Science Technical Reports
No abstract provided.
Evaluating Storage Management Schemes For Block Structured Languages, Thomas P. Murtagh
Evaluating Storage Management Schemes For Block Structured Languages, Thomas P. Murtagh
Department of Computer Science Technical Reports
No abstract provided.
Limitations To Algorithm Solvability: Galois Methods And Models Of Computation, Chanderjit Bajaj
Limitations To Algorithm Solvability: Galois Methods And Models Of Computation, Chanderjit Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Ua35/11 Student Honors Research Bulletin, Wku Honors Program
Ua35/11 Student Honors Research Bulletin, Wku Honors Program
WKU Administration Documents
The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.
- Padilla, Anne. First and Second Language Acquisition: A Comparison
- Scott, Angela. Salted and Unsalted Snacks: Taste Preferences of Second Grade Students in a Rural Area School
- Fuqua, Nancy. Acceptance by High School Students of Muffins Containing Supplemental Soy Polysaccharides
- Mans, Glee. Preference Levels of High School Freshmen for Four Cheese Food Products
- Denney, Pam. Consumer Acceptance of UHT Choclate Lowfat Milk
- Harris, Carla. Jacques-Louis David: Raphael of the Sansculottes
- Vaughn, James. Corporate Reorganization …
Alphabetic Minimax Trees Of Degree At Most T*, D. Coppersmith, Maria M. Klawe, Nicholas Pippenger
Alphabetic Minimax Trees Of Degree At Most T*, D. Coppersmith, Maria M. Klawe, Nicholas Pippenger
All HMC Faculty Publications and Research
Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction.