ppxscal/embedding_network huggingface dataset:
A linear-time algorithm for computing collision-free path on reconfigurable mesh
Authors: Dajin Wang
Venue: Parallel Computing (2008)

The reconfigurable mesh (RMESH) is an array of mesh-connected processors equipped with a reconfigurable bus system, which can dynamically connect the processors in various patterns. A 2D reconfigurable mesh can be used to solve motion planning problems in robotics research, in which the 2D image of robot and obstacles are digitized and represented one pixel per processor. In this paper, we present an algorithm to compute a collision-free path between two points in an environment containing obstacles. The time complexity of the algorithm is O(k) for each pair of source/destination points, with O(log^2N) preprocessing time, where k is the number of obstacles in the working environment, and N is the size of the reconfigurable mesh.
Syntactic Validation of Web Services Security Policies
Authors: Yuichi Nakamura, Fumiko Sato, Hyen-Vui Chung
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

The Service-Oriented Architecture (SOA) makes application development flexible in such a way that services are composed in a highly distributed manner. However, because of the flexibility, it is often hard for users to define application configurations properly. Regarding the security concerns we address in this paper, though WS-SecurityPolicy provides a standard way to describe security policies, it is difficult for users to make sure that the defined policies are valid. In this paper, we discuss the validation of WS-SecurityPolicy in the context of Service Component Architecture, and propose a method called syntactic validation. Most enterprises have security guidelines, some of which can be described in the format of Web services security messages. There also exist standard profiles for Web services such as the WS-I Basic Security Profile that also prescribes message formats. Since those guidelines and profiles are based on accepted best practices, the syntactic validation is sufficiently effective for practical use to prevent security vulnerabilities.
Finding Answers Using Resources in the Internet
Authors: Mirna Adriani, Septian Adiwibowo
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

In this paper we describe our experiments in finding answers from documents based on statistical and linguistic knowledge. We collected the candidate answers from sources available on the internet, and then we used them to validate the answers found in the documents. The candidate answers from the documents were found using a statistical technique and linguistic knowledge such as named entity tags to find the type of answer that matches the question category.
Managing Uncertainty in ERP Project Estimation Practice: An Industrial Case Study
Authors: Maya Daneva
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Uncertainty is a crucial element in managing projects. This paper's aim is to shed some light into the issue of uncertain context factors when estimating the effort needed for implementing enterprise resource planning (ERP) projects. We outline a solution approach to this issue. It complementarily deploys three techniques to allow a tradeoff between ERP projects requiring more effort than expected and those requiring less. We present the results of a case study carried out in a telecommunication company site.
Performance Test Design Process and Its Implementation Patterns for Multi-services Systems
Authors: George Din, Ina Schieferdecker, Razvan Petre
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

Over the past years, the scope of telecommunication services has increased dramatically making network infrastructure-related services a very competitive market. Additionally, the traditional telecoms are combined with Internet technologies for providing a larger range of services. The obvious outcome is the increase of the number of subscribers and services demand. Due to this complexity, the performance testing of continuously evolving telecommunication services has become a real challenge and requires efficient and more powerful testing solutions. This ability highly depends on the performance test design and on the efficient use of hardware resources for test execution.This paper proposes a performance testing methodology which copes with the characteristics mentioned above. The methodology consists of a set of methods and patterns, exemplified for the TTCN-3 language, to realize adequate performance tests for multi-service systems. The effectiveness of this methodology is demonstrated throughout a case study on IP Multimedia Subsystem (IMS) performance testing.
Placement of Sound Sources in the Stereo Field Using Measured Room Impulse Responses
Authors: William D. Haines, Jesse R. Vernon, Roger B. Dannenberg, Peter F. Driessen
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Reverberation can be simulated by convolving dry instrument signals with physically measured impulse response data. Such reverberation effects have recently become commonplace; however, current techniques apply a single effect to an entire ensemble, and then separate individual instruments in the stereo field via panning. By measuring impulse response data from each desired instrument location, it is possible to place instruments in the stereo field using their unique early reflection and reverberation patterns without panning. A pilot study compares the perceived quality of dry signals convolved to stereo center, convolved to stereo center and panned to desired placement, and convolved with measured impulse responses to simulate placement. The results of a single blind study show a preference for location-based (as opposed to panning-based) reverberation effects.
Towards the Specification of an ECA with Variants of Gestures
Authors: Nicolas Ech Chafai, Catherine Pelachaud, Danielle Pelé
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

