ppxscal/embedding_network huggingface dataset:
A Qualitative Model for Visibility Relations
Authors: Francesco Tarquini, Giorgio Felice, Paolo Fogliaroni, Eliseo Clementini
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

The visibility concept is related to many application fields such as robot navigation, computer graphics and telecommunication systems. In this paper we propose a new qualitative model for visibility relations based on properties of the projective space. Within the model we present a set of seven ternary relations among convex regions. Our model is capable to determine the visibility relation between a primary object A with the respect to a "region of view" C and an obstacle B. We developed the reasoning system, which allows the prediction of ternary relations between specific regions.
Fast and accurate map merging for multi-robot systems
Authors: Stefano Carpin
Venue: Autonomous Robots (2008)

We present a new algorithm for merging occupancy grid maps produced by multiple robots exploring the same environment. The algorithm produces a set of possible transformations needed to merge two maps, i.e translations and rotations. Each transformation is weighted, thus allowing to distinguish uncertain situations, and enabling to track multiple cases when ambiguities arise. Transformations are produced extracting some spectral information from the maps. The approach is deterministic, non-iterative, and fast. The algorithm has been tested on public available datasets, as well as on maps produced by two robots concurrently exploring both indoor and outdoor environments. Throughout the experimental validation stage the technique we propose consistently merged maps exhibiting very different characteristics.
A Random Oracle Does Not Help Extract the Mutual Information
Authors: Andrei Muchnik, Andrei Romashchenko
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Assume a tuple of words $\bar x =\langle x_1,\ldots,x_n\rangle$ has negligible mutual information with another word y. Does this mean that properties of Kolmogorov complexity for $\bar x$ do not change significantly if we relativize them conditional to y ? This question becomes very nontrivial when we try to formalize it. We investigate this question for a very particular kind of properties: we show that a random (conditional to $\bar x$) oracle y cannot help extract the mutual information from x i 's.
Efficient Node Discovery in Mobile Wireless Sensor Networks
Authors: Vladimir Dyo, Cecilia Mascolo
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to just several days, or demands considerable maintenance efforts (e.g., in terms of battery substitution). A large portion of the energy of sensor applications is spent in node discovery as nodes need to periodically advertise their presence and be awake to discover other nodes for data exchange. The optimization of energy consumption, which is generally a hard task in fixed sensor networks, is even harder in mobile sensor networks, where the neighbouring nodes change over time.In this paper we propose an algorithm for energy efficient node discovery in sparsely connected mobile wireless sensor networks. The work takes advantage of the fact that nodes have temporal patterns of encounters and exploits these patterns to drive the duty cycling. Duty cycling is seen as a sampling process and is formulated as an optimization problem. We have used reinforcement learning techniques to detect and dynamically change the times at which a node should be awake as it is likely to encounter other nodes. We have evaluated our work using real human mobility traces, and the paper presents the performance of the protocol in this context.
The Development of a Universal Design Tactile Graphics Production System BPLOT2
Authors: Mamoru Fujiyoshi, Akio Fujiyoshi, Nobuyuki Ohtake, Katsuhito Yamaguchi, Yoshinori Teshima
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

We introduce a new universal design tactile graphics production system: BPLOT2. With BPLOT2, blind persons and sighted persons can share resources and cooperatively draw tactile graphics to be utilized in braille textbooks and teaching materials. Present tactile graphics design applications have only GUI (Graphical User Interface) with the need for mouse operations and thus are not usable by blind persons. Equally inconvenient, our self-supporting tactile graphics production system for the blind, BPLOT, has only CUI (Character User Interface), so BPLOT is not popular among the sighted. Therefore, we implemented GUI on BPLOT and realized universal design on BPLOT2.
Retrieval of Relevant Concepts from a Text Collection
Authors: Henry Anaya-Sánchez, Rafael Berlanga-Llavori, Aurora Pons-Porrata
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

