ppxscal/embedding_network huggingface dataset:
Parallelism in the front-end
Authors: Paramjit S. Oberoi, Gurindar S. Sohi
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

As processor back-ends get more aggressive, front-ends will have to scale as well. Although the back-ends of superscalar processors have continued to become more parallel, the front-ends remain sequential. This paper describes techniques for fetching and renaming multiple non-contiguous portions of the dynamic instruction stream in parallel using multiple fetch and rename units. It demonstrates that parallel front-ends are a viable alternative to high-performance sequential front-ends.Compared with an equivalently-sized trace cache, our technique increases cache bandwidth utilization by 17%, front-end throughput by 20%, and performance by 5%. Parallelism also enhances latency tolerance: a parallel front-end loses only 6% performance as the cache size is decreased from 128 KB to 8 KB, compared with a 50--65% performance loss for sequential fetch mechanisms.
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
Authors: Weijia Jia, Gaochao Xu, Dong Xuan, Wei Zhao
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper, we study an efficient fault-tolerant CBT multicast routing protocol. With our strategy, when a faulty component is detected, some pre-defined backup path(s) is (are) used to bypass the faulty component and enable the multicast communication to continue. Our protocol only requires that routers near the faulty component be reconfigured, thus reducing the runtime overhead without compromising much of the performance. Our performance evaluation shows that our new protocol performs nearly as well as the best possible global method while utilizing much less runtime overhead and implementation cost.
Breaking Abstractions and Unstructuring Data Structures
Authors: Christian Collberg, Clark Thomborson, Douglas Low
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

To ensure platform independence, mobile programs are distributed in forms that are isomorphic to the original source code. Such codes are easy to decompile, and hence they increase the risk of malicious reverse engineering attacks.Code obfuscation is one of several techniques which has been proposed to alleviate this situation. An obfuscator is a tool which - through the application of code transformations - converts a program into an equivalent one that is more difficult to reverse engineer.In a previous paper we have described the design of a control flow obfuscator for Java. In this paper we extend the design with transformations that obfuscate data structures and abstractions. In particular, we show how to obfuscate classes, arrays, procedural abstractions and built-in data types like strings, integers, and booleans.
On maximizing the throughput of multiprocessor tasks
Authors: Aleksei V. Fishkin, Guochuan Zhang
Venue: Theoretical Computer Science (2003)

We consider the problem of scheduling n independent multiprocessor tasks with due dates and unit processing times, where the objective is to compute a schedule maximizing the throughput. We derive the complexity results and present several approximation algorithms. For the parallel variant of the problem, we introduce the first-fit increasing algorithm and the latest-fit increasing algorithm, and prove that their worst-case ratios are 2 and 2 - 1/m, respectively (m ≥ 2 is the number of processors). Then we propose a revised algorithm with a worst-case ratio bounded by 3/2- 1/(2m) (m is odd) and 3/2-1/(2m-2) (m is even). For the dedicated variant, we present a simple greedy algorithm. We show that its worst-case ratio is bounded by √m + 1. We straighten this result by showing that the problem cannot be approximated within a factor of m1/2-ε for any ε > 0, unless NP = ZPP.
Expected value expansions in rooted graphs
Authors: Alison Bailey, Gary Gordon, Matthew Patton, Jennifer Scancella
Venue: Discrete Applied Mathematics (2003)

