ppxscal/embedding_network huggingface dataset:
Identification by distributions of continuous time systems with nonlinear feedback
Authors: Constantin Marin, Dan Selisteanu, Dorin Sendrescu, Virginia Finca
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This paper presents a procedure for the identification of continuous-time systems with memoryless nonlinear feedback. The feedback nonlinear element, described by a bounded unknown function, is expressed as a linear combination of some base functions. Both the parameters of the feedforward linear system and of the nonlinear element representation are identified. To improve the representation of the nonlinear functions, the set of basis functions is iteratively refined. It is possible to identify the dominant nonlinearities, applying the singular value decomposition to the input matrix. In our approach, the linear dynamic subsystem is described by a transfer function of a given order and the distribution based identification method is applied. The DCNFI (Distribution based of Continuous time Nonlinear Feedback Identification) equation is obtained. The consistency of the identification is analyzed and experimental results are presented.
Holonomy in mobile robots
Authors: J. A. Batlle, A. Barjau
Venue: Robotics and Autonomous Systems (2009)

The search for a simple and accurate odometry is a main concern when working with mobile robots. This article presents a general analysis of the problem and proposes a particular solution to improve the odometry. The three crucial kinematical aspects of mobile robots (mobility, control, and positioning) are reviewed in detail for vehicles based both in conventional and in omnidirectional wheels. The latter case is more suitable from a maneuvering point of view as it provides the robot frame with the three Degrees Of Freedom (DOF) of plane motion without singular configurations. Moreover, a suitable design of the omnidirectional wheels leads to a strictly invariant Jacobian matrix and thus to a linear control equation with constant coefficients. It is shown that such vehicles may have a holonomic behavior when moving under suitable kinematical restrictions without constraining their trajectory. In that case, the odometry is algebraic (instead of integrative) and thus more accurate. An application case is presented.
Stochastic simulation of the chemoton
Authors: Sven Van Segbroeck, Ann Nowé, Tom Lenaerts
Venue: Artificial Life (2009)

Gánti's chemoton model is an illustrious example of a minimal cell model. It is composed of three stoichiometrically coupled autocatalytic subsystems: a metabolism, a template replication process, and a membrane enclosing the other two. Earlier studies on chemoton dynamics yield inconsistent results. Furthermore, they all appealed to deterministic simulations, which do not take into account the stochastic effects induced by small population sizes. We present, for the first time, results of a chemoton simulation in which these stochastic effects have been taken into account. We investigate the dynamics of the system and analyze in depth the mechanisms responsible for the observed behavior. Our results suggest that, in contrast to the most recent study by Munteanu and Solé, the stochastic chemoton reaches a unique stable division time after a short transient phase. We confirm the existence of an optimal template length and show that this is a consequence of the monomer concentration, which depends on the template length and the initiation threshold. Since longer templates imply shorter division times, these results motivate the selective pressure toward longer templates observed in nature.
On Locating Disjoint Segments with Maximum Sum of Densities
Authors: Hsiao-Fei Liu, Kun-Mao Chao
Venue: Algorithmica (2009)

Given a sequence A of n real numbers and two positive integers l and k, where , we study the problem of locating k disjoint segments of A, each of length at least l, such that the sum of their densities is maximized. The best previously known algorithm, due to Bergkvist and Damaschke, runs in O(nl+k 2 l 2) time. In this paper, we propose an O(n+k 2 llog l)-time algorithm for it. We also give an optimal algorithm for a related problem raised by Lin et al. in 2003, where the goal is to locate k disjoint maximum-density segments in a given sequence.
FPS Extensions Modelling ESGs
Authors: John R. Rankin, Sandra Sampayo Vargas
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

In this paper we show that the FPS paradigm has metaphorical correspondences with a low level category of ESGs. Extensions of the FPS paradigm lead to simple concept learning lessons analogous to the needs of teachers for the development of low level ESGs for use in classroom teaching. The main FPS extension discussed in this paper is the FSM module. The teacher is not required to recompile any code but simply to provide the data representing the FSM corresponding to each concept learning lesson in the target ESG. The purpose of this research is not to develop the full ESG but rather to show that the FSM module coupled with other extensions to the FPS game development tools provides a means for building future ESG development tools.
HW/SW methodologies for synchronization in FPGA multiprocessors
Authors: Antonino Tumeo, Christian Pilato, Gianluca Palermo, Fabrizio Ferrandi, Donatella Sciuto
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

