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 17041 - 17070 of 20664

Full-Text Articles in Entire DC Network

Cross-Layer Design Through Joint Routing And Link Allocation In Wireless Sensor Networks, Xuan Gong Jan 2008

Cross-Layer Design Through Joint Routing And Link Allocation In Wireless Sensor Networks, Xuan Gong

Masters Theses

"Both energy and bandwidth are scarce resources in sensor networks. In the past, the energy efficient routing problem has been extensively studied in efforts to maximize sensor network lifetimes, but the link bandwidth has been optimistically assumed to be abundant. Because energy constraint affects how data should be routed, link bandwidth affects not only the routing topology, but also the allowed data rate on each link, which in turn affects the lifetime. Previous research that focus on energy efficient operations in sensor networks with the sole objective of maximizing network lifetime only consider the energy constraint ignoring the bandwidth constraint. …

Go to article

Co-Optimization: A Generalization Of Coevolution, Travis Service Jan 2008

Co-Optimization: A Generalization Of Coevolution, Travis Service

Masters Theses

"Many problems encountered in computer science are best stated in terms of interactions amongst individuals. For example, many problems are most naturally phrased in terms of finding a candidate solution which performs best against a set of test cases. In such situations, methods are needed to find candidate solutions which are expected to perform best over all test cases. Coevolution holds the promise of addressing such problems by employing principles from biological evolution, where populations of candidate solutions and test cases are evolved over time to produce higher quality solutions...This thesis presents a generalization of coevolution to co-optimization, where optimization …

Go to article

An Economic Incentive Based Routing Protocol Incorporating Quality Of Service For Mobile Peer-To-Peer Networks, Anil Jade Jan 2008

An Economic Incentive Based Routing Protocol Incorporating Quality Of Service For Mobile Peer-To-Peer Networks, Anil Jade

Masters Theses

"Economic incentive models are becoming increasingly popular in Mobile Peer to Peer Networks (M-P2P). These models entice node participation to combat free riding and to effectively manage constraint resources in the network. Due to the dynamic topology of the M-P2P network, the connections between the peers become unpredictable and therefore, reliable routing becomes important. Many routing protocols proposed earlier (such as DSR, AODV) are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using economic models to find a cost effective optimal route from the source to the destination, while considering Quality of Service …

Go to article

Evaluation Of An Image Processing Algorithm For Scene Change Detection, Daniel Flores Jan 2008

Evaluation Of An Image Processing Algorithm For Scene Change Detection, Daniel Flores

Open Access Theses & Dissertations

Despite the efforts to reduce traffic accidents by government entities and automobile manufactures, the numbers of accidents are not considerably reduced. An evaluation of an algorithm based on the fly's eye is done on this research applying its principles to detect scene change on images for printed circuit boards providing initial steps to implement this algorithm on vehicular traffic to keep track of objects moving on the field for collision avoidance purposes. The effectiveness of the algorithm is addressed through a comparison of its performance with that found in experimental data.

Go to article

Adapting Adtrees For High Arity Features, Irene Langkilde-Geary, Robert Van Dam, Dan A. Ventura Jan 2008

Adapting Adtrees For High Arity Features, Irene Langkilde-Geary, Robert Van Dam, Dan A. Ventura

Faculty Publications

ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an incrementally updated dataset. For low arity symbolic features, ADtrees trade a slight increase in query time for a reduction in overall tree size. Unfortunately, for high arity features, the same technique can often result in a very large increase in query time and a nearly negligible tree size reduction. In the dynamic (lazy) version of the tree, both query time and tree size can increase for some applications. Here we present two modifications to …

Go to article

Sentiment Regression: Using Real-Valued Scores To Summarize Overall Document Sentiment, Adam Drake, Eric K. Ringger, Dan A. Ventura Jan 2008

Sentiment Regression: Using Real-Valued Scores To Summarize Overall Document Sentiment, Adam Drake, Eric K. Ringger, Dan A. Ventura

Faculty Publications

