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

Computer Sciences Commons™

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

2004

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 661 - 690 of 797

Full-Text Articles in Computer Sciences

Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer Jan 2004

Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer

Electrical Engineering and Computer Science - All Scholarship

For a wireless sensor network (WSN) with a large number of sensors, a decision fusion rule using the total number of detections reported by local sensors for hypothesis testing, is proposed and studied. Based on a signal attenuation model where the received signal power decays as the distance from the target increases, the system level detection performance, namely probabilities of detection and false alarms, are derived and calculated. Without the knowledge of local sensors' performances and at low signal to noise ratio (SNR), this fusion rule can still achieve very good system level detection performance if the number of sensors …

Go to article

Design And Implementation Of A Collaboration Web-Services System, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Harun Altay Jan 2004

Design And Implementation Of A Collaboration Web-Services System, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Harun Altay

Electrical Engineering and Computer Science - All Scholarship

Conference control has been studied for years but most researches focus on homogenous collaboration. There is no conference control framework for integration of multiple collaboration systems such as H.323, SIP and AccessGrid. In this paper we present a web-services based scalable conference control framework for such a heterogeneous collaboration system. Based on this framework, we implemented a prototype system to verify and refine our framework. This system can support various conferencing endpoints and communities.

Go to article

Sensor Fusion For Video Surveillance, Lauro Snidaro, Gian Luca Foresti, Ruixin Niu, Pramod K. Varshney Jan 2004

Sensor Fusion For Video Surveillance, Lauro Snidaro, Gian Luca Foresti, Ruixin Niu, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

In this paper, a multisensor data fusion system for object tracking is presented. It is able to track in real-time multiple targets in outdoor environments. The system can take advantage of the redundant information coming from different sensors monitoring the same scene. The measurements (positions of the targets) obtained from the available sources are fused together to obtain a more accurate estimate. Data fusion is performed considering sensor reliability at every time instant. A confidence measure has been employed to weight sensor data in the fusion process. Compared to single camera systems, the adopted approach has produced more accurate and …

Go to article

Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar Jan 2004

Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We reformulate Scalable Vector Graphics browser in a Web Service architecture separating the rendering from the W3C DOM processing of events. We describe this in a message-based Model-View-Controller (M-MVC) architecture and implement it with a powerful publish-subscribe messaging infrastructure. A Web Services oriented architecture with services loosely coupled by the exchange of messages is becoming an increasingly important feature in the deployment of Internet applications. The broad applicability of this approach includes enterprise software, e-Learning, e-Science and e-Business. Our work provides a general framework for integrating Desktop and Web Service applications. We summarize the performance results from detailed tests of …

Go to article

An Efficient Scheme For Aggregation And Presentation Of Network Performance, Gurhan Gunduz, Shrideep Pallickara, Geoffrey C. Fox Jan 2004

An Efficient Scheme For Aggregation And Presentation Of Network Performance, Gurhan Gunduz, Shrideep Pallickara, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

The Internet is presently being used to support increasingly complex interaction models as a result of more and more applications, services and frameworks becoming network centric. Efficient utilization of network and networked resources is of paramount importance. Network performance gathering is a precursor to any scheme that seeks to provide adaptive routing capabilities for interactions. In this paper we present a network performance aggregation framework that is extensible and appropriate for distributed messaging systems that span multiple realms, disparate communication protocols and support different applications.

Go to article

A Distributed Quadtree Dictionary Approach To Multi-Resolution Visualization Of Scattered Neutron Data, Rion Dooley Jan 2004

A Distributed Quadtree Dictionary Approach To Multi-Resolution Visualization Of Scattered Neutron Data, Rion Dooley

LSU Doctoral Dissertations

Grid computing is described as dependable, seamless, pervasive access to resources and services, whereas mobile computing allows the movement of people from place to place while staying connected to resources at each location. Mobile grid computing is a new computing paradigm, which joins these two technologies by enabling access to the collection of resources within a user's virtual organization while still maintaining the freedom of mobile computing through a service paradigm. A major problem in virtual organization is needs mismatch, in which one resources requests a service from another resources it is unable to fulfill, since virtual organizations are necessarily …

Go to article

The Integration Of Connectionism And First-Order Knowledge Representation And Reasoning As A Challenge For Artificial Intelligence, Sebastian Bader, Steffen Holldobler, Pascal Hitzler Jan 2004

