Physical Sciences and Mathematics Commons^™

Mccogen, A C Code Generator From Mathematica Language, Chang-Hyeon Song

Department of Computer Science Technical Reports

No abstract provided.

Applications Of A Numbering Scheme For Polygonal Obstacles In The Plane, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Parallel Reuse Methodologies For Elliptic Boundary Value Problems, S. Markus, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Multi-Pass Transmission Policy: An Effective Method Of Transmitting Large Multimedia Objects In The Wide-Area Network, Sheng-Yih Wang, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Residency Check Elimination For Object- Oriented Persistent Languages, Antony L. Hosking

Department of Computer Science Technical Reports

No abstract provided.

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*

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.

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

Research Collection School Of Computing and Information Systems

No abstract provided.

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 …

The Design Of A Financial Management Database System, Edward G. Leszynski

Theses and Dissertations

This research led to the design and development of a financial management database system for the Aeronautical Systems Center (AS C) Environmental Management (EM) Systems Program Office (SPO), which has the responsibility of managing the environmental contracts for the Government-Owned, Contractor-Operated (GOCO) plants that are owned by the Air Force. This thesis investigated the various 'development strategies' and 'methodologies' described in the Management Information Systems literature in order to devise an end-user development strategy capable of meeting the EM SPO's requirements. In addition, the information requirements, conceptual design and prototyping, and procedures phases of the System Development Life Cycle (SDLC) …

Background Graphics: A Decision-Making Hindrance Or Enhancement?, David L. Peeler Jr.

Theses and Dissertations

This thesis investigated the influence, if any, of background graphics on the decision making process. Specifically the hypotheses tested the affect of background graphics on a decision makers accuracy and confidence. A literature review revealed an abundance of graphic research but little reference to the use of background graphics. Using guidelines previously created for high integrity graphics, a timed 2 x 2 factorial experimental design was developed to compare the responses to both traditional graphics and those treated with background graphics. One hundred forty-seven subjects, all employees of the United States Air Force or defense contractors were involved in the …

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.

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 Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being …

Calibration Of The Checkpoint Model To The Space And Missile Systems Center (Smc) Software Database (Swdb), Karen R. Mertes

Theses and Dissertations

This study analyzed the effect of calibration on the performance of the CHECKPOINT Version 2.3.1 software cost estimating model. Data used for input into the model were drawn from the FY 95 USAF SMC Software Database (SWDB) Version 2.1. A comparison was made between the model's accuracy before and after calibration. This was done using records which were not used in calibration, referred to as validation points. A comparison of calibration points, both before and after, was done in order to assess whether calibration results in more consistency within the data set used. Six measures such as magnitude of relative …

Development Of A Standard Set Of Indicators And Metrics For Artificial Intelligence (Ai) And Expert System (Es) Software Development Efforts, Derek F. Cossey

Theses and Dissertations

The purpose of this research was to identify a standard set of indicators and metrics that can be used by program managers to improve their abilities to direct development efforts involving Artificial Intelligence (AI) and Expert Systems (ES). This research addresses two objectives. The first objective is to identify an appropriate set of software indicators and metrics to be used by government program offices for the management of development efforts involving software systems for AI and ES. The second objective is to demonstrate how the resources of the National Software Data and Information Repository (NSDIR) can be used in order …

Practical Implementation Of Multiple Model Adaptive Estimation Using Neyman-Pearson Based Hypothesis Testing And Spectral Estimation Tools, Peter D. Hanlon

Theses and Dissertations

This study investigates and develops various modifications to the Multiple Model Adaptive Estimation (MMAE) algorithm. The standard MMAE uses a bank of Kalman filters, each based on a different model of the system. Each of the filters predict the system response, based on its system model, to a given input and form the residual difference between the prediction and sensor measurements of the system response. Model differences in the input matrix, output matrix, and state transition matrix, which respectively correspond to an actuator failure, sensor failure, and an incorrectly modeled flight condition for a flight control failure application, were investigated …

Calibration Of The Softcost-R Software Cost Model To The Space And Missile Systems Center (Smc) Software Database (Swdb), Steven V. Southwell

Theses and Dissertations

The rising number and importance of Department of Defense software developments, when combined with declining defense budgets, has resulted in a critical need to accurately plan and manage software development costs and schedules. Unfortunately, the increasing size, complexity, and diversity of these software developments has made accurate estimating problematic. Uncalibrated software cost models have not generally produced reliable results due to generic default parameters and improper usage. The default parameters cannot hope to accurately represent and predict the wide variability of software efforts to which the models are being applied. However, some of the models have achieved improved accuracy by …

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.

Determining An Out-Of-Core Fft Decomposition Strategy For Parallel Disks By Dynamic Programming, Thomas H. Cormen

Dartmouth Scholarship

We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. Our algorithm uses a recursive divide-and-conquer strategy, and each stage in the recursion presents several possibilities for how to split the problem into subproblems. We give a recurrence for the algorithm's I/O complexity on the Parallel Disk Model and show how to use dynamic programming to determine optimal splits at each recursive stage. The algorithm to determine the optimal splits takes only Theta(lg^2 N) time for an N-point FFT, and it is practical. The out-of-core FFT algorithm itself takes considerably longer.

Flexibility And Performance Of Parallel File Systems, David Kotz, Nils Nieuwejaar

Dartmouth Scholarship

As we gain experience with parallel file systems, it becomes increasingly clear that a single solution does not suit all applications. For example, it appears to be impossible to find a single appropriate interface, caching policy, file structure, or disk-management strategy. Furthermore, the proliferation of file-system interfaces and abstractions make applications difficult to port. \par We propose that the traditional functionality of parallel file systems be separated into two components: a fixed core that is standard on all platforms, encapsulating only primitive abstractions and interfaces, and a set of high-level libraries to provide a variety of abstractions and application-programmer interfaces …

Transportable Agents Support Worldwide Applications, David Kotz, Robert Gray, Daniela Rus

Dartmouth Scholarship

Worldwide applications exist in an environment that is inherently distributed, dynamic, heterogeneous, insecure, unreliable, and unpredictable. In particular, the latency and bandwidth of network connections varies tremendously from place to place and time to time, particularly when considering wireless networks, mobile devices, and satellite connections. Applications in this environment must be able to adapt to different and changing conditions. We believe that transportable autonomous agents provide an excellent mechanism for the construction of such applications. We describe our prototype transportable-agent system and several applications.

Worldwide applications exist in an environment that is inherently distributed, dynamic, heterogeneous, insecure, unreliable, and unpredictable. …

Frequency Computation And Bounded Queries, Richard Beigel, William I. Gasarch, Efim Kinber

School of Computer Science & Engineering Faculty Publications

There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: Ft(xl,. . .,x0) = ,4(x,). .A(x,). We are interested in the complexity (in terms of the number of queries) of approximating Fi. Let b

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.

Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

No abstract provided.

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

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.

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

Department of Computer Science Technical Reports

No abstract provided.