ppxscal/embedding_network huggingface dataset:
Analytical technique for gel treatment prediction of production and injection wells in a stratified reservoir
Authors: K. M. Fedorov, L. M. Kadochnikova, O. N. Pichugin, A. A. Chebakov
Venue: Iranian Journal of Science and Technology (2002)

This paper presents a simulator and an analytical technique for analysis of a gel treatment process, in a stratified oil reservoir. Calculations were performed with multicomponent 1-D simulator in each layer of a reservoir that has the facility to describe the gelation of Na2SiO3 + CaCl2 reagent due to high reservoir temperature (temperature initiation) or/and low pH value in a porous media. Kinetics of these reactions were analyzed in experiments and kinetic constants were obtained.Simplified axial problems of reagent propagation and gelation in near well water saturated zone of a reservoir were considered. Analytical solutions of linear problems in one isolated layer were obtained and analytical technique for simulation of a gel treatment in a stratified reservoir was generated. The proposed technique was tested by a comparison with three case histories of profile improvement in injection wells using a gel treatment.
Research and Development Needs for Advanced Vehicle Control Systems
Authors: Steven E. Shladover
Venue: IEEE Micro (1993)

The technical issues that the Advanced Vehicle Control Systems (AVCS) Committee of the Intelligent Vehicle Highway Society (IVHS) of America has identified as necessary to improve the performance of the surface transportation system are discussed. AVCSs represent the application of sensors, computers, and electromechanical actuators to provide drivers with warnings of hazards, assistance in controlling their vehicles, or fully automated control of vehicle motions. The constraints under which AVCS enabling technologies must be brought to maturity, such as cost, reliability, fault tolerance, and environmental hardening, combined with the basic performance requirements, are outlined. The enabling technologies for AVCS, subdivided into categories of sensors, communication, computation, electromechanical actuators, software and systems technologies, and special tools and facilities, are discussed. AVCS target products are reviewed.
Replay and Testing for Concurrent Programs
Authors: Richard H. Carver, Kuo-Chung Tai
Venue: IEEE Software (1991)

Attention is given to the problems that arise during the testing and debugging cycle of concurrent programs because of their nondeterministic execution behavior, whereby multiple executions of a concurrent program with the same input may exercise different synchronization sequences and even produce different results. These problems are solved by using deterministic execution debugging and testing. The purpose of deterministic execution debugging to to replay executions of a concurrent program so that debugging information can be collected. Examples of semaphores and monitors are used to illustrate the approach and the process of designing replay tubes is described. The use of regression testing to see if earlier debugging and testing introduced new errors, is examined.
Knowledge Engineering and University-Industry Cooperation
Authors: Larry R. Medsker, Judith H. Morrel
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors examine industrial needs and the university environment. They report the results of three years' work at creating a university-based laboratory for expert systems. They describe sample projects illustrating successes and failures at properly balancing the universities' role in technology transfer, and they suggest an approach enabling schools to develop significant relationships with outside groups. The authors believe that this approach will interest small and medium-sized companies, groups and departments in large corporations, secondary companies supporting large corporations, and universities seeking effective ways to interact with local industry.
A General-Purpose CMOS Associative Processor IC and System
Authors: Charles D. Stormon, Nikos B. Troullinos, Edward M. Saleh, Abhijeet V. Chavan, Mark R. Brule, John V. Oldfield
Venue: IEEE Micro (1992)

An associative processor architecture that integrates the functionality of content-addressable memory (CAM), functional memory (FM), and associative parallel processors (APPs) in a single-chip architecture is described. The hardware design, environment and applications of the Coherent Processor, a microchannel memory device designed by combining 16 such chips, are discussed. It is shown that the processor's writable control store permits quick execution of application-specific microcoded operations.
Extreme weight classes of de Bruijn sequences
Authors: Gregory L. Mayhew
Venue: Discrete Mathematics (2002)

Order n de Bruijn sequences are the period 2n binary sequences produced by an n stage feedback shift register, Properties of the number of sequences in the minimum and maximum weight classes of the generator functions are discussed.
Neural Net-Based H&infin; Control for a Class of Nonlinear Systems
Authors: Chun-Liang Lin, Tsai-Yuan Lin
Venue: Neural Processing Letters (2002)

A novel neural net-based approach for H&infin; control design of a class of nonlinear continuous-time systems is presented. In the proposed frameworks, the nonlinear system models are approximated by multilayer neural networks. The neural networks are piecewisely interpolated to generate a linear differential inclusion models by which a linear state feedback H&infin; control law can be constructed. It is shown that finding the permissible control gain matrices can be transformed to a standard linear matrix inequality problem and solved using the available computer software.
Learning from Our Mistakes with Defect Causal Analysis
Authors: David N. Card
Venue: IEEE Software (1998)

