ppxscal/embedding_network huggingface dataset:
Bio-Inspired Functional Asymmetry Camera System
Authors: Yoshiki Yamaguchi, Noriyuki Aibe, Moritoshi Yasunaga, Yorihisa Yamamoto, Takaaki Awano, Ikuo Yoshihara
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Robust tracking is the key subject to real target-tracking-cameras. In this article, we present a filtering method that can achieve the robust tracking under noisy environment. We have also developed an asymmetry camera system. The system consists of double lens modules to mimic the eye's function of watching and tracking the target with seeing the whole image concurrently. In this article, we also explain the design of the newly developed camera system and demonstrate its performance in the task of tracking a target fish among multiple fish in an aquarium.
Book Review
Authors: Ami Marowka
Venue: IEEE Distributed Systems Online (2008)

A review of Using OpenMP: Portable Shared Memory Parallel Programming by Barbara Chapman, Gabriele Jost, and Ruud van der Pas
Toward Integrated Virtual Execution Platform for Large-Scale Distributed Embedded Systems
Authors: Yukikazu Nakamoto, Issei Abe, Tatsunori Osaki, Hiroyuki Terada, Yu Moriyama
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

The size and complexity of large-scale distributed embedded systems such as automotive and process control have increased recently. Sophisticated systems that are safe and environment friendly in the distributed systems require numerous types of sensor data, which are collected from various devices and sent to computers through networks. In order to develop the large-scale distributed embedded systems with high productivity and quality, a virtual execution environment platform is required. This platform integrates numerous CPU simulators and various device simulators through the network and provides network-wide simulation functionalities in the distributed system. In this paper, we present the requirements and initial system designs of a virtual execution environments platform for the development of the large-scale distributed embedded system software.
Event Query Processing in EPC Information Services
Authors: Tuyen Nguyen, Young-Koo Lee, Byeong-Soo Jeong, Sungyoung Lee
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Radio Frequency Identification (RFID) technology is an excellent substitute for barcodes in industry. However, the management of a large amount of RFID data, together with complicated relationships between data, in the context of responding to different kinds of queries is not well supported by traditional databases. Therefore, 1) an eventbased model for managing data and 2) an algorithm for responding to event queries are proposed for RFID repositories in this paper. Our approach is based on the specification of the EPC Information Services (EPCIS) to meet the overall data requirements of the RFID community. Specifically, the object-oriented model is built on the top of relational databases so as to make the proposed combined data model highly flexible and semantic comprehensive. Based on this data model, various complicated predicates implied in different parameters of the predefined event query are interpreted into one single request to the database.
Active GSM cell-id tracking: "Where Did You Disappear?"
Authors: Kateřina Dufková, Michal Ficek, Lukáš Kencl, Jakub Novak, Jan Kouba, Ivan Gregor, Jiří Danihelka
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

Location-based services are mobile network applications of growing importance and variability. The space of location technologies and applications has not yet been fully explored, perhaps omitting some important practical uses. In this work we present the prototype SS7Tracker platform, an active, non-intrusive, GSM Cell-ID-based solution to network-based location tracking, and two novel applications of this technique: network diagnostics based on inroamer tracking and human activity research. We demonstrate the usability and performance limits of the platform on practical tests carried out in a live GSM network.
The UNIVAC system
Authors: J. Presper Eckert,  Jr., James R. Weiner, H. Frazer Welsh, Herbert F. Mitchell
Venue: Papers and discussions presented at the Dec. 10-12, 1951, joint AIEE-IRE computer conference: Review of electronic digital computers (1951)

In March 1951, the first UNIVAC system formally passed its acceptance tests and was put promptly into operation by the Bureau of the Census. Since the UNIVAC is the first computer which can handle both alphabetic and numerical data to reach full-scale operation so far, its operating record and a review of the types of problems to which it has been applied provide an interesting milestone in the ever-widening field of electronic digital computers.
Cracking energy estimation of ultra low-k package using novel prediction approach combined with global-local modeling technique
Authors: Chang-Chun Lee, Tsung-Lin Chou, Chien-Chia Chiu, Chin-Chiu Hsia, Kuo-Ning Chiang
Venue: Microelectronic Engineering (2008)

