ppxscal/embedding_network huggingface dataset:
Krylov-based Uzawa algorithms for the solution of the Stokes equations using discontinuous-pressure tetrahedral finite elements
Authors: François Bertrand, Philippe A. Tanguy
Venue: Journal of Computational Physics (2002)

The objective of this work is to develop an efficient and robust Krylov-based Uzawa algorithm for the solution of the 3D steady-state and unsteady-state Stokes equations with discontinuous-pressure tetrahedral finite elements. To this end, a class of preconditioned conjugate gradient Uzawa algorithms are presented and compared to those of the literature for other finite element types. A comparison is also made with an inexact Uzawa algorithm for the steady-state case. An analysis of the results obtained for various problems leads to an iterative scheme that is well adapted to the solution of Stokes problems of all sizes and complexities such as those found in industrial applications.
Sequential Decision Models for Expert System Optimization
Authors: Vijay S. Mookerjee, Michael V. Mannino
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Sequential decision models are an important element of expert system optimization when the cost or time to collect inputs is significant and inputs are not known until the system operates. Many expert systems in business, engineering, and medicine have benefited from sequential decision technology. In this survey, we unify the disparate literature on sequential decision models to improve comprehensibility and accessibility. We separate formulation of sequential decision models from solution techniques. For model formulation, we classify sequential decision models by objective (cost minimization versus value maximization) knowledge source (rules, data, belief network, etc.), and optimized form (decision tree, path, input order). A wide variety of sequential decision models are discussed in this taxonomy. For solution techniques, we demonstrate how search methods and heuristics are influenced by economic objective, knowledge source, and optimized form. We discuss open research problems to stimulate additional research and development.
Efficient Bulk-Loading of Gridfiles
Authors: Scott T. Leutenegger, David M. Nicol
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper considers the problem of bulk-loading large data sets for the gridfile multiattribute indexing technique. We propose a rectilinear partitioning algorithm that heuristically seeks to minimize the size of the gridfile needed to ensure no bucket overflows. Empirical studies on both synthetic data sets and on data sets drawn from computational fluid dynamics applications demonstrate that our algorithm is very efficient, and is able to handle large data sets. In addition, we present an algorithm for bulk-loading data sets too large to fit in main memory. Utilizing a sort of the entire data set it creates a gridfile without incurring any overflows.
Learning Bias in Neural Networks and an Approach to Controlling Its Effect in Monotonic Classification
Authors: N. P. Archer, S. Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

As a learning machine, a neural network using the backpropagation training algorithm is subject to learning bias. This results in unpredictability of boundary generation behavior in pattern recognition applications, especially in the case of small training sample size. It is suggested that in a large class of pattern recognition problems such as managerial and other problems possessing monotonicity properties, the effect of learning bias can be controlled by using multiarchitecture monotonic function neural networks.
Individualizing Neuroanatomical Atlases Using a Massively Parallel Computer
Authors: Gary E. Christensen, Michael I. Miller, Michael W. Vannier, Ulf Grenander
Venue: Computer (1996)

Generalized electronic atlases of the head, created from MRI scans and labeled by experts, are currently available, but they do not allow comparison between individuals or across populations without manual input or gross simplification. The algorithms in this research overcome those problems; they create individualized, subject-specific atlases. Once the deformable atlas is individualized, it can be used to analyze data sets by querying for regions of interest, structure volumes, locations and magnitudes of abnormalities, and so on. The inverse transformation can also be used to map data from the individual's coordinate system back to the atlas' standard coordinate system. Transforming data sets to the shape of the atlas anatomy removes individual anatomical shape variations, which is useful in comparing brain function between individuals.Synthesizing individualized atlases that accurately accommodate local anatomical shape variability has many exciting potential applications.
Efficient Reordering of Prolog Programs
Authors: M. M. Gooley, B. W. Wah
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

Prolog programs are often inefficient: execution corresponds to a depth-first traversal of an AND/OR graph; traversing subgraphs in another order can be less expensive. It is shown how the reordering of clauses within Prolog predicates, and especially of goals within clauses, can prevent unnecessary search. The characterization and detection of restrictions on reordering is discussed. A system of calling modes for Prolog, geared to reordering, is proposed, and ways to infer them automatically are discussed. The information needed for safe reordering is summarized, and which types can be inferred automatically and which must be provided by the user are considered. An improved method for determining a good order for the goals of Prolog clauses is presented and used as the basis for a reordering system.
What's in a Service?
Authors: Justin O'Sullivan, David Edmond, Arthur Ter Hofstede
Venue: Distributed and Parallel Databases (2002)

