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

Computer Sciences Commons™

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

2007

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 61 - 90 of 1355

Full-Text Articles in Computer Sciences

Learning Video Preferences Using Visual Features And Closed Captions, Darin Brezeale Dec 2007

Learning Video Preferences Using Visual Features And Closed Captions, Darin Brezeale

Computer Science and Engineering Dissertations - Archive

Viewers of video now have more choices than ever. As the number of choices increases, the task of searching through these choices to locate video of interest is becoming more difficult. Current methods for learning a viewer's preferences in order to automate the search process rely either on video having content descriptions or on having been rated by other viewers identified as being similar. However, much video exists that does not meet these requirements. To address this need, we use hidden Markov models to learn the preferences of a viewer by combining visual features and closed captions. We validate our …

Go to article

Generalized Multiagent Learning With Performance Bound, Bikramjit Banerjee, Jing Peng Dec 2007

Generalized Multiagent Learning With Performance Bound, Bikramjit Banerjee, Jing Peng

Department of Computer Science Faculty Scholarship and Creative Works

We present new Multiagent learning (MAL) algorithms with the general philosophy of policy convergence against some classes of opponents but otherwise ensuring high payoffs. We consider a 3-class breakdown of opponent types: (eventually) stationary, self-play and "other" (see Definition 4) agents. We start with ReDVaLeR that can satisfy policy convergence against the first two types and no-regret against the third, but it needs to know the type of the opponents. This serves as a baseline to delineate the difficulty of achieving these goals. We show that a simple modification on ReDVaLeR yields a new algorithm, RV σ(t), that achieves no-regret …

Go to article

Weighted Additive Criterion For Linear Dimension Reduction, Jing Peng, Stefan Robila Dec 2007

Weighted Additive Criterion For Linear Dimension Reduction, Jing Peng, Stefan Robila

Department of Computer Science Faculty Scholarship and Creative Works

Linear discriminant analysis (LDA) for dimension reduction has been applied to a wide variety of face recognition tasks. However, it has two major problems. First, it suffers from the small sample size problem when dimensionality is greater than the sample size. Second, it creates subspaces that favor well separated classes over those that are not. In this paper, we propose a simple weighted criterion for linear dimension reduction that addresses the above two problems associated with LDA. In addition, there are well established numerical procedures such as semi-definite programming for efficiently computing the proposed criterion. We demonstrate the efficacy of …

Go to article

Evaluation Of Robocode As A Teaching Tool For Computer Programming, Arnold Hensman Dec 2007

Evaluation Of Robocode As A Teaching Tool For Computer Programming, Arnold Hensman

Conference Papers

Robocode began as an educational tool to aid in learning Java programming. It has since evolved into something of a phenomenon, as the prospect of creating simple to complex virtual tanks appears to pose an attractive challenge to both novice and expert programmers alike. What started out as a teaching tool has grown into a worldwide network of competitors, all keen to prove that their ‘bot’ stands out from the crowd. Competitions are well organised and many Robocode events are a PR dream for the computing companies that sponsor them. Without a doubt, this easy to use application has sparked …

Go to article

Sybil Attack Detection In A Hierarchical Sensor Network, Jian Yin, Sanjay Kumar Madria Dec 2007

Sybil Attack Detection In A Hierarchical Sensor Network, Jian Yin, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The Sybil attack is a particularly harmful threat to sensor networks where a single sensor node illegitimately claims multiple identities. a malicious node may generate an arbitrary number of additional node identities using only one physical device. the Sybil attack can disrupt normal functioning of the sensor network, such as the multipath routing, used to explore the multiple disjoint paths between source-destination pairs. But the Sybil attack can disrupt it when a single adversary presents multiple identities, which appear on the multiple paths. Digital certificates are a way to prove identities, but they are not suitable for the sensor network …

Go to article

Distributed Predictive Health Monitoring, Jorge David Herrera Gonzalez Dec 2007

Distributed Predictive Health Monitoring, Jorge David Herrera Gonzalez

Computer Science and Engineering Theses - Archive

According to the National Center for Health Statistics the major causes of death in the US are (per year) heart diseases with 654 thousand cases, followed by cancer with 550 thousand cases and stroke with 150 thousand cases. In this project we propose, design, implement and test a prototype of a system that promises to improve the level of detection and prediction of several diseases and improves the quality of life of patients by utilizing non-invasive wireless medical sensors. This system is composed of a set of wireless medical sensors, a nearby (close-proximity) PDA (personal digital accessory) or cell phone …

