ppxscal/embedding_network huggingface dataset:
RDB: A System for Incremental Replay Debugging
Authors: Michael W. Shapiro
Venue:  (1997)

To facilitate the process of tracking program bug symptoms to their causes while debugging, we have developed a robust architecture for program tracing and replay. RDB is a framework for program instrumentation which modifies user programs to perform complete and highly efficient tracing of an execution including interactions with the operating system and asynchronous interrupts. We have developed a library which can be plugged into existing debugging tools to add trace-and-replay functionality, and we have developed a new prototype debugger using our library which provides replay control and flowback capabilities. We discuss the design and implementation of all aspects of the system and suggest future debugging tools and techniques based on this technology. This paper is the discussion of the author''s project for the degree of Master of Science, and is the culmination of two years of work in this area with Professor Robert H.B. Netzer.
Ordering Problems Approximated: Register Sufficiency, Single-Processor Scheduling and Interval Graph
Authors: Ajit Agrawal, Philip Klein, R. Ravi
Venue:  (1991)

In this paper, we give the first poly-time approximation algorithms for three problems in combinatorial optimization. The first problem is register sufficiency where, given a computation dag, we are required to find the minimum number of registers needed to compute it. This problem arises in compiler optimization, in the task of register allocation. The second problem is single-processor scheduling to minimize weighted sum of completion times, subject to precedence constraints. The third problem, interval graph completion, is finding a minimum-size interval graph containing the input graph as a subgraph. All of the above problems are NP-complete; our algorithms output solutions that are within a polylogarithmic factor of optimal. To achieve these bounds, we make use of a technique developed and first applied by Leighton and Rao, together with a technique of Hansen.
Code Compression Techniques for Embedded Systems and Their Effectiveness
Authors: KRISHNAN SUNDARESAN, NIHAR R. MAHAPATRA
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Code compression techniques have been used widely inembedded systems to decrease the amount of storage resourcesneeded or to decrease power consumption, and insome cases, to improve performance too. This paper evaluates,using cache models, the performance, power, andcost benefits that code compression can provide in an instructionmemory hierarchy. It also compares several importantcode compression schemes on a common platformand using a common set of benchmarks to gauge their effectiveness.
A Quasi-Newton L2-Penalty Method for Minimization Subject to Nonlinear Constraints
Authors: Thomas F. Coleman, Wei Yuan
Venue:  (1995)

We present a modified L2 penalty function method for equality constrained optimization problems. The pivotal feature of our algorithm is that at every iterate we invoke a special change of variables to improve the ability of the algorithm to follow the constraint level sets. This change of variables gives rise to a suitable block diagonal approximation to the Hessian which is then used to construct a quasi-Newton method. We show that the complete algorithm is globally convergent with a local Q-superlinearly convergence rate. Preliminary results are given for a few problems.
A Constructive Method for Exploiting Code Motion
Authors: Luiz C. V. dos Santos, M. J. M. Heijligers, C. A. J. Van Eijk, J. T. J. Van Eijndhoven, J. A. G. Jess
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

In this paper we address a resource-constrained optimization problem for behavioral descriptions containing conditionals. In high-level synthesis of ASICs or in code generation for ASIPs, most methods use greedy choices in such a way that the search space is limited by the applied heuristics. For example, they might miss opportunities to optimize across basic block boundaries when treating conditional execution. We propose an approach based on local search and present a constructive method to allow unrestricted types of code motion, while keeping optimal solutions in the search space. A code-motion pruning technique is presented for cost functions optimizing schedule lengths. A technique for treating concurrent flows of execution is also described.
Markov Random Fields with Efficient Approximations
Authors: Yuri Boykov, Olga Veksler, Ramin Zabih
Venue:  (1997)

Markov Random Fields (MRF''s) can be used for a wide variety of vision problems. In this paper we address the estimation of first-order MRF''s with a particular clique potential that resembles a well. We show that the maximum {\em a posteriori} estimate of such an MRF can be obtained by solving a multiway cut problem on a graph. This allows the application of near linear-time algorithms for computing provably good approximations. We formulate the visual correspondence problem as an MRF in our framework, and show that this yields quite promising results on real data with ground truth.
Adobe Photoshop Master Class: John Paul Caponigro, 2 edition
Authors: John Paul Caponigro
Venue:  (2002)

