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

Computer Sciences Commons

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

2008

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1201 - 1230 of 1335

Full-Text Articles in Computer Sciences

Efficient Resource Management Mechanism For 802.16 Wireless Networks Based On Weighted Fair Queuing, Kiran Rangula Jan 2008

Efficient Resource Management Mechanism For 802.16 Wireless Networks Based On Weighted Fair Queuing, Kiran Rangula

Master's Projects

Wireless Networking continues on its path of being one of the most commonly used means of communication. The evolution of this technology has taken place through the design of various protocols. Some common wireless protocols are the WLAN, 802.16 or WiMAX, and the emerging 802.20, which specializes in high speed vehicular networks, taking the concept from 802.16 to higher levels of performance. As with any large network, congestion becomes an important issue. Congestion gains importance as more hosts join a wireless network. In most cases, congestion is caused by the lack of an efficient mechanism to deal with exponential increases …


Design & Evaluation Of Path-Based Reputation System For Manet Routing, Ji Li Jan 2008

Design & Evaluation Of Path-Based Reputation System For Manet Routing, Ji Li

Master's Projects

Most of the existing reputation systems in mobile ad hoc networks (MANET) consider only node reputations when selecting routes. Reputation and trust are therefore generally ensured within a one-hop distance when routing decisions are made, which often fail to provide the most reliable, trusted route. In this report, we first summarize the background studies on the security of MANET. Then, we propose a system that is based on path reputation, which is computed from reputation and trust values of each and every node in the route. The use of path reputation greatly enhances the reliability of resulting routes. The detailed …


A Comparative Xeon And Cbe Performance Analysis, Randy Fort Jan 2008

A Comparative Xeon And Cbe Performance Analysis, Randy Fort

Master's Projects

The Cell Broadband Engine is a high performance multicore processor with superb performance on certain types of problems. However, it does not perform as well running other algorithms, particularly those with heavy branching. The Intel Xeon processor is a high performance superscalar processor. It utilizes a high clock speed and deep pipelines to help it achieve superior performance. But deep pipelines can perform poorly with frequent memory accesses. This paper is a study and attempt at quantifying the types of programmatic structures that are more suitable to a particular architecture. It focuses on the issues of pipelines, memory access and …


The Prosody Of Uncertainty For Spoken Dialogue Intelligent Tutoring Systems, Bevan Jones Jan 2008

The Prosody Of Uncertainty For Spoken Dialogue Intelligent Tutoring Systems, Bevan Jones

Master's Projects

The speech medium is more than an audio conveyance of word strings. It contains meta information about the content of the speech. The prosody of speech, pauses and intonation, adds an extra dimension of diagnostic information about the quality of a speaker's answers, suggesting an important avenue of research for spoken dialogue tutoring systems. Tutoring systems that are sensitive to such cues may employ different tutoring strategies based on detected student uncertainty, and they may be able to perform more precise assessment of the area of student difficulty. However, properly identifying the cues can be challenging, typically requiring thousands of …


Exact And Approximation Algorithms For Computing Reversal Distances In Genome Rearrangement, Euna Park Jan 2008

Exact And Approximation Algorithms For Computing Reversal Distances In Genome Rearrangement, Euna Park

Master's Projects

Genome rearrangement is a research area capturing wide attention in molecular biology. The reversal distance problem is one of the most widely studied models of genome rearrangements in inferring the evolutionary relationship between two genomes at chromosome level. The problem of estimating reversal distance between two genomes is modeled as sorting by reversals. While the problem of sorting signed permutations can have polynomial time solutions, the problem of sorting unsigned permutations has been proven to be NP-hard [4]. This work introduces an exact greedy algorithm for sorting by reversals focusing on unsigned permutations. An improved method of producing cycle decompositions …


Bibliography Data Mining And Data Visualization, Deepthi Pullannagari Jan 2008

Bibliography Data Mining And Data Visualization, Deepthi Pullannagari

Master's Projects

Data mining is a concept of discovering meaningful patterns from large data repositories, and Data visualization is a graphical representation of data using shapes, colors and images for a better conceptualization. These two techniques have been in use for a long time now and are used together in number of fields to gain a better perception of the data. Bibliographic data is widely used in academic and scientific literature fields and this project deals with data mining and data visualization of bibliographic data downloaded from Citeseer Citation Indexing system. The downloaded metadata is extracted into the database, looking for patterns …


