Digital Commons Network^™

Interface Relaxation Methods For Elliptic Differential Equations, John R. Rice, P. Tsompanopoulou, E. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

Computing Volumes Of Solids Enclosed By Recursive Subdivision Surfaces, Jörg Peters, Ahmad Nasri

Department of Computer Science Technical Reports

No abstract provided.

Computing Moments Of Piecewise Polynomial Surfaces, Carlos Gonzalez-Ochoa, Scott Mccammon, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.

Videotext Database System, Haitao Jiang, Danilo Montesi, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Some Applications Of Generalized Ffts, Daniel N. Rockmore

Dartmouth Scholarship

Generalized FFTs are efficient algorithms for computing a Fourier transform of a function defined on finite group, or a bandlimited function defined on a compact group. The development of such algorithms has been accompanied and motivated by a growing number of both potential and realized applications. This paper will attempt to survey some of these applications. Appendices include some more detailed examples.

Operation And Control In A Competitive Market: Distributed Generation In A Restructured Industry, Judith Cardell, Richard Tabors

Engineering: Faculty Publications

The prospect of independent ownership for distributed technologies is being encouraged by the current deregulation of the industry, and it is possible that the new generators will be independently operated as well as independently owned. The siting of numerous small-scale generators in distribution feeders is likely to have an impact on the operations and control of the power system, a system designed to operate with large, central generating facilities. In response to the new and potentially conflicting economic and technical demands of a growing number of independent players, the power system may require new means for coordinating system operations. Price …

Using Atm Networks For Processing Global Earth Data, Barbara L. Kess, Phillip R. Romig Iii, Stephen E. Reichenbach, Ashok K. Samal

School of Computing: Conference and Workshop Papers

amount of computational power to researchers at an affordable cost, making it feasible to use workstations rather than expensive supercomputers to perform scientific analysis of large data sets, such as the Global Land 1-Km AVHRR data. In addition to this, inexpensive high speed ATM networks have the potential to improve the overall computational efficiency of workstations by using several workstations in a distributed environment. This research studies the practicality of using distributed workstations interconnected with a 155 Mb ATM network for analysis and compression of the Global Land 1-Km AVHRR data versus sequential computing on one of the workstations. Performance …

Synthesis For Testability By Two-Clock Control, Shashank K. Mehta, Sharad C. Seth, Kent L. Einspahr

School of Computing: Conference and Workshop Papers

In previous studies clock control has been inserted after design to improve the testability of a sequential circuit. In this paper we propose a two-clock control scheme that is included as a part of the logic synthesis of a finite state machine (fsm). The scheme has low area overhead and competes well with scan methods in its ability to initialize and observe circuit states. The states of the machine are assigned a pair of binary values using a novel split coding system. The purpose of the encoding is to ease navigation between any pair of states using a combination of …

Minimizing The Number Of Optical Amplifiers Needed To Support A Multi-Wavelength Optical Lan/Man, Byrav Ramamurthy, Jason Iness, Biswanath Mukherjee

School of Computing: Conference and Workshop Papers

Optical networks based on passive star couplers and employing wavelength-division multiplexing (WDhf) have been proposed for deployment in local and metropolitan areas. Amplifiers are required in such networks to compensate for the power losses due to splitting and attenuation. However, an optical amplifier has constraints on the maximum gain and the maximum output power it can supply; thus optical amplifier placement becomes a challenging problem. The general problem of minimizing the total amplifier count, subject to the device constraints, is a mixed-integer non-linear problem. Previous studies have attacked the amplifier placement problem by adding the “artificial” constraint that all wavelengths, …

Does Good Project Management Ensure Successful Software Development?, Julie Lisa Eldridge

Theses : Honours

For many years the development of computer software has been plagued by poor customer satisfaction caused by missed schedules, underestimated budgets and the development of products which do not meet requirements. The ever increasing reliance on computers, as reported by Sommerville ''the result of the proliferation of computer systems into all aspects of life and business is that personal, corporate, national and international economies are [becoming] increasingly dependant on computers and software systems" ( 1992, p.2), calls for more stable software which can be developed within time and budget constraints. To achieve this, software development activities must be analysed and …

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the spectral functions of non-strange τ vector current final states is presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years 1991 to 1994. The spectral functions of the dominant two- and four-pion τ decay channels are compared to published results of e + e - annihilation experiments via isospin rotation. A combined fit of the pion form factor from τ decays and e + e - data is performed using different parametrizations. The mass and the width of the ρ ±(770) and the ρ 0(770) are separately determined in order …

Measurement Of The Τ Lepton Lifetime With The Three-Dimensional Impact Parameter Method, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A new method is presented for the measurement of the mean lepton lifetime using events in which are pair-produced and both's decay to hadrons.

The Topology Dependence Of Charged Particle Multiplicities In Three-Jet Events, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A study of individual jet and whole-event charged particle multiplicities in three-jet events measured in e + e − annihilation at the Z reveals a significant topology dependence. Mean jet multiplicities are inadequately described by jet energies; interjet angles must also be specified. Quantitative tests suggest that it is necessary to use transversemomentum- like scales to describe the data.