:Adobe Photoshop Master Class: John Paul Caponigro, 2nd Edition is no ordinary book on Photoshop. It is a true master class by renowned artist and photographer John Paul Caponigro, in which he shares his insights and discoveries as a visual artist. Although the book contains step-by-step tutorials that deconstruct some of Caponigro's most inspirational photographic works, the emphasis is on technique and visual problem solving, enabling you to take the concepts and apply them to your own unique projects. Updated for Photoshop 7, the revised edition of this master class includes numerous new and revised chapters that explain how to achieve color accuracy and extend dynamic range, direct attention through focus, control atmospheric perspective, and more. You don't have to be a professional photographer to appreciate and learn from this beautiful and informative book—Caponigro starts out with a section covering Photoshop essentials before moving on to more advanced artistic techniques. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Towards a logical reconstruction of information retrieval theory
Authors: Fabrizio Sebastiani
Venue:  (1998)

We here expand on a previous paper concerning the role of logic in information retrieval (IR) modelling. In that paper, among other things, we had pointed out how different ways of understanding the contribution of logic to IR have sprung from the (always unstated) adherence to either the total or the partial knowledge assumption. Here we make our analysis more precise by relating this dichotomy to the notion of vividness, as used in knowledge representation, and to another dichotomy which has had a profound influence in database theory, namely the distinction between the proof-theoretic and the model-theoretic views of a database, spelled out by Reiter in his TEL:: +39.050.593407 EMAIL:: fabrizio@iei.pi.cnr.it
New Upper Bounds on Generalized Weights
Authors: A. Ashikhmin, A. Barg, S. Litsyn
Venue:  (1998)

We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes.
A Pattern Matching Framework for Software Architecture Recovery and Restructuring
Authors: Kamran Sartipi, Kostas Kontogiannis, Farhad Mavaddat
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

This paper presents a framework for software architecture recovery and restructuring. The user specifies a high-level abstraction view of the system using a structured pattern language. A pattern-matching engine provides an optimal match between the given pattern and a decomposition of the legacy system entities by satisfying the inter/intra-module constraints defined in the pattern.The data mining technique Apriori is used by the matching engine to reveal meaningful data and control flow properties of the target system and limit the search space. A branch and bound search algorithm using a score function, models the constraints in the pattern as a Valued Constraint Satisfaction Problem (VCSP), and assists in searching for an optimal match between the given pattern and the target system.
Resource Allocation Control Protocols for Multicast Data Transport
Authors: K. Ravindran, T. J. Gong
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The paper describes a model of protocol mechanisms for `integrating' resource reservations and multicast path setups. The protocol model is based on shared tree-structured channels in the network to which sources and destinations can connect to exchange data. The paper employs `flow aggregation' as a construct for realization of resource reservation protocols, as suggested by RSVP. Here, multiple flows that share a link in a tree are merged into a single equivalent flow for resource allocation purposes. Mechanisms to generate a composite flow from a set of flows and vice versa, constitute the functional elements of resource reservation protocols (e.g., bandwidth estimation for aggregated flows). These protocol elements can be parameterized with user-level flow specifications and topological placement of source and destination entities, for making resource allocation and path setup decisions. The novel idea is in casting the routing subsystems of multicast networks with RSVP-style resource, allocation functions.
The Net Disk Architecture for Dynamic Load Balancing among Disk Arrays
Authors: Tetsuro Kakeshita, Shenglin Zhang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Disk array is a proposed approach for high performance I/O subsystem. It requires dynamic load balancing against varying access to prevent some disks from becoming bottlenecks. Thus in the previous work, we connected the disks by a bus and developed a local migration strategy to migrate data items with high access frequency within the disk array. However, the bus may become a bottleneck when too many disks are connected to it. To solve this problem, here we propose the Net Disk architecture that contains multiple disk arrays connected by a crossbar network. Based on the load balancing within each disk array, a global migration strategy is developed to maintain load balancing among disk arrays. Therefore, load balancing is established for the entire architecture. Compared with conventional data reallocation techniques that are performed as a background process, dynamic load balancing is effectively maintained even though disk arrays are burdened with heavy load by the proposed architecture.
The Solution of Nonlinear Operator Equations by A-Stable Integration Techniques
Authors: Paul T. Boggs
Venue:  (1970)

