ppxscal/embedding_network huggingface dataset:
Events, actors and interaction of hybrid entities in virtual reality
Authors: Marissa Díaz Pier, Isaac Rudomín Goldberg, Daniel Rivera
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

To develop an interface to improve interaction, the first step is usually to explore the user's needs and perceptions. However, in our changing world, it is necessary to connect not only humans to the computer world, but also to develop interfaces for entities such as animals and plants. We have developed and tested some interfaces allowing us to study the effects of different kinds of interaction and how people change their perception of other virtual and living entities. These interfaces allow the user to have contact with other living beings, such as plants and animals, in unique ways that provide a better understanding of their "feelings". In the specific case of plants, this is achieved by transforming the measurement of changes in the soil where the plant is into humanly abstracted experiences, such as thirst, sadness and happiness. These events are processed and analyzed by a computer program that infers the current status of the plant so that this can be modeled like a FSM.One way to link the actions performed by the user with a desirable result in the virtual world is to effectively guess the user's needs and expectations. However, this is not always achieved. Tactile sensations, sounds and images can help us to immerse the user into our application, but in heterogeneous VR applications we need to include virtual references to connect all the entities in the Virtual world and change the way the user observes these entities. The following paper describes a Plant-Computer-Human interface involving a real and a virtual plant that was developed for VR and Art applications. We also describe the reactions of users to these applications.
Anthill: A Scalable Run-Time Environment for Data Mining Applications
Authors: Renato A. Ferreira, Wagner Meira,  Jr., Dorgival Guedes, Lucia M. A. Drummond, Bruno Coutinho, George Teodoro, Tulio Tavares, Renata Araujo, Guilherme T. Ferreira
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Data mining techniques are becoming increasingly more popular as a reasonable means to collect summaries from the rapidly growing datasets in many areas. However, as the size of the raw data increases, parallel data mining algorithms are becoming a necessity. In this paper we present a run-time support system that was designed to allow the efficient implementation of data-mining algorithms on heterogeneous distributed environments. We believe that the runtime framework is suitable for a broader class of applications, beyond data mining. We also present a parallelization strategy that is supported by the run-time system. We show scalability results of three different data-mining algorithms that were parallelized using our approach and our run-time support. All applications scale almost linearly up to a large number of nodes.
Improving Service Performance through Object Replication in Middleware: A Peer-to-Peer Approach
Authors: Tianying Chang, Mustaque Ahamad
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

The scalability of a distributed service can be improved if the number of replicated instances of the service can vary with the load experienced by the system. To ensure that the number and placement of the replicas can be dynamically changed based on network and load conditions, a peer node must know when it should create a new replica and when such a replica can be removed. A scheme that makes such decisions centrally suffers from a number of problems. In this paper, we propose a self-managing replication algorithm for a peer-to-peer system where a peer node makes its decisions based on its locally maintained information. This algorithm offers several benefits. They include being responsive to heterogeneous load and ensuring that each peer node fairly contributes its available resources to meet the needs of the overall system. It is evaluated with simulations of a system that consists of one thousand nodes. Our results show that this self-managing algorithm can maintain a replication degree that adapts to load in the system and achieve a low response time.
Fast synchronization on shared-memory multiprocessors: An architectural approach
Authors: Zhen Fang, Lixin Zhang, John B. Carter, Liqun Cheng, Michael Parker
Venue: Journal of Parallel and Distributed Computing (2005)

Synchronization is a crucial operation in many parallel applications. Conventional synchronization mechanisms are failing to keep up with the increasing demand for efficient synchronization operations as systems grow larger and network latency increases. The contributions of this paper are threefold. First, we revisit some representative synchronization algorithms in light of recent architecture innovations and provide an example of how the simplifying assumptions made by typical analytical models of synchronization mechanisms can lead to significant performance estimate errors. Second, we present an architectural innovation called active memory that enables very fast atomic operations in a shared-memory multiprocessor. Third, we use execution-driven simulation to quantitatively compare the performance of a variety of synchronization mechanisms based on both existing hardware techniques and active memory operations. To the best of our knowledge, synchronization based on active memory outforms all existing spinlock and non-hardwired barrier implementations by a large margin.
Statistical Models for Assessing the Individuality of Fingerprints
Authors: Sarat C. Dass, Yongfang Zhu, Anil K. Jain
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

