ppxscal/embedding_network huggingface dataset:
Two-point declustering for weighting data pairs in experimental variogram calculations
Authors: Andrew Richmond
Venue: Computers Geosciences (2002)

The primary goal of calculating experimental variograms in kriging studies is to estimate the required variogram model. The destructuring effect of preferentially clustered data on the sample variogram is well-known but rarely considered in their experimental calculation and modelling due to a lack of suitable two-point declustering methods. This paper presents two methods of declustering that can be used to weight data pairs in experimental variogram calculations. Firstly, the traditional cell declustering method is extended to the two-point case, and secondly, data location clusters are identified and then explicitly used to determine declustering weights for data pairs. Experimental variograms calculated for a small, preferentially clustered and strongly positively skewed dataset show structural improvement when the two-point declustering weights are considered, resulting in significant changes to the estimated variogram model. Computer programs that implement the proposed two-point declustering and experimental variogram weighting techniques are presented.
Robust Distributed Computing and Sensing Algorithm
Authors: Richard R. Brooks, S. Sitharama Iyengar
Venue: Computer (1996)

Sensors that supply data to computer systems are inherently unreliable. When sensors are distributed, reliability is further compromised. How can a system tell good sensor data from faulty? In this article, we describe a hybrid algorithm we developed that satisfies both the precision and accuracy requirements of distributed systems. We used established methods for distributed agreement based on data of limited accuracy. Our hybrid algorithm is suitable for use in both environments and manages to provide increased precision for distributed decision-making without adversely affecting system accuracy. The hybrid algorithm effectively solves the problem of making the correct decision in the presence of faulty data, enhancing both accuracy and precision.
Reengineering with Reflexion Models: A Case Study
Authors: Gail C. Murphy, David Notkin
Venue: Computer (1997)

Reengineering large and complex software systems is often very costly. Reflexion models let software engineers begin with a structural high-level model that they can selectively refine to rapidly gain task-specific knowledge about the source code. In this article we give an overview of our technique and then relate how a Microsoft engineer used it to aid an experimental reengineering of Excel-a product that comprises about 1.2 million lines of C code. Our technique begins with a high-level model, which users define on the basis of a desired software engineering task. Thus, the next steps in our technique are to extract a model of the source, define a map, and, through a set of computation tools, compare the two models. This lets software engineers effectively validate their high-level reasoning with information from the source code. To satisfy the need for a quick and inexpensive method, we made the technique "lightweight" and iterative. The user can easily and rapidly access the structural information of interest and can balance the cost of refinement with the potential benefits of a more complete and accurate model. The engineer in our case study-a developer with 10-plus years at Microsoft-specified and computed an initial reflexion model of Excel in a day and then spent four weeks iteratively refining it. He estimated that gaining the same degree of familiarity with the Excel source code might have taken up to two years with other available approaches. The experimental reengineering case study shows that our technique has practical application. First, the engineer chose to use the technique even when facing extreme pressure. Second, he continued to use the technique beyond the original time (one month) to refine additional parts of the reflexion model for Excel and to compute reflexion models for successive Excel versions. Finally, the engineer stated that the slowdowns he did encounter while performing the experimental reengineering were often due to a lack of up-front understanding. Had the reflexion model technique been used more during planning, he felt that he might have understood the product better to begin with. We believe our technique was successful in large part because it uses approximation. This ensures a smooth feedback from the time invested in applying the technique to the results. The more time the Microsoft engineer spent refining the map, the more information he derived. Although this curve is not completely smooth, the engineer was able to gauge the accuracy of the results and use that information to manage the time and effort invested in using the technique.
Robust Factorization
Authors: Henrik Aanæs, Rune Fisker, Kalle Åström, Jens Michael Carstensen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Factorization algorithms for recovering structure and motion from an image stream have many advantages, but they usually require a set of well-tracked features. Such a set is in generally not available in practical applications. There is thus a need for making factorization algorithms deal effectively with errors in the tracked features. We propose a new and computationally efficient algorithm for applying an arbitrary error function in the factorization scheme. This algorithm enables the use of robust statistical techniques and arbitrary noise models for the individual features. These techniques and models enable the factorization scheme to deal effectively with mismatched features, missing features, and noise on the individual features. The proposed approach further includes a new method for Euclidean reconstruction that significantly improves convergence of the factorization algorithms. The proposed algorithm has been implemented as a modification of the Christy-Horaud factorization scheme, which yields a perspective reconstruction. Based on this implementation, a considerable increase in error tolerance is demonstrated on real and synthetic data. The proposed scheme can, however, be applied to most other factorization algorithms.
DFT and BIST of a Multichip Module for High-Energy Physics Experiments
Authors: Alfredo Benso, Silvia Chiusano, Paolo Prinetto
Venue: IEEE Design Test (2002)

