Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

2004

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 451 - 480 of 797

Full-Text Articles in Computer Sciences

Behavior-Based System For Generation Of Security Solutions, Shobha Potluri, Pranathi Venkatayogi, Bharat Bhargava Mar 2004

Behavior-Based System For Generation Of Security Solutions, Shobha Potluri, Pranathi Venkatayogi, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Simulation Study Of A Cellular Aided Mobile Ad-Hoc Network, Gang Ding, Xiaoxin Wu, Bharat Bhargava, Shan Lei Mar 2004

Simulation Study Of A Cellular Aided Mobile Ad-Hoc Network, Gang Ding, Xiaoxin Wu, Bharat Bhargava, Shan Lei

Department of Computer Science Technical Reports

No abstract provided.


Security Issues In Querying Encrypted Data, Murat Kantarioglu, Chris Clifton Mar 2004

Security Issues In Querying Encrypted Data, Murat Kantarioglu, Chris Clifton

Department of Computer Science Technical Reports

No abstract provided.


Recycling Garbage Theory, Christian Grothoff Mar 2004

Recycling Garbage Theory, Christian Grothoff

Department of Computer Science Technical Reports

No abstract provided.


Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis Mar 2004

Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1 , q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query returns the data point p that minimizes the sum of Euclidean distances |pqi| for 1 ≤i ≤3. Assuming that Q fits in memory and P is indexed by an R-tree, we propose several algorithms for finding the group nearest neighbors efficiently. As a second step, …


Comparative Analysis Of Active And Passive Mapping Techniques In An Internet-Based Local Area Network, James B. Kuntzelman Mar 2004

Comparative Analysis Of Active And Passive Mapping Techniques In An Internet-Based Local Area Network, James B. Kuntzelman

Theses and Dissertations

Network mapping technologies allow quick and easy discovery of computer systems throughout a network. Active mapping methods, such as using nmap, capitalize on the standard stimulus-response of network systems to probe target systems. In doing so, they create extra traffic on the network, both for the initial probe and for the target system's response. Passive mapping methods work opportunistically, listening for network traffic as it transits the system. As such, passive methods generate minimal network traffic overhead. Active methods are still standard methods for network information gathering; passive techniques are not normally used due to the possibility of missing important …


Packet Analysis Of Unmodified Bluetooth Communication Devices, Neal A. Watts Mar 2004

Packet Analysis Of Unmodified Bluetooth Communication Devices, Neal A. Watts

Theses and Dissertations

Bluetooth technology has potential for widespread use within the Department of Defense and the Air Force. An office environment using Bluetooth technology can wirelessly connect computers, printers, and other office equipment in order to share information over short distances. The clutter and annoyance of cables connecting equipment can be eliminated. Bluetooth provides a standard interface for connection, as opposed to many different proprietary cables. The research is conducted indoors in a climate controlled environment, with minimal obstructions, to closely follow free-space signal propagation. Four different antenna orientations are used. The factors varied are the distance between devices, and the antenna …


Agent Based Simulation Seas Evaluation Of Dodaf Architecture, Gregory V. Destefano Mar 2004

Agent Based Simulation Seas Evaluation Of Dodaf Architecture, Gregory V. Destefano

Theses and Dissertations

With Department of Defense (DoD) weapon systems being deeply rooted in the command, control, communications, computers, intelligence, surveillance, and reconnaissance (C4ISR) structure, it is necessary for combat models to capture C4ISR effects in order to properly assess military worth. Unlike many DoD legacy combat models, the agent based model System Effectiveness and Analysis Simulation (SEAS) is identified as having C4ISR analysis capabilities. In lieu of requirements for all new DoD C4ISR weapon systems to be placed within a DoD Architectural Framework (DoDAF), investigation of means to export data from the Framework to the combat model SEAS began. Through operational, system, …


Investigation Of Geobase Implementation Issues: Case Study Of Information Resource Management, Mario L. Oliver Mar 2004

Investigation Of Geobase Implementation Issues: Case Study Of Information Resource Management, Mario L. Oliver

Theses and Dissertations

