Digital Commons Network^™

How Proteins Fold, Flex, And Bind Other Molecules, Leslie A. Kuhn, Volker Schnecke, Michael L. Raymer, Paul C. Sanschagrin

Kno.e.sis Publications

No abstract provided.

Shout With The Largest Mob : Toward A Model For Primitive Communication In Mobile Automata, Rebecca A. Weber

Honors Theses

We consider the problem of simulating communication between independent, autonomous agents, or machines, using only local rules with no global control over the agents' behavior. First, we construct an algorithm by which the machines will avoid collisions with each other and with boundaries or obstacles. Noting that collision avoidance alone will not result in higher-level behavior, and with the goal of creating agents which would self-organize, we begin to develop a signalling system by which agents can communicate. This leads to a new method for modeling agent motion in the plane. Throughout, we are motivated by possible linkages between our …

Proceedings Of The 1999 Onr Decision-Support Workshop Series: A Decision-Making Tools Workshop, Collaborative Agent Design Research Center

Collaborative Agent Design (CAD) Research Center

The rationale of the Workshop rests on some very simple observations. It is well known that every situation encountered by individuals and organizations demands an appropriate response. The choice of such a response from among a multitude of options is the decision-making process. Simple situations that give rise to a small number of options allow the decision maker to decide on a course of action without great effort. This state of affairs changes dramatically when the situations are complex and involve a large number of factors. In this case, an extensive field of options is engendered that makes it impossible …

Collaborative Decision-Support And The Human-Machine Relationship, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

Human beings are inquisitive creatures who seek explanations for all that they observe and experience in their living environment. While this quest for understanding is central to our success in adapting to a changing environment, it is also a major cause of our willingness to accept partial understandings and superficial explanations when the degree of complexity of the problem situation confounds our current cognitive capabilities. In other words, a superficial or partial explanation is considered better than no explanation at all. As flawed as this approach may be, it has helped us to solve difficult problems in stages. By first …

An Examination Of Codewords With Optimal Merit Factor, Michael W. Cammarano, Anthony G. Kirilusha

Department of Math & Statistics Technical Report Series

We examine the codewords with best possible merit factor (minimum sum of squares of periodic autocorrelations) for a variety of lengths. Many different approaches were tried in an attempt to find construction methods for such codewords, or for codewords with good but non-optimal merit factors.

An Interview With David Brin, Switch Staffs

SWITCH

This is an interview with David Brin, a science fiction author, and the Switch staff. They discuss some topics of Brin’s book, "The Transparent Society". The main hypothesis of this book is reciprocal surveillance for accountability and decentralization of power. Brin discusses his thoughts on privacy, such as real privacy, illusory privacy, and a third kind of privacy. He goes on to connect surveillance with power and the government. He continues with how people react to the advances of technology and how they learn from past generations.

An Interview With Sadie Plant, Switch Staffs

SWITCH

The interview is conducted with Sadie Plant in a variety of subjects. Plant discusses the topic of centralized and distributed organizational structures. Practical implementation of organizations will tend to have elements of both centralized and distributed structures. Additionally, it is beneficial to mainstream organizations to incorporate or recuperate activist or grassroots distributed elements in order to bring in new energies, thoughts, and ideas. The discussion then shifts to drugs and information control. Plant argues that drugs and information have similar characteristics in that both have the ability to change perception and thoughts. The tools that governments use to control and …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 15, Number 4, April 1999, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Evaluation Of Real-Time Fiber Communications For Parallel Collective Operations, Amy Apon, Parvathi Rajagopal

Publications

Real-Time Fiber Communications (RTFC) is a gigabit speed network that has been designed for damage tolerant local area networks. In addition to its damage tolerant characteristics, it has several features that make it attractive as a possible interconnection technology for parallel applications in a cluster of workstations. These characteristics include support for broadcast and multicast messaging, memory cache in the network interface card, and support for very fine grain writes to the network cache. Broadcast data is captured in network cache of all workstations in the network providing a distributed shared memory capability. In this paper, RTFC is introduced. The …

The Rate-Based Execution Model, Kevin Jeffay, Steve Goddard