Interfacial crack/delamination, due to the presence of dissimilar material systems, is one of the major concerns of thermo-mechanical reliability for the development of next node technology in integrated circuits (IC) devices. The cracking energy results from many back end of line (BEOL) and packaging processes at various temperature differences is prone to drive the crack advance. To investigate the sensitivity of crack propagation in low-k dielectric materials, a robust estimation of J-integral approach combined with a rectangular path of integral contour is performed using finite element analysis (FEA). By means of the verification of 4-point bending test (4-PBT), excellent agreements are obtained as compared with the experimental data. Moreover, a multiscale modeling technique is proposed to resolve the difficulty of model construction as from bridge device level to packaging level. The sub-modeling procedures developed specifically for the impact prediction of interfacial crack in complicated Cu/low-k interconnects. The analytic results indicate the foregoing methodology is valuable to forecast the physical behavior and reliability of advanced IC devices in the nano scaled size. On the basis of the presented results in this research, an approximated criterion for determining the dimensions of sub-model is suggested and demonstrated as well.
HypereiDoc --- An XML Based Framework Supporting Cooperative Text Editions,
Authors: Péter Bauer, Zsolt Hernáth, Zoltán Horváth, Gyula Mayer, Zsolt Parragi, Zoltán Porkoláb, Zsolt Sztupák
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

HypereiDoc is an XML based framework supporting distributed, multi-layered, version-controlled processing of epigraphical, papyrological or similar texts in a modern critical edition. Such studies are typically based on independent work of philologists using annotation systems like the Leiden Conventions. Current initiatives like TEI and Epidoc have definitive limitations both in expressional power and the way how individual results can form a cooperative product. The HypereiDoc framework provides XML schema definition for a set of annotation-based layers connected by an extensive reference system, validating and building tools, and an editor on-line visualizing the base text and the annotations. The framework makes scholars able to work on the same text in a cooperative and distributed way. Our framework has been successfully tested by philologists working on the Hypereides palimpsest.
Practical, pluggable types for a dynamic language
Authors: Niklaus Haldiman, Marcus Denker, Oscar Nierstrasz
Venue: Computer Languages, Systems and Structures (2009)

Most languages fall into one of two camps: either they adopt a unique, static type system, or they abandon static type-checks for run-time checks. Pluggable types blur this division by (i) making static type systems optional, and (ii) supporting a choice of type systems for reasoning about different kinds of static properties. Dynamic languages can then benefit from static-checking without sacrificing dynamic features or committing to a unique, static type system. But the overhead of adopting pluggable types can be very high, especially if all existing code must be decorated with type annotations before any type-checking can be performed. We propose a practical and pragmatic approach to introduce pluggable type systems to dynamic languages. First of all, only annotated code is type-checked. Second, limited type inference is performed on unannotated code to reduce the number of reported errors. Finally, external annotations can be used to type third-party code. We present TypePlug, a Smalltalk implementation of our framework, and report on experience applying the framework to three different pluggable type systems.
Accelerating the Whirlpool Hash Function Using Parallel Table Lookup and Fast Cyclical Permutation
Authors: Yedidya Hilewitz, Yiqun Lisa Yin, Ruby B. Lee
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

Hash functions are an important building block in almost all security applications. In the past few years, there have been major advances in the cryptanalysis of hash functions, especially the MDx family, and it has become important to select new hash functions for next-generation security applications. One of the potential candidates is Whirlpool, an AES-based hash function. Whirlpool adopts a very different design approach from MDx, and hence it has withstood all the latest attacks. However, its slow software performance has made it less attractive for practical use. In this paper, we present a new software implementation of Whirlpool that is significantly faster than previous ones. Our optimization leverages new ISA extensions, in particularly Parallel Table Lookup (PTLU), which has previously been proposed to accelerate block ciphers like AES and DES, multimedia and other applications. We also show a novel cyclical permutation algorithm that can concurrently convert rows of a matrix to diagonals. We obtain a speedup of 8.8× and 13.9× over a basic RISC architecture using 64-bit and 128-bit PTLU modules, respectively. This is equivalent to rates of 11.4 and 7.2 cycles/byte, respectively, which makes our Whirlpool implementation faster than the fastest published rate of 12 cycles/byte for SHA-2 in software.
On the Minima of Bethe Free Energy in Gaussian Distributions
Authors: Yu Nishiyama, Sumio Watanabe
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Belief propagation (BP) is effective for computing marginal probabilities of a high dimensional probability distribution. Loopy belief propagation (LBP) is known not to compute precise marginal probabilities and not to guarantee its convergence. The fixed points of LBP are known to accord with the extrema of Bethe free energy. Hence, the fixed points are analyzed by minimizing the Bethe free energy.In this paper, we consider the Bethe free energy in Gaussian distributions and analytically clarify the extrema, equivalently, the fixed points of LBP for some particular cases. The analytical results tell us a necessary condition for LBP convergence and the quantities which determine the accuracy of LBP in Gaussian distributions. Based on the analytical results, we perform numerical experiments of LBP and compare the results with analytical solutions.
Differential evolution approach for optimal reactive power dispatch
Authors: M. Varadarajan, K. S. Swarup
Venue: Applied Soft Computing (2008)