The problem of fingerprint individuality is as follows: Given a sample fingerprint, what is the probability of finding a sufficiently similar fingerprint in a target population? In this paper, we develop a family of finite mixture models to represent the distribution of minutiae locations and directions in fingerprint images, including clustering tendencies and dependencies in different regions of the fingerprint domain. These models are shown to be a better fit to the observed distribution of minutiae features and give better assessments of fingerprint individuality compared to previous models. Estimates of fingerprint individuality are obtained using the probability of a random correspondence (PRC). For the "12-point match" criteria, a PRC of 9.2×10^-5 was obtained for the FVC2002 DB1 database when the number of query and template minutiae features both equal 26. The corresponding PRC based on the MSU VERIDICOM database for the same matching criteria is 6.6 × 10^-4.
Apex-Map: A Global Data Access Benchmark to Analyze HPC Systems and Parallel Programming Paradigms
Authors: Erich Strohmaier, Hongzhang Shan
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

The memory wall and global data movement have become thedominant performance bottleneck for many scientific applications.New characterizations of data access streams and related benchmarks to measure their performances are therefore needed to compare HPC systems,software, and programming paradigms effectively. In this paper, weintroduce a novel global data access benchmark, Apex-Map. It is a parameterized synthetic performance probe and integrates concepts fortemporal and spatial locality into its design. We measured Apex-Map performancefor a whole range of temporal and spatial localities on several advanced processors and parallel computing platforms and use the generatedperformance surfaces forperformance comparisons and to study the characteristicsof these different architectures. We demonstrate that the results of Apex-Mapclearly reflect many specific characteristics of the used systems. We also show the utility of Apex-Map for analyzing the performance effects of threeleading parallel programming models and demonstrate their relative merits.
Information source selection for resource constrained environments
Authors: Demet Aksoy
Venue: ACM SIGMOD Record (2005)

Distributed information retrieval has pressing scalability concerns due to the growing number of independent sources of on-line data and the emerging applications. A promising solution to distributed retrieval is metasearching, which dispatches a user's query to multiple sources and gathers the results into a single result set. An important component of metasearching is selecting the set of information sources most likely to provide relevant documents. Recent research has focused on how to obtain statistics for the selection task. In this paper we discuss different information source selection approaches and their applicability for resource-constrained sensor network applications.
Segmentation of Touching Symbols for OCR of Printed Mathematical Expressions: An Approach based on Multifactorial Analysis
Authors: Utpal Garain, B. B. Chaudhuri
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper deals with segmentation and recognition of touching characters appearing in scannedmathematical expressions. The technique is based on multifactorial analysis that integrates several factors determining cut-positions in a touching character image. A predictive algorithm is developed for efficient selection of possible cut-positions for segmenting touching characters. Experiment has been carried out using a test-set of reasonable size and results show that a considerable improvement in recognition accuracy can be achieved with a modest increase in computations.
New techniques for analyzing applied computer security systems
Authors: Avi Rubin
Venue:  (2005)

New techniques for the analysis of real-world computer security systems are presented. These methods were developed to allow the analysis of several specific actual systems ranging from secure hardware devices to cryptographic network protocols. Each method is presented in the context of the system it was first used to analyze. The first system analyzed is a cryptographically enabled radio frequency identification tag that is currently used to protect digital payments and prevent the theft of automobiles. We present new techniques for reverse-engineering a crypto graphic algorithm given only black-box access. That is, uncovering the underlying algorithm given only input/output pairs. These represent the first such techniques published in the open literature. The second system discussed is a voting machine that is currently in use in several states. By examining the source code that was used in the machine, we were able to discover several serious vulnerabilities. In particular, we located problems with the smartcard protocol and the cryptographic data protection mechanisms. The third system analyzed is the security protocol in 802.11b wireless networks. Here we show how a cryptanalytic attack on a modification of the underlying cipher can be applied to systems that use initialization vectors and provide structured headers as early plaintext. Moreover, we show how the attack can be amplified when a nonuniform underlying distribution on individual underlying key bytes can be assumed. The final system analyzed is a collection of candidate digital rights management algorithms. Here we show how the use of unkeyed error correcting codes can simplify cryptanalysis and reverse-engineering of security systems.
Service based CAC with QoS guarantee in mobile wireless cellular networks: Research Articles
Authors: Robert G. Fry, Abbas Jamalipour
Venue: International Journal of Communication Systems (2005)

