ppxscal/embedding_network huggingface dataset:
The Design and Implementation of Real-Time CORBA 2.0: Dynamic Scheduling in TAO
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

In an emerging class of open distributed real-time andembedded (DRE) systems with stringent but dynamicQoS requirements, there is a need to propagate QoSparameters and enforce task QoS requirements acrossmultiple endsystems in a way that is simultaneouslyefficient and adaptable. The Object ManagementGroup's (OMG) Real-Time CORBA 2.0 specification(RTC2) defines a dynamic scheduling framework forpropagating and enforcing QoS parametersdynamically in standard CORBA middleware.This paper makes two contributions toresearch on middleware for open DRE systems. First,it describes the design and capabilities of the RTC2dynamic scheduling framework provided by TAO,which is our open-source CORBA standards-basedObject Request Broker (ORB). Second, it describes andsummarize the results of empirical studies we haveconducted to validate our RTC2 framework in thecontext of open DRE systems. The results of thoseexperiments show that a range of policies for adaptivescheduling and management of distributable threadscan be enforced efficiently in standard middleware foropen DRE systems.
Supporting Dynamic QoS in Linux
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

This work is an application of the Variable-Rate Execution(VRE) model in Linux to support dynamic Quality ofService (QoS). Based on conventional time-sharing schedulingalgorithms, Linux does not adequately support QoS requirements.The VRE scheduler can assign a specified executionrate to any application, and dynamically adjust theexecution rate during runtime. Rate controller componentsare introduced to adjust a task's execution rate based on pre-definedrules and runtime feedbacks, such as the suspensiontime, the queue length, and so on.A significant feature of this work is its ability to supportlegacy applications at the binary level. On conventional operatingsystems, millions of applications have been built undertime-sharing schedulers, which we call legacy applications.Under the VRE model, a legacy application can obtaina guaranteed variable execution rate. We also designeda simple default rate controller for legacy multimedia applications.The Linux kernel was slightly modified in our implementationto achieve reconfigurability. Both the VRE schedulerand the default rate controller are implemented as Linuxloadable modules, which can be dynamically loaded into thekernel to replace the Linux scheduler or change the behaviorof the scheduler. We provide a set of interfaces for usersto design and use their own schedulers and rate controllers.
PPM-Chain De novo Peptide Identification Program Comparable in Performance to Sequest
Authors: Robert M. Day, Andrey Borziak, Andrey Gorin
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Recently, we introduced Probability Profile Method (PPM), which utilizes neutral-loss neighborhoods around each peak in MS/MS spectrum to "label" it: to assign a probability that the peak in question belongs to one of the specific categories (such as b- or y-ion peaks). Here we present the PPM-chain program ¿ a PPM-based tool for de novo protein tag identification. De novo peptide identification involves finding a connected sequence of ion peaks separated by amino acid mass intervals, corresponding to a tag - partial peptide of the source protein. In the existing approaches the number of the possible connected sequences may run into hundreds of thousands, and it increases exponentially with the desired length of the tag. PPM can be used to locate high probability islands, containing very pure sets of b- and y-ion peaks, thereby reducing computational complexity and sharply increasing precision of tagging. In addition, the obtained tags can be reliably ranked using PPM-derived probabilities assigned to the connected peaks. The value of peptide tags was demonstrated on a large database of ~20,000 spectra. With the additional flanking mass constraints PPMchain shows precision and coverage similar to the field industrial-power standard ¿ Sequest program, while providing a set of novel unique capabilities and significantly outperforming Sequest in speed.
Relativized NP Search Problems and Propositional Proof Systems
Authors: Joshua Buresh-Oppenheim, Tsuyoshi Morioka
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

An NP search problem is the problem of finding a witnessto a given NP predicate, and TFNP is the class of total NPsearch problems. TFNP contains a number of subclassescontaining natural problems; for example, PLS is the classof efficient local search heuristics. These classes are characterizedby the combinatorial principle that guarantees theexistence of a solution; for example, PLS is the class of suchproblems whose totality is assured by the principle "everydag with at least one edge has a sink."We show many strong connections between these searchclasses and the computational power ¿ in particular theproof complexity ¿ of their underlying principles. Theseconnections, along with lower bounds in the propositionalproof systems Nullstellensatz and bounded-depth LK, allowus to prove several new relative separations amongPLS, and Papadimitriouýs classes PPP, PPA, PPAD, andPPADS.
Type-indexed data types
Authors: Ralf Hinze, Johan Jeuring, Andres Löh
Venue: Science of Computer Programming (2004)