Go to article

Cxlengine - A Comprehensive Xml Loosely Structured Search Engine, Indhu Krishna Sivaramakrishnan Dec 2007

Cxlengine - A Comprehensive Xml Loosely Structured Search Engine, Indhu Krishna Sivaramakrishnan

Computer Science and Engineering Theses - Archive

XML keyword search has been a widely researched area. [15] has proposed an XML semantic search engine called OOXSearch, which answers loosely structured queries. The framework of OOXSearch takes into account the semantic relationship between nodes based on their contexts. The context of a node is determined by its parent node. The label "name", for example, could mean the name of a book and could also mean the name of the book's author. If we try to consider the relationship between these two nodes without considering their parent nodes, we would be drawing the incorrect conclusion that these two nodes …

Go to article

Limitations Of Ieee 802.15.4 Based Wireless Mesh Networks For Wireless Localization, William Anthony Wallace Dec 2007

Limitations Of Ieee 802.15.4 Based Wireless Mesh Networks For Wireless Localization, William Anthony Wallace

Computer Science and Engineering Theses - Archive

It is highly desirable to create rapidly and inexpensively deployable mesh networks in certain scenarios. Consider the case of a large storage warehouse; workers are constantly moving in the area and not only do they need to send data periodically but their location needs to be tracked as well. Setting up such network can be accomplished with the IEEE 802.15.4 standard, but a mesh network must be created. There would need to be stationary 802.15.4 nodes that join together to form a backbone infrastructure. This backbone infrastructure (mesh network) would allow the workers, using mobile 802.15.4 nodes, to transmit their …

Go to article

Subrosa: An Experimental Platform For Studying Timing Analysis Of Real Time Anonymity Systems, Hatim Asger Daginawala Dec 2007

Subrosa: An Experimental Platform For Studying Timing Analysis Of Real Time Anonymity Systems, Hatim Asger Daginawala

Computer Science and Engineering Theses - Archive

Timing analysis poses a significant challenge for the mix based anonymous systems that wish to support low-latency applications like web browsing, instant messaging and Voice over IP (VOIP). Research in this area so far has been done through simulations on ad hoc simulators or non practical local area networks. We developed SubRosa, an experimental platform for studying timing analysis of real time anonymity systems to facilitate the study of Tor like low-latency anonymous systems. We present results of experiments on a real distributed network test bed PlanetLab, where we studied timing analysis attacks and some of the defenses to protect …

Go to article

Panda Monitoring - A System To Monitor High Performance Computing For The Atlas Experiment-Design, Development,Implementation And Deployment, Prem A. Thilagar Dec 2007

Panda Monitoring - A System To Monitor High Performance Computing For The Atlas Experiment-Design, Development,Implementation And Deployment, Prem A. Thilagar

Computer Science and Engineering Theses - Archive

Grid resources are gaining wide importance in the wake of experiments such as ATLAS aiding in a bigger goal to understand the complexities of nature. The need for a good monitoring system is realized as grid resources are being implemented widely. This work is an analysis of the existing monitoring system of the Panda which is a grid middleware for the ATLAS experiment running in CERN. The thesis aims at identifying the key bottlenecks of the current monitor and speaks about the implementation of a new monitor for the same .The new monitor which is being designed with scalability and …

Go to article

A Discrete Event Based Stochastic Simulation Approach For Studying The Dynamics Of Biological Networks, Samik Ghosh Dec 2007

A Discrete Event Based Stochastic Simulation Approach For Studying The Dynamics Of Biological Networks, Samik Ghosh

Computer Science and Engineering Dissertations - Archive

With increasing availability of data resources on the molecular parts of a living cell, biologists are focusing on holistic understanding of cellular mechanisms and the emergent dynamics arising out of their complex interactions. Comprehending the fine-grained signal specificity, gene regulation and feedback mechanisms of molecular interactions at a network level forms a central theme of systems biology. With the speed and sophistication of computational methods, in silico modeling and simulation techniques have become a powerful tool for biologists challenged with understanding the system complexity of biological networks. Numerical simulation of classical chemical kinetics (CCK), agent-based simulations of biological processes, and …

