ppxscal/embedding_network huggingface dataset:
Size-Constrained Code Placement for Cache Miss Rate Reduction
Authors: H. Tomiyama, H. Yasuura
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

In design of an embedded system with a cache, it is important to minimize the cache miss rate to reduce the power consumption as well as to improve the performance of the system. We have previously proposed a code placement method which minimizes miss rates of instruction caches, but it makes code size larger. In most cases, code size is a tight design constraint. In this paper, we propose a size-constrained code placement method which minimizes cache miss rates under constraint on code size given by system designers. Experimental results show that the size-constrained code placement method achieves 36% decrease in cache misses with only 1.6% increase in code size compared with a naive placement, while the previous method decreases 36% of cache misses with 25% increase in code size.
Proceedings of the Workshop on Versioning in Hypertext Systems
Authors: David Durand, Anja Haake, David Hicks, Fabio Vitali
Venue:  (1995)

Abstract This report contains 9 papers presented at a workshop on version management and hypertext, as well as a summary introduction by the organizers. These papers address requirements, solutions, and research issues related to the management of hypertext databases. Version management is not only a key application requirement in some domains (like design journals and electronic manuals) but provides a way to preserve the integrity of links in a changing hyperbase.
Cisco PIX Firewalls, 1 edition
Authors: Richard Deal
Venue:  (2002)

Secure your mission-critical networks with the #1 leading firewall and this definitive guide. Featuring in-depth coverage of installation, configuration, and maintenance this book will show you how to protect your data from unauthorized users and hackers.Table of contents Part I: Introduction to Firewalls and Cisco Hardware Solutions 1: Firewall Basics 2: PIX Firewall Family Part II: PIX Setup and Traffic Filtering 3: The PIX Command-Line Interface and Basic Configuration 4: Traffic Flow Through the PIX and Address Translation 5: Filtering Traffic with Outbound Filters and Access Lists Part III: Advanced PIX Features 6: Web Traffic Filtering 7: Protocol Fixup Feature 8: Attack Guards, IDS Features, and Spoofing Protection Part IV: PIX Management 9: PIX Device Manager 10: SNMP and Logging 11: Centralizing Security 12: PIX Failover 13: Password Recovery Procedure 14: Upgrading Your PIX Firewall 15: SOHO Environments: DHCP and PPPoE Part V: VPNs and the PIX Firewall 16: IPSec Overview 17: IPSec Configuration
A Semantics of UML State-Machines Using Synchronous Pre-Order Transition Systems
Authors: Yunming Wang, Jean-Pierre Talpin, Albert Benveniste, Paul Le Guernic, Inria Irisa
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The synchronous model of concurrency has demonstrated its practicality for the design of circuits, embedded systems, reactive and distributed systems. This model allows to design systems around an idealized notion of deterministic concurrency, which is much easier to deal with than classical, non-deterministic, asynchronous concurrency. Compiling, optimizing, and verifying programs are done using powerful techniques. We take advantage of this rich background by presenting a translation of UML state-machines into a pivot synchronous calculus, based on mathematical notions of pre-orders, in the aim of providing an integrated development cycle for the reliable deployment of synchronous system specifications over asynchronous networks.In this paper, we first present the structure of UML state-machines. Compared with earlier studies on that matter, the structure under consideration supports, e.g., composite transition and history. Then, we give a brief presentation of the pivot formalism, BDL, which is used to finally give a formal semantics of UML state-machine in terms of pre-ordered transition systems.
Distributed Scheduling in Finite Capacity Networks
Authors: Perry Fizzano, Clifford Stein
Venue:  (1994)

