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 56251 - 56280 of 63327

Full-Text Articles in Entire DC Network

Balancing The Performance Of A Sensor Network Using An Ant System, Rajani Muraleedharan, Lisa Ann Osadciw Jan 2003

Balancing The Performance Of A Sensor Network Using An Ant System, Rajani Muraleedharan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

In a sensor network consisting of both wired and wireless links, the nodes sense, collect and distribute dynamic information from one sensor to the other. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. The sensors also have limited memory and functionality to support communications. Therefore, there is a need to balance energy usage with obtaining the shortest communication distance. This paper presents a novel approach to selecting message routes using an ant system. Parameters controlling the convergence of the ant system are analyzed in terms of wired and wireless networks.

Go to article

A Transport Framework For Distributed Brokering Systems, Shrideep Pallickara, Geoffrey C. Fox, John Yin, Gurham Gunduz, Hongbin Liu, Ahmet Uyar, Mustafa Varank Jan 2003

A Transport Framework For Distributed Brokering Systems, Shrideep Pallickara, Geoffrey C. Fox, John Yin, Gurham Gunduz, Hongbin Liu, Ahmet Uyar, Mustafa Varank

Electrical Engineering and Computer Science - All Scholarship

Increasingly, services need to interact with a wide spectrum of devices with varying networking capabilities. Services hosted on a messaging infrastructure need to optimally utilize and exploit the conditions that exist within the local networks. The messaging infrastructure must manage the communication between external resources, services and clients to achieve the highest possible system performance and reliability. In this paper we suggest that a transport framework needs to be incorporated into the messaging infrastructure hosting the services. We base our investigations in the context of the NaradaBrokering system.

Go to article

An Intelligent Deployment And Clustering Algorithm For A Distributed Mobile Sensor Network, Nojeong Heo, Pramod K. Varshney Jan 2003

An Intelligent Deployment And Clustering Algorithm For A Distributed Mobile Sensor Network, Nojeong Heo, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

Energy in a wireless sensor network(WSN) is a precious resource. Deployment of mobile sensors in a WSN is an energy consuming process and it should be carefully designed. In this paper, we propose an intelligent energy-efficient deployment algorithm for cluster-based WSN by a synergistic combination of cluster structuring and a peer-to-peer deployment scheme. Performance of our algorithm is evaluated in terms of coverage, uniformity, and time and distance traveled till the algorithm converges. Our algorithm is shown to exhibit excellent performance.

Go to article

Optimization Using Particle Swarms With Near Neighbor Interactions, Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K. Mohan, Lisa Ann Osadciw Jan 2003

Optimization Using Particle Swarms With Near Neighbor Interactions, Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K. Mohan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. In the new algorithm, each particle is attracted towards the best previous positions visited by its neighbors, in addition to the other aspects of particle dynamics in PSO. This is accomplished by using the ratio of the relative fitness and the distance of other particles to determine the direction in which each component of the particle position needs to be changed. The resulting algorithm, known as Fitness-Distance-Ratio based PSO (FDR-PSO), is shown to perform …

Go to article

Defining Open Source Software Project Success, Kevin Crowston, Hala Annabi, James Howison Jan 2003

Defining Open Source Software Project Success, Kevin Crowston, Hala Annabi, James Howison

School of Information Studies - Faculty Scholarship

No abstract provided.

Go to article

Common Data Administration, Data Management, And Data Alignment As A Necessary Requirement For Coupling C4isr Systems And M&S Systems, Andreas Tolk Jan 2003

Common Data Administration, Data Management, And Data Alignment As A Necessary Requirement For Coupling C4isr Systems And M&S Systems, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

Within the application domain of military simulation systems, training and exercises as well as support to real operations require the coupling of the simulation system delivering the needed functionality with the Command, Control, Computing, Communications, Intelligence, Surveillance, and Reconnaissance (C4ISR) system providing the necessary data. The solution to this challenge is to build appropriate interfaces. Although in long term a more integrated approach will be necessary, in short and mid term, gateways and interfaces are likely to remain the standard. However, in order to succeed with the respective efforts, at least on the data level of interoperability, a common solution …