odern Field Programmable Gate Arrays (FPGA) can be programmed with multiple soft-core processors. These solutions can be used for MultiProcessor Systems-on-Chip (MPSoCs) prototyping or even for final implementation. Nevertheless, efficient synchronization is required to guarantee performance in multiprocessing environments with the simple cores that do not support atomic instructions and are normally used in the standard FPGA toolchains. In this paper, we introduce two hardware synchronization modules for Xilinx MicroBlaze systems, with local polling or queuing mechanisms for locks and barriers, and present a comparison of these solutions to alternative designs.
Optimal three-dimensional flight control of a supersonic fighter
Authors: Ching-Fang Lin, Khai Li Hsu
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper discusses optimal three-dimensional flight control of a supersonic fighter through an onboard automatic guidance and control system. This system is simulated to check the speed requirements of the algorithms to be solved before being implemented in real hardware. A very-high-speed digital computer is used for this time-critical simulation. In the simulation optimal trajectories are generated in real time, on line. Results obtained from the particular problem of a real-time, online minimum-time supersonic chandelle with prescribed final point are displayed.
Document Forgery Detection with SVM Classifier and Image Quality Measures
Authors: Seung-Jin Ryu, Hae-Yeoun Lee, Il-Weon Cho, Heung-Kyu Lee
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper presents a detection scheme for a fraudulent document made by printers. The fraud document is indistinguishable by the naked eye from a genuine document because of the technological advances in printing methods. Even though we cannot find any visual evidence of forgery, the fraud document includes inherent device features. We propose a method to uncover these features. 17 image quality measures are applied to discriminate between genuine and fake documents. The results of each measure are used as training and testing parameters of SVM classifier to determine fake documents. Preliminary experimental results are presented based on the fraud gift voucher made by several color printers.
Hardware task scheduling and placement in operating systems for dynamically reconfigurable SoC
Authors: Pao-Ann Hsiung, Chun-Hsian Huang, Yuan-Hsiu Chen
Venue: Journal of Embedded Computing (2009)

Existing operating systems can manage the execution of software tasks efficiently, however the manipulation of hardware tasks is very limited. In the research on the design and implementation of an embedded operating system that manages both software and hardware tasks in the same framework, two major issues are the dynamic scheduling and the dynamic placement of hardware tasks into a reconfigurable logic space in an SoC. The distinguishing criteria for good dynamic scheduling and placement methods include the total schedule length and the amount of fragmentation incurred while tasks are dynamically placed and replaced. Existing methods either do not take fragmentation into consideration or postpone the consideration of fragmentation to a later stage of space allocation. In our method, we try to reduce fragmentation during placement itself. The advantage of such an approach is that not only the reconfigurable space is utilized more efficiently, but the total schedule length is also reduced, that is, hardware tasks complete faster. Experimental results on large random tasks sets have shown that the proposed improvement is as much as 23.3% in total fragmentation and 2.0% in total schedule time.
Modeling and simulation of supply network evolution based on complex adaptive system and fitness landscape
Authors: G. Li, P. Ji, L. Y. Sun, W. B. Lee
Venue: Computers and Industrial Engineering (2009)

