Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (7226)
- China Simulation Federation (3382)
- TÜBİTAK (3020)
- Selected Works (2644)
- Wright State University (2602)
-
- Purdue University (2057)
- Old Dominion University (1456)
- Missouri University of Science and Technology (1360)
- Edith Cowan University (1172)
- Air Force Institute of Technology (1108)
- University of Texas at El Paso (1094)
- Dartmouth College (1017)
- San Jose State University (995)
- University of Nebraska - Lincoln (979)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (818)
- Technological University Dublin (792)
- Washington University in St. Louis (785)
- Brigham Young University (759)
- California Polytechnic State University, San Luis Obispo (731)
- Kennesaw State University (713)
- University for Business and Technology in Kosovo (626)
- University of Texas at Arlington (614)
- Nova Southeastern University (535)
- Portland State University (529)
- Western University (524)
- SelectedWorks (522)
- New Jersey Institute of Technology (511)
- Syracuse University (501)
- University of Nebraska at Omaha (484)
- Keyword
-
- Machine learning (1332)
- Deep learning (799)
- Artificial intelligence (653)
- Machine Learning (650)
- Computer Science (638)
-
- Security (620)
- Computer science (435)
- Cybersecurity (410)
- Privacy (408)
- Simulation (377)
- Classification (367)
- Technical Reports (358)
- UTEP Computer Science Department (356)
- Data mining (349)
- Deep Learning (346)
- Algorithms (336)
- Optimization (333)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (291)
- College for Professional Studies (253)
- Education (253)
- Software engineering (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (236)
- School of Computer & Information Science (236)
- Visualization (236)
- Social media (230)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6878)
- Journal of System Simulation (3382)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Theses and Dissertations (2498)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (881)
- Master's Projects (845)
- Electronic Theses and Dissertations (735)
- Computer Science Faculty Publications (724)
- All Computer Science and Engineering Research (683)
- Computer Science Technical Reports (673)
- Computer Science Faculty Research & Creative Works (595)
- Faculty Publications (585)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (507)
- Dissertations (500)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (467)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (463)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Theses (334)
- Electronic Thesis and Dissertation Repository (333)
- Computer Science and Software Engineering (332)
- USF Tampa Graduate Theses and Dissertations (320)
- Computer Science: Faculty Publications (316)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 56851 - 56880 of 57951
Full-Text Articles in Physical Sciences and Mathematics
Parallel And Vector Problems On The Flex/32, H S. Mcfaddin, John R. Rice
Parallel And Vector Problems On The Flex/32, H S. Mcfaddin, John R. Rice
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.
Perception Of A Quadrilaleral, Chia-Hoang Lee
Perception Of A Quadrilaleral, Chia-Hoang Lee
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.
A New Approach To The Dynamic Maintenance Of Maximal Points In A Plane, Greg N. Frederickson, Susan Rodger
A New Approach To The Dynamic Maintenance Of Maximal Points In A Plane, Greg N. Frederickson, Susan Rodger
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 …
The Performance Of Numerical Methods For Elliptic Problems With Mixed Boundary Conditions, Wayne R. Dyksen, Calvin J. Ribbens, John R. Rice
The Performance Of Numerical Methods For Elliptic Problems With Mixed Boundary Conditions, Wayne R. Dyksen, Calvin J. Ribbens, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
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 Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson
A Routing Algorithm For Three Stage Rearrangeable Clos Networks, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
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 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.
Lily-A Generator For Compiler Frontends, Thomas J. Sager
Lily-A Generator For Compiler Frontends, Thomas J. Sager
Computer Science Technical Reports
In this paper, LILY, a generator for compiler frontends is described. LILY uses a generator of minimal perfect hash functions, MPHF , to create small fast compilers.
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 …
Learning Object-Centered Representations, Peter Anthony Sandon
Learning Object-Centered Representations, Peter Anthony Sandon
Computer Science Technical Reports
When we look at a familiar object from a novel viewpoint, we are usually able to recognize it. In this thesis, we address the problem of learning to recognize objects under transformations associated with viewpoint. Our vision model combines a hierarchical representation of shape features with an explicit representation of the transformation. Shape features are represented in a layered pyramid-shaped subnetwork, while the transformation is explicitly represented in an auxiliary subnetwork. The two connectionist networks are conjunctively combined to allow object- centered shape features to be computed in the upper layers of the network. A simulation of a 2-D translation …
Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock
Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock
All Computer Science and Engineering Research
A fundamental need in future information systems is an effective method of accurately representing and monitoring dynamic, real-world situations inside a computer. Information is represented using an Extended Open World Assumption (EOWA), in which the data are explicitly true or false. Reasoning within the EOWA is done through the use of a dynamic dependency net which only represents those beliefs and justifications that are both currently valid and in current use. In this paper, we present definitions and uses of the EOWA and dynamic dependency net in our current research of developing a database with which we can use deductive …
Ff-Pade Method Of Model Reduction In Frequency Domain, H. Xiheng
Ff-Pade Method Of Model Reduction In Frequency Domain, H. Xiheng
Faculty of Informatics - Papers (Archive)
In this note the FF-Pade method based upon some new concepts in model reduction is presented. The new method will overcome the chief drawbacks of the current methods. Some typical examples are used to show convincingly that one has to break free from the conventional approaches in order to obtain better results in model reduction.
The Complexity Of Computations By Networks, Nicholas Pippenger
The Complexity Of Computations By Networks, Nicholas Pippenger
All HMC Faculty Publications and Research
We survey the current state of knowledge concerning the computation of Boolean functions by networks, with particular emphasis on the addition and multiplication of binary numbers.
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.
The Gradient Model Load Balancing Method, Frank C. H. Lin, Robert M. Keller
The Gradient Model Load Balancing Method, Frank C. H. Lin, Robert M. Keller
All HMC Faculty Publications and Research
A dynamic load balancing method is proposed for a class of large-diameter multiprocessor systems. The method is based on the "gradient model," which entails transferring backlogged tasks to nearby idle processors according to a pressure gradient indirectly established by requests from idle processors. The algorithm is fully distributed and asynchronous. Global balance is achieved by successive refinements of many localized balances. The gradient model is formulated so as to be independent of system topology.
The Computer As A Collection Management Tool, Suzanne B. Mclaren, Hugh H. Genoways, Duane A. Schlitter
The Computer As A Collection Management Tool, Suzanne B. Mclaren, Hugh H. Genoways, Duane A. Schlitter
University of Nebraska State Museum: Mammalogy Papers
Since the mid-1960s, discussion of computer use for information retrieval in museum collections has usually focused on research potential. Much attention has been given to the idea of networking and the ability to access data across great distances. However, the potential for collection management usage has also proven to be a legitimate rationale for computerization. Numerous aspects of collection management are discussed for which the computer may be employed. Topics include creating cross-reference files, updating taxonomic and geographic information, pinpointing mismatched specimens, locating lost and uncataloged material, controlling loan procedures, producing accession files for insurance purposes, curating all or part …
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.
Decoding Substitution Ciphers By Means Of Word Matching With Application To Ocr, George Nagy, Sharad C. Seth, Kent Einspahr
Decoding Substitution Ciphers By Means Of Word Matching With Application To Ocr, George Nagy, Sharad C. Seth, Kent Einspahr
School of Computing: Faculty Publications
A substitution cipher consists of a block of natural language text where each letter of the alphabet has been replaced by a distinct symbol. As a problem in cryptography, the substitution cipher is of limited interest, but it has an important application in optical character recognition. Recent advances render it quite feasible to scan documents with a fairly complex layout and to classify (cluster) the printed characters into distinct groups according to their shape. However, given the immense variety of type styles and forms in current use, it is not possible to assign alphabetical identities to characters of arbitrary size …
Decision Problems Resulting From Grammatical Inference, Sandor Horvath, Efim Kinber, Arto Salomaa, Sheng Yu
Decision Problems Resulting From Grammatical Inference, Sandor Horvath, Efim Kinber, Arto Salomaa, Sheng Yu
School of Computer Science & Engineering Faculty Publications
Grammatical inference is one of the classical areas of language theory.
A.R.M.S., Arbitrary Robot Modeling System, William Richard Gerlt
A.R.M.S., Arbitrary Robot Modeling System, William Richard Gerlt
Masters Theses
“This paper deals with the mathematical modeling of robot arms. Modeling robot arms includes finding a suitable way to describe a robot, turning the description into a mathematical system, and using the system to find a set of equations which can be used to control the robot.
One of the problems associated with robot modeling is that it involves a great deal of mathematics. When the process is done by hand, the large volume of mathematics makes the process very time consuming and prone to errors. These problems are part of the motivation for automating the modeling of robots.
ARMS …
Design And Performance Analysis Of A Relational Replicated Database Systems, Jon Gregory Hanson
Design And Performance Analysis Of A Relational Replicated Database Systems, Jon Gregory Hanson
Retrospective Theses and Dissertations
The hardware organization and software structure of a new database system are presented. This system, the relational replicated database system (RRDS), is based on a set of replicated processors operating on a partitioned database. Performance improvements and capacity growth can be obtained by adding more processors to the configuration. Based on designing goals a set of hardware and software design questions were developed. The system then evolved according to a five-phase process, based on simulation and analysis, which addressed and resolved the design questions. Strategies and algorithms were developed for data access, data placement, and directory management for the hardware …
The Slicing Extent Technique For Fast Ray Tracing, Sudhanshu Kumar Semwal
The Slicing Extent Technique For Fast Ray Tracing, Sudhanshu Kumar Semwal
Retrospective Theses and Dissertations
A new technique for image generation using ray tracing is introduced. The “Slicing Extent Technique” (SET) partitions object space with slicing planes perpendicular to all three axes. Planes are divided into two dimensional rectangular cells, which contain pointers to nearby objects. Cell size and the space between slices varies, and is determined by the objects’ locations and orientations. Unlike oct-tree and other space-partitioning methods, SET is not primarily concerned with dividing space into mutually exclusive volume elements (‘voxels’) and identifying objects within each voxel. Instead, SET is based on analysis of projections of objects onto slicing planes. In comparison to …
The Crisis Continues Among Computer-Science Faculty, Harlan D. Mills
The Crisis Continues Among Computer-Science Faculty, Harlan D. Mills
The Harlan D. Mills Collection
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
CCE 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 …
Strategic Planning For A Special Library, Donald A. Guerriero
Strategic Planning For A Special Library, Donald A. Guerriero
CCE Theses and Dissertations
STRATEGIC PLANNING FOR A SPECIAL LIBRARY
The Technical and Management Information Center of the U.S. Defense Communications Agency is a special library providing worldwide library and information services in the subject fields of communications, electronics, command and control, and computer sciences. A project was designed with the objective of developing a strategic plan for this library. Long-range and strategic planning methods commonly used in business organizations were used. An extensive review of the literature on strategic planning was done to determine the best methods available for use in a special library environment. The methods used to develop the strategic plan …