The Integration Of Connectionism And First-Order Knowledge Representation And Reasoning As A Challenge For Artificial Intelligence, Sebastian Bader, Steffen Holldobler, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Intelligent systems based on first-order logic on the one hand, and on artificial neural networks (also called connectionist systems) on the other, differ substantially. It would be very desirable to combine the robust neural networking machinery with symbolic knowledge representation and reasoning paradigms like logic programming in such a way that the strengths of either paradigm will be retained. Current state-of-the-art research, however, fails by far to achieve this ultimate goal. As one of the main obstacles to be overcome we perceive the question how symbolic knowledge can be encoded by means of connectionist systems: Satisfactory answers to this will …

Go to article

Service Oriented Architectures And Semantic Web Processes, Francisco Cubera, Kunal Verma, Amit P. Sheth Jan 2004

Service Oriented Architectures And Semantic Web Processes, Francisco Cubera, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Visualization: Interfaces For Exploring And Exploiting Ontology, Knowledgebase, Heterogeneous Content And Complex Relationships, Amit P. Sheth, David Avant Jan 2004

Semantic Visualization: Interfaces For Exploring And Exploiting Ontology, Knowledgebase, Heterogeneous Content And Complex Relationships, Amit P. Sheth, David Avant

Kno.e.sis Publications

Technology platforms and products for ontology-driven process of semantic applications that serve both Enterprise wide and pan-Web needs are both available and being deployed. Similar to the development of enterprise software applications, the creation of an ontology driven semantic application can be described as a set of distinct phases that compose a lifecycle. From conception to deployment, these phases involve human interaction with a broad variety of information, identified as heterogeneous data, metadata, knowledge and ontology. Based on experience spanning academic research at the LSDIS lab through deployed commercial semantic applications based on Semagix Freedom, this paper provides examples of …

Go to article

Semantic Web Research Center Report: Lsdis Lab, Research In Semantic Bioinformatics, Semantic Analytics And Semantic Web Processes, Amit P. Sheth Jan 2004

Semantic Web Research Center Report: Lsdis Lab, Research In Semantic Bioinformatics, Semantic Analytics And Semantic Web Processes, Amit P. Sheth

Kno.e.sis Publications

The LSDIS Lab advances the field of distributed information systems by researching semantic techniques for exploiting heterogeneous multimedia information and improving processes, encompassing the central promise of the Semantic Web initiative. It is pursuing cutting edge research in ontology development for demanding scientific domains, semantic heterogeneity and integration, complex relationships discovery and semantic analytics, and Semantic Web services and processes. Past work of the LSDIS lab can be characterized by keywords: semantic interoperability, syntactic and semantic metadata for text and digital media, metadata based integration of Web content, ontology-driven information systems, multi-ontology query processing, transactional workflows and workflow management. Significant …

Go to article

Active Set Support Vector Regression, David R. Musicant, Alexander Feinberg Jan 2004

Active Set Support Vector Regression, David R. Musicant, Alexander Feinberg

Computer Science Faculty Work

We present ASVR, a new active set strategy to solve a straightforward reformulation of the standard support vector regression problem. This new algorithm is based on the successful ASVM algorithm for classification problems, and consists of solving a finite number of linear equations with a typically large dimensionality equal to the number of points to be approximated. However, by making use of the Sherman-Morrison-Woodbury formula, a much smaller matrix of the order of the original input space is inverted at each step. The algorithm requires no specialized quadratic or linear programming code, but merely a linear equation solver which is …

Go to article

Camera System Support For Highway Transportation Using Mobile Devices, Le Minh Jan 2004

Camera System Support For Highway Transportation Using Mobile Devices, Le Minh

Electronic Theses and Dissertations

With the very fast growing technology in wireless, advancement in hardware and the dramatically falling cost of mobile computing devices such as PDA, handheld device, People nowadays can have a personal device that fits in their hand but has computing power as a desktop did few years ago. The same device now is able to communicate over a wireless network and view office document at the same time. The combination of size, power and flexibility makes the personal devices increasingly appear in many aspects of life. In this proposal, we focus on a simple yet useful application of mobile devices …

Go to article

Partitioning A Graph In Alliances And Its Application To Data Clustering, Khurram Hassan-Shafique Jan 2004

Partitioning A Graph In Alliances And Its Application To Data Clustering, Khurram Hassan-Shafique

Electronic Theses and Dissertations

Any reasonably large group of individuals, families, states, and parties exhibits the phenomenon of subgroup formations within the group such that the members of each group have a strong connection or bonding between each other. The reasons of the formation of these subgroups that we call alliances differ in different situations, such as, kinship and friendship (in the case of individuals), common economic interests (for both individuals and states), common political interests, and geographical proximity. This structure of alliances is not only prevalent in social networks, but it is also an important characteristic of similarity networks of natural and unnatural …

Go to article

A Limited-Global Fault Information Model For Dynamic Routing In N-D Meshes, Zhen Jiang, Jie Wu Jan 2004

