ppxscal/embedding_network huggingface dataset:
Towards a computational model of Acoustic Packaging
Authors: Lars Schillingmann, Britta Wrede, Katharina Rohlfing
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

In order to learn and interact with humans, robots need understand actions and make use of language in social interactions. The use of language for the learning of actions has been emphasized by Hirsh-Pasek & Golinkoff introducing the idea of Acoustic Packaging [1]. Accordingly, it has been suggested that acoustic information, typically in the form of narration, overlaps with action sequences and provides infants with a bottom-up guide to attend to relevant events and to find structure within them. Following the promising results achieved by Brand & Tapscott for infants who packaged sequences together when acoustic narration was provided, in this paper, we make the first approach towards a computational model of the multimodal interplay of action and language in tutoring situations. For our purpose, we understand events as temporal intervals, which have to be segmented in both the visual and the acoustic signal in order to perform Acoustic Packaging. For the visual modality, we looked at the amount of motion over time via a motion history image based approach. The visual signal is segmented by detecting local minima in the amount of motion. For the acoustic modality, we used a phoneme recognizer, which currently segments the acoustic signal into speech and non-speech intervals. Our Acoustic Packaging algorithm merges the segments from both modalities based on temporal synchrony. First evaluation results show that Acoustic Packaging can provide a meaningful segmentation of tutoring behavior.
Availability of Data in Locality-Aware Unreliable Networks
Authors: Joanna Geibig
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

The goal of our research is to improve data availability in large-scale wireless networks in a disaster scenario, where spatially correlated group of nodes may fail. In this paper, we analytically evaluate the efficacy of existing replication schemes from structured overlay networks under relaxed system constraints. The analysis shows that these schemes do not guarantee data survivability under the assumption of massive node crashes.
A Computational Discriminability Analysis on Twin Fingerprints
Authors: Yu Liu, Sargur N. Srihari
Venue: Proceedings of the 3rd International Workshop on Computational Forensics (2009)

Sharing similar genetic traits makes the investigation of twins an important study in forensics and biometrics. Fingerprints are one of the most commonly found types of forensic evidence. The similarity between twins' prints is critical establish to the reliability of fingerprint identification. We present a quantitative analysis of the discriminability of twin fingerprints on a new data set (227 pairs of identical twins and fraternal twins) recently collected from a twin population using both level 1 and level 2 features. Although the patterns of minutiae among twins are more similar than in the general population, the similarity of fingerprints of twins is significantly different from that between genuine prints of the same finger. Twins fingerprints are discriminable with a 1.5%~1.7% higher EER than non-twins. And identical twins can be distinguished by examine fingerprint with a slightly higher error rate than fraternal twins.
A Parallel Point Matching Algorithm for Landmark Based Image Registration Using Multicore Platform
Authors: Lin Yang, Leiguang Gong, Hong Zhang, John L. Nosher, David J. Foran
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive process. Some point matching related applications, such as medical image registration, require real time or near real time performance if applied to critical clinical applications like image assisted surgery. In this paper, we report a new multicore platform based parallel algorithm for fast point matching in the context of landmark based medical image registration. We introduced a non-regular data partition algorithm which utilizes the K-means clustering algorithm to group the landmarks based on the number of available processing cores, which optimize the memory usage and data transfer. We have tested our method using the IBM Cell Broadband Engine (Cell/B.E.) platform. The results demonstrated a significant speed up over its sequential implementation. The proposed data partition and parallelization algorithm, though tested only on one multicore platform, is generic by its design. Therefore the parallel algorithm can be extended to other computing platforms, as well as other point matching related applications.
Palmprint Verification Based on Specific-user
Authors: Ning Du, Miao Qi, Yinan Zhang, Jun Kong
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

