ppxscal/embedding_network huggingface dataset:
A fixpoint calculus for local and global program flows
Authors: Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We define a new fixpoint modal logic, the visibly pushdown μ-calculus (VP-μ), as an extension of the modal μ-calculus. The models of this logic are execution trees of structured programs where the procedure calls and returns are made visible. This new logic can express pushdown specifications on the model that its classical counterpart cannot, and is motivated by recent work on visibly pushdown languages [4]. We show that our logic naturally captures several interesting program specifications in program verification and dataflow analysis. This includes a variety of program specifications such as computing combinations of local and global program flows, pre/post conditions of procedures, security properties involving the context stack, and interprocedural dataflow analysis properties. The logic can capture flow-sensitive and inter-procedural analysis, and it has constructs that allow skipping procedure calls so that local flows in a procedure can also be tracked. The logic generalizes the semantics of the modal μ-calculus by considering summaries instead of nodes as first-class objects, with appropriate constructs for concatenating summaries, and naturally captures the way in which pushdown models are model-checked. The main result of the paper is that the model-checking problem for VP-μ is effectively solvable against pushdown models with no more effort than that required for weaker logics such as CTL. We also investigate the expressive power of the logic VP-μ: we show that it encompasses all properties expressed by a corresponding pushdown temporal logic on linear structures (caret [2]) as well as by the classical μ-calculus. This makes VP-μ the most expressive known program logic for which algorithmic software model checking is feasible. In fact, the decidability of most known program logics (μ-calculus, temporal logics LTL and CTL, caret, etc.) can be understood by their interpretation in the monadic second-order logic over trees. This is not true for the logic VP-μ, making it a new powerful tractable program logic.
Proceedings of the 2005 workshop on Digital identity management
Venue: Workshop On Digital Identity Management (2005)

On behalf of the DIM Program Committee, we are very pleased to welcome you to the First ACM Workshop on Digital Identity Management - DIM 2005, held in conjunction with the 12th ACM Conference on Computer and Communications Security, CCS2005.Digital identity management is becoming an integral part of our lives and businesses as more and more of the online interactions in which we participate depend on networked computer systems communicating potentially sensitive identity information across personal, company, and enterprise boundaries. Conversely, the abuse of digital identities (e.g. identity theft, eavesdropping, hacking, profiling, etc.) poses an increasing threat to both our privacy and finances - thereby affecting society's collective confidence in online interactions.The goals of this workshop are to explore the frontier of digital identity management, from theoretical analysis to real-world experience, to share the knowledge obtained to date, and to propose an agenda for further research.The program committee accepted 13 papers, from North America, Europe, and Asia, that cover a variety of topics, including privacy protections, authentication and security, and frameworks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.
Making Linux accessible for the visually impaired with speakup
Authors: Ameer Armaly
Venue: Linux Journal (2005)

A great article from an amazing 16-year-old kid on a project that's changing his life.
The elements of nature: interactive and realistic techniques
Authors: Oliver Deusen, David S. Ebert, Ron Fedkiw, F. Kenton Musgrave, Przemyslaw Prusinkiewicz, Doug Roble, Jos Stam, Jerry Tessendorf
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This updated course on simulating natural phenomena will cover the latest research and production techniques for simulating most of the elements of nature. The presenters will provide movie production, interactive simulation, and research perspectives on the difficult task of photorealistic modeling, rendering, and animation of natural phenomena. The course offers a nice balance of the latest interactive graphics hardware-based simulation techniques and the latest physics-based simulation techniques. Interactive implementations and approximations of complex physics-based simulations will be presented, as well as procedural approximations and combined hybrid techniques. Interactive demonstrations and discussions of implementation details impart a working knowledge of these techniques that can't be acquired by reading papers on the topics.
The detection of RCS worm epidemics
Authors: Kurt Rohloff, Tamer Başar
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

This paper discusses the problem of automatically detecting the existence of Random Constant Scanning (RCS) worm epidemics on the Internet by observing packet traffic in a local network. The propagation of the RCS worm is modelled as a simple epidemic. An optimal hypothesis-testing approach is presented to detect simple epidemics under idealized conditions based on the cumulative sums of log-likelihood ratios. It is shown that there are limitations on the ability of this optimal method to detect several important subclasses of RCS worm epidemics even under idealized conditions.
Usable speech processing: a filterless approach to speaker identification in the presence of non-stationary interference
Authors: Brett Y. Smolenski
Venue:  (2005)