A supply network (SN) is a complex adaptive system, and its structure and collaboration mechanism evolves over time. However, most literature views SN as a static system and the study on the evolution of SNs is very limited. Based on complex adaptive system and fitness landscape theory, this paper first proposes an evolution model of SNs in order to understand the general principle of SN evolution. Then the paper conducts a multi-agent simulation on the evolution model, and discloses that the SN emerges and evolves from firms' dynamic interaction under the dynamic environment. Dominated by the environment and firms' internal mechanism, the evolution is highly sensitive to the initial condition, and it is path-dependent and difficult to predict precisely. Although the dynamics of environments is different, a SN enjoys the stable structure in different environments. Higher level of structure stability and fitness of the SN are achieved when the firms in the SN adopt the long-term collaboration strategy rather than the short-term strategy. Finally, a China case is explored which validates the self-organization evolution of SNs.
ExternalEyes: evaluating the visual abstraction of human emotion on a public wearable display device
Authors: Noelene Fajardo, Andrew Vande Moere
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This research presents a functional model for a wearable display that describes the typical contextual relationships surrounding its everyday use. Two wearable display devices were developed that sense and visually represent skin conductivity level, as an objective measurement of the physiological arousal in humans. Each device uses a distinct display technique, which varies in the level of comprehensibility and ambiguity it affords to those who view it over a period of time. A short observation and pilot study of usage patterns of each display technique was conducted to assess the qualitative comfort and usability issues of wearable computing displays in everyday environments.
Efficient skyline retrieval with arbitrary similarity measures
Authors: Deepak P, Prasad M Deshpande, Debapriyo Majumdar, Raghu Krishnapuram
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors under consideration. In this paper, we consider the case where the similarity measures may be arbitrary and do not necessarily come from a metric space. We first explore middleware algorithms, analyze how skyline retrieval for non-metric spaces can be done on the middleware backend, and lay down a necessary and sufficient stopping condition for middleware-based skyline algorithms. We develop the Balanced Access Algorithm, which is provably more IO-friendly than the state-of-the-art algorithm for skyline query processing on middleware and show that BAA outperforms the latter by orders of magnitude. We also show that without prior knowledge about data distributions, it is unlikely to have a middleware algorithm that is more IO-friendly than BAA. In fact, we empirically show that BAA is very close to the absolute lower bound of IO costs for middleware algorithms. Further, we explore the non-middleware setting and devise an online algorithm for skyline retrieval which uses a recently proposed value space index over non-metric spaces (AL-Tree [10]). The AL-Tree based algorithm is able to prune subspaces and efficiently maintain candidate sets leading to better performance. We compare our algorithms to existing ones which can work with arbitrary similarity measures and show that our approaches are better in terms of computational and disk access costs leading to significantly better response times.
An intelligent WiMAX mobile network handoff mechanism with GPS consideration
Authors: Wei-Der Hsiao, You-Xing Liu, Han-Chieh Chao
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Presently, the emerging of WiMax wireless broadband wide-area network technology is very important. Because of transmission distance and faster transmission, more and more researches have been devoted into this field. We hope to apply the technology into our daily life sooner the better. The M-Taiwan plans have been related to the infrastructure of the wireless environment in major cities. This paper is focused on using a set of GPS technology and integrated with 802.16e-Smart cars to provide a handoff mechanism, called the Intelligent Mobile Network Handoff Mechanism. An ASN-establishment of a DataBase Server, is the most important hope that through this DataBase to store information related to GPS, and through this Server to calculate the base station line, handoff. By using our proposed mechanism, a base station can be planned in advance on the path of choice. To reduce the number of possible handoff, scanning the channels and by the waste channel scanning the time it takes, hoping to provide a more stable WiMax services.
Simple Robots in Polygonal Environments: A Hierarchy
Authors: Jan Brunner, Matúš Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tasks. With the aim of understanding the limitations of such capabilities, swarms of simple and cheap robots play an increasingly important role. Their advantages are, among others, the cost, reusability, and fault-tolerance. While it can be expected that for a variety of problems a wealth of robot models are proposed, it is rather unfortunate that almost all proposals fail to point out their assumptions explicitly and clearly. This is problematic because seemingly small changes in the models can lead to significant differences in the capabilities of the robots. Hence, a clean assessment of the "power of robot models" is dearly needed, not only in absolute terms, but also relative to each other. We make a step in this direction by explaining for a set of elementary sensing devices which of these devices (alone and in combination) enable a robot to solve which problems. This not only leads to a natural relation (and hierarchy) of power between robot models that supports a more systematic design, but also exhibits surprising connections and equivalences. For example, one of the derived relations between the robot models implies that a very simple robot (that cannot measure distances) moving inside a simple polygon can find a shortest path between two vertices by means of a sensor that detects for an angle at a vertex of the polygon whether it is convex. We give an explicit algorithm which allows the robot to find a shortest path.
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Authors: Deying Li, Hongwei Du, Peng-Jun Wan, Xiaofeng Gao, Zhao Zhang, Weili Wu
Venue: Theoretical Computer Science (2009)

