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 19051 - 19080 of 20575

Full-Text Articles in Entire DC Network

A Visual Query System For The Specification And Scientific Analysis Of Continual Queries, Jennifer Leopold, A. Ambler, M. Heimovics, T. Palmer Jan 2001

A Visual Query System For The Specification And Scientific Analysis Of Continual Queries, Jennifer Leopold, A. Ambler, M. Heimovics, T. Palmer

Computer Science Faculty Research & Creative Works

The lack of a facility that would allow nonprogrammers to easily formulate temporal ad hoc analyses over a network of heterogeneous, constantly-updated data sources has been a significant impediment to research, particularly in the scientific community. In this paper we describe WebFormulate, an Internet-based system which facilitates the development of analyses using information obtained from databases on the Internet. The main distinction between this system and existing Internet facilities to retrieve information and assimilate it into computations is that WebFormulate provides the necessary facilities to perform continual queries, developing and maintaining dynamic links such that computations and reports automatically maintain …

Go to article

Mobile Data Management, Sanjay Kumar Madria, Sourav S. Bhowmick Jan 2001

Mobile Data Management, Sanjay Kumar Madria, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

The management of data in the mobile computing environment offers new challenging problems. Existing software needs to be upgraded to accommodate this environment. To do so, the critical parameters need to be understood and defined. We have surveyed some problems and existing solutions

Go to article

Unified Modeling Language: A Complexity Analysis, Keng Siau, Q. Cao Jan 2001

Unified Modeling Language: A Complexity Analysis, Keng Siau, Q. Cao

Research Collection School Of Computing and Information Systems

Unified Modeling Language (UML) is the standard visual modeling language for Object Oriented (OO) systems development, but it has been criticized for its complexity, inconsistent semantics, and ambiguous constructs. A set of complexity indices for UML and the nine diagramming techniques in UML was compiled recently. The complexity analysis is formulated based on the number of constructs, associations, roles, and so forth, in a modeling method. We argue that this set of metrics provides an indication of the theoretical complexity of the modeling methods. On the other hand, the theoretical complexity of the modeling methods does not necessarily relate to …

Go to article

Ontologies And Electronic Commerce, Dieter Fensel, Deborah L. Mcguinness, Ellen Schulten, Wee-Keong Ng, Ee Peng Lim, Guanghao Yan Jan 2001

Ontologies And Electronic Commerce, Dieter Fensel, Deborah L. Mcguinness, Ellen Schulten, Wee-Keong Ng, Ee Peng Lim, Guanghao Yan

Research Collection School Of Computing and Information Systems

Ontologies are the first step toward realizing the full power of online e-commerce. Ontologies enable machine-understandable semantics of data, and building this data infrastructure will enable completely new kinds of automated services. Software agents can search for products, form buyer and seller coalitions, negotiate about products, or help automatically configure products and services according to specified user requirements. The combination of machine-processable semantics of data based on ontologies and the development of many specialized reasoning services will bring the Web to its full power. The authors discuss: taxonomies; information sources; future issues; business viewpoints; the e-marketplace; and B2B e-commerce standardisation …

Go to article

Incorporating Window-Based Passage-Level Evidence In Document Retrieval, Wensi Xi, Richard Xu-Rong, Christopher Soo Guan Khoo, Ee Peng Lim Jan 2001

Incorporating Window-Based Passage-Level Evidence In Document Retrieval, Wensi Xi, Richard Xu-Rong, Christopher Soo Guan Khoo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

This study investigated whether document retrieval can be improved if documents are divided into smaller sub-documents or passages and the retrieval score for these passages are incorporated in the final retrieval score for the whole document. The documents were segmented by sliding a window of a certain size across the document and extracting the words displayed each time the window stopped. A retrieval score was calculated for each of the passages extracted and the highest score obtained by a passage of that size was taken as the document’s passage-level score for that window size. A range of window sizes was …

Go to article

Software Quality Function Deployment, Xiaoqing Frank Liu Dec 2000