School of Computing: Technical Reports

We present a new task model for the real-time execution of event-driven tasks in which no a priori characterization of the actual arrival rates of events is known; only the expected arrival rates of events is known. We call this new task model rate-based execution (RBE), and it is a generalization of the common sporadic task model. The RBE model is motivated naturally by distributed multimedia and digital signal processing applications.
We identify necessary and sufficient conditions for determining the feasibility of an RBE task set, and an optimal scheduling algorithm (based on preemptive earliest-deadline-first (EDF) scheduling) for scheduling the …

A Systolic Algorithm To Process Compressed Binary Images, Fikret Erçal, Mark Allen, Hao Feng

Computer Science Faculty Research & Creative Works

A new systolic algorithm which computes image differences in run-length encoded (RLE) format is described. The binary image difference operation is commonly used in many image processing applications including automated inspection systems, character recognition, fingerprint analysis, and motion detection. The efficiency of these operations can be improved significantly with the availability of a fast systolic system that computes the image difference as described in this paper It is shown that for images with a high similarity measure, the time complexity of the systolic algorithm is small and in some cases constant with respect to the image size. The time for …

A Systematic Integration Of Register Allocation And Instruction Scheduling, Yukong Zhang

Doctoral Dissertations

In order to achieve high performance, processor architecture has become more and more complicated. As a result, compiler-time optimizations have become more and more important for the effective use of a complex processor. One of the promising compiler-time optimizations is the integration of register allocation and instruction scheduling based on register-reuse chains. In the previous approach, however, the generation of register-reuse chains was not completely systematic and consequently created many unnecessary dependencies that restrict instruction scheduling.

This research proposes a new register allocation technique based on a systematic generation of register-reuse chains. The first phase of the proposed technique is …

Graphical Display And Data Structure For Virtual Prototyping, David William Manry

Doctoral Dissertations

One of the goals of engineering firms is to bring better products to market faster. Although concurrent engineering can aid in this endeavor, it requires that all areas of an organization work simultaneously. Thus, current product data must be accessible to everyone.

Virtual prototyping allows this simultaneous exchange of information. Virtual prototyping not only replaces the physical model in product development with a virtual model, but also it goes further by allowing data associated with each part of the model to be accessed. This data is not limited to just geometric properties but could contain other quantifiable properties, such as …

Efficiency Of Distributed Priority Queues In Parallel Adaptive Integration, Rodger Zanny

Masters Theses

The adaptive integration algorithm is· effective in numerically solving integration problems. It is able to focus the application of integration rules on the portion of the integration region where the integrand is the least well-behaved. Parallel implementations must use dynamic load balancing or performance suffers.

Dynamic local load-balancing techniques allow each processor to maintain its own pool of work in a local priority queue and balance the workload based on local criteria. However, the use of locally controlled priority queues is known to be inefficient (in terms of the number of integration rule applications needed to reach an answer) as …

The Dynamics Of Cyberspace: Examining And Modelling Online Social Structure, Brian S. Butler '89

Doctoral Dissertations

It has been proposed that online social structures represent new forms of organizing which are fundamentally different from traditional social structures. However, while there is a growing body of empirical research that considers behavioral aspects of online activity, research on online social structure structural remains largely anecdotal. This work consists of three papers that combine previous studies of traditional social structures, empirical analysis of longitudinal data from a sample of Internet listservs, and computational modeling to examine the dynamics of social structure development in networked environments.

