ppxscal/embedding_network huggingface dataset:
Proceedings of the 7th ACM SIGPLAN workshop on ERLANG
Venue: Annual ERLANG Workshop (2008)

It is our great pleasure to welcome you to the 7th ACM SIGPLAN Erlang Workshop, Erlang'08. This years workshop continues the tradition of being co-located with the annual International Conference on Functional Programming (ICFP), and being a forum for the presentation of research theory, implementation and applications of the Erlang programming language. The program committee accepted 10 papers that cover a variety of topics, including language aspects, typing, refactoring, testing, high-performance computing and applications. The program committee also invited a keynote presentation on the future of Erlang. We are very grateful to the program committee members, the reviewers, the authors and to the invited speaker, for the time and effort they devoted to provide such a high quality program. The papers were each carefully checked by two reviewers selected from among the most qualified available and then revised once more by the authors. The workshop continues the tradition to include into the program a five minutes talks session to provide opportunities for all participants to introduce themselves and their Erlang interests.
2-Level Hierarchical Cluster-Based Address Auto-configuration Technique in Mobile Ad-Hoc Networks
Authors: Uhjin Joung, Dongkyun Kim
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

In a mobile ad-hoc network (MANET), in order to route a packet between any two nodes, nodes should have their own unique IP address in the network. We introduce an address auto-configuration mechanism that utilizes a clustering technique, called CBA (Cluster-Based Address auto-configuration). Until now, most of existing clustering techniques have been applied to routing protocols. This paper, however, is the first trial that allows address auto-configuration to take advantage of the clustering technique. We propose a novel 2-level hierarchy cluster construction mechanism and present how to utilize clusters for the purpose of efficient address auto-configuration. We evaluate our proposed CBA through NS-2 simulations and prove that CBA is more suitable for a network with a large number of nodes which are joining/leaving at the same time.
Trust-Based Classifier Combination for Network Anomaly Detection
Authors: Martin Rehák, Michal Pěchouček, Martin Grill, Karel Bartos
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

We present a method that improves the results of network intrusion detection by integrating several anomaly detection algorithms through trust and reputation models. Our algorithm is based on existing network behavior analysis approaches that are embodied into several detection agents. We divide the processing into three distinct phases: anomaly detection, trust model update and collective trusting decision. Each of these phases contributes to the reduction of classification error rate, by the aggregation of anomaly values provided by individual algorithms, individual update of each agent's trust model based on distinct traffic representation features (derived from its anomaly detection model), and re-aggregation of the trustfulness data provided by individual agents. The result is a trustfulness score for each network flow, which can be used to guide the manual inspection, thus significantly reducing the amount of traffic to analyze. To evaluate the effectiveness of the method, we present a set of experiments performed on real network data.
Agent-based coordination technologies in disaster management
Authors: Sarvapali D. Ramchurn, Alex Rogers, Kathryn Macarthur, Alessandro Farinelli, Perukrishnen Vytelingum, Ioannis Vetsikas, Nicholas. R. Jennings
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

Multi-agent systems (MAS) have been advocated as the natural solution to real-world problems that necessitate some form of decentralised control within dynamic and uncertain environments. Given this, a number of multi-agent coordination algorithms have been designed, ranging from auctions to coalition formation algorithms. These algorithms allow a number of agents to reconcile their constraints and preferences in order to maximise some global objective. An important domain where such algorithms can be applied is that of emergency response or disaster management.
Ehrhart Series and Lattice Triangulations
Authors: Sam Payne
Venue: Discrete Computational Geometry (2008)

We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and &#x201c;local contributions&#x201d; of the links of its nonunimodular faces. We also compute new examples of nonunimodal h *-vectors of reflexive polytopes.
A camera phone based currency reader for the visually impaired
Authors: Xu Liu
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