In this paper, we consider a sentiment regression problem: summarizing the overall sentiment of a review with a real-valued score. Empirical results on a set of labeled reviews show that real-valued sentiment modeling is feasible, as several algorithms improve upon baseline performance. We also analyze performance as the granularity of the classification problem moves from two-class (positive vs. negative) towards infinite-class (real-valued).

Go to article

Utilizing Phrase-Similarity Measures For Detecting And Clustering Informative Rss News Articles, Yiu-Kai D. Ng, Maria Soledad Pera Jan 2008

Utilizing Phrase-Similarity Measures For Detecting And Clustering Informative Rss News Articles, Yiu-Kai D. Ng, Maria Soledad Pera

Faculty Publications

As the number of RSS news feeds continue to increase over the Internet, it becomes necessary to minimize the workload of the user who is otherwise required to scan through huge numbers of news articles to find related articles of interest, which is a tedious and often an impossible task. In order to solve this problem, we present a novel approach, called InFRSS, which consists of a correlation-based phrase matching (CPM) model and a fuzzy compatibility clustering (FCC) model. CPM can detect RSS news articles containing phrases that are the same as well as semantically alike, and dictate the degrees …

Go to article

Validation Of An Nsp-Based (Negative Selection Pattern) Gene Family Identification Strategy, Ronald L. Frank, Cyriac Kandoth, Fikret Erçal Jan 2008

Validation Of An Nsp-Based (Negative Selection Pattern) Gene Family Identification Strategy, Ronald L. Frank, Cyriac Kandoth, Fikret Erçal

Biological Sciences Faculty Research & Creative Works

Background: Gene family identification from ESTs can be a valuable resource for analysis of genome evolution but presents unique challenges in organisms for which the entire genome is not yet sequenced. We have developed a novel gene family identification method based on negative selection patterns (NSP) between family members to screen EST-generated contigs. This strategy was tested on five known gene families in Arabidopsis to see if individual paralogs could be identified with accuracy from EST data alone when compared to the actual gene sequences in this fully sequenced genome. Results: The NSP method uniquely identified family members in all …

Go to article

Debian Clusters For Education And Research: The Missing Manual, Kristina Wanous Jan 2008

Debian Clusters For Education And Research: The Missing Manual, Kristina Wanous

Honors Program Theses

Debian Clusters for Education and Research: The Missing Manual [4], or just "Debian Clusters" for short, meets the needs of this growing group of people. The Debian Clusters project is an online resource for anyone wishing to set up a cluster, particularly for those using Debian as the operating system. It features detailed step-by-step tutorials for every part of cluster setup and administration. In order to be accessible to people new to clusters, the walkthroughs assume no previous knowledge of clustering or networking and explain the principles and vocabulary behind the steps, yet are complex and detailed enough to be …

Go to article

I-Minds: A Multiagent System For Intelligent Computer- Supported Collaborative Learning And Classroom Management, Leen-Kiat Soh, Nobel Khandaker, Hong Jiang Jan 2008

I-Minds: A Multiagent System For Intelligent Computer- Supported Collaborative Learning And Classroom Management, Leen-Kiat Soh, Nobel Khandaker, Hong Jiang

School of Computing: Faculty Publications

I-MINDS provides a computer-supported collaborative learning (CSCL) infrastructure and environment for learners in synchronous learning and classroom management applications for instructors, for large classroom or distance education situations. For supporting the instructor, I-MINDS includes a teacher agent. The teacher agent allows the instructor to interact with students, manage Q&A sessions, administer quizzes, post evaluations, form groups and monitor individual and group performances. For computer-supported collaborative learning, I-MINDS, which stands for Intelligent Multiagent Infrastructure for Distributed Systems in Education, provides a student agent for each student. Each student agent monitors and models its user and carries out group formation with other …

Go to article

Private Query On Encrypted Data In Multi-User Setting, Feng Bao, Robert H. Deng, Xuhua Ding, Yanjiang Yang Jan 2008

Private Query On Encrypted Data In Multi-User Setting, Feng Bao, Robert H. Deng, Xuhua Ding, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Searchable encryption schemes allow users to perform keyword based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multi-user setting. Our results include a set of security notions for multi-user searchable encryption as well as a construction which is provably secure under the newly introduced security notions.

