ppxscal/embedding_network huggingface dataset:
Computational Geometry-Based Scale-Space and Modal Image Decomposition
Authors: Anatole Chessel, Bertrand Cinquin, Sabine Bardin, Jean Salamero, Charles Kervrann
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper a framework for defining scale-spaces, based on the computational geometry concepts of ¿-shapes, is proposed. In this approach, objects (curves or surfaces) of increasing convexity are computed by selective sub-sampling, from the original shape to its convex hull. The relationships with the Empirical Mode Decomposition (EMD), the curvature motion-based scale-space and some operators from mathematical morphology, are studied. Finally, we address the problem of additive image/signal decomposition in fluorescence video-microscopy. An image sequence is mainly considered as a collection of 1D temporal signals, each pixel being associated with its temporal intensity variation.
Plenary lecture 1: adaptive tabu search (ATS) and management agent (MA)
Authors: Sarawut Sujitjorn
Venue: Proceedings of the 10th WSEAS international conference on evolutionary computing (2009)

The lecture will cover the tabu search (TS), its generic algorithms, and a brief look at its variations. The adaptive tabu search (ATS) with the following topics will be covered: adaptive mechanisms, algorithms, convergence property, and search performance. After a discussion on parallel taxonomy, the management agent (MA) will be presented. The lecture will cover the MA(ATS), its convergence, and search performance subject to symmetrical and asymmetrical problems. Real-world applications of the algorithms will be discussed.
A novel hybrid approach combining electromagnetism-like method with Solis and Wets local search for continuous optimization problems
Authors: M. Gol Alikhani, N. Javadian, R. Tavakkoli-Moghaddam
Venue: Journal of Global Optimization (2009)

The electromagnetism-like method (EM) is a meta-heuristic algorithm utilizing an attraction-repulsion mechanism to move sample points towards optimality in continuous optimization problems. Traditionally, the EM uses two algorithms known as the original and revised EMs. This paper presents a novel hybrid approach for EM by employing a well-known local search, called Solis and Wets. To show the performance of our proposed hybrid EM, a number of experiments are carried out on a set of well-known test problems and the related results are compared with two forgoing algorithms.
Effect of OCR-errors on the transformation of semi-structured text data into relational database
Authors: Kolyo Z. Onkov
Venue: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data (2009)

Paper guides and reference books in the fields of Pharmacology, Veterinary and Crops Protection are often presented in the form of semi-structured text data. "Key words", for instance, the names of diseases and drugs, and relationships between them are of a great importance for obtaining the useful information -- advice, instructions, etc. The definition of relationships is significant problem when the aim is to transform relatively big amount semi-structured text data into intelligent computer based system. The paper shortly presents the OCR errors detection and correction in the process of transformation of Bulgarian crops protection reference book into relational database. Finally, this solution leads to substantial change in the form of the data presentation and access. This does not change the essence of the data itself.
Hardware support for WCET analysis of hard real-time multicore systems
Authors: Marco Paolieri, Eduardo Quiñones, Francisco J. Cazorla, Guillem Bernat, Mateo Valero
Venue: ACM SIGARCH Computer Architecture News (2009)

The increasing demand for new functionalities in current and future hard real-time embedded systems like automotive, avionics and space industries is driving an increase in the performance required in embedded processors. Multicore processors represent a good design solution for such systems due to their high performance, low cost and power consumption characteristics. However, hard real-time embedded systems require time analyzability and current multicore processors are less analyzable than single-core processors due to the interferences between different tasks when accessing shared hardware resources. In this paper we propose a multicore architecture with shared resources that allows the execution of applications with hard real-time and non hard real-time constraints at the same time, providing time analizability for the hard real-time tasks so that they can meet their deadlines. Moreover our architecture proposal provides high-performance for the non hard real-time tasks.
Calibrating Wireless Sensor Network Simulation Models with Real-World Experiments
Authors: Philipp Hurni, Torsten Braun
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

This paper studies the energy-efficiency and service characteristics of a recently developed energy-efficient MAC protocol for wireless sensor networks in simulation and on a real sensor hardware testbed. This opportunity is seized to illustrate how simulation models can be verified by cross-comparing simulation results with real-world experiment results. The paper demonstrates that by careful calibration of simulation model parameters, the inevitable gap between simulation models and real-world conditions can be reduced. It concludes with guidelines for a methodology for model calibration and validation of sensor network simulation models.
A Dynamic Group Environment for Collaborative Language Learning
Authors: Kamen Kanev, Deborah Turk, Thomas Orr, John Brine
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

