ppxscal/embedding_network huggingface dataset:
Router level filtering for receiver interest delivery
Authors: Manuel Oliveira, Jon Crowcroft, Christophe Diot
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

Delivering data to on-line game participants requires the game data to be &ldquo;customized&rdquo; in real-time to each participant's characteristics. Using multicast in such an environment might sound contradictory. But multicast is a very efficient communication paradigm to minimize the transmission delays. Also, multicast reduces the workload at the sender. Content delivery according to receiver interest can be achieved by group management in multicast. But the natural dynamics of the application results in numerous delays because of join/leave latencies. In this paper, we propose the Router Level Filtering as a solution to the above problem. RLF relies on an extension to the current IP multicast service model. It introduces &ldquo;filters&rdquo; in the router forwarding process thereby providing a simple effective mechanism to customize the data delivered to a multicast session receiver while minimizing the number of groups and the related management cost. Contrary to other router filtering proposals, the filter semantics is determined by the application. The paper discusses protocol specification and implementation details of RLF, and shows how it may be implemented in routers.
Silver exudation
Authors: Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, Shang-Hua Teng
Venue: Journal of the ACM (JACM) (2000)

A silver is a tetrahedon whose four vertices lie close to a plane and whose orthogonal projection to that plane is a convex quadrilateral with no short edge. Silvers are notoriously common in 3-dimensional Delaunay triangulations even for well-spaced point sets. We show that, if the Delaunay triangulation has the ratio property introduced in Miller et al. [1995], then there is an assignment of weights so the weighted Delaunay traingulation contains no silvers. We also give an algorithm to compute such a weight assignment.
From Washington: Scientific communications and national security
Authors: Rosalie Steier
Venue: Communications of the ACM (1983)

The Reagan Administration has given considerable attention to the issue of &ldquo;technology transfer,&rdquo; by which they mean the dissemination of unclassified, but militarily sensitive U.S. technology to Eastern Bloc countries. There are some 44 separate groups in 10 or more U.S. departments either studying the subject or executing present policy, according to Louis T. Montulli, formerly of the White House Office of Science and Technology Policy. 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
Impact of RET on physical layouts
Authors: Franklin M. Schellenberg, Luigi Capodieci
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

In this paper, we briefly describe the lithography developments known as RET (Resolution Enhancement Technologies), which include off-axis illumination in litho tools, Optical and Process Correction (OPC), and phase shifting masks (PSM). All of these techniques are adopted to allow ever smaller features to be reliably manufactured, and are being generally adopted in all manufacturing below 0.25 microns. However, their adoption also places certain restrictions on layouts. We explore these restrictions, and then provide suggestions for layout practices that will facilitate the use of these technologies, especially the generation of a clean target layout for use as input layers for photomask preparation, and the use of verification tools that use process simulation.
Mode-Finding for Mixtures of Gaussian Distributions
Authors: Miguel Á. Carreira-Perpiñán
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Gradient-quadratic and fixed-point iteration algorithms and appropriate values for their control parameters are derived for finding all modes of a Gaussian mixture, a problem with applications in clustering and regression. The significance of the modes found is quantified locally by Hessian-based error bars and globally by the entropy as sparseness measure.
Computation of page fault probability from program transition diagram
Authors: M. A. Franklin, R. K. Gupta
Venue: Communications of the ACM (1974)

An algorithm is given for calculating page fault probability in a virtual memory system operating under demand paging with various memory sizes and replacement rules. A first order Markov model of program behavior is assumed, and a representation of the system based on memory states, control states, and memory substates is presented. The algorithm is general in the sense that the page fault probabilities can be calculated for nonpredictive replacement rules applied to any program represented by a one-step Markov chain. A detailed example is given to illustrate the algorithm for Random and Least Recently Used (LRU) replacement rules.
What is proprietary in mathematical programming?&mdash; impressions of a panel discussion
Authors: L. Wheaton Smith
Venue: Communications of the ACM (1961)

