ppxscal/embedding_network huggingface dataset:
Fast and Reliable Collision Culling Using Graphics Hardware
Authors: Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

We present a reliable culling algorithm that enables fast and accurate collision detection between triangulated models in a complex environment. Our algorithm performs fast visibility queries on the GPUs for eliminating a subset of primitives that are not in close proximity. In order to overcome the accuracy problems caused by the limited viewport resolution, we compute the Minkowski sum of each primitive with a sphere and perform reliable 2.5D overlap tests between the primitives. We are able to achieve more effective collision culling as compared to prior object-space culling algorithms. We integrate our culling algorithm with CULLIDE [CHECK END OF SENTENCE] and use it to perform reliable GPU-based collision queries at interactive rates on all types of models, including nonmanifold geometry, deformable models, and breaking objects.
Agents that acquire negotiation strategies using a game theoretic learning theory: Research Articles
Authors: Norberto Eiji Nawa
Venue: International Journal of Intelligent Systems (2006)

Automated negotiation systems and real-world negotiation situations have many aspects in common. Time is a relevant factor for all parties; information about preferences is private, and there is no interest in having it disclosed; negotiators learn about the opponents and try to enhance their strategies while interacting with one another. Experiments were performed with computational agents employing a learning algorithm based on the ideas of the Experience-Weighted Attraction theory of learning in games, which has been shown to model well human behavior observed in experimental settings. Negotiation strategies are acquired as the agents play bargaining games against one another. The strategies determine the agents' behaviors: how much they offer to the opponent, when they make offers, and the conditions for accepting an offer. The results show that the learning agents were able to acquire sensible strategies even from the most unstructured and dynamic environments. &copy; 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 539, 2006.
DI-GRUBER: A Distributed Approach to Grid Resource Brokering
Authors: Catalin Dumitrescu, Ioan Raicu, Ian Foster
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Managing usage service level agreements (USLAs) within environments that integrate participants and resources spanning multiple physical institutions is a challenging problem. Maintaining a single unified USLA management decision point over hundreds to thousands of jobs and sites can become a bottleneck in terms of reliability as well as performance. DIGRUBER, an extension to our GRUBER brokering framework, was developed as a distributed grid USLAbased resource broker that allows multiple decision points to coexist and cooperate in real-time. DIGRUBER addresses issues regarding how USLAs can be stored, retrieved, and disseminated efficiently in a large distributed environment. The key question this paper addresses is the scalability and performance of DI-GRUBER in large Grid environments. We conclude that as little as three to five decision points can be sufficient in an environment with 300 sites and 60 VOs, an environment ten times larger than today's Open Science Grid.
Supporting Effective Interaction with Tabletop Groupware
Authors: Meredith Ringel Morris
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

This workshop position paper describes our prior and ongoing research on horizontal computing systems, which is focused on understanding how interactive tables can effectively support co-located computer-supported collaborative work. We describe our recent contributions in the areas of multi-user coordination policies for interactive tables, using audio as a means of supplementing a tabletop display with private information, and exploring appropriate graphical layouts for horizontal interfaces. We also discuss our ongoing work in developing cooperative tabletop gestures and evaluating the potential of tabletop computing for educational activities.
Evolutionary Body Building: Adaptive Physical Designs for Robots
Authors: Pablo Funes, Jordan Pollack
Venue: Artificial Life (1998)

Creating artificial life forms through evolutionary robotics faces a "chicken and egg" problem: Learning to control a complex body is dominated by problems specific to its sensors and effectors, while building a body that is controllable assumes the pre-existence of a brain.The idea of coevolution of bodies and brains is becoming popular, but little work has been done in evolution of physical structure because of the lack of a general framework for doing it. Evolution of creatures in simulation has usually resulted in virtual entities that are not buildable, while embodied evolution in actual robotics is constrained by the slow pace of real time.The work we present takes a step in addressing the problem of body evolution by applying evolutionary techniques to the design of structures assembled out of elementary components that stick together. Evolution takes place in a simulator that computes forces and stresses and predicts stability of three-dimensional brick structures. The final printout of our program is a schematic assembly, which is then built physically. We demonstrate the functionality of this approach to robot body building with many evolved artifacts.
Users want simple control over device selection
Authors: Jan M. V. Misker, Jasper Lindenberg, Mark A. Neerincx
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

When users want to combine various resources in an ambient intelligent environment in an ad hoc manner, they need to be able to identify and select these resources. We conducted an experiment to study various user interaction styles for combining input and output devices in an ambient intelligent environment. The results show that the test subjects prefer to press a designated button on a device to select it. They least prefer an automatic selection. The main conclusion is that our subjects are willing to spend a bit of time and effort in order to gain control over their environment. This supports the claim that users acting in ambient intelligent environments should always be kept in the loop; systems should take care not to alienate their users when making decisions for them.
Acoustic Ear Recognition for Person Identification
Authors: A. H. M. Akkermans, T. A. M. Kevenaar, D. W. E. Schobben
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In this paper we investigate how the acoustic properties of the pinna - i.e. the outer flap of the ear- and the ear canal can be used as a biometric. The acoustic properties can be measured relatively easy with an inexpensive sensor and feature vectors can be derived with little effort. We achieve equal error rates in the order of 1.5% - 7%, depending on the application device that is used to do the measurement.
New Enhanced Methods for Radial Basis Function Neural Networks in Function Approximation
Authors: Mehdi Fatemi, Mehdi Roopaei, Faridoon Shabaninia
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

Function Approximation is a widely used method in System Identification and recently RBF networks have been proposed as powerful tools for that. Existing algorithms suffer from some restrictions such as slow convergence and/or encountering to bias in parameter convergence. This paper is an attempt to improve the above problems by proposing new methods of parameter initializing and post-training to reach better capabilities in learning time and desired precision compared to previous RBF networks.
System Balance and Fast Clocks
Authors: Burton J. Smith
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

As clock rates have risen over the years, nearly all aspects of computer implementation from programming model (got caches? got cores?) to component technology have been forced to adapt. The falling cost of transistors has enabled some of this, but does not always help. For example, we have now reached clock rates even in CMOS where skin effect in copper-based transmission lines limits the global bandwidth of large-scale systems so strongly that optical interconnect looks like the only way to retain balance.
A general framework to build new CPUs by mapping abstract machine code to instruction level parallel execution hardware
Authors: H. C. Wang, C. K. Yuen
Venue: ACM SIGARCH Computer Architecture News (2005)

Abstract machines bridge the gap between a programming language and real machines. This paper proposes a general purpose tagged execution framework that may be used to construct a CPU. The CPU may accept code written in any (abstract or real) machine instruction set, and produce tagged machine code after data conflicts are resolved. This requires the construction of a tagging unit, which emulates the sequential execution of the program using tags rather than actual values. The tagged instructions are then sent to an execution engine that maps tags to values as they become available and sends ready-to-execute instructions to arithmetic units. The process of mapping tag to value may be performed using the Tomasulo scheme, or a register scheme with the result of instructions going to registers specified by their destination tags, and waiting instructions receiving operands from registers specified by their source tags.The tagged execution framework is suitable for any instruction architecture from RISC machines to stack machines. We will illustrate with an example of a Java ILP processor using a VLIW execution engine. Some related implementing issues are discussed.
Text Representation: From Vector to Tensor
Authors: Ning Liu, Benyu Zhang, Jun Yan, Zheng Chen, Wenyin Liu, Fengshan Bai, Leefeng Chien
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we propose a text representation model, Tensor Space Model (TSM), which models the text by multilinear algebraic high-order tensor instead of the traditional vector. Supported by techniques of multilinear algebra, TSM offers a potent mathematical framework for analyzing the multifactor structures. TSM is further supported by certain introduced particular operations and presented tools, such as the High-Order Singular Value Decomposition (HOSVD) for dimension reduction and other applications. Experimental results on the 20 Newsgroups dataset show that TSM is constantly better than VSM for text classification.
Statistical and computational analysis of locality preserving projection
Authors: Xiaofei He, Deng Cai, Wanli Min
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap (Belkin & Niyogi, 2001), Locality Preserving Projection (LPP) (He & Niyogi, 2003), etc. All of them aim at discovering the meaningful low dimensional structure of the data space. In this paper, we present a statistical analysis of the LPP algorithm. Different from Principal Component Analysis (PCA) which obtains a subspace spanned by the largest eigenvectors of the global covariance matrix, we show that LPP obtains a subspace spanned by the smallest eigenvectors of the local covariance matrix. We applied PCA and LPP to real world document clustering task. Experimental results show that the performance can be significantly improved in the subspace, and especially LPP works much better than PCA.
A Review of Current Standards Activities for High Speed Physical Layers, invited
Authors: Thomas Palkert
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper will summarize the activities of next generation SERDES based interconnect standards and give a review of next generation Telecom, datacom and storage based SERDES interfaces. It will then discuss new techniques being developed for specifying interconnect operation at 10Gbps speeds over ¿challenging¿ channels.
Building Latency-aware Overlay Topologies with QuickPee
Authors: Andrea Ceccanti, Gian Paolo Jesi
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This work presents a gossip-based protocol, termed QuickPeer, which builds and maintains latency-aware overlay topologies. Such topologies are useful for several distributed applications, like distributed online gaming, context-aware P2P applications and QoS-aware publish/ subscribe systems. The distinctive feature of QuickPeer is that it can manage large scale overlay topologies providing each host in the overlay with its closest or furthest neighbour, according to network distance (RTT), in few gossip rounds. We present experimental results that prove that QuickPeer is a scalable and robust solution for large-scale latency-aware overlay topology management.
Automating physical design for an embedded control program
Authors: Lubomir P. Stanchev
Venue:  (2005)