Engineers at Politecnico di Torino designed a multichip module for high-energy physics experiments conducted on the Large Hadron Collider. An array of these MCMs handles multichannel data acquisition and signal processing. Testing the MCM from board to die level required a combination of DFT strategies.
Data Partition and Parallel Evaluation of Datalog Programs
Authors: Weining Zhang, Ke Wang, Siu-Cheung Chau
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Parallel bottom-up evaluation provides an alternative for the efficient evaluation of logic programs. Existing parallel evaluation strategies are neither effective nor efficient in determining the data to be transmitted among processors. In this paper, we propose a different strategy, for general Datalog programs, that is based on the partitioning of data rather than that of rule instantiations. The partition and processing schemes defined in this paper are more general than those in existing strategies. A parallel evaluation algorithm is given based on the semi-naive bottom-up evaluation. A notion of potential usefulness is recognized as a data transmission criterion to reduce, both effectively and efficiently, the amount of data transmitted. Heuristics and algorithms are proposed for designing the partition and processing schemes for a given program. Results from an experiment show that the strategy proposed in this paper has many promising features.
The Basics of Performance-Monitoring Hardware
Authors: Brinkley Sprunt
Venue: IEEE Micro (2002)

Performance-monitoring features provide data that describe how an application and the operating system are performing on the processor. this information can guide efforts to improve performance.
Trust-Based Security in Pervasive Computing Environments
Authors: Lalana Kagal, Tim Finin, Anupam Joshi
Venue: Computer (2001)

Pervasive computing systems require a security architecture based on trust rather than just user authentication and access control.
New Techniques for Deterministic Test Pattern Generation
Authors: Ilker Hamzaoglu, Janak H. Patel
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper presents new techniques for speeding up deterministic test pattern generation for VLSI circuits. These techniques improve the PODEM algorithm by reducing number of backtracks with a low computational cost. This is achieved by finding more necessary signal line assignments, by detecting conflicts earlier, and by avoiding unnecessary work during test generation. We have incorporated these techniques into an advanced ATPG system for combinational circuits, called ATOM. The performance results for the ISCAS85 and full scan version of the ISCAS89 benchmark circuits demonstrated the effectiveness of these techniques on the test generation performance. ATOM detected all the testable faults and proved all the redundant faults to be redundant with a small number of backtracks in a short amount of time.
Pattern-Addressable Memory
Authors: Ian N. Robinson
Venue: IEEE Micro (1992)

The pattern associative memory (PAM), a custom associative memory chip specialized to handle the syntax and associated pattern-matching rules common to a range of symbolic processing applications, is discussed. The applications of particular interest are those in which runtime information is captured in the form of a database of declarative expressions. The structure and functioning of an array of these chips, which forms an associative coprocessor for a workstation are described. PAM implementation is addressed.
Using Constraints for Efficient Query Processing in Nondeterministic Databases
Authors: Kumar Vadaparty, Shamim Naqvi
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Nondeterministic databases store disjunctive data using OR-objects. For example, data such as ¿Part#1 is implementable using Nickel or Cobalt¿ is stored as Implement(Part#1, o1) where Dom(o1) ={Nickel, Cobalt} is the domain of the OR-object o1. A possible world of a database is obtained by replacing every OR-object by a member from its domain, and it is said to be conforming if it satisfies all the FDs (functional dependencies) associated with the database. A database D is said to fully incorporate a set ${\cal F}$ of FDs if every possible world of D is conforming. This paper studies the problem of preprocessing databases to achieve full incorporation, and also the problem of incrementally maintaining a database fully incorporated under insertions and deletions.We first define a certain property called goodness of a class ${\cal D}$ of databases for a set ${\cal F}$ of FDs; goodness can be tested efficiently and enforced easily at schema design time.For any class ${\cal D}$ of databases that is good for ${\cal F}$, we present: 1) a quadratic time algorithm for fully incorporating ${\cal F}$, 2) efficient algorithms for maintaining full incorporation under updates, and 3) lower-bounds for the algorithms of 1) and 2). Next, we show that, for classes of databases that are not good, the problem of full incorporation is, in general, coNP-complete. We also examine the complexity when OR-objects are restricted to have no more than two members, and obtain some interesting tractable algorithms, and intractability results.
Feedback-Invariant Optimal Control Theory and Differential Geometry, II. Jacobi Curves for Singular Extremals
Authors: A. A. Agrachev
Venue: Journal of Dynamical and Control Systems (1998)

This is the second article in the series that began in &lsqb;4&rsqb;. Jacobi curves were defined, computed, and studied in that paper for regular extremals of smooth control systems. Here we do the same for singular extremals. The last section contains a feedback classification and normal forms of generic single-input affine in control systems on a 3-dimensional manifold.
An Architectural Framework for Supporting Heterogeneous Instruction-Set Architectures
Authors: Gabriel M. Silberman, Kemal Ebcioglu
Venue: Computer (1993)