A proper understanding of the general nature, potential and obligations of electronic services may be achieved by examining existing commercial services in detail. The everyday services that surround us, and the ways in which we engage with them, are the result of social and economic interaction that has taken place over a long period of time. If we attempt to provide electronic services, and do not take this history into account, then we will fail. Any attempt to provide automated electronic services that ignores this history will deny consumers the opportunity to negotiate and refine, over a large range of issues, the specific details of the actual service to be provided. To succeed, we require a rich and accurate means of representing services. An essential ingredient of service representation is capturing the non-functional properties of services. These include the methods of charging and payment, the channels by which the service is requested and provided, constraints on temporal and spatial availability, service quality, security, trust and the rights attached to a service. Not only are comprehensive descriptions essential for useful service discovery, they are also integral to service management, enabling service negotiation, composition, and substitution. This paper builds on an understanding of services and their interactions, to outline the non-functional properties of services and their uses.
Selecting a Project's Methodology
Authors: Alistair Cockburn
Venue: IEEE Software (2000)

Different methodologies are inevitable, stemming directly from the questions of what constitutes a methodology and what are a methodology's underlying principles. Projects differ according to size, composition, priorities, and criticality. The people on a project have different biases based on their experiences, principles, and fears. These issues combine so that what is optimal differs across projects. This article describes principles for methodology selection, including when to go with a heavier or lighter methodology; a framework for methodology differentiation; and project experiences using these ideas.
Using A Defined and Measured Personal Software Process
Authors: Watts S. Humphrey
Venue: IEEE Software (1996)

The PSP is a defined family of processes that engineers can use to write module-sized programs. It is introduced with a one-semester graduate-level course where engineers develop ten programs and write five analysis reports. They practice various methods, obtain measurements, and analyze these measurements to help them understand and improve the way they work. This course has been taught in several universities and is being introduced in a number of industrial software organizations. While individual performance varies widely, data on 104 students and engineers show reductions of 58.0% in the average number of defects found per 1000 lines of code (KLOC) and reductions of 71.9% in the average number of defects per KLOC found in test. Estimating and planning accuracy are also improved while the average percentage improvement in lines of code developed per hour was 20.8%.
Line graphs of complete multipartite graphs have small cycle double covers
Authors: J. M. Fish, R. Klimmek, K. Seyffarth
Venue: Discrete Mathematics (2002)

It has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that bridgeless line graphs of complete graphs, complete bipartite graphs, and planar graphs have small cycle double covers. In this paper, we extend the result for complete bipartite graphs, and show that the line graph of any complete multipartite graph (other than K1,2) has a small cycle double cover.
Intelligent Cruise Control and Roadside Information
Authors: Ulf Palmquist
Venue: IEEE Micro (1993)

An onboard autonomous intelligent cruise control system which controls a vehicle's speed according to the driver's desire and the speed of and distance to the preceding vehicle is discussed. The system offers a one-directional short-range system for vehicle-vehicle and roadside-vehicle communication and considerations for recommended speed, limits, and traffic signals. It is a potential key element in linking and integrating the driver-vehicle-infrastructure in future intelligent transportation systems. Two field trials undertaken to determine the feasibility of the system are described.
The TMS390C602A Floating-Point Coprocessor for Sparc Systems
Authors: Merrick Darley, Bill Kronlage, Dvaid Bural, Bob Churchill, David Pulling, Paul Wang, Rick Iwamoto, Larry Yang
Venue: IEEE Micro (1990)

A recent Sparc (scalable processor architecture) processor consists of a two-chip configuration, containing the TMS390C601 integer unit (IU) and the TMS390C602A floating-point unit (FPU). The second device, an innovative coprocessor that lets the processor execute single- or double-precision floating-point instructions concurrently with IU operations is described. Dedicated floating-point hardware in the FPU increases the performance of the system. Running at clock periods as small as 20 ns, the chip should deliver 5.5 million double-precision floating-point operations per second under the Linpack benchmark (50-MHz clock rate). The FPU provides single- and double-precision arithmetic functions: addition, subtraction, multiplication, division, square root, compare, and convert. To minimize its math unit's latency, the FPU uses a highly parallel architecture requiring separate math units to optimize additions and multiplications. Traps stop the execution of a program to jump to software routine for handling data-dependent errors or to execute instructions not implemented in the hardware. Benchmark results are presented.
Application of combined thermal and electrical simulation for optimization of deep submicron interconnection systems
Authors: R. Streiter, H. Wolf, Z. Zhu, X. Xiao, T. Gessner
Venue: Microelectronic Engineering (2002)