A panel discussion on &ldquo;What is Proprietary in Mathematical Programming?&rdquo; was sponsored by the Special Interest Committee on Mathematical Programming of the ACM during a Hall of Discussion/on September 7th at the 16TH National ACM meeting in Los Angeles. This note consists solely of the impressions garnered by the moderator of the panel and does not necessarily represent the position of any of the panelists or other participants in the discussion.
A Protocol to Achieve Independence in Constant Rounds
Authors: Rosario Gennaro
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Independence is a fundamental property needed to achieve security in fault-tolerant distributed computing. In practice, distributed communication networks are neither fully synchronous or fully asynchronous, but rather loosely synchronized. By this, we mean that in a communication protocol, messages at a given round may depend on messages from other players at the same round.These possible dependencies among messages create problems if we need $n$ players to announce independently chosen values. This task is called simultaneous broadcast. In this paper, we present the first constant round protocol for simultaneous broadcast in a reasonable computation model (which includes a common shared random string among the players). The protocol is provably secure under general cryptographic assumptions. In the process, we develop a new and stronger formal definition for this problem. Previously known protocols for this task required either $O(\log n)$ or expected constant rounds to complete (depending on the computation model considered).
High-level architectural co-simulation using Esterel and C
Authors: Andre Chatelain, Yves Mathys, Giovanni Placido, Alberto La Rosa, Luciano Lavagno
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

This paper introduces an architectural simulation environment, aimed at defining the best SOC architecture for complex system-level applications. The application is modeled using an abstract Timing Modeling Language, that describes the requests (e.g., memory accesses, I/Os, etc.) that the application makes to the architecture. The abstract architecture is modeled at the cycle-accurate level using a mixture of Esterel (a synchronous language) and C. We discuss the results of the application of this tool to a GSM/GPRS application, including a dramatic speed-up of the architectural exploration phase.
Shared walk environment using locomotion interfaces
Authors: Hiroaki Yano, Haruo Noma, Hiroo Iwata, Tsutomu Miyasato
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

By sharing data regarding the sensations experienced by individuals, as well as by sharing their knowledge, we are readily able to communicate with each other, and there are possibilities to further evolve this communication method. The different sensations experienced during voluntary walking and enforced walking give us different feelings. Also, the number of individuals involved can create a different feeling when walking. Networked computer-assisted walking can support and enhance these different experiences. In this paper, we introduce another walking style, the shared power-assisted voluntary walk, which is realized by a prototype networked locomotion system. This system can be used in tele-rehabilitation, which allows remote patients to share the sensation of walking. Also, it can be used to teach a group of patients rehabilitative walking. We developed two locomotion interfaces and connected them via a network. We developed enforced and semi-voluntary walking training systems using the shared walk environment and evaluated them with a series of experiments. operation inteðgration process. In the second algorithm, thanks to deðferred broadcast of operations to other sites, this process becomes even more simplified.
Some thoughts on agent trust and delegation
Authors: Yuh-Jong Hu
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In this paper, we are going to show how to build up agent-oriented Public Key Infrastructure(PKI) from SPKI/SDSI and X.509 standards. A variety of delegation mechanisms for agents will be demonstrated under this agent-oriented PKI. The mechanisms include: chain-ruled, threshold, and conditional. The lack of agent security management standards did not allow us to do the agent trust and delegation in legalized manner so we proposed several new communicative acts to satisfy our agent delegation management. Finally, we briefly show how to implement these agent communication language and inner content language in XML and XML/RDF.
An experimental framework for email categorization and management
Authors: Kenricj Mock
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Many problems are difficult to adequately explore until a prototype exists in order to elicit user feedback. One such problem is a system that automatically categorizes and manages email. Due to a myriad of user interface issues, a prototype is necessary to determine what techniques and technologies are effective in the email domain. This paper describes the implementation of an add-in for Microsoft Outlook 2000 TM that intends to address two problems with email: 1) help manage the inbox by automatically classifying email based on user folders, and 2) to aid in search and retrieval by providing a list of email relevant to the selected item. This add-in represents a first step in an experimental system for the study of other issues related to information management. The system has been set up to allow experimentation with other classification algorithms and the source code is available online in an effort to promote further experimentation.
Principles of intention reconsideration
Authors: Martijn Schut, Michael Wooldridge
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We present a framework that enables a belief-desire-intention (\acro{bdi}) agent to dynamically choose its intention reconsideration policy in order to perform optimally in accordance with the current state of the environment. Our framework integrates an abstract \acro{bdi} agent architecture with the decision theoretic model for discrete deliberation scheduling of Russell and Wefald. As intention reconsideration determines an agent's commitment to its plans, this work increases the level of autonomy in agents, as it pushes the choice of commitment level from design-time to run-time. This makes it possible for an agent to operate effectively in dynamic and open environments, whose behaviour is not known at design time. Following a precise formal definition of the framework, we present an empirical analysis that evaluates the run-time policy in comparison with design-time policies. We show that an agent utilising our framework outperforms agents with fixed policies.
A Coroutine Approach to Parsing
Authors: Hanan Samet
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

