Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9093)
- 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)
- Student Works (2000-2009) (374)
- Computer Science and Engineering Theses - Archive (365)
- Browse all Theses and Dissertations (359)
- Publication Type
Articles 63001 - 63030 of 63894
Full-Text Articles in Entire DC Network
A Generalized Information Structure To Be Used In A Human-Factors Knowledge Base, Bruce J. Wachlin
A Generalized Information Structure To Be Used In A Human-Factors Knowledge Base, Bruce J. Wachlin
Theses and Dissertations
The purpose of this thesis is to design a generalized information structure that can be used in a human-factors knowledge base. The information structure will take into account the human factors requirements and the hardware characteristics of the system. In this thesis the design and implementation of several prototype systems of a generalized information structure to be used in a human-factors knowledge base are presented.
A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni
A Queueing Model For Token-Passing Computer Networks, Vernon J. Rego, Lionel M. Ni
Department of Computer Science Technical Reports
No abstract provided.
Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes
Cycle-Time Distributions And Stability Of Adaptive Token-Passing Bus Networks, Vernon J. Rego, Herman D. Hughes
Department of Computer Science Technical Reports
No abstract provided.
Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego
Stability Problems In Local Area Networks: A Qualitative Approach, Wojciech Szpankowski, Dan Marinsecu, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski
On A Recurrence Equation Arising In The Analysis Of Conflict Resolution Algorithms, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski
Performance Evaluation Of Interval-Searching Conflict Resolution Algorithms, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
The Design And Implementation Of A High-Speed Incremental Portable Prolog Compiler, Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew Turk
The Design And Implementation Of A High-Speed Incremental Portable Prolog Compiler, Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew Turk
Electrical Engineering and Computer Science - Technical Reports
The design and implementation of a relatively portable Prolog compiler achieving 12K LIPS on the standard benchmark is described. The compiler is incremental and uses decompilation to implement retract, clause, and listing, as well as support the needs of its four-port debugger. The system supports modules, garbage collection, database pointers, and a full range of built-ins.
Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing
Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing
All Computer Science and Engineering Research
The high costs associated with logic simulation of large VLSI based systems have led to the need for new computer architectures tailored to the simulation task. Such architecture have the potential for significant speedups over standard software based logic simulators. Several commercial simulation engines have been produced to satisfy need in this area. To properly explore the space of alternative simulation architectures, data is required on the simulation process itself. This paper presents a framework for such data gathering activity by first examining possible sources of speedup in the logic simulation task, examining the sort of data needed in the …
Overloading Of Names In Distributed Systems, Douglas E. Comer, Ralph E. Droms
Overloading Of Names In Distributed Systems, Douglas E. Comer, Ralph E. Droms
Department of Computer Science Technical Reports
No abstract provided.
A Communication Sub-System For Mvs/Xa, Dan C. Marinescu
A Communication Sub-System For Mvs/Xa, Dan C. Marinescu
Department of Computer Science Technical Reports
No abstract provided.
An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski
An Analysis Of A Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski
Bounds For Queue Lengths In A Contention Packet Broadcast System, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski
Solution Of A Linear Recurrence Equation Arising In Analysis Of Some Algorithms, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle
Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle
Computer Science: Faculty Publications and Other Works
In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …
Structure And Motion Of A Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee, Azriel Rosenfeld
Structure And Motion Of A Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee, Azriel Rosenfeld
Department of Computer Science Technical Reports
No abstract provided.
The Myriad Virtues Of Subword Trees, Alberto Apostolico
The Myriad Virtues Of Subword Trees, Alberto Apostolico
Department of Computer Science Technical Reports
No abstract provided.
Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata
Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata
Department of Computer Science Technical Reports
No abstract provided.
Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata
Structural Properties Of The String Statistics Problem, A. Apostolico, F. P. Preparata
Department of Computer Science Technical Reports
No abstract provided.
Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel
Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel
Department of Computer Science Technical Reports
No abstract provided.
A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra
A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra
Department of Computer Science Technical Reports
No abstract provided.
Remark On Hsu-Du New Algorithm For The Lcs Problem, A. Apostolico
Remark On Hsu-Du New Algorithm For The Lcs Problem, A. Apostolico
Department of Computer Science Technical Reports
No abstract provided.
Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico
Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico
Department of Computer Science Technical Reports
No abstract provided.
The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra
The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra
Department of Computer Science Technical Reports
No abstract provided.
The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo
The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo
Department of Computer Science Technical Reports
No abstract provided.
Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap
Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap
Department of Computer Science Technical Reports
No abstract provided.
Adaptive Tensor Product Grids For Singular Problems, John R. Rice
Adaptive Tensor Product Grids For Singular Problems, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Efficient Algorithms For Common Transversals, Mikhail J. Atallah, Chanderjit Bajaj
Efficient Algorithms For Common Transversals, Mikhail J. Atallah, Chanderjit Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Design Of Multivariable Feedback Control Systems Via Spectral Assignment, Mohsen Marefat
Design Of Multivariable Feedback Control Systems Via Spectral Assignment, Mohsen Marefat
Electrical & Computer Engineering Theses & Dissertations
During the past 15 year s significant advances have been made towards developing viable synthesis- techniques for multivariable feedback control systems. The entire aggregate of this theoretical work has been reviewed and consolidated. Diverse notations have been standardized into a single system. A two-step design philosophy for spectral assignment has been developed which first meets stability and time response requirements by assigning eigenvalues and eigenvector s and then provides for attainment of secondary objectives without significant deviation from the initial assignment. Finally, a computer-aided design package has been created to streamline the process of mathematical calculation and to allow users …
High Performance Switching Circuits For Vlsi, Ali Reza Feizi
High Performance Switching Circuits For Vlsi, Ali Reza Feizi
Electrical & Computer Engineering Theses & Dissertations
Interconnection topology and device performance are of major concern in the design of LSI/VLSI systems, Pass networks are very suitable in this regard because of low power consumption, high density, and simple interconnection topology. A special type of pass networks called Binary Tree Structured (BTS) pass networks uses almost minimum number of transistors for the design of switching circuits. An algorithmic procedure is developed here for BTS pass networks which is very efficient in terms of both execution time and memory space. Based on these networks, the necessary and sufficient conditions are derived for the design of multiple-output pass networks. …
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …