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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 6631 - 6660 of 6662

Full-Text Articles in Numerical Analysis and Scientific Computing

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

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


Optimal Mixed-Norm Control Synthesis For Discrete-Time Linear Systems, David R. Jacques Jun 1995

Optimal Mixed-Norm Control Synthesis For Discrete-Time Linear Systems, David R. Jacques

Theses and Dissertations

A mixed-norm approach to control synthesis for discrete time linear systems is developed. Specifically, the problem of minimizing the H2 norm of a transfer function, subject to a combination of ℓ1 and-or H norm constraints on dissimilar but related transfer functions is considered. The uniqueness of the optimal solution is shown, and numerical methods for approximating the optimal solution to within arbitrary accuracy are developed. These methods generally result in high order compensators which can not be implemented in most practical applications. In response to this, a numerical method is developed which solves for suboptimal solutions of …


Multiple Query Optimization With Depth-First Branch-And-Bound And Dynamic Query Ordering, Ee Peng Lim, Ahmet Cosar, Jaideep Srivastava Jan 1995

Multiple Query Optimization With Depth-First Branch-And-Bound And Dynamic Query Ordering, Ee Peng Lim, Ahmet Cosar, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., usually a single query gets transformed into a set of closely related database queries. Also, great benefits can be obtained by executing a group of related queries all together in a single unified multi-plan instead of executing each query separately. In order to achieve this Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subexpressions, joins, etc.) among a set of query plans and creates a single unified plan (multi-plan) which can be executed to obtain the required outputs for all queries at once. …


A Numerical Model To Predict The Fate Of Jettisoned Aviation Fuel, Karl D. Pfeiffer Dec 1994

A Numerical Model To Predict The Fate Of Jettisoned Aviation Fuel, Karl D. Pfeiffer

Theses and Dissertations