A polytypic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of polytypic functions are the functions that can be derived in Haskell, such as show, read, and '=='. More advanced examples are functions for digital searching, pattern matching, unification, rewriting, and structure editing. For each of these problems, we not only have to define polytypic functionality, but also a type-indexed data type: a data type that is constructed in a generic way from an argument data type. For example, in the case of digital searching we have to define a search tree type by induction on the structure of the type of search keys. This paper shows how to define type-indexed data types, discusses several examples of type-indexed data types, and shows how to specialize type-indexed data types. The approach has been implemented in Generic Haskell, a generic programming extension of the functional language Haskell.
From the Editors: Open Source Revisited
Authors: Eric Allman, Marshall Kirk McKusick
Venue: Queue (2004)

In our first open source theme issue last year (ACM Queue 1(5), July-August 2003), we focused on business issues such as using open source software as a basis for a commercial product. We knew that this was an important topic, but predicted that many of our readers might find it boring. We were wrong. That issue remains among the most responded-to issues of Queue to date. So with that response, we are revisiting the open source theme.
Automatic Generation of Virtual Prototypes
Authors: P. Belanovic, M. Holzer, B. Knerr, M. Rupp, G. Sauzon
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

Virtual prototyping as an embedded system design techniquehas the potential to significantly increase efficiency ofthe design process. An environment for automatic generationof virtual prototypes (VPs) directly from algorithmic-leveldescriptions is presented here. It is implemented aspart of a unified design methodology and produces VSIAcompliant VPs. When applied to an industrial design flowof a UMTS receiver, this environment for automatic generationof VPs produced significant speedups over traditionalmanual VP creation, with savings in the order of hundredsto thousands of person-hours.
Convergence of multivariate non-stationary vector subdivision schemes
Authors: Maria Charina, Costanza Conti
Venue: Applied Numerical Mathematics (2004)

Any non-stationary subdivision scheme is associated with masks that may vary from one scale to the next finer one. In this paper we investigate the convergence of non-stationary vector subdivision schemes in Zd. In particular, we present a strategy for deriving non-stationary difference subdivision schemes whose zero convergence guarantee the convergence of the original schemes. This strategy is similar to the one presented in [C. Conti, M. Charina, Regularity of multivariate vector subdivision schemes, in preparation], where the convergence and the regularity of stationary multivariate vector subdivision schemes is analyzed.
Lessons Learned from Porting Vector Computer Applications onto Non-Uniform Memory Access Scalar Machines
Authors: Takao Hatazaki
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Although recent large-scale scalar multiprocessor systems have good potential to overwhelm vector machines even in vector-specific application areas, the applicability has not been systematically studied. We ported 2 typical vector applications onto 2 different scalar NUMA platforms. We found that trivial array dimension reordering drastically affect performance. We also show that vector-specific programming methods could hinder scalar/NUMA system's performance. A general workaround we developed is described along with a discussion for platforms' memory systems characteristics.
Experiences with defect prevention
Authors: R. G. Mays, C. L. Jones, G. J. Holloway, D. P. Studinski
Venue: IBM Systems Journal (1990)

Defect Prevention is the process of improving quality and productivity by preventing the injection of defects into a product. It consists of four elements integrated into the development process: (1) causal analysis meetings to identify the root cause of defects and suggest preventive actions; (2) an action team to implement the preventive actions; (3) kickoff meetings to increase awareness of quality issues specific to each development stage; and (4) data collection and tracking of associated data. The Defect Prevention Process has been successfully implemented in a variety of organizations within IBM, some for more than six years. This paper discusses the steps needed to implement this process and the results that may be obtained. Data on quality, process costs, benefits, and practical experiences are also presented. Insights into the nature of programming errors and the application of this process to a variety of working environments are discussed.
Iterative-Based Minimization of Unary 4-Valued Functions for Current-Mode CMOS Realization
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper, we introduce an iterative-basedalgorithm for synthesis of near-minimalcost 4-valued unary functionsrealized using current-mode CMOScircuits. The cost of a circuit is measuredin terms of the chip area needed. Theintroduced algorithm is used to constructa universal table that contains all 256 4-valued unary functions, their realizations,and their realized costs. Starting with a cost-table consisting of 2400 functionswith their known published costs (seed costs), the algorithm generates newfunctions at reduced costs by using the PMirror,N-Mirror, SUM, P-Switch or the NSwitchas output operators. Experimentalresults indicate that there has been costimprovement in 227 of the 256 functions.
Real-time knot-tying simulation
Authors: Joel Brown, Jean-Claude Latombe, Kevin Montgomery
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