This paper addresses the characterization of a large text collection by introducing a method for retrieving sets of relevant WordNet concepts as descriptors of the collection contents. The method combines models for identifying interesting word co-occurrences with an extension of a word sense disambiguation algorithm in order to retrieve the concepts that better fit in with the collection topics. Multi-word nominal concepts that do not explicitly appear in the texts, can be found among the retrieved concepts. We evaluate our proposal using extensions of recall and precision that are also introduced in this paper.
Incremental Determinization of Finite Automata in Model-Based Diagnosis of Active Systems
Authors: Gianfranco Lamperti, Marina Zanella, Giovanni Chiodi, Lorenzo Chiodi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Generating a deterministic finite automaton (DFA) equivalent to a nondeterministic one (NFA) is traditionally accomplished by subset-construction (SC). This is the right choice in case a single transformation is needed. If, instead, the NFA is repeatedly extended, one transition each time, and the DFA corresponding to each extension is needed in real-time, SC is bound to poor performances. In order to cope with these difficulties, an algorithm called incremental subset-construction (ISC) is proposed, which makes up the new DFA as an extension of the previous DFA, avoiding to start from scratch each time, thereby pursuing computational reuse. Although conceived within the application domain of model-based diagnosis of active systems, the algorithm is general in nature, hence it can be exploited for incremental determinization of any NFA. Massive experimentation indicates that, while comparable in space complexity, incremental determinization of finite automata is, in time, far more efficient than traditional determinization by SC.
Detection of Learning Styles from Learner's Browsing Behavior During E-Learning Activities
Authors: Nabila Bousbia, Jean-Marc Labat, Amar Balla
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

One of the bases of adaptation and learning tracking is the learner's modeling. Research in this field, or more generally in the field of user modeling, was sustained mainly on the detection of features related to the user's knowledge, interests, goals, background, and individual traits [3]. We are interested in this last aspect, in particular the identification of the learning style. In this paper, we propose an approach for the learner's activity perception on an e-learning platform to identify the user's learning styles from observable indicators related to their learning path and interactions.
Functional Verification of Power Gated Designs by Compositional Reasoning
Authors: Cindy Eisner, Amir Nahir, Karen Yorav
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Power gating is a technique for low power design in which whole sections of the chip are powered off when they are not needed, and powered back on when they are. Functional correctness of power gating is usually checked as part of system-level verification, where the most widely used technique is simulation using pseudo-random stimuli. We propose instead to perform a sequential equivalence check between the power gated design and a version of itself in which power gating is disabled. We take a compositional approach that looks for partial equivalence of each unit under a suitable set of assumptions, guaranteed by the neighboring units. We make use of so-called circular reasoning rules to compose the partial equivalences proved on the individual units back into total equivalence on the whole chip.
M-LTW: A fast and efficient intra video codec
Authors: Otoniel M. López, Miguel O. Martínez-Rach, Pablo Piñol, Manuel Perez Malumbres, José Oliver
Venue: Image Communication (2008)

Intra-video coding is a common way to process video material for applications like professional video editing systems, digital cinema, video surveillance applications, multi-spectral satellite imaging, HQ video delivery, etc. Most practical intra-coding systems employ JPEG encoders due to their simplicity, low coding delay and low memory requirements. JPEG2000 is the main candidate to replace JPEG in this kind of application due to its excellent rate/distortion (R/D) performance and high coding flexibility. However, its complexity and computational resource requirements for proper operation could be a limitation for certain applications. In this work, we propose an intra-video codec, M-LTW, which is able to obtain very good R/D performance results, as good as JPEG2000 or H.264 INTRA, with faster processing and lower memory usage.
Leveraging GIS Technologies for Web-Based Smart Places Services
Authors: Cristiano Flora, Christian Prehofer
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

This paper describes our experiences and lessons learnt in building a Geographic Information System (GIS) specifically designed for indoor location-based services within our smart places infrastructure. The proposed system was built by mashing-up commodity Open Source software and novel research prototypes realized within our labs. The overall approach relies on intense usage of standard web technologies and REpresentational State Transfer (REST) APIs as a way of enabling easy mashup of off-the-shelf and proprietary components. The key design and implementation aspects of our solution are described in detail, including a discussion on how we represented and augmented the concept of indoor location within our services. Further, we show how we integrated them with commodity GIS services originally designed for outdoor scenarios.
Connecting Feature Models and AUTOSAR: An Approach Supporting Requirements Engineering in Automotive Industries
Authors: Wolfram Webers, Christer Thörn, Kurt Sandkuhl
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

