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 24421 - 24450 of 27802

Full-Text Articles in Entire DC Network

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 …


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.


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.


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 …


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 …


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 …


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. …


The Proteomics Approach To Evolutionary Computation: An Analysis Of Pr, Ivan Garibay Jan 2004

The Proteomics Approach To Evolutionary Computation: An Analysis Of Pr, Ivan Garibay

Electronic Theses and Dissertations

As the complexity of our society and computational resources increases, so does the complexity of the problems that we approach using evolutionary search techniques. There are recent approaches to deal with the problem of scaling evolutionary methods to cope with highly complex difficult problems. Many of these approaches are biologically inspired and share an underlying principle: a problem representation based on basic representational building blocks that interact and self-organize into complex functions or designs. The observation from the central dogma of molecular biology that proteins are the basic building blocks of life and the recent advances in proteomics on analysis …


High Performance Data Mining Techniques For Intrusion Detection, Muazzam Ahmed Siddiqui Jan 2004

High Performance Data Mining Techniques For Intrusion Detection, Muazzam Ahmed Siddiqui

Electronic Theses and Dissertations

The rapid growth of computers transformed the way in which information and data was stored. With this new paradigm of data access, comes the threat of this information being exposed to unauthorized and unintended users. Many systems have been developed which scrutinize the data for a deviation from the normal behavior of a user or system, or search for a known signature within the data. These systems are termed as Intrusion Detection Systems (IDS). These systems employ different techniques varying from statistical methods to machine learning algorithms. Intrusion detection systems use audit data generated by operating systems, application softwares or …


Dynamic Shared State Maintenance In Distributed Virtual Environments, Felix George Hamza-Lup Jan 2004

Dynamic Shared State Maintenance In Distributed Virtual Environments, Felix George Hamza-Lup

Electronic Theses and Dissertations

Advances in computer networks and rendering systems facilitate the creation of distributed collaborative environments in which the distribution of information at remote locations allows efficient communication. Particularly challenging are distributed interactive Virtual Environments (VE) that allow knowledge sharing through 3D information. In a distributed interactive VE the dynamic shared state represents the changing information that multiple machines must maintain about the shared virtual components. One of the challenges in such environments is maintaining a consistent view of the dynamic shared state in the presence of inevitable network latency and jitter. A consistent view of the shared scene will significantly increase …


Depth From Defocused Motion, Zarina Myles Jan 2004

Depth From Defocused Motion, Zarina Myles

Electronic Theses and Dissertations

Motion in depth and/or zooming causes defocus blur. This work presents a solution to the problem of using defocus blur and optical flow information to compute depth at points that defocus when they move. We first formulate a novel algorithm which recovers defocus blur and affine parameters simultaneously. Next we formulate a novel relationship (the blur-depth relationship) between defocus blur, relative object depth and three parameters based on camera motion and intrinsic camera parameters. We can handle the situation where a single image has points which have defocused, got sharper or are focally unperturbed. Moreover, our formulation is valid regardless …


Directory-Based Cache Coherence In Smtp Machines Without Memory Overhead Using Sparse Directories, Anton Kiriwas Jan 2004

Directory-Based Cache Coherence In Smtp Machines Without Memory Overhead Using Sparse Directories, Anton Kiriwas

HIM 1990-2015

As computing power has increased over the past few decades, science and engineering have found more and more uses for this new found computing power. With the advent of multiprocessor machines, we are achieving MIPS and FLOPS ratings previously unthought-of. Distributed shared-memory machines (DSM) are quickly becoming a powerful tool for computing, and the ability to build them from commodity off-the-shelf parts would be a great benefit to computing in general. In the paper entitled, "SMTp: An Architecture for Next-generation Scalable Multi-threading", Heinrich, et al. presents an architecture for a scalable DSM built from slightly modified machines capable of simultaneous …


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 …


[Introduction To] Data Structures With Java, John R. Hubbard, Anita Huray Jan 2004

[Introduction To] Data Structures With Java, John R. Hubbard, Anita Huray

Bookshelf

For a freshman/sophomore-level course in Data Structures in Computer Science. This text teaches the use of direct source code implementations and the use of the Java libraries; it helps students prepare for later work on larger Java software solutions by adhering to software engineering principles and techniques such as the UML and the Java Collections Framework (JCF). Using the spiral approach to cover such topics as linked structures, recursion, and algorithm analysis, this text also provides revealing illustrations, summaries, review questions, and specialized reference sections.


Imagining The Performance Zone: Overcoming Ambiguity In Consumer Based Electronic Performance Support Systems, Jason Simons Jan 2004

Imagining The Performance Zone: Overcoming Ambiguity In Consumer Based Electronic Performance Support Systems, Jason Simons

Theses : Honours

The locus of performance support implementation was once the domain of large corporations where its principles offered an attractive alternative to traditional methods of training within the scope of contemporary business practices. Due to economies of scale the large corporations were able to build effective performance support through the precise identification of the PERFORMANCE ZONE. This zone is created through the defining of the three attributes of performance, 1) the nature of the worker, 2) the nature of the task, and 3) the type and amount of support needed. lncreasingly the principles of performance-centred design have been adopted within diverse …


