ppxscal/embedding_network huggingface dataset:
A Spurious Equilibria-free Learning Algorithm for the BlindSeparation of Non-zoer Skewness Signals
Authors: Seungjin Choi, Ruey-Wen Liu, Andrzej Cichocki
Venue: Neural Processing Letters (1998)

We present a new learning algorithm for the blind separation of independent source signals having non-zero skewness (the 3rd-order cumulant) (the source signals have non-symmetric probability distribution.), from their linear mixtures. It is shown that for a class of source signals whose probability distribution functions is not symmetric, a simple adaptive learning algorithm using quadratic function (f(x)=x^2) is very efficient for blind source separation task. It is proved that all stable equilibria of the proposed learning algorithm are desirable solutions. Extensive computer simulation experiments confirmed the validity of the proposed algorithm.
Taylor II manufacturing simulation software
Authors: Cliff B. King
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Taylor II is a menu-driven simulation package mainly used in manufacturing, warehousing, and material handling. It is developed for the analysis and quantitative evaluation of complex processes, especially those with a dynamic character. A lot of applications in different industries show that there is an increasing need for simulation tools. This paper will demonstrate the process of building, analyzing and presenting models of real world systems with Taylor II.
The distributed information search component (Disco) and the World Wide Web
Authors: Anthony Tomasic, Rémy Amouroux, Philippe Bonnet, Olga Kapitskaia, Hubert Naacke, Louiqa Raschid
Venue: ACM SIGMOD Record (1997)

The Distributed Information Search COmponent (DISCO) is a prototype heterogeneous distributed database that accesses underlying data sources. The DISCO prototype currently focuses on three central research problems in the context of these systems. First, since the capabilities of each data source is different, transforming queries into subqueries on data source is difficult. We call this problem the weak data source problem. Second, since each data source performs operations in a generally unique way, the cost for performing an operation may vary radically from one wrapper to another. We call this problem the radical cost problem. Finally, existing systems behave rudely when attempting to access an unavailable data source. We call this problem the ungraceful failure problem. DISCO copes with these problems. For the weak data source problem, the database implementor defines precisely the capabilities of each data source. For the radical cost problem, the database implementor (optionally) defines cost information for some of the operations of a data source. The mediator uses this cost information to improve its cost model. To deal with ungraceful failures, queries return partial answers. A partial answer contains the part of the final answer to the query that was produced by the available data sources. The current working prototype of DISCO contains implementations of these solutions and operations over a collection of wrappers that access information both in files and on the World Wide Web.
Heavy Tails and Long Range Dependence in On/Off Processes and Associated Fluid Models
Authors: David Heath, Sidney Resnick, Gennady Samorodnitsky
Venue: Mathematics of Operations Research (1998)

On/off models are common inputs for a variety of communication network models as well as storage and inventory models. A stationary renewal process alternating periods of activity (active transmission, fluid buildup, etc) with periods of inactivity (silence, no transmission, inputs off, etc) induces a stationary indicator process which indicates if the system is active or not. Heavy tails for the on periods induces a covariance function for the indicator process which decreases slowly at a rate characteristic of long range dependence. This has dramatic consequences for fluid models where fluid flows in at constant rate and there is a constant rate of release.
Errata: a formal basis for architectural connection
Authors: Robert Allen, David Garlan
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1998)

We present corrections to a previously published article which appeared in ACM Transaction on Software Engineering and Methodology 6, 3 (July 1997), pp. 213&ndash;249
Band Ordering in Lossless Compression of Multispectral Images
Authors: Stephen R. Tate
Venue: IEEE Transactions on Computers (1997)

In this paper, we consider a model of lossless image compression in which each band of a multispectral image is coded using a prediction function involving values from a previously coded band of the compression, and examine how the ordering of the bands affects the achievable compression.We present an efficient algorithm for computing the optimal band ordering for a multispectral image. This algorithm has time complexity O(n2) for an n-band image, while the naive algorithm takes time ¿(n!). A slight variant of the optimal ordering problem that is motivated by some practical concerns is shown to be NP-hard, and hence, computationally infeasible, in all cases except for the most trivial possibility.In addition, we report on our experimental findings using the algorithms designed in this paper applied to real multispectral satellite data. The results show that the techniques described here hold great promise for application to real-world compression needs.
A new two task algorithm for clock mode fault simulation in sequential circuits
Authors: Fredrick J. Hill, Eltayeb Abuelyamen, Wei-Kang Huang, Guo-Qiang Shen
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A new approach to clock mode simulation of sequential circuits is introduced. Surrogate fault propagation is used for processing stored faults and extracting new faults from combinational logic. Problem fault types are analyzed and treated as exceptions.
PELLPACK: a problem-solving environment for PDE-based applications on multicomputer platforms
Authors: E. N. Houstis, J. R. Rice, S. Weerawarana, A. C. Catlin, P. Papachiou, K.-Y. Wang, M. Gaitatzes
Venue: ACM Transactions on Mathematical Software (TOMS) (1998)