Firefox Extension To Add Contacts, Events, And View Addresses, Vijay Rao Jan 2008

Firefox Extension To Add Contacts, Events, And View Addresses, Vijay Rao

Master's Projects

Users of the Firefox browser have the ability to download plugins to manage their contacts. This usually involves typing or copying the details from some source to add contacts. Event and meeting invitations are sent by mail and are added to the user’s calendar once the user accepts the invitation. Users viewing address data on websites are limited to the mapping capabilities provided by the webpage viewed by the user. We developed a Firefox extension that allows the user to select portions of text with contact or event information and add it as a contact or an event in the …


Online Collaborative Time Management System Using Artificial Intelligence, Anand Sivaramakrishnan Jan 2008

Online Collaborative Time Management System Using Artificial Intelligence, Anand Sivaramakrishnan

Master's Projects

Online Collaborative Time Management System is a system that will plan events and help achieve goals intelligently using Partial Order Planning. This product is similar to a social networking site, which plans events for collaborative set of people. For this masters’ project, such a system is developed. Our site allows multiple people to add items to a collaborative To-Do list. The user interface for our site allows people to add actions and preconditions to the existing system, enabling the system to grow constantly. In order to generate a sequence of actions to the most complex problems, partial order generators are …


Online Visualization Of Bibliography Using Visualization Techniques, Bharath Kumar Manur Venkataramana Jan 2008

Online Visualization Of Bibliography Using Visualization Techniques, Bharath Kumar Manur Venkataramana

Master's Projects

Visualization is a concept where we can represent some raw data in the form of graphs, images, charts, etc. which will be very helpful for the end-user to correlate and be able to understand the relationships between the data elements in a single screen. Representing the bibliographic information of the computer science journals and proceedings using Visualization technique would help user choose a particular author and navigate through the hierarchy and find out what papers the author has published, the keywords of the papers, what papers cite them, the co-authors along with the main author, and how many papers are …


Accurate And Robust Preconditioning Techniques For Solving General Sparse Linear Systems, Eun-Joo Lee Jan 2008

Accurate And Robust Preconditioning Techniques For Solving General Sparse Linear Systems, Eun-Joo Lee

University of Kentucky Doctoral Dissertations

Please download this dissertation to see the abstract.


An Automatic Bridge Detection Technique For Multispectral Images, D. Chaudhuri, Ashok Samal Jan 2008

An Automatic Bridge Detection Technique For Multispectral Images, D. Chaudhuri, Ashok Samal

School of Computing: Conference and Workshop Papers

Extraction of features from images has been a goal of researchers since the early days of remote sensing. While significant progress has been made in several applications, much remains to be done in the area of accurate identification of high-level features such as buildings and roads. This paper presents an approach for detecting bridges over water bodies from multispectral imagery. The multispectral image is first classified into eight land-cover types using a majority-must-be-granted logic based on the multiseed supervised classification technique. The classified image is then categorized into a trilevel image: water, concrete, and background. Bridges are then recognized in …


Considering Operational Issues For Multiagent Conceptual Inferencing In A Distributed Information Retrieval Application, Leen-Kiat Soh Jan 2008

Considering Operational Issues For Multiagent Conceptual Inferencing In A Distributed Information Retrieval Application, Leen-Kiat Soh

School of Computing: Faculty Publications

Our system, based on a multiagent framework called collaborative understanding of distributed knowledge (CUDK), is designed with the overall goal of balancing agents’ conceptual learning and task accomplishment. The tradeoff between the two is that while conceptual learning allows an agent to improve its own concept base, it could be counter-productive: conceptual learning is time consuming and requires processing resources necessary for the agent to accomplish its tasks. In our current phase of research, we investigate the roles of resource and knowledge constraints, environmental factors (such as the frequency of queries), and learning mechanisms in a CUDK-based distributed information retrieval …


Partial Forwarding Scheme For Dynamic Window Resizing In Live P2p Streaming Systems, Zhipeng Ouyang, Lisong Xu, Byrav Ramamurthy Jan 2008

