ppxscal/embedding_network huggingface dataset:
Linear Time Universal Coding of Tree Sources via FSM Closure
Authors: Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger
Venue: Proceedings of the Conference on Data Compression (2004)

Applying generalized context trees and their finite state machine closures, weshow that a two-pass version of Context a twice-universal lossless coding scheme for treemodels, can be implemented in linear encoding/decoding time. As it turns out, an optimal context selection rule and the corresponding context transitions are computationallynot more expensive than the various steps involved in the implementation of the Burrows-Wheeler transform (BWT) and use, in fact, similar tools. We also present a reversibletransform that displays the same "context deinterleaving" feature as the BWT but is naturally based on an optimal context tree. This transform offers insight into the workings ofthe BWT and the nature of its sub-optimality for twice-universal coding of tree models.
McGriff Treading Company Implements Service Contracts with Shared Savings
Authors: Prashant Yadav, David M. Miller, Charles P. Schmidt, Randy Drake
Venue: Interfaces (2003)

Costs related to tires are about three percent of the operating costs of a transport fleet. Fleet operators have been trying to reduce these costs by extending the tires' useful life and by increasing their use of retreaded tires. A program to reduce tire wear can pay off only if the fleet operator and the retreader cooperate. However, the typical contract between the two leads to conflicting incentives. We devised a service contract with shared savings and cautiously chosen parameters for McGriff Treading Company, Inc., that better aligns the incentives for reducing tire costs. Apart from the optimal choice of contract parameters, managerial performance metrics and information technology systems to monitor and track costs were the key factors in the company's transition from a product to a service company. McGriff Treading now successfully uses such contracts for its intermodal and trucking clients.
Construction of B-splines for generalized spline spaces generated from local ECT-systems
Authors: B. Buchwald, G. Mühlbach
Venue: Journal of Computational and Applied Mathematics (2003)

Certain spaces of generalized splines are considered which are constructed by pasting together smoothly linear combinations of local ECT-systems. For them a basis of splines having minimal compact supports is constructed. These functions that are called B-splines are obtained by solving certain interpolation problems. They can be normalized either to form a partition of unity or to have integral over the real line equal to one each.
Multimedia call admission control in mobile networks: a dynamical reservation-pool approach
Authors: Fei Hu, Neeraj K. Sharma
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The effective delivery of Multimedia traffic in next generation mobile cellular communication environment will become an increasingly important issue as cell sizes shrink to accommodate continuously large demand for high capacity. To provide the guaranteed mobile QoS for arriving multi-class calls, we should not only consider the regular latency requirement, but also minimize the dropping rate of handoff calls while at the same time controlling the blocking rate of new calls. In this paper, a new multi-class call admission control mechanism is proposed that is based on dynamically forming a reservation-pool for handoff requests. The prerequisite of this scheme is that wireless components can estimate future trajectory of mobile hosts with high degree of accuracy, which is possible in today's increasingly improved position location techniques such as GPS. In this work, we first develop the notion of servicing various multi-class connections based on priority determined using the combined analysis of mobile movement information and the desired QoS requirements of multimedia traffic. We also provide a practical framework for determining the occurrence time of handoff request reservations. For our simulation experiments, three kinds of timers are introduced for controlling the progress of discrete events. The simulation results show that the individual QoS criteria of multi-class traffic such as the handoff call dropping probability can be achieved within a targeted objective and the new call blocking probability is constrained to be below a given level. The proposed scheme is applicable to channel allocation of multi-class calls over high-speed multimedia wireless ATM networks.
Enzymatic spin catalysis involving O2
Authors: Boris F. Minaev, Hans Ågren
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Intermolecular interactions between dioxygen and other molecules induce a number of interesting optical [1,2,3] and biochemical phenomena [4,5,6]. A concerted insertion of the ground state dioxygen into an organic (diamagnetic) molecule is a spin-forbidden reaction [7]. Biological systems activate triplet dioxygen for controlled chemical syntheses via electron-transfer reactions and exchange interactions [4,5,6]. Manifestations of similar interactions can be found in the oxygen-induced fluorescence quenching of organic dyes and other photophysical processes [8]. The advantages of aerobic life and oxidative metabolism were important factors during evolution: These are mainly connected with the high exothermicity of oxidation of organic molecules. At the same time life strongly depends on the kinetic barriers to the molecular oxygen reactions. O2 is used as an oxidant in respiration of mammals and oxidative metabolic processes, reducing food to water and carbon dioxide. Although these transformations are equivalent to combustion, the oxygenase enzymes control the specific reaction pathways that store and smoothly release energy by subtle spin selective processes, whereas combustion is a radical chain process. It requires a high temperature initiation step and developes like explosion without strong regulation of energy release [7,9]. The kinetic constraints, which allows the controlled use of dioxygen by aerobic life in the presence of strong thermodynamic drive, are determined by spin selective interactions between dioxygen and oxygenase enzymes [4]. The first step in understanding these constraints should be connected with analysis of photophysical processes induced by O2 interaction with solvents and gases [7].
Object oriented programming: looking ahead to the year 2000
Authors: Richard C. Holt, Terry Stanhope, George Lausman
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