One of the principle challenges in the area of speaker identification is enabling currently available applications to work in operational environments. In an operational environment speaker identification systems are confounding with reverberation and other channel effects; several sources of noise and non-stationary interference; and a multitude of speech like sounds, such as coughing and laughter, which lie outside the capabilities of even the most robust speaker identification systems. To address these issues, the notion of usable speech was developed. As opposed to the filtering paradigm, the usable speech concept is to identify and extract those segments of signal that are known to perform well with the intended application. A particularly difficult and common type of non-stationary interference will be dealt with in this research, which is that of an inferring talker. This type of situation is called co-channel speech. However, it should be noted that the techniques developed in this research can be applied to many situations where there exists both stationary and non-stationary interference. The co-channel usable speech concept will be further explored by the detailed statistical analysis and characterization of usable and unusable speech segments using a continuous-time Markov chain model of the voiced, unvoiced, and silent regions of the speech signal. In addition, a novel structure-based usable speech feature is developed that takes into consideration the deleterious effects of jitter, shimmer, and diplophonia. This feature is then used to derive a context dependent estimator of the instantaneous interference level of the corrupted speech signal, which can be used to detect the less degraded portions of the signal. In addition, three novel applications of the usable speech concept will be developed: co-channel speaker identification, co-channel speaker separation, and a simple speaker counting system.
An Evaluation System for String Extraction in the Airline Coupon Project
Authors: Yan Heping, Zhiyan Wang, Sen Guo
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper we introduce an evaluation system to evaluate the performance of segmentation algorithm aimed to the airline coupon project. It is based on two databases which are constructed by a standard observer method and three error measures. Due to the idea of consolidating subjectivity to objectivity, it is proved effective and objective in segmentation evaluation work in the airline coupon project. It is also convenient to analysis the segmentation results and to flesh out the databases endlessly in a net-based integrated working environment.
Enabling Software DSM System for Grid Computing
Authors: Tyng-Yeu Liang, Chun-Yi Wu, Jyh-Biau Chang, Ce-Kuen Shieh, Pei-Hsin Fan
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent resource allocation service to easily develop applications and aggregate distributed resources for solving their problems on the grid environment. Moreover, since the communication cost of maintaining data-consistency is a big problem for the performance of the DSM applications, Teamster-G exploits a cluster cache scheme and a two-level consistency protocol to minimize the number of data-consistency messages transferred over wide area network. We will present the framework and the performance of Teamster-G in this paper.
A Tandem Queue with Coupled Processors: Computational Issues
Authors: J. S. Leeuwaarden, J. A. Resing
Venue: Queueing Systems: Theory and Applications (2005)

In Resing and Örmeci [16] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty.It is assumed that jobs arrive at the first station according to a Poisson process and require service at both stations before leaving the system. The amount of work that a job requires at each of the stations is an independent, exponentially distributed random variable. When both stations are nonempty, the total service capacity is shared among the stations according to fixed proportions. When one of the stations becomes empty, the total service capacity is given to the nonempty station.We study the two-dimensional Markov process representing the numbers of jobs at the two stations. The problem of finding the generating function of the stationary distribution can be reduced to two different Riemann-Hilbert boundary value problems, where both problems yield a complete analytical solution. We discuss the similarities and differences between the two problems, and relate them to the computational aspects of obtaining performance measures.
Load squared: adding logic close to memory to reduce the latency of indirect loads with high miss ratios
Authors: Sami Yehia, Jean-Francois Collard, Olivier Temam
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