An architectural framework that allows software applications and operating system code written for a given instruction set to migrate to different, higher performance architectures is described. The framework provides a hardware mechanism that enhances application performance while keeping the same program behavior from a user perspective. The framework is designed to accommodate program exceptions, self-modifying code, tracing, and debugging. Examples are given for IBM System/390 operating-system code and AIX utilities, showing the performance potential of the scheme using a very long instruction word (VLIW) machine as the high-performance target architecture.
Portable, Parallelizing Pascal Compiler
Authors: Eran Gabber, Amir Averbuch, Amiram Yehudai
Venue: IEEE Software (1993)

The structure and implementation of P/sup 3/C, a compiler that uses relatively simple parallelization techniques to produce highly efficient code for both shared-memory and distributed-memory MIMD multiprocessors, are discussed. P/sup 3/C is a fully automatic, portable parallelizing Pascal compiler for scientific code, which is characterized by loops operating on regular data structures. P/sup 3/C compiles the same source code to all target machines without modification. P/sup 3/C gives an accurate estimate about whether the parallel code will actually reduce execution time over serial code, taking into account the associated overhead. It derives the estimate by statically analyzing the program at compile time, referring to a table of the target machine's parameters. Speedups of up to 24 have been achieved on a Sequent Symmetry with 25 active processors. The estimated speedup was within 8% of the actual figure.
PIAF: Efficient IC Floor Planning
Authors: Marwan A. Jabri, David J. Skellern
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors present a method for selecting an efficient rectangular topology for IC floor plans. PIAF's floor-planning strategy separates generation and testing, which greatly reduces solution space and confines domain knowledge. Consequently, they have exploited concepts of functional and physical design representation to extract domain knowledge. The authors introduce and discuss IC design-tool limitations. PIAF's structure, its floor-planning strategy, implementations of its KBS tasks, and its context structure are regarded as unique. The authors conclude that although PIAF is still experimental, its good results prove that IC floor planning is a successful application domain for knowledge-based programming techniques.
Overview of the Jasmin database machine
Authors: Daniel H Fishman, Ming-Yee Lai, W Kevin Wilkinson
Venue: ACM SIGMOD Record (1984)

The Jasmin database machine is being implemented as part of a research project in distributed processing and database management A primary goal of the work is to demonstrate the feasibility of a practical multiprocessor database machine suitable for large database, high transaction-rate applications Key features of Jasmin are its configurable performance, its use of off-the-shelf parts, and its ability to handle distributed databases A uniprocessor prototype of Jasmin has already been completed and the multiprocessor version is planned for later this year In this paper we describe Jasmin's architecture and discuss the performance observed in the uniprocessor prototype
Evaluation of (hfac)Cu(MHY) for Cu CVD
Authors: M. Joulaud, C. Angekort, P. Doppelt, T. Mourier, D. Mayer
Venue: Microelectronic Engineering (2002)

Copper deposition using (hfac)Cu(MHY) (Gigacopper®) for interconnections metallization by Cu CVD is presented. We compared it to (hfac)Cu(VTMS) (Cupraselect®) in terms of deposition rate, specific resistivity and uniformity. Gigacopper® appears to give a higher deposition rate than Cupraselect® and about the same specific resistivity. Water addition is a critical point. It permits improved uniformity and specific resistivity provided it is added during the nucleation step in a very precise volume. We also studied the influence of other parameters, such as precursor flow rate and reactor pressure, on the film deposition. The use of Cu CVD as seed layer for Cu ECD depositions was also explored on full sheet wafers. Adhesion can be greatly enhanced by a specific anneal procedure with a slow cool down to limit stresses in the film.
Static Processor Allocation in a Soft Real-Time Multiprocessor Environment
Authors: B. M. Carlson, L. W. Dowdy
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Soft real-time environments consist of jobs that must receive service within a particulartime interval. If service for a specific job is not completed by the end of its time interval,it is said to be lost; in addition, the computation time expended on the job is wasted, andany further computation for the job is discontinued. The goal of a system designer is toprovide an environment that minimizes the number of jobs that are lost. If a parallelenvironment is available, the system designer has two options: Allow each processor toexecute a job individually, or let multiple processors cooperate in executing a job. Thisarticle shows, for two classes of static allocation policies, that simple comparativeanalytical models may be used to indicate which option minimizes the number of lost jobs, as a function of workload intensity. The first class of policies, called equal partitions, statically decomposes the system into equal-size sets of processors and executes one job per partition. These policies are frequently employed in other contexts. The second class of policies, called two partitions, statically partitions the processors into two sets, not necessarily of the same size. Surprisingly, it is observed mathematically that even for statistically identical jobs, this class of policies is superior to equal partitions under certain loadings. The analysis is validated experimentally with a workload executed on a 16-node iPSC/2 hypercube.
Implementation of the V60/V70 and its FRM Function
Authors: Shinya Kimura, Yasuhiko Komoto, Yoichi Yano
Venue: IEEE Micro (1988)