A method is presented for parsing syntactic constructs that are permitted to appear independently anywhere in a program. Some examples include comments, macros, and constructs for conditional compilation. Each such construct is defined by its own grammar and parsed by a separate coroutine. The coroutine model of parsing allows the program text to be parsed in one pass despite the syntactic inconsistencies among the program text and the additional constructs. The usefulness of the model is demonstrated by showing how a production language parsing method is extended to handle multiple syntax specifications. The implementation of conditional compilation by carrying along two parses in a coroutine manner is also given. The utility of the model is further demonstrated by showing its adaptation to a recursive descent parser.
Robust Computational Algorithms for Dynamic Interface Tracking in Three Dimensions
Authors: James Glimm, John W. Grove, X. L. Li, D. C. Tan
Venue: SIAM Journal on Scientific Computing (1999)

Front tracking provides sharp resolution of wave fronts through the active tracking of interfaces between distinct materials. A major challenge to this method is to handle changes in the interface topology. We describe two algorithms, implemented in the front tracking code FronTier, to model dynamic changes in three-dimensional interfaces. The two methods can be combined to give a hybrid method that is superior to each individual method. The success of these algorithms is shown by simulations of Rayleigh--Taylor instability, which is an interfacial instability driven by an acceleration directed across a material interface. Our numerical results are validated by comparing the numerical computation of the velocity of a single rising bubble with an analytic model for the bubble velocity.
Report of session: analysis of the J consortium real-time Java proposal
Authors: Brian Dobbing, Tullio Vardanega
Venue: Proceedings of the 10th international workshop on Real-time Ada workshop (2001)