The real-time simulation of rope, and knot tying in particular, raises difficult issues in contact detection and management. Some practical knots can only be achieved by complicated crossings of the rope, yielding multiple simultaneous contacts, especially when the rope is pulled tight. This paper describes a graphical simulator that allows a user to grasp and smoothly manipulate a virtual rope and to tie arbitrary knots, including knots around other objects, in real time. A first component of the simulator computes the global configuration of the rope based on user interactions. Another component of the simulator precisely detects self-collisions in the rope as well as collisions with other objects. Finally, a third component manages collisions to prevent penetration, while making the rope slide with some friction along itself and other objects, so that knots can be pulled tight in a realistic manner. An additional module uses recent results from knot theory to identify, also in real time, which topological knots have been tied. This work was motivated by surgical suturing, but simulation in other domains, such as sailing and rock climbing, could also benefit from it.
A Polynomial Time Algorithm for Non-Disjoint Decomposition of Multiple-Valued Functions
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper addresses the problem of non-disjoint decompositionof multiple-valued functions. First, we show thatthe problem of computing non-disjoint decompositions of amultiple-valued function is related to the problem of findingmultiple-vertex dominators of a logic circuit, representingthe function. Second, we present an O(n^k) algorithm forcomputing all multiple-vertex dominators of a fixed size k,where n is the number of gates of the logic circuit. Our resultis important because no polynomial-time algorithm forfinding all possible non-disjoint decompositions of multiple-valuedfunctions is known. The presented approach allowsus computing a certain subset of non-disjoint decompositions(all reflected in a given circuit structure) in polynomialtime. A set of experiments on benchmark circuits illustratesthe efficiency of our approach.
Analog Macromodeling using Kernel Methods
Authors: Joel Phillips, João Afonso, Arlindo Oliveira, L. Miguel Silveira
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper we explore the potential of using a general class offunctional representation techniques, kernel-based regression, inthe nonlinear model reduction problem. The kernel-based view-pointprovides a convenient computational framework for regression,unifying and extending the previously proposed polynomialand piecewise-linear reduction methods. Furthermore, as many familiarmethods for linear system manipulation can be leveraged ina nonlinear context, kernels provide insight into how new, morepowerful, nonlinear modeling strategies can be constructed. Wepresent an SVD-like technique for automatic compression of non-linearmodels that allows systematic identification of model redundanciesand rigorous control of approximation error.
Modeling a Network Processor Using Object Oriented Techniques
Authors: Liam Noonan, Colin Flanagan
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper we examine how a network processor can be modeled using object-oriented techniques. We examine the Intel IXP 1200 network processor and discuss how the object-oriented language POOSL was utilized to allow an evaluation of a system before implementing it with hardware and software components. With the case study of the IXP 1200, we illustrate the suitability of object-oriented languages for system level modeling and design exploration.
Ritterschlag
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

Held in prison by dragons, the beautiful princess cries. This full CC short film was made by a small team in 13 months. Copyright held by creator.
Optimal strategies for testing nondeterministic systems
Authors: Lev Nachmanson, Margus Veanes, Wolfram Schulte, Nikolai Tillmann, Wolfgang Grieskamp
Venue: ACM SIGSOFT Software Engineering Notes (2004)

This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: states and choice points. Choice points represent the nondeterministic behaviour of the implementation under test (IUT). Edges represent transitions. They have costs and probabilities. Test case generation in this setting amounts to generation of a game strategy. The two players are the testing tool (TT) and the IUT. The game explores the graph. The TT leads the IUT by selecting an edge at the state vertices. At the choice points the control goes to the IUT. A game strategy decides which edge should be taken by the TT in each state. This paper presents three novel algorithms 1) to determine an optimal strategy for the bounded reachability game, where optimality means maximizing the probability to reach any of the given final states from a given start state while at the same time minimizing the costs of traversal; 2) to determine a winning strategy for the bounded reachability game, which guarantees that given final vertices are reached, regardless how the IUT reacts; 3) to determine a fast converging edge covering strategy, which guarantees that the probability to cover all edges quickly converges to 1 if TT follows the strategy.
A Fast and Stable Well-Balanced Scheme with Hydrostatic Reconstruction for Shallow Water Flows
Authors: Emmanuel Audusse, François Bouchut, Marie-Odile Bristeau, Rupert Klein, Benoît Perthame
Venue: SIAM Journal on Scientific Computing (2004)