Software Quality Function Deployment, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Any product development involves projecting its potential success in achieving its functional and commercial goals. Better quality designs that match customer needs and preferences and integrate other lifecycle issues early in the software development process are more likely to be competitive. Thus, there is significant concern in industry about quality product design, which is addressed by quality function deployment (QFD). QFD uses matrices to organize and relate pieces of data to each other. These matrices are often combined to form a basic tool of QFD, called a House of Quality (HoQ). QFD was developed in the Kobe shipyards as a …

Go to article

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu Dec 2000

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu

Research Collection School Of Computing and Information Systems

We study a complex optimization problem that arises due to an emerging trend in distribution logistics. The problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. We describe a collaborative approach to solve this problem in real-time. The novelty of our approach lies in the tight algorithmic integration between two sub-problems, and suggests an elegant scheme to deal with other integrated optimization problems of the same nature. For first sub-problem, we will present two algorithms: a complete mathematical model integrating integer programming with constraint …

Go to article

Knowledge Discovery As An Aid To Organizational Creativity, Keng Siau Dec 2000

Knowledge Discovery As An Aid To Organizational Creativity, Keng Siau

Research Collection School Of Computing and Information Systems

Computers can play an important role in the creative process. With the abundance of data and increasing speed of computers, creativity can now be stimulated and enhanced with knowledge mined from available data. The process is known as knowledge discovery or data mining. Knowledge discovery is the process of discovering interesting associations among data in the database. Users in the creativity process can feed on the discovered associations to generate creative solutions. The objective of this paper is to present knowledge discovery as an aid to creativity. The paper first presents the concept of knowledge discovery and then discusses the …

Go to article

Generalized Tcp Congestion Avoidance And Its Effect On Bandwidth Sharing And Variability, Archan Misra, John Baras, Teunis Ott Dec 2000

Generalized Tcp Congestion Avoidance And Its Effect On Bandwidth Sharing And Variability, Archan Misra, John Baras, Teunis Ott

Research Collection School Of Computing and Information Systems

To model possible suggested changes in TCP window adaptation in response to randomized feedback, such as ECN (explicit congestion notification), we formulate a generalized version of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck buffer under the assured service model and use a fixed point technique to obtain the mean window sizes and throughputs for the TCP flows, To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-cum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under …

Go to article

An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng Dec 2000

An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng

Research Collection School Of Computing and Information Systems

It is commonly acknowledged that customers’ privacy in electronic commerce should be well protected. The solutions may come not only from the ethics education and legislation, but also from cryptographic technologies. In this paper we propose and analyze a privacy protection scheme for e-commerce of digital goods. The scheme takes cryptography as its technical means to realize privacy protection for online customers. It is efficient in both computational cost and communication cost. It is very practical for real e-commerce systems compared with previous solutions. The cryptographic technique presented in this paper is rather simple. But the scheme has great application …

Go to article

Parallel Phylogenetic Inference, Mark J. Clement, David Mclaughlin, Quinn O. Snell, Michael Whiting Nov 2000

Parallel Phylogenetic Inference, Mark J. Clement, David Mclaughlin, Quinn O. Snell, Michael Whiting

Faculty Publications

Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibitive time necessary to perform tree search on even a reasonably sized data set. Some parallel algorithms have been developed but the biological research community does not use them because they don’t trust the results from newly developed parallel software. This paper presents a new phylogenetic algorithm that allows existing, trusted phylogenetic software packages to be executed in parallel using the DOGMA parallel processing system. The results presented here indicate that data sets that currently …

Go to article

Web Schemas In Whoweda, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria Nov 2000

Web Schemas In Whoweda, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The term schema denotes whatever way a data model chooses to model its data. In this paper we discuss schemas of a set of HTML or XML documents retrieved from the Web in the context of our web warehousing system called WHOWEDA (Warehouse of Web Data). Web schemas are used to bind a web table that contains a collection of interlinked web documents called web tuples. These schemas specify some of the metadata, content and structural properties (in the form of predicates) shared by some of the Web documents and hyperlinks in the web table. They also summarize the hyperlink …