We consider the problem of scheduling unit-sized jobs in a distributed network of processors. Each processor only knows the number of jobs it and its neighbors have. We give an analysis of intuitive algorithm and prove that the algorithm produces schedules that are within a logarithmic factor of the length of the optimal schedule given that the optimal schedule is sufficiently long.
A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments
Authors: Ioannis Ioannidis, Ananth Grama, Mikhail Atallah
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Dot-products form the basis of various applications ranging from scientific computations to commercial applications in data mining and transaction processing. Typical scientific computations utilizing sparse iterative solvers use repeated matrix-vector products. These canbe viewed as dot-products of sparse vectors. In database applications, dot-products take the form of counting operations. With widespread use of clustered and distributed platforms, these operations are increasingly being performed across networked hosts. Traditional APIs for messaging are susceptible to sniffing, and the data being transferred between hosts is often enough to compromise the entire computation. For example, in a domain decomposition based sparse solver, the entire solution can often be reconstructed easily from boundary values that are communicated on the net. In yet other applications, dot-products may be performed across two hosts that do not want to disclose their vectors, yet, they need to compute the dot-product. In each of these cases, there is a need for secure and anonymous dot-productprotocols. Due to the large computational requirements of underlying applications, it is highly desirable that secure protocols add minimal overhead to the original algorithm. Finally, by its very nature, dot-products leak limited amounts of information ¿ one of the parties can detect an entry of the other party's vector by simply probing it with a vector with a 1 in a particular location and zeros elsewhere. Given all of these constraints, traditional cryptographic protocols are generally unsuitable due to their significant computational and communication overheads. In this paper, we present an extremely efficient and sufficiently secure protocol for computing the dot-product of two vectors using linear algebraic techniques. Using analytical as well as experimental results, we demonstrate superior performance in terms of computational overhead, numerical stability, and security. We show that the overhead of a two-party dot-product computation using MPI as the messaging API across two high-end workstations connected via a Gigabit ethernet approaches multiple 4.69 over an unsecured dot-product. We also show that the average relative error in dot-products across a large number of random (normalized) vectors was roughly 4:5 × 10-9.
Animated Texture Alpha-Masks for Flow Visualization
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A method of using a moving texture alpha-mask to represent scientific data is described, for visualizing continuous fluid dynamics fields. The method combines stream tubes and particle animation into one hybrid technique, and employs texture surface display to represent time, flow velocity and 3D flow structure in one view. The technique exploits texture graphics systems in common use for games, and achieves high graphics efficiency during animation.
Parallel Algorithms with Processor Failures and Delays
Authors: Jonathan F. Buss, Paris C. Kanellakis, Prabhakar L. Radge, Alex A. Shvartsman
Venue:  (1991)

We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and strongly asynchronous PRAMs. In the first model, synchronous processors are subject to arbitrary stop failures and restarts determined by an on-line adversary and involving loss of private but not shared memory; the complexity measures are {\em completed work} (where processors are charged for completed fixed-size update cycles) and {\em overhead ratio} (completed work amortized over necessary work and failures). In the second model, the result of the computation is a serialization of the actions of the processors determined by an on-line adversary; the complexity measure is {\em total work} (number of steps taken by all processors). Despite their differences, the two models share key algorithmic techniques. We present new algorithms for the {\em Write-All} problem (in which $P$ processors write ones into an array of size $N$) for the two models, and a third which runs on the restartable fail-stop model. These algorithms can be used to implement a simulation strategy for any $N$-processor PRAM on a restartable fail-stop $P$-processor CRCW PRAM such that it guarantees a terminating execution of each simulated $N$-processor step, with $O(\log^2 N)$ overhead ratio and $O(\min \{N +P \log^2 N+ M \log N$, $N \cdot P^{0.59}\})$ (sub-quadratic) completed work (where $M$ is the number of failures during this step''s simulation). This strategy is work-optimal when the number of simulating processors is $P \leq N/\log^2 N$ and the total number of failures per each simulated $N$ processor step is $O(N/\log N)$. We also show that the {\em Write-All\/} requires $N-P+ \Omega (P \log P)$ completed/total work on these models for $P\leq N$.
Functional Schemas with Nested Predicates
Authors: Zvi Galil
Venue:  (1973)

A class of (monadic) functional schemas with nested predicates is defined. It is shown that termination, divergence and freedom problems for these schemas are decidable. It is proved that when the schemas are more general the freedom problem is undecidable. A procedure is given for deleting the identity function from the schema''s definition at the cost of increasing $k$ by 1 when $k$ is the maximum depth of nesting. Part of our results extend results of [1] about schemas without nesting. Our algorithm for checking freedom is not a natural extension of theirs. Furthermore, using our algorithm for schemas without nesting yields a much more efficient way of deciding freedom than the algorithm suggested in [1]. Keywords and Phrases: monadic functional schemas, nested predicates, decision problems, equivalence, freedom, polynomial time, DPDA. 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
CLP(SC): Implementation and Efficiency Considerations
Authors: Jeffrey Foster
Venue:  (1996)

CLP(SC) is a constraint logic programming language over set constraints proposed by Kozen [7]. In this paper, we describe a complete C++ implementation of CLP(SC). We describe the data structures used to represent systems of set constraints and an efficient algorithm, a modification of one given in [7], for unifying constraints. In addition, we investigate two further techniques for increasing efficiency: keeping track of variable equalities and doing PROLOG-style unification. 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
Design, Implementation, and Evaluation of the Constraint Language cc(FD)
Authors: Pascal Van Hentenryck, Vijay Saraswat, Yves Deville
Venue:  (1993)

This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over finite domains based on the cc framework, an extension of the CLP scheme. Its constraint solver includes (nonlinear) arithmetic constraints over natural numbers which are approximated using domain and interval consistency. The main novelty of cc(FD) is the inclusion of a number of general-purpose combinators, in particular cardinality, constructive disjunction, and blocking implication, in conjunction with new constraint operations such as constraint entailment and generalization. These combinators significantly improve the operational expressiveness, extensibility, and flexibility of CLP languages and allow issues such as the definition of non-primitive constraints and disjunctions to be tackled at the language level. The implementation of cc(FD) (about 40,000 lines of C) includes a WAM-based engine, optimal arc-consistency algorithms based on AC-5, and incremental implementation of the combinators. Results on numerous problems, including scheduling, resource allocation, sequencing, packing, and hamiltonian paths are reported, and indicate that cc(FD) comes close to procedural languages on a number of combinatorial problems. In addition, a small cc(FD) program was able to find the optimal solution and prove optimality to a famous 10/10 disjunctive scheduling problem, which was left open for more than 20 years and finally solved in 1988.
Software Caching using Dynamic Binary Rewriting for Embedded Devices
Authors: Chad M. Huneycutt, Joshua B. Fryman, Kenneth M. Mackenzie
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

A software cache implements instruction and data caching entirely in software. Dynamic binary rewriting offers a means to specialize the software cache miss checks at cache miss time. We describe a software cache system implemented using dynamic binary rewriting and observe that the combination is particularly appropriate for the scenario of a simple embedded system connected to a more powerful server over a network. As two examples, consider a network of sensors with local processing or cell phones connected to cell towers. We describe two software cache systems for instruction caching only using dynamic binary rewriting and present results for the performance of instruction caching in these systems. We measure time overheads of 19% compared to no caching. We also show that we can guarantee a 100% hit rate for codes that fit in the cache. For comparison, we estimate that a comparable hardware cache would have space overhead of 12-18% for its tag array and would offer no hit rate guarantee.
Efficient solution of rational conics
Authors: J. E. Cremona, D. Rusin
Venue: Mathematics of Computation (2003)

We present efficient algorithms for solving Legendre equations over Q (equivalently, for finding rational points on rational conics) and parametrizing all solutions. Unlike existing algorithms, no integer factorization is required, provided that the prime factors of the discriminant are known.
Enhanced Itakura measure incorporating masking properties of human auditory system
Authors: Guo Chen, Soo Ngee Koh, Ing Yann Soon
Venue: Signal Processing (2003)

A new enhanced Itakura (E-Itakura) speech distortion measure is proposed in this paper. It incorporates masking properties of the human auditory system into the original Itakura measure. Inaudible noise components masked by speech signals are excluded from the calculation of the E-Itakura measure, while the intrinsic advantage of the Itakura measure is retained. The proposed new measure has been compared with the original Itakura distortion, frequency-weighted Itakura spectral distortion, cepstral distance and Bark spectral distortion measures. The comparison results show that the correlation between the original Itakura measure with speech quality has been improved from 0.73 to 0.89 with the incorporation of the enhancement feature, and that the E-Itakura measure offers a more consistent indication of the subjective quality of speech.
Ercim Technical Reference Digital Library Search and Browse Services
Authors: Antonella Andreoni, Carlo Carlesi, Pasquale Pagano, Serena Pisani
Venue:  (1999)

The ERCIM Technical Reference Digital Library (ETRDL) provides the access to a distributed collection of grey literature (technical reports, theses, workshop proceedings, pre-prints, etc.) in the areas of Computer Sciences and Applied Mathematics produced by members of the ERCIM Consortium. The ETRDL service currently allows public access through Internet to the technical reports produced by seven ERCIM organisations. ETRDL functionality regards searching and browsing ERCIM collections to retrieval existing documents, submitting new documents in a specific collection and administer the ERCIM collections via a Web user interface. The aim of this document is to present an user guide for the information seekers that want to browse the ETRDL collections and search documents in one or more selected collections. EMAIL:: pagano@iei.pi.cnr.it
Comparing coordination models and architectures using embeddings
Authors: Marcello M. Bonsangue, Joost N. Kok, G. Zavattaro
Venue:  (2000)

We refine the notion of embedding in order to obtain a formal tool for the comparison of the relative expressive power of different languages, by taking into account also the intended architectures on which the software components described using those languages are executed. The new notion, called architectural embedding, is suitable for the comparison of different communication mechanisms, and gives rise to a natural notion of implementability. We will use this notion to present equivalence and difference results for several coordination models based on components that communicate either through an unordered broadcast, through an atomic broadcast, or through a synchronous broadcast.
Performance of LAMS-DLC: A Protocol for Low Altitude Satellite Networks
Authors: Christopher Ward, Cheong H. Choi, Thomas F. Hain
Venue:  (1993)