At present, the biometric verification methods have attracted more and more the attention of researchers, and palm print verification as an important method, with its stable and rich features, has been widely used and highly development prospects. However,in feature extraction stage, traditional Gabor often uses fixed parameters to extract feature of all samples, which is not only a waste of a great deal of time, but also will produce redundancy features, then impact the performance of real-time. We propose a novel palmprint verification approach for palmprint recognition. In feature extraction stage, specific-user is proposed, which extracts the feature of palmprint of each individual, to find the optimal parameters by Genetic Algorithm. In experiments, the PolyU database is used to test the performance of proposed approach and the experimental results demonstrate the approach is feasible and has good recognition effect.
Data Currency in Replicated Distributed Storage System
Authors: Bingheng Yan, Depei Qian, Yuanqiang Huang
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Application-level storage aggregation provides a massive storage capacity with high scalability and low cost. However, these systems usually only support their special sites, which ignores the legacy storage systems. So we developed a distributed storage system to aggregate these popular storages and provide a uniform access and management interface for these sites. To ensure high data availability, our distributed storage system utilizes a sophisticated way known as data replication. In this paper, we present the data currency scenario employed in our distributed storage system, which can be also used in other replicated distributed storage systems. We propose a Replica Access Service (RAS) to deal with data availability and efficient retrieval of current replicas based on version controlling, which can balance the data accessibility and replica consistency. We validate our solution's performance and scalability through simulation up to 10,000 distributed sites. The simulation results show that our algorithm used in RAS achieves major performance gains, in terms of response time, compared with a baseline algorithm.
Music-Making and Musical Comprehension with Robotic Building Blocks
Authors: Niels Kristian Bærendsen, Carsten Jessen, Jacob Nielsen
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Being able to express oneself musically and experiment with music composition is traditionally determined by one's ability to play an actual instrument with a certain degree of craftsmanship. Lack of skills may cause difficulties for children and young people to experience the joy of musical creativity. This paper presents a project where modular robotics is used to create a platform for creative musical expression that allows users to experiment with musical genres without any prior musical knowledge or skills. The project is an example of how to create "intelligent learning material" for educational use.
Effect of Aircraft Datablock Complexity and Exposure Time on Performance of Change Detection Task
Authors: Chen Ling, Lesheng Hua
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Air traffic controllers constantly perform tasks of monitoring traffic situation and searching for conflict between aircrafts. One requirement for these tasks is being able to detect any changes in the aircraft status presented by aircraft datablock. In this study, we investigated the effects of aircraft datablock complexity and exposure time on the change detection task performance. Two types of datablock, six field datablock (6F-DB) and nine field datablock (9F-DB), were artificially designed. Ten participants learned the change detection taskwith aircraft datablocks for four days. Our results showed that datablock complexity and exposure time in the change detection task had direct impacts on task performance. In particular, participants had higher detection accuracy with the less complex 6F-DB than the more complex 9F-DB. The longer DB exposure time of 1 second and 3 second also led to higher detection accuracy than 0.5 second. The pattern fields in the datablock were associated with better detection performance than the alphanumeric fields. To optimize the performance of change detection task in air traffic control system, we need to consider both factors of datablock complexity and exposure time. For the more complex datablock, longer exposure time should be provided.
DSybil: Optimal Sybil-Resistance for Recommendation Systems
Authors: Haifeng Yu, Chenwei Shi, Michael Kaminsky, Phillip B. Gibbons, Feng Xiao
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

Recommendation systems can be attacked in various ways, and the ultimate attack form is reached with a {\em sybil attack}, where the attacker creates a potentially unlimited number of {\em sybil identities} to vote. Defending against sybil attacks is often quite challenging, and the nature of recommendation systems makes it even harder. This paper presents {\em DSybil}, a novel defense for diminishing the influence of sybil identities in recommendation systems. DSybil provides strong provable guarantees that hold even under the worst-case attack and are optimal. DSybil can defend against an unlimited number of sybil identities over time. DSybil achieves its strong guarantees by i) exploiting the heavy-tail distribution of the typical voting behavior of the honest identities, and ii) carefully identifying whether the system is already getting ``enough help'' from the (weighted) voters already taken into account or whether more ``help'' is needed. Our evaluation shows that DSybil would continue to provide high-quality recommendations even when a million-node botnet uses an optimal strategy to launch a sybil attack.
The Influence of Shared-Representation on Shared Mental Models in Virtual Teams
Authors: Rose Saikayasit, Sarah Sharples
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

