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 (7243)
- 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 (1172)
- 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)
- Western University (525)
- SelectedWorks (522)
- New Jersey Institute of Technology (511)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1337)
- Deep learning (800)
- Artificial intelligence (659)
- Machine Learning (651)
- Computer Science (638)
-
- Security (620)
- Computer science (436)
- Cybersecurity (410)
- Privacy (408)
- Simulation (379)
- Technical Reports (369)
- Classification (367)
- UTEP Computer Science Department (367)
- Data mining (349)
- Deep Learning (349)
- Algorithms (337)
- Optimization (336)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (291)
- 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 (231)
- 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 (500)
- 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 (316)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 54931 - 54960 of 58034
Full-Text Articles in Physical Sciences and Mathematics
A Format For Storing And Managing Multiple Level Of Detail Terrain For Simulated Environments, Keith L. Meissner
A Format For Storing And Managing Multiple Level Of Detail Terrain For Simulated Environments, Keith L. Meissner
Theses and Dissertations
This study investigated a method of storing, managing and rendering terrain data, while addressing conflicting goals of. rendering speed, display detail and memory usage. A data structure is presented to store terrain data, with an object oriented system to manage the data stored in the structure. The structure stores terrain data in a compact form which is converted into rendering structures in real time. The structure uses levels of detail to maintain display detail. The structure is compared against an existing format for storing terrain data, MultiGen Flight. The system managing the structure is shown to decrease memory usage and …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, 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.
Dyadic Wavelet Features For Isolated Word Speaker Dependent Speech Recognition, Stephen Ainge
Dyadic Wavelet Features For Isolated Word Speaker Dependent Speech Recognition, Stephen Ainge
Theses and Dissertations
This research examines the use of dyadic wavelet features for the recognition of speaker dependent isolated word speech. The features were generated using three different wavelet filters-Daubechies 4 coefficient (Db4), Daubechies 20 coefficient (Db20) and a 31 coefficient cubic spline and three different window lengths-15ms, 8ms and 4ms. The accuracy of the standard and over-sampled dyadic wavelet methods were compared. The over-sampled dyadic wavelet method using the Db4 scaling function, with a maximum accuracy of 65.5, was found to be the most accurate of the wavelet methods tested. The accuracy of this over-sampled dyadic Db4 wavelet method was compared to …
Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole
Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Parallel environments consisting of a network of heterogeneous workstations introduce an inherently dynamic environment that differs from multicomputers. Workstations are usually considered “shared” resources while multicomputers provide dedicated processing power. The number of workstations available for use is continually changing; the parallel machine presented by the network is in effect continually reconfiguring itself. Application programs must effectively adapt to the changing number of processing nodes while maintaining computational efficiency. This paper examines methods for adapting to this dynamic environment within the framework of explicit message passing under the data parallel programming model. We present four requirements which we feel a …
Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson
Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson
Theses and Dissertations
Large-scale structural optimization problems are often difficult to solve with reasonable efficiency and accuracy. Such problems are often characterized by constraint functions which are not explicitly defined. Constraint and gradient functions are usually expensive to evaluate. An optimization approach which uses the NLPQL sequential quadratic programming algorithm of Schittkowski, integrated with the Automated Structural Optimization System ASTROS is tested. The traditional solution approach involves the formulation and solution of an explicitly defined approximate problem during each iteration. This approach is replaced by a simpler approach in which the approximate problem is eliminated. In the simpler approach, each finite element analysis …
The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider
The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider
Theses and Dissertations
This study examined two animation displays moving icons, bar graphs at two presentation speeds to determine how each of these factors affected the animations ability to communicate violations of model assumptions. Subjects viewed animation displays individually and in combination at each presentation speed. Eight problem scenarios were presented to evaluate each animations ability to communicate violations of different assumptions. Each animations communication ability was measured subjectively and objectively. Subjective measures in the form of pairwise comparisons were used to calculate normalized preference ratings for each animation. objective measures included problem identification accuracy and problem time. Subjective results indicated that moving …
Effective Parallel Algorithm Animation, Paul W. Chase
Effective Parallel Algorithm Animation, Paul W. Chase
Theses and Dissertations
The AFIT Algorithm Animation Research Facility AAARF was developed by the Air Force Institute of Technology AFIT as a teaching aid for data structures and algorithm design. In particular, an extensive set of performance animations has been developed for the Intel iPSC Hypercube parallel processing system. This research focuses in part on developing animation support for discrete event simulation, mission routing, and evolutionary algorithms based on abstract representations of parallel algorithm behavior. The effort also builds extensions to the AAARF system and examines direction for further research. An innovative adaptable application-specific animation construction environment has been designed and implemented. The …
Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig
Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig
Research Collection School Of Computing and Information Systems
Measurement of software development productivity is needed in order to control software costs, but it is discouragingly labor-intensive and expensive. Computer-aided software engineering (CASE) technologies-especially repository-based, integrated CASE-have the potential to support the automation of this measurement. We discuss the conceptual basis for the development of automated analyzers for function point and software reuse measurement for object-based CASE. Both analyzers take advantage of the existence of a representation of the application system that is stored within an object repository, and that contains the necessary information about the application system. We also discuss metrics for software reuse measurement, including reuse leverage, …
A Simulation Approach To Granite Sentry System Analysis, Marilyn J. Bauer
A Simulation Approach To Granite Sentry System Analysis, Marilyn J. Bauer
Theses and Dissertations
This study demonstrated the use of simulation modelling to analyze Granite Sentry system performance. The availability simulation model constructed provides a number of system performance measures as a function of component MTBFs and MTTRs. Analysis of failure data prior to model construction supported the generally accepted use of exponentially distributed failure rates and lognormally distributed repair times.
Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson
Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson
Theses and Dissertations
This research proposes an analytical approach for assessing flow disturbance, or compromise, based on limited sampling of arc flow information in multi-commodity, or multiple origin-destination O-D, networks with failing arcs. There were three objectives established for this research. The first objective was to bound the expected flow, given the arcs fail with certain probabilities, which was accomplished by reviewing current approaches for single-commodity networks and extending the results to the multi-commodity case. The second objective was to determine the best placement of flow monitors to obtain the most accurate estimates of O-D pair volumes. This was accomplished using a multi-criteria …
Clustering Techniques In Speaker Recognition, Douglas N. Prescott
Clustering Techniques In Speaker Recognition, Douglas N. Prescott
Theses and Dissertations
This thesis presents a comparison based on identification rate, of three clustering techniques applied to cepstral features for speaker identification. LBG vector quantization as developed by Linde, Buzo and Gray; is used to provide benchmark performance for comparison with Fuzzy clustering (based on the unsupervised fuzzy partition-optimal number of classes, UFP-ONC algorithm by Gath and Geva) and an Artificial Neural Network, the Multilayer Perceptron. Cepstral features from the TIMIT, King and AFIT93 corpus speaker databases are used to produce speaker-identification classifiers using each of the clustering algorithms. The experiment reported evaluates the speaker identification performance using the 20-dimensional cepstral features …
A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart
A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart
Theses and Dissertations
An interactive computer system which allows the researcher to build an optimal neural network structure quickly, is developed and validated. This system assumes a single hidden layer perceptron structure and uses the back- propagation training technique. The software enables the researcher to quickly define a neural network structure, train the neural network, interrupt training at any point to analyze the status of the current network, re-start training at the interrupted point if desired, and analyze the final network using two- dimensional graphs, three-dimensional graphs, confusion matrices and saliency metrics. A technique for training, testing, and validating various network structures and …
Proof Of Correctness For Asocs Aa3 Networks, J. Cory Barker, Tony R. Martinez
Proof Of Correctness For Asocs Aa3 Networks, J. Cory Barker, Tony R. Martinez
Faculty Publications
This paper analyzes adaptive algorithm 3 (AA3) of adaptive self-organizing concurrent systems (ASOCS) and proves that AA3 correctly fulfills the rules presented. Several different models for ASOCS have been developed. AA3 uses a distributed mechanism for implementing rules so correctness is not obvious. An ASOCS is an adaptive network composed of many simple computing elements operating in parallel. An ASOCS operates in one of two modes: learning and processing. In learning mode, rules are presented to the ASOCS and incorporated in a self-organizing fashion. In processing mode, the ASOCS acts as a parallel hardware circuit that performs the function defined …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 2, February 1994, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 2, February 1994, 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.
An Algorithmic Palette Tool, Gary R. Greenfield
An Algorithmic Palette Tool, Gary R. Greenfield
Department of Math & Statistics Technical Report Series
Our algorithmic tool follows the model of RGB percentage curves, but now the control of these curves is though algorithms that indirectly, and more abstractly, create, evolve, and modify such curves. To fully explain our methods we must first introduce the topic "mutating expressions." This is done in Section Two. In Section Three we document the user-interface problems we dealt with, and finally in Section Four discuss conclusions and suggest ideas for future exploration. Before commencing with the technical details however, we wish to emphasize the nature of the "colorization" problem that led to the conception and development of our …
Cooperating Brokers To Support Cooperative Work, Vinod Anupam, Chandrajit Bajaj, Peinan Zhang
Cooperating Brokers To Support Cooperative Work, Vinod Anupam, Chandrajit Bajaj, Peinan Zhang
Department of Computer Science Technical Reports
No abstract provided.
Generic Naming In Generative, Constraint- Based Design, Vallis Capoyleas, Xiangping Chen, Christoph M. Hoffmann
Generic Naming In Generative, Constraint- Based Design, Vallis Capoyleas, Xiangping Chen, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Towards Feature Attachment, Xiangping Chen, Christoph M. Hoffmann
Towards Feature Attachment, Xiangping Chen, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
Experiences With Tripwire: Using Integrity Checkers For Intrusion Detection, Gene H. Kim, Eugene H. Spafford
Experiences With Tripwire: Using Integrity Checkers For Intrusion Detection, Gene H. Kim, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
An Application Of Pattern Matching In Intrusion Detection, Sandeep Kumar, Eugene H. Spafford
An Application Of Pattern Matching In Intrusion Detection, Sandeep Kumar, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
Using Tickets To Enforce The Serializability Of Multidatabase Transactions, Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit P. Sheth
Using Tickets To Enforce The Serializability Of Multidatabase Transactions, Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit P. Sheth
Kno.e.sis Publications
To enforce global serializability in a multidatabase environment the multidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions. Such conflicts are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these difficulties, we propose to incorporate additional data manipulation operations in the subtransactions of each multidatabase transaction. We show that if these operations create direct conflicts between subtransactions at each participating local database system, indirect conflicts can be resolved even if the multidatabase system is not aware of …
Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole
Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Rapid advances in hardware technology have led to wide diversity in parallel computer architectures. This diversity makes it difficult to evaluate or compare the performance of different parallel computers. Existing benchmarks tend either to be too architecture-specific, or too high-level. Both problems can result in benchmarks that not only provide insufficient information on the performance characteristics of the computer being tested, but are also difficult to port. New benchmarking approaches are needed for new architectural classes, particularly distributed-memory, message-passing computers. This paper focuses on benchmarking distributed-memory message-passing computers. A synthetic benchmark called CoMet (COmmunication METrics), is presented. CoMet is based …
Concurrent Use Of Two Programming Tools For Heterogeneous Supercomputers, Javier G. Vasquez
Concurrent Use Of Two Programming Tools For Heterogeneous Supercomputers, Javier G. Vasquez
Theses
In this thesis, a demostration of the heterogeneous use of two programming paradigms for heterogeneous computing called Cluster-M and HAsC is presented. Both paradigms can efficiently support heterogeneous networks by preserving a level of abstraction which does not include any architecture mapping details. Furthermore, they are both machine independent and hence are scalable. Unlike, almost all existing heterogeneous orchestration tools which are MIMD based, HAsC is based on the fundamental concepts of SIMD associative computing. HAsC models a heterogeneous network as a coarse grained associative computer and is designed to optimize the execution of problems with large ratios of computations …
Graphical Oodb Modeling For Medical Information Standards (Gommis), Jiping Liu
Graphical Oodb Modeling For Medical Information Standards (Gommis), Jiping Liu
Theses
The graphical representation of database schemata has been a useful tool for the designer and users of database systems. Such a tool for OODB schemata should incorporate a wide variety of symbols which cover most concepts of existing Object-Oriented Database (OODB), so it is sufficient to support a diverse group of object-oriented data models.
In this paper we created a. graphical representation, using the OOdini system and language, of the European Prestandard for Medical Informatics on Message Exchange of Laboratory Information. This European Prestandard describes a standardized format for messages to be exchanged between a. health care provider and a …
Design And Implementation Of Ipis : An X-Window Based Image Processing Interactive System, Eduardo Morales
Design And Implementation Of Ipis : An X-Window Based Image Processing Interactive System, Eduardo Morales
Theses
Most of image processing systems are based on command line functions or can only display one image at a time. This is a serious inconvenience for those who need an interactive system session or want to compare two images processed by different techniques at the same time.
The system was designed with these problems in mind. It is able to display the processed image right after an operation and to display several images simultaneously, making it simple to compare techniques. The system was also created with the purpose to be used in an academic environment. Its structured design makes it …
Implementation Of An Automatic Mapping Tool For Massively Parallel Computing, Ajitha Gadangi
Implementation Of An Automatic Mapping Tool For Massively Parallel Computing, Ajitha Gadangi
Theses
In this thesis, an implementation of a generic technique for fine grain mapping of portable parallel algorithms onto multiprocessor architectures is presented. The implemented mapping algorithm is a component of Cluster-M. Cluster-M is a novel parallel programming tool which facilitates the design and mapping of portable softwares onto various parallel systems. The other components of Cluster-M are the Specifications and the Representations. Using the Specifications, machine independent parallel algorithms are presented in a "clustered" fashion specifying the concurrent computations and communications at every step of the overall execution. The Representations, on the other hand, are a form of clustering the …
Authentication For Mobile Computing, Andreas Keppler
Authentication For Mobile Computing, Andreas Keppler
Theses
Host mobility is becoming an increasingly important feature with the recent arrival of laptop and palmtop computers, the development of wireless network interfaces and the implementation of global networks. Unfortunately, this mobile environment is also much more vulnerable to penetration by intruders. A possible means of protection can be authentication. This guarantees the identity of a communication peer.
This thesis studies the constraints imposed on the mobile environment with respect to authentication. It compares the two prevailing authentication mechanisms, Kerberos and SPX, and tries to make suggestions of how a mechanism can be adapted to the mobile environment.
Graphical Oodb Modeling For Medical Information Standards (Gommis), Nagesh K. Puppala
Graphical Oodb Modeling For Medical Information Standards (Gommis), Nagesh K. Puppala
Theses
Our task is to create a graphical representation of the European Prestandard for Medical Informatics on Message Exchange of Laboratory Information. This document, made available to us through Columbia Presbyterian, describes a standardized format for messages to be exchanged between a healthcare provider and a medical laboratory. The prestandard represents important information in a very disconnected way.
We have used OODINI system and language to develop our GOMMIS system. OODINI is a graphical editor for object-oriented database schemas that was developed at NJIT during the past three years. OODINI features a poweful set of icons that cover most concepts of …
Tele-Assistance For Semi-Autonomous Robots, Erika Rogers, Robin R. Murphy
Tele-Assistance For Semi-Autonomous Robots, Erika Rogers, Robin R. Murphy
Computer Science and Software Engineering
This paper describes current work on a cooperative tele-assistance system for semi-autonomous robots. This system combines a robot architecture for limited autonomous perceptual and motor control with a knowledge-based operator assistant which provides strategic selection and enhancement of relevant data. The design of the system is presented, together with a number of exception-handling scenarios that were constructed as a result of experiments wit.h act.ual sensor data collected from two mobile robots.
Recognizing Plants Using Stochastic L-Systems, Ashok K. Samal, Brian Peterson, David J. Holliday
Recognizing Plants Using Stochastic L-Systems, Ashok K. Samal, Brian Peterson, David J. Holliday
CSE Conference and Workshop Papers
Recognizing naturally occurring objects has been a difficult task in computer vision. One of the keys to recognizing objects is the development of a suitable model. One type of model, the fractal, has been used successfully to model complex natural objects. A class of fractals, the L-system, has not only been used to model natural plants, but has also aided in their recognition. This research extends the work in plant recognition using L-systems in two ways. Stochastic L-systems are used to model and generate more realistic plants. Furthermore, to handle the complexity of recognition, a learning system is used that …