NO SUPPLIED
A Constraint Satisfaction Approach to Parametric Differential Equations
Authors: M. Janssen, P. Van Hentenryck, Y. Deville
Venue:  (2001)

Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical methods do not apply. Interval methods provide a way to approach these problems but they often suffer from a loss in precision and high computation costs. This paper presents a constraint satisfaction approach that enhances interval methods with a pruning step based on a global relaxation of the problem. Theoretical and experimental evaluations show that the approach produces significant improvements in accurracy and/or efficiency over the best interval methods.
Dynamic Coding Technique For Low-Power Data Bus
Authors: Hongping Li, John K. Antonio, Sudarshan K. Dhall
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Designing chips for lower power applications is one ofthe most important challenges faced by the VLSI designers.Since the power consumed by I/O pins of a CPU is a significant source of power consumption, work has been doneon developing encoding schemes for reducing switching activity on external buses. In this paper, we propose a newcoding technique, namely, the Dynamic Coding Scheme,for low-power data bus. Our method considers two logical groupings of the bus lines, each being a permutation ofthe bus lines, and dynamically selects that grouping whichyields the minimum number of transitions.
EMPOWER: A Scalable Framework for Network Emulation
Authors: Pei Zheng, Lionel M. Ni
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The development and implementation of new network protocols and applications need accurate, scalable, reconfigurable, and inexpensive tools for debugging, testing, performance tuning and evaluation purposes. Network emulation provides a fully controllable laboratorynetwork environment in which protocols and applications can be evaluated against predefined network conditions and traffic dynamics. In this paper, we present a newframework of network emulation EMPOWER. EMPOWER is capable of generating a decent network model based on the information of an emulated network, and then mapping the model to an emulation configuration in the EMPOWER laboratory network environment. It is highly scalable not only because the number of emulator nodes may be increased without significantly increasing the emulation time or worrying about parallel simulation, but also because the network mapping scheme allows flexible ports aggregation and derivation. By dynamically configuring a virtual device, effects such as link bandwidth, packet delay, packet loss rate, and out-of-order delivery, can be emulated.
Recent advances in access control models
Authors: Sushil Jajodia, Duminda Wijesekera
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

Advances in application areas bring new dimensions to access control needs. This paper discusses several access control models that have been recently proposed to address these emerging needs including models that provide policy-neutral flexible access control and their efficient implementations; models that incorporate richer semantics for access control in emerging Internet applications, such as adding provisions; and models for XML documents. We also discuss the recent work on policy algebras and subject identity issues in secure federations.
Synthesizing Efficient Out-of-Core Programs for Block Recursive Algorithms Using Block-Cyclic Data Distributions
Authors: Zhiyong Li, John Reif,  H, K S S Gupta.
Venue:  (1996)