This paper reports a laboratory experiment investigating the influence and effects of shared-representation facilities on collaboration and shared mental models development in virtual teams. The experiment has two experimental conditions; with or without shared-representation facilities. Participants were asked to work in pairs on a `house hunting' scenario. The results showed no significant difference in the overall performance between the two conditions, however shared mental models development was significantly higher where partners were able to use shared-representation facilities.
Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
Authors: Roberto Sebastiani, Michele Vescovi
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

The recent quest for tractable logic-based languages arising from the field of bio-medical ontologies has raised a lot of attention on lightweight (i.e. less expressive but tractable) description logics, like $\mathcal{EL}$ and its family. To this extent, automated reasoning techniques in these logics have been developed for computing not only concept subsumptions, but also to pinpoint the set of axioms causing each subsumption. In this paper we build on previous work from the literature and we propose and investigate a simple and novel approach for axiom pinpointing for the logic $\mathcal{EL^{+}}$. The idea is to encode the classification of an ontology into a Horn propositional formula, and to exploit the power of Boolean Constraint Propagation and Conflict Analysis from modern SAT solvers to compute concept subsumptions and to perform axiom pinpointing. A preliminary empirical evaluation confirms the potential of the approach.
Efficient computations of l1 and l∞ rearrangement distances
Authors: Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
Venue: Theoretical Computer Science (2009)

Recently, a new pattern matching paradigm was proposed, pattern matching with address errors. In this paradigm approximate string matching problems are studied, where the content is unaltered and only the locations of the different entries may change. Specifically, a broad class of problems was defined-the class of rearrangement errors. In this type of error the pattern is transformed through a sequence of rearrangement operations, each with an associated cost. The natural @?"1 and @?"2 rearrangement systems were considered. The best algorithm presented for general patterns, that may have repeating symbols, is O(nm). In this paper, we show that the problem can be approximated in linear time for general patterns! Another natural rearrangement system is considered in this paper-the @?"~ rearrangement distance. For this new rearrangement system efficient exact solutions for different variants of the problem are provided, as well as a faster approximation.
Selfish Neighbor Selection in Peer-to-Peer Backup and Storage Applications
Authors: Pietro Michiardi, Laszlo Toka
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In this work we tackle the problem of on-line backup with a peer-to-peer approach. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an uncoordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as selfish entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratification, that is the emergence of clusters gathering peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the "quality" of local resources they provide to access clusters with lower operational costs. Our results are corroborated by a numerical evaluation of the system that builds upon a polynomial-time best-response algorithm to the selfish neighbor selection game.
Building the Semantic Relations-Based Web Services Registry through Services Mining
Authors: Shizhan Chen, Zhiyong Feng, Hui Wang, Tao Wang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Bridging the gap between service consumer and service provider, Web services registry (WSR) plays an important role in the Web services architecture. But the main obstacle in front of service register is short of adequate knowledge. In this paper, we present an approach that combines social networking and Semantic Web technology with WSR to facilitate the dynamic Web Services Composition (WSC) based on AI reasoning and planning approach. Firstly, we clarify the novel WSR, named Services Network (SN), and present its concepts and components. Secondly, we outline how to build SN through Services Mining and some of the issues that should be considered. Thirdly, we evaluate how this network style registry could facilitate automated WSC. Lastly, a short comprehensive overview of existing related works is also included.
Railway Station Pedestrian Simulation on Fire Smoke Based on Smartfire
Authors: Shu-qing Hao, Hong-wei Huang, Yong Yuan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Fire on railway station is a very important disaster is worth of consideration. When fired, smoke will bring many pollution gases and harmful particles with high temperature. Study the smoke flow phenomenon will provide help for people's lives. In the article, the author use the Smartfire software to simulate the fire on the station, it has provide the critical ventilation velocity that will disturb the fire smoke to flow back and can help people to escape when there is fire also. The result is that when ventilation velocity is 2.5m/s can help people to escape effectively and pollution gases distribution can give management help for people escape.
AMTCLAB: A MATLAB®-based program for traveltime analysis and velocity tuning in 2D elliptical anisotropic media
Authors: J. L. Fernández Martínez, L. M. Pedruelo González, E. García Gonzalo
Venue: Computers Geosciences (2009)

In this paper we present the program AMTCLAB, a MATLAB^(R)-based computer code that analyzes the traveltime distribution and performs quality analysis at the pre-inversion stage for elliptically anisotropic media explored via 2D transmission experiments. This software generalizes the program MTCLAB presented in the past for the case of layered isotropic media, and makes use of traditional and robust traveltime distribution descriptors (mean, standard deviation, median, lower and upper quartiles, inter-quartile range and minimum absolute deviation), which are valid for all kinds of recording geometries. A guided user interface leads the modeller through the algorithm steps using the same data MTCLAB-structures. This methodology offers better understanding of the data variability prior to inversion, and provides the geophysicist with a macroscopic elliptical anisotropic velocity model, which is valid at the experiment scale, and matches the experimental mean traveltime distribution. To solve the inverse problems involved, program AMTCLAB uses the particle swarm optimisation algorithm, which allows the use of different norms and sampling the region of equivalent anisotropic velocity models in order to perform posterior sample statistics in each individual model parameter. The approximated velocity model issued from this analysis can serve in the traveltime inverse problem as an initial guess, or as a reference model in the subsequent inversion.
Scalable Transactions for Web Applications in the Cloud
Authors: Zhou Wei, Guillaume Pierre, Chi-Hung Chi
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Cloud computing platforms provide scalability and high availability properties for web applications but they sacrifice data consistency at the same time. However, many applications cannot afford any data inconsistency. We present a scalable transaction manager for cloud database services to execute ACID transactions of web applications, even in the presence of server failures. We demonstrate the scalability of our system using a prototype implementation, and show that it scales linearly to at least 40 nodes sustaining a maximum throughput of 7286 transactions per second.
Enhancing Collaboration among NASA Engineers through a Knowledge Sharing System
Authors: Daria E. Topousis, Erin K. Means, Keri S. Murphy, Manson Yew
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

Because solar system exploration often involves highly complex missions, a strong infrastructure to support knowledge sharing among engineers is critical to facilitate problem solving and preserve solutions for future work. Any system developed to meet these needs must include the ability to rapidly disseminate content, connect users to the right information regardless of where it is stored, and connect people with the experts and they need. This paper describes the knowledge sharing solution called the NASA Engineering Network, which includes a faceted search, communities of practice, an expertise locator, and a centralized engineering portal. The paper includes details on how the components were developed and provides best practices that other aerospace organizations might use when implementing similar systems.
Learning SAS in the Computer Lab, 3rd edition
Authors: Rebecca J. Elliott, Christopher H. Morrell
Venue: Advanced Cengage Learning (2009)

LEARNING SAS IN THE COMPUTER LAB, 3RD EDITION, gets readers up and running quickly with SAS. Explaining concepts and commands in clear steps, the authors provide SAS basics so students can successfully apply computing techniques in statistics and acquire an appreciation of data analysis. This brief, affordable manual also ensures that readers learn enough about programming with SAS to be able to find their way around the many SAS reference manuals that they will use in their professional activities.
Policy-Based Real-Time Decision-Making for Personalized Service Delivery
Authors: Jochen Bauknecht, Johannes Haussler, Daniel Kraft, Marcus Q. Kuhnen, Mario Lischka, Anett Schulke
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Personalization of service delivery is an important means for the telecommunication industry of keeping their customers in spite of their market becoming more open to other players. Personalization involves using user-specific, dynamic information about communication activities, device capabilities, user context, and service availability for making real-time decisions about handling running sessions according to the user's preferences. This paper proposes a flexible mechanism for making such decisions based on policies, and defines an extension to the XACML 2.0 language which enables it to be used for this purpose.
Bidding Languages and Supplier Selection for Procurement Markets with Economies of Scale and Scope
Authors: Stefan Schneider, Martin Bichler, Kemal Guler, Mehmet Sayal
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Economies of scale and scope describe key characteristics of production cost functions that influence allocations and prices on procurement markets. Combinatorial auctions have been analyzed intensively, and enable the bidders to express economies of scope, but they typically are designed for single units of each item only and cannot easily be extended to the multi-unit case. Auction designs for markets with economies of scale are much less well understood, they require new bidding languages, and the supplier selection typically becomes a hard computational problem. We suggest a bidding language allowing to describe economies of scope and scale. It enables bidders to specify supply curves, representing economies of scale, and variousrebates accounting for economies of scope. In addition, we support a number of side constraints enabling the auctioneer to consider various business rules in the winner determination. We conduct computational experiments based on a branch-and-cut solver to explore the incremental computational burden to determine optimal solutions brought about by the need to express economies of scope for problems of practical size.