Partial Forwarding Scheme For Dynamic Window Resizing In Live P2p Streaming Systems, Zhipeng Ouyang, Lisong Xu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Peer-to-peer (P2P) streaming systems, in which individual nodes or peers operated by ordinary Internet users collaborate to serve video streams, have recently aroused considerable interest in both academia and industry. An important problem in P2P streaming systems is how to reduce their consumed bandwidth, which is a major concern of Internet service providers. Our work is motivated by the fact that a user may dynamically change the size of a window displaying a video stream according to his/her personal choice, a scenario we refer to as dynamic window resizing. In this paper, we propose a scheme called the Partial Forwarding …


A Security Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue, Xukai Zou Jan 2008

A Security Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue, Xukai Zou

School of Computing: Conference and Workshop Papers

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Many key management protocols have been specifically designed for wireless sensor networks. However, most of the key management protocols focus on the establishment of the required keys or the removal of the compromised keys. The design of these key management protocols does not consider the support of higher level security applications. When the applications are integrated later in sensor networks, new mechanisms must be designed. In this paper, we propose a security …


Providing Reliable Data Transport For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang Jan 2008

Providing Reliable Data Transport For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang

School of Computing: Conference and Workshop Papers

In this paper, we propose a Loss Tolerant Reliable (LTR) data transport mechanism for dynamic Event Sensing (LTRES) in WSNs. In LTRES, a reliable event sensing requirement at the transport layer is dynamically determined by the sink. A distributed source rate adaptation mechanism is designed, incorporating a loss rate based lightweight congestion control mechanism, to regulate the data traffic injected into the network so that the reliability requirement can be satisfied. An equation based fair rate control algorithm is used to improve the fairness among the LTRES flows sharing the congestion path. The performance evaluations show that LTRES can provide …


A Key Management Protocol For Wireless Sensor Networks With Multiple Base Stations, Yong Wang, Byrav Ramamurthy, Yuyan Xue Jan 2008

A Key Management Protocol For Wireless Sensor Networks With Multiple Base Stations, Yong Wang, Byrav Ramamurthy, Yuyan Xue

School of Computing: Conference and Workshop Papers

Most of the proposed key management protocols for wireless sensor networks (WSNs) in the literature assume that a single base station is used and that the base station is trustworthy. However, there are applications in which multiple base stations are used and the security of the base stations must be considered. This paper investigates a key management protocol in wireless sensor networks which include multiple base stations. We consider the situations in which both the base stations and the sensor nodes can be compromised. The proposed key management protocol, mKeying, includes two schemes, a key distribution scheme, mKeyDist, supporting multiple …


Computation Of A Face Attractiveness Index Based On Neoclassical Canons, Symmetry, And Golden Ratios, Kendra Schmid, David Marx, Ashok Samal Jan 2008

Computation Of A Face Attractiveness Index Based On Neoclassical Canons, Symmetry, And Golden Ratios, Kendra Schmid, David Marx, Ashok Samal

School of Computing: Faculty Publications

Analysis of attractiveness of faces has long been a topic of research. Literature has identified many different factors that can be related to attractiveness. In this research we analyze the role of symmetry, neoclassical canons, and golden ratio in the determination of attractiveness of a face. We focus on the geometry of a face and use actual faces for our analysis. We find there are some differences in the criteria used by males and females to determine attractiveness. The model we have developed to predict the attractiveness of a face using its geometry is accurate with low residual errors.


Cross-Layer Packet Size Optimization For Wireless Terrestrial, Underwater, And Underground Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz Jan 2008

Cross-Layer Packet Size Optimization For Wireless Terrestrial, Underwater, And Underground Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz

School of Computing: Conference and Workshop Papers

In this paper, a cross-layer solution for packet size optimization in wireless sensor networks (WSN) is introduced such that the effects of multi-hop routing, the broadcast nature of the physical wireless channel, and the effects of error control techniques are captured. A key result of this paper is that contrary to the conventional wireless networks, in wireless sensor networks, longer packets reduce the collision probability. Consequently, an optimization solution is formalized by using three different objective functions, i.e., packet throughput, energy consumption, and resource utilization. Furthermore, the effects of end-to-end latency and reliability constraints are investigated that may be required …


