ppxscal/embedding_network huggingface dataset:
Recognition of off-line printed Arabic text using Hidden Markov Models
Authors: Husni A. Al-Muhtaseb, Sabri A. Mahmoud, Rami S. Qahwaji
Venue: Signal Processing (2008)

This paper describes a technique for automatic recognition of off-line printed Arabic text using Hidden Markov Models. In this work different sizes of overlapping and non-overlapping hierarchical windows are used to generate 16 features from each vertical sliding strip. Eight different Arabic fonts were used for testing (viz. Arial, Tahoma, Akhbar, Thuluth, Naskh, Simplified Arabic, Andalus, and Traditional Arabic). It was experimentally proven that different fonts have their highest recognition rates at different numbers of states (5 or 7) and codebook sizes (128 or 256). Arabic text is cursive, and each character may have up to four different shapes based on its location in a word. This research work considered each shape as a different class, resulting in a total of 126 classes (compared to 28 Arabic letters). The achieved average recognition rates were between 98.08% and 99.89% for the eight experimental fonts. The main contributions of this work are the novel hierarchical sliding window technique using only 16 features for each sliding window, considering each shape of Arabic characters as a separate class, bypassing the need for segmenting Arabic text, and its applicability to other languages.
A Factored Approach to Subdivision Surfaces
Authors: Joe Warren, Scott Schaefer
Venue: IEEE Computer Graphics and Applications (2004)

Subdivision is a technique for creating smooth shapes using a coarse polygonal model. The authors describe a unified framework for several popular subdivision schemes.
Discovering protocols and organizational structures in workflows
Authors: Chihab Hanachi, Imen Khaloul
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Workflow mining consists in analyzing the execution traces of a collaborative system in order to create a workflow. Most of the works in this area focus on the process discovery from log files, while very few of them address the organization aspect. On the other hand, the Agent technology, suitable for the design and development of cooperative systems, offers interaction languages and high-level protocols allowing the representation of fine-grained organizational structures (hierarchy, federation, coalition, market, among others). In this paper, we show how to enrich log files in order to integrate conversations among the actors of processes using a performative-based agent communication language (FIPA-ACL). This enrichment allows us to define algorithms to discover protocols and organizational structures. The organizational structures are represented by graphs where the nodes are the actors and the arcs relations among them (delegation, cooperation, information exchange, and so on). The interaction protocols (auction, contract net) are described by Petri nets. We provide some discovery algorithms as well as a brief description of a Java implementation coupled with a visualization tool called AGNA.
Modification of Web Content According to the User Requirements
Authors: Pavel Ocenasek
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

The paper deals with the system for modification of web content according to the user requirements. The system is based on the network proxy server. The general idea is to employ translation rules (regular expressions) to render web pages upon user requests stored in profiles. The concept of the proposed proxy is general and the system can be used for various purposes. The main targets of use are: providing secure content of web sites, translation of non-accessible web pages into accessible form, etc.
Exploration methodology of dynamic data structures in multimedia and network applications for embedded platforms
Authors: Lazaros Papadopoulos, Christos Baloukas, Dimitrios Soudris
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

In the last years, there is a trend towards network and multimedia applications to be implemented in portable devices. These applications usually contain complex dynamic data structures. The appropriate selection of the dynamic data type (DDT) combination of an application affects the performance and the energy consumption of the whole system. Thus, DDT exploration methodology is used to perform trade-offs between design factors, such as performance and energy consumption. In this paper we provide a new approach to the DDT exploration procedure, based on a new library of DDTs which remedies the limitations of an existing solution and allows the DDT optimization of a wider range of application domains. Using the new library, we performed DDT exploration in network and multimedia benchmarks and achieved performance and energy consumption improvements up to 22% and 5.8%, respectively.
Capturing, Management and Utilization of Lifecycle Information for Learning Resources
Authors: Lasse Lehmann, Tomas Hildebrandt, Christoph Rensing, Ralf Steinmetz
Venue: Proceedings of the 2nd European conference on Technology Enhanced Learning: Creating New Learning Experiences on a Global Scale (2007)