The thermal and the electrical behavior of interconnects for the 100 nm and the 50 nm technology node have been investigated with regard to the application of advanced dielectric materials. Their low thermal conductivity causes different design limitations for dc and ac carrying interconnects. The maximum possible current density of dc lines is determined by a self-consistent approach considering both Joule heating and electromigration (EM). The temperature of signal lines is related to the position-dependent current density. Temperature increase of less than 20 K is found near the front end of the interconnects. At high frequencies transient electrical behavior is strongly influenced by parasitic line capacitance and inductance. The effect on line temperature is simulated.
The Hyper-deBruijn Networks: Scalable Versatile Architecture
Authors: E. Ganesan, D. K. Pradhan
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Both Hypercube and deBruijn networks possess desirable properties. It should beunderstood, though, that some of the attractive features of one are not found in theother. The architecture proposed in this paper is a combination of these architectures,providing some of the desirable properties of both the networks such as admitting manycomputationally important networks, flexibility in terms of connections per node as well as level of fault-tolerance. Also the network allows a simple VLSI layout, scalability as well as decomposability. Thus, these networks can be a potential candidate for VLSI multiprocessor networks. The proposed network possesses logarithmic diameter, optimalconnectivity, and simple routing algorithms amendable to networks with faults.Importantly, in addition to being pancyclic, these hyper-deBruijn networks admit mostcomputationally important subnetworks including rings, multidimensional meshes, complete binary trees, and mesh of trees with perfect dilation. Techniques for optimal one-to-all (OTA) broadcasting in these networks are presented. As an intermediate result, this technique provides the fastest OTA broadcasting in binary deBruijn networks as well. The recent renewed interest in binary deBruijn networks makes this later result valuable.
Delivering Consumer Health Information Digitally: A Comparison Between the Web and Touchscreen Kiosk
Authors: David Nicholas, Paul Huntington, Peter Williams
Venue: Journal of Medical Systems (2003)

Employing survey and web log data the study presented here compares the use and users of two digital health information platforms geared toward consumers&mdash;web-sites and touchscreen information kiosks. The kiosks featured are those supplied by InTouch With Health and the web-site is surgerydoor (some analysis of NHSDirect Online is also supplied). Problems of making direct comparisons between the two platforms are discussed and comparative figures provided. The two platforms were compared using the following metrics: page view time, session duration, number of sessions conducted, pages viewed per session, and topic/subject of pages viewed. Possible reasons for the differences between the two platforms are discussed, including the environment in which they are housed, the proximity of the platform to the user, the specific purpose of the individual platform, the different audiences served, the extent of delegation, the computer literacy of the audiences served, the quantity and comprehensiveness of the platform's information, and user's perceptions of authority. The research reminds and informs web-site and kiosk designers of the different audiences that they serve. The work reported here forms part of a Department of Health funded study which is evaluating digital health information provision to the consumer, in particular the use and impact of more than seventy heath kiosks located in all kinds of locations throughout the United Kingdom.
Lattice-automaton bioturbation simulator (LABS): implementation for small deposit feeders
Authors: Jae Choi, Fréderique Francois-Carcaillet, Bernard P. Boudreau
Venue: Computers Geosciences (2002)

A new model for biological activity and its effects in sediments is presented. Sediment is represented as a random 2D collection of solid and water "particles", distributed on a regular lattice with individually assigned chemical, biological and physical properties, e.g. food versus inert material. Model benthic organisms move through the lattice (the virtual sediment) as programmable entities, i.e., automatons, by displacing or ingesting-defecating particles. Each type of automaton obeys a different set of rules, both deterministic and stochastic, designed to mimic real infauna. In the present version of the model code, the organisms are simple small deposit feeders, resembling capitellids.The results from the model are 2D visualizations of the movement of the animals and the particles with time. The latter provide immediate appreciation of the consequences of animal actions on sediment fabric and composition, including both the mixing, traditionally associated with bioturbation, and the development of biologically-induced heterogeneities, which are observed in real sediments. The output is readily amenable to presentation as computer-generated (QuickTimeTM) movies, for which links are provided to such examples. As a particular case, we present a simulation of the mixing of a sand plug in a muddy sediment which shows that this is process not accomplished by counter-diffusion of sand and mud but by displacement and dilution of the sand with mud that is defecated as feces therein; this mode of mixing appears to be far more favorable to preservation of this sand feature than traditional diffusive models.
A Knowledge-Based Expert System for Computer-Assisted Indexing
Authors: Susanne M. Humphrey
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

