Digital Commons Network^™

Ua12/2/1 College Heights Herald, Vol. 72, No. 4, Wku Student Affairs

WKU Administration Documents

WKU campus newspaper reporting campus, athletic and Bowling Green, Kentucky news.

Regular features include:

• Just a Second
• Campus Line
• For the Record / Crime Reports
• People Poll
• Sports
• Diversions
• Movie Reviews
• Classifieds

Articles in this issue:

• Lucas, Fred. Parties Seeking Identity – U.S. Presidential Campaign
• Stamper, John. Tobacco Road – A Journey to the Harvest
• Leonard, Kim. Kristen Miller Makes Plan to Drive Party-Goers Home
• Leonard, Kim. Student Government Association Gives More Money to Campus Clubs
• Night Owls Can Now Flock to the Library
• Bradley, Ryan. Commentary Didn’t Have Facts Straight
• Esposito, Mike. Voters Offered Two Major Differences
• Howard, Jake. …

Koala: An Object-Agent Design System, Kym J. Pohl, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

This paper describes KOALA, a design system with primary focus on the predesign stage of architectural design. KOALA combines object-agent technology with high level representation to form a partnership between the human designer and the computer-based design environment. A diverse taxonomy of agents including Domain agents. Space agents, and Monitor agents work in a collaborative fashion to provide the human designer with expert evaluation and assistance in developing a design solution. Spaces, in their roles as agents attempt to formulate various design solutions based on individual perspectives through negotiation with other agents. The result is a highly interactive design environment …

Managing Multiple Information Sources Through Ontologies: Relationship Between Vocabulary Heterogeneity And Loss Of Information, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth

Kno.e.sis Publications

The ability to deal with a huge number of independent and heterogeneous repositories is the most critical problem in Global Information Systems. One approach to enable efficient query processing is by utilizing semantic descriptions (organized as ontologies) of such repositories whenever available.

In this context semantic relationships among ontologies can be used Query Processors. Three kind of relationships are considered: synonyms and hypernyms. Using synonyms the semantic of the query is preserved; however, when synonyms are not available and hypernyms or hyponyms are used there exists some loss of information that must be measured.

A New Soft Tissue Analysis : To Establish Facial Esthetic Norms In Young Adult Females, Anne Béress

Loma Linda University Electronic Theses, Dissertations & Projects

Two hundred and fifty-five articles, books, and masters theses were reviewed for the most frequently applied soft tissue measurements in the literature in order to develop a new soft tissue analysis computer program that includes established soft tissue measurements and the newly developed globe analysis. A meta analysis of 20 normal occlusion studies, was performed to obtain mean values and standard deviations to form a large sample size. Inclusion criteria for articles in the meta analysis were normal occlusion, no orthodontic treatment, pleasing faces, statement on age, race, and lip position of the population. For the lateral view, angular and …

A Scheduling Expert Advisor For The Bond Environment, Mihai G. Sirbu, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Gauss: An Automatic Algorithm Selection System For Quadrature, N. Ramakrishnan, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Laboratory Environment For Experimenting With Xinu, Douglas E. Comer, John C. Lin

Department of Computer Science Technical Reports

No abstract provided.

A Declarative Approach To Understanding Program Behavior Through Program Visualization, Aggie Yee-Chun Sun, Bruce M. Mcmillin

Computer Science Technical Reports

A method is proposed to analyze the behavior of sequential algorithms. Most current methodologies are in the form of semantic analysis, domain decomposition or fixed point approximation. These tools, though useful in design, verification and testing, are not general enough to characterize the behavior at run-time without the aid of a correct set of specifications. In addition, a thorough understanding of the program and of the mathematical notations are necessary to use these tools effectively. The methodology described in this thesis is a general purpose tool which addresses and alleviates the problem of having to be an applications expert by …

On Integrating Existing Bibliographic Databases And Structured Databases, Ying Lu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw different forms of data from them. These data include bibliographic data, text data, multimedia data, and structured data. We address the problem of integrating existing bibliographic and structured databases which reside at different locations in the network. To integrate bibliographic data and structured data, we extended the well-known SQL model to represent bibliographic related attributes and queries. In particular, we have added a new data type to model attributes in the bibliographic database. We have also designed specialized predicates …

Efficient Heuristic Search Algorithms For Soft-Decision Decoding Of Linear Block Codes, Ching-Cheng Shih, C. R. Wulff, Carlos R.P. Hartmann, Chilukuri K. Mohan

Electrical Engineering and Computer Science - Technical Reports

This paper deals with maximum-likelihood soft-decision decoding as well as suboptimal soft-decision decoding of linear block codes. In this paper we present a novel and efficient hybrid decoding algorithm for (n, k) linear block codes. This algorithm consists of three new decoding algorithms: M A*, H*, and Directed Search. It hybridizes these three algorithms to take advantage of their strengths and make the decoding more efficient. The first algorithm, M A*, is a modified Algorithm A* that conducts a heuristic search through a code tree of the transmitted code when the decoding problem is transformed into a problem of graph-search …