Defect causal analysis offers a simple, low-cost method for systematically improving the quality of software produced by a team, project, or organization. DCA takes advantage of one of the most widely available types of quality information-the software problem report. This information drives a team-based technique for defect causal analysis. The analysis leads to process changes that help prevent defects and ensure their early detection. Although some approaches to quality improvement involve exhaustive defect classification schemes or complex mathematical models, the approach I present relies on basic techniques that can be implemented readily by the typical software organization. The DCA process was developed at IBM 1 ; I adapted it for Computer Sciences Corporation 2 and other organizations. Three key principles drive the DCA approach. ý Reduce defects to improve quality. Although there are many different ideas about what quality is or which "-ility" is more important-reliability, portability, or what-ever- we can all probably agree that a product with many defects lacks quality, however you define it. Thus, we can improve software quality by focusing on the prevention and early detection of defects, a readily measurable software attribute.
Trends in Semiconductor Memories
Authors: Yasunao Katayama
Venue: IEEE Micro (1997)

Born at around the same time as the microprocessor, the DRAM has played an important role as a major semiconductor memory component of computer systems. In reviewing trends in the architecture of semiconductor memories, the present paper focuses particularly on DRAMs. It describes the architecture of the memory cell and the array, as well as the operation scheme, which brought the DRAM its present success but at the same time imposed limitations. Efforts to overcome the greatest limitation of the DRAMs' performance by increasing their speed and functionality are discussed in detail. We extrapolate the historical trend of DRAM development into the future and present arguments on high-speed DRAM and merged DRAM/logic issues.
Distributed Sorting on Local Area Networks
Authors: K. V. S. Ramarao
Venue: IEEE Transactions on Computers (1988)

A straight-line-topology local area network (LAN) to which a number of nodes are connected either in series or in parallel is considered. A file F is arbitrarily partitioned among these sites. The problem studied is that of rearranging the records of the file such that the keys of records at lower-ranking sites are all smaller than those at higher-ranking sites. Lower bounds on the worst-case communication complexity are given for both the series and parallel arrangements, and algorithms optimal for all networks and files are presented.
A Framework for Analysis of Data Quality Research
Authors: Richard Y. Wang, Veda C. Storey, Christopher P. Firth
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Organizational databases are pervaded with data of poor quality. However, there has not been an analysis of the data quality literature that provides an overall understanding of the state-of-art research in this area. Using an analogy between product manufacturing and data manufacturing, this paper develops a framework for analyzing data quality research, and uses it as the basis for organizing the data quality literature. This framework consists of seven elements: management responsibilities, operation and assurance costs, research and development, production, distribution, personnel management, and legal function. The analysis reveals that most research efforts focus on operation and assurance costs, research and development, and production of data products. Unexplored research topics and unresolved issues are identified and directions for future research provided.
Reusing Scan Chains for Test Pattern Decompression
Authors: Rainer Dorsch, Hans-Joachim Wunderlich
Venue: Journal of Electronic Testing: Theory and Applications (2002)

The paper presents a method for testing a system-on-a-chip by using a compressed representation of the patterns on an external tester. The patterns for a certain core under test are decompressed by reusing scan chains of cores idle during that time. The method only requires a few additional gates in the wrapper, while the mission logic is untouched. Storage and bandwidth requirements for the ATE are reduced significantly.
Figure-Ground Discrimination: A Combinatorial Optimization Approach
Authors: L. Hérault, R. Horaud
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The figure-ground discrimination problem is considered from a combinatorial optimization perspective. A mathematical model encoding the figure-ground discrimination problem that makes explicit a definition of shape based on cocircularity, smoothness, proximity, and contrast is presented. This model consists of building a cost function on the basis of image element interactions. This cost function fits the constraints of an interacting spin system that, in turn, is a well suited physical model that solves hard combinatorial optimization problems. Two combinatorial optimization methods for solving the figure-ground problem, namely mean field annealing, which combines mean field approximation theory and annealing, and microcanonical annealing, are discussed. Mean field annealing may be viewed as a deterministic approximation of stochastic methods such as simulated annealing. The theoretical bases of these methods are described, and the computational models are derived. The efficiencies of mean field annealing, simulated annealing, and microcanonical annealing algorithms are compared. Within the framework of such a comparison, the figure-ground problem may be viewed as a benchmark.
A Foundation of Solution Methods for Constraint Hierarchies
Authors: Hiroshi Hosobe, Satoshi Matsuoka
Venue: Constraints (2003)