Billions of dollars have been wasted on failed information system (IS) projects over the last decade in the private and public sectors. More specifically, the tri-service environment of the U.S. military has not implemented a single successful geospatial IS (GIS). The lack of a service-wide insertion process for GIS was cited as the most significant cause for military GIS failures. GeoBase represents the USAF's most recent GIS implementation. The GeoBase program focuses on Information Resource Management (IRM) and cultural issues. The GeoBase Sustainment Model (GSM), anecdotally developed by GeoBase leadership to reflect implementation issues and the IRM practices of the …


Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen Mar 2004

Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen

Research Collection School Of Computing and Information Systems

Elucidation of the interaction of proteins with different molecules is of significance in the understanding of cellular processes. Computational methods have been developed for the prediction of protein-protein interactions. But insufficient attention has been paid to the prediction of protein-RNA interactions, which play central roles in regulating gene expression and certain RNA-mediated enzymatic processes. This work explored the use of a machine learning method, support vector machines (SVM), for the prediction of RNA-binding proteins directly from their primary sequence. Based on the knowledge of known RNA-binding and non-RNA-binding proteins, an SVM system was trained to recognize RNA-binding proteins. A total …


Natural Xml For Data Binding, Processing, And Persistence, George K. Thiruvathukal, Konstantin Läufer Mar 2004

Natural Xml For Data Binding, Processing, And Persistence, George K. Thiruvathukal, Konstantin Läufer

Computer Science: Faculty Publications and Other Works

The article explains what you need to do to incorporate XML directly into your computational science application. The exploration involves the use of a standard parser to automatically build object trees entirely from application-specific classes. This discussion very much focuses on object-oriented programming languages such as Java and Python, but it can work for non-object-oriented languages as well. The ideas in the article provide a glimpse into the Natural XML research project.


Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei Mar 2004

Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei

Research Collection School Of Computing and Information Systems

Users see the database interface as the database system. A good interface enables them to formulate queries better. The semantics communicated through the interface can be classified according to abstraction levels, such as the conceptual and logical levels. With the conceptual interface, interaction is in terms of real-world concepts such as entities, objects and relationships. Current user-database interaction is mainly based on the logical interface, where interaction is in terms of abstract database concepts such as relations and joins. Many researchers argue that end users will perform better with the conceptual interface. This research tested this claim, as well as …


Spatial Queries In The Presence Of Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu Mar 2004

Spatial Queries In The Presence Of Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu

Research Collection School Of Computing and Information Systems

Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are directly reachable. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbors, e-distance joins and closest pairs, considering that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified …


An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim Mar 2004

An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The huge amount of information available on the Web has attracted many research efforts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in …


Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan Mar 2004

Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not necessarily secure, there must be provisions for validating their outputs. This paper proposes a mechanism that creates a verification object (VO) for checking the integrity of each query result produced by an edge server - that values in the result tuples are not tampered with, and that no spurious tuples are introduced. The primary advantages of our proposed mechanism are that the VO is independent of the database size, and that …


Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan Mar 2004

Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage volumes that are accessible over open network. This potentially exposes the data to heightened security risks. We propose two mechanisms, in the context of a steganographic file system, to mitigate the risk of attacks initiated through analyzing data accesses from user applications. The first mechanism is intended to counter attempts to locate data through updates in between snapshots - in short, update analysis. The second mechanism prevents traffic analysis - identifying …


The Evolution Of Research On Information Systems: A Fiftieth Year Survey Of The Literature In Management Science, Rajiv D. Banker, Robert J. Kauffman Mar 2004

The Evolution Of Research On Information Systems: A Fiftieth Year Survey Of The Literature In Management Science, Rajiv D. Banker, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

The development of the information systems (IS) literature in Management Science during the past 50 years reflects the inception, growth, and maturation of several different research streams. The five research streams we identify incorporate different definitions of the managerial problems that relate to IS, the alternate theoretical perspectives and different methodological paradigms to study them, and the levels of the organization at which their primary results impact managerial practice. The decision support and design science research stream studies the application of computers in decision support, control, and managerial decision making. The value of information research stream reflects relationships established based …


Tool Support For Model Based Architectural Design For Automotive Control Systems, Kevin Steppe Mar 2004