As a `first' in the history of IRTAW, the workshop devoted a full session to the analysis of the real-time extensions currently proposed for a mainstream language in direct competition with Ada, that is Java. The objective of the session was to offer the group the opportunity to reflect on the status and rationale of the latest definition of the real-time extensions promulgated by the J Consortium. A subsequent IRTAW session addressed the analysis of the real-time extensions defined by the Real-Time Expert Group led by Sun Microsystems.
An overview of the wireless information network laboratory (WINLAB) at Rutgers University, NJ, USA
Authors: Roy Yates
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

Founded in 1989 by Dr. David Goodman at Rutgers University, WINLAB (the Wireless Information Network Laboratory) has grown to be among the oldest and most respected Centers of its kind and is sponsored by more than 20 companies from the US, Europe and Asia. It is globally recognized as a resource for technology creation, technology evaluation, education, and information exchange/technology transfer. With professors from electrical engineering and computer science, and with industrial as well as academic experience, WINLAB is able to take the broadest view of emerging technologies and gaps, and to focus its research on the key issues that will enable the Wireless Internet.
Interaction factors in software development performance in distributed student teams in computer science
Authors: Martha L. Hause, Vicki L. Almstrum, Mary Z. Last, M. R. Woodroffe
Venue: ACM SIGCSE Bulletin (2001)

This research in progress paper compares the characteristics of high and low performance distributed student teams doing software development in Computer Science. The distributed student teams were involved in a software development project that was part of a Computer Science course at two universities located in different countries.We developed a set of categories to examine the email communication of distributed student teams. This paper tracks the progression and changes in the categories coded for each team's communication throughout the project's timeline, particularly during key decision periods in the software development cycle.
Low power optimization technique for BDD mapped circuits
Authors: Per Lindgren, Mikael Kerttu, Mitch Thornton, Rolf Drechsler
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

The minimization of power consumption is an important design constraint for circuits used in portable devices. The s itching activity of a circuit node in a CMOS digital circuit directly contributes to overall power dissipation. By approximating the switching activity of circuit nodes as internal switching probabilities in Binary Decision Diagrams BDDs), it is possible to estimate the dynamic power dissipation characteristic of circuits resulting from a structural mapping of a BDD. A technique for minimizing the overall sum of switching probabilities is presented. The method is based on efficient local operations on a BDD representing the functionality of the circuit to be realized. The resulting circuit that is obtained by mapping the BDD to CMOS Pass Transistors has in simulation using a commercially available process model) shown reduced power dissipation characteristic. Experimental results on a set of MCNC benchmarks are given for this technique.
U.S. computer export control policies: value conflicts and policy choices
Authors: S. E. Goodman
Venue: Communications of the ACM (1982)

The formulation of a balanced and effective export control policy for computer products and know-how has been an important and difficult task for both the U.S. Government and the computing community. External pressures force national security concerns to conflict with the values and interests of private enterprise and academic freedom. This paper has two primary objectives: the first is to present the computing community with a reasonably equitable and detailed perspective on this important public policy problem; the second is to present and analyze a range of policy choices.
Compact routing schemes
Authors: Mikkel Thorup, Uri Zwick
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

We describe several compact routing schemes for general weighted undirected networks. Our schemes are simple and easy to implement. The routing tables stored at the nodes of the network are all very small. The headers attached to the routed messages, including the name of the destination, are extremely short. The routing decision at each node takes constant time. Yet, the stretch of these routing schemes, i.e., the worst ratio between the cost of the path on which a packet is routed and the cost of the cheapest path from source to destination, is a small constant. Our schemes achieve a near-optimal tradeoff between the size of the routing tables used and the resulting stretch. More specifically, we obtain: A routing scheme that uses only O (n 1/2) bits of memory at each node of an n-node network that has stretch 3. The space is optimal, up to logarithmic factors, in the sense that every routing scheme with stretch < 3 must use, on some networks, routing tables of total size &OHgr;(n2), and every routing scheme with stretch < 5 must use, on some networks, routing tables of total size &OHgr;(n3/2). The headers used are only (1 + &Ogr;(1)) log2> n-bits long and each routing decision takes constant time. A variant of this scheme with [log2 n] -bit headers makes routing decisions in &Ogr;(log log n) time. Also, for every integer k > 2, a general handshaking based routing scheme that uses O (n1/k) bits of memory at each node that has stretch 2k - 1. A conjecture of Erd&ouml;s from 1963, settled for k = 3, 5, implies that the routing tables are of near-optimal size relative to the stretch. The handshaking is similar in spirit to a DNS lookup in TCP/IP. Headers are &Ogr;(log2 n) bits long and each routing decision takes constant time. Without handshaking, the stretch of the scheme increases to 4k &mdash; 5. One ingredient used to obtain the routing schemes mentioned above, may be of independent practical and theoretical interest: A shortest path routing scheme for trees of arbitrary degree and diameter that assigns each vertex of an n-node tree a (1 + &Ogr;(1)) log2 n-bit label. Given the label of a source node and the label of a destination it is possible to compute, in constant time, the port number of the edge from the source that heads in the direction of the destination. The general scheme for k > 2 also uses a clustering technique introduced recently by the authors. The clusters obtained using this technique induce a sparse and low stretch tree cover of the network. This essentially reduces routing in general networks into routing problems in trees that could be solved using the above technique.
A generalized Graeffe's iteration for evaluating polynomials and rational functions
Authors: Luca Gemignani
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this paper we present a suitable generalization of the classical Graeffe's iteration by showing that it provides effective algorithms for the fast evaluation of polynomials and residues of rational and meromorphic functions. In particular, if g(z) = q(z)/p(z) is a rational function with n finite poles &xgr;1,&hellip;,&xgr;n and &xgr; is an initial approximation of &xgr;k such that &brvbar;&xgr; - &xgr;k&brvbar; < &brvbar;&xgr; - &xgr;j&brvbar; for any j &ne; k, 1 &lne; j &lne; n, then an extrapolation method is found for computing the residue of g(z) at &xgr;k by means of successive evaluations of the derivatives of q(z) and p(z) at the point z = &xgr;. In the case where q(z) = zp&prime;(z) we thus obtain a set of iterations for the refinement of polynomial zeros. Moreover, by setting q(z) = r(z)p&prime;(z), the same approach can also be used for the fast approximate evaluation of r(z) on the zeros of p(z).
Scheduling independent tasks to reduce mean finishing time
Authors: J. Bruno, E. G. Coffman,  Jr., R. Sethi
Venue: Communications of the ACM (1974)

Sequencing to minimize mean finishing time (or mean time in system) is not only desirable to the user, but it also tends to minimize at each point in time the storage required to hold incomplete tasks. In this paper a deterministic model of independent tasks is introduced and new results are derived which extend and generalize the algorithms known for minimizing mean finishing time. In addition to presenting and analyzing new algorithms it is shown that the most general mean-finishing-time problem for independent tasks is polynomial complete, and hence unlikely to admit of a non-enumerative solution.
The effect of student attributes on success in programming
Authors: Pat Byrne, Gerry Lyons
Venue: ACM SIGCSE Bulletin (2001)

This paper examines the relationship between student results in a first year programming course and predisposition factors of gender, prior computing experience, learning style and academic performance to date. While the study does not suggest that any dominant attributes are related to success in programming, there are some interesting outcomes which will have implications for teaching and learning.