A compiled database application consists of a collection of modules in a software system that interacts with a common database through a set of predefined transaction types. We will call a compiled database application an embedded control program (ECP) if quality of service requirements could be specified for some of the database operations in the different transaction types. Usually, the common database of an ECP is referred to as the control data. In this thesis we consider the problem of automating the physical design for the control data of an ECP. In particular, we show how to create, query, and update the data structures for the part of the database on which logarithmic time requirements are specified. Unlike the objectives of earlier works that aim to minimize the response time of the queries and updates in a workload, our goal is to minimize the storage requirements subject to the constraint that enough information is stored to allow for executing every database operation in the specified time-bound. Since not every SQL operation can be executed in logarithmic time, we introduce a subset of SQL that defines what constitutes a valid database operation on which a logarithmic time-bound requirement can be imposed. We start by fixing the physical design space. In particular, we explore two novel physical design encodings. The first extends traditional indices by allowing records with different attributes to be indexed together. It also introduces branching ordering conditions (i.e., different orders can be specified on different disjoint subsets of indexed records) and it supports marking bits that can be used to efficiently traverse predefined subsets of indexed records. The second encoding consists of compact structures that have the capability of representing several indices with similar ordering conditions. Both physical designs have the desired compact representation property because both encodings can be used to reduce the need for storing redundant data. We then construct a solution for each of the physical design models. Since the problem of finding the smallest possible encoding is NP-Hard for both physical designs, we present exponential time exact procedures and polynomial time approximate procedures for finding physical designs.
Role engineering of information system using extended RBAC model
Authors: Aneta Poniszewska-Maranda
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The role-based access control (RBAC) model is one of the policies used to access control in information systems for enterprises. The RBAC model is a powerful technology for managing and enforcing security in large-scale, enterprise-wide systems. Many implementations of this model, including the RBAC96 model, have been already proposed. This paper presents an extension of the standard RBAC model together with its implementation using the Unified Modeling Language (UML). The presented model is developed for the role engineering in the security of information system. In the paper the union of the RBAC model, which controls access in the information system, and the UML language, i.e. a unified method of object analysis and design, is proposed. The presented approach of the RBAC model consists in role creation via defining appropriate permissions. The entire procedure is performed in two stages; first permissions assigned to a function are defined, and then definitions of functions assigned to a particular role are provided.
Using aspects for integrating a middleware for dynamic adaptation
Authors: Gaëtan Vaysse, Françoise André, Jérémy Buisson
Venue: Proceedings of the 1st workshop on Aspect oriented middleware development (2005)