The increasing variety and complexity of traffic in today's mobile wireless networks means that there are more restrictions placed on a network in order to guarantee the individual requirements of the different traffic types and users. Call admission control (CAC) plays a vital role in achieving this. In this paper, we propose a CAC scheme for multiple service systems where the predicted call usage of each service is used to make the admission decision. Our scheme enables real-time traffic to be transmitted using shared bandwidth without quality of service (QoS) requirements being exceeded. This ensures that the utilization of the available wireless bandwidth is maximized. Information about the channel usage of each service is used to estimate the capacity of the cell in terms of the number of users that can achieve a certain bit error rate (BER). Priorities assigned to each service are used to allocate the network capacity. An expression for the handoff dropping probability is derived, and the maximum acceptance rate for each service that results in the estimated dropping probability not exceeding its QoS requirements is calculated. Each call is then accepted with equal probability throughout the duration of a control period. Achieved QoS during the previous control period is used to update the new call acceptance rates thus ensuring the dropping probability remains below the specified threshold.Simulations conducted in a wideband CDMA environment with conversational, streaming, interactive and background sources show that the proposed CAC can successfully meet the hard restraint on the dropping probability and guarantee the required BER for multiple services. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A User-Level Approach To Network Attached Storage
Authors: Ripduman Sohan, Steven Hand
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Modern network attached storage architectures suffer from poor performance, resource management and inflexibility. We examine the problems of current architectures and propose an alternative, built around the precept of doing network storage at user-level. We further examine some of the challenges associated with this unusual approach and provide some preliminary block layer results indicating our architecture results in better performance than current designs
Multi-Versions Data for Improvement of QoS in RTDBS
Authors: Emna Bouazizi, Claude Duvallet, Bruno Sadeg
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In current research toward the design of more powerful behavior of RTDBS under unpredictable workloads, different research groups focus their work on QoS (Quality of Service) guarantee. Their research are often based on feedback control real-time scheduling theory. In this paper, we propose a technique which allows to execute transactions on time using fresh and precise data while taking into account the global size of the database. We have extended the feedback-based miss ratio control by both using multi-versions data, and proposing a data management policy combining (1) limitation of the versions number and (2) dynamic adjustment of this limit according to a maximum database size parameter.
Protein Motif Searching Through Similar Enriched Parikh Vector Identification
Authors: Xiaolu Huang, Hesham Ali, Anguraj Sadanandam, Rakesh Singh
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Biological researches have shown that some protein regions sharing similar functions or structures have inversed-ordered or highly dispersed sequence similarities and some intra-sequence similarities such as palindrome repeats also play important roles in protein folding. The current protein analysis tools cannot detect these "nontraditional" similarities. Although some tools can be modified for searching intra-sequence inversed or forward ordered similarities, their maximally optimal path processes will miss many suboptimal biologically meaningful similarities. The Similar enRiched Parikh Vector Searching (SRPVS) algorithm searches similarities by separating the subsequence composition and order information. The SRPVS first breaks sequences into groups of predefined-sized subsequences, each represented by an enRiched Parikh Vector (RPV); then Similar RPV pairs (SRPV) are searched in each nonoverlapping RPV pair based on various order restrictions - forward, inversed, or shuffled. In this study, SRPVS has been applied to the protein ligand motif finding and the intra-sequence protein inversed repeats finding.
A Requirements Engineering Methodology Based On Natural Language Syntax and Semantics
Authors: Marinos G. Georgiades, Andreas S. Andreou, Constantions S. Pattichis
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The present paper proposes a methodology for engineering requirements in a precise, comprehensive, understandable and time-saving way based on concepts and principles of Natural Language Syntax and Semantics (NLSS). The NLSS methodology copes with the following phases: (i) requirements discovery, by emphasizing on the creation and application of specific questions sets; (ii) requirements analysis, by stressing issues such as classification, decomposition and terminology of requirements; and (iii) requirements specification, by focusing on the writing formalization of the requirements.
On-line Time-Constrained Scheduling Problem for the Size on \kappa machines
Authors: Nicolas Thibault, Christian Laforest
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper we consider the problem of scheduling online jobs on\kappa identical machines. Technically, our system is composed of \kappa identical machines and each job is defined by a triplet r = (l,r,p) where l denotes its left border,its right border and p its length. When a job is revealed, it can be rejected or scheduled on one of the \kappa machines In this last case, it can suppress already scheduled jobs. The goal is to maximize the size of the schedule (i.e. the number of jobs scheduled and not (later) suppressed). We propose an algorithm called OLUW.It is (4\min (\beta ,\left\lfloor {Log_2 (\gamma )} \right\rfloor+ 1)) competitive, where \beta is the number of different job lengths appearing in the on-line input sequence and \gamma is the ratio between the length of the longest job and the length of the shortest job in the sequence. To the best of our knowledge, OLUW is the first on-line algorithm maximizing the size with guarantees on the competitive ratio for the timeconstrained scheduling problem on \kappa machines.
Facial modeling and animation
Authors: Jörg Haber, Demetri Terzopoulos
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