Indirect memory accesses, where a load is fed by another load, are ubiquitous because of rich data structures and sophisticated software conventions, such as the use of linkage tables and position independent code. Unfortunately, they can be costly: if both loads miss, two round trips to memory are required even though the role of the first load is often limited to fetching the address of the second load. To reduce the total latency of such indirect accesses, a new instruction called load squared is introduced. A load squared does two fetches, the first fetch reading the target address of the second. (An offset is optionally added to the result of the first fetch.) The load squared operation is performed by memory-side logic (typically, the memory controller if it isn't located on the main processor chip). In this study, load squared is not an architecturally visible instruction: the micro-architecture transparently decides which loads should be replaced by loads squared. We show that performance is sometimes improved significantly, and never degraded.
Program description language as a documentation tool: a case history
Authors: Jonathan Sachs
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

My employer maintains a data base used for consumer credit history checks by credit bureaus in over fifty U.S. cities. The data base receives data from several thousand credit grantors.
A method for robot navigation toward a moving goal with unknown maneuvers
Authors: F. Belkhouche, B. Belkhouche
Venue: Robotica (2005)

This paper deals with a method for robot navigation towards a moving goal. The goal maneuvers are not a priori known to the robot. Our method is based on the use of the kinematics equations of the robot and the goal combined with geometrical rules. First a kinematics model for the tracking problem is derived and two strategies are suggested for robot navigation, namely the velocity pursuit guidance law and the deviated pursuit guidance law. It turns out that in both cases, the robot's angular velocity is equal to the line of sight angle rate. Important properties of the navigation strategies are discussed and proven. In the presence of obstacles, two navigation modes are used: the tracking mode, which has a global aspect and the obstacle avoidance mode, which has a local aspect. In the obstacle avoidance mode, a polar diagram combining information about obstacles and directions corresponding to the pursuit is constructed. An extensive simulation study is carried out, where the efficiency of both strategies is illustrated for different scenarios.
Privacy and identity management for everyone
Authors: Jan Camenisch, abhi shelat, Dieter Sommer, Simone Fischer-Hübner, Marit Hansen, Henry Krasemann, Gérard Lacoste, Ronald Leenes, Jimmy Tseng
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

The shift from a paper-based to an electronic-based society has dramatically reduced the cost of collecting, storing and processing individuals' personal information. As a result, it is becoming more common for businesses to "profile" individuals in order to present more personalized offers as part of their business strategy. While such profiles can be helpful and improve efficiency, they can also govern opaque decisions about an individual's access to services such as credit or an employment position. In many cases, profiling of personal data is done without the consent of the target individual.In the past decade, the European Union and its member states have implemented a legal framework to provide guidance on processing of personal data with the specific aim to restore the citizens' control over their data. To complement the legal framework, the prime (Privacy and Identity Management for Europe) project [14] has implemented a technical framework for processing personal data. prime's vision is to give individuals sovereignty over their personal data so that:Individuals can limit the information collected about them by using pseudo-identities, certifications and cryptography when performing online transactions,Individuals can negotiate legally-binding "privacy policies" with their service providers that govern how disclosed personal data can be used and which precautions must be taken to safeguard it, andIndividuals and service providers can use automated mechanisms to manage their personal data and their obligations towards data which they have collected from other parties.To accomplish this, the prime project has designed and implemented a practical system-level solution which incorporates novel cryptographic protocols, sophisticated security protocols, and artificial intelligence algorithms. This paper describes the architecture of this system. Most key features of this architecture have been implemented in a proof-of-concept prototype.
Critical Infrastructure Awareness Required by Civil Emergency Planning
Authors: Eric A. M. Luiijf, Marieke H. A. Klaver
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

Modern societies are increasingly dependent on a set of critical products and services which comprise the Critical Infrastructure (CI). This makes Critical infrastructures increasingly important as a planning factor in case of emergencies. For that reason, we studied a number of emergencies and a small set of local emergency plans from the perspective of how first responder currently take critical infrastructures into account. Our initial analysis indicates that civil emergency plans lack consideration for critical infrastructures. First responders, such as police and fire brigades, are often unaware of that their operations and non-evacuated citizens depend on critical infrastructure. Therefore, we recommend that emergency preparedness plans, training, situational awareness, and the decisioncycle of first responders and emergency management need to pay more attention to critical infrastructures. This decreases the risk that emergencies are worsened due to second-order effects of failing infrastructure, that emergency operations themselves are hampered, and that more casualties occur.
Multiple robot coordination: a mathematical programming approach
Authors: Srinivas Akella
Venue:  (2005)

This thesis focuses on the optimal coordination of multiple robot systems with dynamics along specified paths using mathematical programming. These multiple robot coordination problems are motivated by wide applications, including automated guided vehicle coordination in industries, droplet coordination in digital microfluidic systems, and manipulator coordination in car assembly lines. Previous work on optimal coordination of robots either ignored robot dynamics or focused almost exclusively on dual robot systems. Initially we assume that each robot's path is specified. We first develop a mixed integer nonlinear program (MINLP) model for coordinating multiple robots with double integrator dynamics. We demonstrate the convexity and differentiability of the nonlinear constraints in this MINLP and provide several global optimality conditions for multiple robot coordination with dynamics. We then develop two mixed integer linear program (MILP) models to approximate the MINLP model. In addition, we find the computational complexity and show a shortest path structure and a network flow structure for multiple robot coordination. To coordinate multiple manipulators with given initial trajectories, we exploit the time-scaling law to build MILP and MINLP models that uniformly scale the trajectories, minimize the system cost, satisfy complex manipulator dynamics, and avoid collisions. In addition, we develop a mixed integer conic program (MICP) model that is guaranteed to find the globally optimal design for time-scaled planar manipulator systems. We demonstrate our approaches for multiple robot coordination with extensive implementation results. Computing collision zones and detecting collisions are crucial for coordinating multiple robots. The last topic of the thesis is concerned with collision detection and proximity queries for objects represented as superconics, which are a generalization of convex superellipsoids. We design an efficient algorithm for computing the minimum distance between two superconics using second order cone programs.
U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors
Authors: Shinpei Kato, Hidenori Kobayashi, Nobuyuki Yamasaki
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The goal of this paper is to achieve hard real-time processing with admitting as many tasks as possible on Simultaneous Multithreaded (SMT) processors. For this goal, we propose U-Link scheduling scheme that determines the co-scheduled set that is the fixed combinations of co-scheduled tasks to bound the task execution time. Also we present practical algorithms, RR-DUP for building co-scheduled sets and UL-EDF for task scheduling. The performance evaluation shows that UL-EDF with RR-DUP outperforms the conventional scheduling algorithms, EDF-FF and EDFUS, in the point of execution time stability, task rejection ratio and deadline miss ratio.
AAA Architecture for Mobile IP in Overlay Networks
Authors: Zhen Zhen, Srinivas Sampalli
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The next generation wireless network is an overlay network, in which AAA (Authentication, Authorization and Accounting) is performed across domains. The current IETF AAA architecture causes long authentication delays during handoffs. In this paper, we propose a new network trust model to simplify the key management among networks. Based on this, a protocol is designed to shorten the delays.
Design of a Generic 3D Visualization System for Process Control
Authors: Knut Meissner, Hartmut Hensel
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Based on the information overload caused by the increase of complexity of modern control systems in the process industry, a new approach for a generic 3D visualization system was developed. Founded on the technical state of the art and the traditional visualization systems in the area of process data visualization, this paper describes the function of multi agent architecture for data collection, data pre-processing and data compression as well as the approach for the new generic 3D visualization for multi data presentation. This visualization system is based on the cognitive abilities of pattern recognition of human beings and a decrease of the mental workload of the operators. An evaluation with different user groups shows the operator¿s acceptance and usability.
Fault Tolerance Techniques for the Merrimac Streaming Supercomputer
Authors: Mattan Erez, Nuwan Jayasena, Timothy J. Knight, William J. Dally
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

As device scales shrink, higher transistor counts are available while soft-errors, even in logic, become a major concern. A new class of architectures, such as Merrimac and the IBM Cell, take advantage of the higher transistor count by exposing control, communication, and a large number of functional-units at the architectural level, thus achieving high performance and efficiency. This paper explores soft-error fault tolerance in the context of these computeintensive architectures, which differ significantly from their control-intensive CPU counterparts. The main goal of the proposed schemes for Merrimac is to conserve the critical and costly off-chip bandwidth and on-chip storage resources, while maintaining high peak and sustained performance. We achieve this by allowing for reconfigurability and relying on programmer input. The processor is either run at full peak performance employing software fault-tolerance methods, or reduced performance with hardware redundancy. We present several methods, their analysis, and detailed case studies.
SOCK: a sociometric analysis system
Authors: Richard D. Alba, Myron P. Gutmann
Venue: ACM SIGSOC Bulletin (1972)

The SOCK system is intended to provide a set of procedures for sociometric clique identification. The procedures in SOCK are based upon numerical clustering techniques which isolate highly interrelated subsets of individuals. Since clustering techniques do not generally work well when operating on simple dichotomous choice data, i.e., on adjacency matrices, these procedures involve the derivation of some matrix of pairwise social distance or proximity from the dichotomous choice data.