The article presents the software architecture and implementation of the problem-solving environment (PSE) PELLPACK for modeling physical objects described by partial differential equations (PDEs). The scope of this PSE is broad, as PELLPACK incorporates many PDE solving systems, and some of these, in turn, include several specific PDE solving methods. Its coverage for 1D, 2D. and 3D elliptic or parabolic problems is quite broad, and it handles some hyperbolic problems, Since a PSE should provided complete support for the problem-solving process, PELLPACK also contains a large amount of code to support graphical user interfaces, analystic tools, user help, domain or mesh partitioning, machine and data selection, visualization, and various other tasks. Its total size is well over 1 million lines code. Its open-ended software architecture consists of several software layers. The top layer is an interactive graphical interface for specifying the PDE model and its solution framework This interface saves that results of the user specification in the form of a very high level PDE language which is an alternative interface to the PELLPACK system. This language also allows a user to specify the PDE problem and its solution framework textually in a natural form. The PELLPACK language preprocessor generates a Fortran control program with the interfaces, calls to specified components and libraries of the PDE solution framework, and functions defining the PDE problem. The PELLPACK program execution is supported by a hign-level tool where the virtual parallel system is defined, where the compilation, loading, and execution are controlled. Finally, the PELLPACK PSE integrates several PDE libraries and PDE systems based on the decomposition of discrete geometric data to map sparse PDE computations to parallel machines. An instance of the system is available as a Web server (WebPELLPACK) for public use at http://pellpack.cs.purdue.edu.
Two-Dimensional Schur Algorithm
Authors: Ahmet H. Kayran, Unal Kücük, Sydney R. Parker
Venue: Multidimensional Systems and Signal Processing (1998)

In this paper, a novel 2-D Schur algorithm is developed as a natural extension of the 1-D Schur recursion. This lattice structure is based on Parker and Kayran&lsquo;s four-field lattice approach. Starting with given 2-D autocorrelation samples, four quarter-plane gapped functions are generated. Their linear combination is used to satisfy gap conditions and calculate 2-D lattice parameter reflection factors for the first stage. In order to determine the growing number of 2-D reflection coefficients at succesive stages, appropriately defined auxiliary gapped functions are introduced after the first order. The theory has been confirmed by computer simulations. In addition to developing the basic theory, the presentation includes a comparison between the proposed 2-D lattice structure and other existing four-field lattice structures.
Controlling activities in a virtual manufacturing cell
Authors: Michael Iuliano, Albert Jones
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Researchers at the National Institute of Standards and Technology are developing a virtual manufacturing cell. This cell will contain simulation models of a wide range of manufacturing equipment, processes, and systems. It will have commercial and prototype applications software which implement production functions from order release to final inspection. There will be an information base and a collection of interfaces which will provide the integrating infrastructure for these applications. These interfaces will be based on information models and exchange protocols, and will specify what information is shared across those applications and how it is exchanged. This paper describes the current virtual manufacturing cell, with special emphasis on the hierarchy we are developing to control activities within the cell.
A framework for balancing control flow and predication
Authors: David I. August, Wen-mei W. Hwu, Scott A. Mahlke
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

Predicated execution is a promising architectural feature for exploiting instruction-level parallelism in the presence of control flow. Compiling for predicated execution involves converting program control flow into conditional, or predicated, instructions. This process is known as if-conversion. In order to effectively apply if-conversion, one must address two major issues: what should be if-converted and when the if-conversion should be applied. A compiler's use of predication as a representation is most effective when large amounts of code are if-converted and if-conversion is performed early in the compilation procedure. On the other hand the final code generated for a processor with predicated execution requires a delicate balance between control flow and predication to achieve efficient execution. The appropriate balance is tightly coupled with scheduling decisions and detailed processor characteristics. This paper presents an effective compilation framework that allows the compiler to maximize the benefits of predication as a compiler representation while delaying the final balancing of control flow and predication to schedule time.
Implementation of a Patient Charting System: Challenges Encountered and Tactics Adopted in a Burn Center
Authors: Guy Paré, Joyce J. Elam, C. Gillon Ward
Venue: Journal of Medical Systems (1997)