The animation of an ECA, for most of animation systems, implies that its behaviour is encoded in a representation language, giving a form for each modality of a behavior. Interested in gestures, several representation languages exist already that that usually give a physical description of the necessary information for the production and reproduction of gestures, and for its synchronization with the other modalities. In our work, we aim at enriching the SAIBA description of gestures with semantic considerations, enabling an ECA to use a gesture for a wide range of applications.
A Clustered Dwarf Structure to Speed Up Queries on Data Cubes
Authors: Fangling Leng, Yubin Bao, Daling Wang, Ge Yu
Venue: Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery (2007)

Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. So we propose two novel clustering methods for query optimization: the recursion clustering method for point queries and the hierarchical clustering method for range queries. To facilitate the implementation, we design a partition strategy and a logical clustering mechanism. Experimental results show our methods can effectively improve the query performance on data cubes, and the recursion clustering method is suitable for both point queries and range queries.
Incremental Hashing for Spin
Authors: Viet Yen Nguyen, Theo C. Ruys
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

This paper discusses a generalised incremental hashing scheme for explicit state model checkers. The hashing scheme has been implemented into the model checker Spin. The incremental hashing scheme works for Spin's exhaustive and both approximate verification modes: bitstate hashing and hash compaction. An implementation is provided for 32-bit and 64-bit architectures.We performed extensive experiments on the BEEM benchmarks to compare the incremental hash functions against Spin's traditional hash functions. In almost all cases, incremental hashing is faster than traditional hashing. The amount of performance gain depends on several factors, though.We conclude that incremental hashing performs best for the (64-bits) Spin's bitstate hashing mode, on models with large state vectors, and using a verifier, that is optimised by the C compiler.
Diffusion of E-Government Innovations in the Dutch Public Sector: The Case of Digital Community Policing
Authors: Evelien Korteland, Victor Bekkers
Venue: Proceedings of the 6th International conference on Electronic Government (2007)

This article examines the diffusion of an e-government innovation --- called SMS-alert --- among Dutch police forces. A conceptual framework for the diffusion of e-government innovations in the public sector is developed which combines a functional and a constructivist (or cultural) approach of diffusion. The framework focuses on diffusion as a mutual process of communication, learning and sense making. Based on this framework and by using data from documentation, websites and interviews, the process of diffusion and adoption of SMS-alert is reconstructed and the factors and mechanisms explaining this process are identified. The case study demonstrates that although SMS-alert has diffused rather rapidly until now, the diffusion process is currently facing some difficulties, mainly due to the existence of competing innovations. By demonstrating the importance of both the functional, political and institutional meaning of the innovation, the article confirms the value of combining different approaches in studying the diffusion of e-government innovations.
Intelligent Assistive Technology: The Present and the Future
Authors: Martha E. Pollack
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Recent advances in two areas of computer science--wireless sensor networks and AI inference strategies--have made it possible to envision a wide range of technologies that can improve the lives of people with physical, cognitive, and/or psycho-social impairments. To be effective, these systems must perform extensive user modeling in order to adapt to the changing needs and capabilities of their users. This invited talk provides a survey of current projects aimed at the development of intelligent assistive technology and describes further design challenges and opportunities.
Efficient Data Distribution for DWS
Authors: Raquel Almeida, Jorge Vieira, Marco Vieira, Henrique Madeira, Jorge Bernardino
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distributed by an arbitrary number of low-cost computers and the queries are executed in parallel by all the computers, guarantying a nearly optimal speed up and scale up. Data loading in data warehouses is typically a heavy process that gets even more complex when considering distributed environments. Data partitioning brings the need for new loading algorithms that conciliate a balanced distribution of data among nodes with an efficient data allocation (vital to achieve low and uniform response times and, consequently, high performance during the execution of queries). This paper evaluates several alternative algorithms and proposes a generic approach for the evaluation of data distribution algorithms in the context of DWS. The experimental results show that the effective loading of the nodes in a DWS system must consider complementary effects, minimizing the number of distinct keys of any large dimension in the fact tables in each node, as well as splitting correlated rows among the nodes.
The LIMSI RT07 Lecture Transcription System
Authors: L. Lamel, E. Bilinski, J. L. Gauvain, G. Adda, C. Barras, X. Zhu
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