When G is a rooted graph where each edge may independently succeed with probability p, we consider the expected number of vertices in the operational component of G containing the root. This expected value EV(G; p) is a polynomial in p. We present several distinct equivalent formulations of EV(G; p), unifying prior treatments of this topic. We use results on network resilience (introduced by Colbourn) to obtain complexity results for computing EV(G; p). We use some of these formulations to derive closed form expressions for EV(G; p) for some specific classes of graphs. We conclude by considering optimality questions for rooted graphs, root placement and some counterexamples.
Effects of Package Stackups on Microprocessor Performance
Authors: Mehdi M. Mechaik
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Recent advances in microprocessor technology require high-speed, high performance, and high-pincount devices. With a large number of simultaneous switching drivers at frequencies in excess of 100MHz and large numbers of core logic transistors switching at frequencies in excess of 350MHz in the microprocessor, the problem of matching a package to the microprocessor's drivers & core logic requirements to the environment of a low cost motherboard becomes a real challenge. In addition to having high speed input/output signals, microprocessors designed for low power consumption (~2volts), require the package to provide a low inductance path between the drivers, the decoupling capacitors, and the motherboard. This paper will show how different package stackups, number of power and ground planes, and the number of routing layers affect the performance of the packaging device and subsequently the current consumption demanded by the simultaneously switching drivers and core logic on the microprocessor. A multilayer ceramic package with solid planes and thin substrates will be analyzed to provide a complete characterization of the system made of drivers, core logic, package, and motherboard. Such analysis serves as a basic building block for setting a criteria on different package designs.An electrical model, based on state-of-the art software tools, will be presented. The model is used for extracting advantages and performance characteristics of package stackups and routing layers on ceramic pin grid array (CPGA) and ceramic ball grid array (CBGA) packages. Driver models and an electrical model for the motherboard are also combined together with the package models to show the effectiveness of packages on performance of a microprocessor.
Mapping Information onto 3D Virtual Worlds
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper presents a strategy for automatically mapping information onto visual parameters in the field of three-dimensional (3D) information visualization. The work presented here is done in the context of researching how 3D information visualization may help when trying to visualize large volumes of dynamic data. The application field within which this work has been conducted is using 3D information visualization for network monitoring and management. Nonetheless, the framework and mapping strategy is application domain independent.In this paper, we focus on the process of automatically mapping data values onto graphical parameters, in order to construct 3D virtual worlds that convey network data for network monitoring and management. We present the criteria that are used to find the best mapping and the strategy taken to implement those criteria. We describe our use of visual metaphors and the graphical components that we utilize and we give some examples of different mappings.
Bootstrapping computer science in Old North Wales
Authors: K. A. Hawick, H. A. James
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

We describe our experiences in setting up a new Computer Science department in an established University within the UK. We drew upon our experiences in teaching Computing in Australia, the USA and the UK. We discuss cultural differences and constraints upon us in designing and teaching a BSc in Computer Science. We also relate teaching and culture bootstrap effects from having to start a whole new department from origins in an Engineering and Mathematics School. We relate our design decisions and experiences in setting up teaching and learning methods and appropriate assessment practices for the rapidly broadening discipline of Computer Science. We also describe our PhD programme and our early experiences of a taught MSc programme.
{\bf (Revised to CS-1994-35.)} Scoping Constructs in Logic Programming: Implementation Problems and Their Solution
Authors: Gopalan Nadathur, Bharat Jayaraman, Keehang Kwon
Venue:  (1993)

This paper examines the implementation issues arising from introducing universally quantified goals and some forms of implication goals in a logic programming language. While these constructs are useful in providing a logical approach to lexical scoping, they raise new implementation problems. Since universal and existential quantifiers may appear in mixed order in goals, the unification operation used for solving existential goals must respect this ordering. We present a solution to this problem based on a tagging of constants and variables and the use of these tags in constraining unification. This solution is amenable to an efficient implementation and can be easily assimilated into the machinery of the Warren Abstract Machine (WAM). Implication goals require new program clauses to be introduced dynamically for the purpose of solving specific subgoals. A naive scheme based on asserting and retracting program clauses does not suffice to solve this problem, for two reasons: First, backtracking may require reinstating programs previously in existence and bookkeeping devices are needed for achieving this efficiently. Second, implication goals surrounded by existential quantifiers may give rise to program clauses {\em parameterized} by bindings for variables. Compilation and the sharing of compiled code require a {\it closure} based representation for program clauses to be developed. We describe methods for achieving these effects and integrate these ideas into the WAM. We also outline extensions to the resulting machine for incorporating higher-order aspects into our language. The ideas developed here provide part of the basis for an ongoing implementation of the higher-order logic programming language $\lambda$Prolog.
A NOVEL MULTIPLE-INPUT MULTIPLE-VALUED SEMI-FLOATING-GATE LATCH
Authors: OMID MIRMOTAHARI, YNGVAR BERG
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In this paper we present a semi-floating-gate (SFG) multiple-valued(MV) latch. The latch is constructed for handlingsignals that can be binary or multiple-valued, with only SFGmultiple-valued inverters. Simulation results are provided.
Engineering Task Models
Authors: F. Paterno, C. Mancini, S. Meniconi
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

This paper describes a method which allows designers and developers to define a task model of the interactive application considered and then to derive a architecture specification. This specification supports the same temporal relationships defined in the task specification, and what the related tasks are is precisely identified for each basic component. This method highlights significant aspects in task and architecture design and gives useful suggestions for developing user interface environments which maintain a focus on task-oriented aspects. We consider the possibility of supporting very flexible temporal relationships among tasks (concurrent tasks, tasks which can interrupt or enable other tasks and so on).
Return To Castle Wolfenstein: Operation Resurrection: Prima's Official Strategy Guide
Authors: Michael Littlefield
Venue:  (2003)

