Computer Sciences Commons^™

The Toysim Project, Anthony Rodriguez

Theses : Honours

No abstract provided.

Clusters Of Stars, Ileana Streinu

Computer Science: Faculty Publications

We solve two open problems posed by Goodman and Pollack[GP84] about sets of signed circular permutations (clusters of stars) arising from generalized configurations of points: recognition and efficient reconstruction (drawing). As a biproduct we get an O(n2) space data structure constructible in O(n2) time, representing the order type of a (generalized) configuration of points and from which the orientation of each triple can be found in constant time, a problem posed in [EHN].

Expert System For The Generation Of A Work Breakdown Structure, Bernard O'Callaghan

Theses

This thesis outlines research work carried out in the Mechanical & Manufacturing Department in Cork Regional Technical College, Ireland. With computers now having an increasingly dominant role in all areas of business, it was inevitable that computer-based project management packages would become more popular. To date however, these packages have concentrated on monitoring and controlling projects. The definition and brainstorming phases required to generate a project plan are still largely manual tasks. Planning a project initially involves generating a complete and organised list of all the tasks needing to be completed in order to achieve a project’s goal. This list …

Computer-Aided Mechanical Assembly Design Using Configuration Spaces, Leo Joskowicz, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Financial Prediction And Trading Strategies Using Neurofuzzy Approaches, K. N. Pantazopoulos, L. H. Tsoukalas, N. G. Bourbakis, M. J. Brün, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Performance Analysis And Visualization Tools For Parallel Computing, K. N. Pantazopoulos, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Future Scientific Software Systems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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.

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 …

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 …

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

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 …

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 …

Improved Heterogeneous Distance Functions, Tony R. Martinez, D. Randall Wilson

Faculty Publications

Instance-based learning techniques typically handle continuous and linear input values well, but often do not handle nominal input attributes appropriately. The Value Difference Metric (VDM) was designed to find reasonable distance values between nominal attribute values, but it largely ignores continuous attributes, requiring discretization to map continuous values into nominal values. This paper proposes three new heterogeneous distance functions, called the Heterogeneous Value Difference Metric (HVDM), the Interpolated Value Difference Metric (IVDM), and the Windowed Value Difference Metric (WVDM). These new distance functions are designed to handle applications with nominal attributes, continuous attributes, or both. In experiments on 48 applications …

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 …

Review Of Personal Identification Systems, J. M. Cross

Research outputs pre 2011

The growth of the use of biometric personal identification systems has been relatively steady over the last 20 years. The expected biometric revolution which was forecast since the mid 1970's has not yet occurred. The main factor for lower than expected growth has been the cost and user acceptance of the systems. During the last few years, however, a new generation of more reliable, less expensive and better designed biometric devices have come onto the market. This combined with the anticipated expansion of new reliable, user friendly inexpensive systems provides a signal that the revolution is about to begin. This …

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 …

Faster Ray Tracing Using Adaptive Grids, Thomas W. Sederberg, Krysztof S. Klimaszewski

Faculty Publications

A new hybrid approach is presented which outperforms the regular grid technique in scenes with highly irregular object distributions by a factor of hundreds, and combined with an area interpolator, by a factor of thousands. Much has been said about scene independence of different acceleration techniques and the alleged superiority of one approach over another. Several theoretical and practical studies conducted in the past have led to the same conclusion: a space partitioning method that allows the fastest rendering of one scene often fails with another. Specialization may be the answer. This has always been pursued, consciously or not, in …

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 …

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 …

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 …