A Limited-Global Fault Information Model For Dynamic Routing In N-D Meshes, Zhen Jiang, Jie Wu

Computer Science Faculty Publications

No abstract provided.

Go to article

On Constructing The Minimum Orthogonal Convex Polygon In 2-D Faulty Meshes, Jie Wu, Zhen Jiang Jan 2004

On Constructing The Minimum Orthogonal Convex Polygon In 2-D Faulty Meshes, Jie Wu, Zhen Jiang

Computer Science Faculty Publications

No abstract provided.

Go to article

Extended Minimal Routing In 2-D Meshes With Faulty Blocks, Jie Wu, Zhen Jiang Jan 2004

Extended Minimal Routing In 2-D Meshes With Faulty Blocks, Jie Wu, Zhen Jiang

Computer Science Faculty Publications

No abstract provided.

Go to article

Adaptive Critic Neural Network-Based Object Grasping Control Using A Three-Finger Gripper, Gustavo Galan, Jagannathan Sarangapani Jan 2004

Adaptive Critic Neural Network-Based Object Grasping Control Using A Three-Finger Gripper, Gustavo Galan, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Grasping of objects has been a challenging task for robots. The complex grasping task can be defined as object contact control and manipulation subtasks. In this paper, object contact control subtask is defined as the ability to follow a trajectory accurately by the fingers of a gripper. The object manipulation subtask is defined in terms of maintaining a predefined applied force by the fingers on the object. A sophisticated controller is necessary since the process of grasping an object without a priori knowledge of the object's size, texture, softness, gripper, and contact dynamics is rather difficult. Moreover, the object has …

Go to article

A Programming Environment For Static And Dynamic Distributed Systems., Seyed H. Roosta Jan 2004

A Programming Environment For Static And Dynamic Distributed Systems., Seyed H. Roosta

Journal of the South Carolina Academy of Science

No abstract provided.

Go to article

Adaptive Force-Balancing Control Of Mems Gyroscope With Actuator Limits, Mohammed Hameed, Jagannathan Sarangapani Jan 2004

Adaptive Force-Balancing Control Of Mems Gyroscope With Actuator Limits, Mohammed Hameed, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

This work presents an adaptive force-balancing control (AFBC) scheme with actuator limits for a MEMS Z-axis gyroscope. The purpose of the adaptive force-balancing control is to identify major fabrication imperfections so that they are properly compensated unlike the case of conventional force-balancing controlled gyroscope. The proposed AFBC scheme controls the vibratory modes of the proof mass while ensuring that the control input satisfies the magnitude constraints and the performance of the gyroscope is enhanced in the presence of fabrication uncertainties. Consequently, commonly reported problems of MEMS gyroscope such as quadrature compensation, drive and sense axes frequency tuning are not needed …

Go to article

Decentralized Neural Network Control Of A Class Of Large-Scale Systems With Unknown Interconnection, Wenxin Liu, Jagannathan Sarangapani, Donald C. Wunsch, Mariesa Crow Jan 2004

Decentralized Neural Network Control Of A Class Of Large-Scale Systems With Unknown Interconnection, Wenxin Liu, Jagannathan Sarangapani, Donald C. Wunsch, Mariesa Crow

Electrical and Computer Engineering Faculty Research & Creative Works

A novel decentralized neural network (DNN) controller is proposed for a class of large-scale nonlinear systems with unknown interconnections. The objective is to design a DNN for a class of large-scale systems which do not satisfy the matching condition requirement. The NNs are used to approximate the unknown subsystem dynamics and the interconnections. The DNN is designed using the back stepping methodology with only local signals for feedback. All of the signals in the closed loop (system states and weights estimation errors) are guaranteed to be uniformly ultimately bounded and eventually converge to a compact set.

Go to article

Discrete-Time Neural Network Output Feedback Control Of Nonlinear Systems In Non-Strict Feedback Form, Pingan He, Jagannathan Sarangapani Jan 2004

Discrete-Time Neural Network Output Feedback Control Of Nonlinear Systems In Non-Strict Feedback Form, Pingan He, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

An adaptive neural network (NN)-based output feedback controller is proposed to deliver a desired tracking performance for a class of discrete-time nonlinear systems, which is represented in non-strict feedback form. The NN backstepping approach is utilized to design the adaptive output feedback controller consisting of: 1) a NN observer to estimate the system states with the input-output data, and 2) two NNs to generate the virtual and actual control inputs, respectively. The non-causal problem in the discrete-time backstepping design is avoided by using the universal NN approximator. The persistence excitation (PE) condition is relaxed both in the NN observer and …

Go to article