Tool Support For Model Based Architectural Design For Automotive Control Systems, Kevin Steppe

Research Collection School Of Computing and Information Systems

In conjunction with Ford Motor Company, we built a tool to support multilevel architectural design. The tool, called Synergy, allows Ford to visually design architectures of vehicle control components. The components are imported from existing Simulink models; then the tool automatically generates a detailed view showing all required connections and ports. The resulting model is exported to Simulink for further analysis. In this paper we describe the conceptual and technical challenges encountered in building Synergy and our design choices for solving them.


A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng Mar 2004

A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Within the overall context of protection of health care information, privacy of prescription data needs special treatment. First, the involvement of diverse parties, especially nonmedical parties in the process of drug prescription complicates the protection of prescription data. Second, both patients and doctors have privacy stakes in prescription, and their privacy should be equally protected. Third, the following facts determine that prescription should not be processed in a truly anonymous manner: certain involved parties conduct useful research on the basis of aggregation of prescription data that are linkable with respect to either the patients or the doctors; prescription data has …


A Modeling Framework For Computing Lifetime And Information Capacity In Wireless Sensor Networks, Enrique Duarte-Melo, Mingyan Liu, Archan Misra Mar 2004

A Modeling Framework For Computing Lifetime And Information Capacity In Wireless Sensor Networks, Enrique Duarte-Melo, Mingyan Liu, Archan Misra

Research Collection School Of Computing and Information Systems

In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluidflow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates.


Phoneme-Based Transliteration Of Foreign Names For Oov Problem, Wei Gao, Kam-Fai Wong, Wai Lam Mar 2004

Phoneme-Based Transliteration Of Foreign Names For Oov Problem, Wei Gao, Kam-Fai Wong, Wai Lam

Research Collection School Of Computing and Information Systems

A proper noun dictionary is never complete rendering name translation from English to Chinese ineffective. One way to solve this problem is not to rely on a dictionary alone but to adopt automatic translation according to pronunciation similarities, i.e. to map phonemes comprising an English name to the phonetic representations of the corresponding Chinese name. This process is called transliteration. We present a statistical transliteration method. An efficient algorithm for aligning phoneme chunks is described. Unlike rule-based approaches, our method is data-driven. Compared to source-channel based statistical approaches, we adopt a direct transliteration model, i.e. the direction of probabilistic estimation …


An Information-Theoretic Framework For Optimal Location Tracking In Multi-System 4g Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das Mar 2004

An Information-Theoretic Framework For Optimal Location Tracking In Multi-System 4g Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das

Research Collection School Of Computing and Information Systems

An information-theoretic framework is developed for optimal location management in multisystem, fourth generation (4G) wireless networks. The framework envisions that each individual subsystem operates fairly independently, and does not require public knowledge of individual subnetwork topologies. To capture the variation in paging and location update costs in this heterogeneous environment, the location management problem is formulated in terms of a new concept of weighted entropy. The update process is based on the Lempel-Ziv compression algorithms, which are applied to a vector-valued sequence consisting of both the mobile's movement pattern and its session activity state. Three different tracking strategies which differ …


Clash: A Protocol For Internet-Scale Utility-Oriented Distributed Computing, Archan Misra, Paul Castro, Jinwon Lee Mar 2004

Clash: A Protocol For Internet-Scale Utility-Oriented Distributed Computing, Archan Misra, Paul Castro, Jinwon Lee

Research Collection School Of Computing and Information Systems

Distributed hash table (DHT) overlay networks offer an efficient and robust technique for wire-area data storage and queries. Workload from real applications that use DHT networks will likely exhibit significant skews that can result in bottlenecks and failures that limit the overall scalability of the DHT approach. We present the content and load-aware scalable hashing (CLASH) protocol that can enhance the load distribution behavior of a DHT. CLASH relies on a variable-length identifier key scheme, where the length of any individual key is a function of load. CLASH uses variable-length keys to cluster content-related objects on single nodes to achieve …


Motion Planning For Formations Of Mobile Robots, T. D. Barfoot, Christopher M. Clark Feb 2004

Motion Planning For Formations Of Mobile Robots, T. D. Barfoot, Christopher M. Clark