Go to article

Vertex Pops And Popturns, Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried Toussaint Dec 2007

Vertex Pops And Popturns, Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried Toussaint

Computer Science: Faculty Publications

No abstract provided.

Go to article

Transmission Scheduling In Sensor Networks Via Directed Edge Coloring, Maggie Xiaioyan Cheng, Li Yin Dec 2007

Transmission Scheduling In Sensor Networks Via Directed Edge Coloring, Maggie Xiaioyan Cheng, Li Yin

Computer Science Faculty Research & Creative Works

This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicasting and broadcast communication. the algorithm employs edge coloring on a directed graph for transmission scheduling. It is different from previous works that use vertex coloring of a graph for node scheduling, or those that use edge coloring of undirected graphs for link scheduling. the proposed algorithm uses the least number of time slots compared to its counterparts and it avoids both the hidden terminal problem and the exposed terminal problem in both unicast and broadcast communication. ©2007 …

Go to article

Route Validation Using Radio Frequency Identification, William T. Watson Dec 2007

Route Validation Using Radio Frequency Identification, William T. Watson

Theses and Dissertations

In recent years, radio frequency identification (RFID) has been proposed and implemented in a variety of applications where tracking objects, animals or people is desirable. This paper proposes a novel approach to the application of RFID technology in those applications where it is possible to validate a person or an object's passive contact with a given or arbitrary set of fixed points along a predefined route. The notable departure from the typical application of RFID technology is that in this scheme, the transponders are permanently installed while the interrogator is affixed to a person or object that travels the course. …

Go to article

Two's Company, Three's A Crowd: Stable Family And Threesome Roommates Problems, Chien-Chung Huang Dec 2007

Two's Company, Three's A Crowd: Stable Family And Threesome Roommates Problems, Chien-Chung Huang

Computer Science Technical Reports

We investigate Knuth's eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among the other two groups. The goal is to organize them into family units, so that no three of them have the incentive to desert their assigned family members to form a new family. A similar problem, called the threesome roommates problem, assumes that a group of persons, each with their preferences among the combinations of two others, are to be partitioned into triples. Similarly, the goal is to make sure that …

Go to article

Exclusion And Object Tracking In A Network Of Processes, Yih-Kuen Tsay, Chien-Chung Huang Dec 2007

Exclusion And Object Tracking In A Network Of Processes, Yih-Kuen Tsay, Chien-Chung Huang

Computer Science Technical Reports

This paper concerns two fundamental problems in distributed computing---mutual exclusion and mobile object tracking. For a variant of the mutual exclusion problem where the network topology is taken into account, all existing distributed solutions make use of tokens. It turns out that these token-based solutions for mutual exclusion can also be adapted for object tracking, as the token behaves very much like a mobile object. To handle objects with replication, we go further to consider the more general $k$-exclusion problem which has not been as well studied in a network setting. A strong fairness property for $k$-exclusion requires that a …

Go to article

Towards Tractable Local Closed World Reasoning For The Semantic Web, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler Dec 2007

Towards Tractable Local Closed World Reasoning For The Semantic Web, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and closed world reasoning for the Semantic Web. We present an extension based on a new three-valued framework including an alternating fixpoint, the well-founded MKNF model. This approach, the well-founded MKNF semantics, derives its name from the very close relation to the corresponding semantics known from logic programming. We show that the well-founded MKNF model is the least model among all (three-valued) MKNF models, thus soundly approximating also the two-valued MKNF models from …

Go to article

Semantic Web For Health Care And Biomedical Informatics, Amit P. Sheth Dec 2007

Semantic Web For Health Care And Biomedical Informatics, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Rss Management: An Rss Reader To Manage Rss Feeds That Efficiently And Effectively Pulls And Filters Feeds With Minimal Bandwidth Consumption, Brian Cooper Dec 2007

Rss Management: An Rss Reader To Manage Rss Feeds That Efficiently And Effectively Pulls And Filters Feeds With Minimal Bandwidth Consumption, Brian Cooper

Theses and Dissertations

In the early 2000s, RSS (Really Simple Syndication) was launched into cyber space and rapidly gained fame by existing as the underlying technology that fueled millions of web logs (blogs). Soon RSS feeds appeared for news, multimedia podcasting, and many other types of information on the Internet. RSS introduced a new way to syndicate information that allowed anyone interested to subscribe to published content and pull the information to an aggregator, (RSS reader application), at their discretion. RSS made it simple for people to keep up with online content without having to continuously check websites for new content. This new …