During their lifecycle, Learning Resources undergo a multitude of processes while being created, used, provided or re-used. However, in order to be reusable, a Learning Resource often has to be adapted to a new context of use. This in turn implies multiple Re-Authoring processes being performed on the Learning Resource. During all these processes different types of information emerge. When captured, this information can be helpful for a later on retrieval, use or re-use of the Learning Resources. In this work, the lifecycle of Learning Resources along with the information being generated herein is analyzed and a distributed architecture is proposed, that allows the capturing, processing, management and utilization of the named information in a generic way.
Time-Dependent SHARC-Routing
Authors: Daniel Delling
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

During the last years, many speed-up techniques for Dijkstra's algorithm have been developed. As a result, computing a shortest path in a static road network is a matter of microseconds. However, only few of those techniques work in time-dependent networks. Unfortunately, such networks appear frequentely in reality: Roads are predictably congestured by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an exact time-dependent speed-up technique based on our recent SHARC-algorithm. As a result, we are able to efficiently compute shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways.
Refining the axiomatic definition of internal software attributes
Authors: Sandro Morasca
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Several internal software attributes, like size, structural complexity, cohesion, coupling, have been introduced and used to reason about software engineering artifacts, and many measures have been proposed for them. Internal software attributes are important because they are believed to be related to quantities of industrial interest, like the number of defects or the development effort. However, the definition of internal software attributes still needs to be made more precise and formal, so measures can be defined that really quantify the attributes they purport to measure. In this paper, we extend, simplify, and refine an existing axiomatic approach that characterizes each internal attribute rigorously via a different set of axioms. This paper makes three specific contributions. First, the new proposal captures a larger set of aspects of software artifacts that may be relevant for internal software attributes than the original proposal did. Second, we identify the basic, foundational sets of axioms for each internal attribute studied, from which the other properties of the attribute can be derived, so the intrinsic properties of the attribute and their implications can be understood. Third, we investigate some relevant relationships among internal software attributes, so their similarities and differences, which are sometimes not well identified, are made more explicit.
Subrecursive Complexity of Identifying the Ramsey Structure of Posets
Authors: Willem L. Fouché
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We show that finite ordinal sums of finite antichains are Ramsey objects in the category of finite posets and height-preserving embeddings. Our proof yields a primitive recursive algorithm for constructing the finite posets which contain the required homogeneities. We also find, in terms of the classical Ramsey numbers, best possible upper bounds for the heights of the posets in which the homogeneous structures can be found.
Towards Automated Robust Vision-Based Surveillance
Authors: Noel E. O'Connor, Marzia Corvaglia
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

