ppxscal/embedding_network huggingface dataset:
Stieltjes transforms of a class of probability measures
Authors: E. K. Ifantis, C. G. Kokologiannaki
Venue: Journal of Computational and Applied Mathematics (2003)

Let the probability measures µN, N = 2,3,... be defined by µN({λk,N}) = 1/N, µN(A) = 0 for λk,N ∈ A, where λk,N, k = 1,2,.....,N are the zeros of the orthogonal polynomial PN+1(x), which is obtained recursively by P0(x)=0, P1(x)= 1, anPn+1(x)+an-1Pn-1(x)+bnPn(x)=xPn(x). Conditions on an and bn are found such that the sequence µN, N = 2,3,... converges weakly to the Dirac measure at the point zero. This is achieved through the convergence of the sequence of Stieltjes transforms ∫-∞∞ dµN(t)/(λ-t) to the function 1/λ. Typical examples are the Al-Salam and Carlitz polynomials, the Wall polynomials, the Lommel polynomials and the Tricomi-Carlitz polynomials.
Generic ILP versus specialized 0-1 ILP: an update
Authors: Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further uses are complicated by the need to express "counting constraints" in conjunctive normal form (CNF). Expressing such constraints by pure CNF leads to more complex SAT instances. Alternatively, those constraints can be handled by Integer Linear Programming (ILP), but generic ILP solvers may ignore the Boolean nature of 0--1 variables. Therefore specialized 0--1 ILP solvers extend SAT solvers to handle these so-called "pseudo-Boolean" constraints.This work provides an update on the on-going competition between generic ILP techniques and specialized 0--1 ILP techniques. To make a fair comparison, we generalize recent ideas for fast SAT-solving to more general 0--1 ILP problems that may include counting constraints and optimization. Another aspect of our comparison is evaluation on 0--1 ILP benchmarks that originate in Electronic Design Automation (EDA), but that cannot be directly solved by a SAT solver. Specifically, we solve instances of the Max-SAT and Max-ONEs optimization problems which seek to maximize the number of satisfied clauses and the "true" values over all satisfying assignments, respectively. Those problems have straightforward applications to SAT-based routing and are additionally important due to reductions from Max-Cut, Max-Clique, and Min Vertex Cover. Our experimental results show that specialized 0--1 techniques tend to outperform generic ILP techniques on Boolean optimization problems as well as on general EDA SAT problems.
Simple termination conditions for k-nearest neighbor method
Authors: Mineichi Kudo, Naoto Masuyama, Jun Toyama, Masaru Shimbo
Venue: Pattern Recognition Letters (2003)

The main problem with k-nearest neighbor (k-NN) method is that the computational cost in the search process is proportional to the size of the training samples. Many search algorithms have been proposed to cope with this problem. In this study, we consider some conditions for terminating the search procedure when the true k-NNs have been found in the middle of the search, and we present, as an example, a procedure in the branch-and-bound algorithm. These conditions do not always work for a certain sample, but they reduce the computational cost on average.
Applying GIS and Or Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems
Authors: Don Weigel, Buyang Cao
Venue: Interfaces (1999)

Sears, Roebuck and Company uses a vehicle-routing-and-scheduling system based on a geographic information system to run its delivery and home service fleets more efficiently. Although the problems to be solved can be modeled as vehicle routing problems with time windows (VRPTW), the size of the problems and thus practical complexity make these problems of both theoretical and practical interest. We constructed a series of algorithms, including the algorithm to build the origin-and-destination matrix, the algorithm to assign resources, and algorithms to perform sequencing and route improvement. The combination of GIS and OR techniques makes the system quite efficient. The system has improved the Sears technician-dispatching and home-delivery business; resulting in over $9 million in one-time savings and over $42 million in annual savings. The success of this application also suggests a promising link between GIS and OR techniques.
An outline of a course on operating system principles
Authors: Per Brinch Hansen
Venue: The origin of concurrent programming: from semaphores to remote procedure calls (2002)