In this paper, we introduce a new method for collaborative language learning based on dynamic groups. The method is applicable to classes of all sizes and supports work at the individual, group and class levels. Digitally-enhanced teaching materials with Cluster Pattern Interface (CLUSPI®) direct point-and-click functionality are used to enhance the development of student dialogue, text manipulation and reading comprehension skills. The educational process takes place in a computer-assisted environment, which supports immediate student identification, direct interactions with printed materials and instant access to diverse multimedia content. While this method was developed for English language teaching, it could be feasibly employed for any educational discipline in which students are required to read or interact with printed materials.
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
Authors: Bruno Mermet, Gaële Simon
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model presents many interesting characteristics such as its compositional aspect and the definition of proven proof schemas making the proof mechanism reliable. Being interested in specifying and verifying multiagent systems, we have decided to extend the GDT model for specifying Multiagent systems. The object of this article is to present this extension. So, after a brief description of the initial GDT model, we show how we extend it by introducing the specification of the whole MAS. We also introduce the notions of agent type and agent, and we show how external goals allow to specify collaborative agents and to prove the correctness of their collaboration. These notions are illustrated on a toy example of the litterature.
Spiral Scanning Path Scheme for Laser Rapid Prototyping
Authors: Yongqiang Du, Youguo Li
Venue: Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01 (2009)

The crux for scanning-path scheme is the generating strategy of offset curve on polygon countour in a plane. This paper introduces a sprial scanning-path scheme based on a Voronoi diagram algorithm of Multi-Connected Domain from wavefront-propagation. adopting the same approach and data to solve problems in single-connected and multi-connected domain, the algorithm facilitates the application for engineering.
Undecidability Results for Timed Automata with Silent Transitions
Authors: Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
Venue: Fundamenta Informaticae (2009)

In this work, we study decision problems related to timed automata with silent transitions (TA$_{&epsiv;}$) which strictly extend the expressiveness of timed automata (TA). We first answer negatively a central question raised by the introduction of silent transitions: can we decide whether the language recognized by a TA$_{&epsiv;}$ can be recognized by some TA? Then we establish in the framework of TA$_{&epsiv;}$ some old open conjectures that O. Finkel has recently solved for TA. His proofs follow a generic scheme which relies on the fact that only a finite number of configurations can be reached by a TA while reading a timed word. This property does not hold for TA$_{&epsiv;}$, the proofs in the framework of TA$_{&epsiv;}$ thus require more elaborated arguments. We establish undecidability of complementability, minimization of the number of clocks, and closure under shuffle. We also show these results in the framework of infinite timed languages.
Growth, ambient stability and electrical characterisation of MgO thin films on silicon surfaces
Authors: P. Casey, E. O'Connor, R. Long, B. Brennan, S. A. Krasnikov, D. O'Connell, P. K. Hurley, G. Hughes
Venue: Microelectronic Engineering (2009)

Magnesium oxide (MgO) thin films were deposited onto silicon substrates, from an MgO target, by electron beam evaporation. The ambient stability of the MgO films and the formation of the MgO/Si interface were analysed using standard X-ray photoelectron spectroscopy (XPS) and high resolution synchrotron radiation based photoemission. Ambient exposure of the deposited films results in the growth of magnesium hydroxide and magnesium carbide species which can be desorbed by annealing at 500^oC in an inert atmosphere. Electrical characterisation has been performed on nickel silicide/MgO/Si(100) MOS structures for different dielectric thicknesses. The C-V results show no evidence of a low-k layer at the MgO/Si interface.
Efficient XML usage within wireless sensor networks
Authors: Nils Hoeller, Christoph Reinke, Jana Neumann, Sven Groppe, Daniel Boeckmann, Volker Linnemann
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

Integrating wireless sensor networks in heterogeneous networks is a complex task. A reason is the absence of a standardized data exchange format that is supported in all participating sub networks. XML has evolved to the de facto standard data exchange format between heterogeneous networks and systems. However, XML usage within sensor networks has not been introduced because of the limited hardware resources. In this paper, we introduce XML template objects making XML usage applicable within sensor networks. This new XML data binding technique provides significant high compression results while still allowing dynamic XML processing and XML navigation. This is a step towards more complex but exchangeable data management in sensor networks and the extension of the service-oriented paradigm to sensor network application engineering.
Designing a virtualized testbed for dynamic multimedia service composition
Authors: Sang Woo Han, Namgon Kim, JongWon Kim
Venue: Proceedings of the 4th International Conference on Future Internet Technologies (2009)