LAMS-DLC, a data link control protocol for low altitude satellite networks, was developed to overcome throughput limitations inherent in event-based positive acknowledgment (POS-ACK) automatic repeat request (ARQ) class protocols by relaxing certain reliability constraints, in particular, the in-sequence delivery constraint. This relaxation results in a new class of link layer service, that of reliable datagram, and permits a fresh approach to link layer protocol design. In this paper we discuss the motivation for such a protocol, describe one such protocol, LAMS-DLC, and compare throughput efficiency with results obtained from a simulation model. Results suggest that LAMS-DLC provides near optimal throughput efficiencies in the target environment, while using significantly less buffer space than is required for conventional POS-ACK protocols.
Quantifying the Objective Quality of Voxel Based Data Visualizations Produced by a Ray Caster: a proposal
Authors: Beatriz Sousa Santos, Jose Nunes, Carlos Coimbra, Carlos Ferreira, Ana Maria Tome, Nuno Lau
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

A set of parameters to assess the objective quality of visualizations of a voxel based data set, produced using a ray caster, is proposed as a first step toward the evaluation of the overall quality of these visualizations. Results obtained using synthetic data and a simple implementation of a ray caster are presented. The final goal of this evaluation will be the computation of confidence indices that could ofJeer the user a guided visualization, i.e. allow him/her to decide what are the best visualizations of a data set.IEEE Conference on Information Visualisation (IV '97)
Fiber-complemented graphs II. Retractions and endomorphisms
Authors: Marc Chastand
Venue: Discrete Mathematics (2003)

A fiber-complemented graph is a graph for which the inverse image of every prefiber (or gated set) by any projection map onto a prefiber is a prefiber. In this paper, we continue the study of these graphs and establish a retraction theorem and fixed point properties for endomorphisms. Adding the notion of mooring (these are particular retractions of a graph onto its prefibers) to the tools introduced in Part I of this work (Discrete Math. 226 (2001) 107), we show that a fiber-complemented graph whose elementary prefibers induce moorable graphs is a retract of a Cartesian product of elementary moorable graphs. Then we deduce that under some conditions of compacticity, the elements of every commuting family of endomorphisms of a moorable pre-median graph strictly stabilize a nonempty finite pre-median subgraph (pre-median graphs are particular instances of weakly modular graphs which are fiber-complemented). These results give generalizations of analogous properties related to median graphs, quasi-median graphs, pseudo-median graphs and weakly median graphs.
Modal Logics for Mobile Processes
Authors: Joachim Parrow, David Walker
Venue:  (1991)

In process algebras, bisimulation equivalence is typically defined directly in terms of the operational rules of action; it also has an alternative characterisation in terms of a simple modal logic (sometimes calledHennessy-Milner logic . This paper first defines two forms of bisimulation equivalence for the\031-calculus , a process algebra which allows dynamic reconfiguration among processes; it then explores a family of possible logics, with different modal operators. It is proven that two of these logics characterise the two bisimulation equivalences. Also, the relative expressive power of all the logics is exhibited as a lattice.
Fast Greedy Triangulation Algorithms
Authors: Matthew T. Dickerson, Robert L. S Drysdale, Scott A. McElfresh, Emo Welzl
Venue:  (1994)

The greedy triangulation of a set $S$ of $n$ points in the plane is the triangulation obtained by starting with the empty set and at each step adding the shortest compatible edge between two of the points, where a compatible edge is defined to be an edge that crosses none of the previously added edges. In this paper we present a simple, practical algorithm that computes the greedy triangulation in expected time $O(n \log n)$ and space $O(n)$ for points uniformly distributed over any convex shape. A variant of this algorithm should be fast for some other distributions. As part of this algorithm we give an edge compatiblity test that requires $O(n)$ time for both tests and updates to the underlying data structure. We also prove properties about the expected lengths of edges in greedy and Delaunay triangulations of uniformly distributed points.
Individual Differences in Program Comprehension Strategies in Unfamiliar Programming Systems
Authors: Andrew Jensen Ko, Bob Uttl
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

This study examines the effect of individual differences on the program comprehension strategies of users working with an unfamiliar programming system. Participants of varying programming expertise were given a battery of psychological tests, a brief introduction to a statistical programming environment, and a 20-minute debugging task. Our data show threedistinct comprehension strategies that were related to programming experience, but individuals with stronger domain knowledge for specific bugs tended to succeed.
Video aggregation: an integrated video compression and multiplexing scheme for broadband networks
Authors: Chi-Yin Tse, S. C. Liew
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper investigates video aggregation, a concept that integrates compression and multiplexing of video information. We focus on the transmission of a group of video sessions as a bundle, the practical examples of which include entertainment-video broadcast and video-on-demand. The shortcomings of the approaches that separate the processes of compression and multiplexing are explained from the viewpoints of image quality, bandwidth usage, network management and operation. We argue that it is better to perform compression and multiplexing together before the bundle of video traffic enters the network. This paper presents preliminary experimental results which indicate that video aggregation can provide better image quality for a given bandwidth than traditional statistical multiplexing.