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 18121 - 18150 of 20636

Full-Text Articles in Entire DC Network

Proving Secure Properties Of Cryptographic Protocols With Knowledge Based Approach, Xiaochun Cheng, Xiaoqi Ma, Maggie Xiaoyan Cheng, Scott C.-H. Huang Jul 2005

Proving Secure Properties Of Cryptographic Protocols With Knowledge Based Approach, Xiaochun Cheng, Xiaoqi Ma, Maggie Xiaoyan Cheng, Scott C.-H. Huang

Computer Science Faculty Research & Creative Works

Cryptographic protocols have been widely used to protect communications over insecure network environments. Existing cryptographic protocols usually contain flaws. To analyze these protocols and find potential flaws in them, the secure properties of them need be studied in depth. This paper attempts to provide a new framework to analyze and prove the secure properties in these protocols. A number of predicates and action functions are used to model the network communication environment. Domain rules are given to describe the transitions of principals' knowledge and belief states. An example of public key authentication protocols has been studied and analysed.

Go to article

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni Jul 2005

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

This paper develops a modular approach to improving effectiveness of searching documents for information by reusing and integrating mature software components such as Lucene APIs, WORDNET, LSA techniques, and domain-specific controlled vocabulary. To evaluate the practical benefits, the prototype was used to query MEDLINE database, and to locate domain-specific controlled vocabulary terms in Materials and Process Specifications. Its extensibility has been demonstrated by incorporating a spell-checker for the input query, and by structuring the retrieved output into hierarchical collections for quicker assimilation. It is also being used to experimentally explore the relationship between LSA and document clustering using 20-mini-newsgroups and …

Go to article

Game Theoretical Models And Algorithms For Rate Control In Video Compression, Jiancong Luo Jul 2005

Game Theoretical Models And Algorithms For Rate Control In Video Compression, Jiancong Luo

Computer Science and Engineering Dissertations - Archive

This thesis investigates game theory based rate control algorithms for optimizing the bit allocation in video compression. The first algorithm utilizes the cooperative bargaining game in a MB level rate control algorithm to optimize the perceptual quality while guaranteeing "fairness" in bit allocation among macroblocks. The algorithm first allocates the target bits to frames based on their coding complexity; a method to estimate the coding complexity of the remaining frames is proposed. Next, macroblocks of a frame play cooperative games such that each macroblock competes for a share of resources (bits) to optimize its quantization scale while considering the human …

Go to article

Group Key Distribution Via Local Collaboration In Wireless Sensor Networks, Anuj Chadha Jul 2005

Group Key Distribution Via Local Collaboration In Wireless Sensor Networks, Anuj Chadha

Computer Science and Engineering Theses - Archive

Wireless sensor networks have been recognized as one of the most important technologies in the networking world. Security of sensor networks is one of the major concerns today. To this end, a whole suite of protocols have been designed to provide various security features which includes key management. This thesis covers the issue of group key management in wireless sensor networks. Traditional cryptographic techniques can be used to provide communication privacy and integrity, but do not provide scalable solutions to group key management. A group key management scheme for sensor networks has been discussed that targets at fast response to …

Go to article

Distributed Streaming For Video On Demand, Shraddha Rumade Jul 2005

Distributed Streaming For Video On Demand, Shraddha Rumade

Computer Science and Engineering Theses - Archive

With the advent of digital media, implementing reliable Video on Demand (VoD) systems over the best effort Internet is a potential issue. Distributed streaming for Video on Demand presents a combination of two techniques. The first being Distributed Video Streaming using Multicast (DVSM) [1] involves video streaming from multiple servers to overcome path congestion. The second technique, Asynchronous Hybrid mechanism for Video on Demand [2] implements segmentation-based periodic broadcast to effectively share network bandwidth. In this work we aim at providing path diversity of multiple senders and maximizing bandwidth sharing via multicast. We exploit alternate paths in case of congestion …

Go to article

Automating Inhabitant Interactions In Home And Workplace Environments Through Data-Driven Generation Of Hierarchical Partially-Observable Markov Decision Processes, Gregory Michael Youngblood Jul 2005