The rapid movement of information technologies into health care organizations has raised managerial concern regarding the capability of today's institutions to satisfactorily manage their introduction. Indeed, several health care institutions have consumed huge amounts of money and frustrated countless people in wasted information systems implementation efforts. Unfortunately, there are no easy answers as to why so many health informatics projects are not more successful. In this light, the aim of this study is to provide a deeper understanding of how clinical information systems are being implemented by emphasizing research efforts on the dynamic nature of the process, that is, the &ldquo;how&rdquo; and &ldquo;why&rdquo; of what happened. Using a case study methodology, we examined the implementation of a patient charting system in the Burn Center of a large, not-for-profit, teaching hospital. Based on an in-depth examination of this implementation, several insights are offered to those who have responsibility for managing complex and risky clinical information system implementation projects.
Automated packet trace analysis of TCP implementations
Authors: Vern Paxson
Venue: Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication (1997)

We describe tcpanaly, a tool for automatically analyzing a TCP implementation's behavior by inspecting packet traces of the TCP's activity. Doing so requires surmounting a number of hurdles, including detecting packet filter measurement errors, coping with ambiguities due to the distance between the measurement point and the TCP, and accommodating a surprisingly large range of behavior among different TCP implementations. We discuss why our efforts to develop a fully general tool failed, and detail a number of significant differences among 8 major TCP implementations, some of which, if ubiquitous, would devastate Internet performance. The most problematic TCPs were all independently written, suggesting that correct TCP implementation is fraught with difficulty. Consequently, it behooves the Internet community to develop testing programs and reference implementations.
Designing Internet instructional environments (poster)
Authors: Peter A. Cooper
Venue: ACM SIGCSE Bulletin (1998)

In the last 15 years, there has a sea change in technology-based instructional environments. Early and simple environments such as Hypercard stacks have given way to richer interactive instructional environments where the learner is relatively free to explore at her own pace and to construct meaningful conceptual schema within the context of that environment.Transferring these new and rich environments to the Internet pose significant problems among which are security, interactive communication, data storage and bandwidth.The purpose of this poster session is to present an example of how an instructional environment can be delivered via the World Wide Web. The purpose is to identify strategies for the deliver of instructional materials and environments over the Internet. In doing so, the author hopes to open the door to discussion and to the development of well-defined tools for instructional application development.
Global and Superlinear Convergence of a Restricted Class of Self-Scaling Methods with Inexact Line Searches, for Convex Functions
Authors: M. Al-Baali
Venue: Computational Optimization and Applications (1998)

This paper studies the convergence properties of algorithms belonging to the class of self-scaling (SS) quasi-Newton methods for unconstrained optimization. This class depends on two parameters, say &thetas;_k and &tau;_k, for which the choice &tau;_k=1 gives the Broyden family of unscaled methods, where &thetas;_k=1 corresponds to the well known DFP method. We propose simple conditions on these parameters that give rise to global convergence with inexact line searches, for convex objective functions. The q-superlinear convergence is achieved if further restrictions on the scaling parameter are introduced. These convergence results are an extension of the known results for the unscaled methods. Because the scaling parameter is heavily restricted, we consider a subclass of SS methods which satisfies the required conditions. Although convergence for the unscaled methods with &thetas;_k &ge; 1 is still an open question, we show that the global and superlinear convergence for SS methods is possible and present, in particular, a new SS-DFP method.
Vector performance analysis of the NEC SX-2
Authors: Rod A. Fatoohi
Venue: ACM SIGARCH Computer Architecture News (1990)

This paper presents the results of a series of experiments to study the vector performance of the NEC SX-2. The main object of this study is to understand the architecture and identify its bottlenecks and limiting factors. A simple performance model is used to examine the impact of certain architectural features on the performance of a set of basic operations. The results of implementing this set on the machine for four vector lengths and three memory strides are presented and compared. These results show that the vector length and the ratio of floating point operations to memory references have a great impact on the performance of the machine. Two numerical algorithms are also employed and the results of these algorithms and the basic operations are compared to early results on one processor of the Cray-2 and Cray Y-MP. These comparisons show that the SX-2 is faster than the Cray Y-MP by up to 86% for short vectors and by 2 to 4 times for long vectors. Also, it outperformed the Cray-2 by even bigger factors. Finally, the architecture of the SX-X is presented, and some predictions about its performance are given.
Dynamic Vergence Using Log-Polar Images
Authors: C. Capurro, F. Panerai, G. Sandini
Venue: International Journal of Computer Vision (1997)