This paper examines the strategic importance of object oriented programming, looking ahead to the year 2000. It also surveys the coming impact of the more general area of object oriented computing, which includes analysis, design, databases, libraries, tools, standards, graphical user interfaces, and environments. A model of the software industry called the "software fountain" is used to explain how these developments are likely to impact the various parts of the industry. A discussion is presented on object oriented languages, concentrating on C++ and Smalltalk.
Virtual Surgery System
Authors: Zheng Lei, Edmond Cyril Prakash
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This paper describes the development of a virtualsurgery system, called VQSplat. The system takes volumedata as inputs and is capable of display multiple volumetricmodels, manipulating and editing (cutting) them. Thesystem uses a hierarchical multi-resolution point renderingsystem, which is derived from an existing point renderingsystem, QSplat [1]. The features of VQSplat are listed asfollows:¿ Use hierarchical multi-resolution point renderingsystem to render volume data,¿ Support multiple translucent object display,¿ Support object selection, manipulation, free cutting,¿ A unique hierarchical data structure to acceleraterendering process, as well as cutting, and objectsplitting,¿ Integrated support of raw volume data importing,image enhancement, normal estimation,¿ Portable code. Separate core library with userinterface.
Special Section: Evolutionary Design
Authors: Peter Bentley
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This issue of AIEDAM returns for the third time to the subject of evolutionary design. As in the previous two &ldquo;mini&rdquo; special issues (Volume 13, Numbers 3 and 5, 1999), this issue contains three papers focussing on the use of evolutionary algorithms to aid designers by automating part of the design process. These papers provide a showcase of the work of some of the original pioneers of this field as they demonstrate that their research is still at the forefront of developments in evolutionary design. As is fitting for this final special issue, the three papers all concentrate on what most designers recognize as the trickiest stage of the design process for computers: nonroutine, conceptual or innovative design.
Access control for mobile agents: The calculus of boxed ambients
Authors: Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2004)

Boxed Ambients are a variant of Mobile Ambients that result from dropping the open capability and introducing new primitives for ambient communication. The new model of communication is faithful to the principles of distribution and location-awareness of Mobile Ambients, and complements the constructs in and out for mobility with finer-grained mechanisms for ambient interaction. We introduce the new calculus, study the impact of the new mechanisms for communication of typing and mobility, and show that they yield an effective framework for resource protection and access control in distributed systems.
Single-ISA Heterogeneous Multi-Core Architectures: The Potential for Processor Power Reduction
Authors: Rakesh Kumar, Keith I. Farkas, Norman P. Jouppi, Parthasarathy Ranganathan, Dean M. Tullsen
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

This paper proposes and evaluates single-ISA heterogeneousmulti-core architectures as a mechanism to reduceprocessor power dissipation. Our design incorporatesheterogeneous cores representing different points inthe power/performance design space; during an application'sexecution, system software dynamically chooses themost appropriate core to meet specific performance andpower requirements.Our evaluation of this architecture shows significant energybenefits. For an objective function that optimizes forenergy efficiency with a tight performance threshold, for 14SPEC benchmarks, our results indicate a 39% average energyreduction while only sacrificing 3% in performance.An objective function that optimizes for energy-delay withlooser performance bounds achieves, on average, nearly afactor of three improvement in energy-delay product whilesacrificing only 22% in performance. Energy savings aresubstantially more than chip-wide voltage/frequency scaling.
On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices
Authors: T. Aaron Gulliver, Masaaki Harada
Venue: Designs, Codes and Cryptography (2004)