Automating Inhabitant Interactions In Home And Workplace Environments Through Data-Driven Generation Of Hierarchical Partially-Observable Markov Decision Processes, Gregory Michael Youngblood

Computer Science and Engineering Dissertations - Archive

Markov models provide a useful representation of system behavioral actions and state observations, but they do not scale well. Utilizing a hierarchy and abstraction through hierarchical hidden Markov models (HHMMs) improves scalability, but these structures are usually constructed manually using knowledge engineering techniques. We introduce a new method of automatically constructing HHMMs using the output of a sequential data-mining algorithm, Episode Discovery, and apply it to solving automation problems in the intelligent environment domain. Repetitive behavioral actions in sensor rich environments such as smart homes can be observed and categorized into periodic and frequent episodes through data-mining techniques utilizing the …

Go to article

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan Jul 2005

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Most Web and legacy paper-based documents are available in human comprehensible text form, not readily accessible to or understood by computer programs. Here, we investigate an approach to amalgamate XML technology with programming languages for representational purposes that can enhance traceability, thereby facilitating semiautomatic extraction and update. Specifically, we propose a modular technique to embed machine-processable semantics into a text document with tabular data via annotations, resulting sometimes in ill-formed XML fragments, and evaluate this technique vis a vis document querying, manipulation, and integration. The ultimate aim is to be able to author and extract human-readable and machine-comprehensible parts of …

Go to article

Validating Human–Robot Interaction Schemes In Multitasking Environments, Jacob W. Crandall, Michael A. Goodrich, Curtis W. Nielsen, Dan R. Olsen Jr. Jul 2005

Validating Human–Robot Interaction Schemes In Multitasking Environments, Jacob W. Crandall, Michael A. Goodrich, Curtis W. Nielsen, Dan R. Olsen Jr.

Faculty Publications

The ability of robots to autonomously perform tasks is increasing. More autonomy in robots means that the human managing the robot may have available free time. It is desirable to use this free time productively, and a current trend is to use this available free time to manage multiple robots. We present the notion of neglect tolerance as a means for determining how robot autonomy and interface design determine how free time can be used to support multitasking, in general, and multirobot teams, in particular. We use neglect tolerance to 1) identify the maximum number of robots that can be …

Go to article

Time Invariance And Liquid State Machines, Eric Goodman, Dan A. Ventura Jul 2005

Time Invariance And Liquid State Machines, Eric Goodman, Dan A. Ventura

Faculty Publications

Time invariant recognition of spatiotemporal patterns is a common task of signal processing. Liquid state machines (LSMs) are a paradigm which robustly handle this type of classification. Using an artificial dataset with target pattern lengths ranging from 0.1 to 1.0 seconds, we train an LSM to find the start of the pattern with a mean absolute error of 0.18 seconds. Also, LSMs can be trained to identify spoken digits, 1-9, with an accuracy of 97.6%, even with scaling by factors ranging from 0.5 to 1.5.

Go to article

Detecting Similar Html Documents Using A Fuzzy Set Information Retrieval Approach, Yiu-Kai D. Ng, Rajiv Yerra Jul 2005

Detecting Similar Html Documents Using A Fuzzy Set Information Retrieval Approach, Yiu-Kai D. Ng, Rajiv Yerra

Faculty Publications