Go to article

Learner-Centered Assignments In Computer Literacy, Martha E. Myers, Meg C. Murray, Mario Guimaraes, Debra B. Geist Dec 2007

Learner-Centered Assignments In Computer Literacy, Martha E. Myers, Meg C. Murray, Mario Guimaraes, Debra B. Geist

Faculty Articles

Literacy is a concept that is understood to be the identifier of an educated populace. In today's world, literacy includes computer literacy, as well as language and quantitative literacy. This paper describes exercises developed to improve first year students' computer literacy through more learner-centered engagement. Exercises are designed to support learner-centered goals of independent and responsible learners, appropriate breadth and depth of content, teacher as facilitator, and assessment woven into learning. Exercise topics include purchase of a personal computer, basic logic via spreadsheets, an annotated bibliography built with electronic resources, and an integrated assignment customized by and for each student.

Go to article

Preventing Location-Based Identity Inference In Anonymous Spatial Queries, Panos Kalnis, Gabriel Ghinita, Kyriakos Mouratidis, Dimitris Papadias Dec 2007

Preventing Location-Based Identity Inference In Anonymous Spatial Queries, Panos Kalnis, Gabriel Ghinita, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

The increasing trend of embedding positioning capabilities (for example, GPS) in mobile devices facilitates the widespread use of location-based services. For such applications to succeed, privacy and confidentiality are essential. Existing privacy-enhancing techniques rely on encryption to safeguard communication channels, and on pseudonyms to protect user identities. Nevertheless, the query contents may disclose the physical location of the user. In this paper, we present a framework for preventing location-based identity inference of users who issue spatial queries to location-based services. We propose transformations based on the well-established K-anonymity concept to compute exact answers for range and nearest neighbor search, without …

Go to article

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Hoong Chuin Lau Dec 2007

Tuning Tabu Search Strategies Via Visual Diagnosis, Steven Halim, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

While designing working metaheuristics can be straightforward, tuning them to solve the underlying combinatorial optimization problem well can be tricky. Several tuning methods have been proposed but they do not address the new aspect of our proposed classification of the metaheuristic tuning problem: tuning search strategies. We propose a tuning methodology based on Visual Diagnosis and a generic tool called Visualizer for Metaheuristics Development Framework(V-MDF) to address specifically the problem of tuning search (particularly Tabu Search) strategies. Under V-MDF, we propose the use of a Distance Radar visualizer where the human and computer can collaborate to diagnose the occurrence of …

Go to article

Competition In Modular Clusters, Carliss Y. Baldwin, C. Jason Woodard Dec 2007

Competition In Modular Clusters, Carliss Y. Baldwin, C. Jason Woodard

Research Collection School Of Computing and Information Systems

The last twenty years have witnessed the rise of disaggregated “clusters,” “networks,” or “ecosystems” of firms. In these clusters the activities of R&D, product design, production, distribution, and system integration may be split up among hundreds or even thousands of firms. Different firms will design and produce the different components of a complex artifact (like the processor, peripherals, and software of a computer system), and different firms will specialize in different stages of a complex production process. This paper considers the pricing behavior and profitability of these so-called modular clusters. In particular, we investigate a possibility hinted at in prior …

Go to article

Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan Dec 2007

Multi-Order Neurons For Evolutionary Higher Order Clustering And Growth, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

This letter proposes to use multiorder neurons for clustering irregularly shaped data arrangements. Multiorder neurons are an evolutionary extension of the use of higher-order neurons in clustering. Higher-order neurons parametrically model complex neuron shapes by replacing the classic synaptic weight by higher-order tensors. The multiorder neuron goes one step further and eliminates two problems associated with higher-order neurons. First, it uses evolutionary algorithms to select the best neuron order for a given problem. Second, it obtains more information about the underlying data distribution by identifying the correct order for a given cluster of patterns. Empirically we observed that when the …

Go to article

Study Of The Minimum Spanning Hyper-Tree Routing Algorithm In Wireless Sensor Networks, Ting Yang, Yugeng Sun, Zhaoxia Wang, Juwei Zhang, Yingqiang Ding Dec 2007