In this paper we present a camera phone-based currency reader for the visually impaired that can identify the value of U.S. paper currency. Currently, U.S. paper currency can only be identified visually and this situation will continue for a foreseeable future. Our solution harvests the imaging and computational power on camera phones to read these bills. Considering it is impractical for the visually impaired to capture high quality image, our currency reader performs real time processing for each captured frame as the camera approaches the bill. We developed efficient background subtraction and perspective correction algorithms and trained our currency reader using an efficient Ada-boost framework. Our currency reader processes 10 frames/second and achieves a false positive rate of approximately 1/10000. Major smart phone platforms, including Symbian and Windows Mobile, are supported.
Maximizing the Utility of Situated Public Displays
Authors: Jörg Müller, Antonio Krüger, Tsvi Kuflik
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Situated public displays are intended to convey important information to a large and heterogeneous population. Because of the heterogeneity of the population, they may risk providing a lot of irrelevant information. Many such important information items presented on public displays are actionables, items that are intended to trigger specific actions. The expected utility that such actionables have for a user depend on the value of the action for the user. A goal should be to provide for each user the actionables with highest utility. This can be achieved by adapting the information presentation to the users currently in front of the display. Adaptation can take place either by identifying individual users, by using statistics about the user groups usually in front of the display or by a combination of both. We present a formal framework based on decision theory that enables the integration of sensor data and statistics and allows to choose the optimal actionable to present based on this data.
Jump-diffusion models with constant parameters for financial log-return processes
Authors: Daniel Synowiec
Venue: Computers Mathematics with Applications (2008)

We present five alternative approaches to modelling assets using jump-diffusion processes. Three of them are known in the literature and they give analytical solutions for option pricing problems. We present two further models, which are better motivated by the market and we compare all five models with each other and with the Black-Scholes model. Good criteria of goodness of fit of the model to the data are statistical tests, whose values are also helpful in comparing the models. In this paper, we use Kolmogorov, Anderson-Darling and Cramer-von Mises statistics.
Understanding the Complexity of Induced Subgraph Isomorphisms
Authors: Yijia Chen, Marc Thurley, Mark Weyer
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We study left-hand side restrictions of the induced subgraph isomorphism problem: Fixing a class , for given graphs G and arbitrary H we ask for induced subgraphs of H isomorphic to G.For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau, Kolaitis and Vardi for the decision problem and by Dalmau and Jonsson for its counting variant.We give a dichotomy result for both variants of the induced subgraph isomorphism problem. Under some assumption from parameterized complexity theory, these problems are solvable in polynomial time if and only if contains no arbitrarily large graphs.All classifications are given by means of parameterized complexity. The results are presented for arbitrary structures of bounded arity which implies, for example, analogous results for directed graphs.Furthermore, we show that no such dichotomy is possible in the sense of classical complexity. That is, if there are classes such that the induced subgraph isomorphism problem on is neither in nor -complete. This argument may be of independent interest, because it is applicable to various parameterized problems.
Opportunistic networking in OMNeT++
Authors: Ólafur Ragnar Helgason, Kristján Valur Jónsson
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

We describe mechanisms for simulating opportunistic and delay-tolerant networks in the OMNeT++ discrete event simulator. The mechanisms allow for simulating open systems of wireless mobile nodes where mobility- or contact traces are used to drive the simulations. This way mobility generation is separated from the core OMNeT++ protocol simulations which facilitates importing synthetic or real data from external mobility generators, real mobility tracking data or real contact traces. The paper describes the design and implementation of our mechanisms for OMNeT++ and gives an example of how we have used these to simulate opportunistic wireless content distribution in an urban environment.
Distributed Models and Algorithms for Mobile Robot Systems
Authors: Asaf Efrima, David Peleg
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Systems consisting of a collection of independently operating mobile robots (a.k.a. robot swarms) have recently been studied from a distributed computing point of view. The paper reviews the basic model developed for such systems and some recent algorithmic results on a number of coordination and control tasks for robot swarms. The paper then discusses various possibilities for modifications in the basic model, and examines their effects via the example of the partitioning problem.
AniDiary: Daily Cartoon-Style Diary Exploits Bayesian Networks
Authors: Sung-Bae Cho, Kyung-Joong Kim, Keum Sung Hwang, In-Ji Song
Venue: IEEE Pervasive Computing (2007)