Constraint hierarchies provide a framework for soft constraints, and have been applied to areas such as artificial intelligence, logic programming, and user interfaces. In this framework, constraints are associated with hierarchical preferences or priorities called strengths, and may be relaxed if they conflict with stronger constraints. To utilize constraint hierarchies, researchers have designed and implemented various practical constraint satisfaction algorithms. Although existing algorithms can be categorized into several approaches, what kinds of algorithms are possible has been unclear from a more general viewpoint. In this paper, we propose a novel theory called generalized local propagation as a foundation of algorithms for solving constraint hierarchies. This theory formalizes a way to express algorithms as constraint scheduling, and presents theorems that support possible approaches. A benefit of this theory is that it covers algorithms using constraint hierarchy solution criteria known as global comparators, for which only a small number of algorithms have been implemented. With this theory, we provide a new classification of solution criteria based on their difficulties in constraint satisfaction. We also discuss how existing algorithms are related to our theory, which will be helpful in designing new algorithms.
Easy handling of tectonic data: the programs TectonicVB for Mac and TectonicsFP for Windows
Authors: Hugo Ortner, Franz Reiter, Peter Acs
Venue: Computers Geosciences (2002)

TectonicVB for Macintosh and TectonicsFP for Windows TM operating systems are two menu-driven computer programs which allow the shared use of data on these environments. The programs can produce stereographic plots of orientation data (great circles, poles, lineations). Frequently used statistical procedures like calculation of eigenvalues and eigenvectors, calculation of mean vector with concentration parameters and confidence cone can be easily performed. Fault data can be plotted in stereographic projection (Angelier and Hoeppener plots). Sorting of datasets into homogeneous subsets and rotation of tectonic data can be performed in interactive two-diagram windows. The paleostress tensor can be calculated from fault data sets using graphical (calculation of kinematic axes and right dihedra method) or mathematical methods (direct inversion or numerical dynamical analysis). The calculations can be checked in dimensionless Mohr diagrams and fluctuation histograms.
Error Reporting with Graduated Color
Authors: Bruce Oberg, David Notkin
Venue: IEEE Software (1992)

A technique for nonintrusive error notification during programming that uses graduated color and elision, the temporary hiding of information, is described. Users can see errors and their age by the color and can look at the associated error explanation when they are not busy. Interruption is kept to a minimum during notification, and the explanation is close at hand and complete when it is wanted. The application of this technique to the Cornell synthesizer Generator is discussed, and sample generated displays are presented.
Finding What You Want: New Tools And Tricks
Authors: Susan Dumais
Venue: IEEE Software (1995)

The two last Interface columns discussed how to design pages for the World Wide Web. As more and more people create Web pages, it is getting increasingly difficult to find information ¿ even when you know exactly what you need. Susan T. Dumais is the director of the Information Sciences Research Group at Bellcore and has spent many years studying how people find things. Her hard-won experience can benefit anybody who designs systems that deal with more data than can be displayed on the screen at any one time.¿ Jakob Neilsen
Microsoft Word: Exam Guide (Certified Microsoft Office User), 1st edition
Authors: Jane Calabria, Dorothy Burke
Venue:  (1997)

:Exercises and review questions give readers step-by-step coverage of the topics included on the MOUS exams.Complete end user preparation for Microsoft s Word 97 Expert and Proficient User exams as part of Microsoft s new Certified Microsoft Office User programReviewed by Microsoft, will receive Official Microsoft Curriculum statusCovers all tested concepts and tasks and includes guided practice sections to help readers build confidence while studying for the exam
The Management of Probabilistic Data
Authors: D. Barbará, H. Garcia-Molina, D. Porter
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

It is often desirable to represent in a database, entities whose properties cannot be deterministically classified. The authors develop a data model that includes probabilities associated with the values of the attributes. The notion of missing probabilities is introduced for partially specified probability distributions. This model offers a richer descriptive language allowing the database to more accurately reflect the uncertain real world. Probabilistic analogs to the basic relational operators are defined and their correctness is studied. A set of operators that have no counterpart in conventional relational systems is presented.
Image-Browser Taxonomy and Guidelines for Designers
Authors: Catherine Plaisant, David Carr, Ben Shneiderman
Venue: IEEE Software (1995)

Building on user familiarity with one-dimensional scroll bars, many designers simply use two one-dimensional scroll bars when the application requires independent control over the horizontal and vertical directions, as in panning a map. This is effective if users frequently move in a single direction by small increments of less than one screen, but in many cases this solution is inadequate. The requirements of more complex applications suggests that more careful analysis, design, and evaluation might lead to significant improvements. Indeed, our exploration of existing 2D browsers has led us to identify many features and a wide variety of tasks performed with the browsers. Here we introduce an informal specification technique to describe 2D browsers and a task taxonomy, suggest design features and guidelines, and assess existing strategies.
VMW: A Visualization-Based Microarchitecture Workbench
Authors: Trung A. Diep, John Paul Shen
Venue: Computer (1995)

