ppxscal/embedding_network huggingface dataset:
Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog
Authors: Baudouin L Charlier, Pascal Van Hentenryck
Venue:  (1991)

Abstract interpretation of Prolog programs has attracted many researchers in recent years partly because of the potential for optimization in Prolog compilers and partly because of the declarative nature of logic programming languages which make them more amenable to optimization. Most of the work, however, has remained at the theoretical level, focusing on the developments of frameworks and the definition of abstract domains. This paper reports our effort to verify experimentally the practical value of this area of research. It describes the design and implementation of the generic abstract interpretation algorithm that we originally proposed in [15], its instantiation to a sophisticated abstract domain (derived from [4]) containing modes, types, sharing, and aliasing, and its evaluation both in terms of performance and accuracy. The overall implementation (over 5000 lines of PASCAL) has been systematically analyzed on a variety of programs and has been compared with the complexity analysis of [15] and the specific analysis systems of [28]. The experimental results, given the abstract domain and the programs analyzed, indicate that (1) the number of iterations of the algorithm is bounded by $7.5 * N$ and is in most cases smaller than $3 * N$, where $N$ is the size of the program analyzed (e.g. the number of program points); (2) the CPU time in seconds is bounded by $N$ and is in most cases smaller than $0.6 * N$; (3) the algorithm explores few elements (less than 11\ outside the subset of the fixpoint required to answer the query and hence is close to optimality; (4) the results are quite accurate and could be used in a Prolog compiler; (5) the performance and accuracy results compare well to the specific tools proposed in [28].
Flash Frames: A New Pop Culture
Authors: Laurie Dolphin
Venue:  (2002)

:Flash Frames: A New Pop Culture celebrates the work of more than forty of the most innovotive media artists currently using the software program Flash - from veteran celebrity animators such as Russ Heath to cutting-edge cult heroes such as Joe Cartoon.
Spice Model Quality: Process Development Viewpoint
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

We show what is required of a good model, with emphasis from a process development point of view. The merits of good testchips, physical correctness of the model, and realistic skews (best/worst case) are investigated. Prediction of future technologies with some level of confidence is also looked at. A close working relationship between process integration, model engineering, and circuit design is considered. Advantages of models with well-behaved, smooth, glitchless characteristics and well-behaved derivatives are covered. Parameter correlations, parameter redundancy, and model documention round out the basic model discussions. Extra features are also covered, including noise models, high frequency characterization, diode models, parasitic bipolar models, etc. And finally, the need for models to evolve with manufacturing improvements is highlighted. 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
What features really make distributed minimum spanning tree algorithms efficient?
Authors: M. Faloutsos, M. Molle
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Since Gallager, Humblet and Spira first introduced the distributed Minimum Spanning Tree problem, many authors have suggested ways to enhance their basic algorithm to improve its performance. Most of these improved algorithms have even been shown to be very efficient in terms of reducing their worst-case communications and/or time complexity measures. In this paper, however, we take a different approach, basing our comparisons on measurements of the actual running times, numbers of messages sent, etc., when various algorithms are run on large numbers of test networks. We also propose the Distributed Information idea, that yields several new techniques for performance improvement. Simulation results show that contrary to the theoretical analysis, some of the techniques in the literature degrade the performance. Moreover, a simple technique that we propose seems to achieve the best time and message complexity among several algorithms tested.
A Table of Analytical Fourier Transforms
Authors: William L. Briggs, Van E Henson
Venue:  (1995)

While most people rely on numerical methods (most notably the fast Fourier transform) for computing discrete Fourier transforms (DFTs), there it is still an occasional need to have analytical DFTs close at hand. Such a table of analytical DFTs is provided in this paper, along with comments and observations, in the belief that it will serve as a useful resource or teaching aid for Fourier practioners.
A Feedback Based Scheme for Improving TCP Performance in Ad-Hoc Wireless Networks
Authors: Kartik Chandran, Sudarshan Raghunathan, S. Venkatesan, Ravi Prakash
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Ad-hoc networks are completely wireless networks of mobile hosts, in which the topology rapidly changes due to the movement of mobile hosts. This frequent topology may lead to sudden packet losses and delays. Transport protocols like TCP have been built mainly for reliable, fixed networks. Hence, when used in ad-hoc networks, TCP misinterprets this loss as congestion and invokes congestion control. This leads to unnecessary retransmissions and loss of throughput. To overcome this problem, a feedback scheme is proposed, so that the source can distinguish between route failure and network congestion. When a route is disrupted, the source is sent a Route Failure Notification(RFN) packet, allowing it to freeze its timers and stop sending packets. When the route is re-established, the source is informed through a Route Re-establishment Notification (RRN) packet, upon which it resumes by un-freezing timers and continuing packet transmissions. The simulated performance of TCP on ad-hoc networks with and without feedback is compared and reported. It is observed that in the event of route failures, as the route re-establishment time increases, the use of feedback provides significant gains in throughput as well as savings in unnecessary packet transmissions. Several further enhancements and directions for future work are also sketched.
Experience Report: Correcting System Failure in a COTS Information System
Authors: Scott A. Hissam
Venue: Proceedings of the International Conference on Software Maintenance (1998)

This paper provides an in-depth technical study about a COTS-based information system made up of several commercial components. In particular, this paper provides detail on the activities needed to make the system functionally useful. While all readers may find value in this report, it is expressly aimed at a technical audience. The organization that performed the work described herein is not named, nor are the specific commercial products. All of them, however, are common products, and the work is very typical of the type of effort that integrating and tuning a COTS-based information system can entail.
Deriving Tests From Software Architectures
Authors: Zhenyi Jin, Jeff Offutt
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Software architecture are intended to describe essential high level tructural and behavioral characteristic of the system.Architecture Description Language (ADLs) decribe these characteristic in way that can be analyzed and manipulated algorithmically.This provide a unique opportunity for deriving test at the system level.This paper define formal testing criteria based on architecture relations, which are paths that architectural componentuse to communicate.The criteria have been applied to a specific ADL.Result from a comparative empirical study on industrial oftware are presented.
Optimal Clock Synchronization
Authors: Sam Toueg
Venue:  (1984)

We present a simple, efficient and unified solution to the problems of synchronizing, initializing, and integrating clocks, for systems with different types of failures: crash, omission, and arbitrary failures with and without message authentication. This is the first known solution that achieves optimal accuracy, i.e., the accuracy of synchronized clocks (with respect to real time) is as good as that specified for the underlying hardware clocks. The solution is also optimal with respect to the number of faulty processes that can be tolerated to achieve this accuracy.
A complete axiomatisation of branching bisimulation for process algebras with alternative quantification over data
Authors: Jan F Groote, S. P. Luttik
Venue:  (1998)

We define a class of process algebras with silent step and a generalised operation $\gsum{}$ that allows explicit treatment of \emph{alternative quantification} over data, and we investigate the specific subclass formed by the algebras of finite processes modulo rooted branching bisimulation. We give a ground complete axiomatisation for those branching bisimulation algebras of which the data part has built-in equality and Skolem functions.
From Greta's mind to her face: modelling the dynamics of affective states in a conversational embodied agent
Authors: Fiorella de Rosis, Catherine Pelachaud, Isabella Poggi, Valeria Carofiglio, Berardina De Carolis
Venue: International Journal of Human-Computer Studies (2003)

This paper describes the results of a research project aimed at implementing a 'realistic' 3D Embodied Agent that can be animated in real-time and is 'believable and expressive': that is, able to coherently communicate complex information through the combination and the tight synchronisation of verbal and nonverbal signals. We describe, in particular, how we 'animate' this Agent (that we called Greta) so as to enable her to manifest the affective states that are dynamically activated and de-activated in her mind during the dialog with the user. The system is made up of three tightly interrelated components: • A representation of the Agent Mind: this includes long and short-term affective components (personality and emotions) and simulates how emotions are triggered and decay over time according to the Agent's personality and to the context, and how several emotions may overlap. Dynamic belief networks with weighting of goals is the formalism we employ to this purpose. • A mark-up language to denote the communicative meanings that may be associated with dialog moves performed by the Agent. • A translation of the Agent's tagged move into a face expression, that combines appropriately the available channels (gaze direction, eyebrow shape, head direction and movement etc). The final output is a 3-D facial model that respects the MPEG-4 standard and uses MPEG- 4 Facial Animation Parameters to produce facial expressions. Throughout the paper, we illustrate the results obtained, with an example of dialog in the domain of 'Advice about eating disorders'. The paper concludes with an analysis of advantages of our cognitive model of emotion triggering and of the problems found in testing it. Although we did not yet complete a formal evaluation of our system, we briefly describe how we plan to assess the agent's believability in terms of consistency of its communicative behaviour.
Noise Injection and Propagation in High Performance Designs
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Signal integrity has become a critical issue in the design of high-performance circuits. Noise on a net arises both through propagation of noise from previous stages through the driver gate of the net and through injection of new noise through coupling capacitance with neighboring nets. Typically, propagated noise and injected noise are added linearly to simplify the analysis and increase its efficiency. In this paper, we show that this linear assumption results in a significant underestimation of the noise, due to the non-linear behavior of the driver gate, and hence can lead to many undetected noise failures in the design. Since complete non-linear simulation is too slow for large cell-based designs, we propose a new linear model that accurately captures the non-linear behavior of the driver gate. We propose three iterative methods for computing the model parameters of this linear model. Results are presented to demonstrate the accuracy of the proposed approach on several industrial designs.
Certification of Compiler Optimizations using Kleene Algebra with Tests
Authors: Maria Patron, Dexter Kozen
Venue:  (1999)

We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation, loop hoisting, induction variable elimination, instruction scheduling, algebraic simplification, loop unrolling, elimination of redundant instructions, array bounds check elimination, and introduction of sentinels. In each of these cases, we give a formal equational proof of the correctness of the optimizing transformation.
Rights Amplification in Master-Keyed Mechanical Locks
Authors: Matt Blaze
Venue: IEEE Security and Privacy (2003)

This article examines mechanical lock security from a computer-science and cryptology perspective, focusing on new and practical attacks for amplifying rights in master-keyed mechanical pin tumbler locks.
Comments on "Formal Methods Application: An Empirical Tale of Software Development"
Authors: Daniel M. Berry, Walter F. Tichy
Venue: IEEE Transactions on Software Engineering (2003)

We comment on the experimental design and the result of the paper mentioned in the title. Our purpose is to show interested readers examples of what can go wrong with experiments in software research and how to avoid the attending problems.
High-Speed High-Precision CMOS Current Conveyor
Authors: B. Calvo, S. Celma, P. A. Martínez, M. T. Sanz
Venue: Analog Integrated Circuits and Signal Processing (2003)

In this paper a new class-AB CMOS second generation current conveyor (CCII) based on a novel high-performance voltage follower topology is proposed. Post-layout simulation results from a 0.8 &mu;m design supplied at 3.3 V show very low resistance at node X (<50 &Omega;), high frequency operation (&sim;100 MHz), high precision in the voltage and current transference and reduced offset. As application examples, a V-I converter and a current feedback operational amplifier (CFOA) have been implemented. The latter presents slew-rate levels higher than &plusmn;100 V/&mu;s.
C/C++ Programmer's Reference, 3 edition
Authors: Herb Schildt
Venue:  (2002)

:Like having a brain in your back pocket. Provides clear explanations of all C and C++ programming syntax, keywords, commands, functions, and class libraries. Since no programmer can remember the precise syntax of every C/C++ element, this quick-access guide assists programmers in implementing efficient solutions on demand. 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
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
Authors: Vladimir Grebinski, Gregory Kucherov
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

This paper studies four combinatorial search models of reconstructing a fixed unknown Hamiltonian cycle in the complete graph by means of queries about subgraphs. For each model, an efficient algorithm is proposed that matches asymptotically the information-theoretic lower bound. The problem is motivated by an application to genome physical mapping.
Dynamic Network Model of Managing Investment Portfolio under Random Stepwise Changes in Volatilities of Financial Assets
Authors: E. S. Gerasimov, V. V. Dombrovskii
Venue: Automation and Remote Control (2003)

The problem of managing a portfolio of risk (ordinary shares) and no-risk (bank account, reliable bonds) investments was considered. The portfolio model was described in the state space by a system of stochastic differential (or difference) equations with random stepwise parameters. Management of the investment portfolio was formulated as a dynamic problem of tracking some reference portfolio with an investor-defined yield. An approach to determining the optimal management strategy with quadratic criterion-based feedback was proposed. Results of numerical modeling were presented.
End-To-End QoS Architecture for VPNs: MPLS VPN Deployment in a Backbone Network
Authors: Haeryong Lee, Jeongyeon Hwang, Byungryong Kang, Kyoungpyo Jun
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

VPNs enable companies to connect geographically dispersed offices and remote workers via secure links to the private company network, using the public Internet as a backbone. Specially, VPN service in the broadband data communication network is very important and necessary to take in users who want to specify group communication. VPN mechanisms are needed which work over existing deployed backbones, and which can also be migrated to new backbones like MPLS. MPLS is the latest step in the evolution of multilayer switching in the Internet In this paper; we are trying to clarify how MPLS can be applied to creating VPNs. For that, we researched an architectural model for building VPNs in a MPLS domain. The proposed model takes advantage of both network layer peering and packet switching, and link layer circuit and per-stream switching. It comes with a design scheme and an implementation procedure for VPN service in MPLS system. Then we describe MPLS based VPN service procedures. In addition, we describe MPLS VPN schemes that must be accommodated with existing network backbones and provide for a full range of QoS characteristics.
The NUMAchine Multiprocessor
Authors: R. Grindley, T. Abdelrahman, S. Brown, S. Caranci, D. DeVries, B. Gamsa, A. Grbic, M. Gusat, R. Ho, O. Krieger, G. Lemieux, K. Loveless, N. Manjikian, P. McHardy, S. Srbljic, M. Stumm, Z. Vranesic, Z. Zilic
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Small-scale multiprocessors are becoming increasingly economical and common, whereas larger multiprocessors continue to have higher per-node costs. The NUMAchine multiprocessor project seeks to make large-scale multiprocessors more economical while maintaining high performance by exploring architectural and hardware features for low-cost, modular multiprocessors. To demonstrate our approach, we have implemented a prototype system that is scalable to 128 processors. An efficient directory-based cache coherence protocol exploits our hierarchical ring-based interconnect and supports sequential consistency. This paper documents the design choices and the resulting performance of the system using both simulation results and measurements on the prototype hardware.
Management of Multidimensional Aggregates for Efficient Online Analytical Processing
Authors: J. Albrecht, A. Bauer, O. Deyerling, H. Günzel, W. Hümmer, W. Lehner, L. Schlesinger
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Proper management of multidimensional aggregates is a fundamental prerequisite for efficient OLAP. The experimental OLAP server CubeStar, which concepts are described in this paper, was designed exactly for that purpose. All logical query processing is based solely on a specific algebra for multidimensional data. However, a relational database system is used for the physical storage of the data. Therefore, in popular terms CubeStar can be classified as a ROLAP system. In comparison to commercially available systems, CubeStar is superior in two aspects: First, the implemented multidimensional data model allows more adequate modeling of hierarchical dimensions, because properties which apply only to certain dimensional elements can be modeled context-sensitively. This fact is reflected by an extended star schema on the relational side. Second, CubeStar supports multidimensional query optimization by caching multidimensional aggregates. Since summary tables are not created in advance but as needed, hot spots can be adequately represented. The dynamic and partition-oriented caching method allows cost reductions of up to 60% with space requirements of less than 10% of the size of the fact table.
First Among Equals: How to Manage a Group of Professionals
Authors: Patrick J. McKenna, David H. Maister
Venue:  (2002)

:Whether you have just been appointed as a group leader or you are a battle-scarred veteran, you know that managing professional people is difficult! Intelligent professionals are often free-agents, accustomed to having autonomy to work on grueling assignments with little supervision, and always relentlessly demanding of themselves and others. How do you actually add value as a group leader, or even get these people to accept your guidance? How do you deal with those oh-so-talented but oh-so-annoying professionals who exhibit attitude problems or are just exceedingly difficult to work with, when you need them but they needle you? How do you avoid unsettling group meetings where you meet for no clear purpose; people drift in and out at random times; the power players dominate discussions; and everyone brings along their favorite axe to grind? How do you actually inspire your group to bone-satisfying performance? In this strikingly unique "playbook," professional service experts Patrick J. McKenna and David H. Maister provide real-world examples, a wealth of self-evaluation materials, and concrete advice on stressful day-to-day management issues that every leader of professionals will welcome. The authors offer penetrating insights into the basics of coaching, dividing their attention equally between energizing and guiding the individual performer and the group. There has never been a book quite like this. First Among Equals is essential reading for practice leaders and group heads in the professional sector as well as managers of highly talented, technical knowledge workers anywhere. The lessons and learnings presented here will give you insights and action tips to help you provoke and inspire your people to their full potential.
The Virtual Tricorder
Authors: Mathias M. Wloka, Eliot Greenfield
Venue:  (1995)

We describe a new user-interface metaphor for immersive virtual reality --- the virtual tricorder (named for the Star Trek device). The virtual tricorder visually duplicates an actual six-degrees-of-freedom input device in the virtual environment. Since we map the input device to the tricorder one-to-one at all times, the user identifies the two. Thus, the resulting interface is visual as well as tactile, programmable, uniform, and based on a tool metaphor. This new metaphor stimulates user interface research for immersive VR in three ways. First, it makes tactile feedback for user-interface design accessible on inexpensive hardware, second, it unifies existing interaction techniques for immersive VR, and third, it generalizes interaction techniques for use in immersive VR. To demonstrate the tricorder metaphor, we present several immersive interaction techniques.