Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (17307)
- Computer Engineering (13035)
- Artificial Intelligence and Robotics (11145)
- Databases and Information Systems (7250)
- Numerical Analysis and Scientific Computing (6663)
-
- Electrical and Computer Engineering (5273)
- Social and Behavioral Sciences (4823)
- Operations Research, Systems Engineering and Industrial Engineering (4777)
- Information Security (4669)
- Software Engineering (4315)
- Systems Science (3920)
- Business (2515)
- Mathematics (2384)
- Graphics and Human Computer Interfaces (2372)
- Theory and Algorithms (2151)
- Education (2099)
- Life Sciences (2075)
- Programming Languages and Compilers (1844)
- Medicine and Health Sciences (1803)
- Other Computer Sciences (1793)
- OS and Networks (1759)
- Arts and Humanities (1456)
- Communication (1446)
- Law (1176)
- Data Science (1157)
- Applied Mathematics (1134)
- Statistics and Probability (1061)
- Bioinformatics (986)
- Institution
-
- Singapore Management University (9003)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (1996)
- Missouri University of Science and Technology (1938)
- University of Nebraska - Lincoln (1739)
- Edith Cowan University (1285)
- Air Force Institute of Technology (1277)
- University of Texas at El Paso (1174)
- Kennesaw State University (1161)
- Dartmouth College (1103)
- San Jose State University (1053)
- City University of New York (CUNY) (956)
- Embry-Riddle Aeronautical University (950)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (816)
- California Polytechnic State University, San Luis Obispo (788)
- Zayed University (677)
- University of Texas at Arlington (666)
- University for Business and Technology in Kosovo (637)
- Portland State University (625)
- Chulalongkorn University (618)
- Nova Southeastern University (577)
- New Jersey Institute of Technology (571)
- Syracuse University (532)
- University of Nebraska at Omaha (497)
- University of Central Florida (490)
- Keyword
-
- Machine learning (1665)
- Artificial intelligence (1019)
- Deep learning (1003)
- Machine Learning (757)
- Computer Science (702)
-
- Security (648)
- Cybersecurity (557)
- Artificial Intelligence (485)
- Deep Learning (433)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (375)
- Algorithms (357)
- Optimization (352)
- Computer vision (349)
- Neural networks (345)
- Data mining (337)
- AI (299)
- Natural language processing (293)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (268)
- Reinforcement learning (259)
- Blockchain (255)
- Cloud computing (255)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8458)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2733)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (928)
- Computer Science Faculty Research & Creative Works (919)
- Departmental Technical Reports (CS) (914)
- Master's Projects (859)
- Computer Science Technical Reports (772)
- The R Journal (708)
- All Computer Science and Engineering Research (683)
- All Works (675)
- Faculty Publications (663)
- C-Day Computing Showcase (653)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (618)
- Dissertations (568)
- Electronic Theses and Dissertations (567)
- Kno.e.sis Publications (542)
- Journal of Digital Forensics, Security and Law (536)
- CCAC Theses and Dissertations (512)
- Walden Dissertations and Doctoral Studies (469)
- Computer Science Faculty Publications and Presentations (404)
- Theses (403)
- USF Tampa Graduate Theses and Dissertations (378)
- Neutrosophic Systems with Applications (375)
- Computer Science and Engineering Theses - Archive (365)
- Computer Science: Faculty Publications (364)
- Browse all Theses and Dissertations (359)
- Publication Type
Articles 62521 - 62550 of 63017
Full-Text Articles in Computer Sciences
An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett
An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett
All Computer Science and Engineering Research
A semantic data model is introduced with the following capabilities: (1) Abstraction mechanisms for aggregation, generalization and classification, (2) Unstratified control of the database content, (3) Refined control of intentional and extensional information, and (4) Extensive semantic consistency checking. The basic features of the model are illustrated through a scenario of interactions between the user and the database system (using the proposed model) for constructing a simple database on technical publications.
Introduction To The Configurable, Highly Parallel (Chip) Computer), Lawrence Snyder
Introduction To The Configurable, Highly Parallel (Chip) Computer), Lawrence Snyder
Department of Computer Science Technical Reports
No abstract provided.
Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki
Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki
All Computer Science and Engineering Research
We have developed a formal model of a database system that is unusual in that it has the ability to represent information about its own structure and to insure semantic consistency. The model distinguishes general laws from instances of events and objects, but many of its mechanisms serve both categories of information. The model form a substrate upon which an information structure appropriate to neonatology is being developed. Some example queries are shown and a design study for an associative memory suggested by the model is described briefly.
Hierarchical Analysis Of A Distributed Evaluator, Robert M. Keller, Gary Lindstrom
Hierarchical Analysis Of A Distributed Evaluator, Robert M. Keller, Gary Lindstrom
All HMC Faculty Publications and Research
We outline the analysis of a distributed evaluator for an applicative language FGL (Function Graph Language). Our goal is to show that the least fixed point semantics of FGL are faithfully implemented by the hardware evaluator envisioned in the Applicative Multi-Processor System AMPS. Included in the analysis are a formalization of demand-driven computation , the introduction of an intermediate graphic language IGL to aid in our proofs, and discussion of pragmatic issues involved in the AMPS machine language design.
Research In Secure Computing (Final Report), Dorothy E. Denning, Peter J. Denning
Research In Secure Computing (Final Report), Dorothy E. Denning, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
A Note On The Semantics Of Looping Programs In Propositional Dynamic Logic, Francine Berman
A Note On The Semantics Of Looping Programs In Propositional Dynamic Logic, Francine Berman
Department of Computer Science Technical Reports
No abstract provided.
Bounds On The Number Of Samples Needed For Neural Learning, Kishan G. Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Bounds On The Number Of Samples Needed For Neural Learning, Kishan G. Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper addresses the relationship between the number of hidden layer nodes in a neural network, the complexity of a multi-class discrimination problem, and the number of samples needed for effective learning. Bounds are given for the latter. We show that Ω(min(d,n).M) boundary samples are required for successful classification of M clusters of samples using a 2 hidden layer neural network with d-dimensional inputs and n nodes in the first hidden layer.
Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 2, No. 1, Wku Mathematics & Computer Science
Ua66/16/2 Ogden Instructional Computing Newsletter, Vol. 2, No. 1, Wku Mathematics & Computer Science
WKU Administration Documents
Newsletter created by the Ogden Computer Laboratory to promote services, courses, hardware, software and student activities.
A Tale Of Two Islands (A Fable), Peter J. Denning
A Tale Of Two Islands (A Fable), Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
High Order Methods For Elliptic Partial Differential Equations With Singularities, Elias N. Houstis, John R. Rice
High Order Methods For Elliptic Partial Differential Equations With Singularities, Elias N. Houstis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Effects Of Changes In Surface Water Regime And/Or Land Use On The Vertical Distribution Of Water Available For Wetland Vegetation: Dynamic Model Of The Zone Of Aeration (Appendix To Part 1 Of Completion Report For Project A-023-Ark), Robert N. Maccallum, R. A. Sims
Effects Of Changes In Surface Water Regime And/Or Land Use On The Vertical Distribution Of Water Available For Wetland Vegetation: Dynamic Model Of The Zone Of Aeration (Appendix To Part 1 Of Completion Report For Project A-023-Ark), Robert N. Maccallum, R. A. Sims
Arkansas Water Resources Center Technical Reports
Appendix to Part 1 of Completion Report for Project A-023-ARK
Computing Cyclic List Structures, F. Lockwood Morris, Jennifer Schwarz
Computing Cyclic List Structures, F. Lockwood Morris, Jennifer Schwarz
Electrical Engineering and Computer Science - Technical Reports
It is argued that list structures containing cycles are useful and unobjectionable Lisp entities. If this is so, it is desirable to have a means of computing them less foreign to the equational-definition style characteristic of Lisp than are the list-structure-altering primitives rplaca and rplacd. A notion is developed of a reasonable system of mutually recursive equations, guaranteed to have a unique solution in list structures. The notion is given in terms of the computations invoked by the equations, without reference to the forms of expressions appearing in them. A variety of programming examples are presented, including a curious implementation …
Principles, Preferences And Ideals For Computer Arithmetic, Thomas E. Hull, Christian H. Reinsch, John R. Rice
Principles, Preferences And Ideals For Computer Arithmetic, Thomas E. Hull, Christian H. Reinsch, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Principles Of Program Design Induced From Experience With Small, Public Programs, Douglas E. Comer
Principles Of Program Design Induced From Experience With Small, Public Programs, Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.
Operating Systems Articles, Peter J. Denning, Dorothy E. Denning
Operating Systems Articles, Peter J. Denning, Dorothy E. Denning
Department of Computer Science Technical Reports
No abstract provided.
A Critique Of The Foundations Of Hoare-Style Programming Logics, Michael O'Donnell
A Critique Of The Foundations Of Hoare-Style Programming Logics, Michael O'Donnell
Department of Computer Science Technical Reports
No abstract provided.
A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous
A Dimensionality Reduction Algorithm For The Karhunen Loeve Transform, Salomi T. Charalambous
Computational Modeling & Simulation Engineering Theses & Dissertations
The Karhunen Loeve Transform has conclusively been shown to be the optimum data compression algorithm for signals belonging to the same second order stationary process. Consequently, researchers have been searching for a fast implementation for the transform. Fast implementation methods similar to those developed for other orthogonal transforms are generally not applicable to the Karhunen Loeve Transform (KLT). Also, since the basis vectors composing the transformation matrix of the KLT are the eigenvectors of the covariance matrix of the input process, they must be computed first. The research re ported here is an attempt to reduce the dimensionality of the …
Experience With Transporting Pascal To An Interactive Environment, Douglas E. Comer, John Garney
Experience With Transporting Pascal To An Interactive Environment, Douglas E. Comer, John Garney
Department of Computer Science Technical Reports
No abstract provided.
Operational Analysis Based On Minimal Information: A Hypothetical Case Study, Herb Schwetman
Operational Analysis Based On Minimal Information: A Hypothetical Case Study, Herb Schwetman
Department of Computer Science Technical Reports
No abstract provided.
Programming With Recursion, Dirk Siefkes
Programming With Recursion, Dirk Siefkes
Department of Computer Science Technical Reports
No abstract provided.
Low Contention Semaphores And Ready Lists, Peter J. Denning, T. Don Dennis, Jeffrey Brumfield
Low Contention Semaphores And Ready Lists, Peter J. Denning, T. Don Dennis, Jeffrey Brumfield
Department of Computer Science Technical Reports
No abstract provided.
Using The Purdue Procsy Terminal System (Fortran), Bob Brown
Using The Purdue Procsy Terminal System (Fortran), Bob Brown
Department of Computer Science Technical Reports
No abstract provided.
Using The Purdue Procsy Terminal System (Pascal), Bob Brown
Using The Purdue Procsy Terminal System (Pascal), Bob Brown
Department of Computer Science Technical Reports
No abstract provided.
An Information Theoretic Approach To The Construction Of Efficient Decision Trees, Jaime M. De Faria, Carlos R.P. Hartmann, Carl L. Gerberich, Pramod Varshney
An Information Theoretic Approach To The Construction Of Efficient Decision Trees, Jaime M. De Faria, Carlos R.P. Hartmann, Carl L. Gerberich, Pramod Varshney
Electrical Engineering and Computer Science - Technical Reports
This paper treats the problem of construction of efficient decision trees. Construction of optimal decision trees is an NP-complete problem and, therefore, a heuristic approach for the design of efficient decision trees is considered. The approach is based on information theoretic concepts and the proposed algorithm provides us with a simple procedure for the construction of near-optimal decision trees.
Comparative Schematology And Pebbling With Auxiliary Pushdowns, Nicholas J. Pippenger
Comparative Schematology And Pebbling With Auxiliary Pushdowns, Nicholas J. Pippenger
All HMC Faculty Publications and Research
This paper has three claims to interest. First, it combines comparative schematology with complexity theory. This combination is capable of distinguishing among Strong's “languages of maximal power,” a distinction not possible when comparative schematology is based on computability considerations alone, and it is capable of establishing exponential disparities in running times, a capability not currently possessed by complexity theory alone. Secondly, this paper inaugurates the study of pebbling with auxiliary pushdowns, which bears to plain pebbling the same relationship as Cook's study of space-bounded machines with auxiliary pushdowns bears to plain space-bounded machines. This extension of pebbling serves as the …
Design And Use Of A Computerized Test Generating Program, Edward Schaefer, Laurence A. Marschall
Design And Use Of A Computerized Test Generating Program, Edward Schaefer, Laurence A. Marschall
Physics and Astronomy Faculty Publications
An easy-to-use set of programs for the computerized generation of multiple-choice and easy examinations in an introductory astronomy course is described. The programs allow the user to establish files of test questions and to rapidly assemble printed copies of examinations suitable for photocopying. Written in ALGOL for a Burroughs B6700 computer, the programs can, in principle, be implemented on large mainframe computers or on microcomputers of a size increasingly available to physics departments. The advantages and costs of computerized test generation are discussed.
On The Evaluation Of Powers And Monomials, Nicholas Pippenger
On The Evaluation Of Powers And Monomials, Nicholas Pippenger
All HMC Faculty Publications and Research
Let $y_1 , \cdots ,y_p $ be monomials over the indeterminates $x_1 , \cdots ,x_q $. For every $y = (y_1 , \cdots ,y_p )$ there is some minimum number $L(y)$ of multiplications sufficient to compute $y_1 , \cdots ,y_p $ from $x_1 , \cdots ,x_q $ and the identity 1. Let $L(p,q,N)$ denote the maximum of $L(y)$ over all $y$ for which the exponent of any indeterminate in any monomial is at most $N$. We show that if $p = (N + 1^{o(q)} )$ and $q = (N + 1^{o(p)} )$, then $L(p,q,N) = \min \{ p,q\} \log N …
Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Applications [No Date], Nova University
Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Applications [No Date], Nova University
Abraham S. Fischler College of Education and School of Criminal Justice College Archive
No abstract provided.
Economic Comparison Of Alternative Burley Tobacco Harvesting Practices By Computer, Thomas C. Bridges, Larry G. Wells, George A. Duncan, John N. Walker
Economic Comparison Of Alternative Burley Tobacco Harvesting Practices By Computer, Thomas C. Bridges, Larry G. Wells, George A. Duncan, John N. Walker
Biosystems and Agricultural Engineering Faculty Publications
The computer model CATCH (Computer Analysis of Tobacco Cutting and Housing) was developed to provide the individual tobacco producer with management information concerning alternative methods of harvesting burley tobacco. CATCH utilizes specific producer in-puts to analyze 24 alternative burley production systems and presents up to four economic rankings containing costs, equipment and labor for each system. The economic rankings aid the producer in decision making with regard to his own operation.
On Increasing Confidence In Confidence Intervals, Peter J. Denning
On Increasing Confidence In Confidence Intervals, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.