ppxscal/embedding_network huggingface dataset:
Shock Profiles for the Partially Asymmetric Simple Exclusion Process
Authors: B. Derrida, J. L. Lebowitz, E. R. Speer
Venue:  (1997)

The asymmetric simple exclusion process (ASEP) on a one-dimensional lattice is a system of particles which jump at rates $p$ and $1-p$ (here $p<1/2$) to adjacent empty sites on their right and left respectively. The system is described on suitable macroscopic spatial and temporal scales by the inviscid Burgers'' equation; the latter has shock solutions with a discontinuous jump from left density $\rho_-$ to right density $\rho_+$, $\rho_-\sqrt{\rho_+(1-\rho_-)/\rho_-(1-\rho_+)}$. When $p/(1-p)=\rho_+(1-\rho_-)/\rho_-(1-\rho_+)$ the measure is Bernoulli, with density $\rho_-$ on the left and $\rho_+$ on the right. In the weakly asymmetric limit, $2p-1\to0$, the microscopic width of the shock diverges as $(2p-1)^{-1}$. The stationary measure is then essentially a superposition of Bernoulli measures, corresponding to a convolution of a space-dependent density profile described by the viscous Burgers equation with a well-defined distribution for the location of the second class particle.
Flexible storage placement of digital video media
Authors: J. C. L. Liu, D. H. C. Du, J. A. Schnepf
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In addition to the large data size requirement and real-time constraint in continuous media, future video applications such as video editing demands the flexible storage placement and the random access capability on the video-frame level. To offer efficient buffering schemes and flexible storage placement for supporting random access, we present two buffering schemes: the two-buffer scheme and the k-buffer compensation scheme. The two-buffer scheme requires only all the frames in a block to be stored consecutively while providing random access between blocks. However, this intuitive buffering scheme potentially requires a large block size and buffer space. The k-buffer compensation scheme is proposed to resolve this large buffer space requirement by using more than two buffers and requiring a minimal number of blocks randomly placed in each cylinder. Experimental measurement results reveal the significant improvements on the buffer-size reduction and placement flexibility by using the k-buffer compensation scheme.
ASCENT: Application-Specific Environment Transformer
Authors: David Garlan, Linxi Cai, Robert L. Nord, Robert Stockton
Venue:  (1992)

