Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 30841 - 30870 of 31947

Full-Text Articles in Entire DC Network

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

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 …


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

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 …


Webassess, Justin Anthony Brown Jan 1997

Webassess, Justin Anthony Brown

Theses : Honours

This project and research has resulted in the development of a World Wide Web (WWW) based testing system. WEBassess can be accessed and used from any point in the world that has a connection to the WWW. The WEBassess system allows for the creation and completion of tests through the WWW interface. Scoring and feedback of submitted tests is completely automated, allowing students to see their test result immediately, including visual indicators for correct and incorrect answers. These test results may then be viewed by academic staff, showing complete test details, such as unit code, test title, score, percentage, date …


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

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 …


Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler Jan 1997

Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler

Computer Science Faculty Publications

Lyceum is a prototype scalable query gateway that provides a logically central interface to multi-protocol and physically distributed, digital libraries of scientific and technical information. Lyceum processes queries to multiple syntactically distinct search engines used by various distributed information servers from a single logically central interface without modification of the remote search engines. A working prototype (http://www.larc.nasa.gov/lyceum/) demonstrates the capabilities, potentials, and advantages of this type of meta-search engine by providing access to over 50 servers covering over 20 disciplines.


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

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 …


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

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 …


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

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 Jan 1997

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).


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

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 …


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

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 Jan 1997

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.


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

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 …


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

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 Jan 1997

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 Jan 1997

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 …


Reverse Engineering Of Computer-Based Navy Systems, Lonnie R. Welch, Guohui Yu, Binoy Ravindran, Franz J. Kurfess, Jorge Henriques, Mark Wilson, Antonio L. Samuel, Michael W. Masters Dec 1996

Reverse Engineering Of Computer-Based Navy Systems, Lonnie R. Welch, Guohui Yu, Binoy Ravindran, Franz J. Kurfess, Jorge Henriques, Mark Wilson, Antonio L. Samuel, Michael W. Masters

Computer Science and Software Engineering

The financial pressure to meet the need for change in computer-based systems through evolution rather than through revolution has spawned the discipline of reengineering. One driving factor of reengineering is that it is increasingly becoming the case that enhanced requirements placed on computer-based systems are overstressing the processing resources of the systems. Thus, the distribution of processing load over highly parallel and distributed hardware architectures has become part of the reengineering process for computer-based Navy systems.

This paper presents an intermediate representation (IR) for capturing features of computer-based systems to enable reengineering for concurrency. A novel feature of the IR …


Utilizing Bayesian Techniques For User Interface Intelligence, Robert A. Harrington Dec 1996

Utilizing Bayesian Techniques For User Interface Intelligence, Robert A. Harrington

Theses and Dissertations

The purpose of this research is to study the injection of an intelligent agent into modern user interface technology. This agent is intended to manage the complex interactions between the software system and the user, thus making the complexities transparent to the user. The background study will show that while interesting and promising research exists in the domain of intelligent interface agents, very little research has been published that indicates true success in representing the uncertainty involved in predicting user intent. The interface agent architecture presented in this thesis will offer one solution for solving the problem using a newly …


Implementation Of An Ada95 Crosscompiler For The Real-Time Executive For Military Systems (Rtems), Kendall M. Lemley Jr. Dec 1996

Implementation Of An Ada95 Crosscompiler For The Real-Time Executive For Military Systems (Rtems), Kendall M. Lemley Jr.

Theses and Dissertations

This thesis represents a continuation of the assessment of the Unified Telerobotics Architecture Project (UTAP), a proposed Air Force standard. This architecture was developed by the NASA Jet Propulsion Laboratory and the National Institute of Standards under contract to the Air Force Materiel Command Robotics and Automation Center of Excellence at Kelly AFB, Texas. Due to operating system constraints, the only UTAP implementation to date has required a separate software interface layer, adding complexity and overhead to the overall system, while reducing portability. This thesis proposes a long term effort to design and implement UTAP-compliant application software devoid of this …


Cross-Input Amortization Captures The Diffuse Adversary, Neal E. Young Dec 1996

Cross-Input Amortization Captures The Diffuse Adversary, Neal E. Young

Computer Science Technical Reports

Koutsoupias and Papadimitriou recently raised the question of how well deterministic on-line paging algorithms can do against a certain class of adversarially biased random inputs. Such an input is given in an on-line fashion; the adversary determines the next request probabilistically, subject to the constraint that no page may be requested with probability more than a fixed $\epsilon>0$. In this paper, we answer their question by estimating, within a factor of two, the optimal competitive ratio of any deterministic on-line strategy against this adversary. We further analyze randomized on-line strategies, obtaining upper and lower bounds within a factor of …