Exploring Knowledge Processes For Technology Assimilation, Rochelle K. Young

Engineering Management & Systems Engineering Theses & Dissertations

In the emerging knowledge society, the ability to make the experience and expertise of those involved in and affected by new technology unconditionally available to all members of an organization is becoming increasingly important. One of the problems in developing such knowledge processes for technology assimilation is that current social structures do not easily accommodate unconditional participation. Since the implementation of modern information technology is changing the workplace and the nature of work itself, alternative social structures are needed. This research takes as given that deep questions concerning knowledge processes and social transformation are in principle undecidable; and, only questions …

Scalability In Real-Time Systems, Ramesh Yerraballi

Computer Science Theses & Dissertations

The number and complexity of applications that run in real-time environments have posed demanding requirements on the part of the real-time system designer. It has now become important to accommodate the application complexity at early stages of the design cycle. Further, the stringent demands to guarantee task deadlines (particularly in a hard real-time environment, which is the assumed environment in this thesis) have motivated both practioners and researchers to look at ways to analyze systems prior to run-time. This thesis reports a new perspective to analyzing real-time systems that in addition to ascertaining the ability of a system to meet …

A Last Word On Pattern Frequency Occurences In A Markovian Sequence?, Mireille Régnier, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Performance Evaluation Of Mpi Implementations And Mpi Based Parallel Ellpack Solvers, S. Markus, S. B. Kim, K. Pantazopoulos, A. L. Ocken, Elias N. Houstis, S. Weerawarana, D. Maharry

Department of Computer Science Technical Reports

No abstract provided.

Efficient String Matching Algorithms On Reconfigurable Mesh Architectures, His-Chieh Lee, Fikret Ercal

Computer Science Technical Reports

String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines, and spelling correction. Especially with the introduction of search engines dealing with tremendous amount of textual information presented on the world wide web and the research on DNA sequencing, this problem deserves special attention and any algorithmic or hardware improvements to speed up the process will benefit these important applications.

In this paper, we present three algorithms for string matching on reconfigurable mesh architectures. Given a text T of length n and a pattern P of …

Fast Algorithms For Maze Routing On An Rmesh, Fikret Ercal, H. C. Lee

Computer Science Technical Reports

The routing problem is one of the most widely studied problems in VLSI design. Mazerouting algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on Lee's algorithm is poor. In this paper, we propose time-efficient algorithms to solve the maze-routing problem on a reconfigurable mesh architecture. The constant-time algorithms presented include: (i) testing the existence of specific types of paths between two terminals, (ii) finding an absolute shortest path (ASP) and a shortest duplex-path (SDP). In addition, fast algorithms are presented for finding the shortest triplex-path (STP) and …

Run Time Security Evaluation For Distributed Applications, Cristina Serban, Bruce M. Mcmillin

Computer Science Technical Reports

Formal security specifications for a distributed application can be checked for compliance at run-time, during the execution of the application. We propose the RunTime Security Evaluation (RTSE) method which makes use of executable security assertions, histories/traces of events, and operational evaluation in the distributed environment to ensure the security specifications regarding the confidentiality and integrity requirements for the application are fulfilled at run-time. A model problem is used to aid in developing the security requirements formally, and assessment of the RTSE method is given based on the results obtained for the implementation of the model problem. The elements necessary for …

Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan

Electrical & Computer Engineering Theses & Dissertations

Motivated by the fact that human speech perception is a bimodal process (auditory and visual), several researchers have designed and implemented automatic speech recognition (ASR) systems consisting of both audio and visual subsystems, and shown improved performance relative to traditional purely auditory systems. Several visual speech reading approaches have used deformable templates to model the shape of a speaker's lips. Deformable templates are models of image objects, which can be deformed by adjusting a set of parameters to match the object in some optimal way, as defined by a cost function. Using a single deformable lip model has disadvantages such …

Libsearch: A Window-Based Frontend To Remote Bibliographic Databases On The Internet, Ee Peng Lim, Soo-Yin Cheng

Research Collection School Of Computing and Information Systems

Over the past several years, a number of wide-area information navigation and discovery tools have been introduced, including WAIS[1], Gopher[2], World-Wide Web[3], etc. In this paper, we describe a graphical query interface to remote bibliographic databases that can be found on the internet. A library query client, called LibSearch, has been designed and implemented using a set of APIs based on Z39.50 protocol standard[4]. Z39.50 is an application-layer protocol within the OSI reference model designed to allow library users to remotely access the bibliographic records in the library systems. As increasing number of OPAC systems are being established as Z39.50 …

On The Existence Of Schedules That Are Near-Optimal For Both Makespan And Total Weighted Completion Time, Cliff Stein, Joel Wein

Computer Science Technical Reports

We give a simple proof that, for any instance of a very general class of scheduling problems, there exists a schedule of makespan at most twice that of the optimal possible and of total weighted completion time at most twice that of the optimal possible. We then refine the analysis, yielding variants of this theorem with improved constants, and give some algorithmic consequences of the technique.