Current software development environments tend to lie at opposite ends of a spectrum: at one extreme are specialized application generators; at the other are general-purpose programming environments. The former provide strong support for system development and reuse, but are costly to build and available only for limited domains. The latter provide weak support, but are generally available and universally applicable. We describe a technique for automating the production of application-specific environments that lie between these two extremes. The key idea is that these environments can be derived from general-purpose programming environments by a process of structured transformation. We describe a tool for performing these transformations. It provides a set of formal operators for specializing a description of a general-purpose environment; as operators are applied, the system semi-automatically builds a set of transformation rules used to translate application-specific programs into those of the original general-purpose environment. The output of the tool is an application-specific environment together with a program transformer that provides execution semantics for programs written in that environment.
A COTS Wrapping Toolkit for Fault Tolerant Applications under Windows NT
Authors: Alfredo Benso, Silvia Chiusano, Paolo Prinetto
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper presents a software toolkit that allows enhancing the fault tolerant characteristics of a user application running under a Windows NT platform through sets of interchangeable and customizable Fault Tolerant Interposition Agents (FTI Agents). Interposition Agents are non-application software programs executed in an intermediate layer between the software application and the Operating System in order to `wrap¿ the application software intercepting and possibly modifying, all the communications between the application and the surrounding hardware and software environment. The process is completely transparent to both the user application and the Operating System and allows achieving a high degree of software-based reliability in a wide variety of domains.
Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics
Authors: Matthias Baaz, Norbert Preining, Richard Zach
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

The prenex fragments of first-order infinite-valued Gödellogics are classified. It is shown that the prenex Gödel logicscharacterized by finite and by uncountable subsets of[0, 1] are axiomatizable, and that the prenex fragments ofall uncountable Gödel logics are not axiomatizable.
Reliable Communication over Partially Authenticated Networks
Authors: Amos Beimel, Matthew Franklin
Venue:  (1997)

Reliable communication between parties in a network is a basic requirement for executing any protocol. In this work, we consider the effect on reliable communication when some pairs of parties have common authentication keys. The %%%distribution of pairs sharing keys define a natural ``authentication graph'''', which may be quite different from the ``communication graph'''' of the network. We characterize when reliable communication is possible in terms of these two graphs, focusing on the very strong setting of a Byzantine adversary with unlimited computational resources.
A hybrid approach to predictive modelling and control of automobiles in a noisy and variable environment
Authors: A. Tascillo
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

A hybrid control scheme is proposed that combines the advantages of various artificial intelligence technologies to better model and control transient behavior of a nonlinear system, even as its parameters are modified, via the ability to extract the cause of a change in a system's outputs. Appropriate techniques are developed for all stages of the development process, in an effort to reduce the amount of recalibration necessary by using a similar approach each time.
Parallel Real-Time Computation: Sometimes Quantity Means Quality
Authors: Selim G. Akl
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

We show that within the paradigm of real-time computation, some classes of problems have the property that a solution to a problem in the class, when computed in parallel, is far superior in quality than the best one obtained on a sequential computer. Example from these classes are presented. In each case, the solution obtained in parallel is significantly, provably, and consistently better than a sequential one. It is important to note that the purpose of thispaper is not to demonstrate merely that a parallel computer can obtain a better solution to a computational problem than one derived sequentially. The latter is an interesting (and often surprising) observation in its own right, but we wish to go further. It is shown here that the improvement in quality can be arbitrarily high (and certainly superlinear in the number of processors used by the parallel computer). This result is akin to superlinear speedup-a phenomenon itself originally thought to be impossible.
Adherence analysis of fibre-reinforced-polymer strengthened RC beams
Authors: R. Perera, M. L. Moreno, E. Alarcón
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Epoxy-bonding a composite plate to the tension face is an effective technique for repair and retrofit of reinforced concrete beams. The study of the effect of bonding between concrete and composite plates, when epoxy adhesive is used, is the objective of this paper. The results of an analytical and experimental study on the behavior of concrete blocks joined with carbon-fiber-reinforced polymer (CFRP) plates are discussed in this paper. For it, several specimens were tested through adherence tests. Numerical analyses included nonlinear finite element modeling incorporating a damage material model for concrete. In general, good correlations were obtained between the experimental results and nonlinear finite element models.
New Algorithms for Two-Frame Structure from Motion
Authors: J. Oliensis, Yakup Genc
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We describe two new algorithms for two frame structure from motion from tracked point features. One is the first fast algorithm for computing an exact least squares estimate. It exploits our observation that the rotationally invariant least squares error can be written in a simple form that depends just on the motion. The other is essentially as accurate as the least squares estimate and is more efficient, probably faster, and potentially more robust than previous algorithms of comparable accuracy. We also analyze theoretically the accuracy of the optical flow approximation to the least squares error.
Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds
Authors: John Reif, Stephen Tate
Venue:  (1990)

In this paper we address the issue of kinodynamic motion planning. Given a point that moves with bounded acceleration and velocity, we wish to find the time-optimal trajectory from a start configuration to a goal configuration (a configuration consists of both a position and a velocity). As finding exact optimal solutions to this problem seems very hard, we present a provably good approximation algorithm. We obtain a provably good approximation algorithm using the $L_2$ norm to bound acceleration and velocity. Our results are an extension of the earlier work of Canny, Donald, Reif, and Xavier [1], who present similar results where the dynamic bounds can be examined in each dimension independently (they use the $L_{\infty}$ norm to bound acceleration and velocity).
Challenges and Solutions for 24/7 System Availability
Authors: Anthony T. Rivers
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Software reliability is a critical problem for an increasing number of computing users. This is not because computers have become less reliable, but because computers, large and small, have become more pervasive and customers demand greater reliability and availability. As more businesses become increasingly dependent on computing as the backbone of their operation, it is more critical that the computing services provided are available 24 hours a day/7 days a week. Software system failures translate into lost revenues and at times even lost lives. Large enterprises are not the only ones to be adversely affected by poor software quality. The demand for reliable business-critical computing has reached the workgroup, and even the desktop.Real-time "internet-worked" computing systems are at the core of many enterprise mission-critical applications. In fact, these systems dominate e-commerce, defense, CAD/CAM/CAE, aviation, nuclear power, communications and finance. Due to the complexity of the hardware and software involved and the stringent Quality of Service (QoS) requirements, verifying and guaranteeing the reliability and availability of these systems is a challenging task. "Internet Time" schedules, n-tiered complexities, compatibility and security issues, unpredictable user load, varying runtime configurations and the high cost of failure make the problem even more acute.In this new era of rapidly changing technology and increasing software system dependence, the software community needs to develop a fresh look at how software development and service organizations, and their management, deal with software quality issues. Based on the practical experiences of the panelists, you will learn what the current challenges and practices are, Results, observations, and recommendations will be highlighted.
Accurate Camera Calibration for Off-line, Video-Based Augmented Reality
Authors: Simon Gibson, Jon Cook, Toby Howard, Roger Hubbold, Dan Oram
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Camera tracking is a fundamental requirement for video-based Augmented Reality applications. The ability to accurately calculate the intrinsic and extrinsic camera parameters for each frame of a video sequence is essential if synthetic objects are to be integrated into the image data in a believable way. In this paper, we present an accurate and reliable approach to camera calibration for off-line video-based Augmented Reality applications.We first describe an improved feature tracking algorithm, based on the widely used Kanade-Lucas-Tomasi tracker. Estimates of inter-frame camera motion are used to guide tracking, greatly reducing the number of incorrectly tracked features. We then present a robust hierarchical scheme that merges sub-sequences together to form a complete projectivereconstruction. Finally, we describe how RANSAC-based random sampling can be applied to the problem of self-calibration, allowing for more reliable upgrades to metric geometry. Results of applying our calibration algorithms are given for both synthetic and real data.
A simple definition for the universal Grassmannian order
Authors: Curtis D. Bennett, Lakshmi Evani, David Grabiner
Venue: Journal of Combinatorial Theory Series A (2003)

In this paper, we provide a combinatorial definition of the Universal Grassmannian order (or the Grassmannian Bruhat order) of Bergeron and Sottile. This defines the order in terms of inversions, and thus the order can be viewed as a generalization of the weak order for Coxeter groups. Finally, we use this understanding of the order to analyze the generating function of the number of elements at rank n in this order.
Extending the power of short-wordlength processors by means of context-dependent machine instructions
Authors: C K Yuen
Venue: ACM SIGARCH Computer Architecture News (1981)

It is shown that the concept of context-dependent machine instructions may be used in the architectural design of processors with short wordlengths, such as 8-bit microprocessors, in order to increase the capabilities of such machines above those of currently available models.
Multiconfiguration Wavefunctions for Quantum Monte Carlo Calculations of First-row Diatomic Molecules
Authors: Claudia Filippi, C. J. Umrigar
Venue:  (1996)

We use the variance minimization method to determine accurate wavefunctions for first-row homonuclear diatomic molecules. The form of the wavefunction is a product of a sum of determinants and a generalized Jastrow factor. One of the important features of the calculation is that we are including low-lying determinants corresponding to single and double excitations from the Hartree-Fock configuration within the space of orbitals whose atomic principal quantum numbers do not exceed those occurring in the Hartree-Fock configuration. The idea is that near-degeneracy correlation is most effectively described by a linear combination of low-lying determinants whereas dynamic correlation is well described by the generalized Jastrow factor. All the parameters occurring in both the determinantal and the Jastrow parts of the wavefunction are optimized. The optimized wavefunctions recover 77-94% of the correlation energy in variational Monte Carlo and 91-99% of the correlation energy in diffusion Monte Carlo.
Evolving databases: an application to electronic commerce
Authors: B. Fordham, S. Abiteboul, Y Yesha
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Many complex and dynamic database applications such as product modeling and negotiation monitoring require a number of features that have been adopted in semantic models and databases such as active rules, constraints, inheritance, etc. Unfortunately, each feature has largely been considered in isolation. Furthermore, in a commercial negotiation, participants staking their financial well beings will never accept a system they cannot gain a precise behavioral understanding of. We attack these problems with a rich and extensible database model, evolving databases, with a clear and precise semantics based on evolving algebras (E. Borger, 1994). We also briefly describe a prototype implementation of the model (B. Fordham et al.).
Automated Acquisition of Control Knowledge to Improve the Quality of Plans
Authors: M. A Perez, Jaimes G. Carbonell
Venue:  (1993)

Most of the work to date on automated control-knowledge acquisition has been aimed at improving the efficiency of planning; this work has been termed "speed-up learning". The work presented here focuses on the automated acquisition of control knowledge to guide a planner towards better solutions, i.e. to improve the quality of plans produced by the planner, as its problem solving experience increases. To date no work has focused on automatically acquiring knowledge to improve plan quality in planning systems. We present a taxonomy of plan quality metrics and a first prototype that partially automates the task of acquiring quality-enhancing control knowledge for the Prodigy nonlinear planner. We are working on testing the effect of such control knowledge in plan quality, and developing methods to learn such control knowledge. Two complex domains, namely a transportation logistics domain, and a machining process planning domain, are being used to evaluate these ideas.
Optimizing Layered Communication Protocols
Authors: Mark Hayden, Robbert vanRenesse
Venue:  (1996)

Layering of protocols offers several well-known advantages, but typically leads to performance inefficiencies. We present a model for layering, and point out where the performance problems occur in stacks of layers using this model. We then investigate the common execution paths in these stacks and how to identify them. These paths are optimized using three techniques: optimizing the computation, compressing protocol headers, and delaying processing. All of the optimizations can be automated in a compiler with the help of minor annotations by the protocol designer. We describe the performance that we obtain after implementing the optimizations by hand on a full-scale system.
A Prover for the muCRL toolset with applications -- version 0.1
Authors: J. C. Pol
Venue:  (2001)

This document describes an automated theorem prover, based on an extension of binary decision diagrams. The prover transforms quantifier-free formulae into equivalent BDD-forms, w.r.t.~to some algebraic data specification. The prover is used by four tools for the symbolic analysis of distributed systems specified in $\mu$CRL (i.e.~process algebra plus algebraic data types). The main techniques are invariants and confluence. Two case studies are reported: the DKR leader election protocol [13], and SPLICE [15], a coordination architecture of industrial origin. In both cases using confluence information leads to a reduced state space.
A unified model for metasearch and the efficient evaluation of retrieval systems via the hedge algorithm
Authors: Javed A. Aslam, Virgiliu Pavlu, Robert Savell
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We present a unified framework for simultaneously solving both the pooling problem (the construction of efficient document pools for the evaluation of retrieval systems) and metasearch (the fusion of ranked lists returned by retrieval systems in order to increase performance). The implementation is based on the Hedge algorithm for online learning, which has the advantage of convergence to bounded error rates approaching the performance of the best linear combination of the underlying systems. The choice of a loss function closely related to the average precision measure of system performance ensures that the judged document set performs well, both in constructing a metasearch list and as a pool for the accurate evaluation of retrieval systems. Our experimental results on TREC data demonstrate excellent performance in all measures---evaluation of systems, retrieval of relevant documents, and generation of metasearch lists.
An Optimal Scheduling Scheme for Parallel Video Processing
Authors: D Turgay Altilar, Yakup Paker
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

We present an optimal scheduling algorithm called Periodic Write-Read-Compute (PWRC) scheduling for parallel video processing. PWRC scheduling exploits continuity and periodicity of the video data. Therefore, it is suitable for any type of periodic data over which data independent application is to run. The target architecture is a client-server based system having a point-to-point communication between the host any worker processors where SPMD type of programming is assumed. PWRC requires a high level atomic write-read command for data transmission. The analysis of the cost model provides information either to form a parallel video processing environment or to predict the overall performance of an existing system. Meeting real-time requirements of video processing under PWRC scheduling is discussed as well.
How to Measure the Impact of Specific Development Practices on Fielded Defect Density
Authors: Ann Marie Neufelder
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

This author has mathematically correlated specific development practices to defect density and probability of on time delivery. This paper summarizes the results of this ongoing study that has evolved into a software prediction modeling and management technique. The author has collected data from 45 organizations developing software primarily for equipment or electronic systems. Of these 45 organizations, complete and unbiased delivered defect data and actual schedule delivery data was available for 17 organizations. The author will present in this paper the mathematical correlation between the practices employed by these organizations and defect density. This correlation can and is used to: a) Predict defect density b) Improve software development practices for the best return on investment.
Edge-Based Best-First Chart Parsing
Authors: Sharon Goldwater
Venue:  (1998)

Natural language grammars are often very large and full of ambiguities, making standard computer parsers too slow to be practical for many tasks. Best-first parsing attempts to address this problem by preferentially working to expand subparses that are judged ``good'''' by some probabilistic figure of merit. We explain the standard non-probabilistic and best-first chart parsing paradigms, then describe a new method of best-first parsing which improves upon previous work by ranking subparses at a more fine-grained level, speeding up parsing by approximately a factor of 20 over the best previous results. Moreover, these results are achieved with a higher level of accuracy than is obtained by parsing to exhaustion.