Due to the AUTOSAR initiative, automotive suppliers as well as their customers and sub-suppliers will in the future face the challenge to exchange AUTOSAR specifications instead of structured documents with arbitrary specification attachments. The consequential main tasks for the suppliers will be to implement model-based representation of artifacts as early as possible in the system development process. Thus, it would be desirable to link strategic elements in the context of product family development and technical aspects concerning model management and representation in AUTOSAR. This paper presents the results of an industrial case study in requirements engineering of software-intensive automotive systems, aiming at a process streamlined to both, the strategic demands of the supplier and the technical demands of AUTOSAR. The main contribution of this paper is the connection of feature models and assets in AUTOSAR descriptions. This paper presents work in progress including the developed concepts and feasibility studies.
Security Management System for Sensor Network
Authors: Shinkyung Lee, Namje Park, Dooho Choi
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Wireless sensor network which has more weak security than general network is not considering management principles although it is used in a various part. This paper is concerned with the security management system for sensor network including security function. We design the sensor network management functions and implement the system to manage the security information for detecting an attack from the illegal sensor node.
A High-Efficiency Super-Resolution Reconstruction Algorithm from Image/Video Sequences
Authors: Chuangbai Xiao, Jing Yu, Yi Xue
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The topic of super-resolution image reconstruction has recently received considerable attention within the research area. Super-resolution image reconstruction methods attempt to create a single high-resolution image from a number of low-resolution images (or a video sequence). The Bayesian maximum a posteriori (MAP) estimation method is widely used for super-resolution image reconstruction. So far, existing super-resolution reconstruction methods are all confronted with the problem of slow convergence and expensive computation. To satisfy the requirement of real-time application, we propose a high-efficiency super-resolution reconstruction algorithm that solves two key bottlenecks in the multi-frame MAP framework. The first breakthrough is to select the Armijo rule to identify the step length instead of the exact line search. The second one is to approximately compute the gradient of the MAP objective function using analytic representation instead of numerical calculation. Experimental results show that the proposed algorithm is applicable to real-time super-resolution reconstruction of low-resolution image sequences.
On Fuzzy Driven Support for SD-Efficient Portfolio Selection
Authors: Włodzimierz Ogryczak, Andrzej Romaszkiewicz
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The stochastic dominance (SD) is based on an axiomatic model of risk-averse preferences and therefore, the SD-efficiency is an important property of selected portfolios. As defined with a continuum of criteria representing some measures of failure in achieving several targets, the SD does not provide us with a simple computational recipe. While limiting to a few selected target values one gets a typical multiple criteria optimization model approximating the corresponding SD approach. Although, it is rather difficult to justify a selection of a few target values, this difficulty can be overcome with the effective use of fuzzy target values. While focusing on the first degree SD and extending the target membership functions to some monotonic utility functions we get the multiple criteria model which preserves the consistency with both the first degree and the second degree SD. Further applying the reference point methodology to the multiple criteria model and taking advantages of fuzzy chance specifications we get the method that allows to model interactively the preferences by fuzzy specification of the desired distribution. The model itself guarantees that every generated solution is efficient according to the SD rules.
Chinese Ancient-Modern Sentence Alignment
Authors: Zhun Lin, Xiaojie Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Bi-text alignment is useful to many Natural Language Processing tasks such as machine translation, bilingual lexicography and word sense disambiguation. Most of previous researches are on different language pairs. This paper presents a diachronic alignment of Ancient and Modern Chinese. Because of the long history of Chinese culture and Chinese writing, lots of Ancient Chinese texts are waiting to be translated into modern Chinese, especially, the comparative study of Ancient and Modern Chinese is a very important way to understand some characteristics in Modern Chinese. After describing some characteristics in Ancient-Modern Chinese bi-texts, we first investigate some statistical properties of Ancient-Modern bi-text corpus, including the correlation test of text lengths between two languages and the distribution test of length ratio data. We then pay more attention to n-m(n>1 or m>1) alignment modes which are prone to mismatch.
Searching for Music Using Natural Language Queries and Relevance Feedback
Authors: Peter Knees, Gerhard Widmer
Venue: Adaptive Multimedial Retrieval: Retrieval, User, and Semantics: 5th International Workshop, AMR 2007, Paris, France, July 5-6, 2007 Revised Selected Papers (2007)

