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 18571 - 18600 of 20622

Full-Text Articles in Entire DC Network

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

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

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

The Mutamathil Type Style: Towards Free, Technology-Friendly, Arabetic Types, Saad D. Abulhab Jan 2004

The Mutamathil Type Style: Towards Free, Technology-Friendly, Arabetic Types, Saad D. Abulhab

Publications and Research

Efforts to adapt various Arabetic scripts to the machine are as old as the field of typography. But most of these efforts concentrated primarily on forcing the machine to duplicate the Arabetic handwritten forms. Others have practically advocated divorce from the calligraphic tradition rather than enrichment and reform. One reason why the few modern attempts to typographically solve the technology-induced Arabetic script problems had failed is that many typeforms (or many times just theoretical calligraphy style) was presented as replacement for the traditional ones rather than as optional working types. New “controversial” types should be made widely available for users …

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

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

Logistics Outsourcing And 3pl Challenges, Michelle L. F. Cheong Jan 2004

Logistics Outsourcing And 3pl Challenges, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Logistics has been an important part of every economy and every business entity. The worldwide trend in globalization has led to many companies outsourcing their logistics function to Third-Party Logistics (3PL) companies, so as to focus on their core competencies. This paper attempts to broadly identify and categorize the challenges faced by 3PL companies and discover potential gaps for future research. Some of the challenges will be related with the experience and information collected from interviews with two 3PL companies.

Go to article

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.

Go to article

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 …

Go to article

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 …

Go to article

Comprehensive Evaluation Of Animated Instructional Software For Mechanics Of Materials, Timothy A. Philpot, Richard H. Hall Jan 2004

Comprehensive Evaluation Of Animated Instructional Software For Mechanics Of Materials, Timothy A. Philpot, Richard H. Hall

Civil, Architectural and Environmental Engineering Faculty Research & Creative Works

During the past three years, the Basic Engineering Department at the University of Missouri--Rolla has been developing a second-generation suite of instructional software called MecMovies for the mechanics of materials course. In the Fall 2003 semester, MecMovies was integrated into assignments throughout the entire semester for one of the six UMR mechanics of materials sections. This paper presents a comparison of student performance in the experimental section with student performance in five control sections along with discussion of student qualitative ratings and comments.

Go to article

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan Jan 2004

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan

Research Collection School Of Computing and Information Systems

This paper describes the routing problems in optical fiber networks, defines five constraints, induces and simplifies the evaluation function and fitness function, and proposes a routing approach based on the genetic algorithm, which includes an operator [OMO] to solve the QoS routing problem in optical fiber communication networks. The simulation results show that the proposed routing method by using this optimal maintain operator genetic algorithm (OMOGA) is superior to the common genetic algorithms (CGA). It not only is robust and efficient but also converges quickly and can be carried out simply, that makes it better than other complicated GA.

Go to article

Interactive Dna Sequence And Structure Design For Dna Nanotechnology And Dna Computation, Mingjun Zhang, Chaman Sabharwal, Weimin Tao, Tzyh-Jong Tarn, Ning Xi, Guangyong Li Jan 2004

Interactive Dna Sequence And Structure Design For Dna Nanotechnology And Dna Computation, Mingjun Zhang, Chaman Sabharwal, Weimin Tao, Tzyh-Jong Tarn, Ning Xi, Guangyong Li

Computer Science Faculty Research & Creative Works

DNA sequence and structure design are very important for DNA nanotechnology and DNA computation. A computer aided design tool is needed for exploring DNA sequence and structure of interests before experimental synthesis, which is a very time and labor consuming process. In this paper, an interactive DNA sequence and structure design software tool called DNA shop is proposed and implemented.

Go to article

Interactive Dna Sequence And Structure Design For Dna Nanoapplications, Mingjun Zhang, Chaman Sabharwal, Weimin Tao, Tzyh-Jong Tarn, Ning Xi, Guangyong Li Jan 2004

Interactive Dna Sequence And Structure Design For Dna Nanoapplications, Mingjun Zhang, Chaman Sabharwal, Weimin Tao, Tzyh-Jong Tarn, Ning Xi, Guangyong Li

Computer Science Faculty Research & Creative Works

DNA sequence and structure design is very important for DNA nanoapplications. A computer-aided design tool is needed for exploring DNA sequence and structure of interests before experimental synthesis, which is a time- and labor-consuming process. In this paper, an interactive DNA sequence and structure design software tool called DNA shop is proposed and implemented. The visualization tool can generate DNA structures by specifying, selecting, and moving DNA sequences around and display corresponding structures. Using the tool, DNA sequence and structure can be visually inspected in three-dimensional space before experimental studies.

Go to article

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 …

Go to article

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.

Go to article

Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau Jan 2004

Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau

Research Collection School Of Computing and Information Systems

Group Support Systems (GSSs) have emerged as a new type of information system to aid group decision-making. With the proliferation of such systems in organizations, evaluation of GSSs is becoming increasingly important. This paper reports the evaluation of an existing GSS. Our usability framework consists of nine dimensions: visual clarity, consistency, compatibility, informative feedback, explicitness, flexibility and control, error prevention and correction, ease of learning, and ease of use. We make use of the co-discovery method where teams of two participants perform tasks together while being observed. The study involves questionnaires and interview sessions. The strengths and weaknesses of the …

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

Pperfgrid: A Grid Services-Based Tool For The Exchange Of Heterogeneous Parallel Performance Data, John Jared Hoffman Jan 2004

Pperfgrid: A Grid Services-Based Tool For The Exchange Of Heterogeneous Parallel Performance Data, John Jared Hoffman

Dissertations and Theses

This thesis details the approach taken in developing PPerfGrid. Section 2 discusses other research related to this project. Section 3 provides general background on the technologies utilized in PPerfGrid, focusing on the components that make up the Grid services architecture. Section 4 provides a description of the architecture of PPerfGrid. Section 5 details the implementation of PPerfGrid. Section 6 presents tests designed to measure the overhead and scalability of the PPerfGrid application. Section 7 suggests future work, and Section 8 concludes the thesis.

Go to article

Visual Expectations: Using Machine Learning To Identify Patterns In Psychological Data, Skyler Place Jan 2004

Visual Expectations: Using Machine Learning To Identify Patterns In Psychological Data, Skyler Place

Honors Theses

The goal of this project was to utilize the tools of machine learning to evaluate the data obtained through experiments in psychology. Advanced pattern finding algorithms are an effective approach to analyzing large sets of data, from any domain of science. Consequently, we have a psychological question and hypothesis, and a separate machine learning technique to assess these claims. The realm of psychology that I focused on is visual cognition, and how an individual's knowledge affects how they see the world. This alteration of visual data is a part of perception -when the brain enhances the data coming in from …

Go to article

Guided Model Checking With A Bayesian Meta-Heuristic, Michael D. Jones, Peter Lamborn, Kevin Seppi Jan 2004

Guided Model Checking With A Bayesian Meta-Heuristic, Michael D. Jones, Peter Lamborn, Kevin Seppi

Faculty Publications

This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by applying the Empirical Bayes method to revise heuristic estimates of the distance from a given state to an error state. Guided search using the revised estimates finds errors with less search effort than the original estimates.

Go to article

First Prev Next Last