Differential evolution based optimal reactive power dispatch for real power loss minimization in power system is presented in this paper. The proposed methodology determines control variable settings such as generator terminal voltages, tap positions and the number of shunts to be switched, for real power loss minimization in the transmission system. The problem is formulated as a mixed integer nonlinear optimization problem. A generic penalty function method, which does not require any penalty coefficient, is employed for constraint handling. The formulation also checks for the feasibility of the optimal control variable setting from a voltage security point of view by using a voltage collapse proximity indicator. The algorithm is tested on standard IEEE 14, IEEE 30, and IEEE 118-Bus test systems. To show the effectiveness of proposed method the results are compared with Particle Swarm Optimization and a conventional optimization technique - Sequential Quadratic Programming.
The minimum spanning strong subdigraph problem is fixed parameter tractable
Authors: Jørgen Bang-Jensen, Anders Yeo
Venue: Discrete Applied Mathematics (2008)

A digraph D is strong if it contains a directed path from x to y for every choice of vertices x,y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strong subdigraph of a strong digraph. It is easy to see that every strong digraph D on n vertices contains a spanning strong subdigraph on at most 2n-2 arcs. By reformulating the MSSS problem into the equivalent problem of finding the largest positive integer k@?n-2 so that D contains a spanning strong subdigraph with at most 2n-2-k arcs, we obtain a problem which we prove is fixed parameter tractable. Namely, we prove that there exists an O(f(k)n^c) algorithm for deciding whether a given strong digraph D on n vertices contains a spanning strong subdigraph with at most 2n-2-k arcs. We furthermore prove that if k>=1 and D has no cut vertex then it has a kernel of order at most (2k-1)^2. We finally discuss related problems and conjectures.
Mining taxonomies of process models
Authors: Gianluigi Greco, Antonella Guzzo, Luigi Pontieri
Venue: Data Knowledge Engineering (2008)

