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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 18481 - 18510 of 20624

Full-Text Articles in Entire DC Network

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design, Yitung Chen, Sean Hsieh Apr 2004

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design, Yitung Chen, Sean Hsieh

Separations Campaign (TRP)

The Advanced Fuel Cycle Initiative (AFCI) and Transmutation Research Program-University Participation Program (TRP-UPP) supported by Department of Energy of the United States have been developing many important technologies for the transmutation of nuclear waste to address long-term disposal issues. While successfully embedding AMUSE module into a dedicated System Engineering Model (TRPSEMPro), developed by the Nevada Center for Advanced Computational Methods (NCACM) at the University of Nevada-Las Vegas collaborating with Argonne National Laboratory (ANL), ANL is interested in further simulating the Light Water Reactor (LWR) Spent Fuel Treatment Facility (SFTF) combining commercial process simulation and analysis packages and core calculation of …

Go to article

Computer-Assisted Music Composition In The 32-Bar Jazz Standard Form, Chad Hogg Apr 2004

Computer-Assisted Music Composition In The 32-Bar Jazz Standard Form, Chad Hogg

Computer Science Honors Papers

The goal of this research project was to explore the potential for teaching a computer to compose jazz music. Specifically, the hope was to develop a method in which every decision could be made based on information about the entire system. If this problem were solved, the ancillary goal of allowing the user to set any arbitrary constraints that have global effects would be a trivial addition.

Go to article

Responding To Policies At Runtime In Trustbuilder, Bryan J. Smith Apr 2004

Responding To Policies At Runtime In Trustbuilder, Bryan J. Smith

Theses and Dissertations

Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach to negotiating trust is for the participants to exchange access control policies to inform each other of the requirements for establishing trust. When a policy is received at runtime, a compliance checker determines which credentials satisfy the policy so they can be disclosed. In situations where several sets of credentials satisfy a policy and some of the credentials are sensitive, a compliance checker that generates all the sets is necessary to insure that the negotiation succeeds …

Go to article

Query Rewriting For Extracting Data Behind Html Forms, Xueqi Chen Apr 2004

Query Rewriting For Extracting Data Behind Html Forms, Xueqi Chen

Theses and Dissertations

Much of the information on the Web is stored in specialized searchable databases and can only be accessed by interacting with a form or a series of forms. As a result, enabling automated agents and Web crawlers to interact with form-based interfaces designed primarily for humans is of great value. This thesis describes a system that can fill out Web forms automatically according to a given user query against a global schema for an application domain and, to the extent possible, extract just the relevant data behind these Web forms. Experimental results on two application domains show that the approach …

Go to article

Aggressive Telecommunications Overbooking Ratios, Robert Ball, Mark J. Clement, Casey T. Deccio, Feng Huang, Quinn O. Snell Apr 2004

Aggressive Telecommunications Overbooking Ratios, Robert Ball, Mark J. Clement, Casey T. Deccio, Feng Huang, Quinn O. Snell

Faculty Publications

The Internet is comprised of vast networks of wires and fiber. A common misconception is that there is an unlimited amount of bandwidth; in reality there exists only a finite amount. Each length of wire and fiber is owned by a company, and every company wants to maximize its profit. One means of improving profit is to overbook existing transmission lines in order to increase income without increasing expenses. If too much overbooking is performed, the Quality of Service (QoS) seen by customers will decline. This paper explains a process to achieve an optimal Overbooking Ratio (OR) for admission control …

Go to article

A Piecewise Linear Approach To Overbooking, Robert Ball, Mark J. Clement, Casey T. Deccio, Feng Huang, Quinn O. Snell Apr 2004

A Piecewise Linear Approach To Overbooking, Robert Ball, Mark J. Clement, Casey T. Deccio, Feng Huang, Quinn O. Snell

Faculty Publications

Overbooking is frequently used to increase the revenue generated by a network infrastructure without incurring additional costs. If the overbooking factor is chosen appropriately, additional virtual circuits can be admitted without degrading quality of service for existing customers. Most implementations use a single factor to accept a linear fraction of traffic requests. If a piecewise linear approach is used in admissions, additional traffic can be accepted without causing proportional increases in loss rate and utilization. This additional accepted traffic can significantly improve the profit margin for network service providers.

Go to article