Go to article

Toward Automated Abstraction For Protocols On Branching Networks, Michael D. Jones, Ganesh Gopalakrishnan Nov 2000

Toward Automated Abstraction For Protocols On Branching Networks, Michael D. Jones, Ganesh Gopalakrishnan

Faculty Publications

We have used various manual abstraction techniques to formally verify a transaction ordering property for an IO protocol over bus/bridge networks. In the context of network protocol verification, an abstraction is needed to reduce the unbounded number of network configurations to a small number of representative networks that can be checked using algorithmic methods. The manually derived abstraction was both brittle and difficult to validate. In this report, we discuss the need for abstraction techniques in the formal verification of protocols over networks and present our recent efforts to create an automatic abstraction technique for network protocols using predicate abstraction …

Go to article

Extensible Mpeg-4 Textual Format (Xmt), Michelle Kim, Steve Wood, Lai-Tee Cheok Nov 2000

Extensible Mpeg-4 Textual Format (Xmt), Michelle Kim, Steve Wood, Lai-Tee Cheok

Research Collection School Of Computing and Information Systems

This paper describes the Extensible MPEG-4 Textual format (XMT), a framework for representing MPEG-4 scene description using a textual syntax. The XMT allows the content authors to exchange their content with other authors, tools or service providers, and facilitates interoperability with both the X3D, developed by the Web3D consortium, and the Synchronized Multimedia Integration Language (SM1L) from the W3C consortium.

Go to article

Automated Systematic Testing For Constraint-Based Interactive Services, Patrice Godefroid, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Laufer Nov 2000

Automated Systematic Testing For Constraint-Based Interactive Services, Patrice Godefroid, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Laufer

Computer Science: Faculty Publications and Other Works

Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must support multiple types of interfaces for accessing the same data. These include automatic speech-recognition interfaces where inputs may be provided in any order by users of the service. We study in this paper how to systematically test event-driven applications developed using such languages. We show how such applications can be tested automatically, without the need for any manually-written test cases, and effi- ciently, by taking advantage of their capability of taking unordered …

Go to article

Using 'Drop-Biasing' To Stabilize The Occupancy Of Random-Drop Queues With Tcp Traffic, Archan Misra, Teunis Ott, John Baras Nov 2000

Using 'Drop-Biasing' To Stabilize The Occupancy Of Random-Drop Queues With Tcp Traffic, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper describes how the use of ‘drop-biasing’, a technique to control the distribution of the gap between consecutive packet losses in random drop queues (such as RED) can be used to reduce the variability of the queue occupancy with TCP traffic. Reducing the variance of the queue occupancy reduces delay jitter for buffered packets, as well as decreases the likelihood of buffer underflow. We find that modifying the packet drop probabilities to ensure a minimum separation between consecutive packet drops serves to decrease the variability in the queue occupancy. This is really achieved as a result of the increased …

Go to article

Side Collision Warning System For Transit Buses, Sue Mcneil, David Duggins, Christoph Mertz, Arne Suppe, Chuck Thorpe Oct 2000

Side Collision Warning System For Transit Buses, Sue Mcneil, David Duggins, Christoph Mertz, Arne Suppe, Chuck Thorpe

Research Collection School Of Computing and Information Systems

Transit buses are involved in many more accidents than other vehicles. Collision warning systems (CWS) are therefore placed most efficiently on these buses. In our project, we investigate their operating environment and available technologies to develop performance specifications for such CWS. The paper discusses our findings of transit buses driving through very cluttered surroundings and being involved in many different types of accidents where currently available CWS no not work effectively. One of the focuses of our work is pedestrians around the bus and their detection.

Go to article

Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava Oct 2000

Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

Optically Simulating A Quantum Associative Memory, Dan A. Ventura, John C. Howell, John A. Yeazell Sep 2000

Optically Simulating A Quantum Associative Memory, Dan A. Ventura, John C. Howell, John A. Yeazell

Faculty Publications