Implementation And Analysis Of Software Based Fault Isolation, Scott M. Silver

Dartmouth College Undergraduate Theses

Extensible applications rely upon user-supplied, untrusted modules to extend their functionality. To remain reliable, applications must isolate themselves from user modules. One method places each user module in a separate address space (process), which uses hardware virtual memory support to isolate the user process. Costly inter-process communication, however, prohibits frequent communication between the application and the untrusted module. We implemented and analyzed a software method for isolating an application from user modules. The technique uses a single address space. We provide a logical address space and per-module access to system resources for each module. Our software technique is a two-step …

Observer: An Approach For Query Processing In Global Information Systems Based On Interoperation Across Pre-Existing Ontologies, Eduardo Mena, Vipul Kashyap, Amit P. Sheth, Arantza Illarramendi

Kno.e.sis Publications

The huge number of autonomous and heterogeneous data repositories accessible on the “global information infrastructure” makes it impossible for users to be aware of the locations structure/organization, query languages and semantics of the data in various repositories. There is a critical need to complement current browsing, navigational and information retrieval techniques with a strategy that focuses on information content and semantics. In any strategy that focuses on information content, the most critical problem is that of different vocabularies used to describe similar information across domains. We discuss a scalable approach for vocabulary sharing. The objects in the repositories are represented …

Elimination Of All-Optical Cycles In Wavelength-Routed Optical Networks, Jason Iness, Byrav Ramamurthy, Biswanath Mukherjee, Krishna Bala

School of Computing: Faculty Publications

A transparent (wide-area) wavelength-routed optical network may be constructed by using wavelength cross-connect switches connected together by fiber to form an arbitrary mesh structure. The network is accessed through electronic stations that are attached to some of these cross-connects. These wavelength cross-connect switches have the property that they may configure themselves into unspecified states. Each input port of a switch is always connected to some output port of the switch whether or not such a connection is required for the purpose of information transfer. Due to the presence of these unspecified states, there exists the possibility of setting up unintended …

Technology And Business: The Missing Link, S Chandrasekar

IIMB Management Review

Technology, despite its critical importance to business, has far too often played a secondary role compared to other major management functions like marketing, finance, human resources development, production or corporate planning. The success of many US based technology driven companies in electronics and biotechnology in the seventies and early eighties and the Japanese and German economic miracles, driven largely by technology upgradation in specific targeted industries, should serve to renew interest in the study of the role of technology in improving business performance.

A Robust System For Natural Spoken Dialogue, Eric K. Ringger, James F. Allen, Bradford W. Miller, Teresa Sikorski

Faculty Publications

This paper describes a system that leads us to believe in the feasibility of constructing natural spoken dialogue systems in task-oriented domains. It specifically addresses the issue of robust interpretation of speech in the presence of recognition errors. Robustness is achieved by a combination of statistical error post-correction, syntactically- and semantically-driven robust parsing, and extensive use of the dialogue context. We present an evaluation of the system using time-to-completion and the quality of the final solution that suggests that most native speakers of English can use the system successfully with virtually no training.

Heterogeneous Radial Basis Function Networks, Tony R. Martinez, D. Randall Wilson

Faculty Publications

Radial Basis Function (RBF) networks typically use a distance function designed for numeric attributes, such as Euclidean or city-block distance. This paper presents a heterogeneous distance function which is appropriate for applications with symbolic attributes, numeric attributes, or both. Empirical results on 30 data sets indicate that the heterogeneous distance metric yields significantly improved generalization accuracy over Euclidean distance in most cases involving symbolic attributes.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 6, June 1996, 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.

Formal Transformations From Graphically-Based Object-Oriented Representations To Theory-Based Specifications, Scott A. Deloach

Theses and Dissertations

Formal software specification has long been touted as a way to increase the quality and reliability of software; however, it remains an intricate, manually intensive activity. An alternative to using formal specifications is to use graphically-based, semi-formal specifications such as those used in many object-oriented specification methodologies. While semi-formal specifications are generally easier to develop and understand, they lack the rigor and precision of formal specification techniques. The basic premise of this investigation is that formal software specifications can be constructed using correctness preserving transformations from graphically-based object-oriented representations. In this investigation, object-oriented specifications defined using Rumbaugh's Object Modeling Technique …

Performance Study Of A Brazilian Air Force Data Communications Network, Oswaldo Zanelli

Theses and Dissertations

This thesis consists of a performance analysis of two network models using different protocols, the X.25 and Asynchronous Transfer Mode (ATM). X.25 is currently used in the data communications network infrastructure in the Brazilian Air Force. ATM is a high speed network technology. Simulations of both models were performed to compare the two technologies. This study examines the traffic load that each network can handle while still providing a good quality of service (QoS). The X.25 network model proved to have a sufficient capacity to handle the projected workload, but it presented a low QoS when a more intense traffic …

Object Based Constraint Management For Collaborative Systems, Chandrajit Bajaj, Peinan Zhang

Department of Computer Science Technical Reports

No abstract provided.