Go to article

Tr-2003005: Lambek Calculus Is Np-Complete, Mati Pentus Jan 2003

Tr-2003005: Lambek Calculus Is Np-Complete, Mati Pentus

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003006: Rijndael For Algebraists: An Expanded Version Of Lenstra's Manuscript, Hannes Moritz, Wei Zhu Jan 2003

Tr-2003006: Rijndael For Algebraists: An Expanded Version Of Lenstra's Manuscript, Hannes Moritz, Wei Zhu

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003009: A Hierarchical Projection Pursuit Clustering Algorithm, Jayson E. Rome, Alexei D. Miasnikov, Robert M. Haralick Jan 2003

Tr-2003009: A Hierarchical Projection Pursuit Clustering Algorithm, Jayson E. Rome, Alexei D. Miasnikov, Robert M. Haralick

Computer Science Technical Reports

No abstract provided.

Go to article

Tr-2003004: Superfast Algorithms For Singular Toeplitz/Hankel-Like Matrices, Victor Y. Pan Jan 2003

Tr-2003004: Superfast Algorithms For Singular Toeplitz/Hankel-Like Matrices, Victor Y. Pan

Computer Science Technical Reports

No abstract provided.

Go to article

The Computational Complexity Of Motion Planning, Jeff R.K. Hartline '01, Ran Libeskind-Hadas Jan 2003

The Computational Complexity Of Motion Planning, Jeff R.K. Hartline '01, Ran Libeskind-Hadas

All HMC Faculty Publications and Research

In this paper we show that a generalization of a popular motion planning puzzle called Lunar Lockout is computationally intractable. In particular, we show that the problem is PSPACE-complete. We begin with a review of NP-completeness and polynomial-time reductions, introduce the class PSPACE, and motivate the significance of PSPACE-complete problems. Afterwards, we prove that determining whether a given instance of a generalized Lunar Lockout puzzle is solvable is PSPACE-complete.

Go to article

White Board, Getahun Alemu Jan 2003

White Board, Getahun Alemu

Theses Digitization Project

This project designs and implements a tool to enhance the current means of availing coursework information in educational systems.

Go to article

International Extension Programs Information System, Yu-Pin Chang Jan 2003

International Extension Programs Information System, Yu-Pin Chang

Theses Digitization Project

No abstract provided.

Go to article

Entertainics, Jesus Mario Torres Garza Jan 2003

Entertainics, Jesus Mario Torres Garza

Theses Digitization Project

Entertainics is a web-based software application used to gather information about DVD players from several web-sites on the internet. The purpose of this software is to help users search for DVD players in a faster and easier way, by avoiding the navigation on every web-site that contains this product.

Go to article

The Grounding Of An Ice Shelf In The Central Arctic Ocean: A Modeling Experiment, Martin Jakobsson, M Siegert, Mark Paton Jan 2003

The Grounding Of An Ice Shelf In The Central Arctic Ocean: A Modeling Experiment, Martin Jakobsson, M Siegert, Mark Paton

Center for Coastal and Ocean Mapping

A numerical ice sheet model was used in a first test towards evaluating the hypothesis that, during a period of large-scale glaciation, an ice shelf emanating from the Barents/Kara Seas grounded across parts of the Lomonosov Ridge to a depth of around 1000 m below present sea level (Jakobsson, 1999; Polyak et al., 2001). Despite that we not include complex ice shelf physics or grounding line mechanics in our model and treat the process of marine melting in a simple manner, our experiments are the necessary first steps toward providing a comprehensive reconstruction of the former ice-sheet/ice-shelf system in the …

Go to article

Seafloor Segmentation Based On Bathymetric Measurements From Multibeam Echosounders Data, Yuri Rzhanov, Randy G. Cutter Jr., Larry A. Mayer Jan 2003