:Overthrow Hitler's evil empire.·Lethal combat tactics·Detailed maps of all levels·A step-by-step walkthrough for each deadly mission·Comprehensive weapons stats for the entire arsenal of destruction·Precise locations of every secret area and how to access them
RHiNET: A Network for High Performance Parallel Computing Using Locally Distributed Computers
Authors: Tomohiro Kudoh, Junji Yamamoto, Hiroaki Nishi, Shinji Nishimura, Osamu Tatebe, Hideharu Amano
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

A local area distributed computing system called RHiNET (RWCP High Performance Network), in which thousands of commodity personal computers and workstations can be connected by high speed optical interconnection is being developed. RHiNET consists of network interfaces, network switches and optical interconnections. RHiNET will provide a single system image to users and support high performance parallel computing. This paper presents an overview of the system.
Testable Sequential Circuit Design: Partitioning for Pseudoexhaustive Test
Authors: Bassam Shaer, Kailash Aurangabadkar, Nitin Agarwal
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In this study, we present an automated algorithm thatpartitions large sequential VLSI circuits forpseudoexhaustive testing. The partitioning algorithm isbased on the primary input cone and fanout value of eachnode in the circuit. We have developed an optimizationprocess that can be used to find the optimal size of primaryinput cone and fanout values, to be used for partitioning agiven circuit. Experimenta results are presented todemonstrate the effectiveness of our work.
New generation of secure and practical RSA-based signatures
Authors: Ronald J.F. Cramer
Venue:  (1995)

For most digital signature schemes used in practice, such as ISO9796/RSA or DSA, it has only been shown that certain plausible cryptographic assumptions, such as the difficulty of factoring integers, computing discrete logarithms or the collision-intractability of certain hash-functions are necessary for the security of the scheme, while their sufficiency is, strictly speaking, an open question. A clear advantage of such schemes over many signature schemes with security proven relative to such common cryptographic assumptions, is their efficiency: as a result of their relatively weak requirements regarding computation, bandwidth and storage, these schemes have so far beaten proven secure schemes in practice. Our aim is to contribute to the bridging of the gap that seems to exist between the theory and practice of digital signature schemes. We present a digital signature that offers both proven security and practical value. More precisely, under an appropriate assumption about RSA, the scheme is proven to be not existentially forgeable under adaptively chosen message attacks. Furthermore, we identify some electronic devices where our scheme can be conveniently implemented using dedicated smartcards that are available today.
Rectangle Breaking in Grids
Authors: Paul A. J Dreyer, Therese C. Biedl
Venue:  (1997)