Researchers have been proposing new protocols and services to improve performance, reliability, and scalability of the Internet. There have been several testbed platforms to test such protocols and services. In this paper, as an approach to develop a service-oriented Future Internet testbed, we discuss a preliminary design to enable programmable computing/networking and support sustainable experiments that dynamically combine distributed services.
VAST 2007 Contest Data Analysis Using NdCore and REGGAE
Authors: Lynn Schwendiman, Jonathan McLean, Jonathan Larson
Venue: Proceedings of the 2007 IEEE Symposium on Visual Analytics Science and Technology (2007)

ATS Intelligent Discovery analyzed the VAST 2007 contest data set using two of its proprietary applications, NdCore and REGGAE (Relationship Generating Graph Analysis Engine). The paper describes these tools and how they were used to discover the contest's scenarios of wildlife law enforcement, endangered species issues, and ecoterrorism.
Speed and rotor flux estimation of induction machines using a two-stage extended Kalman filter
Authors: Mickaël Hilairet, François Auger, Eric Berthelot
Venue: Automatica (Journal of IFAC) (2009)

This paper presents an effective implementation of an extended Kalman filter used for the estimation of both rotor flux and rotor velocity of an induction motor. An algorithm proposed by Hsieh and Chen in [Hsieh, C.S., & Chen, F.C. (1999). Optimal solution of the two-stage Kalman estimator. IEEE Transactions on automatic control, 44(1), 194-199] for linear parameter estimation is extended to non-linear estimation, where parameters such as the velocity of an induction machine are present in the transition matrix and in the augmented state space. Compared to a straightforward implementation of an extended Kalman filter, our modified optimal two-stage Kalman estimator reduces the number of arithmetic operations by 25%, allowing higher sampling rate or the use of a cheaper microcontroller.
Deep transfer via second-order Markov logic
Authors: Jesse Davis, Pedro Domingos
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Standard inductive learning requires that training and test instances come from the same distribution. Transfer learning seeks to remove this restriction. In shallow transfer, test instances are from the same domain, but have a different distribution. In deep transfer, test instances are from a different domain entirely (i.e., described by different predicates). Humans routinely perform deep transfer, but few learning systems, if any, are capable of it. In this paper we propose an approach based on a form of second-order Markov logic. Our algorithm discovers structural regularities in the source domain in the form of Markov logic formulas with predicate variables, and instantiates these formulas with predicates from the target domain. Using this approach, we have successfully transferred learned knowledge among molecular biology, social network and Web domains. The discovered patterns include broadly useful properties of predicates, like symmetry and transitivity, and relations among predicates, such as various forms of homophily.
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
Authors: Paulo Eustáquio Pinto, Fábio Protti, Jayme Luiz Szwarcfiter
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Even codes are Huffman based codes in which every encoding contains an even number of 1's, thus having the ability of detecting the occurrence of an odd number of 1-bit errors in the message. The motivation for defining such codes comes from a problem posed by Hamming in 1980. Even codes have been studied for the case in which symbols have uniform probabilities. In this work, we consider the general situation of arbitrary probabilities. An exact algorithm for constructing an optimal even code is described with complexity O(n 3), where n is the number of symbols. Further, two heuristics for constructing nearly optimal even codes are presented, both requiring O(n logn) time. The cost of the even code constructed by the second heuristics is at most 16,7% higher than the cost of a Huffman code, for the same probabilities. However, computational experiments suggest that, for practical purposes, this value seems to be better: about 5% or less, for n large enough. This corresponds to the amount of redundancy to be added to the message in order to keep the ability of error detection. Concerning undetected errors, we obtain bounds on the probability of producing k consecutive erroneous symbols, suggesting that such a probability is small for large messages.
An EVALP Based Traffic Simulation System
Authors: Kazumi Nakamatsu, Ryuji Ishikawa, Atsuyuki Suzuki
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

Driving actions of human beings such as putting the brake in order to control the car speed can be regarded to be decided by defeasible deontic reasoning based on environmental information such as the distance between two cars. We formalize such a car driving model in a paraconsistent logic program EVALP(Extended Vector Annotated Logic Program), which can deal with defeasible deontic reasoning. In this paper, we introduce an EVALP defeasible deontic reasoning based car driving model and a traffic simulation system based on the model, which can be implemented in the cell automaton method for traffic simulation.
A Computational Proof of Complexity of Some Restricted Counting Problems
Authors: Jin-Yi Cai, Pinyan Lu, Mingji Xia
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