Design Of A Wireless Vision Sensor For Object Tracking In Wireless Vision Sensor Networks, Mauricio Casarest, Mehmet C. Vuran, Senem Velipasalar Jan 2008

Design Of A Wireless Vision Sensor For Object Tracking In Wireless Vision Sensor Networks, Mauricio Casarest, Mehmet C. Vuran, Senem Velipasalar

School of Computing: Conference and Workshop Papers

The integration of CMOS cameras with embedded processors and wireless communication devices has enabled the development of distributed wireless vision systems. Wireless Vision Sensor Networks (WVSNs), which consist of wirelessly connected embedded systems with vision and sensing capabilities, provide wide variety of application areas that have not been possible to realize with the wall-powered vision systems with wired links or scalar-data based wireless sensor networks. In this paper, the design of a middleware for a wireless vision sensor node is presented for the realization of WVSNs. The implemented wireless vision sensor node is tested through a simple vision application to …


Network Coding For Wdm All-Optical Multicast, Eric D. Manley, Jitender S. Deogun, Lisong Xu, Dennis R. Alexander Jan 2008

Network Coding For Wdm All-Optical Multicast, Eric D. Manley, Jitender S. Deogun, Lisong Xu, Dennis R. Alexander

School of Computing: Technical Reports

Network coding has become a useful means for achieving efficient multicast, and the optical community has started to examine its application to optical networks. However, a number of challenges, including limited processing capability and coarse bandwidth granularity, need to be overcome before network coding can be effectively used in optical networks. In this paper, we address some of these problems. We consider the problem of finding efficient routes to use with coding, and we study the effectiveness of using network coding for optical-layer dedicated protection of multicast traffic. We also propose architectures for all-optical circuits capable of performing the processing …


A New Design For The Hudson Community School District's Website, Shannon Michelle Horn Jan 2008

A New Design For The Hudson Community School District's Website, Shannon Michelle Horn

Honors Program Theses

Technology is increasingly becoming a bigger and more important part of our daily lives. Especially in such institutions as the public education system, the Internet is becoming more widely used as a source of information and a means of communication between the district and parents, students, the community, and even teachers. The Internet, and all forms of technology, is increasingly becoming the primary way people access information, especially in education. As more and more schools are depending on the Internet to promote their schools, they are in tum becoming dependent on how outsiders view their website as a first impression …


Fundamental Stock Market Analysis Tool, Rakshith Varadaraju Jan 2008

Fundamental Stock Market Analysis Tool, Rakshith Varadaraju

Honors Program Theses

There are many sources for stock market information and an investor can tap into the television or online media to sync up with current market news. Popular sources are news channels such as CNBC or CNN who spend the better part of the day evaluating the stock market. The internet is filled with a wealth of data ranging from historical to current market information. Added to this information are countless websites that make predictions on what stocks should be bought or sold. The challenge with all of this information is to figure out which sources are actually valid and can …


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 …


Application Of Blast-Based Techniques For Musical Information Retrieval, Fedor Aleksandrovich Korsakov Jan 2008

Application Of Blast-Based Techniques For Musical Information Retrieval, Fedor Aleksandrovich Korsakov

Honors Program Theses

Content retrieval in musical collections has been dependent on textual metadata (e.g. ID3 tags) which can present problems when the title of a piece is forgotten, misspelled, or when the search revolves around the similarity of sound. Content-based MIR (musical information retrieval) could offer an alternative. BLAST (basic local alignment search tool), an algorithm widely used in bioinformatics to search for sequences of aminoacids within longer sequences, seeks similarities and homologies, which makes it interesting for MIR, because musical information can be expected to be imprecise, and because homologies can allow to draw connections between musical pieces. Increased availability of …


Towards A Metric For The Assessment Of Safety Critical Control Systems, Oscar R. Gonzalez, Jorge R. Chavez-Fuentes, W. Steven Gray Jan 2008

Towards A Metric For The Assessment Of Safety Critical Control Systems, Oscar R. Gonzalez, Jorge R. Chavez-Fuentes, W. Steven Gray

Electrical & Computer Engineering Faculty Publications