Seafloor Segmentation Based On Bathymetric Measurements From Multibeam Echosounders Data, Yuri Rzhanov, Randy G. Cutter Jr., Larry A. Mayer

Center for Coastal and Ocean Mapping

Bathymetric data depicts the geomorphology of the seabottom and allows characterization of spatial distributions of apparent benthic habitats. The variability of seafloor topography can be defined as a texture. This prompts for the application of well developed image processing techniques for automatic delineation of regions with clucially different physiographic characteristics. In the present paper histograms of biologically motivated invariant image attributes are used for characterization of local geomorphological feahires. This technique can be naturally applied in a range of spatial scales. Local feature vectors are then submitted to a procedure which divides the set into a number of clusters each …

Go to article

Ua1bc Final Report Of 2002-2003 Wku Technology Advisory Council Meetings, Western Kentucky University Jan 2003

Ua1bc Final Report Of 2002-2003 Wku Technology Advisory Council Meetings, Western Kentucky University

WKU Administration Documents

The WKU Technology Advisory Council was established on November 8, 2002. It is comprised of faculty, deans, department heads, directors and students. This report contains summaries of meeting minutes and list of committee members.

Go to article

Mutual Information Based Image Registration For Remote Sensing Data, Hua-Mei Chen, Manoj K. Arora, Pramod K. Varshney Jan 2003

Mutual Information Based Image Registration For Remote Sensing Data, Hua-Mei Chen, Manoj K. Arora, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

Registration is a fundamental operation in image processing to align images taken at different times, from different sensors or from different viewing angles. Automatic image registration procedures are gaining importance to efficiently register large volumes of remote sensing data available these days. In this Letter, we investigate an automated mutual information based registration technique for remote sensing data. Performance of a number of interpolation algorithms to compute mutual information for registration of multi-sensor and multi-resolution Landsat TM, Radarsat SAR and IRS PAN images is evaluated.

Go to article

Wiki-Style Administration Of Online Course Content, Jianmin Wang Jan 2003

Wiki-Style Administration Of Online Course Content, Jianmin Wang

Theses Digitization Project

A Wiki is a piece of server software that allows users to freely create and edit Web page content using any Web browser. This project created the program, "Wiki-Style Administration of Online Course Content" (WAOCC) which can be used as a teaching assistant board. Students can edit their works online and the instructor can review the work and correct it directly if necessary from the WAOCC.

Go to article

Prescription Express System, Chia-Yu Tsai Jan 2003

Prescription Express System, Chia-Yu Tsai

Theses Digitization Project

The Prescription Express System is a software program that was developed with express service of health care in mind. The purpose was to provide easy access for doctors to check on upcoming appointments with patients and send prescriptions via wireless network directly to the pharmacy to provide faster service.

Go to article

A Multi-Agent Architecture For Internet Distributed Computing System, Rodelyn Reyes Samson Jan 2003

A Multi-Agent Architecture For Internet Distributed Computing System, Rodelyn Reyes Samson

Theses Digitization Project

This thesis presents the developed taxonomy of the agent-based distributed computing systems. Based on this taxonomy, a design, implementation, analysis and distribution protocol of a multi-agent architecture for internet-based distributed computing system was developed. A prototype of the designed architecture was implemented on Spider III using the IBM Aglets software development kit (ASDK 2.0) and the language Java.

Go to article

Simulation Of Soil Water Movement Model (Swamm) Using The Spider Distributed System, Li Wang Jan 2003

Simulation Of Soil Water Movement Model (Swamm) Using The Spider Distributed System, Li Wang

Theses Digitization Project

This project implements a real application on the Spider II, which is a simulation of Soil Water Movement Model. The main objectives of this project were to develop a parallel and distributed algorithm for the Soil Water Model; implement the Soil Water Movement Simulation model on the Spider II distributed system and to evaluate the performance of simulating the Soil Water Movement Model on Spider II.

Go to article

Telephone Directory Web Service, Hua Sun Jan 2003

Telephone Directory Web Service, Hua Sun

Theses Digitization Project