Consider an asymmetric wireless network represented by a digraph G=(V,E). A subset of vertices U is called a strongly connected dominating set (SCDS) if the subgraph induced by U is strongly connected and every vertex not in U has both an in-neighbor in U and an out-neighbor in U. SCDS plays an important role of the virtual backbone in asymmetric wireless networks. Motivated by the construction of a small virtual backbone, we study the problem Minimum SCDS, which seeks a smallest SCDS of a digraph. For any constant 0
A machine-checked model of safe composition
Authors: Benjamin Delaware, William Cook, Don Batory
Venue: Proceedings of the 2009 workshop on Foundations of aspect-oriented languages (2009)

Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of features are meaningful; feature models express the high-level domain constraints that govern feature compatibility. Product line developers also face the problem of safe composition -- whether every product allowed by a feature model is type-safe when compiled and run. To study the problem of safe composition, we present Lightweight Feature Java (LFJ), an extension of Lightweight Java with support for features. We define a constraint-based type system for LFJ and prove its soundness using a full formalization of LFJ in Coq. In LFJ, soundness means that any composition of features that satisfies the typing constraints will generate a well-formed LJ program. If the constraints of a feature model imply these typing constraints then all programs allowed by the feature model are type-safe.
A Method for Predicting Marker Tracking Error
Authors: Russell M. Freeman, Simon J. Julier, Anthony J. Steed
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Many Augmented Reality (AR) applications use marker-based vision tracking systems to recover camera pose by detecting one or more planar landmarks. However, most of these systems do not interactively quantify the accuracy of the pose they calculate. Instead, the accuracy of these systems is either ignored, assumed to be a fixed value, or determined using error tables (constructed in an off-line ground-truthed process) along with a run-time interpolation scheme. The validity of these approaches are questionable as errors are strongly dependent on the intrinsic and extrinsic camera parameters and scene geometry. In this paper we present an algorithm for predicting the statistics of marker tracker error in real-time. Based on the Scaled Spherical Simplex Unscented Transform (SSSUT), the algorithm is applied to the Augmented Reality Toolkit Plus (ARToolKitPlus). The results are validated using precision off-line photogrammetric techniques.
Business Simulations and Cognitive Learning
Authors: Philip H. Anderson, Leigh Lawton
Venue: Simulation and Gaming (2009)

This article focuses on the research associated with the assessment of the cognitive learning that occurs through participation in a simulation exercise. It summarizes the objective evidence regarding cognitive learning versus the perceptions of cognitive learning achieved as reported by participants and instructors. The authors also explain why little progress has occurred in objectively assessing cognitive learning in the past 25 years and provide potential options for filling this deficiency.
Support for context-aware intelligibility and control
Authors: Anind K. Dey, Alan Newberger
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Intelligibility and control are important user concerns in context-aware applications. They allow a user to understand why an application is behaving a certain way, and to change its behavior. Because of their importance to end users, they must be addressed at an interface level. However, often the sensors or machine learning systems that users need to understand and control are created long before a specific application is built, or created separately from the application interface. Thus, supporting interface designers in building intelligibility and control into interfaces requires application logic and underlying infrastructure to be exposed in some structured fashion. As context-aware infrastructures do not provide generalized support for this, we extended one such infrastructure with Situations, components that appropriately exposes application logic, and supports debugging and simple intelligibility and control interfaces, while making it easier for an application developer to build context-aware applications and facilitating designer access to application state and behavior. We developed support for interface designers in Visual Basic and Flash. We demonstrate the usefulness of this support through an evaluation of programmers, an evaluation of the usability of the new infrastructure with interface designers, and the augmentation of three common context-aware applications.
PDC: Propagation Delay Control Strategy for Restricted Floating Sensor Networks
Authors: Xiaodong Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Restricted Floating Sensor (RFS) proposed by Yunhao Liu is an important model in offshore data collection. There is a need for highly precise, real-time in many offshore monitoring. In this paper, we propose a Propagation Delay Control (PDC)strategy for RFS networks. This strategy can modify the transmission delay adaptively depending on users together with the changeful condition of wireless links. The experiment shows our work is succeeding in changing propagation delay by orders.
Research of Fuzzy Neural Network Model Based on Quantum Clustering
Authors: Jie Sun, Sheng-nan Hao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Fuzzy neural network can handle non-linear, complex data, but the structure of model determination is an important and difficult issues identified. More complete results can be made .in a short period of time by the optimization network model. To address this issue, this paper presents the fusion of a quantum clustering algorithm and fuzzy c-means clustering algorithm, the fuzzy neural network structure is carried out at different levels data processing. Through the model of mining in complex industrial process, the validity of the model is tested.