A description is given the MedIndEx system, formerly known as the Indexing Aid (expert) system, which is currently under development. The objective of this project is to automate indexing of medical literature as much as possible by assisting indexers in selecting index terms and applying indexing rules, thereby facilitating expert indexing. Conventional thesaurus-based indexing is examined, followed by an explanation of knowledge representation using frames. Computer-assisted indexing with MedIndEx is then examined. The project's status and future plans are indicated.
Continuation-Based Multiprocessing
Authors: Mitchell Wand
Venue: Higher-Order and Symbolic Computation (1999)

Any multiprocessing facility must include three features: elementary exclusion, data protection, and process saving. While elementary exclusion must rest on some hardware facility (e.g., a test-and-set instruction), the other two requirements are fulfilled by features already present in applicative languages. Data protection may be obtained through the use of procedures (closures or funargs), and process saving may be obtained through the use of the catch operator. The use of catch, in particular, allows an elegant treatment of process saving.We demonstrate these techniques by writing the kernel and some modules for a multiprocessing system. The kernel is very small. Many functions which one would normally expect to find inside the kernel are completely decentralized. We consider the implementation of other schedulers, interrupts, and the implications of these ideas for language design.
Structured Development of Problem Solving Methods
Authors: D. Fensel, E. Motta
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Problem solving methods (PSMs) describe the reasoning components of knowledge-based systems as patterns of behavior that can be reused across applications. While the availability of extensive problem solving method libraries and the emerging consensus on problem solving method specification languages indicate the maturity of the field, a number of important research issues are still open. In particular, very little progress has been achieved on foundational and methodological issues. Hence, despite the number of libraries which have been developed, it is still not clear what organization principles should be adopted to construct truly comprehensive libraries, covering large numbers of applications and encompassing both task-specific and task-independent problem solving methods. In this paper, we address these ¿fundamental¿ issues and present a comprehensive and detailed framework for characterizing problem solving methods and their development process. In particular, we suggest that PSM development consists of introducing assumptions and commitments along a three-dimensional space defined in terms of problem-solving strategy, task commitments, and domain (knowledge) assumptions. Individual moves through this space can be formally described by means of adapters. In the paper, we illustrate our approach and argue that our architecture provides answers to three fundamental problems related to research in problem solving methods: 1) what is the epistemological structure and what are the modeling primitives of PSMs? 2) how can we model the PSM development process? and 3) how can we develop and organize truly comprehensive and manageable libraries of problem solving methods?
Construction of Check Sets for Algorithm-Based Fault Tolerance
Authors: D. Gu, D. J. Rosenkrantz, S. S. Ravi
Venue: IEEE Transactions on Computers (1994)

Algorithm-based fault tolerance (ABFT) is a popular approach to achieve fault and error detection in multiprocessor systems. The design problem for ABFT is concerned with the construction of a check set of minimum cardinality that detects a specified number of errors or faults. Previous work on this problem has assumed an a priori bound on the size of a check. We motivate and carry out an investigation of the problem without the bounded check size assumption. We establish upper and lower bounds on the number of checks needed to detect a given number of errors. The upper bounds are obtained through new schemes which are easy to implement, and the lower bounds are established using new types of arguments. These bounds are sharply different from those previously established under the bounded check size model. We also show that unlike error detection, the design problem for fault detection is NP-hard even for detecting only one fault.
Fault-Tolerant Real-Time Communication in Distributed Computing Systems
Authors: Qin Zheng, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

The delivery delay in a point-to-point packet switching network is difficult to control due to the contention among randomly-arriving packets at each node and multihops a packet must travel between its source and destination. Despite this difficulty, there are an increasing number of applications that require packets to be delivered reliably within prespecified delay bounds. This paper shows how this can be achieved by using real-time channels which make "soft" reservation of network resources to ensure the timely delivery of real-time packets. We first present theoretical results and detailed procedures for the establishment of real-time channels and then show how the basic real-time channels can be enhanced to be fault-tolerant using the multiple disjoint paths between a pair of communicating nodes. The contribution of the former is a tighter schedulability condition which makes more efficient use of network resources than any other existing approaches, and that of the latter is a significant improvement in fault tolerance over the basic real-time channel, which is inherently susceptible to component failures.