Neural Network Controller For Manipulation Of Micro-Scale Objects, Vijayakumar Janardhan, Pingan He, Jagannathan Sarangapani Jan 2004

Neural Network Controller For Manipulation Of Micro-Scale Objects, Vijayakumar Janardhan, Pingan He, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

A novel reinforcement learning-based neural network (RLNN) controller is presented for the manipulation and handling of micro-scale objects in a microelectromechanical system (MEMS). In MEMS, adhesive, surface tension, friction and van der Waals forces are dominant. Moreover, these forces are typically unknown. The RLNN controller consists of an action NN for compensating the unkoown system dynamics, and a critic NN to tune the weights of the action NN. Using the Lyapunov approach, the uniformly ultimate houndedness (UUB) of the closed-loop tracking error and weight estimates are shown by using a novel weight updates. Simulation results are presented to substantiate the …

Go to article

Cs 302-01: Client Server Databases, Karen Meyer Jan 2004

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor Jan 2004

Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/316/516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.

Go to article

Automatic Compilation Of Protocol Insecurity Problems Into Logic Programming, Alessandro Armondo, Luca Compagna, Yuliya Lierler Jan 2004

Automatic Compilation Of Protocol Insecurity Problems Into Logic Programming, Alessandro Armondo, Luca Compagna, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

In this paper we show how protocol insecurity problems expressed in a multi-set rewriting formalism can be automatically translated into logic programming problems. The proposed translation paves the way to the construction of model-checkers for security protocols based on state-of-the-art solvers for logic programs. We have assessed the effectiveness of the approach by running the proposed reduction against a selection of insecurity problems drawn from the Clark & Jacob library of security protocols: by running state-of-the-art solvers against the resulting logic programming problems most of the (known) attacks on the considered protocols are found in a few seconds.

Go to article

Sat-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea Jan 2004

Sat-Based Answer Set Programming, Enrico Giunchiglia, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems. In this paper we present a SAT-based decision procedure for …

Go to article

When Are Behaviour Networks Well-Behaved?, Bernhard Nebel, Yuliya Lierler Jan 2004

When Are Behaviour Networks Well-Behaved?, Bernhard Nebel, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. This problem is addressed by a number of action-selection mechanisms. Behaviour networks as proposed by Maes are one such mechanism, which is quite popular. In general, it seems not possible to predict when behaviour networks are well-behaved. However, they perform quite well in the robotic soccer context. In this paper, we analyse the reason for this success by identifying conditions that make behaviour networks goal converging, i.e., force them to reach the goals …

Go to article

Cmodels-2: Sat-Based Answer Set Solver Enhanced To Non-Tight Programs, Yuliya Lierler, Marco Maratea Jan 2004

Cmodels-2: Sat-Based Answer Set Solver Enhanced To Non-Tight Programs, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

Answer set programming is a new programming paradigm proposed in [1] and [2], and based on the answer set semantics of Prolog [3]. It is well known that an answer set for a logic program is also a model of the program’s completion [4]. The converse is true when the logic program is “tight” [6, 5]. Lin and Zhao [7] showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called “loop formulas”. Nevertheless, their solver ASSAT1 has some disadvantages: it can work …

Go to article

A New Backoff Algorithm For The Ieee 802.11 Distributed Coordination Function, Jing Deng, Pramod K. Varshney, Zygmunt J. Haas Jan 2004

A New Backoff Algorithm For The Ieee 802.11 Distributed Coordination Function, Jing Deng, Pramod K. Varshney, Zygmunt J. Haas

Electrical Engineering and Computer Science - All Scholarship

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW ). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme, as shown in some studies in the literature, suffers from a fairness problem and low throughput under high traffic load. In this paper, we propose a new backoff algorithm, termed the Linear/Multiplicative Increase and Linear Decrease (LMILD) backoff algorithm, for use with the IEEE 802.11 Distributed Coordination Function. …

Go to article

Sinbad Automation Of Scientific Process: From Hidden Factor Analysis To Theory Synthesis, Olcay Kursun Jan 2004

Sinbad Automation Of Scientific Process: From Hidden Factor Analysis To Theory Synthesis, Olcay Kursun

Electronic Theses and Dissertations

Modern science is turning to progressively more complex and data-rich subjects, which challenges the existing methods of data analysis and interpretation. Consequently, there is a pressing need for development of ever more powerful methods of extracting order from complex data and for automation of all steps of the scientific process. Virtual Scientist is a set of computational procedures that automate the method of inductive inference to derive a theory from observational data dominated by nonlinear regularities. The procedures utilize SINBAD – a novel computational method of nonlinear factor analysis that is based on the principle of maximization of mutual information …

Go to article

First Prev Next Last