Middlewares are designed to hide common concerns in software development. One of the challenges in middleware development is to conceive how they can be integrated into applications in an efficient manner and at an acceptable cost for developers. This article reports results of practical experiences of integrating Afpac, a middleware for dynamic adaptation, thanks to aspect-oriented programming. Using current techniques, places where applications and middlewares can interact are limited to boundaries of application entities. In the case of Afpac, this is not sufficient. This paper details the issues that arise when integrating Afpac and proposes a set of features an aspect weaver should have to be usable in that case. As usual weavers do not provide those features, a weaver has been developed in order to demonstrate the feasability of this approach.
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Authors: John C. Mitchell
Venue:  (2005)

This thesis presents a Probabilistic Polynomial-time Process Calculus (PPC) for security analysis and applies the calculus to examples from security. Expressions in PPC represent systems of concurrently executing programs that can communicate with each other. Each expression can be evaluated in probabilistic polynomial-time, thus aligning PPC with the foundations of modern cryptography. Expressions in PPC are evaluated by allowing entities to perform local computation until some communication with another entity is required. This communication is selected probabilistically, and the cycle is repeated until further communication is impossible. We define an observational equivalence relation that relates two expressions if there is not PPC context that distinguishes them. We then develop an equational proof system for PPC that allows the axiomatic derivation of security properties of protocols expressed in PPC. The proof system is proved sound using a form of probabilistic bisimulation: two expressions are bisimilar if they produce the same distributions on observable behaviour. Since bisimulation does not explicitly quantify over contexts, it is simpler than observational equivalence. Consequently, showing the soundness of many of the proof rules becomes easier when bisimulation is used. The equational proof system is applied to various examples from computer security. Since PPC captures probabilistic poly-time computation, and observational equivalence quantifies over all contexts, we can succinctly state that a protocol is secure using observational equivalence between the protocol and a specification. This approach provides a natural equivalence-based treatment of fundamental notions such as computational indistinguishability, pseudorandomness, semantic security, various definitions of hash function security, as well as assumptions such as the Decision Diffie-Hellman Assumption (DDHA) and the Discrete Log Assumption (DLOG). We can also axiomatically derive well known results such as the equivalence of the semantic security of El Gamal encryption and DDHA. While these relationships are not new, their formal development here demonstrates the expressivity and power of PPC. The thesis concludes by investigating the relationships between various methods of asserting the security of a protocol using a specification. We can, for the first time, show axiomatically that Universal Composability, Blackbox Simulatability, and Process Simulatability are equivalent under certain reasonable assumptions about how principals communicate.
Genetic science, animal exploitation, and the challenge for democracy
Authors: Steven Best
Venue: AI Society (2005)

As the debates over cloning and stem cell research indicate, issues raised by biotechnology combine research into the genetic sciences, perspectives and contexts articulated by the social sciences, and the ethical and anthropological concerns of philosophy. Consequently, I argue that intervening in the debates over biotechnology requires supra-disciplinary critical philosophy and social theory to illuminate the problems and their stakes. In addition, debates over cloning and stem cell research raise exceptionally important challenges to bioethics and a democratic politics of communication.
Disconnection-Resilient File System for Mobile Clients
Authors: Azzedine Boukerche, Raed Al-Shaikh, Bo Marleau
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we propose a novel mobile distributed file system design, which provides high available and reliable storage for files and guarantees that file operations are executed in spite of concurrency and failures. The design is intended to fit mobile clients' devices (e.g., PDAs and cell phones) that have limited storage space and cannot store all data they need, yet they require to access these data at all times. We adopt a server-side caching in order to guarantee sufficient caching space to all mobile clients, and ensure the availability of files in case of clients' failures. We present our algorithm, describe its implementation, and report on its performance evaluation using a cluster of workstations. Our results indicate clearly that our algorithm exhibits a significant degree of automation and conflict-free mobile file system.
What Is It Like to Be a Bot?
Authors: Francis Sullivan
Venue: Computing in Science and Engineering (2006)

Our title is a take-off on Thomas Nagel's profound and famous piece, "What Is It Like to Be a Bat?," which first appeared in The Philosophical Review in 1974 and has been cited hundreds of times since. (Google finds 67,000 hits!) His point is that it's impossible to know what it's like to be a bat. Of course, we can imagine having leathery wings, navigating by sonar, eating bugs while flying, and hanging upside down to sleep, but that's not the same as knowing what a bat experiences. In other words, we can't know what it's like for a bat to be a bat. Whether you agree with him or not, his view is even more relevant today than it was in 1974.