Owing to the advance of ubiquitous computing technology, various information sources make the events of a given user's daily life readily available. Mobile devices such as cell phones, smart phones, and PDAs let users capture rich media with ease and store personal information such as context, schedules, short messages, photos, and videos. We can regard usage information and stored multimedia content as relevant evidence for inferring a given user's daily actions. The AniDiary (Anywhere Diary) system summarizes a given user's daily life with as a cartoon-style diary. Because showing all the events for a day isn't appropriate, landmark (memorable) events are automatically detected by modeling the cause-effect relationships of various events with Bayesian networks. The system then converts the events into cartoon images for a diary. Experimental results on synthetic and real data show that AniDiary provides an efficient, user-friendly way to summarize the user's daily life.
Context-Specific Independence Mixture Modelling for Protein Families
Authors: Benjamin Georgi, Jörg Schultz, Alexander Schliep
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Protein families can be divided into subgroups with functional differences. The analysis of these subgroups and the determination of which residues convey substrate specificity is a central question in the study of these families. We present a clustering procedure using the context-specific independence mixture framework using a Dirichlet mixture prior for simultaneous inference of subgroups and prediction of specificity determining residues based on multiple sequence alignments of protein families. Application of the method on several well studied families revealed a good clustering performance and ample biological support for the predicted positions. The software we developed to carry out this analysis PyMix - the Python mixture package is available from http://www.algorithmics.molgen.mpg.de/pymix.html.
Fusion of Laser Guidance and 3-D Autostereoscopic Image Overlay for Precision-Guided Surgery
Authors: Hongen Liao, Hirotaka Ishihara, Huy Hoang Tran, Ken Masamune, Ichiro Sakuma, Takeyoshi Dohi
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

This paper describes a precision-guided surgical navigation system for minimally invasive surgery using fusion of laser guidance technique and three-dimensional (3-D) autostereoscopic image overlay technique. The images superimposed onto the patient are created by employing an animated autostereoscopic image called integral videography (IV), which display geometrically accurate 3-D autostereoscopic images and reproduce motion parallax without the need for special viewing or tracking devices. To improve the insertion accuracy of surgical instrument, we integrated the image overlay system with laser guidance for visualization of insertion point and orientation of the surgical instrument. We designed and manufactured a laser guidance device and mounted it to the IV image overlay device. Accuracy evaluations showed that the system could guide a linear surgical instrument toward a target with an average error of 2.48 mm and standard deviation of 1.76 mm. Improvement in the design of the laser guidance device and the patient-image registration of the IV image overlay will make this system practical and its use will increase surgical accuracy and reduce invasiveness.
Performance Monitoring and Analysis of a Large Online Transaction Processing System
Authors: Manoj Nambiar, Hemanta Kumar Kalita
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

A large Employee Appraisal System is accessed by clients from different international locations using the Internet. Being a distributed system, it is not easy to monitor and assess performance of such a large online transaction processing (OLTP) system. Performance Monitoring and Analysis of such a system requires pinpointing to the box or link in the system that is responsible for the overall slow performance. In this paper, we elaborate on our approach of performance monitoring and analysis of a large OLTP system using an employee appraisal system as an example.
Evaluation of RDMA Opportunities in an Object-Oriented DSM
Authors: Ronald Veldema, Michael Philippsen
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

Remote Direct Memory Access (RDMA) is a technology to update a remote machine's memory without intervention at the receiver side. We evaluate where RDMA can be usefully applied and where it is a loss in Object-Oriented DSM systems. RDMA is difficult to use in modern OO-DSMs due to their support for large address spaces, advanced protocols, and heterogeneity. First, a communication pattern that is based on objects reduces the applicability of bulk RDMA. Second, large address spaces (meaning far larger than that of a single machine) and large numbers of machines require an address space translation scheme to map an object at different addresses on different machines. Finally, RDMA usage is hard since without polling (which would require source code modifications), incoming RDMA messages are hard to notice on time.Our results show that even with RDMA, update protocols are slower than invalidation protocols. But RDMA can be successfully applied to fetching of objects in an invalidation protocol and improves performance by 20.6%.
Analysis and Prediction of Air Quality Data with the Gamma Classifier
Authors: Cornelio Yáñez-Márquez, Itzamá López-Yáñez, Guadalupe Luz Sáenz Morales
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In later years, different environmental phenomena have attracted the attention of artificial intelligence and machine learning researchers. In particular, several research groups have applied genetic algorithms and artificial neural networks to the analysis of data related to atmospheric and environmental sciences. In the current work, the results of applying the Gamma classifier to the analysis and prediction of air quality data related to the Mexico City Air Quality Metropolitan Index (IMECA in Spanish) are presented.
Extracting the optimal dimensionality for local tensor discriminant analysis
Authors: Feiping Nie, Shiming Xiang, Yangqiu Song, Changshui Zhang
Venue: Pattern Recognition (2009)

