Digital Commons Network^™

Www//Pdepack A Web Based Problem Solving Environment For Partial Differential Equations, W. R. Dyksen, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Provably Convergent Dynamic Training Method For Multi-Layer Perceptron Networks, Timothy L. Andersen, Tony R. Martinez

Faculty Publications

This paper presents a new method for training multi-layer perceptron networks called DMP1 (Dynamic Multilayer Perceptron 1). The method is based upon a divide and conquer approach which builds networks in the form of binary trees, dynamically allocating nodes and layers as needed. The individual nodes of the network are trained using a genetic algorithm. The method is capable of handling real-valued inputs and a proof is given concerning its convergence properties of the basic model. Simulation results show that DMP1 performs favorably in comparison with other learning algorithms.

Interfaces For Disk-Directed I/O, David Kotz

Computer Science Technical Reports

In other papers I propose the idea of disk-directed I/O for multiprocessor file systems. Those papers focus on the performance advantages and capabilities of disk-directed I/O, but say little about the application-programmer's interface or about the interface between the compute processors and I/O processors. In this short note I discuss the requirements for these interfaces, and look at many existing interfaces for parallel file systems. I conclude that many of the existing interfaces could be adapted for use in a disk-directed I/O system.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 7, September 1995, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Measurement Of The Effective B Quark Fragmentation Function At The Z Resonance, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using a sample of about 1.46 million hadronic Z decays collected between 1991 and 1993 with the ALEPH detector at LEP, the energy distribution of the B0 and B± mesons produced at the Z resonance is measured by reconstructing semileptonic decays B → ℓνℓD(X) or B→ ℓνℓD∗+(X). The charmed mesons are reconstructed through the decay modes D0 → K−π+, D0 → K−π+π−π+, D+ → K−π+π+ and D∗+→ D0π+. The neutrino energy is estimated from the missing energy in the lepton hemisphere. Accounting for B∗ and B∗∗ production, the shape of the scaled energy distribution xE(b) for mesons containing a b …

Measurement Of Αs From Scaling Violations In Fragmentation Functions In E+E- Annihilation, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A study of scaling violations in fragmentation functions performed by the ALEPH collaboration at LEP is presented.

An Architecture For A Camputs-Scale Wireless Mobile Internet, Douglas E. Comer, John C. Lin, Vincent F. Russo

Department of Computer Science Technical Reports

No abstract provided.

S-To-P Broadcasting On Coarse-Grained Machines, Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu

Department of Computer Science Technical Reports

No abstract provided.

Distributed And Collaborative Synthetic Environments, Chandrajit L. Bajaj, Fausto Bernardini

Department of Computer Science Technical Reports

No abstract provided.

Group Creativity And Technology, Keng Siau

Research Collection School Of Computing and Information Systems

Despite the popularity of brainstorming, research has shown that verbal brainstorming is not always effective in increasing group creativity. On the other hand, its electronic counterpart, electronic brainstorming, appears to produce much better results. Is technology the panacea for group idea generation? This paper first reviews the theory of group creativity and then examines the characteristics of electronic brainstorming that makes it more effective than verbal brainstorming. From the success of electronic brainstorming, it then argues that the use of technology might be the key to overcome the space and time constraints that are commonly faced by creativity groups.

Measurements Of The B Baryon Lifetime, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The average lifetime of b-flavoured baryons measured with the OPAL detector is updated to include data collected between 1990 and 1994 at LEP. Bottom-flavoured baryons that decay semileptonically and produce aΛ baryon are identified through the correlation of the baryon number of theΛ and the electric charge of the lepton. To measure the lifetime, the decay point of the b baryon is estimated by theΛ-lepton vertex, and the observed distribution of decay lengths is fitted simultaneously in 874 right-sign and 384 wrong-sign combinations. In a separate method, the impact parameter distribution of the leptons is fitted in a subset of …

Ua12/2/1 College Heights Herald, Vol. 71, No. Ii, Wku Student Affairs

WKU Administration Documents

WKU campus newspaper reporting campus, athletic and Bowling Green, Kentucky news. This issue contains articles:

• Vickrey, Eric & Charbonee LaBelle. Survey Aimed at Dropout Rate
• Good, Epha. NASA Grant Targets Minorities, Research
• Becker, Lori. Empty-Handed: Western Loses Out on $200,000 Gift in Will – Kathleen Carter
• LaBelle, Charbonee. Students Not Safe from Tow Trucks – Parking
• Weaver, Ron. Editorial Cartoon re: Pay Raise
• Slicing Pay-Raise Pie for Faculty, Staff
• Gentile, Mark. Non-Discrimination Policy Should Include Gays
• Gagliardi, Melissa. When in France, Know the Language
• Curtis, Stacy. Editorial Cartoon. Shannon Faulkner Quits Citadel
• Brown, Karen. Take Care of Business, Black Students …

Frequency Of Pattern Occurences In A (Dna) Sequence, Mireille Régnier, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

An Integrated Framework For Learning And Reasoning, Christophe G. Giraud-Carrier, Tony R. Martinez

Faculty Publications

Learning and reasoning are both aspects of what is considered to be intelligence. Their studies within AI have been separated historically, learning being the topic of machine learning and neural networks, and reasoning falling under classical (or symbolic) AI. However, learning and reasoning are in many ways interdependent. This paper discusses the nature of some of these interdependencies and proposes a general framework called FLARE, that combines inductive learning using prior knowledge together with reasoning in a propositional setting. Several examples that test the framework are presented, including classical induction, many important reasoning protocols and two simple expert systems.