The first paper (Title: When is a Group not a Group: An Empirical Examination …

Information Modeling And Method Engineering: A Psychological Perspective, Keng Siau

Research Collection School Of Computing and Information Systems

Information modeling is the cornerstone of information systems analysis and design. Information models, the products of information modeling, not only provide the abstractions required to facilitate communication between the analysts and end users, but they also provide a formal basis for developing tools and techniques used in information systems development. The process of designing, constructing, and adapting information modeling methods for information systems development is known as method engineering. Despite the pivotal role of modeling methods in successful information systems development, most modeling methods are designed based on common sense and intuition of the method designers with little or no …

The Design Of Software Agents For A Network Of Pde Solvers, Panagiota Tsompanoupoulou, Ladislau Bölöni, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Automated Estimation Of Relaxation Parameters For Interface Relaxation, John R. Rice, P. Tsompanopoulou, E. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

Limit Laws For Heights In Generalized Tries And Patricia Tries, Charles Knessl, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

2d-Pattern Matching Image And Video Compression: Theory, Algorithms, And Experiments, Marc Alzina, Wojciech Szpankowski, Ananth Y. Grama

Department of Computer Science Technical Reports

No abstract provided.

How To Get A Free Lunch (At No Cost), John R. Rice, Naren Ramakrishnan

Department of Computer Science Technical Reports

No abstract provided.

Pythia-Ii: A Knowledge/Data Base System For Testing And Recommending Scientific, Elias N. Houstis, Vassilios S. Verykios, Ann C. Caitlin, Naren Ramakrishnan, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Pi-Web Join In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the Web. In this paper, we introduce the concept of Pi-web join in the context of WHOWEDA. Pi-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project …

Fiber-Optic Coupled Lidar Receiver System To Measure Stratospheric Ozone, David Brent Harper

Electrical & Computer Engineering Theses & Dissertations

A fiber-optic coupled lidar receiver system was constructed to determine ozone concentrations in the stratosphere. The system was used to make ground-based measurements of lidar returns from a UV DIAL system. A fiber-optic cable was used to couple the light from the receiver telescope to the light detector. Photon counting was implemented as the light detection technique. This technique allowed detection of 301 and 311 nm lidar returns up to 27.5 and 32.5 km respectively. A software application was developed to control the photon counting system and perform real-time data analysis of measured lidar returns. DIAL measurements of stratospheric ozone …

Greedy Approximation Algorithms For K-Medians By Randomized Rounding, Neal E. Young

Computer Science Technical Reports

We give an improved approximation algorithm for the general k-medians problem. Given any \epsilon>0, the algorithm finds a solution of total distance at most D(1+\epsilon) using at most k ln(n+n/\epsilon) medians (a.k.a. sites), provided some solution of total distance D using k medians exists. This improves over the best previous bound (w.r.t. the number of medians) by a factor of \Omega(1/\epsilon) provided 1/\epsilon=n^O(1). The algorithm is a greedy algorithm, derived using the method of oblivious randomized rounding. It requires at most k ln(n+n/\epsilon) linear-time iterations. We also derive algorithms for fractional and weighted variants of the problem.

Monitoring Distributed Processes With Intelligent Agents, Franz J. Kurfess, Klaus Holthaus, Dhaval P. Shah, Felip Miralles

Computer Science and Software Engineering

This paper describes a platform-independent application for the monitoring of distributed applications. The tool is intended for system administrators to properly distribute the components of a distributed application onto particular machines. An essential part of this tool is based on intelligent mobile agent technology used to access the target systems. Although a full implementation turned out to be infeasible due to security considerations, the implementation and experimentation indicate the suitability of intelligent agents technology for such purposes.

Load Dependent Single Chain Models Of Multichain Closed Queueing Networks, Amy Apon, Lawrence Dowdy

Publications

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 15, Number 3, March 1999, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Data Integration By Describing Sources With Constraint Databases, Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su

Kno.e.sis Publications

We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of constraint database techniques. We assume the existence of a global database schema. The contents of each data source are described using a set of constraint tuples over the global schema; each such tuple indicates possible contributions from the source. The “source description catalog” (SDC) of a global relation consists of its associated constraint tuples. Such a method of description is advantageous since it is flexible to add new sources and to modify existing …

Efficient Mining Of Partial Periodic Patterns In Time Series Database, Jiawei Han, Guozhu Dong, Yiwen Yin

Kno.e.sis Publications

Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search mainly consider finding full periodic patterns, where every point in time contributes (precisely or approximately) to the periodicity. However, partial periodicity is very common in practice since it is more likely that only some of the time episodes may exhibit periodic patterns.

We present several algorithms for efficient mining of partial periodic patterns, by exploring some interesting properties related to partial periodicity, such as the Apriori property and the max-subpattern hit set property, and by shared mining …