Digital Commons Network^™

Procedurally Rational Decision-Making And Control, Richard L. Frost, Michael A. Goodrich, Wynn C. Stirling

Faculty Publications

Substantive rationality requires a decision-maker to be a utility maximizer; under this paradigm, the decision is paramount, and not dependent on the computational process used to obtain it. Procedural rationality is dependent on the method used to make the decision; reasonableness of the procedure is paramount. Well-formed problems are amenable to substantive rationality; ill-formed problems are not, but are amenable to procedural rationality. To qualify as being procedurally rational, a methodology must possess a sound epistemological basis, it must be amenable to a formal design synthesis procedure, and it must be consistent with substantive rationality. Epistemic utility theory forms the …

A Fertility Channel Model For Post-Correction Of Continuous Speech Recognition, Eric K. Ringger, James F. Allen

Faculty Publications

We have implemented a post-processor called SPEECHPP to correct word-level errors committed by an arbitrary speech recognizer. Applying a noisy-channel model, SPEECHPP uses a Viterbi beam-search that employs language and channel models. Previous work demonstrated that a simple word-for-word channel model was sufficient to yield substantial incieases in word accuracy. This paper demonstrates that some improvements in word accuracy result from augmenting the channel model with an account of word fertility in the channel. This work further demonstrates that a modern continuous speech recognizer can be used in "black-box" fashion for robustly recognizing speech for which the recognizer was not …

Techniques Of The Average Case Analysis Of Algorithms, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

An Evidential Reasoning Approach To Attribute Value Conflict Resolution In Database Integration, Ee Peng Lim, Jaideep Srivastava, Shashi Shekhar

Research Collection School Of Computing and Information Systems

Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel [1] showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. In this paper, we show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. We therefore propose an extended relational model based on Dempster-Shafer theory of evidence [2] to incorporate such uncertain knowledge about the source databases. The extended relation uses evidence sets to represent …

Run-Time Security Evaluation: Can We Afford It?, Cristina Serban, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

The use of the run-time security evaluation (RTSE) method for a distributed application takes a toll in overall application performance. The associated overhead and its major sources are discussed, along with possible solutions for improvements, and questions that remain still open.

Authorship Analysis: Identifying The Author Of A Program, Ivan Krsul, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Observation Of Charmless Hadronic B Decays, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Strange B Baryon Production And Lifetime In Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

In a data sample of approximately four million hadronic Z decays recorded with the ALEPH detector from 1990 to 1995, a search for the strange b baryon Ξb is performed with a study of Ξ-lepton correlations. Forty-four events with same sign Ξ−ℓ− combinations are found whereas 8.4 are expected based on the rate of opposite sign Ξ−ℓ+ combinations. This significant excess is interpreted as evidence for Ξb semileptonic decays. The measured product branching ratio is Br(b → Ξb) × Br(Ξb→ XcXℓ−νℓ) × Br(Xc→ Ξ−X′) = (5.4±1.1(stat) ± 0.8(syst)) × 10−4 per lepton species, averaged over electrons and muons, with Xc …

An On-The-Fly Decoding Technique For Reed-Solomon Codes, Yuan Xing Lee, Robert H. Deng, Eng Hean Koh

Research Collection School Of Computing and Information Systems

An on-the-fly error correction technique for double-byte-error-correction (DBEC) and triple-byte-error-detection (TBED) Reed-Solomon (RS) codes is presented in this paper. This new algorithm finds number of byte-errors (single byte-error, double-byte errors, and triple-byte errors) by simply testing the values of a few syndrome functions, and locates and corrects the byte-errors directly without using the standard iterative algorithms for finding the error location polynomial. More importantly, it neither suffers from malfunctions incurred in Deng-Costello algorithm (1987), nor requires syndrome re-calculation as in Koksal-Yucel's modification (1992). It is also much more simpler and faster than the original Deng-Costello algorithm. It has found applications …

Measurement Of The B Forward-Backward Asymmetry And Mixing Using High-P⊥ Leptons, Buskulic, D., M. Thulasidas

Research Collection School Of Computing and Information Systems

The B0 - B̄0 average mixing parameter χ and b forward-backward asymmetry AFB0(b) are measured from a sample of about 4 200 000 Z → qq̄ events recorded with the ALEPH detector at LEP in the years 1990–1995. High transverse momentum electrons and muons produced in b semileptonic decays provide the tag of the quark flavour and of its charge.The average mixing parameter and the pole b asymmetry are measured to be χ = 0.1246 ± 0.0051stat ± 0.0052syst, AFB0(b) = 0.1008 ± 0.0043stat ± 0.0028syst. The value of sin2θweff = 0.23198 ± 0.00092 is extracted from the asymmetry measurement.