Dynamic Offloading In A Multi-Provider Environment: A Behavioral Framework For Use In Influencing Peering, Zhen Liu, Vishal Misra, Laura Wynter Apr 2004

Dynamic Offloading In A Multi-Provider Environment: A Behavioral Framework For Use In Influencing Peering, Zhen Liu, Vishal Misra, Laura Wynter

Research Collection School Of Computing and Information Systems

We pose the question of how to encourage the resource sharing in a distributed, multi-provider environment, where each node, or provider, has local work but is able to accept additional work from other nodes/providers if there is available capacity. An instance of such an environment is found in content delivery, where. numerous, competing providers can work together if enough benefit is to be gained from doing so. We model individual provider behavior as essentially selfish, and then propose pricing schemes to exploit the selfishness to achieve system wide performance gains. We employ a game theoretic framework to analyze the problem, …

Go to article

A Cost-Effective Critical Path Approach For Service Priority Optimization In The Grid Computing Economy, Mei Lin, Zhangxi Lin Apr 2004

A Cost-Effective Critical Path Approach For Service Priority Optimization In The Grid Computing Economy, Mei Lin, Zhangxi Lin

Research Collection School Of Computing and Information Systems

The advancement in the utilization and technologiesof the Internet has led to the rapid growth of gridcomputing; and the perpetuating demand for gridcomputing resources calls for an incentive-compatible solution to the imminent QoS problem. This paper examines the optimal service priority selection problem that a grid computing network user will confront. We model grid services for a multi-subtask request as a prioritized PERT graph and prove that the localized conditional critical path, which is based on the cost-minimizin gpriority selection for each node, sets the lower bound for the length of cost-effective critical path that commits the optimal solution. We …

Go to article

The United States Marine Corps Data Collaboration Requirements: Retrieving And Integrating Data From Multiple Databases, Pamela J. Cole Mar 2004

The United States Marine Corps Data Collaboration Requirements: Retrieving And Integrating Data From Multiple Databases, Pamela J. Cole

Theses and Dissertations

The goal of this research is to develop an information sharing and database integration model and suggest a framework to fully satisfy the United States Marine Corps collaboration requirements as well as its information sharing and database integration needs. This research is exploratory; it focuses on only one initiative: the IT-21 initiative. The IT-21 initiative dictates The Technology for the United States Navy and Marine Corps, 2000-2035: Becoming a 21st Century Force. The IT-21 initiative states that Navy and Marine Corps information infrastructure will be based largely on commercial systems and services, and the Department of the Navy must ensure …

Go to article

Fast Registration Of Tabular Document Images Using The Fourier-Mellin Transform, Luke Alexander Daysh Hutchison Mar 2004

Fast Registration Of Tabular Document Images Using The Fourier-Mellin Transform, Luke Alexander Daysh Hutchison

Theses and Dissertations

Image registration, the process of finding the transformation that best maps one image to another, is an important tool in document image processing. Having properly-aligned microfilm images can help in manual and automated content extraction, zoning, and batch compression of images. An image registration algorithm is presented that quickly identifies the global affine transformation (rotation, scale, translation and/or shear) that maps one tabular document image to another, using the Fourier-Mellin Transform. Each component of the affine transform is recovered independantly from the others, dramatically reducing the parameter space of the problem, and improving upon standard Fourier-Mellin Image Registration (FMIR), which …

Go to article

Dynamic Autonomous Transport Selection In Heterogeneous Wireless Environments, Jeffrey M. Brown, Heidi R. Duffin, Charles D. Knutson, Shannon B. Barnes, Ryan W. Woodings Mar 2004

Dynamic Autonomous Transport Selection In Heterogeneous Wireless Environments, Jeffrey M. Brown, Heidi R. Duffin, Charles D. Knutson, Shannon B. Barnes, Ryan W. Woodings

Faculty Publications

In this paper, we introduce Quality of Transport (QoT), an architecture for synergistically and autonomously managing session-layer protocol access to multiple transports in heterogeneous wireless environments. We present an overview of the QoT architecture including: 1) transport discovery, 2) service discovery, 3) object exchange, 4) transport switching, and 5) intelligent transport selection. Preliminary successes with our design and implementation of QoT suggest that dynamic intelligent autonomous transport switching can help to optimize user experience and session layer performance in multi-transport environments.

Go to article

Prioritized Soft Constraint Satisfaction: A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin, Michael A. Goodrich, Charles D. Knutson Mar 2004