A system to automatically transcribe lectures and presentations has been developed in the context of the FP6 Integrated Project Chil. In addition to the seminar data recorded by the Chil partners, widely available corpora were used to train both the acoustic and language models. Acoustic model training made use of the transcribed portion of the TED corpus of Eurospeech recordings, as well as the ICSI, ISL, and NIST meeting corpora. For language model training, text materials were extracted from a variety of on-line conference proceedings. Experimental results are reported for close-talking and far-field microphones on development and evaluation data.
Functional Identification of Retinal Ganglion Cells Based on Neural Population Responses
Authors: M. P. Bonomini, J. M. Ferrández, E. Fernández
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

The issue of classification has long been a central topic in the analysis of multielectrode data, either for spike sorting or for getting insight into interactions among ensembles of neurons. Related to coding, many multivariate statistical techniques such as linear discriminant analysis (LDA) or artificial neural networks (ANN) have been used for dealing with the classification problem providing very similar performances. This is, there is no method that stands out from others and the right decision about which one to use is mainly depending on the particular cases demands. In this paper, we found groups of rabbit ganglion cells with distinguishable coding performances by means of a simple based on behaviour method. The method consisted of creating population subsets based on the autocorrelograms of the cells and grouping them according to a minimal Euclidian distance. These subpopulations shared functional properties and may be used for functional identification of the subgroups. Information theory (IT) has been used to quantify the coding capability of every subpopulation. It has been described that all cells that belonged to a certain subpopulation showed very small variances in the information they conveyed while these values were significantly different across subpopulations, suggesting that the functional separation worked around the capacity of each cell to code different stimuli. In addition, the overall informational ability of each of the generated subpopulations kept similar. This trend was present for an increasing number of classes until a critical value was reached, proposing a natural value for functional classes.
Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks
Authors: Kristian L. Espensen, Mads K. Kjeldsen, Lars M. Kristensen
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

A mobile ad-hoc network (MANET) is an infrastructureless network established by a set of mobile devices using wireless communication. The Dynamic MANET On-demand (DYMO) protocol is a routing protocol for multi-hop communication in MANETs currently under development by the Internet Engineering Task Force (IETF). This paper presents a Coloured Petri Net (CPN) model of the mandatory parts of the DYMO protocol, and shows how scenario-based state space exploration has been used to validate key properties of the protocol. Our CPN modelling and verification work has spanned two revisions of the DYMO protocol specification and have had direct impact on the most recent version of the protocol specification.
CONTRAPUNCTUS Project: A New Computer Solution for Braille Music Fruition
Authors: Giuseppe Nicotra, Antonio Quatraro
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Braille music syntax is very complex and even "anti-musical" in some aspects. CONTRAPUNCTUS wants to help students approach the world of Braille music syntax gradually, with the help of computer aids.
A Probabilistic Approach for Computing Approximate Iceberg Cubes
Authors: Alfredo Cuzzocrea, Filippo Furfaro, Giuseppe M. Mazzeo
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