We consider the Saint-Venant system for shallow water flows, with nonflat bottom. It is a hyperbolic system of conservation laws that approximately describes various geophysical flows, such as rivers, coastal areas, and oceans when completed with a Coriolis term, or granular flows when completed with friction. Numerical approximate solutions to this system may be generated using conservative finite volume methods, which are known to properly handle shocks and contact discontinuities. However, in general these schemes are known to be quite inaccurate for near steady states, as the structure of their numerical truncation errors is generally not compatible with exact physical steady state conditions. This difficulty can be overcome by using the so-called well-balanced schemes. We describe a general strategy, based on a local hydrostatic reconstruction, that allows us to derive a well-balanced scheme from any given numerical flux for the homogeneous problem. Whenever the initial solver satisfies some classical stability properties, it yields a simple and fast well-balanced scheme that preserves the nonnegativity of the water height and satisfies a semidiscrete entropy inequality.
A Formal Model for Hierarchical Policy Contexts
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Role-based access control (RBAC) models specify a policyinterface for security administration, but do not provideguidelines for how large organisations should manage theirroles. Parameterised RBAC systems are even more expressive;however, this adds to the risk of dangerous mistakesduring policy specification. In this paper we define a formalmodel for hierarchical policy contexts: an RBAC meta-policyapproach for subdividing the administration of large-scalesecurity environments and for enforcing informationflow restrictions over policies.
Closing Gaps by Clustering Unseen Directions
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Although in recent years the 3D-scanning field hasreached a good level of maturity, it is still far from beingperceived by common users as a 3D-photography approach,as simple as standard photography is. The mainreason for that is that obtaining good 3D models withouthuman intervention is still very hard. In particular,two problems remain open: automatic registration of singleshots and planning of the acquisition session. In thispaper we address the second issue and propose a solutionto improve the coverage of automatically acquired objects.Rather than searching for the next-best-view in orderto minimise the number of acquisitions, we propose a simpleand easy-to-implement algorithm limiting our scope toclosing gaps (i.e. filling unsampled regions) in roughly acquiredmodels. The idea is very simple: detect holes in thecurrent model and cluster their estimated normals in orderto determine new views. Some results are shown tosupport our approach.
The Combination of Kaiser Window and Moving Average for the Low-Pass Filtering of the Remote ECG Signals
Authors: Ying-Wen Bai, Wen-Yang Chu, Chien-Yu Chen, Yi-Ting Lee, Yi-Ching Tsai, Cheng-Hung Tsai
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

After an analog ECG signal is transferred into digital format, a suitable digitalfilter can be used to suppress the high-frequency embedded noise. In this paper, we usethe equiripple FIR low-pass filter by superimposing of the optimal method, theButterworth IIR low-pass filter, the 8-point moving-average filter, and the FIR filterdesigned by using a Kaiser window. Furthermore, we combine the 8-pointmoving-average filter with the FIR filter designed by using a Kaiser window. In addition,we use the mean square error (M. S. E.) to estimate the effect of the digital filters in orderto compare the reduction of the embedded high-frequency noise. Hence, we compute themean square error with respect to the order, N, of these filters and plot the relationshipbetween M. S. E. and N. Finally, we find the relationship between the CPU time and N.
Analysis of state exposure control to prevent cheating in online games
Authors: Kang Li, Shanshan Ding, Doug McCreary, Steve Webb
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Cheating has become a serious threat to the online game industry. One common type of cheating is accessing game states that are not supposed to be exposed to the players. In this paper, we evaluate a few information dissemination strategies that limit the state exposure to the client, measuring the delay introduced to the players and the system resource requirements at the game server. Our measurement is based on OpenGladiator, a multi-user, real-time strategy game that is similar to Warcraft but in open-source. We found that by performing careful on-demand preloading, we can significantly reduce the unnecessary states exposed to a client without introducing any additional delay to the players. Our measurement results show that the on-demand strategy comes with a increment to the server's CPU load. However, it also significantly reduces the server's network bandwidth consumption, which is a major cost of running a game server in the current Internet.
Image Subtraction for Real Time Moving Object Extraction
Authors: Shahbe Mat Desa, Qussay A. Salih
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper studies the task of extracting moving object from static irrelevant background. The implementation is prepared for the purpose of real time application. Some image processing concepts related to this study are first presented and improvement is proposed. We have obtained motion mask by applying background subtraction and consecutive frame differencing. We also propose a reliable background update and noise reduction operator to facilitate the result of moving object extraction. The analysis and result are obtained by using Matlab Image Processing Toolbox Version 6.01 [1].