Given an $n \times n$ square grid, there are the outlines of $n^2$ $1 \times 1$ squares, $(n-1)^2$ $2 \times 2$ squares, and so on. What is the minimum number of edges that can be removed from the grid such that there is no complete outline of a square remaining? Using techniques from tiling problems and other graph theoretic methods, we solve the problem for all $n$ and prove similar results for rectangular grids for which the side lengths differ by no more than six. We also introduce another version of the problem where we ask for the minimum number of edges to ``break'''' all of the rectangles in a grid.
Enriching the Design Process: Developing a Wearable Operator's Assistant
Authors: Jack Moffett, Jane Siegel, Derek Wahila, Christopher Graefe, Jurry Swart
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

An interdisciplinary research team from Carnegie Mellon's Human-Computer Interaction Institute (HCII) collaborated with Inmedius, Inc. (a CMU spin-off company) and colleagues in Shell Exploration and Production UK (EXPRO) to develop a Wearable Operator's Assistant (WOA) for workers on offshore oilrigs. The assistant is a handheld or wearable computer for technicians to perform daily operations and maintenance tasks on oilrigs under construction in Scotland, and after installation in the North Sea. The WOA project was charted to ¿empower the technician¿ making them ¿a Supertech, the envy of other technicians¿. This meant offering all resources currently available on paper (forms to do inspections and report problems, job cards, maintenance manuals, equipment histories, notebooks, etc.) through a digital interface, accessible from anywhere, anytime on the platform. A user-centered design approach and scenarios were widely used in the development process and were a successful means for presenting and evaluating ideas. This design process used two additional methods: the integration of flowcharts with the scenarios, and the extensive involvement of the end users throughout the course of the project. A high acceptance rate of the system and positive feedback from the technicians is partly attributed to this design approach. Users' feedback and rough estimates of cost saving associated with the use of the WOA are provided.
Weak limits of finite difference schemes for Schroedinger-type equations
Authors: Peter A. Markowich, Paola Pietra, Pohl Carsten
Venue:  (1997)

Many problems of solid state physics require the solution of the Schroedinger equation in the case of a small (scaled) Planck constant. In classical quantum physics the wave function is an auxiliary quantity, used to compute the primary physical quantities, which are quadratic functions of the wave function, e.g. the position density and the current density. It is well known that the highly oscillatory nature of the wave function inhibits strong convergence as the Planck constant goes to zero. Clearly, the weak convergence of the wave function is not sufficient for passing to the limit in the macroscopic densities, and the analysis of the so-called semi-classical limit is a mathematically rather complex issue. Exactly the same problem, i.e. the highly oscillatory nature of the solutions, has to be coped with when the Schroedinger equation with small Planck constant is solved numerically. Even for stable discretization schemes (or under mesh size restrictions which guarantee stability) the oscillations may very well pollute the solution in such a way that the quadratic macroscopic quantities and other physical observables come out completely wrong when the scaled Planck constant is small. Here we adapt the Wigner-transform techniques used to analyse the semi-classical limit for the continuous Schroedinger equation to the analysis of finite difference discretizations. The spatial discretizations are general arbitrary-order symmetric schemes. Several time discretizations are considered: the Crank-Nicolson scheme, the leap frog scheme (both belonging to the set of mostly used methods for the Schroedinger equation) and one step (asymmetric) implicit and explicit time discretizations. For all these methods we identify the semiclassical Wigner measure for all (sensible) combinations of the Planck constant and of the time and space mesh sizes. The macroscopic quantities (e.g. position and current density) can be retrieved as moments (zeroth and first order) of the Wigner measure. We clearly have uniform convergence for the average values of the macroscopic quantities in those cases, for which the Wigner measure of the numerical scheme is identical to the Wigner measure of the Schroedinger equation itself. From this theory we obtain sharp (i.e. necessary and sufficient) conditions on the mesh sizes which guarantee a good approximation quality of the macroscopic quantities uniformly as the Planck constant goes to zero. The numerical tests confirm the predicted behaviour: in cases where the Wigner measure of the discrete scheme does not coincide with the Wigner measure of the Schroedinger equation we get wrong results for the macroscopic quantities for small Planck constant. We remark that the theory does not depend on whether caustics develop or not. Even for nonoscillating macroscopic quantities the results are wrong for badly chosen mesh parameters. EMAIL:: ian@microian.ian.pv.cnr.it
Scalable Information Elicitation in Large Heterogeneous Database Networks
Authors: S. Milliner, M. Papazoglou
Venue:  (1996)

The rapid growth of information networks motivates the need for the development of technologies to assist in finding and understanding the set of information elements relevant to a task in large scale multidatabase networks. The research reported in this paper suggests the use of a logical model to facilitate pro-active elicitation of schema information from multiple heterogeneous information sources. This is accomplished by providing a consistent, logically organized view of information across multiple discrete heterogeneous sources. The model dynamically clusters databases in a logical space, so that the elements within a cluster have a high degree of semantic correlation. Once a database cluster is formed, we need only search a relatively small coherent areas to find relevant information, rather than the entire space of database schemas. The elicitation process is guided by a combination of lexical, structural and semantic aspects of schema items in order to capture more meaning both about the contents of a requested information item and about its placement within a given information context. Since communications target specific database clusters scalability is enhanced, searches are accelerated, and interactions in a large collection of databases becomes tractable.
Fine-Grained Layered Multicast
Authors: John Byers, Michael Luby, Michael Mitzenmacher
Venue:  (2000)

Abstract Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large time scales. In this paper, we quantify the costs and benefits of using non-cumulative layering and present a new, scalable multicast congestion control scheme which provides a fine-grained approximation to the behavior of TCP additive increase / multiplicative decrease (AIMD). In contrast to the conventional wisdom, we demonstrate that fine-grained rate adjustment can be achieved with only modest increases in the number of layers and aggregate bandwidth consumption, while using only a small constant number of control messages to perform either additive increase or multiplicative decrease.
A policy based framework for agents: on the specification of an agent policy language including roles, relationships, conversation patterns and co-operation patterns
Authors: Christos Stergiou, Geert Arys, Michael Wooldridge
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we provide a policy based framework for managing and modelling agent social interaction. We specify and implement agent conversation patterns and interaction protocols using an agent policy language. Further, we use Role theory to define agent roles and relationships, which are then described using the Agent Policy Language in terms of policies (i.e. obligations and authorisations). Policy based agents have the ability to interpret policies and assume roles for a certain interaction pattern dynamically.