This paper discusses the realization of a quantum associative memory using linear integrated optics. An associative memory produces a full pattern of bits when presented with only a partial pattern. Quantum computers have the potential to store large numbers of patterns and hence have the ability to far surpass any classical neural network realization of an associative memory. In this work two 3-qubit associative memories will be discussed using linear integrated optics. In addition, corrupted, invented and degenerate memories are discussed.

Go to article

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin Sep 2000

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a new ly developed scheme for automatical ly partitioning videos into scenes. A scene is general ly referred to as a group of shots taken place in the same site. In this paper, we first propose a motion annotation algorithm based on the analysis of spatiotemporal image volumes. The algorithm characterizes the motions within shots by extracting and analyzing the motion trajectories encoded in the temporal slices of image volumes. A motion-based keyframe computing and selection strategy is thus proposed to compactly represent the content of shots. With these techniques, we further present a scene change detection algorithm …

Go to article

E-Commerce Systems: Architecture, Infrastructure, Model, And Development Methodology, A. Bajaj, Keng Siau Aug 2000

E-Commerce Systems: Architecture, Infrastructure, Model, And Development Methodology, A. Bajaj, Keng Siau

Research Collection School Of Computing and Information Systems

The last decade has seen tremendous growth in the world wide web (WWW) (Berners-Lee, Caillau, Luotonen, Nielsen, & Secret, 1994) and e-commerce, which now offers organizations and consumers a unique channel to deliver and purchase goods and services. E-commerce is popularly classified as B2B (business to business), B2C (business to consumer) and C2C (consumer to consumer). B2B e-commerce, which is currently the fastest growing segment of e-commerce (Fellenstein & Wood, 2000), consists of making more efficient the flow of goods and services across organizations. This efficiency is typically increased using standards for electronic data exchange, automating certain processes across organizations …

Go to article

A Meta-Analysis On Relationship Modeling Accuracy: Comparing Relational And Semantic Models, Qing Cao, Fiona Fui-Hoon Nah, Keng Siau Aug 2000

A Meta-Analysis On Relationship Modeling Accuracy: Comparing Relational And Semantic Models, Qing Cao, Fiona Fui-Hoon Nah, Keng Siau

Research Collection School Of Computing and Information Systems

Semantic data modeling, such as entity-relationship (ER) modeling and extended/enhanced entity-relationship (EER) modeling, has emerged as an alternative to relational data modeling. The majority of research in data modeling suggests that the use of semantic data models leads to better performance. However the findings are not conclusive and sometimes inconsistent. In this research, we investigate modeling relationship correctness in relational and semantic models. The meta-analysis carried out in this research is an attempt to alleviate inconsistent results in previous studies.

Go to article

Electronic Commerce Strategy – Looking Through The Lenses Of An Innovation Strategy Model, A. Fruhling, Keng Siau Aug 2000

Electronic Commerce Strategy – Looking Through The Lenses Of An Innovation Strategy Model, A. Fruhling, Keng Siau

Research Collection School Of Computing and Information Systems

The world is in the midst of a revolution in the way businesses perform commerce. Many industries who were in the past relatively low tech are now finding themselves in a situation where they must embrace technology and prepare to compete head-on using ECommerce. This paradigm shift in thinking and competition is creating opportunities and chaos. This paper examines the innovation capability of organizations in evaluating and deploying their E-Commerce strategies. An Innovation Strategy Model is used in this research as the theoretical foundation. The case study and survey research methodologies were selected. Data gathering and analysis are in progress. …

Go to article

E-Business Curriculum In Action At The University Of Nebraska-Lincoln, Keng Siau, S. Davis Aug 2000

E-Business Curriculum In Action At The University Of Nebraska-Lincoln, Keng Siau, S. Davis

Research Collection School Of Computing and Information Systems