A Study Of Τ Decays Involving Η And Ω Mesons, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The 132 pbt - 1 of data collected by ALEPH from 1991 to 1994 have been used to analyze η and ω production in τ decays. The following branching fractions have been measured: B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2,B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2, B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3,B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3, B(τ−→ντηK−)=(2.9+1.3−1.2±0.7)×10−4,B(τ−→ντηK−)=(2.9−1.2+1.3±0.7)×10−4, B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3 and the 95% C.L. limit B(τ− → ντηπt -) t - 4 has been obtained. The ωπt- and ηπt -π0 rates and dynamics are found in agreement with the predictions made from e+e∼ - annihilation data with the help of isospin invariance (CVC).

Improved Measurement Of The Bd0 -B̄D0 Oscillation Frequency, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The time dependence of B0 d {B 0 d oscillations is measured by the ALEPH experiment at LEP, using three techniques, two of which are updates of previous measurements. In all cases the charge of the decaying b quark and its decay time are measured in one hemisphere of the event; the quark charge at production is tagged mainly using the opposite hemisphere. The first method uses the charge correlation between a D and a lepton in the opposite hemisphere; if no lepton is present, the produced quark charge is determined from the hemisphere charges. In the second method, the …

Production Of Orbitally Excited Charm Mesons In Semileptonic B Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A sample of 3.6 million hadronic Z decays recorded between 1991 and 1995 with the ALEPH detector at LEP is used to investigate semileptonic decays of B mesons into final states involving orbitally excited charm mesons. Topological vertex criteria are used to search for decays involving narrow D** states as well as wide D** resonances and non-resonant D(*)π final states. The sum of the branching ratios for these processes is measured to be ${⤪ Br}({⩈erline {⤪ B}}⌝ghtarrow {⤪ D}≪ ⫑l^{-}{⩈erline v}) + {⤪ Br}({⩈erline {⤪ B}}⌝ghtarrow {⤪ D}^{⇒t}≪ ⫑l^{-}{⩈erline v})↦op =(2.26 pm 0.29({⤪ stat}) pm 0.33({⤪ syst}))%,$which accounts for a …

Transverse Momentum Correlations In Hadronic Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

Using data obtained with the ALEPH detector at the Z resonance, a measure based on transverse momentum is shown to exhibit a correlation between the two halves of a hadronic event which cannot be explained by energy-momentum conservation, flavour conservation, the imposition of an event axis or imperfect event reconstruction. Two possible interpretations based on existing Monte Carlo models are examined: a) ARIADNE, with the correlation forming early in the parton shower and with the transition from partons to hadrons playing only a minor part; b) JETSET, with the correlation forming at the fragmentation stage. A correlation technique based on …

Integrated Queries To Existing Bibliographic And Structured Databases, Ee Peng Lim, Ying Lu

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 upon different forms of data, including bibliographic, text, multimedia, and structured data. In this paper, the problem of integrating existing public bibliographic databases and structured databases which reside at different locations in the network is addressed. Although bibliographic data is semistructured, its attribute set is often determined by an international standard known as MARC. To unify bibliographic and structured data, the well-known SQL was extended to model bibliographic related attributes and queries. In particular, a new data type was …

A Hypermedia Database To Manage World-Wide-Web Documents, Schubert Shou Boon Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World-Wide-Web (WWW) with its potential commercial payoff has resulted in an explosion of information as organisations join in to publish and do business on the Internet. A related development, Intranet, which basically uses the same technology to build private corporate WWW-based networks, has emerged to provide cost-effective and efficient groupware and information management solutions for organisations. As a result, the Hyper Text Markup Language (HTML), used for constructing WWW documents, has become a contender for authoring future office documents. With this scenario, this study examines WWW practices and highlights the inadequacy and drawbacks of …

Analysis Of Digital Logic Schematics Using Image Recognition, James A. Giles

UNF Graduate Theses and Dissertations

This thesis presents the results of research in the area of automated recognition of digital logic schematics. The adaptation of a number of existing image processing techniques for use with this kind of image is discussed, and the concept of using sets of tokens to represent the overall drawing i s explained in detail. Methods are given for using tokens to describe schematic component shapes, to represent the connections between components, and to provide sufficient information to a parser so that an equation can be generated. A Microsoft Windows-based test program which runs under Windows 95 or Windows NT has …

Managing World Wide Web Publications, Schubert Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World Wide Web (WWW), with its potential commercial payoff, has resulted in an explosion of information as organizations join in the fray to publish and do business on the Internet. In addition, Intranet, the private corporate WWW‐based network, has also emerged to provide cost‐effective and efficient groupware and information management solutions for organizations. As a result, the HyperText Markup Language used for constructing WWW documents has become a contender for authoring future office documents. Examines the current practices of WWW publishing and highlights its inadequacies and drawbacks. Demonstrates the need and advantages of using …