Supervised dimensionality reduction with tensor representation has attracted great interest in recent years. It has been successfully applied to problems with tensor data, such as image and video recognition tasks. However, in the tensor-based methods, how to select the suitable dimensions is a very important problem. Since the number of possible dimension combinations exponentially increases with respect to the order of tensor, manually selecting the suitable dimensions becomes an impossible task in the case of high-order tensor. In this paper, we aim at solving this important problem and propose an algorithm to extract the optimal dimensionality for local tensor discriminant analysis. Experimental results on a toy example and real-world data validate the effectiveness of the proposed method.
Color Based Hand and Finger Detection Technology for User Interaction
Authors: Sung Kwan Kang, Mi Young Nam, Phill Kyu Rhee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The aim of this paper is to present the methodology for hand detection and propose the finger detection method. The detected hand and finger can be used to implement the non-contact mouse. This technology can be used to control the home devices such as curtain and television. Skin color is used to segment the hand region from background and counter is extracted from the segmented hand. Analysis of counter gives us the location of finger tip in the hand. We have performed extensive experiment and achieve very encouraging result.
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Authors: Manoj Prabhakaran, Mike Rosulek
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We develop new tools to study the relative complexities of secure multi-party computation tasks in the Universal Composition framework. When one task can be securely realized using another task as a black-box, we interpret this as a qualitative, complexity-theoretic reduction between the two tasks. Virtually all previous characterizations of MPC functionalities, in the UC model or otherwise, focus exclusively on secure function evaluation. In comparison, the tools we develop do not rely on any special internal structure of the functionality, thus applying to functionalities with arbitrary behavior. Our tools additionally apply uniformly to both the PPT and unbounded computation models.Our first main tool is an exact characterization of realizability in the UC framework with respect to a large class of communication channel functionalities. Using this characterization, we can rederive all previously-known impossibility results as immediate and simple corollaries. We also complete the combinatorial characterization of 2-party secure function evaluation initiated by [12] and partially extend the combinatorial conditions to the multi-party setting. Our second main tool allows us to translate complexity separations in simpler MPC settings (such as the honest-but-curious corruption model) to the standard (malicious) setting. Using this tool, we demonstrate the existence of functionalities which are neither realizable nor complete, in the unbounded computation model.
Fast Detection and Modeling of Human-Body Parts from Monocular Video
Authors: Weilun Lao, Jungong Han, Peter H. With
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents a novel and fast scheme to detect different body parts in human motion. Using monocular video sequences, trajectory estimation and body modeling of moving humans are combined in a co-operating processing architecture. More specifically, for every individual person, features of body ratio, silhouette and appearance are integrated into a hybrid model to detect body parts. The conventional assumption of upright body posture is not required. We also present a new algorithm for accurately finding the center point of the human body. The body configuration is finally described by a skeleton model. The feasibility and accuracy of the proposed scheme are analyzed by evaluating its performance for various sequences with different subjects and motion types (walking, pointing, kicking, leaping and falling). Our detection system achieves nearly real-time performance (around 10 frames/second).
Rule-Based Expressive Modifications of Tempo in Polyphonic Audio Recordings
Authors: Marco Fabiani, Anders Friberg
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

This paper describes a few aspects of a system for expressive, rule-based modifications of audio recordings regarding tempo, dynamics and articulation. The input audio signal is first aligned with a score containing extra information on how to modify a performance. The signal is then transformed into the time-frequency domain. Each played tone is identified using partial tracking and the score information. Articulation and dynamics are changed by modifying the length and content of the partial tracks. The focus here is on the tempo modification which is done using a combination of time frequency techniques and phase reconstruction. Preliminary results indicate that the accuracy of the tempo modification is in average 8.2 ms when comparing Inter Onset Intervals in the resulting signal with the desired ones. Possible applications of such a system are in music pedagogy, basic perception research as well as interactive music systems.
Word Segments in Category-Based Language Models for Automatic Speech Recognition
Authors: Raquel Justo, M. Inés Torres
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

The aim of this work is to integrate segments of words into a category-based Language Model. Two proposals of this kind of models are presented. On the other hand an interpolation of a category-based model with a classical word-based Language Model is studied as well. The models were integrated into an ASR system and evaluated in terms of WER. Experiments on a spontaneous dialogue corpus in Spanish are reported. These experiments show that integrating word segments in a category-based Language Model, a better performance of the model can be achieved.