In this course we present an overview of the concepts and current techniques in facial modeling and animation. We introduce this research area by its history and applications. As a necessary prerequisite for facial modeling, data acquisition is discussed in detail. We describe basic concepts of facial animation and present different approaches including parametric models, performance-, physics-, and learning-based methods. State-of-the-art techniques such as muscle-based facial animation, mass-spring networks for skin models, and morphable models are part of these approaches. We furthermore discuss texturing of head models and rendering of skin, addressing problems related to texture synthesis and bump mapping with graphics hardware. Typical applications for facial modeling and animation such as medical and forensic applications (craniofacial surgery simulation, facial reconstruction from skull data, virtual aging) and animation techniques for movie production (case study of The Matrix sequels) are presented and explained.
Simulated Bacterially-Inspired Problem Solving --- The Behavioural Domain
Authors: R. C. Paton, C. Vlachos, Q. H. Wu, J. R. Saunders
Venue: Natural Computing: an international journal (2006)

Bacterial populations meet the challenges of dynamic spatially heterogeneous environments with fluctuating biotic and abiotic factors in a number of ways. The motivation for the work presented here has been to transfer ideas from bacterial adaptability and evolvability to computational problem solving. Following a brief comment on some examples of the ways bacteria solve problems, a bacterially-inspired computational architecture for simulating aspects of problem solving is described. We then examine three case studies. The first, a study of the mutational impact of a remediation to toxic (fitness-reducing) material, highlights how a sufficiently pre-engineered adaptive system can solve a difficult problem quite easily. The second study looks at why it is difficult to evolve complex problem solving behaviours and how artificial selection mechanisms coupled with pre-engineering the system can help. Specifically, this refers to quorum sensing and tactic behaviours. A further study looked at ways in which a quorum sensing analogue could help computational agents find multiple peaks in a landscape. The paper concludes with a discussion of an investigation of bacteria that had both quorum sensing and tactic capabilities.
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
Authors: Chuang Liu, Lingyun Yang, Ian Foster
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous satisfaction of arithmetic constraints on three or more attributes from different relations, and thus often involve expensive multi-join operations. Building on techniques from constraint programming, we develop preprocessing methods, algorithms, and a new constrained join operator that allow ACMA queries to be evaluated efficiently within a conventional relational database engine. We present the results of a careful performance evaluation of both our new approach and the conventional nested-loop join algorithm. Measurements of tuples read, intermediate tuples generated, and execution time shows that our approach achieves superior performance for ACMA joins.
The Algorithm of Iris Image Preprocessing
Authors: Pan Lili, Xie Mei
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Iris image preprocessing, including iris localization and iris image quality evaluation, is the key step in iris recognition and has a close relationship to the accuracy of matching. So far, there are many iris localization algorithms having been proposed. In this paper, we propose a new iris localization algorithm, in which we adopt edge points detecting and curve fitting. After this, we set an integral iris image quality evaluation system that is necessary in the automatic iris recognition system. All the procedures of the algorithm are proved to be valid through our experiment on 2400 iris images from CASIA (The Institute of Automation, Chinese Academy of Sciences) database.
From physics to sound: Comments on van den Doel, ICAD 2004
Authors: Kees van den Doel
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Wherever we are, what we hear is mostly noise. When we ignore it, it disturbs us. When we listen to it, we find it fascinating. The sound of a truck at 50 mph. Static between the stations. Rain. We want to capture and control these sounds, to use them, not as sound effects, but as musical instruments.---John Cage on the future of music---from a lecture given in 1937