In this paper, codes over F5 with parameters [36, 18, 12], [48, 24, 15], [60, 30, 18], [64, 32, 18] and [76, 38, 21] which improve the previously known bounds on the minimum weight for linear codes over F5 are constructed from conference matrices. Through shortening and truncating, the above codes give numerous new codes over F5 which improve the previously known bounds on minimum weights.
On-Demand Grid Application Tuning and Debugging with the NetLogger Activation Service
Authors: Dan Gunter, Brian L. Tierney, Craig E. Tull, Vibha Virmani
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Typical Grid computing scenarios involve manydistributed hardware and software components. The morecomponents that are involved, the more likely it is that oneof them may fail. In order for Grid computing to succeed,there must be a simple mechanism to determine whichcomponent failed and why. Instrumentation of all Gridapplications and middleware is an important part of thesolution to this problem. However, it must be possible tocontrol and adapt the amount of instrumentation dataproduced in order to not be flooded by this data. In thispaper we describe a scalable, high-performanceinstrumentation activation mechanism that addresses thisproblem.
Modeling and visualizing uncertainty in a global water balance model
Authors: James R. Miller, Daniel C. Clibum, Johannes J. Feddema, Terry A. Slocum
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Public policy makers and others wishing to understand the potential impact of our actions on the environment need a tool to simulate and visualize relevant processes. Present models and the data on which they operate have considerable variability which translates into uncertainty in model results. Decision makers must understand and consider not only raw model results, but also the uncertainties associated with them. As an example, we describe a tool that evaluates a global water balance model and presents visualizations of both the results and the associated uncertainties.
On the design of correct and optimal dynamical systems and games
Authors: Michel Sintzoff
Venue: Information Processing Letters (2003)

There exist various methods for designing dynamical systems and dynamical games in order to ensure correctness and optimality. In the paper, they are systematically organized as follows. Two variational principles are recalled. Firstly, solutions must be stationary: this leads to necessary conditions and to gradient algorithms. Secondly, solutions, if any, must be optimal or correct; this leads to sufficient conditions and to dynamic-programming algorithms. Methods based on these principles allow to design dynamical systems and games such as control systems, hybrid systems and reactive ones. Time may be discrete or continuous; correctness can be viewed as an abstraction of optimality. The structured presentation of design methods is intended to foster their understanding, integration, cross-fertilization and improvement.
Non-structural subtype entailment in automata theory
Authors: Joachim Niehren, Tim Priesnitz
Venue: Information and Computation (2003)

Decidability of non-structural subtype entailment is a long-standing open problem in programming language theory In this paper, we apply automata theoretic methods to characterize the problem equivalently by using regular expressions and word equations. This characterization induces new results on non-structural subtype entailment, constitutes a promising starting point for further investigations on decidability, and explains for the first time why the problem is so difficult. The difficulty is caused by implicit word equations that we make explicit.
Finding similar identities among objects from multiple web sources
Authors: Joyce C. P. Carvalho, Altigran S. da Silva
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

When integrating data from multiple Web sources, objects can exist in different formats and structures, making it difficult to identify those that can be matched together. In this paper, we propose an identification approach to finding similar identities among objects from multiple Web sources. In this approach, object identification works like the relational join operation where a similarity function takes the place of the equality condition. This similarity function is based on information retrieval techniques. Our approach differs from others in the literature since it can be used to identify objects more complexly structured (e.g., XML documents) and not only objects with a flat structure such as relations. The effectiveness of our approach is demonstrated by experimental results with real Web data sources from different domains, that reach precision levels above 75%.
Efficient region-based image retrieval
Authors: Roger Weber, Michael Mlivoncic
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Region-based image retrieval(RBIR) was recently proposed as an extension of content-based image retrieval(CBIR). An RBIR system automatically segments images into a variable number of regions, and extracts for each region a set of features. Then, a dissimilarity function determines the distance between a database image and a set of reference regions. Unfortunately, the large evaluation costs of the dissimilarity function are restricting RBIR to relatively small databases. In this paper, we apply a multi-step approach to enable region-based techniques for large image collections. We provide cheap lower and upper bounding distance functions for a recently proposed dissimilarity measure. As our experiments show, these bounding functions are so tight, that we have to evaluate the expensive distance function for less than 0.5\%of the images. For a typical image database with more than 370,000images, our multi-step approach improved retrieval performance by a factor of more than5 compared to the currently fastest methods.
Messages in typed languages
Authors: J. G. Hunt
Venue: ACM SIGPLAN Notices (1979)