Search For Charginos And Neutralinos With R-Parity Violation At √S = 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Searches for charginos and neutralinos produced in e +e - collisions at centre-of-mass energies of 130 and 136 GeV have been performed under the assumptions that R-parity is not conserved, that the dominant R-parity violating coupling involves only leptonic fields, and that the lifetime of the lightest supersymmetric particle can be neglected. In the 5.7 pb -1 data sample collected by ALEPH, no candidate events were found. As a result, chargino and neutralino masses and couplings are constrained and the domains previously excluded at LEP1 are extended.

Mass Limit For The Standard Model Higgs Boson With The Full Lep I Aleph Data Sample, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The reaction e+e− → HZ∗ is used to search for the standard model Higgs boson in the Hνν and the Hℓ+ℓ− channels. The data sample corresponds to about 4.5 million hadronic Z decays collected by the ALEPH experiment at LEP from 1989 to 1995 at centre-of-mass energies at and around the Z peak. Three candidate events are found in the Hμ+μ− channel, in agreement with the expected background from the electroweak process e+e− ℓ+ℓ−qq. This search results in a 95% C.L. lower limit on the Higgs boson mass of 63.9 GeV/c2.

Search For Cp Violation In The Decay Z → B B̄ G, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

About three million hadronic decays of the Z collected by ALEPH in the years 1991 to 1994 are used to search for anomalous CP violation beyond the Standard Model in the decay Z → bb̄g. The study is performed by analyzing angular correlations between the two quarks and the gluon in three-jet events and by measuring the differential two-jet rate. No signal of CP violation is found. For the combinations of anomalous CP violating couplings, ĥb = ĥAbgVh - ĥVbgAb and hb* = √ĥVb2 + ĥAb2, limits of | ĥb | b*

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 …

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

Measurement Of The Mass Of The Λb Baryon, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

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 …

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …

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 …

Neural Generalized Predictive Control For Real-Time Control, Donald I. Soloway

Electrical & Computer Engineering Theses & Dissertations

In this thesis a computationally efficient Generalized Predictive Control (GPC) algorithm is presented and implemented. The algorithm is more efficient than others because the number of iterations needed for convergence is significantly lower with Newton-Raphson. The main additional cost with Newton-Raphson algorithm is the calculation of the Hessian. This overhead is not a problem because of the reduced number of iterations, making the algorithm suitable for real-time control. For nonlinear control applications, a neural network is used as a dynamical system predictor leading to a Neural Generalized Predictive Control (NGPC) algorithm which is presented in detail in this thesis. An …

Needed Narrowing As The Computational Strategy Of Evaluable Functions In An Extension Of Goedel, Bobbi J. Barry

Dissertations and Theses

A programming language that combines the best aspects of both the functional and logic paradigms with a complete evaluation strategy has been a goal of a Portland State University project team for the last several years. I present the third in a series of modifications to the compiler of the logic programming language Goedel which reaches this goal. This enhancement of Goedel's compiler translates user-defined functions in the form of rewrite rules into code that performs evaluation of these functions by the strategy of needed narrowing. In addition, Goedel's mechanism that evaluates predicates is supplemented so that needed narrowing is …

Robust Optimization Using Training Set Evolution, Tony R. Martinez, Dan A. Ventura

Faculty Publications

Training Set Evolution is an eclectic optimization technique that combines evolutionary computation (EC) with neural networks (NN). The synthesis of EC with NN provides both initial unsupervised random exploration of the solution space as well as supervised generalization on those initial solutions. An assimilation of a large amount of data obtained over many simulations provides encouraging empirical evidence for the robustness of Evolutionary Training Sets as an optimization technique for feedback and control problems.

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 …

On The Use Of The Complexity Index As A Measure Of Complexity In Activity Networks, Bert De Reyck, Willy Herroelen

Research Collection Lee Kong Chian School Of Business

A large number of optimal and suboptimal procedures have been developed for solving combinatorial problems modeled as activity networks. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures, inspired a number of researchers to develop various complexity measures. In this paper we investigate the relation between the hardness of a problem instance and the topological structure of its underlying network, as measured by the complexity index. We demonstrate through a series of experiments that the complexity index, defined as the minimum number …

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.