In 1970 the author began writing a comprehensive textbook on operating system principles. This is a description of its structure and how far it had progressed a year later.
Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
Authors: Gregory W. Fischer, Ziv Carmon, Dan Ariely, Gal Zauberman, Pierre L'Ecuyer
Venue: Operations Research (1999)

Combining parallel multiple recursive sequences provides an efficient way of implementing random number generators with long periods and good structural properties. Such generators are statistically more robust than simple linear congruential generators that fit into a computer word. We made extensive computer searches for good parameter sets, with respect to the spectral test, for combined multiple recursive generators of different sizes. We also compare different implementations and give a specific code in C that is faster than previous implementations of similar generators.
Fuzzy mathematical programming applied to multi-level programming problems
Authors: Surabhi Sinha
Venue: Computers and Operations Research (2003)

An alternative multi-level programming technique based on fuzzy mathematical programming (FMP) is developed which gives better solutions than that proposed by Shih et al. (Comput. Oper. Res. 23(1) (1996) 73). The method uses the objectives in a sequential order of the hierarchy interactively and takes into account the desire of the DM at each stage. The technique is equally applicable to linear/nonlinear multi-level (say P levels) programming problems (MLPPs).
A security model for distributed computing
Authors: Iliya K. Georgiev, Ivo I. Georgiev
Venue: Journal of Computing Sciences in Colleges (2001)

This paper presents a multi-tier model for secure computing as a teaching method platform. The security model is based on establishing the trustworthiness and role of each component in a distributed computing environment: trusted users, trusted servers, trusted administrators, untrusted client, untrusted communication media and intermediate systems, etc. The model provides a basis for teaching and for program system design. The security dimensions (both social and technical) can be considered in computer science curriculum in general. The model as a teaching method was experimented in some senior student software projects.
A software tool to automatically fill time-series gaps of air quality data
Authors: G. Latini, G. Passerini, S. Tascini
Venue: Development and application of computer techniques to environmental studies (2002)

In this work we present a new software tool we developed, aiming to collect and systematise our advances on statistic filling of time-series gaps. Starting from considering our air quality data sets, collected by a poor monitoring network, we found the necessity of solving ambiguity and nonhomogeneity problems due to inconstant sample number as well as data fragmentation among time series.Considering literature protocols, we tried to define a gap classification based on its time lapse. Problems have been found for gaps larger than 4 hours since they are not generally discussed. In order to approach this aspect we tried applications of spatial algorithms (such as nearest neighbour or smooth-fill) and neural networks which seemed to give excellent results for gaps wider than 8 hours. On this preliminary study we achieved a classification based upon three branches: small gaps (up to 4 hours); medium gaps (5-8 hours) and large gaps (9-50 hours).Once a gap has been recognised, a filling algorithm is selected and applied by the main module choosing among: linear interpolation, time matrix interpolation and neural networks based algorithms.Since a data base interface has been developed, we are able to use this software to fill up the most part of our incomplete series, and we can actually consider to extend the width of recoverable gaps.
An overview of the BlueGene/L Supercomputer
Authors: NR Adiga, G Almasi, GS Almasi, Y Aridor, R Barik, D Beece, R Bellofatto, G Bhanot, R Bickford, M Blumrich, AA Bright, J Brunheroto, C Caşcaval, J Castaños, W Chan, L Ceze, P Coteus, S Chatterjee, D Chen, G Chiu, TM Cipolla, P Crumley, KM Desai, A Deutsch, T Domany, MB Dombrowa, W Donath, M Eleftheriou, C Erway, J Esch, B Fitch, J Gagliano, A Gara, R Garg, R Germain, ME Giampapa, B Gopalsamy, J Gunnels, M Gupta, F Gustavson, S Hall, RA Haring, D Heidel, P Heidelberger, LM Herger, D Hoenicke, RD Jackson, T Jamal-Eddine, GV Kopcsay, E Krevat, MP Kurhekar, AP Lanzetta, D Lieber, LK Liu, M Lu, M Mendell, A Misra, Y Moatti, L Mok, JE Moreira, BJ Nathanson, M Newton, M Ohmacht, A Oliner, V Pandit, RB Pudota, R Rand, R Regan, B Rubin, A Ruehli, S Rus, RK Sahoo, A Sanomiya, E Schenfeld, M Sharma, E Shmueli, S Singh, P Song, V Srinivasan, BD Steinmacher-Burow, K Strauss, C Surovic, R Swetz, T Takken, RB Tremaine, M Tsao, AR Umamaheshwaran, P Verma, P Vranas, TJC Ward, M Wazlowski, W Barrett, C Engel, B Drehmel, B Hilgart, D Hill, F Kasemkhani, D Krolak, CT Li, T Liebsch, J Marcella, A Muff, A Okomo, M Rouse, A Schram, M Tubbs, G Ulsh, C Wait, J Wittrup, M Bae, K Dockser, L Kissel, MK Seager, JS Vetter, K Yates
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

