Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (5823)
- China Simulation Federation (3924)
- TÜBİTAK (2852)
- Missouri University of Science and Technology (1081)
- University of Nebraska - Lincoln (1079)
-
- Old Dominion University (931)
- Edith Cowan University (824)
- 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 (435)
- San Jose State University (371)
- Walden University (368)
- Dartmouth College (316)
- Marquette University (273)
- New Jersey Institute of Technology (264)
- Karbala International Journal of Modern Science (259)
- City University of New York (CUNY) (257)
- University of Nebraska at Omaha (257)
- MMU Press (252)
- Brigham Young University (238)
- Neutrosophic Systems with Applications (232)
- Smith College (208)
- Chulalongkorn University (207)
- Syracuse University (203)
- California Polytechnic State University, San Luis Obispo (198)
- Portland State University (196)
- Keyword
-
- Machine learning (855)
- Artificial intelligence (610)
- Deep learning (593)
- Machine Learning (351)
- Security (323)
-
- Cybersecurity (280)
- Computer Science (266)
- Artificial Intelligence (242)
- Simulation (240)
- Privacy (231)
- Classification (230)
- Deep Learning (212)
- Optimization (204)
- Neural networks (186)
- Data mining (182)
- Natural language processing (174)
- Technical Reports (166)
- UTEP Computer Science Department (166)
- AI (162)
- Blockchain (161)
- Computer science (157)
- Reinforcement learning (156)
- Algorithms (154)
- Cloud computing (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 (5570)
- 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 (421)
- Walden Dissertations and Doctoral Studies (365)
- Faculty Publications (339)
- Master's Projects (288)
- Karbala International Journal of Modern Science (259)
- Computer Science Technical Reports (254)
- Dissertations (253)
- Journal of Informatics and Web Engineering (252)
- Kno.e.sis Publications (232)
- Neutrosophic Systems with Applications (232)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (207)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (201)
- Research outputs 2022 to 2026 (197)
- Computer Science Faculty Publications and Presentations (194)
- Conference papers (190)
- Articles (187)
- Computer Science: Faculty Publications (170)
- Electrical and Computer Engineering Faculty Research & Creative Works (168)
- Computer Science and Engineering Faculty Publications (149)
- Journal of Cybersecurity Education, Research and Practice (149)
- Publication Type
Articles 31621 - 31650 of 31847
Full-Text Articles in Entire DC Network
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.
Nova University Doctor Of Education In Computer Education [1987], Nova University
Nova University Doctor Of Education In Computer Education [1987], Nova University
Abraham S. Fischler College of Education and School of Criminal Justice College Archive
No abstract provided.
Organization For Collection Development In Medium-Sized Academic Libraries, Carol W. Cubberley
Organization For Collection Development In Medium-Sized Academic Libraries, Carol W. Cubberley
CCAC Theses and Dissertations
At the University of Central Florida Library, the librarians with collection development assignments, and the Head of Collection Development, were frustrated in their attempts to fulfill their responsibilities. Those librarians did not report to the Department Head, but to other departments, and only a small percentage of their time was set aside for collection development. This meant that collection development duties frequently were deferred to other duties. There also was uncertainty about what duties could be expected of these librarians. Some functioned only as liaisons to academic departments, while others did extensive selection of material, wrote collection development policies, and …
Mpj: A Proposed Java Message Passing Api And Environment For High Performance Computing, Mark Baker, Bryan Carpenter
Mpj: A Proposed Java Message Passing Api And Environment For High Performance Computing, Mark Baker, Bryan Carpenter
Northeast Parallel Architecture Center
In this paper we sketch out a proposed reference implementation for message passing in Java (MPJ), an MPI-like API from the Message-Passing Working Group of the Java Grande Forum [1,2]. The proposal relies heavily on RMI and Jini for finding computational resources, creating slave processes, and handling failures. User-level communication is implemented efficiently directly on top of Java sockets.
Medial Axis Transform Using Ridge Following, Richard Mark Volkmann
Medial Axis Transform Using Ridge Following, Richard Mark Volkmann
Masters Theses
"The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …
Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter
Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter
Research Collection School Of Computing and Information Systems
This paper investigates changes in the process control of a vehicle assembly plant which had been modernized from a principally manual procedure to one that uses programmable automation extensively. Process control is defined as the information flow and decision-making required to perform basic process operations. We investigate the effects of implementing a computer-integrated production system on the amount and types of process control decision-making and on the distribution of process control decision-making between humans and machines. After automation, the emphasis on decisions regarding product quality specifications increased and the emphasis on decisions related to flexibility in handling a variety of …
Finding The Convex Hull Of A Sorted Point Set In Parallel, Michael T. Goodrich
Finding The Convex Hull Of A Sorted Point Set In Parallel, Michael T. Goodrich
Department of Computer Science Technical Reports
No abstract provided.
Finding Maximum Cliques On Circular-Arc Graphs, Alberto Apostolico, Susanne E. Hambrusch
Finding Maximum Cliques On Circular-Arc Graphs, Alberto Apostolico, Susanne E. Hambrusch
Department of Computer Science Technical Reports
No abstract provided.
An Efficient Algorithm For Maxdominance, With Applications, Mikhail J. Atallah, S. Rao Kosaraju
An Efficient Algorithm For Maxdominance, With Applications, Mikhail J. Atallah, S. Rao Kosaraju
Department of Computer Science Technical Reports
No abstract provided.
Efficient Message Routing In Planar Networks, Greg N. Frederickson, Ravi Janardan
Efficient Message Routing In Planar Networks, Greg N. Frederickson, Ravi Janardan
Department of Computer Science Technical Reports
No abstract provided.
Do We Really Know What Makes Educational Software Effective? A Call For Empirical Research On Effectiveness, Karen Jolicoeur, Dale E. Berger
Do We Really Know What Makes Educational Software Effective? A Call For Empirical Research On Effectiveness, Karen Jolicoeur, Dale E. Berger
CGU Faculty Publications and Research
Empirical information on specific factors that make educational software effective in reaching instructional objectives would be of considerable value. The authors describe the current state of evaluation research with educational software and discuss how popular software review methods fall short of meeting our need to know how well specific programs work.
Parallel Independent Set Algorithms For Sparse Graphs, Gregory Shannon
Parallel Independent Set Algorithms For Sparse Graphs, Gregory Shannon
Department of Computer Science Technical Reports
No abstract provided.
Computers And The Nature Of Man: A Historian's Perspective On Controversies About Artificial Intelligence, Judith V. Grabiner
Computers And The Nature Of Man: A Historian's Perspective On Controversies About Artificial Intelligence, Judith V. Grabiner
Pitzer Faculty Publications and Research
The purpose of the present paper is to provide a historical perspective on recent controversies, from Turing's time on, about artificial intelligence, and to make clear that these are in fact controversies about the nature of man. First, I shall briefly review three recent controversies about artificial intelligence, controversies over whether computers can think and over whether people are no more than information-processing machines. These three controversies were each initiated by philosophers who, irrespective of what the programs of their time actually did, viewed with alarm the argument that if a machine can think, a thinking being is just a …
Verification Of Loops And Exceptions, Ryan Stansifer
Verification Of Loops And Exceptions, Ryan Stansifer
Department of Computer Science Technical Reports
No abstract provided.
Patricia Tries Again Revisited, Wojciech Szpankowski
Patricia Tries Again Revisited, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Formal Grammar Approach To Human Factors Research, Herbert E. Dunsmore
A Formal Grammar Approach To Human Factors Research, Herbert E. Dunsmore
Department of Computer Science Technical Reports
No abstract provided.
The Presence Of Exponentiality In Entropy Maximised M/Gi/1 Queues, Vernon J. Rego, Wojciech Szpankowski
The Presence Of Exponentiality In Entropy Maximised M/Gi/1 Queues, Vernon J. Rego, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Automatic Parameterization Of Rational Curves And Surfaces Iii: Algebraic Plane Curves, Shreeram S. Abhyankar, Chanderjit L. Bajaj
Automatic Parameterization Of Rational Curves And Surfaces Iii: Algebraic Plane Curves, Shreeram S. Abhyankar, Chanderjit L. Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Parallel Algorithms For Some Functions Of Two Convex Polygons, Mikhail J. Atallah, Michael T. Goodrich
Parallel Algorithms For Some Functions Of Two Convex Polygons, Mikhail J. Atallah, Michael T. Goodrich
Department of Computer Science Technical Reports
No abstract provided.
Space-Efficient Message Routing In C-Decomposable Networks, Greg N. Frederickson, Ravi Janardan
Space-Efficient Message Routing In C-Decomposable Networks, Greg N. Frederickson, Ravi Janardan
Department of Computer Science Technical Reports
No abstract provided.
Centre For Computer Aided Management: An Overview, V B Kaujalagi
Centre For Computer Aided Management: An Overview, V B Kaujalagi
IIMB Management Review
No abstract provided.
Optimal Three-Dimensional Layouts Of Complete Binary Trees, Ajay K. Gupta, Susanne E. Hambrusch
Optimal Three-Dimensional Layouts Of Complete Binary Trees, Ajay K. Gupta, Susanne E. Hambrusch
Department of Computer Science Technical Reports
No abstract provided.
Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio
Quick Ceph™, A Computer Program For Cephalometric Analysis And Treatment Planning, Günther Blaseio
Loma Linda University Electronic Theses, Dissertations & Projects
The quantification of cephalometric radiographs is an integral part of orthodontic treatment planning. Numerous computer programs have been designed to digitize headfilms and to provide accurate graphic output and exact measurements. Yet these early systems were either huge, bulky and expensive or were limited in their practical use. The aim of this development was to combine modern computer and electronic equipment with advanced software engineering. The result is a universal cephalometric program written in the computer language "C" with presently seven standard and virtually limitless user definable analyses, growth forecasting, mouse-driven interactive VTO, arch length calculation, superimpositions, table of values …
Convergence Of O(H**4) Cubic Spline Collocation Methods For Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, John R. Rice
Convergence Of O(H**4) Cubic Spline Collocation Methods For Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim
Generation Of Configuration Spaces Iii: The Case Of Moving Algebraic Curves, Changerjit Bajaj, Myung-Soo Kim
Department of Computer Science Technical Reports
No abstract provided.