There is a need for better integration of the fault tolerant and the control designs for safety critical systems such as aircraft. The dependability of current designs is assessed primarily with measures of the interconnection of fault tolerant components: the reliability function and the mean time to failure. These measures do not directly take into account the interaction of the fault tolerant components with the dynamics of the aircraft. In this paper, a first step to better integrate these designs is made. It is based on the observation that unstable systems are intrinsically unreliable and that a necessary condition for …


Gradient-Based Edge Detection On A Hexagonal Structure, Xiangjian He, Qiang Wu, Tom Hintz, Wenjing Jia Jan 2008

Gradient-Based Edge Detection On A Hexagonal Structure, Xiangjian He, Qiang Wu, Tom Hintz, Wenjing Jia

Business Review

Gradient-based edge detection is a straightforward method to identify the edge points in the original grey-level image. It is intuitive that in the human vision system the edge points always appear where the grey-level value is greatly changed. Spiral Architecture is a relatively new image data structure that is inspired from anatomical considerations of the primate’s vision. In Spiral Architecture, each image is represented as a collection of hexagonal pixels. Edge detection on Spiral Architecture has features of fast computation and accurate localization. In this paper, we review the gradient-based edge detection algorithms on Spiral Architecture. An edge point is …


The Java 5 Generics Compromise Orthogonality To Keep Compatibility, Atanas Radenski, Jeff Furlong, Vladimir Zanev Jan 2008

The Java 5 Generics Compromise Orthogonality To Keep Compatibility, Atanas Radenski, Jeff Furlong, Vladimir Zanev

Mathematics, Physics, and Computer Science Faculty Articles and Research

In response to a long-lasting anticipation by the Java community, version 1.5 of the Java 2 platform - referred to as Java 5 - introduced generic types and methods to the Java language. The Java 5 generics are a significant enhancement to the language expressivity because they allow straightforward composition of new generic classes from existing ones while reducing the need for a plethora of type casts. While the Java 5 generics are expressive, the chosen implementation method, type erasure, has triggered undesirable orthogonality violations. This paper identifies six cases of orthogonality violations in the Java 5 generics and demonstrates …


Adaptive Software Transactional Memory: Dynamic Contention Management, Joel Frank Jan 2008

Adaptive Software Transactional Memory: Dynamic Contention Management, Joel Frank

Master's Projects

This thesis addresses the problem of contention management in Software Transactional Memory (STM), which is a scheme for managing shared memory in a concurrent programming environment. STM views shared memory in a way similar to that of a database; read and write operations are handled through transactions, with changes to the shared memory becoming permanent through commit operations. Research on this subject reveals that there are currently varying methods for collision detection, data validation, and contention management, each of which has different situations in which they become the preferred method. This thesis introduces a dynamic contention manager that monitors current …


Online Recommendation System, Ankit Khera Jan 2008

Online Recommendation System, Ankit Khera

Master's Projects

The vast amount of data available on the Internet has led to the development of recommendation systems. This project proposes the use of soft computing techniques to develop recommendation systems. It addresses the limitations of current algorithms used to implement recommendation systems, evaluation of experimental results, and conclusion. This report provides a detailed summary of the project “Online Recommendation System” as part of fulfillment of the Master's Writing Project, Computer Science Department, San Jose State University’s. The report includes a description of the topic, system architecture, and provides a detailed description of the work done till point. Included in the …


Dna Fragment Assembly Algorithms: Toward A Solution For Long Repeats, Ching Li Jan 2008

Dna Fragment Assembly Algorithms: Toward A Solution For Long Repeats, Ching Li

Master's Projects

In this work, we describe our efforts to seek optimal solutions for the DNA Fragment Assembly Problem in terms of assembly accuracy and runtime efficiency. The main obstacles for the DNA Fragment Assembly are analyzed. After reviewing various advanced algorithms adopted by some assemblers in the bioinformatics industry, this work explores the feasibility of assembling fragments for a target sequence containing perfect long repeats, which is deemed theoretically impossible without tedious finishing reaction experiments. Innovative algorithms incorporating statistical analysis proposed in this work make the restoration of DNA sequences containing long perfect repeats an attainable goal.