Go to article

Business-Oriented Software Process Improvement Based On Cmm And Cmmi Using Qfd, Yan Sun Jan 2008

Business-Oriented Software Process Improvement Based On Cmm And Cmmi Using Qfd, Yan Sun

Doctoral Dissertations

"Software Process Improvement (SPI) has become the key to the survival of many software development organizations. Many international SPI models/standards are developed for SPI. The Capability Maturity Model (CMM) and Capability Maturity Model Integrated (CMMI)) from the Software Engineering Institute are two SPI models. In this study, several existing SPI models and approaches are reviewed, their advantages are identified, and their drawbacks are discussed. A set of new SPI frameworks integrating Quality Function Deployment (QFD) with both CMM and CMMI are developed by combining the best features of previous approaches and addressing their limitations"--Abstract, page iii.

Go to article

Automatic Composition Of Themed Mood Pieces, Heather Chan, Dan A. Ventura Jan 2008

Automatic Composition Of Themed Mood Pieces, Heather Chan, Dan A. Ventura

Faculty Publications

Musical harmonization of a given melody is a nontrivial problem; slight variations in instrumentation, voicing, texture, and bass rhythm can lead to significant differences in the mood of the resulting piece. This study explores the possibility of automatic musical composition by using machine learning and statistical natural language processing to tailor a piece to a particular mood using an existing melody.

Go to article

Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky Jan 2008

Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky

Research Collection School Of Computing and Information Systems

In this report, we present overview and comparative analysis of our HLF detection system, which achieves the top performance among all type-A submissions in 2008. We also describe preliminary evaluation of our video search system, CuZero, in the interactive search task.

Go to article

Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky Jan 2008

Concept Detection: Convergence To Local Features And Opportunities Beyond, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Document Selection For Extracting Entity And Relationship Instances Of Terrorist Events, Zhen Sun, Ee Peng Lim, Kuiyu Chang, Maggy Anastasia Suryanto, Rohan Kumar Gunaratna Jan 2008

Document Selection For Extracting Entity And Relationship Instances Of Terrorist Events, Zhen Sun, Ee Peng Lim, Kuiyu Chang, Maggy Anastasia Suryanto, Rohan Kumar Gunaratna

Research Collection School Of Computing and Information Systems

In this chapter, we study the problem of selecting documents so as to extract terrorist event information from a collection of documents. We represent an event by its entity and relation instances. Very often, these entity and relation instances have to be extracted from multiple documents. We therefore define an information extraction (IE) task as selecting documents and extracting from which entity and relation instances relevant to a user-specified event (aka domain specific event entity and relation extraction). We adopt domain specific IE patterns to extract potentially relevant entity and relation instances from documents, and develop a number of document …

Go to article

The Oil Drilling Model And Iterative Deepening Genetic Annealing Algorithm For The Traveling Salesman Problem, Hoong Chuin Lau, Fei Xiao Jan 2008

The Oil Drilling Model And Iterative Deepening Genetic Annealing Algorithm For The Traveling Salesman Problem, Hoong Chuin Lau, Fei Xiao

Research Collection School Of Computing and Information Systems

In this work, we liken the solving of combinatorial optimization problems under a prescribed computational budget as hunting for oil in an unexplored ground. Using this generic model, we instantiate an iterative deepening genetic annealing (IDGA) algorithm, which is a variant of memetic algorithms. Computational results on the traveling salesman problem show that IDGA is more effective than standard genetic algorithms or simulated annealing algorithms or a straightforward hybrid of them. Our model is readily applicable to solve other combinatorial optimization problems.

Go to article

Collective Outsourcing To Market (Com): A Market-Based Framework For Information Supply Chain Outsourcing, Fang Fang, Zhiling Guo, Andrew B. Whinston Jan 2008

Collective Outsourcing To Market (Com): A Market-Based Framework For Information Supply Chain Outsourcing, Fang Fang, Zhiling Guo, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

