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 (530)
- SelectedWorks (527)
- Western University (525)
- New Jersey Institute of Technology (516)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1338)
- Deep learning (800)
- Artificial intelligence (658)
- 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 54061 - 54090 of 57999
Full-Text Articles in Physical Sciences and Mathematics
Reducing Intermediate Results For Incremental Updates Of Materialized Views, Tetsuya Furukawa, Ahmed K. Elmagarmid
Reducing Intermediate Results For Incremental Updates Of Materialized Views, Tetsuya Furukawa, Ahmed K. Elmagarmid
Department of Computer Science Technical Reports
No abstract provided.
Object Based Constraint Management For Collaborative Systems, Chandrajit Bajaj, Peinan Zhang
Object Based Constraint Management For Collaborative Systems, Chandrajit Bajaj, Peinan Zhang
Department of Computer Science Technical Reports
No abstract provided.
On Mobile Systems And Disconnected Browsing Of Distributed Information, Anupam Joshi, Sanjiva Weerawarana, Elias N. Houstis
On Mobile Systems And Disconnected Browsing Of Distributed Information, Anupam Joshi, Sanjiva Weerawarana, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
A Peak Finding Strategy For Multi- Dimensional Scalar Fields With Applications To X-Ray Crystallography, Calin R. Costian, Ioana M. Boier Martin, Dan C. Marinescu, Mikhail J. Atallah
A Peak Finding Strategy For Multi- Dimensional Scalar Fields With Applications To X-Ray Crystallography, Calin R. Costian, Ioana M. Boier Martin, Dan C. Marinescu, Mikhail J. Atallah
Department of Computer Science Technical Reports
No abstract provided.
Elimination Of All-Optical Cycles In Wavelength-Routed Optical Networks, Jason Iness, Byrav Ramamurthy, Biswanath Mukherjee, Krishna Bala
Elimination Of All-Optical Cycles In Wavelength-Routed Optical Networks, Jason Iness, Byrav Ramamurthy, Biswanath Mukherjee, Krishna Bala
School of Computing: Faculty Publications
A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended …
Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi
Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi
Kno.e.sis Publications
The huge number of autonomous and heterogeneous data repositories accessible on the “global information infrastructure” makes it impossible for users to be aware of the locations structure/organization, query languages and semantics of the data in various repositories. There is a critical need to complement current browsing, navigational and information retrieval techniques with a strategy that focuses on information content and semantics. In any strategy that focuses on information content, the most critical problem is that of different vocabularies used to describe similar information across domains. We discuss a scalable approach for vocabulary sharing. The objects in the repositories are represented …
Implementation And Analysis Of Software Based Fault Isolation, Scott M. Silver
Implementation And Analysis Of Software Based Fault Isolation, Scott M. Silver
Dartmouth College Undergraduate Theses
Extensible applications rely upon user-supplied, untrusted modules to extend their functionality. To remain reliable, applications must isolate themselves from user modules. One method places each user module in a separate address space (process), which uses hardware virtual memory support to isolate the user process. Costly inter-process communication, however, prohibits frequent communication between the application and the untrusted module. We implemented and analyzed a software method for isolating an application from user modules. The technique uses a single address space. We provide a logical address space and per-module access to system resources for each module. Our software technique is a two-step …
Supporting Search For Reusable Software Objects, T. Isakowitz, Robert J. Kauffman
Supporting Search For Reusable Software Objects, T. Isakowitz, Robert J. Kauffman
Research Collection School Of Computing and Information Systems
Prior research has shown that achieving high levels of software reuse in the presence of repository and object-based computer-aided software engineering (CASE) development methods presents interesting human, managerial and technical challenges. This article presents research that seeks to enhanced software development performance through reuse. We propose automated support for developers who search large repositories for the appropriate reusable software objects. We characterize search for repository objects in terms of a multistage model involving screening, identification, and the subsequent choice between new object construction or reusable object implementation. We propose automated support tools, including ORCA, a software Object Reuse Classification Analyzer, …
Study Of The B0sb0s Oscillation Frequency Using D-S ℓ+ Combinations In Z Decays, Buskulic, D.; Et Al., M. Thulasidas
Study Of The B0sb0s Oscillation Frequency Using D-S ℓ+ Combinations In Z Decays, Buskulic, D.; Et Al., M. Thulasidas
Research Collection School Of Computing and Information Systems
A lower limit on the oscillation frequency of the B s 0 B s 0 system is obtained from approximately four million hadronic Z decays accumulated using the ALEPH detector at LEP from 1991 to 1995. Leptons are combined with opposite sign D s − candidates reconstructed in seven different decay modes as evidence of semileptonic B s 0 decays. Criteria designed to ensure precise proper time reconstruction select 277D s − ℓ + combinations. The initial state of these B s 0 candidates is determined using an algorithm optimized to efficiently utilise the tagging information available for each event. …
A Methodology For Reengineering Relational Databases To An Object-Oriented Database, Pedro A. Linhares Lima
A Methodology For Reengineering Relational Databases To An Object-Oriented Database, Pedro A. Linhares Lima
Theses and Dissertations
This research proposes and evaluates a methodology for reengineering a relational database to an object-oriented database. We applied this methodology to reengineering the Air Force Institute of Technology Student Information System (AFITSIS) as our test case. With this test case, we could verify the applicability of the proposed methodology, especially because AFITSIS comes from an old version of Oracle RDBMS. We had the opportunity to implement part of the object model using an object-oriented database, and we present some peculiarities encountered during this implementation. The most important result of this research is that it demonstrated that the proposed methodology can …
Measurement Of Hadron And Lepton-Pair Production From E+E- Annihilation At Centre-Of-Mass Energies Of 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas
Measurement Of Hadron And Lepton-Pair Production From E+E- Annihilation At Centre-Of-Mass Energies Of 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas
Research Collection School Of Computing and Information Systems
No abstract provided.
Formal Transformations From Graphically-Based Object-Oriented Representations To Theory-Based Specifications, Scott A. Deloach
Formal Transformations From Graphically-Based Object-Oriented Representations To Theory-Based Specifications, Scott A. Deloach
Theses and Dissertations
Formal software specification has long been touted as a way to increase the quality and reliability of software; however, it remains an intricate, manually intensive activity. An alternative to using formal specifications is to use graphically-based, semi-formal specifications such as those used in many object-oriented specification methodologies. While semi-formal specifications are generally easier to develop and understand, they lack the rigor and precision of formal specification techniques. The basic premise of this investigation is that formal software specifications can be constructed using correctness preserving transformations from graphically-based object-oriented representations. In this investigation, object-oriented specifications defined using Rumbaugh's Object Modeling Technique …
Performance Study Of A Brazilian Air Force Data Communications Network, Oswaldo Zanelli
Performance Study Of A Brazilian Air Force Data Communications Network, Oswaldo Zanelli
Theses and Dissertations
This thesis consists of a performance analysis of two network models using different protocols, the X.25 and Asynchronous Transfer Mode (ATM). X.25 is currently used in the data communications network infrastructure in the Brazilian Air Force. ATM is a high speed network technology. Simulations of both models were performed to compare the two technologies. This study examines the traffic load that each network can handle while still providing a good quality of service (QoS). The X.25 network model proved to have a sufficient capacity to handle the projected workload, but it presented a low QoS when a more intense traffic …
On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen
On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen
Research Collection Lee Kong Chian School Of Business
A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number …
Heterogeneous Radial Basis Function Networks, Tony R. Martinez, D. Randall Wilson
Heterogeneous Radial Basis Function Networks, Tony R. Martinez, D. Randall Wilson
Faculty Publications
Radial Basis Function (RBF) networks typically use a distance function designed for numeric attributes, such as Euclidean or city-block distance. This paper presents a heterogeneous distance function which is appropriate for applications with symbolic attributes, numeric attributes, or both. Empirical results on 30 data sets indicate that the heterogeneous distance metric yields significantly improved generalization accuracy over Euclidean distance in most cases involving symbolic attributes.
A Robust System For Natural Spoken Dialogue, Eric K. Ringger, James F. Allen, Bradford W. Miller, Teresa Sikorski
A Robust System For Natural Spoken Dialogue, Eric K. Ringger, James F. Allen, Bradford W. Miller, Teresa Sikorski
Faculty Publications
This paper describes a system that leads us to believe in the feasibility of constructing natural spoken dialogue systems in task-oriented domains. It specifically addresses the issue of robust interpretation of speech in the presence of recognition errors. Robustness is achieved by a combination of statistical error post-correction, syntactically- and semantically-driven robust parsing, and extensive use of the dialogue context. We present an evaluation of the system using time-to-completion and the quality of the final solution that suggests that most native speakers of English can use the system successfully with virtually no training.
Specifying Object-Oriented Federated Database From Existing Databases, Ee Peng Lim, M. L. Lim, J. Srivastava
Specifying Object-Oriented Federated Database From Existing Databases, Ee Peng Lim, M. L. Lim, J. Srivastava
Research Collection School Of Computing and Information Systems
In this paper, we present a mapping strategy that is based on a proposed set of DB integration operations. We first define an OO federated DB as a virtual view on multiple OO export DBs. Our DB mapping strategy systematically derives each of the class extents, deep class extents and relationships of the federated DB using an operator tree consisting of the integration operations. This mapping approach differs from the other existing approaches in that it is algebraic based, and is therefore very suitable for implementing federated query processing.
Towards Designing A Knowledge-Based Tutoring System : Sql-Tutor As An Example, Gang Zhou
Towards Designing A Knowledge-Based Tutoring System : Sql-Tutor As An Example, Gang Zhou
Dissertations
A Knowledge-Based Tutoring System, also sometimes called an Intelligent Tutoring System, is a computer based instructional system that uses artificial intelligence techniques to help people learn some subject. The goal of the system is to provide private tutoring to its students based on their different backgrounds, requests, and interests. The system knows what subject materials it should teach, when and how to teach them, and can diagnose the mistakes made by the students and help them correct the mistakes.
The major objective of this dissertation is to investigate and develop a generic framework upon which we can build a Knowledge-Based …
Pattern Discovery In Sequence Databases : Algorithms And Applications To Dna/Protein Classification, Gung-Wei Chirn
Pattern Discovery In Sequence Databases : Algorithms And Applications To Dna/Protein Classification, Gung-Wei Chirn
Dissertations
Sequence databases comprise sequence data, which are linear structural descriptions of many natural entities. Approximate pattern discovery in a sequence database can lead to important conclusions or prediction of new phenomena. Traditional database technology is not suitable for accomplishing the task, and new techniques need to be developed.
In this dissertation, we propose several new techniques for discovering patterns in sequence databases. Our techniques incorporate pattern matching algorithms and novel heuristics for discovery and optimization. Experimental results of applying the techniques to both generated data and DNA/proteins show the effectiveness of the proposed techniques.
We then develop several classifiers using …
Knowledge Discovering For Document Classification Using Tree Matching In Texpros, Ching-Song Wei
Knowledge Discovering For Document Classification Using Tree Matching In Texpros, Ching-Song Wei
Dissertations
This dissertation describes a knowledge-based system for classifying documents based upon the layout structure and conceptual information extracted from the content of the document. The spatial elements in a document are laid out in rectangular blocks which are represented by nodes in an ordered labelled tree, called the "layout structure tree" (L-S Tree). Each leaf node of a L-S Tree points to its corresponding block content. A knowledge Acquisition Tool (KAT) is devised to create a Document Sample Tree from L-S Tree, in which each of its leaves contains a node content conceptually describing its corresponding block content. Then, applying …
Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan
Integrating Hypertext With Information Systems Through Dynamic Mapping, Jiangling Wan
Dissertations
This dissertation presents a general hypertext model (GHMI) supporting integration of hypertext and information systems through dynamic mapping. Information systems integrated based on this model benefit from hypertext function-alities (such as linking, backtracking, history, guided tours, annotations, etc.) while preserving their own computation capabilities. Although systems supporting integration of hypertext and interface-oriented information systems do exist in hypertext literature, there is no existing model or system effectively supporting integration of hypertext and computation-oriented information systems. GHMI makes its major contributions by both extending and specifying the well-known Dexter Hypertext Reference Model. GHMI extends the Dexter model to overcome its limitations. …
Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu
Theory And Design Of Portable Parallel Programs For Heterogeneous Computing Systems And Networks, Ying-Chieh Wu
Dissertations
A recurring problem with high-performance computing is that advanced architectures generally achieve only a small fraction of their peak performance on many portions of real applications sets. The Amdahl's law corollary of this is that such architectures often spend most of their time on tasks (codes/algorithms and the data sets upon which they operate) for which they are unsuited. Heterogeneous Computing (HC) is needed in the mid 90's and beyond due to ever increasing super-speed requirements and the number of projects with these requirements. HC is defined as a special form of parallel and distributed computing that performs computations using …
Segmenting Workstation Screen Images, Denis M. Serenyi
Segmenting Workstation Screen Images, Denis M. Serenyi
Dartmouth College Undergraduate Theses
No abstract provided.
Abstract Index Interfaces, Muralidharan Janakiraman
Abstract Index Interfaces, Muralidharan Janakiraman
Dissertations and Theses
An index in a database system interacts with many of the software modules in the system. For systems supporting a wide range of index structures, interfacing the index code with the rest of the system poses a great problem. The problems are an order of magnitude more for adding new access methods to the system. These problems could be reduced manifold if common interfaces could be specified for different access methods. It would be even better, if these interfaces could be made database-system independent. This thesis addresses the problem of defining generic index interfaces for access methods in database systems. …
Contention-Free Scheduling Of Communication Induced By Array Operations On 2d Meshes, Andreas Bernhard Georg Eberhart
Contention-Free Scheduling Of Communication Induced By Array Operations On 2d Meshes, Andreas Bernhard Georg Eberhart
Dissertations and Theses
Whole array operations and array section operations are important features of many data-parallel languages. Efficient implementation of these operations on distributed-memory multicomputers is critical to the scalability and high-performance of data-parallel programs. This thesis presents an approach for analyzing communication patterns induced by array operations and for using run-time information to schedule the message flow. The distributed, dynamic scheduling algorithms guarantee link-contention-free data transfer and utilize network resources almost optimally. They incur little overhead, which is important in order not to reduce the speedup gained by the parallel execution. The algorithms can be used by compilers for the generation of …
A Brief Introduction To Formal Methods, Paul E. Black, Kelly M. Hall, Michael D. Jones, Trent N. Larson, Phillip J. Windley
A Brief Introduction To Formal Methods, Paul E. Black, Kelly M. Hall, Michael D. Jones, Trent N. Larson, Phillip J. Windley
Faculty Publications
As hardware designs grow in size and complexity, current design methods are proving less adequate. Current methods for specification, design, and test are typically empirical or informal, that is, they are based on experience and argument. Formal methods are solidly based on mathematical logic systems and precise rules of inference. Formal methods offer a discipline which complements current methods so designers can successfully meet the demand for high performance systems. Formal methods covers a broad and diverse set of techniques aimed at improving computer correctness. This paper explains the role of specifications and implementation models in formal methods, and different …
Automating Transformational Design For Distributed Programs, Champak Das
Automating Transformational Design For Distributed Programs, Champak Das
FIU Electronic Theses and Dissertations
We address the problem of designing concurrent, reactive, nonterminating programs. Our approach to developing concurrent programs involves the use of correctness-preserving transformations to realize each step of program development. The transformations we have designed automatically guarantee the preservation of the deadlock freedom property, and hence deadlock freedom does not have to be manually verified after each development step. Since our transformations are syntactic, they are easily mechanizable as well. This makes syntactic transformations particularly appealing for the development of large, complex, and correct distributed systems, where a manual approach would be prohibitively expensive. In this work we present a set …
Ideals Of The Lipschitz Class, Konstantin G. Kulev
Ideals Of The Lipschitz Class, Konstantin G. Kulev
Honors Theses
In this paper, a classification of the closed ideals of the Little Oh Lipschitz class of functions on the interval [0,1] is provided. The technique used to classify the ideals of the class of continuous functions is modified and applied to the Little Oh Lipschitz class. It is shown that every ideal of these two classes has the form I = {f : flE = 0} for some closed set E C [0, 1]. Furthermore, it is demonstrated that the same technique cannot be successfully applied to the classification of the closed ideals of the Big Oh Lipschitz class.
Communication Games, Kimberly I. Noonan
Communication Games, Kimberly I. Noonan
Honors Theses
A communication game combines traditional n-person game theory with graph theory. The result is a model of a bargaining situation where communication is restricted. The game's multilinear extension (MLE), a polynomial that summarizes the solutions of the game, is well known for the case where the graph is a tree or simple cycle. This paper simplifies the computation of MLE of the communication game in the case when the graph is a series of simple cycles. The results are then applied to studying the power of each Canadian province in passing an amendment to the constitution, taking geographic location into …
Mobile Agents For Mobile Computing, Robert Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko
Mobile Agents For Mobile Computing, Robert Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko
Computer Science Technical Reports
Mobile agents are programs that can move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents have the potential to provide a convenient, efficient and robust programming paradigm for distributed applications, particularly when partially connected computers are involved. Partially connected computers include mobile computers such as laptops and personal digital assistants as well as modem-connected home computers, all of which are often disconnected from the network. In this paper, we describe the design and implementation of our mobile-agent system, Agent Tcl, …