COST is one of the longest‐running instruments funded by the EU RTD Framework Program. The members of the COST 292 action (see: http://www.cost292.org/) have a long tradition of involvement in WIAMIS, dating back to the establishment of this event. Since 2005, the action has been invited to organize a special session and this tradition was continued for WIAMIS 2008. This year, the special session focused on a subset of the broad research remit of the action. Specifically, the session targets research in the field of automated visual surveillance. This focus reflects a growing interest within COST 292 participants in this increasingly important area. The goal of this special session is to help bring together researchers working on this topic, both within COST 292 and beyond, with a view to stimulating future collaborative research in this area. The widely circulated call for papers targeted submissions on a broad range of topics covered by the above mentioned focus, including visual computation, event and activity modelingand analysis, multiple stream analysis, architectures, indexing and storage, coding and applications. All papers were peer reviewed by at least three reviewers drawn from a combination of the WIAMIS Technical Program Committee and a special Program Subcommittee set up specifically for this special session. Acceptance criteria considered overall quality as well as relevance to the topics of the special session. In the end, just 5 papers were accepted for oral presentation. The accepted papers address scene modeling, event detection, object recognition (human and non‐human) and fusion of multiple complementary data sources.
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
Authors: Roberto Sebastiani
Venue: Proceedings of the 6th international symposium on Frontiers of Combining Systems (2007)

In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractable problems at the reach of state-of-the-art SAT solvers. Most of this success is motivated by the impressive level of efficiency reached by current implementations of the DPLL procedure. Plain propositional logic, however, is not the only application domain for DPLL. In fact, DPLL has also been successfully used as a boolean-reasoning kernel for automated reasoning tools in much more expressive logics.In this talk I overview a 12-year experience on integrating DPLL with logic-specific decision procedures in various domains. In particular, I present and discuss three main achievements which have been obtained in this context: the DPLL-based procedures for modal and description logics, the lazy approach to Satisfiability Modulo Theories, and Delayed Theory Combination.
Adaptive robust posture control of a parallel manipulator driven by pneumatic muscles
Authors: Xiaocong Zhu, Guoliang Tao, Bin Yao, Jian Cao
Venue: Automatica (Journal of IFAC) (2008)

Rather severe parametric uncertainties and uncertain nonlinearities exist in the dynamic modeling of a parallel manipulator driven by pneumatic muscles. Those uncertainties not only come from the time-varying friction forces and the static force modeling errors of pneumatic muscles but also from the inherent complex nonlinearities and unknown disturbances of the parallel manipulator. In this paper, a discontinuous projection-based adaptive robust control strategy is adopted to compensate for both the parametric uncertainties and uncertain nonlinearities of a three-pneumatic-muscles-driven parallel manipulator to achieve precise posture trajectory tracking control. The resulting controller effectively handles the effects of various parameter variations and the hard-to-model nonlinearities such as the friction forces of the pneumatic muscles. Simulation and experimental results are obtained to illustrate the effectiveness of the proposed adaptive robust controller.
A JPEG Steganalysis Algorithm with Embedded Rate Estimation Based on Multi-class SVM
Authors: Xiaosheng Pan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The purpose of image steganalysis is to find out if the hidden messages exist in images. After differencing DCT coefficients of natural-images and stego-images, their histograms present different laws. This paper regards this as the feature vector to determine if a hiding message is in the image. Through the analysis of former feature vector, the author extracts a new feature to estimate the amount of hidden information in JPEG. The results of the experiments show this approach is effective.
Healthwear: Medical Technology Becomes Wearable
Authors: Alex (Sandy) Pentland
Venue: Computer (2004)

Until recently, researchers have had little success in extending healthcare into the home environment, yet there clearly is a huge demand for this service. Americans currently spend $27 billion on healthcare outside the formal medical establishment, which they find difficult, expensive, and painful to access. A dramatic shift in the composition of the US population makes it absolutely necessary to develop such distributed systems. To address these demands, a research group at the MIT Media Lab has been developing healthwear, wearable systems with sensors that can continuously monitor the user's vital signs, motor activity, social interactions, sleep patterns, and other health indicators. The system's software can use the data from these sensors to build a personalized profile of the user's physical performance and nervous system activation throughout the entire day providing a truly personal medical record that could revolutionize healthcare.
An Integrated Approach for Reconstructing a Surface Model of the Proximal Femur from Sparse Input Data and a Multi-Level Point Distribution Model
Authors: Guoyan Zheng, Miguel A. Ballester
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

In this paper, we present an integrated approach using a multi-level point distribution model (ML-PDM) to reconstruct a patient-specific surface model of the proximal femur from intra-operatively available sparse data, which may consist of sparse point data or a limited number of calibrated fluoroscopic images. We conducted experiments on clinical datasets as well as on datasets from cadaveric bones. Our experimental results demonstrate promising accuracy of the present approach. Further extension to reconstructing a surface model from pre-operative biplanar X-ray radiographs is discussed.
3D Processing and Visualization of Scanned Forensic Data
Authors: Alexander Ehlert, Dirk Bartz
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

A major task in forensic pathology is the documentation of surface injuries. In this contribution, we present a semi-automatic approach for the processing of data from 3D photogrammetry for the visualization of the body surface.
Online Burst Detection Over High Speed Short Text Streams
Authors: Zhijian Yuan, Yan Jia, Shuqiang Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Burst detection is an inherent problem for data streams and it has attracted extensive attention in research community due to its broad applications. In this paper, an integrated approach is introduced to solve burst events detection problem over high speed short text streams. First, we simplify the requirement by considering burst event as a set of burst features, then the processing speed can be accelerated and multiple features can be identified simultaneously. Second, by using the ratio of the number of documents with specific feature and total number of documents during a period of time as the measurement, our solution adapts to any kind of data distribution. Then we propose two algorithms to maintain the ratio in the sliding window. Finally, we propose a burst detection algorithm based on Ratio Aggregation Pyramid (RAP) and Slope Pyramid (SP) data structure, which are extended from Aggregation Pyramid (AP). Our algorithm can detect burst in multiple window sizes simultaneously and is parameter-free. Theoretical analysis and experimental results verify the availability, efficiency and scalability of our method.
On the Timed Automata-Based Verification of Ravenscar Systems
Authors: Iulian Ober, Nicolas Halbwachs
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functional and timing verification using model checking. This paper presents an experiment in translating the Ravenscar fragment of Ada into the input language of a timed model checker (IF [7, 8]), discusses the difficulties and proposes solutions for most constructs supported by the profile. The technique is evaluated in a small case study issued from a space application, on which we present verification results and conclusions.
Transformational design of an interactive component straddling communication streams
Authors: Walter Dosch
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The paper presents the transformational design of a transmission component that straddles an incoming stream of messages such that each two proper messages in the output stream are separated by a specified number of pauses. We refine the communication-oriented input/output behaviour to a state-based implementation exploiting two major transformations. The first transformation refines the component's infinite behaviour to a finite behaviour by imposing a fixed input/output ratio. The second transformation implements the component's finite behaviour by a state transition machine. Here we extract the component's control state and data state from the input history by a history abstraction function. Throughout the paper, we explicate formal methods for the spefication and refinement of interactive components in the setting of stream functions. Altogether, we present a general methodology how to implement a specified infinite input/output behaviour of an interactive component by a state transition machine in a correctness preserving way.
Coordination of AGVs in an industrial environment
Authors: D. Herrero-Perez, H. Martinez-Barbera
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

This demonstration aims to show the decentralized coordination of the navigation system of highly autonomous Automated Guided Vehicles (AGVs) integrated in a real industrial environment. These vehicles are used for goods delivery tasks between different points of the production system. The navigation part consists on calculating and following the trajectory to reach the goal, which is calculated considering the plant layout and recalculated to avoid the non-modeled obstacles when they are sensed during the navigation. The coordination part is based on a decentralized architecture where each vehicle broadcasts the information about its state in the working environment, and by combining all these states in a local way, each AGV decides which action to take.
Reinforcement Learning in Complex Environments Through Multiple Adaptive Partitions
Authors: Andrea Bonarini, Alessandro Lazaric, Marcello Restelli
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its application on a tabular model. In this paper, we describe LEAP (Learning Entities Adaptive Partitioning), a model-free learning algorithm that uses overlapping partitions which are dynamically modified to learn near-optimal policies with a small number of parameters. Starting from a coarse aggregation of the state space, LEAP generates refined partitions whenever it detects an incoherence between the current action values and the actual rewards from the environment. Since in highly stochastic problems the adaptive process can lead to over-refinement, we introduce a mechanism that prunes the macrostates without affecting the learned policy. Through refinement and pruning, LEAP builds a multi-resolution state representation specialized only where it is actually needed. In the last section, we present some experimental evaluation on a grid world and a complex simulated robotic soccer task.
A simulation model of DYMO for ad hoc routing in OMNeT++
Authors: Christoph Sommer, Isabel Dietrich, Falko Dressler
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Mobile Ad Hoc Networks (MANETs) have evolved in the last years into standards in the communication world. By definition, they do not need any network infrastructure to facilitate communication between participating nodes. Therefore, they are dealing with new challenges in the context of ad hoc routing. In this paper, we present our new implementation of the ad hoc routing protocol Dynamic MANET On Demand (DYMO) for the popular discrete event simulation environment OMNeT++. DYMO offers adaptation to changing network topology and determines unicast routes between nodes within the network on demand. Based on the developed model, we performed several simulation experiments to analyze the performance of DYMO with respect to changing network size and traffic conditions. The implementation of DYMO and the results of the simulation experiments are described in this paper.
MASL: A Logic for the Specification of Multiagent Real-Time Systems
Authors: Dmitry Bugaychenko, Igor Soloviev
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

In this paper we present a logic to provide a framework for the formal specification of multiagent real-time systems which allows explicit reasoning about the actions of agents, the nondeterministic model of interaction between agents and environment, the cooperation and competition of agents and the reaction time limits of a system. The logic combines Propositional Dynamic Logic PDL and Alternating-time Temporal Logic ATL and extends the formalism with reaction time constraints. We introduce a multiagent system abstract model and show how the logic can be used to specify the model properties.