This was a project to develop a Telephone Directory Web service (TDWS) to provide convenient and cost-effective access to public telephone directory data.

Go to article

A Parallel Algorithm To Solve The Mathematical Problem "Double Coset Enumeration Of S₂₄ Over M₂₄", Elena Yavorska Harris Jan 2003

A Parallel Algorithm To Solve The Mathematical Problem "Double Coset Enumeration Of S₂₄ Over M₂₄", Elena Yavorska Harris

Theses Digitization Project

This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the existing algorithms, but rather to explore a possibility to extend calculations of single cosets beyond the limits encountered when using currently available methods.

Go to article

Unified Modeling Language Class Diagram Translator For The Online Design Pattern Library System, Kaiyan Li Jan 2003

Unified Modeling Language Class Diagram Translator For The Online Design Pattern Library System, Kaiyan Li

Theses Digitization Project

The Unified Modeling Language (UML) is the successor to the wave of object-oriented analysis and design (OOA&D) methods that appeared in the late '80s and early '90s. The class diagram is one of the most useful diagrams in UML. The class diagram technique has become truly central within object-oriented methods.

Go to article

Taxonomy Of Synchronization And Barrier As A Basic Mechanism For Building Other Synchronization From It, Pauline Braginton Jan 2003

Taxonomy Of Synchronization And Barrier As A Basic Mechanism For Building Other Synchronization From It, Pauline Braginton

Theses Digitization Project

A Distributed Shared Memory(DSM) system consists of several computers that share a memory area and has no global clock. Therefore, an ordering of events in the system is necessary. Synchronization is a mechanism for coordinating activities between processes, which are program instantiations in a system.

Go to article

A Tabular Propositional Logic: And/Or Table Translator, Chen-Hsiu Lee Jan 2003

A Tabular Propositional Logic: And/Or Table Translator, Chen-Hsiu Lee

Theses Digitization Project

The goal of this project is to design a tool to help users translate any logic statement into Disjunctive Normal Form and present the result as an AND/OR TABLE, which makes the logic relation easier to express by using a two-dimensional grid of values or expressions. This tool is implemented through a web-based and Java-based application. Thus, the user can utilize this tool via World Wide Web.

Go to article

Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda Jan 2003

Generalized Metrics And Uniquely Determined Logic Programs, Pascal Hitzler, Anthony K. Seda

Computer Science and Engineering Faculty Publications

The introduction of negation into logic programming brings the benefit of enhanced syntax and expressibility, but creates some semantical problems. Specifically, certain operators which are monotonic in the absence of negation become non-monotonic when it is introduced, with the result that standard approaches to denotational semantics then become inapplicable. In this paper, we show how generalized metric spaces can be used to obtain fixed-point semantics for several classes of programs relative to the supported model semantics, and investigate relationships between the underlying spaces we employ. Our methods allow the analysis of classes of programs which include the acyclic, locally hierarchical, …

Go to article

Semantic N-Gram Language Modeling With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao Jan 2003

Semantic N-Gram Language Modeling With The Latent Maximum Entropy Principle, Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin Zhao

Kno.e.sis Publications

We describe a unified probabilistic framework for statistical language modeling-the latent maximum entropy principle-which can effectively incorporate various aspects of natural language, such as local word interaction, syntactic structure and semantic document information. Unlike previous work on maximum entropy methods for language modeling, which only allow explicit features to be modeled, our framework also allows relationships over hidden features to be captured, resulting in a more expressive language model. We describe efficient algorithms for marginalization, inference and normalization in our extended models. We then present experimental results for our approach on the Wall Street Journal corpus.

Go to article

Protein Structure, Function, And Folding, Dan E. Krane, Michael L. Raymer Jan 2003

Protein Structure, Function, And Folding, Dan E. Krane, Michael L. Raymer

Computer Science and Engineering Faculty Publications

Presentation prepared for Intro to Bioinformatics. The lecture comprises material from the text Fundamental Concepts of Bioinformatics.

Go to article

First Prev Next Last