Computer Science and Software Engineering

This paper is concerned with planning the motion of mobile robots in formation, which means certain geometrical constraints are imposed on the relative positions and orientations of the robots throughout their travel. Specifically, a method of planning motion for formations of mobile robots with non-holonomic constraints is presented. The kinematic equations developed allow a certain class of formations to be maintained while the group as a whole exhibits motion. The work was validated using the Stanford Micro-Autonomous RoverS Testbed.


Evaluating Location Predictors With Extensive Wi-Fi Mobility Data, Libo Song, David Kotz, Ravi Jain, Xiaoning He Feb 2004

Evaluating Location Predictors With Extensive Wi-Fi Mobility Data, Libo Song, David Kotz, Ravi Jain, Xiaoning He

Dartmouth Scholarship

Location is an important feature for many applications, and wireless networks can better serve their clients by anticipating client mobility. As a result, many location predictors have been proposed in the literature, though few have been evaluated with empirical evidence. This paper reports on the results of the first extensive empirical evaluation of location predictors, using a two-year trace of the mobility patterns of over 6,000 users on Dartmouth's campus-wide Wi-Fi wireless network. \par We implemented and compared the prediction accuracy of several location predictors drawn from two major families of domain-independent predictors, namely Markov-based and compression-based predictors. We found …


Keyjacking: The Surprising Insecurity Of Client-Side Ssl, John Marchesini, S W. Smith, Meiyuan Zhao Feb 2004

Keyjacking: The Surprising Insecurity Of Client-Side Ssl, John Marchesini, S W. Smith, Meiyuan Zhao

Computer Science Technical Reports

In theory, PKI can provide a flexible and strong way to authenticate users in distributed information systems. In practice, much is being invested in realizing this vision via client-side SSL and various client keystores. However, whether this works depends on whether what the machines do with the private keys matches what the humans think they do: whether a server operator can conclude from an SSL request authenticated with a user's private key that the user was aware of and approved that request. Exploring this vision, we demonstrate via a series of experiments that this assumption does not hold with standard …


Reasoning And Learning With Imperfect Casebases: An Agent Perspective With An Expert Model, Leen-Kiat Soh Feb 2004

Reasoning And Learning With Imperfect Casebases: An Agent Perspective With An Expert Model, Leen-Kiat Soh

School of Computing: Technical Reports

Traditionally, case-based reasoning (CBR) (e.g., Watson and Marir 1994) assumes that the cases in the casebase are correct, useful in both time and space. Otherwise, the cases would not have been stored in the casebase in the first place. Cases are supposed to be useful in guiding us to a successful solution, or in preventing us from repeating the same failure.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 4, February 2004, College Of Engineering And Computer Science, Wright State University Feb 2004

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 4, February 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


A Case Study Of Four Location Traces, Guanling Chen, David Kotz Feb 2004

A Case Study Of Four Location Traces, Guanling Chen, David Kotz

Computer Science Technical Reports

Location is one of the most important context information that an ubiquitous-computing application may leverage. Thus understanding the location systems and how location-aware applications interact with them is critical for design and deployment of both the location systems and location-aware applications. In this paper, we analyze a set of traces collected from two small-scale one-building location system and two large-scale campus-wide location systems. Our goal is to study characteristics of these location systems ant how these factors should be taken into account by a potentially large number of location-aware applications with different needs. We make empirical measurements of several important …


Application-Controlled Loss-Tolerant Data Dissemination, Guanling Chen, David Kotz Feb 2004

Application-Controlled Loss-Tolerant Data Dissemination, Guanling Chen, David Kotz

Computer Science Technical Reports

Reactive or proactive mobile applications require continuous monitoring of their physical and computational environment to make appropriate decisions in time. These applications need to monitor data streams produced by sensors and react to changes. When mobile sensors and applications are connected by low-bandwidth wireless networks, sensor data rates may overwhelm the capacity of network links or of the applications. In traditional networks and distributed systems, flow-control and congestion-control policies either drop data or force the sender to pause. When the data sender is sensing the physical environment, however, a pause is equivalent to dropping data. Arbitrary data drops are not …