A Cscw Framework For Networked Multimodal Synthetic Environments, Chandrajit L. Bajaj, Fausto Berardini, Steven Cutchin, Raimund Merket Dec 1996

A Cscw Framework For Networked Multimodal Synthetic Environments, Chandrajit L. Bajaj, Fausto Berardini, Steven Cutchin, Raimund Merket

Department of Computer Science Technical Reports

No abstract provided.


Misplaced Trust: Kerberos 4 Session Keys, Bryn Dole, Steve Lodin, Eugene H. Spafford Dec 1996

Misplaced Trust: Kerberos 4 Session Keys, Bryn Dole, Steve Lodin, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Dynamic Scheduling Of Process Groups, Kuei Yu Wang, Dan C. Marinescu, Octavian F. Carbunar Dec 1996

Dynamic Scheduling Of Process Groups, Kuei Yu Wang, Dan C. Marinescu, Octavian F. Carbunar

Department of Computer Science Technical Reports

No abstract provided.


Secure Outsourcing Of Some Computations, Mikhail J. Atallah, Konstantinos N. Pantazopoulos, Eugene H. Spafford Dec 1996

Secure Outsourcing Of Some Computations, Mikhail J. Atallah, Konstantinos N. Pantazopoulos, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Knowledge Discovery In Computational Science: A Case Study In Algorithm Selection, N. Ramakrishnan, John R. Rice Dec 1996

Knowledge Discovery In Computational Science: A Case Study In Algorithm Selection, N. Ramakrishnan, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Efficient Parallel Algorithms On Reconfigurable Mesh Architectures, His-Chieh Lee, Fikret Ercal Dec 1996

Efficient Parallel Algorithms On Reconfigurable Mesh Architectures, His-Chieh Lee, Fikret Ercal

Computer Science Technical Reports

This dissertation describes a number of novel parallel algorithms for solving maze-routing problems and string matching problems on a proposed reconfigurable mesh architecture.

Section I reviews the field of reconfigurable parallel computing. This includes an introduction to a number of reconfigurable architectures proposed in the literature and a list of references to the current literature on algorithms in the field of reconfigurable computing.

Section II presents a number of time-efficient algorithms to solve the mazerouting problem. Maze-routing algorithms are used in VLSI routing and robot path planning. In that section, definitions for absolute shortest path (ASP), shortest duplex-path (SDP), shortest …


Export Database Derivation Approach For Supporting Object-Oriented Wrapper Queries, Ee Peng Lim, Hon-Kuan Lee Dec 1996

Export Database Derivation Approach For Supporting Object-Oriented Wrapper Queries, Ee Peng Lim, Hon-Kuan Lee

Research Collection School Of Computing and Information Systems

Wrappers export the schema and data of existing heterogeneous databases and support queries on them. In the context of cooperative information systems, we present a flexible approach to specify the derivation of object-oriented (OO) export databases from local relational databases. Our export database derivation consists of a set of extent derivation structures (EDS) which defines the extent and deep extent of export classes. Having well-defined semantics, the EDS can be readily used in transforming wrapper queries to local queries. Based on the EDS, we developed a wrapper query evaluation strategy which handles OO queries on the export databases. The strategy …


Master Of Science In Computing Technology In Education 1996, Nova Southeastern University Nov 1996

Master Of Science In Computing Technology In Education 1996, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 9, November 1996, College Of Engineering And Computer Science, Wright State University Nov 1996

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 9, November 1996, 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.


A Critique Of The Telecommunications Description Language (Ted), Brian J. Premore, David M. Nicol, Xiaowen Liu Nov 1996

A Critique Of The Telecommunications Description Language (Ted), Brian J. Premore, David M. Nicol, Xiaowen Liu

Computer Science Technical Reports

TeD is an object-oriented description language designed to facilitate the modeling of large scale telecommunication networks, with simulation on parallel and distributed platforms. TeD models are mapped to the Georgia Tech Time Warp engine (GTW) for execution. In this paper we outline the features of TeD, pointing out its strengths and identifying characteristics that gave us trouble as we used TeD to model detailed networks. Our issues are motivated specifically by a model of TCP and a model of multicast resource allocation. Our intention is to illustrate by example what TeD can do, and characteristics that a potential TeD user …