Prioritized Soft Constraint Satisfaction: A Qualitative Method For Dynamic Transport Selection In Heterogeneous Wireless Environments, Heidi R. Duffin, Michael A. Goodrich, Charles D. Knutson

Faculty Publications

This paper presents Prioritized Soft Constraint Satisfaction (PSCS), a novel approach to selecting the “best” transport in dynamic wireless transport switching systems. PSCS maintains a satisfying connection to another endpoint by choosing transports based on a user-established range of preferences and priority for criteria such as speed, power, range and cost. Additionally, feedback is provided regarding tradeoffs among the criteria, thus enabling the user to adjust inputs according to the capabilities of the system. We also recommend guidelines for setting preferences and priorities.

Go to article

An Exploratory Analysis Of Factors Affecting Participation In Air Force Knowledge Now Communities Of Practice, David C. Fitzgerald Mar 2004

An Exploratory Analysis Of Factors Affecting Participation In Air Force Knowledge Now Communities Of Practice, David C. Fitzgerald

Theses and Dissertations

As the AF continues to lose its knowledge base through retirements and downsizing, the need to get maximum use from the remaining knowledge base becomes increasingly important. In their efforts to help the Department of Defense and the Air Force Chief Information Officer (AFCIO) meet their knowledge management goals, Air Force Material Command (AFMC) has been working to implement the use of communities of practice. A primary goal of AFMC/DRW , the AF Knowledge Now program office, and the office of the AFCIO is to increase effectiveness and participation within communities of practice. The goal of this research is to …

Go to article

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.

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

Tcp Performance Over Mobile Ad Hoc Networks: A Quantitative Study, Vaidyanathan Anantharaman, Seung Jong Park, Karthikeyan Sundaresan, Raghupathy Sivakumar Mar 2004

Tcp Performance Over Mobile Ad Hoc Networks: A Quantitative Study, Vaidyanathan Anantharaman, Seung Jong Park, Karthikeyan Sundaresan, Raghupathy Sivakumar

Computer Science Faculty Research & Creative Works

In this paper, we study the performance of the transmission control protocol (TCP) over mobile ad-hoc networks. We present a comprehensive set of simulation results and identify the key factors that impact TCP's performance over ad-hoc networks. We use a variety of parameters including link failure detection latency, route computation latency, packet level route unavailability index, and flow level route unavailability index to capture the impact of mobility. We relate the impact of mobility on the different parameters to TCP's performance by studying the throughput, loss-rate and retransmission timeout values at the TCP layer. We conclude from our results that …

Go to article

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 …

Go to article

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 …

Go to article

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.

Go to article

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 …

Go to article

Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat Mar 2004

Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat

Research Collection School Of Computing and Information Systems

This research examines the use of knowledge-based and explanation facilities to support group decision making of experts versus novices. Consistent with predictions from the persuasion literature, our results show that experts exhibit a higher level of criticality and involvement in their area of expertise; this not only decreases their likelihood of being persuaded by a knowledge-based system, but also accounts for a lower group consensus among experts as compared to novices. Novices are more easily persuaded by the system and find the system to be more useful than experts do. This research integrates theories from the persuasion literature to understand …

Go to article

Efficient Group Pattern Mining Using Data Summarization, Yida Wang, Ee Peng Lim, San-Yih Hwang Mar 2004

Efficient Group Pattern Mining Using Data Summarization, Yida Wang, Ee Peng Lim, San-Yih Hwang

Research Collection School Of Computing and Information Systems

In group pattern mining, we discover group patterns from a given user movement database based on their spatio-temporal distances. When both the number of users and the logging duration are large, group pattern mining algorithms become very inefficient. In this paper, we therefore propose a spherical location summarization method to reduce the overhead of mining valid 2-groups. In our experiments, we show that our group mining algorithm using summarized data may require much less execution time than that using non-summarized data.

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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, …

Go to article

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 …

Go to article

Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng Mar 2004

Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Such schemes have been suggested for use in a number of applications, particularly in distributed computing where delegation of rights is quite common. Followed by the first schemes introduced by Mambo, Usuda and Okamoto in 1996, a number of new schemes and improvements have been proposed. In this paper, we present a security analysis of four such schemes newly proposed. By successfully identifying several interesting forgery attacks, we show that …

Go to article

First Prev Next Last