This paper discusses the importance of and a solution to separating the information flow from the physical product flow in a supply chain. Motivated by the inefficient demand forecast caused by information asymmetry and lack of an incentive among supply chain partners to share valuable information, we propose a radically new framework called collective outsourcing to market (COM) to address many information supply chain design challenges. To validate the COM framework, we consider a supply chain with one manufacturer and multiple downstream retailers. Retailers privately acquire demand forecast information that they do not have incentive to share horizontally with other …

Go to article

Fine-Grained Reputation-Based Routing In Wireless Ad Hoc Networks, Alma Cemerlic Jan 2008

Fine-Grained Reputation-Based Routing In Wireless Ad Hoc Networks, Alma Cemerlic

Masters Theses and Doctoral Dissertations

Ad hoc networks are very helpful in situations when no fixed network infrastructure is available. They are especially important in emergency situations such as natural disasters and military conflicts. Most developed wireless ad hoc routing protocols are designed to discover and maintain an active path from source to destination with an assumption that every node is friendly and cooperative. However, it is possible that the participating nodes are selfish or malicious. A mechanism to evaluate reputation for each node is essential for the reliability and security of routing protocol in ad hoc networks. We propose a fine-grained reputation system for …

Go to article

Set Linear Algebra And Set Fuzzy Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral Jan 2008

Set Linear Algebra And Set Fuzzy Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, the authors define the new notion of set vector spaces which is the most generalized form of vector spaces. Set vector spaces make use of the least number of algebraic operations, therefore, even a non-mathematician is comfortable working with it. It is with the passage of time, that we can think of set linear algebras as a paradigm shift from linear algebras. Here, the authors have also given the fuzzy parallels of these new classes of set linear algebras. This book abounds with examples to enable the reader to understand these new concepts easily. Laborious theorems and …

Go to article

Visual Language Representation For Use Case Evolution And Traceability, Coretta Willis Douglas Jan 2008

Visual Language Representation For Use Case Evolution And Traceability, Coretta Willis Douglas

LSU Doctoral Dissertations

The primary goal of this research is to assist non-technical stakeholders involved in requirements engineering with a comprehensible method for managing changing requirements within a specific domain. An important part of managing evolving requirements over time is to maintain a temporal ordering of the changes and to support traceability of the modifications. This research defines a semi-formal syntactical and semantic definition of such a method using a visual language, RE/TRAC (Requirements Evolution with Traceability), and a supporting formal semantic notation RE/TRAC-SEM. RE/TRAC-SEM is an ontological specification employing a combination of models, including verbal definitions, set theory and a string language …

Go to article

Web Based Resource Management For Multi-Tiered Web Applications, Bryce Daniel Ott Dec 2007

Web Based Resource Management For Multi-Tiered Web Applications, Bryce Daniel Ott

Theses and Dissertations

The currently emerging trend of building more complex web applications to solve increasingly more involved software problems has led to the the need for a more automated and practical means for deploying resources required by these advanced web applications. As web based applications become more complex and involve more developers, greater system redundancy, and a larger number of components, traditional means of resource deployment become painfully inadequate as they fail to scale sufficiently. The purpose of this research is to provide evidence that a more sound and scalable test and deployment process can be employed and that many of the …

Go to article

Goal-Oriented Job Scheduling For Parallel Computer Systems, Sangsuree Vasupongayya Dec 2007

Goal-Oriented Job Scheduling For Parallel Computer Systems, Sangsuree Vasupongayya

Dissertations and Theses

System administrators for parallel computers face many difficulties when managing job scheduling systems. First, current production job schedulers use many parameters, which seem flexible but it is highly challenging to configure and tune these parameters. Second, fair share is an important scheduling goal, but it is not clear what kind of fair share can be expected under current schedulers and how fair share impacts scheduling performance. Third, several job runtime prediction methods were proposed to improve inaccurate user-estimated runtimes, but these methods could under-estimate runtimes by a large amount and it is not clear whether they are practical for use …

Go to article

Taxonomy Of Iphone Activation And Sim Unlocking Methods, Marwan Al-Zarouni, Haitham Al-Hajri Dec 2007

Taxonomy Of Iphone Activation And Sim Unlocking Methods, Marwan Al-Zarouni, Haitham Al-Hajri

Australian Information Security Management Conference