Messages are increasingly being used for interprocess communication. The problem of introducing messages into typed languages is considered, and a solution in terms of typed message-channels is presented. Our particular treatment permits dynamic connexions, including secure linking of separately-compiled programmes, and also features nondeterminacy, thereby enabling automatic resource-scheduling without monitors. Implementation considerations are discussed, and a comparison with the work of other authors is given.
WaveScalar
Authors: Steven Swanson, Ken Michelson, Andrew Schwerin, Mark Oskin
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Silicon technology will continue to provide an exponential increasein the availability of raw transistors. Effectively translatingthis resource into application performance, however,is an open challenge. Ever increasing wire-delay relativeto switching speed and the exponential cost of circuit complexitymake simply scaling up existing processor designs futile.In this paper, we present an alternative to superscalardesign, WaveScalar. WaveScalar is a dataflow instructionset architecture and execution model designed for scalable,low-complexity/high-performance processors. WaveScalar isunique among dataflow architectures in efficiently providingtraditional memory semantics. At last, a dataflow machinecan run "real-world" programs, written in any language,without sacrificing parallelism.The WaveScalar ISA is designed to run on an intelligentmemory system. Each instruction in a WaveScalar binary executesin place in the memory system and explicitly communicateswith its dependents in dataflow fashion. WaveScalararchitectures cache instructions and the values they operateon in a WaveCache, a simple grid of "alu-in-cache" nodes.By co-locating computation and data in physical space, theWaveCache minimizes long wire, high-latency communication.This paper introduces the WaveScalar instruction setand evaluates a simulated implementation based on currenttechnology. Results for the SPEC and Mediabench applicationsdemonstrate that the WaveCache out-performs an aggressivelyconfigured superscalar design by 2-7 times, withample opportunities for future optimizations.
Signpost: Matching Program Behavior against Known Faults
Authors: Mike Andrews
Venue: IEEE Software (2003)

Modern computer programs are often composite systems, relying on numerous commercial component libraries.When a program fails, the causes of that failure will often be a complex mix of interactions between developer-written code and library code.Debugging programs of this type can be difficult as the programmer is forced to try and isolate the source of faulty behavior in multiple components from multiple sources some of which they know well and others in which they may have no experience. Often there are large areas of code to examine and it is not always clear if the problem is due to a bug in the programmer's code or in a dependant library.
A Characterization of Hybridized Mixed Methods for Second Order Elliptic Problems
Authors: Bernardo Cockburn, Jayadeep Gopalakrishnan
Venue: SIAM Journal on Numerical Analysis (2004)

In this paper, we give a new characterization of the approximate solution given by hybridized mixed methods for second order self-adjoint elliptic problems. We apply this characterization to obtain an explicit formula for the entries of the matrix equation for the Lagrange multiplier unknowns resulting from hybridization. We also obtain necessary and sufficient conditions under which the multipliers of the Raviart--Thomas and the Brezzi--Douglas--Marini methods of similar order are identical.
Solution of Nonconvex Nonsmooth Stochastic Optimization Problems
Authors: Yu. M. Ermoliev, V. I. Norkin
Venue: Cybernetics and Systems Analysis (2003)

Different classes of nonconvex nonsmooth stochastic optimization problems are analyzed, their generalized differentiability properties and necessary optimality conditions are studied, and a technique for calculating stochastic gradients is developed. For each class of the problems, corresponding solution methods are proposed, in particular, generalizations of the stochastic quasigradient method.