Study Of The Minimum Spanning Hyper-Tree Routing Algorithm In Wireless Sensor Networks, Ting Yang, Yugeng Sun, Zhaoxia Wang, Juwei Zhang, Yingqiang Ding

Research Collection School Of Computing and Information Systems

Designing energy-efficient routing protocols to effectively increase the networks' lifetime and provide the robust network service is one of the important problems in the research of wireless sensor networks. Using the hyper-graph theory, the paper represents large-scale wireless sensor networks into a hyper-graph model, which can effectively decrease the control messages in routing process. Based on this mathematic model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sensor networks (MSHT-SN), which builds a minimum energy consumption tree for data collection from multi-nodes to Sink node. The validity of the algorithm is proved by the theatrical analysis. …

Go to article

An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, William B. Vogt, Ramayya Krishnan, Rahul Telang Dec 2007

An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, William B. Vogt, Ramayya Krishnan, Rahul Telang

Research Collection School Of Computing and Information Systems

In addition to the wireless telephony boom, a similar exponential increasing trend in wireless data service - short message service (SMS) - is visible as technology advances. We develop a structural model to understand how mobile users behave, especially how they consume voice, and services. Specifically, we measure the own- and the cross-price elasticities of these services. The cross-price elasticity is of significant importance because marketing activities are critically influenced by whether the goods are substitutes or complements. The research context poses significant econometric challenges due to three-part tariff, sequential discrete plan choice and continuous quantity choices. Using detailed individual …

Go to article

A Unified Interdisciplinary Theory Of Open Source Culture And Entertainment, Jerald Hughes, Karl Reiner Lang, Eric K. Clemons, Robert J. Kauffman Dec 2007

A Unified Interdisciplinary Theory Of Open Source Culture And Entertainment, Jerald Hughes, Karl Reiner Lang, Eric K. Clemons, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Digital technologies are profoundly transforming the production and consumption of culture and entertainment products. The emerging digital re-mix culture is an open source approach where content products in the arts and entertainment industries are increasingly rearranged, manipulated, and extended in the process of creating new works. This article offers a unified description of the tools and techniques that led to the development of the open source culture and that enable the processes which promote re-use of previously recorded materials. It then lays out the incentives and forces that either promote or inhibit the development, distribution, and consumption of modified cultural …

Go to article

I’M A Virus Harming The Earth, M. Thulasidas Dec 2007

I’M A Virus Harming The Earth, M. Thulasidas

Research Collection School Of Computing and Information Systems

We humans plunder the raw material from our host planet with such an abandon that is only seen in viruses.

Go to article

Self-Organizing Neural Architectures And Cooperative Learning In A Multiagent Environment, Dan Xiao, Ah-Hwee Tan Dec 2007

Self-Organizing Neural Architectures And Cooperative Learning In A Multiagent Environment, Dan Xiao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Temporal-Difference–Fusion Architecture for Learning, Cognition, and Navigation (TD-FALCON) is a generalization of adaptive resonance theory (a class of self-organizing neural networks) that incorporates TD methods for real-time reinforcement learning. In this paper, we investigate how a team of TD-FALCON networks may cooperate to learn and function in a dynamic multiagent environment based on minefield navigation and a predator/prey pursuit tasks. Experiments on the navigation task demonstrate that TD-FALCON agent teams are able to adapt and function well in a multiagent environment without an explicit mechanism of collaboration. In comparison, traditional Q-learning agents using gradient-descent-based feedforward neural networks, trained with the …

Go to article

Understanding Highly Competent Information System Users, Brenda Eschenbrenner, Fiona Fui-Hoon Nah Dec 2007

Understanding Highly Competent Information System Users, Brenda Eschenbrenner, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Individuals differ in their abilities to use information systems (IS) effectively, with some achieving exceptional performance in IS use. Using the Repertory Grid Technique, this research identifies attributes of highly competent IS users that distinguish them from less competent users. Using the Grounded Theory approach, we identified categories and sub-categories of these attributes and used them to develop a conceptual framework to explain IS User Competency. The findings indicate that highly competent users differ from less competent users in their Personality Traits and Disposition Factors, General Cognitive Abilities, Social Skills and Tendencies, Experiential Learning Factors, Domain Knowledge of and Skills …

Go to article

First Prev Next Last