An Overview Of Reconstructability Analysis, Martin Zwick Jan 2004

An Overview Of Reconstructability Analysis, Martin Zwick

Complex Systems Faculty Publications and Presentations

This paper is an overview of reconstructability analysis (RA), a discrete multivariate modeling methodology developed in the systems literature; an earlier version of this tutorial is Zwick (2001). RA was derived from Ashby (1964), and was developed by Broekstra, Cavallo, Cellier Conant, Jones, Klir, Krippendorff, and others (Klir, 1986, 1996). RA resembles and partially overlaps log‐line (LL) statistical methods used in the social sciences (Bishop et al., 1978; Knoke and Burke, 1980). RA also resembles and overlaps methods used in logic design and machine learning (LDL) in electrical and computer engineering (e.g. Perkowski et al., 1997). Applications of RA, like …


Biup3: Boundary Topological Invariant Of 3d Objects Through Front Propagation At A Constant Speed, Xiaoqing Frank Liu Jan 2004

Biup3: Boundary Topological Invariant Of 3d Objects Through Front Propagation At A Constant Speed, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Topological features constitute the highest abstraction in object representation. Euler characteristic is one of the most widely used topological invariants. The computation of the Euler characteristic is mainly based on three well-known mathematical formulae, which calculate either on the boundary of object or on the whole object. However, as digital objects are often non-manifolds, none of the known formulae can correctly compute the genus of digital surfaces. In this paper, we show that a new topological surface invariant of 3D digital objects, called BIUP/sup 3/, can be obtained through a special homeomorphic transform: front propagation at a constant speed. BIUP/sup …


A Generic Oo Architecture Language For Semantics Analysis Of Oo Specification, Xiaoqing Frank Liu Jan 2004

A Generic Oo Architecture Language For Semantics Analysis Of Oo Specification, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Formal specification enables a rigorous analysis and model checking for ensuring the correctness of specification. Formal OO specification methods are of mathematical nature and the semantics of specification is purposely defined such that it is not related to the semantics of code. We propose a new language, which will lay a common semantics ground for both specification and code.


A Scalable Approach For Reliable Downstream Data Delivery In Wireless Sensor Networks, Seung Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar, Ian F. Akyildiz Jan 2004

A Scalable Approach For Reliable Downstream Data Delivery In Wireless Sensor Networks, Seung Jong Park, Ramanuja Vedantham, Raghupathy Sivakumar, Ian F. Akyildiz

Computer Science Faculty Research & Creative Works

There exist several applications of sensor networks where reliability of data delivery can be critical. While the redundancy inherent in a sensor network might increase the degree of reliability, it by no means can provide any guaranteed reliability semantics. In this paper, we consider the problem of reliable sink-to-sensors data delivery. We first identify several fundamental challenges that need to be addressed and are unique to a wireless sensor network environment. We then propose a scalable framework for reliable down-stream data delivery that is specifically designed to both address and leverage the characteristics of a wireless sensor network, while achieving …


A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick Jan 2004

A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified reconstructability analysis (MRA), a novel decomposition technique within the framework of set‐theoretic (crisp possibilistic) reconstructability analysis, is applied to three‐variable NPN‐classified Boolean functions. MRA is superior to conventional reconstructability analysis, i.e. it decomposes more NPN functions. MRA is compared to Ashenhurst‐Curtis (AC) decomposition using two different complexity measures: log‐functionality, a measure suitable for machine learning, and the count of the total number of two‐input gates, a measure suitable for circuit design. MRA is superior to AC using the first of these measures, and is comparable to, but different from AC, using the second.


Using Design Of Experiments, Sensitivity Analysis, And Hybrid Simulation To Evaluate Changes To A Software Development Process: A Case Study, Wayne Wakeland, Robert H. Martin, David Raffo Jan 2004

Using Design Of Experiments, Sensitivity Analysis, And Hybrid Simulation To Evaluate Changes To A Software Development Process: A Case Study, Wayne Wakeland, Robert H. Martin, David Raffo

Complex Systems Faculty Publications and Presentations

Hybrid simulation models combine the high-level project issues of System Dynamics models along with the detailed process representation of discrete event simulation models. Hybrid models not only capture the best of both of these simulation paradigms, but they also are able to address new issues that are important in managing complex real-world development projects that neither the System Dynamics nor Discrete Event simulation paradigms are able to address alone.

In order to reap the full benefits from a simulation model, a structured approach for analyzing model results is necessary. The recommended approach is a combination of the Design of Experiments …


Software Architecture: Styles And Representational Schemes, Somo Subro Banerjee Jan 2004

Software Architecture: Styles And Representational Schemes, Somo Subro Banerjee

LSU Master's Theses

Software architecture is being widely used today to describe a very high-level design methodology of large software systems. Software architecture represents the overall structure of a system in an abstract, structured manner. A good architectural representation scheme holds the key to the effectiveness of a software architecture description and usage. In this work we look at architectural styles and architectural representation schemes. We propound the idea that the layered architectural model is a suitable candidate for a generalized architectural style and that it can cater to many different problem domains, other than the message-passing systems it has traditionally been used …