Process mining techniques have been receiving great attention in the literature for their ability to automatically support process (re)design. Typically, these techniques discover a concrete workflow schema modelling all possible execution patterns registered in a given log, which can be exploited subsequently to support further-coming enactments. In this paper, an approach to process mining is introduced that extends classical discovery mechanisms by means of an abstraction method aimed at producing a taxonomy of workflow models. The taxonomy is built to capture the process behavior at different levels of detail. Indeed, the most-detailed mined models, i.e., the leafs of the taxonomy, are meant to support the design of concrete workflows, as it happens with existing techniques in the literature. The other models, i.e., non-leaf nodes of the taxonomy, represent instead abstract views over the process behavior that can be used to support advanced monitoring and analysis tasks. All the techniques discussed in the paper have been implemented, tested, and made available as a plugin for a popular process mining framework (ProM). A series of tests, performed on different synthesized and real datasets, evidenced the capability of the approach to characterize the behavior encoded in input logs in a precise and complete way, achieving compelling conformance results even in the presence of complex behavior and noisy data. Moreover, encouraging results have been obtained in a real-life application scenario, where it is shown how the taxonomical view of the process can effectively support an explorative ex-post analysis, hinged on the different kinds of process execution discovered from the logs.
(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
Authors: Xiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant-approximation. In 2006, Amb&uuml;hl et al solved this problem by presenting a 72-approximation for the minimum weight dominating set and also a 89-approximation for the minimum weight connected dominating set in unit disk graphs. In this paper, we improve their results by giving a (6 + &epsilon;)-approximation for the minimum weight dominating set and a (10 + &epsilon;)-approximation for the minimum weight connected dominating set in unit disk graphs where &epsilon; is any small positive number.
Parallel FEM Software for CFD Problems
Authors: Arnas Kačeniauskas, Peter Rutschmann
Venue: Informatica (2004)

The present paper describes the development and the performance of parallel FEM software for solving various CFD problems. Domain decomposition strategy and parallel iterative GMRES solver have been adapted to the universal space-time FEM code FEMTOOL, which allows implementation of any partial differential equation with minor expenses. The developed data structures, the static load balancing and the inter-processor communication algorithms have been particularly suited for homogeneous distributed memory PC clusters. The universality of the considered parallel algorithms has been validated solving applications described by the Poisson equation, by the convective transport equation and by the Navier-Stokes equations. Three typical benchmark problems have been solved in order to perform the efficiency study. The performance of parallel computations, the speed-up and the efficiency have been measured on three BEOWULF PC clusters as well as on the cluster of IBM RISC workstations and on the IBM SP2 supercomputer.
A Study on Scheduling Function of a Magnetic Parameter in a Virtual Magnetic Diminuendo Method
Authors: Hiroshi Wakuya, Mari Miyazaki
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

A virtual magnetic diminuendo method proposed recently is originally inspired by the analogy between the Hopfield network and the spin glass. It is a simple and ingenious idea for solving combinatorial optimization problems, because only a threshold of Hopfield network is controlled from a negative value to zero as a magnetic parameter, which is newly introduced in this study. According to the preliminary study, it seems to be clear experimentally that the proposed method is effective. In order to carry out further considerations, a scheduling function of the virtual magnetic parameter is investigated in this study. As a result of some computer simulations with the crossbar switch problem, it is found that changing polarity (negative ¿ positive) of the magnetic parameter must be effective to improve the score.
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Authors: Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are "observer variables" which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL which can constrain the cost variables, is decidable over that model. This has to be compared with the same problems in the framework of timed automata where both problems are undecidable in general, while they are decidable for the restricted class of one-clock timed automata.
Realistic simulation environments for IP-based networks
Authors: Thomas Gamer, Michael Scharf
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

During development of new protocols and systems researchers in most cases use simulations for evaluation of their product, especially in the area of communication networks. The quality of the simulation environment, however, significantly influences the quality of a product's evaluation. Therefore, simulation environments as realistic as possible are necessary in order to get reliable results. In this paper we present ReaSE, a tool for creation of such realistic environments. It considers multiple aspects: topology generation -- on AS level as well as on router level --, traffic patterns, and attack traffic. Furthermore, ReaSE is based on current state of the art solutions.
A Distributed Data Mining System for a Novel Ubiquitous Healthcare Framework
Authors: M. Viswanathan, T. K. Whangbo, K. J. Lee, Y. K. Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Recent years have shown impressive growth in the development of ubiquitous healthcare (u-Healthcare) systems which aim for the next generation in e-Health services and associated research. Such systems are primarily being designed to provide emergency and preventive healthcare to citizens anywhere/anytime using wired and wireless mobile technologies. Data mining is an indispensable aspect of such systems and represents the process of analyzing databases to extract hidden knowledge and relationships. This paper introduces and studies the development framework of a prototype ubiquitous healthcare system initiated by the South Korean government. Preliminary results with a distributed data mining system are presented in the context of a larger future integration with the ubiquitous healthcare framework.
Application of Decision Support System to Three Gorges Cascade Hydropower Station
Authors: Jiaping Liao, Li He, Xiaohui Yuan, Hui Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Three Gorges (TG) cascade stations plays an important role in power system, which is a major power supply station burdened with trades between multi-provincial grids. Hydropower Scheduling Decision Support System (TGDSS) is developed to improve scientific and economy of reservoir operation. In order to increase comprehensive benefit of TG Project, the practical models of joint scheduling, peak regulation and operating mode in power market are designed to provide timely decision-making. Subsequently, the structure, function, model division and realizing methods are introduced in detail. The practice shows that TGDSS has greatly increased the cascade water utilization rate and promote resource optimal configuration.
Grayscale medical image annotation using local relational features
Authors: Lokesh Setia, Alexandra Teynor, Alaa Halawani, Hans Burkhardt
Venue: Pattern Recognition Letters (2008)

Image annotation and classification are important areas where pattern recognition algorithms can be applied. In this article we report the insights that we have gained during our participation in the ImageCLEF medical annotation task during the years 2006 and 2007. Grayscale radiograph images taken from clinical routine had to be classified into one of the 116 base classes or labeled with attributes which described various properties of the radiograph. We present an algorithm based on local relational features which is robust with respect to illumination changes. It incorporates the geometric constellation of the feature points during the matching process and thus obtains superior performance. Furthermore, a hierarchical classification scheme is presented which reduces the computational complexity of the classifier.