Low-Degree Graph Partitioning Via Local Search With Applications To Constraint Satisfaction, Max Cut, And Coloring, Magnus M. Halldorsson, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree ∆ that cut at least a k - 1/k (1 + 1/2∆+k-1 ) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a tight analysis of natural local search heuristics for the maximum constraint satisfaction problem. These partitions also imply efficient approximations for several problems on weighted bounded-degree graphs. In particular, we improve the best performance …

Response Surface Methodology: An Analytical Method For Locating Migrated Contaminant Sources, Orlando J. Dona Jr.

Theses and Dissertations

The use and storage of hazardous chemicals at U.S. military facilities often adversely affect the groundwater when contaminants infiltrate the subsurface as a result of leaks and accidental spills. These contaminants, if not located and remediated in a relatively short time, may move and settle unpredictably, essentially creating a source some distance from the original leak or spill. An example of this phenomenon is found with migrating dense nonaqueous phase liquid (DNAPL) contaminants. Although various methods for estimating the present day locations of these migrated contaminants are in use, accurately pinpointing the source of contaminants remains a difficult problem in …

Time-Optimal Tree Computations On Sparse Meshes, D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J. L. Schwing

Computer Science Faculty Publications

The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand, we exhibit time lower bounds for a number of tree-related problems on the MMB. On the other hand, we show that these lower bounds are tight by exhibiting time-optimal tree algorithms on the MMB. Specifically, we show that the task of encoding and/or decoding n-node binary and ordered trees cannot be solved faster than Ω(log n) time even if the MMB has an infinite …

Hardware Interfacing In The Broadcast Industry Using Simple Network Management Protocol (Snmp), Walter H. Schuller Jr.

UNF Graduate Theses and Dissertations

Communication between various broadcast equipment plays a major role in the daily operation of a typical broadcast facility. For example, editing equipment must interface with tape machines, production switchers must interface with font generators and video effect equipment, and satellite ground controllers must interface with satellite dishes and receivers. Communication between these devices may be a simple hardware handshake configuration or a more elaborate software based communications via serial or parallel interfacing. This thesis concerns itself with the software interfacing needed to allow various dissimilar types of equipment to communicate, and therefore, interface with each other. The use of Simple …

Parallel Algorithms For Single-Layer Channel Routing, Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that are known to have linear- time sequential solutions rather than limiting attention to the "river-routing" context, where single-sided connections are disallowed. For the minimum separation problem, we obtain O(lgN) time on a CREW PRAM or O(lgN / lglgN) time on a (common) CRCW PRAM, both with optimal work (processor- time product) of O(N), where N is the number of terminals. For the offset range problem, we obtain the same time and processor …

Privacy Issues Dealing With Technology : A Review Of The Literature, Kimberly S. Mccoy

Graduate Research Papers

The sophisticated applications of technology are expanding everyday. Unfortunately, so are the many concerns individuals in society are having about their right to privacy. The actual regulations dealing with one's right to privacy has not expand as rapidly as the applications of technology. Individuals using various types of technology are under the assumption their activities are private; however, this is not the case. It does not seem to matter if you are using a computer for communications work, school, or in the "privacy" of your own home, there is absolutely no privacy when dealing with this type of technology.

This …

Timestamp-Based Approach For The Detection And Resolution Of Mutual Conflicts In Distributed Systems, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a timestamp based algorithm for the detection of both write-write and read-write conflicts for a single file in distributed systems during network partitions. Our algorithm allows operations to occur in different network partitions simultaneously. When the sites from different partitions merge, the algorithm detects and resolves both read-write and write-write conflicts without taking into account the semantics of the transactions. Once the conflicts have been detected some reconciliation steps for the resolution of conflicts have also been proposed. Our algorithm will be useful in real-time systems where timeliness of operations is more important than response time (delayed commit)

Randomised Shuffle And Applied Misinformation: An Enhanced Model For Contact-Based Smart-Card Serial Data Transfer, Michael Collins

Theses: Doctorates and Masters

Contact-based smart-cards, which comply to the International Standard IS0-7816, communicate with their associated read/write machines via a single bi-directional serial link. This link is easy to monitor with inexpensive equipment and resources, enabling captured data to be removed for later examination. In many contact-based smart-cards the logical abilities are provided by eight-bit microcontroller units (MCU) which are slow at performing effective cryptographic functions. Consequently, for expediency, much data may be transferred in plain-text across the vulnerable communications link, further easing an eavesdropper's task. Practitioners in military communications protect transmitted information by varying a link's carrier frequency in an apparently random …

An Approach To Display Layout Of Dynamic Windows, Nihar Trivedi

Theses: Doctorates and Masters

The development of windows based user interface has introduced a new dimension to the field of human computer interaction. Now a user is able to perform multiple tasks at a time, often switching from one task to another. However windows environment also imposes the burden of manual windows management on the user. Several studies have suggested that manual window management is an unproductive chore often resulting in clutter and confusion on the display screen. Therefore we need a automatic windows layout generator to free the user to perform other useful tasks. This thesis introduces SPORDAC {Shadow Propagation for Overlap Removal …