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 (7242)
- China Simulation Federation (3382)
- TÜBİTAK (3020)
- Selected Works (2644)
- Wright State University (2602)
-
- Purdue University (2057)
- Old Dominion University (1458)
- Missouri University of Science and Technology (1360)
- Edith Cowan University (1173)
- Air Force Institute of Technology (1108)
- University of Texas at El Paso (1105)
- Dartmouth College (1022)
- San Jose State University (995)
- University of Nebraska - Lincoln (979)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (819)
- Technological University Dublin (792)
- Washington University in St. Louis (785)
- Brigham Young University (759)
- California Polytechnic State University, San Luis Obispo (732)
- Kennesaw State University (714)
- University for Business and Technology in Kosovo (626)
- University of Texas at Arlington (614)
- Nova Southeastern University (535)
- Portland State University (529)
- SelectedWorks (527)
- Western University (525)
- New Jersey Institute of Technology (516)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1337)
- Deep learning (800)
- Artificial intelligence (657)
- Machine Learning (650)
- Computer Science (637)
-
- Security (618)
- Computer science (434)
- Privacy (409)
- Cybersecurity (407)
- Simulation (379)
- Technical Reports (369)
- Classification (368)
- UTEP Computer Science Department (367)
- Deep Learning (349)
- Data mining (348)
- Algorithms (337)
- Optimization (337)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (290)
- Software engineering (254)
- College for Professional Studies (253)
- Education (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (236)
- School of Computer & Information Science (236)
- Visualization (236)
- Natural language processing (232)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6890)
- 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) (892)
- Master's Projects (845)
- Electronic Theses and Dissertations (738)
- Computer Science Faculty Publications (725)
- All Computer Science and Engineering Research (683)
- Computer Science Technical Reports (673)
- Computer Science Faculty Research & Creative Works (595)
- Faculty Publications (588)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (507)
- Dissertations (505)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (468)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (463)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Electronic Thesis and Dissertation Repository (334)
- Theses (334)
- Computer Science and Software Engineering (332)
- USF Tampa Graduate Theses and Dissertations (320)
- Computer Science: Faculty Publications (318)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 54301 - 54330 of 57995
Full-Text Articles in Physical Sciences and Mathematics
Bit-Sequences: A New Cache Invalidation Method In Mobile Environments, Jin Jing, Ahmed K. Elmagarmid, Abdelsalam Helal, Rafael Alonso
Bit-Sequences: A New Cache Invalidation Method In Mobile Environments, Jin Jing, Ahmed K. Elmagarmid, Abdelsalam Helal, Rafael Alonso
Department of Computer Science Technical Reports
No abstract provided.
Inverse Pattern Matching, Amihood Amir, Alberto Apostolico, Moshe Lewenstein
Inverse Pattern Matching, Amihood Amir, Alberto Apostolico, Moshe Lewenstein
Department of Computer Science Technical Reports
No abstract provided.
Migrant Threads On Process Farms: Parallel Programming With Ariadne*, Edward Mascarenhas, Vernon Rego
Migrant Threads On Process Farms: Parallel Programming With Ariadne*, Edward Mascarenhas, Vernon Rego
Department of Computer Science Technical Reports
No abstract provided.
Lightweight Write Detection And Checkpointing For Fine-Grained Persistence, Antony L. Hosking, J. Eliot B. Moss
Lightweight Write Detection And Checkpointing For Fine-Grained Persistence, Antony L. Hosking, J. Eliot B. Moss
Department of Computer Science Technical Reports
No abstract provided.
The New Jersey Machine-Code Toolkit, Norman Ramsey, Mary F. Fernáyesndez
The New Jersey Machine-Code Toolkit, Norman Ramsey, Mary F. Fernáyesndez
Department of Computer Science Technical Reports
No abstract provided.
Sliced Configuration Spaces For Curved Planar Bodies, Elisha Sacks, Chandrajit Bajaj
Sliced Configuration Spaces For Curved Planar Bodies, Elisha Sacks, Chandrajit Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Kenematic Tolerance Analysis, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan
Kenematic Tolerance Analysis, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan
Department of Computer Science Technical Reports
No abstract provided.
Partitioned Data Management In Mobile Environments, Ahmed K. Elmagarmid, Jin Jing, Abdelsalam Helal, Rafael Alonso
Partitioned Data Management In Mobile Environments, Ahmed K. Elmagarmid, Jin Jing, Abdelsalam Helal, Rafael Alonso
Department of Computer Science Technical Reports
No abstract provided.
Pattern Matching Image Compression: Algorithmic And Empirical Results, Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski
Pattern Matching Image Compression: Algorithmic And Empirical Results, Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan
Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan
Kno.e.sis Publications
This paper presents an approach for integrating simulation modeling and analysis capabilities within the workflow management system (WFMS) being developed in the Large Scale Distributed Information Systems (LSDIS) Lab at the University of Georgia. Simulation modeling can be used for studying the efficiency of workflow designs as well as studying the general performance and reliability of WFMSs. We also discuss the importance of using sophisticated monitoring and animation capabilities, and the use of workflow management technology to advance simulation technology itself. Finally, we demonstrate a sample simulation where tasks and task managers are simulated.
An Object-Oriented, Formal Methods Approach To Organizational Process Modeling, Vincent S. Hibdon
An Object-Oriented, Formal Methods Approach To Organizational Process Modeling, Vincent S. Hibdon
Theses and Dissertations
This document presents a methodology for developing an organizational process model which is based on the principles of object oriented design and formal software engineering methods. The methodology begins with the development of an object oriented Rumbaugh model (27). The Rumbaugh model is then formally specified in Z (Zed) schemas. Finally, the Z specifications are translated into an executable model in the Software Refinery Environment(TM). This model is described based on the AF wing domain and developed in this domain. The proposed methodology is then shown to produce a very general model which is extendable across almost any domain. The …
Temporal Influence On Awareness, Don E. Hill
Temporal Influence On Awareness, Don E. Hill
Theses and Dissertations
Grossberg's Motion Oriented Contrast Filter (MOC) was extensively analyzed (7). The output from the filter's "global motion" neuronal layer was compared to a noncausal post-processing filter developed by AFIT. Both filters were shown to incorporate a weighted, noncausal temporal range of input data in processed output. The global motion framework was then implemented using a physiologically motivated pulsed neural model - the Pulse Coupled Neural Network (PCNN). By incorporating both spatial and temporal data, the PCNN was shown to exhibit a common visual illusion, apparent motion. The existence of a physiological temporal processing range was further investigated through implementation of …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 10, December 1995, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 10, December 1995, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Dynamic Transfer Of Control Between Manned And Unmanned Simulation Actors, Neal W. Schneider
Dynamic Transfer Of Control Between Manned And Unmanned Simulation Actors, Neal W. Schneider
Theses and Dissertations
This thesis continues the ongoing research at the Air Force Institute of Technology's Virtual Environments Laboratory in the area of distributed simulation. As the relevance and interest of interactive simulation as a training medium continues to grow, there is a pressing need to provide more realistic and numerous intelligent autonomous agents for simulations. As those autonomous agents mature and become more realistic, the need exists to be able to handle individual agents by taking control of them and operating them as manned agents at certain points within the simulation. The author started with a protocol proposed in a working draft …
Dynamics Of Binary Liquids In Pores, J.C. Lee
Dynamics Of Binary Liquids In Pores, J.C. Lee
Faculty Publications
A computer simulation is performed to study the dynamics of binary liquids in the pores of Vycor glasses. The pores are modeled with glass walls that form randomly interconnected tunnels. When the relaxation is probed with a particular wavelength, the time autocorrelation function depends on whether or not there is a significant periodic or quasiperiodic structure in the distribution of the walls with that wavelength. If there is not, the relaxation may be fitted as the sum of an exponential term and a nonexponential activated term. If there is, the relaxation shows a long-lasting tail that can be fitted by …
Objectism 3.0: A Software Architecture For The Development Of Portable Visual Simulation Applications, Shawn M. Hannan
Objectism 3.0: A Software Architecture For The Development Of Portable Visual Simulation Applications, Shawn M. Hannan
Theses and Dissertations
A visual simulation software architecture is a reusable design for visual simulation applications. This thesis effort was the third stage in an ongoing refinement of such an architecture, named ObjectSim. The primary goals of this stage were to improve the architecture by eliminating its dependence on two platform-specific graphics libraries (named GL and Performer, from Silicon Graphics, Inc.), and to examine the potential for expanding the architecture to accommodate distributed simulations. The effort resulted in a new version of the architecture which allows the development of visual simulation applications which take full advantage of the aforementioned libraries without calling those …
Transforming Algebraically-Based Object Models Into A Canonical Form For Design Refinement, Charles G. Beem
Transforming Algebraically-Based Object Models Into A Canonical Form For Design Refinement, Charles G. Beem
Theses and Dissertations
The understandability of object-oriented design techniques and the rigor of formal methods have improved the state of software development; however, both ideas have limitations. Object-oriented techniques, which are semi-formal, can still result in incorrect designs, while formal methods are complex and require an extensive mathematical background. The two approaches can be coupled, however, to produce designs that are both understandable and verifiable, and to produce executable code. This research proposes an approach where object-oriented models are first represented algebraically in a formal specification language such as LARCH and then transformed into a canonical form suitable for design refinement. In the …
The Application Of Hybridized Genetic Algorithms To The Protein Folding Problem, Robert L. Gaulke
The Application Of Hybridized Genetic Algorithms To The Protein Folding Problem, Robert L. Gaulke
Theses and Dissertations
The protein folding problem consists of attempting to determine the native conformation of a protein given its primary structure. This study examines various methods of hybridizing a genetic algorithm implementation in order to minimize an energy function and predict the conformation (structure) of Met-enkephalin. Genetic Algorithms are semi-optimal algorithms designed to explore and exploit a search space. The genetic algorithm uses selection, recombination, and mutation operators on populations of strings which represent possible solutions to the given problem. One step in solving the protein folding problem is the design of efficient energy minimization techniques. A conjugate gradient minimization technique is …
Neural Network Analysis Of Chemical Compounds In Nonrebreathing Fisher-344 Rat Breath, Robert E. Sackett Jr.
Neural Network Analysis Of Chemical Compounds In Nonrebreathing Fisher-344 Rat Breath, Robert E. Sackett Jr.
Theses and Dissertations
This research applies statistical and artificial neural network analysis to data obtained from measurement of organic compounds in the breath of a Fisher-344 rat. The Research Triangle Institute (RTI) developed a breath collection system for use with rats in order to collect and determine volatile organic compounds (VOCs) exhaled. The RTI study tested the hypothesis that VOCs, including endogenous compounds, in breath can serve as markers to exposure to various chemical compounds such as drugs, pesticides, or carcinogens normally foreign to living organisms. From a comparative analysis of chromatograms, it was concluded that the administration of carbon tetrachloride dramatically altered …
Design And Analysis Of Parallel Hierarchical Battlefield Simulation, Conrad P. Masshardt
Design And Analysis Of Parallel Hierarchical Battlefield Simulation, Conrad P. Masshardt
Theses and Dissertations
The purpose of this research is to determine if hierarchically partitioning a discrete event battlefield simulation reduces runtime and, if reduction exists, to characterize the run time reduction given any particular partition configuration. A hierarchical discrete event simulation of a main battle tank was constructed. Implementations were built for both a single processor and a multiprocessing machine. The implementations used the Message Passing Interface to increase portability to other parallel and distributed configurations. Three test cases were generated and run on three parallel and distributed environments, a network of Sun SparcStation 20's, a Silicon Graphics Power Challenge, and a Paragon …
Reducing Lag In Virtual Displays Using Multiple Model Adaptive Estimation, David W. Kyger
Reducing Lag In Virtual Displays Using Multiple Model Adaptive Estimation, David W. Kyger
Theses and Dissertations
Multiple Model Adaptive Estimation is an effective method for reducing lag in virtual environment displays. Lag in displays (the time from head motion to the appearance of the proper image on the display) is a significant detriment to realism in virtual environments. Increasing the speed of the computers which control the virtual display is not a final answer. No matter how fast the processors work, there will always be demands to do more. Predicting angular head positions (look-angles) can reduce the lag by allowing the computer to calculate the appropriate scene before it is needed on the display. Single predictors …
Semantic Interpretation Of An Artificial Neural Network, Stanley D. Kinderknecht
Semantic Interpretation Of An Artificial Neural Network, Stanley D. Kinderknecht
Theses and Dissertations
Recent advances in machine learning theory have opened the door for applications to many difficult problem domains. One area that has achieved great success for stock market analysis/prediction is artificial neural networks. However, knowledge embedded in the neural network is not easily translated into symbolic form. Recent research, exploring the viability of merging artificial neural networks with traditional rule-based expert systems, has achieved limited success. In particular, extracting production (IF.. THEN) rules from a trained neural net based on connection weights provides a valid set of rules only when neuron outputs are close to 0 or 1 (e.g. the output …
Deriving Optimal Solutions From Incomplete Knowledge Bases, Shawn A. Northrop
Deriving Optimal Solutions From Incomplete Knowledge Bases, Shawn A. Northrop
Theses and Dissertations
Many real world domains cannot be represented using Bayesian Networks due to the need for complete probability tables and acyclic knowledge. However, Bayesian Knowledge Bases (BKBs) are a viable method for representing these incomplete domains, but very little research has been performed on inferencing with them. This paper presents three inference engines for extracting optimal solutions from three distinct BKB subclasses: singly- connected, multiply-connected with mutually exclusive cycles, and cyclic. The singly-connected inference engine has a worst case polynomial run time. Performance improvement techniques for increasing inference engine speed are discussed, in addition to a new tool for measuring incompleteness …
Probabilistic Knowledge Base Validation, Howard T. Gleason
Probabilistic Knowledge Base Validation, Howard T. Gleason
Theses and Dissertations
Our work develops a new methodology and tool for the validation of probabilistic knowledge bases throughout their lifecycle. The methodology minimizes user interaction by automatically modifying incorrect knowledge; only the occurrence of incomplete knowledge involves interaction. These gains are realized by combining and modifying techniques borrowed from rule-based and artificial neural network validation strategies. The presented methodology is demonstrated through BVAL, which is designed for a new knowledge representation, the Bayesian Knowledge Base. This knowledge representation accommodates incomplete knowledge while remaining firmly grounded in probability theory.
Design And Evaluation Of Standard Telerobotic Control Software, Kevin P. Anchor
Design And Evaluation Of Standard Telerobotic Control Software, Kevin P. Anchor
Theses and Dissertations
This thesis represents the first implementation of a proposed Air Force standard telerobotic control architecture. This architecture was developed by the NASA Jet Propulsion Laboratory and the National Institute of Standards and Technology under contract to the Air Force Materiel Command Robotics and Automation Center of Excellence (RACE) as the Unified Telerobotics Architecture Project (UTAP). The AFIT Robotics and Automation Applications Group (RAAG) Lab B facility computational structure was redesigned to be compliant with the UTAP architecture. This thesis shows that the UTAP specification to be implementable. However, if the underlying operating system does not support generic message passing, an …
Adaptive Methods For Distributed Video Presentation, Crispin Cowan, Shanwei Cen, Jonathan Walpole, Carlton Pu
Adaptive Methods For Distributed Video Presentation, Crispin Cowan, Shanwei Cen, Jonathan Walpole, Carlton Pu
Computer Science Faculty Publications and Presentations
This paper describes problems and solutions for delivering real-time, multi-media presentations across the Internet. A key characteristic of presentations of continuous media datatypes, such as digital video and audio, is their need for predictable real-time data delivery. For example, an NTSC quality video presentation requires video frames to be displayed every 1/30th of a second. Variations in this display rate can be observable as stalls or glitches in the video stream and reduce the quality of the presentation [6]. Delivering such presentations across the Internet is difficult because highly variable band- width and latency make it difficult to predict the …
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh
Computer Science: Faculty Publications and Other Works
In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of "congestion" and "dilation" measures for a set of packet paths. We give, for any constant ϵ > 0, a randomized on-line algorithm for routing any set of Npackets in O((C lgϵ(Nd) + D lg(Nd))/lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into …
A 2-2/3 Approximation For The Shortest Superstring Problem, Chris Armen, Clifford Stein
A 2-2/3 Approximation For The Shortest Superstring Problem, Chris Armen, Clifford Stein
Computer Science Technical Reports
Given a collection of strings S={s_1, ..., s_n} over an alphabet \Sigma, a superstring \alpha of S is a string containing each s_i as a substring; that is, for each i, 1<=i<=n, \alpha contains a block of |s_i| consecutive characters that match s_i exactly. The shortest superstring problem is the problem of finding a superstring \alpha of minimum length. The shortest superstring problem has applications in both data compression and computational biology. In data compression, the problem is a part of a general model of string compression proposed by Gallant, Maier and Storer (JCSS '80). Much of the recent interest in the problem is due to its application to DNA sequence assembly. The problem has been shown to be NP-hard; in fact, it was shown by Blum et al.(JACM '94) to be MAX SNP-hard. The first O(1)-approximation was also due to Blum et al., who gave an algorithm that always returns a superstring no more than 3 times the length of an optimal solution. Several researchers have published results that improve on the approximation ratio; of these, the best previous result is our algorithm ShortString, which achieves a 2 3/4-approximation (WADS '95). We present our new algorithm, G-ShortString, which achieves a ratio of 2 2/3. It generalizes the ShortString algorithm, but the analysis differs substantially from that of ShortString. Our previous work identified classes of strings that have a nested periodic structure, and which must be present in the worst case for our algorithms. We introduced machinery to descibe these strings and proved strong structural properties about them. In this paper we extend this study to strings that exhibit a more relaxed form of the same structure, and we use this understanding to obtain our improved result.
Information Retrieval, Information Structure, And Information Agents, Daniela Rus, Devika Subramanian
Information Retrieval, Information Structure, And Information Agents, Daniela Rus, Devika Subramanian
Computer Science Technical Reports
This paper presents a customizable architecture for software agents that capture and access information in large, heterogeneous, distributed electronic repositories. The key idea is to exploit underlying structure at various levels of granularity to build high-level indices with task-specific interpretations. Information agents construct such indices and are configured as a network of reusable modules called structure detectors and segmenters. We illustrate our architecture with the design and implementation of smart information filters in two contexts: retrieving stock market data from Internet newsgroups, and retrieving technical reports from Internet ftp sites.
Establishing World Wide Web Site For The Department Of Computer Science, Southern University, Baton Rouge, Chalasani Saibabu
Establishing World Wide Web Site For The Department Of Computer Science, Southern University, Baton Rouge, Chalasani Saibabu
Electronic Dissertations and Theses
The Department of Computer science was established as an instructional unit in college of sciences in 1968 at Southern University, Baton Rouge. The department serves more than 300 undergraduates and 80 graduate students in both education systems options. Academic Services or Graduate School provides the information on the Computer Science department to the requestors depending on their requests. This processing is not only taking staff time in attending the requests but also costing money to the University for mailing the Catalogs. Sometimes it may take more than a month to get the information after the process is initiated. The Chairman …