Offering e-business/e-commerce courses no longer provides competitive advantages. They are now a competitive necessity. Schools already offering the courses are continuously refining the curriculum to keep up with the innovations in the area. Schools without these courses are frantically trying to put one together. Irrespective of whether a school is a leader or a lagger, all schools face the same problem -- how to keep the ebusiness curriculum up-to-date and relevant to industry. This article looks at the e-business curriculum at the University of Nebraska-Lincoln. It presents our curriculum objectives and the lessons learned.

Go to article

Internet Marketing – Marketers’ Perception Of Ethical Issues, L.. Najjar, Keng Siau Aug 2000

Internet Marketing – Marketers’ Perception Of Ethical Issues, L.. Najjar, Keng Siau

Research Collection School Of Computing and Information Systems

Many businesses have been attracted to marketing on the Internet, but little attention has been given to the potential ethical issues regarding Internet marketing. Although some ethical behavior models have been proposed, relatively few have been empirically validated. This study's main objective is to assess the perception of ethical issues on Internet marketing among a sample of 150 marketing executives from a Midwest business community. Results and recommendations regarding ethical issues related to Internet marketing are discussed.

Go to article

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das Aug 2000

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das

Research Collection School Of Computing and Information Systems

This article first surveys existing protocols for supporting IP mobility and then proposes an extension to the mobile IP architecture, called TeleMIP. Our architecture attempts to achieve smaller handoff latency by localizing the scope of most location update messages within an administrative domain or a geographical region. TeleMIP is intended for use in evolving third-generation wireless networks, and introduces a new logical entity, called the mobility agent, which provides a mobile node with a stable point of attachment in a foreign network. While the MA is functionally similar to conventional foreign agents, it is located at a higher level in …

Go to article

The Inefficiency Of Batch Training For Large Training Sets, Tony R. Martinez, D. Randall Wilson Jul 2000

The Inefficiency Of Batch Training For Large Training Sets, Tony R. Martinez, D. Randall Wilson

Faculty Publications

Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that batch training is faster and/or more "correct" than continuous training because it uses a better approximation of the true gradient for its weight updates. These claims are often supported by empirical evidence on very small data sets. These claims are untrue, however, for large training sets. This paper explains why batch training is much slower than continuous training for large training sets. Various levels of semi-batch training used on a 20,000-instance speech recognition …

Go to article

Rescaling The Energy Function In Hopfield Networks, Tony R. Martinez, Xinchuan Zeng Jul 2000

Rescaling The Energy Function In Hopfield Networks, Tony R. Martinez, Xinchuan Zeng

Faculty Publications

In this paper we propose an approach that rescales the distance matrix of the energy function in the Hopfield network for solving optimization problems. We rescale the distance matrix by normalizing each row in the matrix and then adjusting the parameter for the distance term. This scheme has the capability of reducing the effects of clustering in data distributions, which is one of main reasons for the formation of invalid solutions. We evaluate this approach through a large number (20,000) simulations based on 200 randomly generated city distributions of the 10-city traveling salesman problem. The result shows that, compared to …

Go to article

Is Information Systems A Science? An Inquiry Into The Nature Of The Information Systems Discipline, Deepak Khazanchi, Bjørn Erik Munkvold Jul 2000

Is Information Systems A Science? An Inquiry Into The Nature Of The Information Systems Discipline, Deepak Khazanchi, Bjørn Erik Munkvold

Information Systems and Quantitative Analysis Faculty Publications

The Information Systems (IS) discipline is apparently undergoing an identity crisis. Academicians question the need for IS departments in colleges stating the absence of a core for the field and its integration within other business functions as a basis for its elimination. At the same time, many practitioners, as reflected in the US government's recent IT labor shortage report, continue to ignore IS as a distinct field of study. This article briefly outlines these and other challenges and argues that notwithstanding underlying philosophical differences, it can be concluded that IS is an emerging scientific discipline. This conclusion is reached through …

Go to article

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng Jul 2000

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng

Research Collection School Of Computing and Information Systems

Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP ’98, Fung and Gray proposed an m-permutation protection scheme against the EEPROM modification attack. At ACISP ’99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m- permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised …

Go to article

First Prev Next Last