Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9079)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2078)
-
- Old Dominion University (2021)
- Missouri University of Science and Technology (1929)
- University of Nebraska - Lincoln (1740)
- Edith Cowan University (1287)
- Air Force Institute of Technology (1281)
- University of Texas at El Paso (1198)
- Kennesaw State University (1170)
- Dartmouth College (1105)
- San Jose State University (1053)
- City University of New York (CUNY) (958)
- Embry-Riddle Aeronautical University (950)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (817)
- California Polytechnic State University, San Luis Obispo (788)
- Zayed University (690)
- University of Texas at Arlington (666)
- University for Business and Technology in Kosovo (637)
- Portland State University (628)
- Chulalongkorn University (618)
- Nova Southeastern University (577)
- New Jersey Institute of Technology (573)
- Syracuse University (532)
- University of Nebraska at Omaha (497)
- University of Central Florida (495)
- Keyword
-
- Machine learning (1675)
- Artificial intelligence (1027)
- Deep learning (1014)
- Machine Learning (820)
- Computer Science (719)
-
- Security (653)
- Cybersecurity (567)
- Artificial Intelligence (512)
- Deep Learning (467)
- Computer science (413)
- Privacy (413)
- Simulation (390)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (380)
- Algorithms (357)
- Optimization (355)
- Computer vision (353)
- Neural networks (347)
- Data mining (337)
- AI (306)
- Natural language processing (295)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (268)
- Reinforcement learning (261)
- Blockchain (258)
- Cloud computing (256)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8531)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2736)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (942)
- 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)
- C-Day Computing Showcase (653)
- Faculty Publications (652)
- 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 (512)
- Walden Dissertations and Doctoral Studies (469)
- Computer Science Faculty Publications and Presentations (405)
- Theses (405)
- USF Tampa Graduate Theses and Dissertations (398)
- Neutrosophic Systems with Applications (380)
- Computer Science and Engineering Theses - Archive (365)
- Browse all Theses and Dissertations (359)
- Computer Science: Faculty Publications (352)
- Publication Type
Articles 61801 - 61830 of 63603
Full-Text Articles in Entire DC Network
The Effects Of Communication Latency Upon Synchronization And Dynamic Load Balance On A Hypercube, Dan C. Marinescu, John R. Rice
The Effects Of Communication Latency Upon Synchronization And Dynamic Load Balance On A Hypercube, Dan C. Marinescu, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Specification And Execution Of Transactions For Advanced Database Applications, Y. Leu, Ahmed K. Elmagarmid, N. Boudriga
Specification And Execution Of Transactions For Advanced Database Applications, Y. Leu, Ahmed K. Elmagarmid, N. Boudriga
Department of Computer Science Technical Reports
No abstract provided.
A Parallel Logic Language For Transaction Specification In Multidatabase Systems, Eva Kuhn, Ahmed K. Elmagarmid, Yungho Leu, Nourreddine Boudriga
A Parallel Logic Language For Transaction Specification In Multidatabase Systems, Eva Kuhn, Ahmed K. Elmagarmid, Yungho Leu, Nourreddine Boudriga
Department of Computer Science Technical Reports
No abstract provided.
Eclipse: A System For High Performance Concurrent Simulation, V. S. Sunderam, Vernon J. Rego
Eclipse: A System For High Performance Concurrent Simulation, V. S. Sunderam, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
An Overview Of The Virtual Memory Xinu Project, Douglas E. Comer, James Griffioen
An Overview Of The Virtual Memory Xinu Project, Douglas E. Comer, James Griffioen
Department of Computer Science Technical Reports
No abstract provided.
Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice
Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney
Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney
Electrical Engineering and Computer Science - Technical Reports
In this report, a fine-grained decomposition approach is used to obtain an optimal parallel solution to the Neighbor Localization Problem, which in turn is œ used to sort n θ(log n)-bit numbers optimally on an EREW model. The model of computation used is the EREW Reconfigurable PRAM (R-PRAM) that permits the use of “very small” processors. The main result of this report is a parallel EREW R-PRAM algorithm that sorts n θ(log n)-bit numbers in θ(log n) time with θ(n log n) “work”. The proposed algorithm is asymptotically optimal in time and efficiency. If a weaker variant of the R-PRAM …
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents an encoding algorithm to enable fast computation of the least upper bound (LUB) and greatest lower bound (GLB) of a partially ordered set. The algorithm presented reduces the LUB computation to an OR operation on the codes. The GLB computation is reduced essentially to an AND operation on the codes. The time complexity of our encoding algorithm is O(n + e) where n is the number of nodes and e is the number of edges. With respect to space requirements the algorithm presented gives good results for small lattices (code length was 50 bits for a 300 …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1990, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1990, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman
Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman
All Computer Science and Engineering Research
We define the logically synchronous multicast problem, which imposes a natural and useful structure on message delivery order in an asynchronous system. In this problem, a computation proceeds by a sequence of multicasts, in which a process sends a message to some arbitrary subset of the processes, including itself. A logically synchronously multicast protocol must make it appear to every process as if each multicast occurs simultaneously at all participants of that multicast (sender plus receivers). Furthermore, if a process continually wishes to sends a message, it must eventually be permitted to do so. We present a highly concurrent solution …
A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala
A Software Design Tool For Predictable Performance In Real-Time, Data Flow Architectures, Brij Mohan V. Mandala
Electrical & Computer Engineering Theses & Dissertations
A software design tool which aids in the performance evaluation and selection of operating points for an algorithm implemented in ATAMM defined data flow architectures is presented in this thesis. ATAMM (Algorithm To Architecture Mapping Model) is a new graph theoretic model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. A software tool is required for predicting the performance, determining the resource requirements and for selecting suitable operating points for an ATAMM based system. The ATAMM Design Tool presented in this …
A Framework For Intelligent Parallel Compilers, Ko-Yang Wang
A Framework For Intelligent Parallel Compilers, Ko-Yang Wang
Department of Computer Science Technical Reports
No abstract provided.
Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis
Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis
Department of Computer Science Technical Reports
No abstract provided.
Xinu On The Transputer, Douglas E. Comer, Victor Norman
Xinu On The Transputer, Douglas E. Comer, Victor Norman
Department of Computer Science Technical Reports
No abstract provided.
The Block Modified Accelerated Overrelaxation (Maor) Method For Generalized Consistently Ordered Matrices, A Hadjidimos, A. Psimarni, Y. G. Saridakis, A. K. Yeyios
The Block Modified Accelerated Overrelaxation (Maor) Method For Generalized Consistently Ordered Matrices, A Hadjidimos, A. Psimarni, Y. G. Saridakis, A. K. Yeyios
Department of Computer Science Technical Reports
No abstract provided.
Another Unified Approach To Some Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski
Another Unified Approach To Some Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Parallel Techniques For Computational Geometry, Mikhail J. Atallah
Parallel Techniques For Computational Geometry, Mikhail J. Atallah
Department of Computer Science Technical Reports
No abstract provided.
Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu
Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu
Department of Computer Science Technical Reports
No abstract provided.
Generalized Quasi Serializability Theory, Weimin Du, Ahmed K. Elmagarmid
Generalized Quasi Serializability Theory, Weimin Du, Ahmed K. Elmagarmid
Department of Computer Science Technical Reports
No abstract provided.
Maintaining Hddbs Consistence: The Quasi Serializability Approach, Ahmed K. Elmagarmid, Weimin Du
Maintaining Hddbs Consistence: The Quasi Serializability Approach, Ahmed K. Elmagarmid, Weimin Du
Department of Computer Science Technical Reports
No abstract provided.
How To Construct The Skeleton Of Csg Objects, Christoph M. Hoffmann
How To Construct The Skeleton Of Csg Objects, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel
A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel
Electrical Engineering and Computer Science - Technical Reports
A static analysis approach is proposed for automated detection of deadlocks in a common class of parallel programs, referred to as Single Code Multiple Data (SCMD) programs. It is based on colored Petri net (CP-net) modeling and reachability analysis, where colors correspond to parallel processes. An SCMD program is first translated into a CP-net and a reachability tree is then derived and analyzed for deadlock information. CP-subnets representing basic programming language constructs are described. These subnets are employed as building blocks by an algorithm that translates synchronization-related statements of a process in an SCMD program and connects the resulting subnets. …
An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel
An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel
Electrical Engineering and Computer Science - Technical Reports
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is based on an extension to Petri net-based techniques, where a concurrent program is modeled as a Petri net and a reachability graph is then derived and analyzed for desired information. In this approach, Predicate-Action subnets representing Ada programming constructs are described, where predicates and actions are attached to transitions. Predicates are those found in decision statements. Actions involve updating the status of the variables that affect the tasking behavior of the program and updating the Read and Write sets of shared variables. The shared …
A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri
A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri
Electrical Engineering and Computer Science - Technical Reports
A static analysis tool for detecting deadlocks and potential race conditions on shared variables in concurrent programs is presented. It is based on Petri Net modeling and reachability analysis, where a concurrent program is modeled as an augmented Petri net and a reachability graph is then derived and analyzed for desired information. Place-Transition subnets representing programming language constructs are described. Transitions in these subnets are augmented with sets of shared variables that occur in sections of the program, called concurrency zones, related to the transitions. The tool consists of four modules. The modeling module employs the augmented subnets as building …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan
Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
Modal formulas can be proved by translating them into a three-typed logic and then using unification and resolution, with axioms describing properties of the reachability relation among possible worlds. In this paper, we improve on the algorithms in [1], showing that "strong skolemisation" and occurrence checks are not needed for proving theorems of Q, T, Q4, and S4. We also extend the 'path logic' approach to S5, give the appropriate unification algorithm, and prove its correctness.
Surface Reasoning, William C. Purdy
Surface Reasoning, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
Surface reasoning is defined to be deduction conducted in the surface language in terms of certain primitive logical relations. The surface language is a spoken or written natural language (in this paper, English), in contrast to a "base language" or “deep structure" sometimes hypothesized to explain natural language phenomena. The primitive logical relations are inclusion, exclusion and overlap between classes of entities. A calculus for surface reasoning is presented. Then a model for reasoning in this calculus is developed. The model is similar to but more general than syllogistic. In this model, reasoning is represented as construction of fragments (subposets) …
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.
Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg
Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg
Mathematics, Statistics and Computer Science Faculty Research and Publications
Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers w as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on w. For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on w is …
Directory Location Service (Dls), Douglas E. Comer
Directory Location Service (Dls), Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.