A description is given of the V60/V70, the first commercially based, general-purpose 32-bit microprocessor in Japan. Its functions include on-chip floating-point operations, a high-level-language-oriented architecture, software debugging support, and support functions to promote a high level of system reliability. Because high reliability is so important, the V60/V70 contains functional redundancy monitoring (FRM) support functions. The discussion covers the overall design considerations, architecture, implementation, hazard detection and control, and FRM functions. The V60/V70 uses a TRON real-time operating system specification.
Doubly &beta;-Derived Translation Planes
Authors: V. Abatangelo, B. Larato
Venue: Designs, Codes and Cryptography (2003)

Existence and uniqueness of a doubly &beta;-derived translation plane of order 49 are proved. Furthermore, we give a complete classification of those translation planes of order 49 which can be obtained from the desarguesian plane &Pi; of order 49 by a mixed double derivation, namely by applying a &beta;-derivation on &Pi; and a classical derivation (also called Ostrom's derivation or &delta;-derivation) on &beta;&Pi;.
The Case for Formal Methods in Standards
Authors: David Blyth, Cornelia Boldyreff, Clive Ruggles, Nik Tetteh-Lartey
Venue: IEEE Software (1990)

It is argued that applying formal methods to standards making would result in more accurate, more understandable, and more useful standards. The main benefit seen in using formal methods in a standard's development and expression is improving the standard's quality. In the early stages of standards development, formal methods can result in considerable clarification during the development and expression of the underlying conceptual model for a standard or family of related standards. They can also define precisely the relation among the components of both the standard being developed and other standards. Later in the development process, formal methods can improve a standard's quality during its use by letting it be expressed clearly, unambiguously, and concisely in a way that natural language does not allow. Finally, formal methods can aid standards development at the maintenance stage, for example, by allowing the adequacy of a proposed change to be proved. Guidelines for applying formal methods in the standardization process are provided.
Performance Evaluation of Rule Grouping on a Real-Time Expert System Architecture
Authors: I. -R. Chen, B. Poole
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Uses a Markov process to model a real-time expert system architecture characterized by message passing and event-driven scheduling. The model is applied to the performance evaluation of rule grouping for real-time expert systems running on this architecture. An optimizing algorithm based on Kernighan-Lin heuristic graph partitioning for the real-time architecture is developed and a demonstration system based on the model and algorithm has been developed and tested on a portion of the advanced GPS receiver (AGR) and manned manoeuvring unit (MMU) knowledge bases.
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
Authors: Dyi-Rong Duh, Gen-Huey Chen, Jywe-Fei Fang
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In this paper, a new two-level interconnection network, called a hierarchical folded-hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic modules which are connected in a complete manner. We investigate the topological properties of the HFN, including the diameter, cost, average distance, embedding, connectivity, container, ¿-wide diameter, and node-fault diameter. We show that the HFN can emulate algorithms which are executable on the ring or the mesh-connected computer with the same time complexities in big-O notation. Moreover, the HFN can embed a folded hypercube having the same number of nodes with constant dilation. We compute the diameter, node connectivity, best container, ¿-wide diameter, and node-fault diameter of the HFN. We present optimal routing and broadcasting algorithms for the HFN. The semigroup computation and descend/ascend algorithms can be executed as well on the HFN.
Modeling dynamic objects in distributed systems with nested Petri nets
Authors: Irina A. Lomazova
Venue: Fundamenta Informaticae (2002)

Nested Petri nets (NP-nets) is a Petri net extension, allowing tokens in a net marking to be represented by marked nets themselves. The paper discusses applicability of NP-nets for modeling task planning systems, multi-agent systems and recursive-parallel systems. A comparison of NP-nets with some other formalisms, such as OPNs of R. Valk, recursive parallel programs of O. Kushnarenko and Ph. Schnoebelen and process algebras is given. Some aspects of decidability for object-oriented Petri net extensions are also discussed.
Sequences supplied by inequalities and an application to the convergence of Mann iteration with delay
Authors: Stefan M. Soltuz
Venue: Octogon Mathematical Magazine (2002)

The nonnegative sequence (an)n which is satisfying an+1 ≤ (1-λn)an + λnε,(λn) ⊂ (0,1)N, ε > 0, is well-known. The convergence of this sequence is the main tool for most of the papers concerning the convergence of Mann and Ishikawa iterations. In this note we give a new proof for this sequence. Also, we study the convergence of others sequences supplied by inequalities. The convergencies of this sequences are apply to the study of Mann iteration with delay, which we introduce here.