In this paper, we present a framework for synthesizing I/O efficient out-of-core programs for block recursive algorithms, such as the fast Fourier transform (FFT) and block matrix transposition algorithms. Our framework uses an algebraic representation which is based on tensor products and other matrix operations. The programs are optimized for the {\it striped} Vitter and Shriver`s two-level memory model in which data can be distributed using various $cyclic(B)$ distributions in contrast to the normally used {\it physical track} distribution $cyclic(B_d)$, where $B_d$ is the physical disk block size. We first introduce {\it tensor bases} to capture the semantics of block-cyclic data distributions of out-of-core data and also data access patterns to out-of-core data. We then present program generation techniques for tensor products and matrix transposition. We accurately represent the number of parallel I/O operations required for the synthesized programs for tensor products and matrix transposition as a function of tensor bases and data distributions. We introduce an algorithm to determine the data distribution which optimizes the performance of the synthesized programs. Further, we formalize the procedure of synthesizing efficient out-of-core programs for tensor product formulas with various block-cyclic distributions as a dynamic programming problem. We demonstrate the effectiveness of our approach through several examples. We show that the choice of an appropriate data distribution can reduce the number of passes to access out-of-core data by as large as eight times for a tensor product, and the dynamic programming approach can largely reduce the number of passes to access out-of-core data for the overall tensor product formulas.
The Paradigmatic Dimension of Italian Verb Inflection
Authors: Vito Pirrelli, Marco Battista
Venue:  (1998)

This paper describes the inflectional system of Italian verbs in terms of the shape of verb stems and their distribution in a paradigm. In this respect, our investigation follows the mainstream of work on the role of paradigms in the description of the Morphology of world languages with a rich inflection, as it has developed over the last twenty five years, since Matthews'' influential analysis of Latin Inflection. In particular, we propose here a formal descriptive framework whereby several more or less recent insights into the structure of inflectional paradigms, from the implicative nature of the relation holding among members of inflectional classes (Matthews, Wurzel, Carstairs) to the paradigmatic distribution of stem allomorphy (Aronoff), are dealt with from a unifying, purely morphological perspective. Crucially, this descriptive framework is based on the assumption that the paradigm of a given verb can be characterised by means of a partition of the set of paradigm slots, that is in terms of a specific distribution of paradigm slots into a finite number of equivalence classes. More than one paradigm share the same partition. In our view of things, it is this distribution which tightly constraints, at the appropriate level of abstraction, both stem and affix allomorphy, no matter whether this allomorphy can be accounted for phonologically or otherwise. This claim is illustrated through extensive exemplification of data from Italian conjugation showing how sweeping the generalizations thus obtained are. TEL:: +39 50 560481
Interaction Interfaces - Towards a Scientific Foundation of a Methodological usage of Message Sequence Charts
Authors: Manfred Broy, Ingolf Krüger
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

We introduce the formal notion of an interaction interface. Its purpose is to specify formally the interaction between two or more components that co-operate as subsystems of a distributed system. We suggest the use of interaction interfaces for the description not of the behaviour of a single component in isolation but of the interface, the co-operation, between two or more components that are interacting within a distributed system. Typical examples are the interaction between an embedded system and its environment or the interaction between a sender and a receiver in a communication protocol. An interaction interface can be formally described by predicates characterising sets of interaction histories. We understand the specification of interaction histories as a typical step in system development that prepares the decomposition of a system into interacting subcomponents. After fixing the distribution structure of the system, an interaction interface is worked out that describes how the introduced subcomponents interact. In a successive development step we systematically derive the individual component specifications from the interface description. We show how such an interaction interface can be decomposed systematically into component specifications.
Communication Behaviors of Co-Located Users in Collaborative AR Interfaces
Authors: K. Kiyokawa, M. Billinghurst, S. E. Hayes, A. Gupta, Y. Sannohe, H. Kato
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We conducted two experiments comparing communication behaviors of co-located users in collaborative augmented reality (AR) interfaces. In the first experiment, we compared optical, stereo- and mono-video, and immersive head mounted displays (HMDs) using a target identification task. It was found that differences in the real world visibility severely affect communication behaviors. The optical see-through case produced the best results with the least extra communication needed. Generally, the more difficult it was to use non-verbal communication cues, the more people resorted to speech cues to compensate. In the second experiment, we compared three different combinations of task and communication spaces using a 2D icon designing task with optical see-through HMDs. It was found that the spatial relationship between the task and communication spaces also severely affected communication behaviors. Placing the task space between the subjects produced the most active behaviors in terms of initiatory body languages and utterances with least miscommunications.
On Locating Homoclinic and Heteroclinic Orbits
Authors: Eusebius J. Doedel, Mark J. Friedman, Anand C. Monteiro
Venue:  (1993)

In earlier papers (see [FD2] and the references there) we have developed a numerical method and derived error estimates for the computation of branches of heteroclinic orbits for a system of autonomous ordinary differential equations in Rn. The idea of the method is to reduce a boundary value problem on the real line to a boundary value problem on a finite interval by using a local (linear or higher order) approximation of the stable and unstable manifolds. A practical limitation for the computation of homoclinic and heteroclinic orbits has been the difficulty in obtaining starting orbits. Typically these were obtained from a closed form solution or via a homotopy from a known solution. Here we consider extensions of our algorithm which allow us to obtain starting orbits in a more systematic way using successive homotopies. As an application, we consider computation of homoclinic orbits in a singular perturbation problem. Keywords: heteroclinic and homoclinic orbits, continuation methods, singular perturbation, numerical analysis
Deliver Multimedia Streams with Flexible QoS via a Multicast DAG
Authors: Jiong Yang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper, we investigate the problem of delivering realtime multimedia streams in a MAN environment. Most researchin this area presumes the scenario where all packets of a streamare transmitted along a single path from the sender to a receiver.In this paper, we propose a new application layer multicastscheme, namely ROME, to better fulfill heterogeneous QoSrequirements from various receivers simultaneously by settingup multiple paths. Instead of enforcing a multicast tree structure,a multicast DAG (Directed Acyclic Graph) is constructed inROME, where multiple nodes in the multicast group may sharethe responsibility to deliver the stream to a node. To achieve this,each stream is partitioned into a set of stream shares. A QoSoriented share assignment technique is proposed to distributestream shares progressively among delivery paths to maximizethe number of fulfilled clients while minimizing the overall bandwidthusage. Moreover, both the delivery paths and the streampartition can be adapted easily on the fly to accommodate multicastgroup membership change during the real time delivery.Last but not least, we evaluate our scheme via simulations andshow that the proposed scheme can fulfill a larger number ofclients with higher QoS requirements than existing approachesunder the same network capacity.