This paper gives an overview of the BlueGene/L Supercomputer. This is a jointly funded research partnership between IBM and the Lawrence Livermore National Laboratory as part of the United States Department of Energy ASCI Advanced Architecture Research Program. Application performance and scaling studies have recently been initiated with partners at a number of academic and government institutions, including the San Diego Supercomputer Center and the California Institute of Technology. This massively parallel system of 65,536 nodes is based on a new architecture that exploits system-on-a-chip technology to deliver target peak processing power of 360 teraFLOPS (trillion floating-point operations per second). The machine is scheduled to be operational in the 2004--2005 time frame, at price/performance and power consumption/performance targets unobtainable with conventional architectures.
The Legion support for advanced parameter-space studies on a grid
Authors: Anand Natrajan, Marty A. Humphrey, Andrew S. Grimshaw
Venue: Future Generation Computer Systems (2002)

Parameter-space (p-space) studies involve running a single application several times with different parameter sets. Since the jobs are mutually independent, many computing resources can be recruited to conduct an entire study in a distributed manner. The p-space studies are attractive applications for grids, which are networked collections of computing and other resources. Legion is a grid infrastructure that facilitates the secure and easy use of heterogeneous, geographically distributed resources by providing the illusion of a single virtual machine from those resources. Legion provides tools and services that support advanced p-space studies, i.e., studies that make complex demands such as transparent access to distributed files, fault-tolerance and security. We demonstrate these benefits with a protein-folding experiment in which a molecular simulation package was run over a grid managed by Legion.
Use cases for distributed real-time software architectures
Authors: Hassan Gomaa
Venue: Engineering of distributed control systems (2001)

This paper describes how use cases can be applied to the architectural design of distributed real-time applications. In order to benefit from use cases in distributed real-time design, it is necessary to extend use cases, particularly in the design phase, when important design decisions need to be made. To achieve this, use cases are integrated with CODARTS (Concurrent Design Approach for Real-Time Systems) distributed design concepts. Three different types of architectural use cases are described, client/server use cases, subscription use cases and real-time control use cases. Different forms of message communication are associated with the different use case types. The software architecture of the distributed real-time system is achieved by composing it from the use cases.
Sustaining learning in critical domains of robotic systems
Authors: Hoimonti Pal
Venue: Journal of Computing Sciences in Colleges (2002)