Vergence provides robot vision systems with a crucial degree of freedom: it enables fixation of points in visual space at different distances from the observer. Vergence control, therefore, affects the performance of the stereo system as well as the results of motion estimation and tracking and, as such, must satisfy different requirements in order to be able to provide not only a stable fixation, but a stable binocular fusion, and a fast, smooth and accurate reaction to changes in the environment. To obtain this kind of performance the paper focuses specifically on the use of dynamic visual information to drive vergence control. In this context, moreover, the use of a space-variant, anthropomorphic sensor is described and some advantages in relation to vergence control are discussed to demonstrate the relevance of image plane geometry for this particular task. Expansion or contraction patterns and the temporal evolution of the degree of fusion measured in the log-polar domain are the inputs to the vergence control system and determine robust and accurate steering of the two cameras. Real-time experiments are presented to demonstrate the performance of the system covering different key situations.
Simulation of a hospital picture archiving and control system (PACS)
Authors: G. R. Lawrence, G. A. Marin, S. E. Naron
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The nation's hospitals have long used distributed data processing as a means of reducing operational costs and providing timely service. Radiology Departments are now also taking advantage of these facilities in order to decrease the cost of producing and archiving radiological images. Today a typical medium scale hospital consumes large quantities of silver oxide film which, along with attendant labor costs, is expensive compared with costs for digital image processing technology now available. Using this technology large image files can be stored and retrieved through local area networks that can also support the transaction traffic essential in a hospital environment. The evolving systems are called Picture Archiving and Control Systems (PACS). PACS will include radiology imaging equipment, distributed and central image archiving facilities, and significant numbers of user work-stations and graphics display nodes. The devices will be inter-connected by high speed local area networks capable of distributing information ranging from simple control messages to large image files of several megabytes in a fashion offering most users a response time of several seconds. This paper illustrates the PACS system concept, present a queuing model approach to analyzing PACS performance. and discuss results acquired for a variety of parametric samples. The IBM Research Queuing Package (RESD) has been used for the exercise and will-be-discussed sufficiently for the reader to appreciate its capability. RESQ simulation results indicate that system response times will be more dependent on the internal architecture and programs of the workstation than on the speed of the transmission media.
Revisiting commit processing in distributed database systems
Authors: Ramesh Gupta, Jayant Haritsa, Krithi Ramamritham
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

A significant body of literature is available on distributed transaction commit protocols. Surprisingly, however, the relative merits of these protocols have not been studied with respect to their quantitative impact on transaction processing performance. In this paper, using a detailed simulation model of a distributed database system, we profile the transaction throughput performance of a representative set of commit protocols. A new commit protocol, OPT, that allows transactions to &ldquo;optimistically&rdquo; borrow uncommitted data in a controlled manner is also proposed and evaluated. The new protocol is easy to implement and incorporate in current systems, and can coexist with most other optimizations proposed earlier. For example, OPT can be combined with current industry standard protocols such as Presumed Commit and Presumed Abort. The experimental results show that distributed commit processing can have considerably more influence than distributed data processing on the throughput performance and that the choice of commit protocol clearly affects the magnitude of this influence. Among the protocols evaluated, the new optimistic commit protocol provides the best transaction throughput performance for a variety of workloads and system configurations. In fact, OPT's peak throughput is often close to the upper bound on achievable performance. Even more interestingly, a three-phase (i.e., non-blocking) version of OPT provides better peak throughput performance than all of the standard two-phase (i.e., blocking protocols evaluated in our study.
The TriGS active object-oriented database system&mdash; an overview
Authors: G. Kappel, W. Retschitzegger
Venue: ACM SIGMOD Record (1998)

The active object-oriented database system TriGS has been developed as part of a larger EC ESPRIT project aiming at the development of next-generation production scheduling and control systems [Huem93]. The goal of this paper is to summarize the work on TriGS which comprises both aspects concerning the development of the active system itself, and guidelines concerning the design of active databases.
Using Coverage Information to Predict the Cost-Effectiveness of Regression Testing Strategies
Authors: David S. Rosenblum, Elaine J. Weyuker
Venue: IEEE Transactions on Software Engineering (1997)

Selective regression testing strategies attempt to choose an appropriate subset of test cases from among a previously run test suite for a software system, based on information about the changes made to the system to create new versions. Although there has been a significant amount of research in recent years on the design of such strategies, there has been very little investigation of their cost-effectiveness. This paper presents some computationally efficient predictors of the cost-effectiveness of the two main classes of selective regression testing approaches. These predictors are computed from data about the coverage relationship between the system under test and its test suite. The paper then describes case studies in which these predictors were used to predict the cost-effectiveness of applying two different regression testing strategies to two software systems. In one case study, the TESTTUBE method selected an average of 88.1 percent of the available test cases in each version, while the predictor predicted that 87.3 percent of the test cases would be selected on average.