This paper will discuss the different methods of SIM unlocking and activation for the Apple iPhone. Early iPhone activation and SIM card fabrication methods as well as the latest software only methods will be discussed. The paper will examine the benefits and drawbacks of each method. It will provide a step-by-step guide to creating a specially crafted SIM card for an iPhone by using Super SIM and Turbo SIM methods. The paper will also include a section on recovering (unbricking) the iPhone and other advanced hacks

Go to article

A Conceptual Model For Security Outsourcing, K. Samarasinghe, M. Warren, G. Pye Dec 2007

A Conceptual Model For Security Outsourcing, K. Samarasinghe, M. Warren, G. Pye

Australian Information Security Management Conference

This research analyses the current literature on IT security outsourcing and the organisational attitudes towards this approach to determine the applicability of outsourcing IT security in a commercial environment. A conceptual model is developed as the main goal of research which provides guidance in the process of outsourcing IT security functions to a third-party security service provider. The research conducted has established a complete process for outsourcing IT security.

Go to article

The Importance Of Human Factors When Assessing Outsourcing Security Risks, Carl Colwill, Andy Jones Dec 2007

The Importance Of Human Factors When Assessing Outsourcing Security Risks, Carl Colwill, Andy Jones

Australian Information Security Management Conference

The word is becoming increasingly interconnected and ways of doing business are evolving rapidly. Communications technology is ubiquitous and reliable and businesses are continuously seeking ways in which systems can be exploited to improve resilience, become more efficient and reduce costs. One way in which organisations seek to achieve this is by concentrating their efforts on core business processes and outsourcing non-core functions. However, outsourcing - and particularly offshoring - presents many security issues that must be considered throughout the lifetime of contracts. The scale of outsourcing and increasing technological and security complexity is making this task more difficult. Often …

Go to article

How Safe Is Azeroth, Or, Are Mmorpgs A Security Risk?, An Hilven, Andrew Woodward Dec 2007

How Safe Is Azeroth, Or, Are Mmorpgs A Security Risk?, An Hilven, Andrew Woodward

Australian Information Security Management Conference

Massive Multiplayer Online Role Playing Games (MMORPGs) are at a basic level a networked application. Blizzard’s World of Warcraft is currently the largest example of such a type of application, with over nine million subscribers at last count. Whilst the idea of researching a game for network security may sound trivial, nine million potential backdoors into home and business computers is not. The ports used by the game, as well as authentication methods and client update programs were examined using packet analysis software. No obvious vulnerabilities were discovered as a result of this analysis. In addition to this analysis, an …

Go to article

An Investigation Into The Usability Of Graphical Authentication Using Authentigraph, Paul Minne, Jason Wells, Damien Hutchinson, Justin Pierce Dec 2007

An Investigation Into The Usability Of Graphical Authentication Using Authentigraph, Paul Minne, Jason Wells, Damien Hutchinson, Justin Pierce

Australian Information Security Management Conference

There is increasing coverage in the literature relating to the different facets surrounding the security service of authentication, but there is a need for further research into the usability of graphical authentication. Specifically, the usability and viability of graphical authentication techniques for providing increased security needs to be further explored. There is a significant amount of evidence relating to traditional authentication techniques which highlight the fact that as technological advances grip modern societies, the requirement for more advanced authentication and security approaches increases. The exponential growth in the number of people using the Internet carries with it the high potential …

Go to article

Stochastic Models For In-Silico Event-Based Biological Network Simulation, Preetam Ghosh Dec 2007

Stochastic Models For In-Silico Event-Based Biological Network Simulation, Preetam Ghosh

Computer Science and Engineering Dissertations - Archive

The multi-scale biological system model is a new research direction to capture the dynamic measurements of complex biological systems. The current statistical thermodynamic models can not scale to this challenge due to the explosion of state-spaces of the system, where a biological organ may have billions of cells, each with millions of molecule types and each type may have a few million molecules. We seek to propose a phenomenological theory that will require a smaller number of state variables to address this multi-scaling problem. Discrete Markov statistical process is used to understand the system dynamics in the networking community for …

Go to article

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

First Prev Next Last