Single-chip microprocessors are achieving phenomenal performance due to advances being made in several enabling technologies. But this performance increase is accompanied by increasing processor complexity. The design of complex superscalar processors requires using sophisticated software tools, most notably simulators. Most existing simulators, however, suffer from three weaknesses. They lack retargetability, visualization support, and interactive control. This article describes the Visualization-Based Microarchitecture Workbench (VMW), which addresses these weaknesses. VMW enables a processor architect to efficiently and effectively explore the machine design space. A designer can use VMW to rigorously specify a new microarchitecture, automatically generate a performance simulator for the machine, and quickly assess machine performance. Performance data are machine-cycle accurate and can be viewed using a rich set of visualization instruments provided by VMW. Simulators for the DEC Alpha AXP 21064 and 21164, the IBM RS/6000, and the PowerPC 601and 620 microprocessors (and modifications and extensions of these machines) have been generated and executed. VMW has been demonstrated at a number of industrial sites, and its public domain distribution is planned.
Automated Support for Modeling OO Software
Authors: Kai Koskimies, Tarja Systä, Jyrki Tuomi, Tatu Männistö
Venue: IEEE Software (1998)

A basic problem of software development is how to derive executable software components from requirements, and how this process could be systematized. The object-oriented approach provides a common paradigm throughout the software development process from analysis to implementation, enabling a smooth shift from one phase to another and use of a wide spectrum of tools. Current object-oriented CASE tools support various graphical notations for modeling an application from different perspectives, for consistency checking between models, for storing models in a repository, and for generating documents and code from models. However, the level of built-in automation is relatively low as far as the actual development process is concerned. In object-oriented analysis and design, or OOAD, dynamic modeling aims at specifying the dynamic behavior of objects. For an object whose role is to control other objects, specification of its dynamic behavior can often be given in the form of a finite-state machine. A simple state machine consists of states associated with actions, and transitions associated with events. The actions of a state are executed when this state becomes the object's current state.
Delegation logic: A logic-based approach to distributed authorization
Authors: Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum
Venue: ACM Transactions on Information and System Security (TISSEC) (2003)

We address the problem of authorization in large-scale, open, distributed systems. Authorization decisions are needed in electronic commerce, mobile-code execution, remote resource sharing, privacy protection, and many other applications. We adopt the trust-management approach, in which "authorization" is viewed as a "proof-of-compliance" problem: Does a set of credentials prove that a request complies with a policy?We develop a logic-based language, called Delegation Logic (DL), to represent policies, credentials, and requests in distributed authorization. In this paper, we describe D1LP, the monotonic version of DL. D1LP extends the logic-programming (LP) language Datalog with expressive delegation constructs that feature delegation depth and a wide variety of complex principals (including, but not limited to, k-out-of-n thresholds). Our approach to defining and implementing D1LP is based on tractably compiling D1LP programs into ordinary logic programs (OLPs). This compilation approach enables D1LP to be implemented modularly on top of existing technologies for OLP, for example, Prolog.As a trust-management language, D1LP provides a concept of proof-of-compliance that is founded on well-understood principles of logic programming and knowledge representation. D1LP also provides a logical framework for studying delegation.
From Perturbation Analysis to Markov Decision Processes and Reinforcement Learning
Authors: Xi-Ren Cao
Venue: Discrete Event Dynamic Systems (2003)

The goals of perturbation analysis (PA), Markov decision processes (MDPs), and reinforcement learning (RL) are common: to make decisions to improve the system performance based on the information obtained by analyzing the current system behavior. In this paper, we study the relations among these closely related fields. We show that MDP solutions can be derived naturally from performance sensitivity analysis provided by PA. Performance potential plays an important role in both PA and MDPs; it also offers a clear intuitive interpretation for many results. Reinforcement learning, TD(&lambda;), neuro-dynamic programming, etc., are efficient ways of estimating the performance potentials and related quantities based on sample paths. The sensitivity point of view of PA, MDP, and RL brings in some new insight to the area of learning and optimization. In particular, gradient-based optimization can be applied to parameterized systems with large state spaces, and gradient-based policy iteration can be applied to some nonstandard MDPs such as systems with correlated actions, etc. Potential-based on-line approaches and their advantages are also discussed.
Memory Channel Network for PCI
Authors: Richard B. Gillett
Venue: IEEE Micro (1996)

A Cluster is a parallel computing system constructed by interconnecting standard computers. The parallel performance of a cluster is often limited by performance compromises in conventional high-performance networks. This article discusses the benefits of a more specialized networking approach and the resulting design of a low-cost, high-performance interconnect optimized specifically to enhance both the parallel performance and high-availability aspects of a cluster. This interconnect, Memory Channel for PCI, attaches to the industry-standard PCI bus found in most computers. The first-generation product, running on a standard Digital UNIX Cluster, can provide cluster communication latency and overhead improvements of 100 and 1000 times respectively compared to conventional networks.