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 (2960)
- Wright State University (632)
- Walden University (447)
- Selected Works (287)
- New Jersey Institute of Technology (137)
-
- University of Nebraska at Omaha (119)
- California State University, San Bernardino (96)
- Old Dominion University (95)
- San Jose State University (85)
- University of Dayton (82)
- The University of Maine (67)
- City University of New York (CUNY) (65)
- University of Nebraska - Lincoln (54)
- Air Force Institute of Technology (53)
- SelectedWorks (53)
- Technological University Dublin (51)
- University of South Florida (50)
- Kennesaw State University (46)
- Nova Southeastern University (43)
- Claremont Colleges (42)
- University of Wisconsin Milwaukee (42)
- University of Arkansas, Fayetteville (41)
- Western Kentucky University (41)
- Dakota State University (39)
- Institute of Business Administration (38)
- California Polytechnic State University, San Luis Obispo (36)
- Western University (35)
- Ateneo de Manila University (34)
- Governors State University (34)
- Purdue University (34)
- Keyword
-
- Machine learning (100)
- Information technology (93)
- Data mining (89)
- Social media (78)
- Twitter (64)
-
- Machine Learning (57)
- Cybersecurity (54)
- Semantic Web (54)
- Deep learning (52)
- Artificial intelligence (49)
- Online learning (49)
- Information Technology (47)
- Classification (46)
- Cloud computing (45)
- Information retrieval (45)
- Privacy (45)
- Big data (44)
- Database (43)
- Ontology (43)
- Computer science (42)
- Information security (41)
- Algorithms (40)
- Security (40)
- Databases (39)
- Information systems (39)
- Management (37)
- Clustering (36)
- Data Mining (36)
- Northern Ohio Data and Information Service (NODIS) (36)
- Technology (35)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (2866)
- Kno.e.sis Publications (541)
- Walden Dissertations and Doctoral Studies (447)
- Theses and Dissertations (116)
- Dissertations (107)
-
- Computer Science Faculty Publications (91)
- Computer Science and Engineering Faculty Publications (91)
- Theses Digitization Project (84)
- Master's Projects (68)
- Information Systems and Quantitative Analysis Faculty Proceedings & Presentations (64)
- Electronic Theses and Dissertations (55)
- Dissertations and Theses Collection (Open Access) (50)
- Theses (46)
- USF Tampa Graduate Theses and Dissertations (46)
- CCE Theses and Dissertations (42)
- Information Systems and Quantitative Analysis Faculty Publications (41)
- Kyriakos MOURATIDIS (40)
- CGU Faculty Publications and Research (37)
- International Conference on Information and Communication Technologies (36)
- Open Educational Resources (34)
- Department of Information Systems & Computer Science Faculty Publications (33)
- All Capstone Projects (32)
- Graduate Theses and Dissertations (32)
- Masters Theses & Doctoral Dissertations (32)
- Articles (29)
- Conference papers (28)
- David LO (28)
- Journal of Spatial Information Science (28)
- All Maxine Goodman Levin School of Urban Affairs Publications (27)
- Saverio Perugini (25)
- Publication Type
Articles 6601 - 6630 of 6717
Full-Text Articles in Physical Sciences and Mathematics
Using Database Technology To Support Domain-Oriented Application Composition Systems, Danny A. Cecil, Joseph A. Fullenkamp
Using Database Technology To Support Domain-Oriented Application Composition Systems, Danny A. Cecil, Joseph A. Fullenkamp
Theses and Dissertations
This research designed and prototyped an OODBMS technology base to store and retrieve various types of domain artifacts for domain-oriented application composition systems (DOACS). We developed object-oriented database schemas for a validating domain and the Object-Connection-Update software architecture. We implemented an inheritance relationship between the schemas so a domain model can inherit an architectural structure from an architecture model allowing us to isolate domain-specific knowledge from architecture-specific knowledge. We also developed a meta-model to formally define domain models in the database. We then developed a set of database methods to transform a domain model into a database schema for storing …
Performance Measurement Of Three Commercial Object-Oriented Database Management Systems, Timothy J. Halloran
Performance Measurement Of Three Commercial Object-Oriented Database Management Systems, Timothy J. Halloran
Theses and Dissertations
The goal of this thesis was to study the performance of three commercial object-oriented database management systems. The commercial systems studied included Itasca, sold by Itasca Systems Incorporated Matisse, sold by Intellitic International and ObjectStore, sold by Object Design Incorporated. To examine performance of these database management systems two benchmarks were run the OO1 benchmark and a new AFIT Simulation benchmark. The OO1 benchmark was designed, implemented, and run on all three database management systems. ObjectStore was our top performer on all configurations of the OO1 benchmark. The AFIT Simulation benchmark was designed, implemented, and run on the ObjectStore database …
Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava
Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
We propose a new (and restricted) model for global transactions which allows asynchronous commitment of subtransactions. Our model requires each global transaction to have a fixed structure with update to the data in at most one database. Based on this transaction model, we present two concurrency control algorithms, namely Asynchronous Site Graph and Asynchronous VirtGlobalSG, which employ asynchronous commitment and achieve global serializability. Compared to other proposed algorithms, our algorithms employ asynchronous commitment so as to increase transaction performance. Furthermore, our algorithms do not put restrictions on transaction data access or local histories.
An Interface Between The Grass Geographic Information System And Oracle Relational Detabase Management System, David Gordon Buker
An Interface Between The Grass Geographic Information System And Oracle Relational Detabase Management System, David Gordon Buker
FIU Electronic Theses and Dissertations
A query and display interface has been developed between the GRASS geographic information system and the SQL-based ORACLE relational database management system (DBMS) . This interface enables multiple non-spatial attributes of GRASS map features to be maintained with the DBMS. GRASS alone is capable of storing only one attribute per feature. The interface allows the user to provide both spatial (GRASS) and non-spatial (SQL) selection criteria for any query. Spatial selection methods include picking items from the GRASS map with a mouse, and specifying areas of interest with user-drawn (via a mouse) polygons and transects. The results of the combined …
Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava
Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., a single query can be transformed into a set ofclosely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unijied multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subezpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs forall queries at once. In this paper, …
Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava
Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
No abstract provided.
Establishing A Distributed Processing And Distributed Database Environment For Intergraph Mge & Orscle Products, Praveen Chandrasekhar
Establishing A Distributed Processing And Distributed Database Environment For Intergraph Mge & Orscle Products, Praveen Chandrasekhar
Electronic Dissertations and Theses
The department of Agricultural Economics undertake various government contracts for GIS based applications. Currently, they have multi-year contracts with the Louisiana Department of Health and Hospitals (LDHH). This contract is carried out in the Agricultural Economics Geographical Information System lab (AEGIS). One part of the contract is to integrate a heterogenous system comprising of PCs and Intergraph workstations so that the PC can share the data or Microstation Geographical information system Environment (MGE) and ORACLE based applications. Since the Department also undertakes other contracts which requires them to use ARC/INFOR as the front-end while the data would reside in ORACLE …
Semantics-Based Information Brokering: A Step Towards Realizing The Infocosm, Vipul Kashyap, Amit P. Sheth
Semantics-Based Information Brokering: A Step Towards Realizing The Infocosm, Vipul Kashyap, Amit P. Sheth
Kno.e.sis Publications
The rapid advances in computer and communication technologies, and their merger, is leading to a global information market place. It will consist of federations of very large number of information systems that will cooperate to varying extents to support the users' information needs. We propose an architecture which may facilitate meeting these needs. It consists of three main components: information providers, information brokers and information consumers. We also propose an approach to information brokering. We discuss two of it's tasks: information resource discovery, which identities relevant information sources for a given query, and query processing, which involves the generation of …
Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava
Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
Entity identification is the problem of matching object instances from different databases which correspond to the same real-world entity. In this paper, we present a 2-step entity identification process in which attributes for matching tuples may be missing in certain tuples, and thus need to be derived prior to the matching. To match tuples, we require identity rules which specify the conditions to be satisfied by a pair of tuples, from different databases, before they can be considered as modeling the same real-world entity. We also introduce ILFD's (instance-level functional dependencies) as a form of inference rules which derive the …
Specifying And Enforcing Intertask Dependencies, Paul Attie, Munindar Singh, Amit P. Sheth, Marek Rusinkiewicz
Specifying And Enforcing Intertask Dependencies, Paul Attie, Munindar Singh, Amit P. Sheth, Marek Rusinkiewicz
Kno.e.sis Publications
Extensions of the traditional atomic transaction model are needed to support the development of multi-system applications or workflows that access heterogeneous databases and legacy application systems. Most extended transaction models use conditions involving events or dependencies between transactions. Intertask dependencies can serve as a uniform framework for defining extended transaction models. In this paper we introduce event attributes needed to determine whether a dependency is enforceable and to properly schedule events in extended transaction models. Using these attributes and a formalization of a dependency into the temporal logic CTL, we can automatically synthesize an automaton that captures the computations that …
Memory-Adaptive External Sorting, Hwee Hwa Pang, Michael J. Carey, Miron Livny
Memory-Adaptive External Sorting, Hwee Hwa Pang, Michael J. Carey, Miron Livny
Research Collection School Of Computing and Information Systems
In real-time and goal-oriented database systems, the amount of memory assigned to queries that sort or join large relations may fluctuate due to contention from other higher priority transactions. This study focuses on techniques that enable external sorts both to reduce their buffer usage when they lose memory, and to effectively utilize any additional buffers that are given to them. We also show how these techniques can be extended to work with sort-merge joins. A series of experiments confirms that our proposed techniques are useful for sorting and joining large relations in the face of memory fluctuations.
A Framework For Controlling Cooperative Agents, Kuo-Chu Lee, William H. Mansfield, Amit P. Sheth
A Framework For Controlling Cooperative Agents, Kuo-Chu Lee, William H. Mansfield, Amit P. Sheth
Kno.e.sis Publications
Presents an overview of the ITX (Interacting Transaction) system, which supports complex interactions among cooperating agents in the presence of user interventions that change application objectives and system failures. The system's components and its unique fixed-point criterion for feedback control of iterative interactions are described. An example of a simplified multimedia teleconferencing application is discussed to illustrate the features of the ITX system.
A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton
A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton
Theses and Dissertations
The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …
Partially Preemptible Hash Joins, Hwee Hwa Pang, Michael J. Carey, Miron Livny
Partially Preemptible Hash Joins, Hwee Hwa Pang, Michael J. Carey, Miron Livny
Research Collection School Of Computing and Information Systems
With the advent of real-time and goal-oriented database systems, priority scheduling is likely to be an important feature in future database management systems. A consequence of priority scheduling is that a transaction may lose its buffers to higher-priority transactions, and may be given additional memory when transactions leave the system. Due to their heavy reliance on main memory, hash joins are especially vulnerable to fluctuations in memory availability. Previous studies have proposed modifications to the hash join algorithm to cope with these fluctuations, but the proposed algorithms have not been extensively evaluated or compared with each other. This paper contains …
Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson
Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson
Research Collection School Of Computing and Information Systems
The objective of entity identification is to determine the correspondence between object instances from more than one database. Entity identification at the instance level, assuming that schema level heterogeneity has been resolved a priori, is examined. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. The use of extended key, which is the union of keys, and possibly other attributes, from the relations to be matched, and its corresponding identify rule are proposed to determine the equivalence …
Federated Autonomous Databases: Project Overview, Satya Prabhakar, Jiandong Huang, James Richardson, Jaideep Srivastava, Ee Peng Lim, Sham Navathe, Ashok Savarase, Mark Foresti
Federated Autonomous Databases: Project Overview, Satya Prabhakar, Jiandong Huang, James Richardson, Jaideep Srivastava, Ee Peng Lim, Sham Navathe, Ashok Savarase, Mark Foresti
Research Collection School Of Computing and Information Systems
The paper presents an overview of an ongoing research program, Federated Autonomous Databases, sponsored by Rome Laboratory (US Air Force) and conducted by Honeywell in collaboration with the University of Minnesota and Georgia Institute of Technology. This program is exploratory in nature and is aimed at understanding and solving, within the scope of the program definition, the problem of providing integrated access to distributed, heterogeneous and autonomous databases.
A Distributed Object-Oriented Database Application Design, Hsin-Feng Edward Wu
A Distributed Object-Oriented Database Application Design, Hsin-Feng Edward Wu
Theses and Dissertations
The purpose of this study is to analyze and develop a distributed object-oriented database management system (DOODBMS) application to support parallel software development of the Parallel Algorithms and Applications Group (PAAG) at AFIT. By following the software lifecycle of object-oriented paradigm, this thesis investigation is intended to generate requirements analysis, design, implementation, user interface design and implementation, and integration of the database application with the user interface. ITASCA, an existing DOODBMS platform, has been chosen to prototype the application for its distribution functionalities and object-oriented modeling power. The user interface of the database application is based on X-window OSF/Motif front-end …
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 …
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.
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.
Search For Τ-→Γμ-: A Test Of Lepton Number Conservation, A. Bean, M. Thulasidas
Search For Τ-→Γμ-: A Test Of Lepton Number Conservation, A. Bean, M. Thulasidas
Research Collection School Of Computing and Information Systems
A search for the lepton mumber violating decay of the τ lepton to the γμ final state has been performed with the CLEO II detector at the Cornell e+e− storage ring CESR. In a data sample that corresponds to an integrated luminosity of 1.55 fb−1, we observe no candidates in the signal region. We thus determine an upper limit of B(τ−→γμ−)
So Far (Schematically) Yet So Near (Semantically), Amit P. Sheth, Vipul Kashyap
So Far (Schematically) Yet So Near (Semantically), Amit P. Sheth, Vipul Kashyap
Kno.e.sis Publications
In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic affinity. In this paper we try to reconcile the two perspectives. We first define the concept of semantic proximity and provide a semantic taxonomy. We then enumerate and classify the schematic and data conflicts. We discuss possible semantic similarities between two objects that have various types of schematic and data conflicts. Issues of uncertain information and inconsistent information are also addressed.
On Transactional Workflows, Amit P. Sheth, Marek Rusinkiewicz
On Transactional Workflows, Amit P. Sheth, Marek Rusinkiewicz
Kno.e.sis Publications
The basic transaction model has evolved over time to incorporate more complex transactions structures and to take the advantage of semantics of higher-level operations that cannot be seen at the level of page reads and writes. Well known examples of such extended transaction models include nested and multi-level transactions. A number of relaxed transaction models have been defined in the last several years that permit a controlled relaxation of the transaction isolation and atomicity to better match the requirements of various database applications. Correctness criteria other than global serializability have also been proposed. Several examples of extended/relaxed transaction models are …
Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool
Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool
Agriculture reports
This paper presents a summary of the main features of the digital mapping data available in the Peel-Harvey Catchment area. This type of information is essential for Geographic Information System (GIS) users to assess projects involving the use of digital data such as plotting of mapped themes, topological overlays, area calculations and reporting.
Tau Decays With One Charged Particle Plus Multiple Π0'S, M. Procario, Manoj Thulasidas
Tau Decays With One Charged Particle Plus Multiple Π0'S, M. Procario, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
With the CLEO-II detector at the Cornell Electron Storage Ring, we have measured branching fractions for tau lepton decay into one-prong final states with multiple π0’s B0hnπ, normalized to the branching fraction for tau decay into one charged particle and a single π0. We find B0h2π/B0hπ=0.345±0.006±0.016, B0h3π/B0hπ=0.041 ±0.003±0.005, and B0h4π/B0hπ=0.006±0.002±0.002.
Observation Of The Charmed Baryon C+ And Measurement Of The Isospin Mass Splittings Of The C, Crawford, G.; Et Al., M. Thulasidas
Observation Of The Charmed Baryon C+ And Measurement Of The Isospin Mass Splittings Of The C, Crawford, G.; Et Al., M. Thulasidas
Research Collection School Of Computing and Information Systems
No abstract provided.
Evidence For Penguin-Diagram Decays: First Observation Of B→K*(892)Γ, R. Ammar, M. Thulasidas
Evidence For Penguin-Diagram Decays: First Observation Of B→K*(892)Γ, R. Ammar, M. Thulasidas
Research Collection School Of Computing and Information Systems
We have observed the decays B0→K*(892)0γ and B−→K*(892)−γ, which are evidence for the quark-level process b→sγ. The average branching fraction is (4.5±1.5±0.9)×10−5. This value is consistent with standard model predictions from electromagnetic penguin diagrams.
Study Of D0 Decays Into K̄0 And K̄*0, M. Procario, M. Thulasidas
Study Of D0 Decays Into K̄0 And K̄*0, M. Procario, M. Thulasidas
Research Collection School Of Computing and Information Systems
Using the CLEO II detector at CESR we have studied D0 decays into final states with a ¯K0 or ¯K*0, and have measured branching ratios for the decay modes D0→(¯K0¯K*0)π0, η, η′. These results are compared with predictions of various charm decay models, and contributions of final-state interactions are discussed.
Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas
Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
We report results from a search for the decays B0→π+π-, B0→K+π-, and B0→K+K-. We find 90% confidence level upper limits on the branching fractions, Bππ