Previous research in the field of Artificial Intelligence has focused on systems that are based on basic ideas of human long-term learning. These systems are not easily applicable to critical situations for robotic systems. In risky situations robotic systems use hierarchical/instinctual memory to address these perilous situations. However, this instinctual memory is often modified over long periods of time resulting in a sustained long-term memory system that interacts with the hierarchical system. In this paper a new method to modify and create learning in hierarchical/instinctualmemory is introduced in order to create a robotic system that is more capable of surviving in critical states. This new procedure draws on Learning Theory from the field of Cognitive Psychology in order to create and maintain this learning system for robotic structures. The new system that was created was first developed by re-analyzing the basic structure of memory and learning systems previously used in robotic systems. It is composed of six basic structures-Instinctual learning, Short-term learning, Long-term learning, motor memory, short-term memory, and long-term memory/knowledge base. Motor memory closely interacts exclusively with Instinctual Learning in a bi-directional relationship. Instinctual Learning also interacts with itself. The short term learning system interacts with both short-term memory as well as short-term learning itself. Finally, the long term learning system interacts with both long-term memory/knowledge base and long term learning. Both long-term learning and long-term memory can modify instinctuallearning; instinctuallearning can also modify long-term learning. The short and long- term learning structures interact and can modify one another. All modifications take place due to the repetitiveness and/or distinctiveness of the actions specified. For example, instinctual learning is self-modifiable through repetition in certain states, and this will also modify long-term learning and the long-term knowledge base. This system creates structures to deal with particular situations, but these distinct structures are also highly interactive. This provides a means to create sustained learning in risky domains. This system will allow practical robotic systems in critical domains to learn faster. This scheme has breakthrough potential for practical robotic systems such as military defense, police and rescue situations, medical diagnostic systems and other critical domain applications.
Operator splitting for compressible miscible displacement in porous media
Authors: Jim Douglas,  Jr., Diego Frías, Felipe Pereira
Venue: Scientific computing and applications (2001)

We are concerned with the accurate numerical solution of a model for compressible miscible displacement in porous formations. We formulate an extension of the Modified Method of Characteristics with Adjusted Advection to treat the coupling of the pressure equation with transport and diffusion caused by the compressibility of the fluid. In the two-stage operator splitting technique, the outer stage incorporates an implicit solution of the nonlinear parabolic pressure equation with an inner stage for transport and diffusion in which a mass fraction equation is solved sequentially by first applying a globally conservative Eulerian-Lagrangian scheme to solve for transport, followed by a standard implicit procedure for including the diffusive effects.
Approximation by polynomials and smooth functions in Sobolev spaces with respect to measures
Authors: José M. Rodríguez
Venue: Journal of Approximation Theory (2003)

The density of polynomials is straightforward to prove in Sobolev spaces Wk,p((a, b)), but there exist only partial results in weighted Sobolev spaces; here we improve some of these theorems. The situation is more complicated in infinite intervals, even for weighted LP spaces; besides, in the present paper we have proved some other results for weighted Sobolev spaces in infinite intervals.
Dirac-orthogonality in the space of tempered distributions
Authors: David Carfi
Venue: Journal of Computational and Applied Mathematics (2003)

The main goal of this paper is the realization that some formal basic results and definitions of the mathematical formalism of the quantum mechanics have a solid mathematical basis. In particular, we justify the so-called "delta" normalization in the continuous case introduced by Dirac (P.A.M. Dirac, The principles of Quantum Mechanics, Clarendon Press, Oxford, 1930, pp. 66-68), works that are of fundamental importance in the foundation of the modern quantum physics. This formal mathematical tool had not, until now, a rigorous counterpart, neither in the area of the rigged Hilbert spaces theory. It is possible to find a systematic application of the above mentioned formal tool in (W. Pauli, Wellenmechanik, 1958), (R. Shankar, Principles of Quantum Mechanics, Plenum Press, New York, 1994) and others.
Fast-Track: Article Using Advance Purchase Orders to Forecast New Product Sales
Authors: Wendy W. Moe, Peter S. Fader
Venue: Marketing Science (2002)