We explore a computational approach to proving intractability of certain counting problems. More specifically we study the complexity of Holant of 3-regular graphs. These problems include concrete problems such as counting the number of vertex covers or independent sets for 3-regular graphs. The high level principle of our approach is algebraic, which provides sufficient conditions for interpolation to succeed. Another algebraic component is holographic reductions. We then analyze in detail polynomial maps on ¿2 induced by some combinatorial constructions. These maps define sufficiently complicated dynamics of ¿2 that we can only analyze them computationally. We use both numerical computation (as intuitive guidance) and symbolic computation (as proof theoretic verification) to derive that a certain collection of combinatorial constructions, in myriad combinations, fulfills the algebraic requirements of proving #P-hardness. The final result is a dichotomy theorem for a class of counting problems.
Routing in heterogeneous wireless ad hoc networks
Authors: John R. Williams, Daniel W. Engels
Venue:  (2008)

Wireless ad hoc networks are used in several applications ranging from infrastructure monitoring to providing Internet connectivity to remote locations. A common assumption about these networks is that the devices that form the network are homogeneous in their capabilities. However in reality, the networks can be heterogeneous in the capabilities of the devices. The main contribution of this thesis is the identification of issues for efficient communication in heterogeneous networks and the proposed solutions to these issues. The first part of the thesis deals with the issues of unambiguous classification of devices and device identification in ad hoc networks. A taxonomical approach is developed, which allows devices with wide range of capabilities to be classified on the basis of their functionality. Once classified, devices are characterized on the basis of different attributes. An IPv6 identification scheme and two routing services based on this scheme that allow object-object communication are developed. The identification scheme is extended to a multi-addressing scheme for wireless ad hoc networks. These two issues and the developed solutions are applicable to a broad range of heterogeneous networks. The second part of the thesis deals with heterogeneous networks consisting of omnidirectional and directional antennas. A new MAC protocol for directional antennas, request-to-pause-directional-MAC (RTP-DMAC) protocol is developed that solves the deafness issue, which is common in networks with directional antennas. Three new routing metrics, which are extensions to the expected number of transmissions (ETX) metric are developed. The first metric, ETX1, reduces the route length by increasing the transmission power. The routing and MAC layers assume the presence of bidirectional links for their proper operation. However networks with omnidirectional and directional antennas have unidirectional links. The other two metrics, unidirectional-ETX (U-ETX) and unidirectional-ETX1 (U-ETX1), increase the transmission power of the directional nodes so that the unidirectional links appear as bidirectional links at the MAC and the routing layers. The performance of these metrics in different scenarios is evaluated. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Learning complex motions by sequencing simpler motion templates
Authors: Gerhard Neumann, Wolfgang Maass, Jan Peters
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Abstraction of complex, longer motor tasks into simpler elemental movements enables humans and animals to exhibit motor skills which have not yet been matched by robots. Humans intuitively decompose complex motions into smaller, simpler segments. For example when describing simple movements like drawing a triangle with a pen, we can easily name the basic steps of this movement. Surprisingly, such abstractions have rarely been used in artificial motor skill learning algorithms. These algorithms typically choose a new action (such as a torque or a force) at a very fast time-scale. As a result, both policy and temporal credit assignment problem become unnecessarily complex - often beyond the reach of current machine learning methods. We introduce a new framework for temporal abstractions in reinforcement learning (RL), i.e. RL with motion templates. We present a new algorithm for this framework which can learn high-quality policies by making only few abstract decisions.
Effect of Metacognitive Support on Student Behaviors in Learning by Teaching Environments
Authors: Jason Tan, John Wagster, Yanna Wu, Gautam Biswas
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

We have developed environments that use teaching as a metacognitive, reflective, and iterative process to help middle school students learn about complex processes. We demonstrate that metacognition and self-regulation are crucial in developing effective learners and preparing them for future learning tasks. As evidence, we discuss the impact of metacognitive support on students' learning performance and behavior patterns that promote better learning through self-monitoring.
Denial of service vulnerabilities in the 802.16 protocol
Authors: Siddharth Maru, Timothy X Brown
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

This paper examines the denial of service attacks that an 802.16 Broadband Wireless Access network is susceptible to at the physical and medium access control layers. In our threat model, we assume that the attacker is external to the network i.e. the attacker cannot associate with the network and send packets as a participant; nor can the attacker decrypt encrypted data. However, the attacker is able to analyze the unencrypted parts of the management traffic and observe the timing, size and source of traffic. Further, the attacker can send jamming signals that disrupt a specific packet and cause its contents to be discarded. In this scenario we analyze the vulnerabilities. We find that the attacker can prevent or hinder communication with little effort by disrupting certain important control packets. We detail these attacks and their effects. This analysis also suggests the mitigation techniques to be employed to reduce or eliminate such attacks.