An iceberg cube is a refinement of a data cube containing the subset of cells whose measure is larger than a given threshold (iceberg condition). Iceberg cubes are well-established tools supporting fast data analysis, as they filter the information contained in classical data cubes to provide the most relevant pieces of information. Although the problem of efficiently computing iceberg cubes has been widely investigated, this task is intrinsically expensive, due to the large amount of data which must be usually dealt with. Indeed, in several application scenarios, efficiency is so crucial that users would benefit from a fast computation of even incomplete iceberg cubes. In fact, an incomplete iceberg cube could support preliminary data analysis by allowing users to focus their explorations quickly and effectively, thus saving large amounts of computational resources. In this paper, we propose a technique for efficiently computing iceberg cubes, possibly trading off the computational efficiency with the completeness of the result. Specifically, we devise an algorithm which employs a probabilistic framework to prevent cells which are probably irrelevant (i.e., which are unlikely to satisfy the iceberg condition) from being computed. The output of our algorithm is an incomplete iceberg cube, which is efficiently computed and prone to be refined, in the sense that the user can decide to go through the computation of the cells which were estimated irrelevant during the previous invocations of the algorithm.
Modelling Macroscopic Phenomena with Cellular Automata and Parallel Genetic Algorithms: An Application to Lava Flows
Authors: Maria Vittoria Avolio, Donato D'Ambrosio, Salvatore Gregorio, Rocco Rongo, William Spataro, Giuseppe A. Trunfio
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Forecasting through simulations the shape of lava invasions in a real topography represents a challenging problem, especially considering that the phenomenon usually evolves for a long time (e.g. from a few to hundreds of days) and on very large areas. In the latest years, Cellular Automata (CA) have been well recognized as a valid computational approach in lava flow modelling. In this paper we present some significant developments of SCIARA, a family of deterministic CA models of lava flows which are optimized for a specific scenario through the use of a parallel genetic algorithm. Following a calibration-validation approach, the model outcomes are compared with three real events of lava effusion.
A-PARM: Adaptive Division of Sub-cells in the PARM for Efficient Volume Ray Casting
Authors: Sukhyun Lim, Byeong-Seok Shin
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The PARM is a data structure to ensure interactive frame rates on a PC platform for CPU-based volume ray casting. After determining candidate cells that contribute to the final images, it partitions each candidate cell into several sub-cells. Then, it stores trilinearly interpolated scalar value and an index of encoded gradient vector for each sub-cell. Since the information that requires time-consuming computations is already stored in the structure, the rendering time is reduced. However, it requires huge memory space because most precomputed values are loaded in the system memory. We solve it by adaptively dividing candidate cells into different sub-cells. That is, we divide a candidate cell in which the gradient is strictly changed into a large number of sub-cells, and vice versa. By this approach, we acquire moderate images while reducing the memory size.
Data Clustering: 50 Years Beyond K-means
Authors: Anil K. Jain
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

The practice of classifying objects according to perceived similarities is the basis for much of science. Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organisms in to taxonomic ranks: domain, kingdom, phylum, class, etc.). Cluster analysis is the formal study of algorithms and methods for grouping objects according to measured or perceived intrinsic characteristics. Cluster analysis does not use category labels that tag objects with prior identifiers, i.e., class labels. The absence of category information distinguishes cluster analysis (unsupervised learning) from discriminant analysis (supervised learning). The objective of cluster analysis is to simply find a convenient and valid organization of the data, not to establish rules for separating future data into categories.
The Development of the Financial Learning Tool through Business Game
Authors: Yasuo Yamashita, Hiroshi Takahashi, Takao Terano
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Recently financial education has become more important because financial technology is highly developing and financial market is growing in importance. In this research, we apply Business Game method to financial education. Especially we focused on learning of asset allocation. As a result of intensive experiments, we found that (1) players learned not to take excessive risk through business game and (2) they recognize the importance of risk control by our experiments. These findings indicate that our approach is valid for financial education.
Rainbow Numbers for Cycles with Pendant Edges
Authors: Izolda Gorgol
Venue: Graphs and Combinatorics (2008)

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f (n, H) is the maximum number of colors in an edge-coloring of K n with no rainbow copy of H. The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of K n with rb(n, H) number of colors contains a rainbow copy of H. Certainly rb(n, H)&#x00a0;=&#x00a0;f(n, H)&#x00a0;+&#x00a0;1. Anti-Ramsey numbers were introduced by Erd&#x0151;s et al. [4] and studied in numerous papers. We show that $$rb(n, C_k^+) = rb(n, C_k)$$for n &#x2265; k&#x00a0;+&#x00a0;1, where C k + denotes a cycle C k with a pendant edge.
A Novel Omnidirectional Wheel Based on Reuleaux-Triangles
Authors: Jochen Brunhorn, Oliver Tenchio, Raúl Rojas
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

This paper discusses the mechanical design and simulation of a novel omnidirectional wheel based on Reuleaux-triangles. The main feature of our omniwheel is that the point of contact of the wheel with the floor is always kept at the same distance from the center of rotation by mechanical means. This produces smooth translational movement on a flat surface, even when the profile of the complete wheel assembly has gaps between the passive rollers. The grip of the wheel with the floor is also improved. The design described in this paper is ideal for hard surfaces, and can be scaled to fit small or large vehicles. This is the first design for an omnidirectional wheel without circular profile, yet capable of rolling smoothly on a hard surface.