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 (1094)
- 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)
- Classification (367)
- Technical Reports (358)
- UTEP Computer Science Department (356)
- 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) (881)
- 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 55351 - 55380 of 58020
Full-Text Articles in Physical Sciences and Mathematics
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih
Computer Science: Faculty Publications and Other Works
We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 2, February 1993, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 2, February 1993, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
A Generalization Of The Trie Data Structure, Richard H. Connelly, F. Lockwood Morris
A Generalization Of The Trie Data Structure, Richard H. Connelly, F. Lockwood Morris
Electrical Engineering and Computer Science - Technical Reports
Tries, a form of string-indexed look-up structure, are generalized to permit indexing by terms built according to an arbitrary signature. The construction is parametric with respect to the type of data to be stored as values; this is essential, because the recursion which defines tries appeals from one value type to others. "Trie" (for any fixed signature) is then a functor, and the corresponding look-up function is a natural isomorphism. The trie functor is in principle definable by the "initial fixed point" semantics of Smyth and Plotkin. We simplify the construction, however, by introducing the "category-cpo", a class of category …
Graphical Evolution Experiments In Artificial Life, Gary R. Greenfield
Graphical Evolution Experiments In Artificial Life, Gary R. Greenfield
Department of Math & Statistics Technical Report Series
Larry Yaeger's alife simulation running on a Silicon Graphics Iris Workstation is called Poly World. Our description of PolyWorld is based on notes taken during an oral presentation and video demonstration given in the Artificial Life Panel Session of SIGGRAPH '92: In PolyWorld the visual organisms roam on a bounded two dimensional grid. The organisms "brains" are small neural nets enabling the organisms to control their external visual appearance and to perceive the external world by processing pixmaps. The simulation controls for total energy while striving to explore competition and self-organization. Genes present are for size, strength, maximum speed, mutation …
An Interactive X-Window Based User Interface For The Xox Solid Modeling Library, Poting Wu, Elias N. Houstis
An Interactive X-Window Based User Interface For The Xox Solid Modeling Library, Poting Wu, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Decentralized Global Transaction Management In Multidatabase Systems, Aidong Zhang, Jiansan Chen, Ahmed K. Elmagarmid, Omran Bukhres
Decentralized Global Transaction Management In Multidatabase Systems, Aidong Zhang, Jiansan Chen, Ahmed K. Elmagarmid, Omran Bukhres
Department of Computer Science Technical Reports
No abstract provided.
New Algorithms For Minimizing The Longest Wire Length During Circuit Compaction, Susanne E. Hambrusch, Hung-Yi Tu
New Algorithms For Minimizing The Longest Wire Length During Circuit Compaction, Susanne E. Hambrusch, Hung-Yi Tu
Department of Computer Science Technical Reports
No abstract provided.
Rowdlas User's Guide, H. Byun, Elias N. Houstis, E. A. Vavalis
Rowdlas User's Guide, H. Byun, Elias N. Houstis, E. A. Vavalis
Department of Computer Science Technical Reports
No abstract provided.
Symbolic Methods In Computer Graphics And Geometric Modeling (Ph.D. Thesis), Andrew Vasanth Royappa
Symbolic Methods In Computer Graphics And Geometric Modeling (Ph.D. Thesis), Andrew Vasanth Royappa
Department of Computer Science Technical Reports
No abstract provided.
The Ksr1: Experimentation And Modeling Of Poststore, Amy Apon, E Rosti, E Smirni, T D. Wagner, M Madhukar, L W. Dowdy
The Ksr1: Experimentation And Modeling Of Poststore, Amy Apon, E Rosti, E Smirni, T D. Wagner, M Madhukar, L W. Dowdy
Publications
Kendall Square Research introduced the KSRl system in 1991. The architecture is based on a ring of rings of 64bit microprocessors. It is a distributed, shared memory system and is scalable. The memory structure is unique and is the key to understanding the system. Different levels of caching eliminates physical memory addressing and leads to the ALLCACHE TM scheme. Since requested data may be found in any of several caches, the initial access time is variable. Once pulled into the local (sub)cache, subsequent access times are fixed and minimal. Thus, the KSRl is a Cache-Only Memory Architecture (COMA) system. This …
A Comparison Of Integration Architectures, Amar Mahidadia
A Comparison Of Integration Architectures, Amar Mahidadia
Theses
This paper presents GenSIF, a Generic Systems Integration Framework. GenSIF features a pre-planned development process on a domain-wide basis and facilitates system integration and project coordination for very large, complex and distributed systems. Domain analysis, integration architecture design and infrastructure design are identified as the three main components of GenSIF. In the next step we map Beilcore's OSCA interoperability architecture, ANSA, IBM's SAA and Bull's DCM into GenSIF. Using the GenSIF concepts we compare each of these architectures.
GenSIF serves as a general framework to evaluate and position specific architecture. The OSCA architecture is used to discuss the impact of …
Computer Implementation Of Mason's Rule And Software Development Of Stochastic Petri Nets, Xiaoyong Zhao
Computer Implementation Of Mason's Rule And Software Development Of Stochastic Petri Nets, Xiaoyong Zhao
Theses
A symbolic performance analysis approach for discrete event systems can be formulated based on the integration of Petri nets and Moment Generating Function concepts [1-3]. The key steps in the method include modeling a system with arbitrary stochastic Petri nets (ASPN), generation of state machine Petri nets with transfer functions, derivation of equivalent transfer functions, and symbolic derivation of transfer functions to obtain the performance measures. Since Mason's rule can be used to effectively derive the closed-form transfer function, its computer implementation plays a very important role in automating the above procedure. This thesis develops the computer implementation of Mason's …
A Sign-To-Speech Translation System, Koka Veera Raghava Rao
A Sign-To-Speech Translation System, Koka Veera Raghava Rao
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
This thesis describes sign-to-speech translation using neural networks. Sign language translation is an interesting but difficult problem for which neural network techniques seem promising because of their ability to adjust to the user's hand movements, which is not possible to do by most other techniques. However, even using neural networks and artificial sign languages, the translation is hard, and the best-known system, that of Fels & Hinton (1993), is capable of translating only 66 root words and 203 words including their conjugations. This research improves their results to 790 root signs and 2718 words including their conjugations while preserving a …
A Petri Net Toolkit For Parallel Program Debugging, Potla Kishore Reddy
A Petri Net Toolkit For Parallel Program Debugging, Potla Kishore Reddy
Theses
An effective debugger must support the language and operating system resource abstractions that are available to the programmer. Earlier debuggers worked at the machine architecture level: they dealt with machine instructions and registers. Current debuggers, designed for single process debugging, permit access to program variables and breakpoints and single-stepping at the level of high-level language statements. Eventhough the current debuggers, are already implemented to be a powerful tool, they still cannot do a job of parallel debugger.
In this thesis, a computer simulation system has been established by Petri Nets execution providing a convenient and friendly interface as it allows …
An Enhancement And Improvement Of A Prototype Distributed System Based On Elements Of An Integration Architecture, Kunal R. Shah
An Enhancement And Improvement Of A Prototype Distributed System Based On Elements Of An Integration Architecture, Kunal R. Shah
Theses
The concepts and results presented in this thesis are related to Integrated System Development. It provides introduction to Generic System Integration Framework (GenSIF). And hence its three principal components, Domain Analysis, Integration Architectures and Enabling Technology. It addresses certain issues of distributed processing relating to systems integration.
The primary objective of this thesis is to develop/improve a prototype by applying concepts and ideas presented in GenSIF, with an example channel based building block integration architecture as an example. This prototype was developed with the objective of studying the effect of system intregration framework in mind while working on an application. …
Protocol Conformance Test Generation Using Circular Uio With Overlapping, Sesharao Patchipala
Protocol Conformance Test Generation Using Circular Uio With Overlapping, Sesharao Patchipala
Theses
The purpose of the protocol conformance testing is to ensure that protocol implementations are consistent with their specifications. After the U-method was introduced, several test methods based on the Unique Input/Output (UI0) sequences which were the main concept in the U-method have been proposed, namely, the RCP-method, MUIO-method, MUIO with overlapping method, B-method, C-method. A good test sequence must be short and have wide fault coverage. By comparing the test sequences generated by the above test methods based on experimental results, reveals that the test sequences by the MUIO with overlapping method are the worst in quality but their lengths …
Systems Integration In Pharmaceutical Industry Using Object-Oriented Expert System Technology, Korrapolu Reddy
Systems Integration In Pharmaceutical Industry Using Object-Oriented Expert System Technology, Korrapolu Reddy
Theses
SPHINX is an object-oriented expert system addressed to solve the burning problems of pharmaceutical industry. SPHINX stands for Systems integration in PHarmaceutical INdustry using object-oriented eXpert system technology.
Various problems that American pharmaceutical industries are facing have been explained. Using the revolutionary object-oriented concepts and the powerful expert systems technology, it has been shown how a prescription can be written to solve all the problems of pharmaceutical industries. A problem "Minimizing the wastage of Interferon" has been taken to demonstrate the power of Object-oriented Expert System technology.
Genetic Algorithms For Vertex Splitting In Dags, Matthias Mayer, Fikret ErçAl
Genetic Algorithms For Vertex Splitting In Dags, Matthias Mayer, Fikret ErçAl
Computer Science Technical Reports
Directed Acyclic Graphs are often used to model circuits and networks. The path length in such Directed Acyclic Graphs represents circuit or network delays. In the vertex splitting problem, the objective is to determine a minimum number of vertices from the graph to split such that the resulting graph has no path of length greater than a given δ. The problem has been proven to be NP-hard. A Genetic Algorithm is used to solve the DAG Vertex Splitting Problem. This approach uses a variable string length to represent the vertices that split the graph and a dynamic population size. The …
Intermediate Code Generation For Portable Scalable, Compilers. Architecture Independent Data Parallelism: The Preliminaries, Lenore Mullin, C. Chang, S. Huang, Matthias Mayer, N. Nemer, C. Ramakrishna
Intermediate Code Generation For Portable Scalable, Compilers. Architecture Independent Data Parallelism: The Preliminaries, Lenore Mullin, C. Chang, S. Huang, Matthias Mayer, N. Nemer, C. Ramakrishna
Computer Science Technical Reports
This paper introduces the goals of the Portable, Scalable, Architecture Independent (PSI) Compiler Project for Data Parallel Languages at the University of Missouri-Rolla. A goal of this project is to produce a subcompiler for data parallel scientific programming languages such as HPF(High Performance Fortran) where the input grammar is translated to a three-address code intermediate language. Ultimately we plan to integrate our work into automated synthesis systems for scientific programming because we feel that it should not be necessary to learn complicated programming techniques to use multiprocessor computers or networks of computers effectively. This paper shows how to compile a …
Modeling Of Supersonic Combustor Flows Using Parallel Computing, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves
Modeling Of Supersonic Combustor Flows Using Parallel Computing, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves
Computer Science Technical Reports
Computational Fluid Dynamics (CFD) has matured rapidly in the past 20 years and is now an important tool for analyzing and understanding complex fluid flows. Since 1985, CFD has played a vital role in the study of hypersonic flight. It has provided the capability for scientists and engineers to model both internal and external hypersonic flow-fields. Such flows are often impractical or impossible to analyze in laboratory conditions. In particular, the recent application of CFD to the modeling of internal reacting supersonic combustor flows has significantly advanced the understanding of such flows and has increased confidence in the predictive ability …
The Computation Of Supersonic Combustor Flows Using Multi-Computers, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves
The Computation Of Supersonic Combustor Flows Using Multi-Computers, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves
Computer Science Technical Reports
An explicit computational fluid dynamics (CFD) computer code with parallel processing capability has been developed for the purpose of simulating internal high-speed reacting flows. The code solves the three-dimensional Navier-Stokes equations for compressible flows. The CFD code can be executed on either sequential (single processor) computers or multi-computers (multiple processor machines with distributed memory and message passing between processors). The parallel implementation involves homogeneous domain decomposition between processors with message passing needed only between neighbor processors. The code is validated for a compression ramp, an expansion ramp, a viscous flat plate, and a viscous flat plate with wall injection. These …
Visual Inspection Algorithms For Printed Circuit Board Patterns A Survey, Madhav Moganti, Fikret ErçAl, Cihan H. Dagli
Visual Inspection Algorithms For Printed Circuit Board Patterns A Survey, Madhav Moganti, Fikret ErçAl, Cihan H. Dagli
Computer Science Technical Reports
The importance of the inspection process has been magnified by the requirements of the modern manufacturing environment. In electronics mass-production manufacturing facilities, an attempt is often made to achieve 100 % quality assurance of all parts, subassemblies, and finished goods. A variety of approaches for automated visual inspection of printed circuits have been reported over the last two decades. In this survey, algorithms and techniques for the automated inspection of printed circuit boards are examined. A classification tree for these algorithms is presented and the algorithms are grouped according to this classification. This survey concentrates mainly on image analysis and …
Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin
Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin
Computer Science Technical Reports
This paper presents an approach to operationally evaluate a temporal specification in a distributed computing environment. First, an algorithm Compute History is proposed to allow every distributed processor to collect events executed by itself and by other processors, and to order the collected events by causality. This algorithm employs neither monitors nor a global clock to order collected events of a processor. These collected events of a processor form an execution history of a distributed computation, and they represent behaviors of all the processors during execution. Next, the semantics of operational evaluation of a temporal assertion is presented. The evaluation …
How To Program In Ccsp, Elizabeth Arrowsmith, Bruce M. Mcmillin
How To Program In Ccsp, Elizabeth Arrowsmith, Bruce M. Mcmillin
Computer Science Technical Reports
No abstract provided.
On Extremal Nonsupereulerian Graphs With Clique Number M, Zhi-Hong Chen
On Extremal Nonsupereulerian Graphs With Clique Number M, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
Development Of A Hypermedia Database For The Elementary Classroom, Jane Pattison Brown
Development Of A Hypermedia Database For The Elementary Classroom, Jane Pattison Brown
All Graduate Projects
A hypermedia database including selected flora and fauna in Kittitas County, Washington, was developed using HyperCard software for researching information about 400+ species. students had the opportunity to use the database in school libraries and in the author's fifth-grade classroom. The database cards accessed videodisc images where available. On the basis of limited study to date, it appears that when studying the environment, student learning was enhanced by the use of database material created by the author.
Towards A Chaotic Musical Instrument, Bruno Degazio
Towards A Chaotic Musical Instrument, Bruno Degazio
Publications and Scholarship
The goal of this project is to produce a software musical instrument using chaotic processes as a sound synthesis method. Real-time control through MIDI note messages and continuous controllers is required. Early results are described, along with suggestions for continuing work.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 1, January 1993, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 1, January 1993, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Zero-Defect Software - Cleanroom Engineering, Harlan D. Mills
Zero-Defect Software - Cleanroom Engineering, Harlan D. Mills
The Harlan D. Mills Collection
No abstract provided.
A Fast Serial Algorithm For The Finite Temperature Quenched Potts Model, Gregory N. Hassold, Elizabeth A. Holm
A Fast Serial Algorithm For The Finite Temperature Quenched Potts Model, Gregory N. Hassold, Elizabeth A. Holm
Physics Publications
An efficient serial algorithm for finite temperature, quenched Potts model simulations of domain evolution has been developed. This ''n‐fold way'' algorithm eliminates unsuccessful spin flip attempts a priori by flipping sites with a frequency proportional to their site activity, defined as the sum of the probability of success for every possible spin flip at that site. Finite temperature efficiency for high‐spin degeneracy systems is achieved by utilizing a new, analytical expression for the portion of the site activity due to flips to non-neighbor spin values. Hence, to determine the activity of a site, only flips to the …