Multiclass Query Scheduling In Real-Time Database Systems, Hwee Hwa Pang, Michael J. Carey, Miron Livny

Research Collection School Of Computing and Information Systems

In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emergence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. …

Measurement Of The D*± Cross Section In Two Photon Collisions At Lep, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The inclusive production of D∗± mesons in photon-photon collisions has been measured by the Aleph experiment at LEP with a beam energy of 45 GeV. The D∗+ are detected in their decay to D0π+ with the D0 observed in three separate decay modes: (1) K−π+, (2) K−π+π0 and (3) K−π+π−π+, and analagously for the D∗− modes. A total of 33 events was observed from an integrated luminosity of 73 pb−1 which corresponds to a cross section for Σ(e+e−→ e+e−D∗±X) of 155 ± 33 ± 21 pb. This result is compatible with both the direct production γγ → cc in the …

Limit On B0s Oscillation Using A Jet Charge Method, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A lower limit is set on the Bs0 meson oscillation parameter Δms using data collected from 1991 to 1994 by the ALEPH detector. Events with a high transverse momentum lepton and a reconstructed secondary vertex are used. The high transverse momentum leptons are produced mainly by b hadron decays, and the sign of the lepton indicates the particle/antiparticle final state in decays of neutral B mesons. The initial state is determined by a jet charge technique using both sides of the event. A maximum likelihood method is used to set a lower limit of Δms. The 95% confidence level lower …

Surface Intersection Loop Destruction, Thomas W. Sederberg, Alan K. Zundel

Faculty Publications

The intersection curve between two surface patches consists of one or more connected components or branches. Each component can be classified as either an open branch, with endpoints on at least one patch boundary, or as a closed loop.

Scis Networking - July 1995, Nova Southeastern University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Test Of The Flavour Independence Of Αs, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using about 950 000 hadronic events collected during 1991 and 1992 with the ALEPH detector, the ratios r b = bs=udsc s and r uds = uds s =cbs have been measured in order to test the avour independence of the strong coupling constant s . The analysis is based on event{shape variables using the full hadronic sample, two b-quark samples enriched by lepton tagging and lifetime tagging, and a light-quark sample enriched by lifetime antitagging. The combined results are r b = 1:002 0:023 and r uds = 0:971 0:023.

A Statistical Approach To Mpeg Video Stream Characterization, Kubilay Cardakli

Electrical Engineering and Computer Science - Technical Reports

As video consumes a significant percentage of the available network bandwidth, understanding video bandwidth requirements will translate into better network control schemes. In this study, several commercially available video streams are statistically analyzed and several modeling approaches are developed. The segmentation techniques are found to be rewarding. However, the improvements due to complexity of the polynomial models are insignificant.

A Survey Of Mobile Computing Technologies And Applications, Anupam Joshi, Sanjiva Weerawarana, Ranjeewa A. Weerashighe, Tzvetan T. Drashansky, Narendran Ramakrishnan

Department of Computer Science Technical Reports

No abstract provided.

Experimental Study Of Tcp And Udp Protocols For Future Distributed Databases, Xiangning Liu, Lebin Cheng, Bharat Bhargava, Zhiyuan Zhao

Department of Computer Science Technical Reports

No abstract provided.

Frequency Computation And Bounded Queries (Conference Paper), 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: FaA(x1, …, xa)=A(x1)···A(xa). We are interested in the complexity (in terms of the number of queries) of approximating FaA. Let b⩽a and let f be any function such that FaA(x1, …, x a) and f(x1, …, xa) agree on at least b bits. For a general set A we have matching upper and lower bounds that depend on coding theory. These are applied …

Matching And Indexing Techniques In Rules, Madhav Moganti

Computer Science Technical Reports

Rules are widely used in present-day intelligent systems for modeling intelligent behavior, building expert systems, database rule systems, and advanced document retrieval systems. Most rule-based system programs are extremely computation-intensive and run quite slowly. This problem may get still worse when a rulebase does not fit into primary memory completely. This article reviews currently existing rule matching and indexing techniques. This report is organized into two parts. Part I presents the well known rule matching algorithms, Rete and TREAT, along with their performance evaluations. Part II presents rule indexing techniques for large scale rulebases. Here two sources of indexing are …

Parallel Fast Multipole Algorithm Using Mpi, Daniel Okunbor, Eric Jui-Lin Lu

Computer Science Technical Reports

The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is 0( N 2 ), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which minimizes the …

A Multiple Discrete Pass Algorithm On A Dec Alpha 2100, Scott R. Cushman

Dartmouth College Undergraduate Theses

No abstract provided.

Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White

School of Computing: Faculty Publications

In this paper, we discuss gigabit network applications enabled by "Mission to Planet Earth," an international effort to monitor the Earth as a system. We describe the design of a network architecture to support applications developed as part of this program; introduce a new component, public access resource centers (PARC9s); and discuss how PARC's would facilitate access by users outside the traditional research community. We also describe how a particular class of users, agriculture users, might to Planet Earth program and delivered in a value-added form to them by a so-called AgPARC. The suggested architecture requires the deployment of high-bandwidth …

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

Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang

Computer Science Faculty Publications and Presentations

High-performance byte copying is important for many operating systems because it is the principle method used for transferring data between kernel and user protection domains. For example, byte copying is commonly used for transferring data from kernel buffers to user buffers during file system read and IPC recv calls and to kernel buffers from user buffers during 'Write and-send calls. Because of its impact on overall system performance, commercial operating systems tend to employ many specialized byte copy routines, each one optimized for a different circumstance.

This paper revisits the opportunities for optimizing byte copy performance by discussing a series …