Np-Hardness Of Cache Mapping, Zhiyuan Li, Rong Xu Jan 2004

Np-Hardness Of Cache Mapping, Zhiyuan Li, Rong Xu

Department of Computer Science Technical Reports

No abstract provided.


Q-Pod: Deployable And Scalable End System Support For Enabling Qos In Legacy Enterprise Systems, Asad Khan Awan, Kihong Park Jan 2004

Q-Pod: Deployable And Scalable End System Support For Enabling Qos In Legacy Enterprise Systems, Asad Khan Awan, Kihong Park

Department of Computer Science Technical Reports

No abstract provided.


Fast Algorithms For Fragment Based Completion In Images Of Natural Scenes, Siddharth Rajkumar Borikar Jan 2004

Fast Algorithms For Fragment Based Completion In Images Of Natural Scenes, Siddharth Rajkumar Borikar

Electronic Theses and Dissertations

Textures are used widely in computer graphics to represent fine visual details and produce realistic looking images. Often it is necessary to remove some foreground object from the scene. Removal of the portion creates one or more holes in the texture image. These holes need to be filled to complete the image. Various methods like clone brush strokes and compositing processes are used to carry out this completion. User skill is required in such methods. Texture synthesis can also be used to complete regions where the texture is stationary or structured. Reconstructing methods can be used to fill in large-scale …


Investigation Of Implementation Techniques For Backpropagation Neural Networks, John Culloty Jan 2004

Investigation Of Implementation Techniques For Backpropagation Neural Networks, John Culloty

Theses

Artificial neural networks are biologically inspired computational methods that have the ability to approximate discrete, real and vector valued target functions. For some problem domains this ability makes neural networks a more appealing solution than traditional computational techniques. Such problem domains typically contain a large number of parameters that are interrelated in a complex and often unknown manner. This makes rule based solutions all but impossible. However another feature of such problem domains is the presence of large volumes of real world data that can be used to tram a neural network until it learns the solution.

One of the …


A Toolkit For Xml-Based And Process-Oriented Application Integration, Volker Münch Jan 2004

A Toolkit For Xml-Based And Process-Oriented Application Integration, Volker Münch

Theses

Systems integration is hard work; different architectures with different interfaces and an innumerable amount of Legacy applications with non-standard interfaces exist. However the needs to meet changing business requirements and to implement faster and optimised procedures within an enterprise and in cooperation with other external enterprises mean that there is a continuing demand for such integration strategies and products. Integration was often an activity separate from system development and could not be accomplished without re-involving system designers and developers. Such a process is therefore inefficient and costly. This thesis proposes a process-oriented integration strategy that combines the tasks of integration …


Cross-Modal Interface Design In Crisis Control Systems: The Role Of Gender, Pamela B. Sheppard Jan 2004

Cross-Modal Interface Design In Crisis Control Systems: The Role Of Gender, Pamela B. Sheppard

UNF Graduate Theses and Dissertations

Leading human-computer interaction (HCI) researchers recognize a fundamental difference exists between men and women. Some HCI research has been done regarding gender differences in hand-eye coordination for interactions with computer touch display interfaces, navigation through virtual environments (VE) and language in computer-mediated communication. In these previous studies, gender differences were found in the use of words and language in computer-mediated communication and in navigation strategies for VE but no gender-related differences were found for the hand-eye coordination needed to effectively use a touch display.

The current study used a cross-modal (auditory-visual), dual-task, computer interface to examine gender differences in crisis …


Priority Assessment Of Software Requirements From Multiple Perspectives, Xiaoqing Frank Liu, Chandra Sekhar Veera, Yan Sun, Kunio Noguchi, Yuji Kyoya Jan 2004

Priority Assessment Of Software Requirements From Multiple Perspectives, Xiaoqing Frank Liu, Chandra Sekhar Veera, Yan Sun, Kunio Noguchi, Yuji Kyoya

Computer Science Faculty Research & Creative Works

The development of complex software systems involves collecting software requirements from various stakeholders. Often stakeholder perceptions conflict during the requirements elicitation phase. An effective technique to resolve such a conflict is needed. We presented a framework that prioritizes software requirements gathered from multiple stakeholders by incorporating inter-perspective relationships, which is not addressed by existing priority assessment techniques. We use a relationship matrix to analyze the impact between requirements and facilitate the integration process which assesses their priorities based on their relationships from multiple perspectives. It allows the development team to resolve conflicts effectively and concentrate their valuable time and resources …


A Change Impact Dependency Measure For Predicting The Maintainability Of Source Code, Xiaoqing Frank Liu Jan 2004

A Change Impact Dependency Measure For Predicting The Maintainability Of Source Code, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

We first articulate the theoretic difficulties with the existing metrics designed for predicting software maintainability. To overcome the difficulties, we propose to measure a purely internal and objective attribute of code, namely change impact dependency, and show how it can be modeled to predict real change impact. The proposed base measure can be further elaborated for evaluating software maintainability.