Web documents that are either partially or completely duplicated in content are easily found on the Internet these days. Not only do these documents create redundant information on the Web, which take longer to filter unique information and cause additional storage space, but also they degrade the efficiency of Web information retrieval. In this paper, we present a new approach for detecting similar Web documents, especially HTML documents. Our detection approach determines the odd ratio of any two documents, which makes use of the degrees of resemblance of the documents, and graphically displays the locations of similar (not necessarily the …

Go to article

Descriptive Naming Of Context Data Providers, Norman H. Cohen, Paul Castro, Archan Misra Jul 2005

Descriptive Naming Of Context Data Providers, Norman H. Cohen, Paul Castro, Archan Misra

Research Collection School Of Computing and Information Systems

Much context data comes from mobile, transient, and unreliable sources. Such resources are best specified by descriptive names identifying what data is needed rather than which source is to provide it. The design of descriptive names has important consequences, but until now little attention has been focused on this problem. We propose a descriptive naming system for providers of context data that provides more flexibility and power than previous naming systems by classifying data providers into “provider kinds” that are organized in an evolving hierarchy of subkinds and superkinds. New provider kinds can be inserted in the hierarchy not only …

Go to article

How Much You Watch, How Much You Pay, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng Jul 2005

How Much You Watch, How Much You Pay, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

This paper presents a pay-video scheme that manages video stream, key stream and payment stream efficiently. In our scheme, the owner segments a video into fragments and encrypts them with independent keys. The keys are generated with a novel concept called as hash interval, where each hash interval discloses a range of numbers without disclosing any information on numbers outside of the range. The video fragments are then broadcast on one or more channels. A buyer can purchase the keys to decrypt any fragments and, within each fragment, any desired quality level. The accompanying payment protocol is integrated with the …

Go to article

Categorizing And Extracting Information From Multilingual Html Documents, Yiu-Kai D. Ng, Seungjin Lim Jul 2005

Categorizing And Extracting Information From Multilingual Html Documents, Yiu-Kai D. Ng, Seungjin Lim

Faculty Publications

The amount of online information written in different natural languages and the number of non-English speaking Internet users have been increasing tremendously during the past decade. In order to provide high-performance access of multilingual information on the Internet, we have developed a data analysis and querying system (DatAQs) that (i) analyzes, identifies, and categorizes languages used in HTML documents, (ii) extracts information from HTML documents of interest written in different languages, (iii) allows the user to submit queries for retrieving extracted information in the same natural language provided by the query engine of DatAQs using a menu-driven user interface, and …

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Jul 2005

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Go to article

Approximate Strategic Reasoning Through Hierarchical Reduction Of Large Symmetric Games, Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri Jul 2005

Approximate Strategic Reasoning Through Hierarchical Reduction Of Large Symmetric Games, Michael P. Wellman, Daniel M. Reeves, Kevin M. Lochner, Shih-Fen Cheng, Rahul Suri

Research Collection School Of Computing and Information Systems

To deal with exponential growth in the size of a game with the number of agents, we propose an approximation based on a hierarchy of reduced games. The reduced game achieves savings by restricting the number of agents playing any strategy to fixed multiples. We validate the idea through experiments on randomly generated local-effect games. An extended application to strategic reasoning about a complex trading scenario motivates the approach, and demonstrates methods for game-theoretic reasoning over incompletely-specified games at multiple levels of granularity.

Go to article

An Informatization Of Society Approach To E-Government: Analyzing Singapore’S E-Government Efforts, Calvin M. L. Chan, Yi Meng Lau Jul 2005

An Informatization Of Society Approach To E-Government: Analyzing Singapore’S E-Government Efforts, Calvin M. L. Chan, Yi Meng Lau

Research Collection School Of Computing and Information Systems

Despite the much publicized benefits of e-government, many countries are experiencing difficulty in yielding success in their e-government initiatives. Studies which adopt the national e-government initiatives as the unit of analysis remain largely rare. This paper aspires to provide an analysis of Singapore’s widely acclaimed success in the e-government effort at the national level to allow other countries to learn and gain from its experience. Using the ‘Conceptual Framework for the Informatization of Society’ in facilitating the data analysis, implications are drawn to offer insights for the considerations of e-government practitioners. Theoretical implications are also derived through positing that the …

Go to article

Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell Jul 2005

Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell

Computer Science Faculty Research & Creative Works

Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph's vertices. This is not suitable for practical implementation. We extend the max-flow work of Goldberg and Tarjan to a distributed algorithm to calculate maximum flow where the number of processors is less than the number of vertices in a graph. Our algorithm is applied to maximizing electrical flow within a power network where the power grid is modeled as a graph. Error detection measures are included to detect problems in a simulated power …

Go to article

Multibiometrics Based On Palmprint And Handgeometry, Xiao-Yong Wei, Dan Xu, Chong-Wah Ngo Jul 2005

Multibiometrics Based On Palmprint And Handgeometry, Xiao-Yong Wei, Dan Xu, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper described our approach of multibiometrics in a single image. Firstly, a new method for capturing the key points of hand geometry is proposed. Then, we described our new method of palmprint feature extracting. By using projection transform and wavelet transform, this method considered both the global feature and local detail of a palmprint texture and proposed a new kind of palmprint feature. We also proposed a twice segmentation method for handgeometry feature extraction. In the processing of feature matching, we analyzed the weakness of the traditional Euclidian Square Norm method, and introduced an improved method. The experimental results …

Go to article

Evaluation Of Glycine Max Mrna Clusters, Ronald L. Frank, Fikret Erçal Jul 2005

Evaluation Of Glycine Max Mrna Clusters, Ronald L. Frank, Fikret Erçal

Biological Sciences Faculty Research & Creative Works

Background: Clustering the ESTs from a large dataset representing a single species is a convenient starting point for a number of investigations into gene discovery, genome evolution, expression patterns, and alternatively spliced transcripts. Several methods have been developed to accomplish this, the most widely available being UniGene, a public domain collection of gene-oriented clusters for over 45 different species created and maintained by NCBI. The goal is for each cluster to represent a unique gene, but currently it is not known how closely the overall results represent that reality. UniGene's build procedure begins with initial mRNA clusters before joining ESTs. …

Go to article

Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe Jul 2005

Valuations Of Possible States (Vps): A Unifying Quantitative Framework For Evaluating Privacy In Collaboration, Rajiv T. Maheswaran, Jonathan Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe

Research Collection School Of Computing and Information Systems

For agents deployed in real-world settings, such as businesses, universities and research laboratories, it is critical that agents protect their individual users’ privacy when interacting with others entities. Indeed, privacy is recognized as a key motivating factor in design of several multiagent algorithms, such as distributed constraint optimization (DCOP) algorithms. Unfortunately, rigorous and general quantitative metrics for analysis and comparison of such multiagent algorithms with respect to privacy loss are lacking. This paper takes a key step towards developing a general quantitative model from which one can analyze and generate metrics of privacy loss by introducing the VPS (Valuations of …

Go to article

Emd-Based Video Clip Retrieval By Many-To-Many Matching, Yuxin Peng, Chong-Wah Ngo Jul 2005

Emd-Based Video Clip Retrieval By Many-To-Many Matching, Yuxin Peng, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper presents a new approach for video clip retrieval based on Earth Mover's Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach allows many-to-many matching methodology and is capable of tolerating errors due to video partitioning and various video editing effects. We formulate clip-based retrieval as a graph matching problem in two stages. In the first stage, to allow the matching between a query and a long video, an online clip segmentation algorithm is employed to rapidly locate candidate clips for similarity measure. In the second stage, a weighted graph is constructed to model …

Go to article

Co-Clustering Of Time-Evolving News Story With Transcript And Keyframe, Xiao Wu, Chong-Wah Ngo, Qing Li Jul 2005

Co-Clustering Of Time-Evolving News Story With Transcript And Keyframe, Xiao Wu, Chong-Wah Ngo, Qing Li

Research Collection School Of Computing and Information Systems

This paper presents techniques in clustering the same-topic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the representation of bipartite graph. The textual and visual concepts are extracted respectively from speech transcripts and keyframes. Co-clustering algorithm is employed to exploit the duality of stories and textual-visual concepts based on spectral graph partitioning. Experimental results on TRECVID-2004 corpus show that the co-clustering of news stories with textual-visual concepts is significantly better than the co-clustering with either textual or visual concept alone.

Go to article

Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo Jul 2005

Hot Event Detection And Summarization By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normalized cut (NC). Initially, OM is employed to measure the visual similarity between all pairs of events under the one-to-one mapping constraint among video shots. Then, news events are represented as a complete weighted graph and NC is carried out to globally and optimally partition the graph into event clusters. Finally, based on the cluster size and globality of events, hot events can be automatically detected and selected as the summaries of …

Go to article

Deposit-Case Attack Against Secure Roaming, Guomin Yang, Duncan S. Wong, Xiaotie Deng Jul 2005

Deposit-Case Attack Against Secure Roaming, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

A secure roaming protocol involves three parties: a roaming user, a visiting foreign server and the user’s home server. The protocol allows the user and the foreign server to establish a session key and carry out mutual authentication with the help of the home server. In the mutual authentication, user authentication is generally done in two steps. First, the user claims that a particular server is his home server. Second, that particular server is called in by the foreign server for providing a ‘credential’ which testifies the user’s claim. We present a new attacking technique which allows a malicious server …

Go to article

Strategic Assessment Of Information Security Maturity, Arcot Desai Narasimhalu, Dayasindhu Nagarajan, Raghavan Subramanian Jul 2005

Strategic Assessment Of Information Security Maturity, Arcot Desai Narasimhalu, Dayasindhu Nagarajan, Raghavan Subramanian

Research Collection School Of Computing and Information Systems

CXOs are becoming increasingly interested in the information security maturity of their enterprises. This paper presents a CXO dashboard that will allow better management of the information security resources in an enterprise.

Go to article

Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe Jul 2005

Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe

Research Collection School Of Computing and Information Systems

Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users themselves) and making periodic decisions based on such monitoring. POMDPs appear well suited to enable agents to address these challenges, given the uncertain environment and cost of actions, but optimal policy generation for POMDPs is computationally expensive. This paper introduces three key techniques to speedup POMDP policy generation that exploit the notion of progress or dynamics in personal assistant domains. Policy computation is restricted to the belief space polytope that remains …

Go to article

Social Network Discovery By Mining Spatio-Temporal Events, Hady Lauw, Ee Peng Lim, Hwee Hwa Pang, Teck-Tim Tan Jul 2005

Social Network Discovery By Mining Spatio-Temporal Events, Hady Lauw, Ee Peng Lim, Hwee Hwa Pang, Teck-Tim Tan

Research Collection School Of Computing and Information Systems

Knowing patterns of relationship in a social network is very useful for law enforcement agencies to investigate collaborations among criminals, for businesses to exploit relationships to sell products, or for individuals who wish to network with others. After all, it is not just what you know, but also whom you know, that matters. However, finding out who is related to whom on a large scale is a complex problem. Asking every single individual would be impractical, given the huge number of individuals and the changing dynamics of relationships. Recent advancement in technology has allowed more data about activities of individuals …

Go to article

Middleware Architecture For Evaluation And Selection Of 3rd Party Web Services For Service Providers, Dipanjan Chakraborty, Suraj K. Jaiswal, Archan Misra, Amit A. Nanavati Jul 2005

Middleware Architecture For Evaluation And Selection Of 3rd Party Web Services For Service Providers, Dipanjan Chakraborty, Suraj K. Jaiswal, Archan Misra, Amit A. Nanavati

Research Collection School Of Computing and Information Systems

This paper presents an architecture to facilitate efficient evaluation and selection of 3rd party Web services for service providers. Most service provider architectures have primarily focused on providing Web service front ends to legacy systems, aggregating and delivering services via workflows. These architectures primarily considered static business contracts between the service provider and its (Web-service enabled) business partners. This approach makes these architectures inflexible to variations in business requirement, partners' performance and customer requirements. Our architecture provides a flexible means for service providers to optimize business performance. Based on the historical performance, extant context, and optimising business rules, the appropriate …

Go to article

Synthesis Of Distributed Processes From Scenario-Based Specifications, Jun Sun, Jin Song Dong Jul 2005

Synthesis Of Distributed Processes From Scenario-Based Specifications, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Given a set of sequence diagrams, the problem of synthesis is of deciding whether there exists a satisfying object system and if so, synthesize one automatically. It is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases and if synthesizable they could lead directly to implementation. It is even more interesting (and harder) if the synthesized object system is distributed. In this paper, we propose a systematic way of synthesizing distributed processes from Live Sequence Charts. The basic idea is to first construct a CSP specification from the LSC specification, and then …

Go to article

Comparing High-Order Boolean Features, Adam Drake, Dan A. Ventura Jul 2005

Comparing High-Order Boolean Features, Adam Drake, Dan A. Ventura

Faculty Publications

Many learning algorithms attempt, either explicitly or implicitly, to discover useful high-order features. When considering all possible functions that could be encountered, no particular type of high-order feature should be more useful than any other. However, this paper presents arguments and empirical results that suggest that for the learning problems typically encountered in practice, some high-order features may be more useful than others.

Go to article

First Prev Next Last