We extend an approach to search inside large-scale music collections by enabling the user to give feedback on the retrieved music pieces. In the original approach, a search engine that can be queried through free-form natural language text is automatically built upon audio-based and Web-based similarity measures. Features for music pieces in the collection are derived automatically by retrieving relevant Web pages via Google queries and using the contents of these pages to construct term vectors. The additional use of information about acoustic similarity allows for reduction of the dimensionality of the vector space and characterization of audio pieces with no associated Web information. With the incorporation of relevance feedback, the retrieval of pieces can be adapted according to the preferences of the user and thus compensate for inadequately represented initial queries. The approach is evaluated on a collection comprising about 12,000 pieces by using semantic tags provided by Audioscrobbler and a user study which also gives further insights into users search behaviors.
Dynamic Test and Evaluating System for Flight Control System
Authors: Wu Xun, Yang Shu-xing, Zhao Lei
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

This paper presents a prospective study of how to evaluate the overall performance of flight control system based on general purpose computer system. By adopting hardware-in-the-loop simulation (HILS), a simulated real working environment was constructed for flight control system, in which test and evaluation can be accomplished. Because of the strict real-time requirement of HILS, how to implement hard real-time capability in general personal computer systems is analysed systematically. For HILS system, simulation algorithms are different from conventional full digital simulation because of real-time restrictions. And the creditability of simulated work environment is determined not only by computing results, but also by the time when each simulation frame finished. So, Real-time simulation algorithms and the creditability validation of HILS systems are emphasized in the paper as well.
Transforming sources to petri nets: a way to analyze execution of parallel programs
Authors: Jean-Baptiste Voron, Fabrice Kordon
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Model checking is a suitable formal technique to analyze parallel programs' execution in an industrial context because automated tools can be designed and operated with very limited knowledge of the underlying techniques. However, the specification must be given using dedicated notations that are not always familiar to engineers (so far, model checking on UML raises complex problems that will not be solved immediately). This paper proposes an approach to perform transformation of source code (C programs) into Petri nets, a suitable specification for model checking. To overcome the complexity of the resulting specification, we focus on specific aspects of the program. So, several transformations can be performed to verify some aspects of the processed programs. Parts of this approach could be reused by intrusion detection systems.
Quality-of-service oriented web service composition algorithm and planning architecture
Authors: Jong Myoung Ko, Chang Ouk Kim, Ick-Hyun Kwon
Venue: Journal of Systems and Software (2008)

In the next few decades, it is expected that web services will proliferate, many web services will offer the same services, and the clients will demand more value added and informative services rather than those offered by single, isolated web services. As the result, the problem of synthesizing web services of high quality will be raised as a prominent issue. The clients will face the trouble of choosing or creating composition plans, among numerous possible plans, that satisfy their quality-of-service (QoS) requirements. Typical QoS properties associated with a web service are the execution cost and time, availability, successful execution rate, reputation, and usage frequency. In engineering perspective, generating the composition plan that fulfills a client's QoS requirement is a time-consuming optimization problem. To resolve the problem in a timely manner, we propose a constraint satisfaction based web service composition algorithm that combines tabu search and simulated annealing meta-heuristics. As an implementation framework of the algorithm, we suggest a QoS-oriented web service composition planning architecture. The architecture maintains expert made composition schemas in a service category and assists the client as pure user to choose the one he/she wants to use. The main modules of the architecture are composition broker and execution plan optimizer. With the aid of the UDDI server, the composition broker discovers candidate outsourced web services for each atomic process of the selected schema and gathers QoS information on the web services. After that, the execution plan optimizer runs the web service composition algorithm in order to generate a QoS-oriented composition plan. The performance of the algorithm was tested in a simulated environment.
A global model for fault tolerance of feedforward neural networks
Authors: Fernando Morgado Dias, Ana Antunes
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

It is commonly assumed that neural networks have a built in fault tolerance property mainly due to their parallel structures. The international community of Neural Networks discussed these properties only until 1994 and afterwards the subject has been mostly ignored. Recently the subject was again brought to discussion due to the possibility of using neural networks in nano-electronic systems where fault tolerance and graceful degradation properties would be very important. In spite of these two periods of work there is still need for a large discussion around the fault model for artificial neural networks that should be used. One of the most used models is based on the stuck at model but applied to the weights. This model does not cover all possible faults and a more general model should be found. The present paper proposes a model for the faults in hardware implementations of feedforward neural networks that is independent of the implementation chosen and covers more faults than all the models proposed before in the literature.