While airborne, military and civilian aircraft must occasionally jettison unburned aviation fuel into the atmosphere. This research investigates the fate of a jettisoned fuel (e.g. JP-4, JP-8, etc.) from initial release to final ground fall by numerically modeling the physical phenomena governing the fate of this fuel: evaporation, advection, and dispersion. Using previous work in evaporation and free fall of fuel droplets as a foundation, this thesis presents an integrated evaporation advection and dispersion model designed to run under the resources of a typical personal computer. This integrated model is capable of using near real-time meteorological data (i.e. vertical profiles …


A Load Distribution Through Competition For Workstation Clusters, Kam Hong Shum, Muslim Bozyigit Nov 1994

A Load Distribution Through Competition For Workstation Clusters, Kam Hong Shum, Muslim Bozyigit

Research Collection School Of Computing and Information Systems

The aim of this work is to develop a competition driven solution approach for load distribution in distributed computing system (DCS) environments. The subject DCS is composed of a set of workstation clusters. The study deals with concurrent applications, but assumes the existence of the independent tasks executing on individual workstations as well. Akin to conventional load balancing algorithms, the approach considers two phases; the partitioning phase and the mapping phase. Each phase is based on the application and the DCS data which is translated into market data, mainly price. The price is governed by the demand and supply of …


Multirate Time-Frequency Distributions, John R. O'Hair May 1994

Multirate Time-Frequency Distributions, John R. O'Hair

Theses and Dissertations

Multirate systems, which find application in the design and analysis of filter banks, are demonstrated to also be useful as a computational paradigm. It is shown that any problem which can be expressed a set of vector-vector, matrix-vector or matrix-matrix operations can be recast using multirate. This means all of numerical linear algebra can be recast using multirate as the underlying computational paradigm. As a non-trivial example, the multirate computational paradigm is applied to the problem of Generalized Discrete Time- Frequency Distributions GDTFD to create a new family of fast algorithms. The first of this new class of distributions is …


Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig Mar 1994

Automating Output Size And Reuse Metrics In A Repository-Based Computer-Aided Software Engineering (Case) Environment, R. D. Banker, Robert J. Kauffman, C. Wright, D. Zweig

Research Collection School Of Computing and Information Systems

Measurement of software development productivity is needed in order to control software costs, but it is discouragingly labor-intensive and expensive. Computer-aided software engineering (CASE) technologies-especially repository-based, integrated CASE-have the potential to support the automation of this measurement. We discuss the conceptual basis for the development of automated analyzers for function point and software reuse measurement for object-based CASE. Both analyzers take advantage of the existence of a representation of the application system that is stored within an object repository, and that contains the necessary information about the application system. We also discuss metrics for software reuse measurement, including reuse leverage, …


Visualizing Electrostatic Phenomena Using Mathematica, Eric Mayes Jan 1994

Visualizing Electrostatic Phenomena Using Mathematica, Eric Mayes

Journal of the Arkansas Academy of Science

A set of packages for visualizing electrostatic phenomena was developed using Mathematica as a programming language. These packages allow users to plot potential fields, equipotential lines, 2-D and 3-D vector fields in order to gain a visual understanding of electrostatic charges. They would be useful in accompanying undergraduate physics labs pertaining to electrostatics, as they would enable students to connect experiment with mathematics through open-ended visual exploration


A Parallel Computational Fluid Dynamics Unstructured Grid Generator, Deborah E. Davis Dec 1993

A Parallel Computational Fluid Dynamics Unstructured Grid Generator, Deborah E. Davis

Theses and Dissertations

This research addressed the development of a parallel computational fluid dynamics unstructured grid generator using Delaunay triangulation. The generator is applied to simple elliptical and cylindrical two-dimensional bodies. The methodologies used included Watsons point insertion algorithm, Holmes and Snyders point creation algorithm, a discretized surface definition, Andersons clustering function, and a Laplacian smoother. The first version of the software involved a processor boundary exchange at the end of each iteration with no inter-processor communications during the iterations The second version used inter-processor communication during each iteration instead of the boundary exchange. Version 1 demonstrated a speedup of 1.8 for some …


A Distributed Interactive Simulation Based Remote Debriefing Tool For Red Flag Missions, Michael T. Gardner Dec 1993

A Distributed Interactive Simulation Based Remote Debriefing Tool For Red Flag Missions, Michael T. Gardner

Theses and Dissertations

Air Force leaders, recognizing the need for improved training following the Vietnam War, implemented the Red Flag exercises at Nellis AFB. At the heart of this training is the Red Flag Measurement and Debriefing System RFMDS and its capability to accurately reconstruct the elements of an intense exercise fought over the deserts of Nevada. This thesis uses the technology of distributed interactive simulation DIS to transmit aircraft telemetry onto computer networks, allowing the monitoring and analysis of live Red Flag missions at any site with compatible communications equipment and thesis software. The use of standard DIS protocols enables simulators to …


Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava Dec 1993

Asynchronous Transaction Commitment In Federated Database Systems, San-Yih Hwang, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

We propose a new (and restricted) model for global transactions which allows asynchronous commitment of subtransactions. Our model requires each global transaction to have a fixed structure with update to the data in at most one database. Based on this transaction model, we present two concurrency control algorithms, namely Asynchronous Site Graph and Asynchronous VirtGlobalSG, which employ asynchronous commitment and achieve global serializability. Compared to other proposed algorithms, our algorithms employ asynchronous commitment so as to increase transaction performance. Furthermore, our algorithms do not put restrictions on transaction data access or local histories.


A Numerical Study Of High-Speed Missile Configurations Using A Block- Structured Parallel Algorithm, Douglas C. Blake Dec 1993

A Numerical Study Of High-Speed Missile Configurations Using A Block- Structured Parallel Algorithm, Douglas C. Blake

Theses and Dissertations

A numerical analysis of the aerodynamic phenomena associated with the high-speed flight of a sharp-nosed, four-finned, high-fineness ratio missile using a block-structured, parallel computer algorithm is presented. The algorithm, PANS-3EM, utilizes a second-order-accurate, shock-capturing, Total Variation Diminishing scheme and incorporates a Baldwin-Lomax turbulence model. PANS-3EM allows for extreme flexibility in the choice of computational domain decomposition and computing machine of implementation. Developmental work consists of conceptualization and verification of the algorithm as well as parallel performance and scalability studies conducted on a variety of computing platforms. Using PANS-3EM, the aerodynamic characteristics of the missile are investigated. Drag and pitching moment …


Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava Nov 1993

Query Optimization And Processing In Federated Database Systems, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

No abstract provided.


Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava Nov 1993

Multiple Query Optimization With Depth-First Branch-And-Bound, Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., a single query can be transformed into a set ofclosely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unijied multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subezpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs forall queries at once. In this paper, …


Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava Sep 1993

Entity Identification In Database Integration: An Evidential Reasoning Approach, Ee Peng Lim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

Entity identification is the problem of matching object instances from different databases which correspond to the same real-world entity. In this paper, we present a 2-step entity identification process in which attributes for matching tuples may be missing in certain tuples, and thus need to be derived prior to the matching. To match tuples, we require identity rules which specify the conditions to be satisfied by a pair of tuples, from different databases, before they can be considered as modeling the same real-world entity. We also introduce ILFD's (instance-level functional dependencies) as a form of inference rules which derive the …


Real Time Texture Analysis From The Parallel Computation Of Fractal Dimension, Halford I. Hayes Jr. Jul 1993

Real Time Texture Analysis From The Parallel Computation Of Fractal Dimension, Halford I. Hayes Jr.

Computer Science Theses & Dissertations

The discrimination of texture features in an image has many important applications: from detection of man-made objects from a surrounding natural background to identification of cancerous from healthy tissue in X-ray imagery. The fractal structure in an image has been used with success to identify these features but requires unacceptable processing time if executed sequentially.

The paradigm of data parallelism is presented as the best method for applying massively parallel processing to the computation of fractal dimension of an image. With this methodology, and sufficient numbers of processors, this computation can reach real time speeds necessary for many applications. A …


Assessment Of The Accuracy Of Three Methods Of Computerized Growth Prediction Of The Soft Tissue Profile, In Untreated Individuals, Pat Diciccio Jun 1993

Assessment Of The Accuracy Of Three Methods Of Computerized Growth Prediction Of The Soft Tissue Profile, In Untreated Individuals, Pat Diciccio

Loma Linda University Electronic Theses, Dissertations & Projects

This study was performed to determine the accuracy and reliability of the long range growth predictions for profile structures by three computer software systems (QuickCeph™ for Apple Macintosh™ systems. Rocky Mountain Data Systems™ for IBM™ mainframe systems, and Facial Print™ for IBM™ personal computers), on untreated individuals. The total sample consisted of 90 Caucasian children from the Burlington Growth Centre. These were subdivided into groups of 15 children in each of mesiofacial, dolichofacial, and brachyfacial growth types for both males and females, with Angle class I occlusions, normal overbite, and normal overjet. Points measured consisted of 14 skeletal and soft …


Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson Apr 1993

Entity Identification In Database Integration, Ee Peng Lim, Jaideep Srivastava, Satya Prabhakar, James Richardson

Research Collection School Of Computing and Information Systems

The objective of entity identification is to determine the correspondence between object instances from more than one database. Entity identification at the instance level, assuming that schema level heterogeneity has been resolved a priori, is examined. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. The use of extended key, which is the union of keys, and possibly other attributes, from the relations to be matched, and its corresponding identify rule are proposed to determine the equivalence …


Repository Evaluation Of Software Reuse: An Empirical Study, R. D. Banker, Robert J. Kauffman, D. Zweig Jan 1993

Repository Evaluation Of Software Reuse: An Empirical Study, R. D. Banker, Robert J. Kauffman, D. Zweig

Research Collection School Of Computing and Information Systems

The use and benefits of repository evaluation of software reuse are illustrated through an analysis of the evolving repositories of two large firms that recently implemented integrated CASE development tools. The analysis shows that these tools have supported high levels of software reuse, but it also suggests that there remains considerable unexploited reuse potential. The findings indicate that organizational changes will be required before the full potential of the new technology can be realized.


Multiple Learner Systems Using Resampling Methods, Binyun Xie Aug 1992

Multiple Learner Systems Using Resampling Methods, Binyun Xie

Computer Science Theses & Dissertations

The N-Learners Problem deals with combining a number of learners such that the resultant system is "better", under some criterion, than the best of the individual learners. We consider a system of probably approximately correct concept learners. Depending on the available information, there are several methods to make the composite system better than the best of the individual learners. If a sample and an oracle that generates data points (but, not their classification) is available, then we show that we can achieve arbitrary levels of the normalized confidence of the composite system if (a) a robust learning algorithm is available, …


Single Object Detection Using Multiple Sensors With Unknown Noise Distributions, Shaofen Chen May 1992

Single Object Detection Using Multiple Sensors With Unknown Noise Distributions, Shaofen Chen

Computer Science Theses & Dissertations

We consider the design of an object classification system that identifies single objects using a system of sensors; each sensor outputs a random vector, according to an unknown (noise) probability distribution, in response to a sensed object. We consider a special class of systems, called the linearly separable systems, where the error-free sensor outputs corresponding to distinct objects can be mapped into disjoint intervals on real line. Given a set of sensor outputs corresponding to known objects, we show that a detection rule αemp that approaches the correct rule with a high probability can be computed. We show …


Methods For Calculating Solar Position And Day Length Including Computer Programs And Subroutines, M L. Roderick Jan 1992

Methods For Calculating Solar Position And Day Length Including Computer Programs And Subroutines, M L. Roderick

Resource management technical reports

The theory of calculating solar position is described. Using this theory, a number of computing routines are prepared in the C programming language. These routines are suitable for users who program in C, and have an ANSI compatible C compiler. These routines are fully documented, with both the underlying theory, and code particulars, and may be used as a stand alone reference. The source code has also been published in appendix B of the report.


Shadow Casting Phenomena At Newgrange, Frank Prendergast Jan 1991

Shadow Casting Phenomena At Newgrange, Frank Prendergast

Articles

A digital model of the Newgrange passage tomb and surrounding ring of monoliths known as the Great Circle is used to investigate sunrise shadow casting phenomena at the monument. Diurnal variation in shadow directions and lengths are analysed for their potential use in the Bronze Age to indicate the passage of seasonal time. Computer-aided simulations are developed from a photogrammetric survey to accurately show how three of the largest monoliths, located closest to the tomb entrance and archaeologically coded GC1, GC-1 and GC-2, cast their shadows onto the vertical face of the entrance kerbstone, coded K1. The phenomena occur at …


Data Acquisition And Control Program For Chromatographic And Spectroscopic Studies, M. Keith Hudson, William G. Hood, Robert Henson Jan 1990

Data Acquisition And Control Program For Chromatographic And Spectroscopic Studies, M. Keith Hudson, William G. Hood, Robert Henson

Journal of the Arkansas Academy of Science

An IBMPC compatible computer was interfaced to an Ithaco 3962 lock-in-amplifier. The computer controlled the functions of the lock-in-amplifier, acquired and stored data, and allowed for real time or off-line processing of data. Computer/amplifier connection was made via RS-232-C serial interface. Programmed in Microsoft Quick BASIC, the computer assumed the role of a dedicated chromatographic integrator. This reduced the overall instrumentation expense by eliminating a dedicated chromatographic integrator. The computer program supplied much greater flexibility in control and data interpretation. To show its utility, the program was applied to a study of the infrared emission from a flame upon the …


Impact Of Microprocessor Protected Mode Programming On Undergraduate Education N Engineering Technology, Robert L. Douglas Jan 1990

Impact Of Microprocessor Protected Mode Programming On Undergraduate Education N Engineering Technology, Robert L. Douglas

Journal of the Arkansas Academy of Science

No abstract provided.


An Interval Newton Method, E R. Hansen, R I. Greenberg May 1983

An Interval Newton Method, E R. Hansen, R I. Greenberg

Computer Science: Faculty Publications and Other Works

We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three subalgorithms. The first is a Gauss-Seidel-type step. The second is a real (noninterval) Newton iteration. The third solves the linearized equations by elimination. We explain why each subalgorithm is desirable and how they fit together to provide solutions in as little as one-third or one-quarter the time required by Krawczyk's method [7] in our implementations.


A Direct Formulation And Computer-Implementation Of A Symbolic Network Analysis Algorithm, Timothy James Knerr Oct 1981

A Direct Formulation And Computer-Implementation Of A Symbolic Network Analysis Algorithm, Timothy James Knerr

Electrical & Computer Engineering Theses & Dissertations

An algorithm for the symbolic analysis of linear, time-invariant, active or passive networks is presented. The algorithm incorporates the best features of earlier numerical and topological methods of symbolic analysis. A hybrid set of equations is formulated for a closed linear graph and arranged in matrix form. A numerical evalu­ation procedure for the determinant of this hybrid matrix results in an efficient method of symbolic analysis. A proof of the algorithm based on determinant evaluation by a permutation product expansion provides insight into relationships with other methods of symbolic analysis. A computer program implementation of the algorithm is described and …


Effects Of Changes In Surface Water Regime And/Or Land Use On The Vertical Distribution Of Water Available For Wetland Vegetation: Dynamic Model Of The Zone Of Aeration (Appendix To Part 1 Of Completion Report For Project A-023-Ark), Robert N. Maccallum, R. A. Sims Jun 1980

Effects Of Changes In Surface Water Regime And/Or Land Use On The Vertical Distribution Of Water Available For Wetland Vegetation: Dynamic Model Of The Zone Of Aeration (Appendix To Part 1 Of Completion Report For Project A-023-Ark), Robert N. Maccallum, R. A. Sims

Arkansas Water Resources Center Technical Reports

Appendix to Part 1 of Completion Report for Project A-023-ARK


Using A Prediction Model In Forecasting Appeals, Paul A. Rake Apr 1977

Using A Prediction Model In Forecasting Appeals, Paul A. Rake

IUSTITIA

Following the 1972 reorganization of the Indiana Court of Appeals into three panels serving defined geographical districts, the Court soon found itself floundering with too many unevenly distributed cases. Lacking a sufficient base of statistical data from which to formulate a plan to cope with the problem, various proposals, including redistricting the court, adding more judges, and developing a more sophisticated staff research, could not be measured for effectiveness or advisability.

In response to these problems, the Court developed a project to deal with the future caseload by constructing a regression model to predict appeals. This model generated estimates of …


Cephalometrics For The Oral Surgeon In The Diagnosis Of Facial Deformities, Frederick J. Mantz Jun 1973

Cephalometrics For The Oral Surgeon In The Diagnosis Of Facial Deformities, Frederick J. Mantz

Loma Linda University Electronic Theses, Dissertations & Projects

Surgical orthodontics presents a challenge to the oral surgeon. By the nature of the oral surgeon's training and discipline he should be the one best qualified to treat the surgical aspect of the surgical orthodontic case. The establishment of a proper diagnosis and means of communication between the oral surgeon and orthodontist are essential in achieving a good final result for the surgically treated case. Fortunately, a scientific method of diagnosis is available that can provide both specialties with a common language. Computerized cephalometric analysis can provide the diagnosis and link of communication for the discussion of goals and treatment. …