Marketers have long struggled with developing forecasts for new products before their launch. We focus on one data source--advance purchase orders--that has been available to retailers for many years but has rarely been tied together with postlaunch sales data. We put forth a duration model that incorporates the basic concepts of new product diffusion, using a mixture of two distributions: one representing the behavior of innovators (i.e., those who place advance orders) and one representing the behavior of followers (i.e., those who wait for the mass market to emerge). The resulting mixed-Weibull model specification can accommodate a wide variety of possible sales patterns. This flexibility is what makes the model well-suited for an experiential product category (e.g., movies, music, etc.) in which we frequently observe very different sales diffusion patterns, ranging from a rapid exponential decline (which is most typical) to a gradual buildup characteristic of "sleeper" products. We incorporate product-specific covariates and use hierarchical Bayes methods to link the two customer segments together while accommodating heterogeneity across products. We find that this model fits a variety of sales patterns far better than do a pair of benchmark models. More importantly, we demonstrate the ability to forecast new album sales before the actual launch of the album, based only on the pattern of advance orders.
Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
Authors: Christiane Lemieux, Pierre L'Ecuyer
Venue: SIAM Journal on Scientific Computing (2002)

Lattice rules are among the best methods to estimate integrals in a large number of dimensions. They are part of the quasi-Monte Carlo set of tools. A theoretical framework for a class of lattice rules defined in a space of polynomials with coefficients in a finite field is developed in this paper. A randomized version is studied, implementations and criteria for selecting the parameters are discussed, and examples of its use as a variance reduction tool in stochastic simulation are provided. Certain types of digital net constructions, as well as point sets constructed by taking all vectors of successive output values produced by a Tausworthe random number generator, are special cases of this method.
The parallelized perspective shear-warp algorithm for volume rendering
Authors: Jürgen P. Schulze, Ulrich Lang
Venue: Parallel Computing (2003)

The shear-warp algorithm for volume rendering is among the fastest volume rendering algorithms: It is an object-order algorithm, based on the idea of the factorization of the view matrix into a 3D shear and a 2D warp component. Thus, the compositing can be done in sheared object space, which allows the algorithm to take advantage of data locality. Although the idea of a perspective projection shear-warp algorithm is not new, it is not widely used so far. That may be because it is slower than the parallel projection algorithm and often slower than hardware supported approaches.In this paper, we present a new parallelized version of the perspective shear-warp algorithm. The parallelized algorithm was designed for distributed memory machines using MPI. The new algorithm takes advantage of the idea that the warp can be done in most computers' graphics hardware very fast, so that the remote parallel computer only needs to do the compositing. Our algorithm uses this idea to do the compositing on the remote machine, which transfers the resulting 2D intermediate image to the display machine. Even though the display machine can be a mid range PC or laptop computer, it can be used to display complex volumetric data, provided there is a network connection to a high performance parallel computer. Furthermore, remote rendering could be used to drive virtual environments, which typically require perspective projection and high frame rates for stereo projection and multiple screens.
Well-abstracted transition systems: application to FIFO automata
Authors: Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
Venue: Information and Computation (2003)

Formal methods based on symbolic representations have been found to be very effective. In the case of infinite state systems, there has been a great deal of interest in accelerations- a technique for characterizing the result of iterating an execution sequence an arbitrary number of times, in a sound, but not necessarily complete, way. We propose the use of abstractions as a general framework to design accelerations. We investigate SemiLinear Regular Expressions (SLREs) as symbolic representations for FIFO automata. In particular, we show that: (a) SLREs are easy to manipulate, (b) SLREs form the core of known FIFO symbolic representations, and (c) SLREs are sufficient to represent the effect of arbitrary iterations of a loop for FIFO automata with one channel.
Libraries as publishers of digital video
Authors: William D. Kearns
Venue: Building a virtual library (2003)

Dubbed as the next "Killer Application" (Hanss, 2001), digital video's anticipated impact on computer networks is enormous. Few other applications are so severely impacted by networks incapable of delivering quality of service guarantees for the latency and delay with which video stations receive information packets. The goal of this chapter is to briefly discuss the teaching and research uses of video materials in academic environments, inform librarians of the various forms into which video materials may be encoded, the strengths and weaknesses of the media formats, and to argue for a comprehensive implementation plan when considering the distribution of video resources. We will conclude the chapter with an illustration of how one academic library employed database technology to create a video card catalog accessible from the Internet.