ppxscal/embedding_network huggingface dataset:
Potential-based shaping and Q-value initialization are equivalent
Authors: Eric Wiewiora
Venue: Journal of Artificial Intelligence Research (2003)

Shaping has proven to be a powerful but precarious means of improving reinforcement learning performance. Ng, Harada, and Russell (1999) proposed the potential-based shaping algorithm for adding shaping rewards in a way that guarantees the learner will learn optimal behavior. In this note, we prove certain similarities between this shaping algorithm and the initialization step required for several reinforcement learning algorithms. More specifically, we prove that a reinforcement learner with initial Q-values based on the shaping algorithm's potential function make the same updates throughout learning as a learner receiving potential-based shaping rewards. We further prove that under a broad category of policies, the behavior of these two learners are indistinguishable. The comparison provides intuition on the theoretical properties of the shaping algorithm as well as a suggestion for a simpler method for capturing the algorithm's benefit. In addition, the equivalence raises previously unaddressed issues concerning the efficiency of learning with potential-based shaping.
Water as a Quantum Computing Device
Authors: Edward G. Belaga, Daniel Grucker, Tarek Khalil, Jean Richert, Kees Schenk Brill
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

We propose a new approach in Nuclear Magnetic Resonance (NMR) technology for quantum computing. Two basic elements for quantum computation are qubits and interaction. Traditionnally in NMR, qubits are obtained by considering the spin states of certain atoms of a specific molecule. The interaction that is necessary to create qubit gates such as Control-NOT is then made possible by the spin-spin coupling that exists in such a molecule. One of the drawbacks of this method is the low scalability. More qubits usually means finding an entire different molecule to label the qubits.We take a different view on the NMR approach. We use a water tube as quantum computer where qubits are defined by the spins which have the same frequency resonance in a small interval defined by the NMR linewidth. Two fundamental roadblocks have to be crossed before this method can even be considered as a possible quantum computation technique: single qubits need to be identified and adressed and an interaction between these qubits has to exist to create two-qubit gates.We settle the first of these problems by using a magnetic field gradient applied in the main magnetic field direction. The application of a magnetic field gradient during the RF pulse induces a rotation only of those spins whose resonant frequency is equal to the bandwidth of the RF pulse, therefore a qubit can be defined by its resonant frequency and manipulated by selective RF pulses. The main advantage of creating qubits in this way is scalability. As qubits are no longer atoms of a specific molecule but segments of our water tube, increasing the number of qubits would hypothetically just mean increasing the number of segments by applying a stronger magnetic field gradient. Another potential advantage can be obtained during the initialisation phase of the qubits. The second roadblock, the problem of creating interaction between qubits, is work in progress. As for now we are investigating the use of the dipole-dipole interaction between the spins to generate a coupling between the spins in order to create entanglements.
UNN-WePS: web person search using co-present names and lexical Chains
Authors: Jeremy Ellman, Gary Emery
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

We describe a system, UNN-WePS for identifying individuals from web pages using data from Semeval Task 13. Our system is based on using co-presence of person names to form seed clusters. These are then extended with pages that are deemed conceptually similar based on a lexical chaining analysis computed using Roget's thesaurus. Finally, a single link hierarchical agglomerative clustering algorithm merges the enhanced clusters for individual entity recognition. UNN-WePS achieved an average purity of 0.6, and inverse purity of 0.73.
Run-Time Detection of Malwares via Dynamic Control-Flow Inspection
Authors: Yong-Joon Park, Zhao Zhang, Songqing Chen
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

Conventional approach of detecting malwares relies on static scanning of malware signature.However, it may not work on the malwares that use software protection methods such as encryption and packing with run-time decryption and unpacking.We propose a hardware-assisted malware detection system that detects malwares during program run time to complement the conventional approach.It searches for control flow-based signature of malware during program execution, therefore bypassing the protection method used by those malwares.A new hardware design is used to assist the collection of control flow information.We have implemented and evaluated a prototype system on top of a full-system simulator based on the Intel x86 architecture.The experimental results show that the system can successfully distinguish all 30 malware variants and other benign programs that we have randomly collected, and that the overall run-time performance overhead is negligible.In short, the study demonstrates that it is a viable approach to detect malware in run time using control flow-based signature.
The Problems of Unification and Coordination in the Development of E-Government in China
Authors: Wu Qunli, Zheng Hong, Tan Xue
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

It has been a global trend to promote the development of e-government. It has been emphasized its importance in informatization of China. The construction of e-government has been carried out in government department at all levels. However, as it is complex system engineering, there are quite a few problems to be solved. Lacking a unified and coordinated developing plan is one of important issues that need to be settled. This paper introduced the general problems of developing e-government in China. According to practical situation, it has also proposed the countermeasures to solve them.
Comparison of Point and Line Features and Their Combination for Rigid Body Motion Estimation
Authors: Florian Pilz, Nicolas Pugeault, Norbert Krüger
Venue: Statistical and Geometrical Approaches to Visual Motion Analysis: International Dagstuhl Seminar, Dagstuhl Castle, Germany, July 13-18, 2008. Revised Papers (2009)

This paper discusses the usage of different image features and their combination in the context of estimating the motion of rigid bodies (RBM estimation). From stereo image sequences, we extract line features at local edges (coded in so called multi-modal primitives) as well as point features (by means of SIFT descriptors). All features are then matched across stereo and time, and we use these correspondences to estimate the RBM by solving the 3D-2D pose estimation problem. We test different feature sets on various stereo image sequences, recorded in realistic outdoor and indoor scenes. We evaluate and compare the results using line and point features as 3D-2D constraints and we discuss the qualitative advantages and disadvantages of both feature types for RBM estimation. We also demonstrate an improvement in robustness through the combination of these features on large data sets in the driver assistance and robotics domain. In particular, we report total failures of motion estimation based on only one type of feature on relevant data sets.
Software-Based Algorithm for Modeling and Correction of Gradient Nonlinearity Distortions in Magnetic Resonance Imaging
Authors: Tom S. Lee, Keith E. Schubert, Reinhard W. Schulte
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

Functional radiosurgery is a noninvasive stereotactic technique that requires magnetic resonance image (MRI) sets with high spatial resolution. Gradient nonlinearities introduce geometric distortions that compromise the accuracy of MRI-based stereotactic localization. We present a gradient nonlinearity correction method based on a cubic phantom MRI data set. The approach utilizes a sum of spherical harmonics to model the geometrically warped planes of the cube and applies the model to correct arbitrary image sets acquired with the same scanner. In this paper, we give a detailed description of the Matlab distortion correction program, report on its performance in stereotactic localization of phantom markers, and discuss the possibility to accelerate the code using General-Purpose Computing on Graphics Processing Units (GPGPU) techniques.
Lessons and Experiences with High-Level Synthesis
Authors: Soujanna Sarkar, Shashank Dabral, Praveen K. Tiwari, Raj S. Mitra
Venue: IEEE Design Test (2009)

Editor's note:This article is a designer's perspective on the benefits and challenges of using commercially available HLS tools. The authors have used three such tools for synthesizing industrial ASICs. They discuss their impact on four criteria: design goals, verification closure, ECO handling, and productivity gains.&#x2014;Philippe Coussy, Universit&#x00E9; de Bretagne Sud
Principal manifold learning by sparse grids
Authors: Christian Feuers&#x00e4;nger, Michael Griebel
Venue: Computing (2009)

In this paper, we deal with the construction of lower-dimensional manifolds from high-dimensional data which is an important task in data mining, machine learning and statistics. Here, we consider principal manifolds as the minimum of a regularized, non-linear empirical quantization error functional. For the discretization we use a sparse grid method in latent parameter space. This approach avoids, to some extent, the curse of dimension of conventional grids like in the GTM approach. The arising non-linear problem is solved by a descent method which resembles the expectation maximization algorithm. We present our sparse grid principal manifold approach, discuss its properties and report on the results of numerical experiments for one-, two- and three-dimensional model problems.
Adding State and Visibility Control to Traits Using Lexical Nesting
Authors: Tom Cutsem, Alexandre Bergel, Stéphane Ducasse, Wolfgang Meuter
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Traits are reusable building blocks that can be composed to share methods across unrelated class hierarchies. Original traits are stateless and cannot express visibility control for methods. Two extensions, stateful traits and freezable traits, have been proposed to overcome these limitations. However, these extensions introduce complexity and have not yet been combined to simultaneously add both state and visibility control to traits.This paper revisits the addition of state and visibility control to traits. Rather than extending the original traits model with additional operations, we allow traits to be lexically nested within other modules. Traits can then have (shared) state and visibility control by hiding variables or methods in their lexical scope. Although the Traits' "flattening property" has to be revisited, the combination of traits with lexical nesting results in a simple and expressive trait model. We discuss an implementation of the model in AmbientTalk and specify its operational semantics.
Towards Preference-Constrained k-Anonymisation
Authors: Grigorios Loukides, Achilles Tziatzios, Jianhua Shao
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on k-anonymisation which attempt to satisfy a minimum level of protection requirement as a constraint and then optimise data utility within that constraint, we allow data owners and users to specify their detailed protection and usage requirements as a set of preferences on attributes or data values, treat such preferences as constraints and solve them as a multi-objective optimisation problem. This ensures that anonymised data will be actually useful to data users in their applications and sufficiently protected for data owners. Our preliminary experiments show that our method is capable of producing anonymisations that satisfy a range of preferences and have a high level of data utility and protection.
Mechanics of Non-holonomic Systems: A New Class of Control Systems, 1st edition
Authors: S. K. Soltakhanov, M. P. Yushkov, S. A. Zegzhda
Venue: Foundations Of Engineering Mechanics (2009)

A general approach to the derivation of equations of motion of as holonomic, as nonholonomic systems with the constraints of any order is suggested. The system of equations of motion in the generalized coordinates is regarded as a one vector relation, represented in a space tangential to a manifold of all possible positions of system at given instant. The tangential space is partitioned by the equations of constraints into two orthogonal subspaces. In one of them for the constraints up to the second order, the motion low is given by the equations of constraints and in the other one for ideal constraints, it is described by the vector equation without reactions of connections. In the whole space the motion low involves Lagrangian multipliers. It is shown that for the holonomic and nonholonomic constraints up to the second order, these multipliers can be found as the function of time, positions of system, and its velocities. The application of Lagrangian multipliers for holonomic systems permits us to construct a new method for determining the eigenfrequencies and eigenforms of oscillations of elastic systems and also to suggest a special form of equations for describing the system of motion of rigid bodies. The nonholonomic constraints, the order of which is greater than two, are regarded as programming constraints such that their validity is provided due to the existence of generalized control forces, which are determined as the functions of time. The closed system of differential equations, which makes it possible to find as these control forces, as the generalized Lagrange coordinates, is compound. The theory suggested is illustrated by the examples of a spacecraft motion. The book is primarily addressed to specialists in analytic mechanics.
A Study on How Technological Innovation Affected the 2008 U.S. Presidential Election: Young Voters' Participation and Obama's Victory
Authors: Shoko Kiyohara
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

This paper will argue how technological innovation affected the 2008 U.S. presidential election. Sending or receiving text messages by mobile phones and SNS are very popular among young adults 18-24. During the 2008 U.S. presidential election campaign, most of the candidates had own profile pages on Facebook and MySpace. And, CNN teamed with YouTube to hold the Democratic and Republican Presidential Candidates Debates in 2007 for the first time.However, it is said that especially, Barack Obama and his campaign “successfully” used the new technology to mobilize young voters. So, I will discuss if their targeted young voters did help Obama’s victory. In conclusion, I would like to underscore relevance of technological innovation to the 2008 U.S. presidential election. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
WINDS workshop: Europe-Latin America cooperation in ICT research: state of the art and possibilities offered by the FP7
Authors: Fabio Nascimbeni, Raul Martins, Gustavo Carvalho
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

The proposed workshop aims at presenting the state of the art of cooperation between Europe and Latin America in the field of ICT research, the new approach to international cooperation of the Seventh Framework Programme for Research and the existing participation possibilities for Lain American researchers and research institutions to join European projects in the ICT field. The workshop will also be a moment of discussion on the best strategies to strengthen existing cooperation schemes and to improve long term cooperation between Europe and Latin America in the field.
Cyber Society and Cooperative Cyber Defence
Authors: Peeter Lorents, Rain Ottis, Raul Rikk
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Emergence of cyber societies places new emphasis on the protection of information and information services. The paper provides a definition for the concept of information that is based on the concept of knowledge and a definition for cyber society, which encompasses the relationship between a society of humans and a network of computers. Estonia and the cyber attacks of spring 2007 are briefly examined as an example of an early cyber society under cyber attack. Finally, the role and principles of the Cooperative Cyber Defence Centre of Excellence are explained.
Energy Landscape Paving Algorithm for Solving Circles Packing Problem
Authors: Jingfa Liu, Danhua Xu, Yonglei Yao, Yu Zheng
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In this paper, we study the circles packing problem which consists of packing a set of equal or unequal circles of known radii into a larger containing circle without overlapping. The energy landscape paving (ELP) method is a class of heuristic global optimization algorithm. By combining the ELP method with the gradient descent (GD) procedure, an improved energy landscape paving (ELP+) algorithm for the circles packing problem is put forward. The computational results show the effectiveness of the proposed algorithm.
Three-Dimensional Simulation and Experiment for Soot Source Terms in Turbulent Reacting Flow Using KIVA-3V Software
Authors: Yongfeng Liu, You-tong Zhang, Qinghui Xiong, Hongsen Tian
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

To calculate soot source KIVA-3V software is applied to study the formation and oxidation of soot particles in turbulent flames. The model is based on a detailed description of the chemical and physical processes leading to the formation of soot. It can be subdivided into the growth of polycyclic aromatic hydrocarbons (PAHs) in the gas phase reactions and the processes of particle inception, condensation, surface growth, and oxidation. Two different parts are developed about the growth of PAHs in the gas phase reaction. The first step towards the formation of soot is the formation of benzene and the second step is how to form PAH from benzene. In particle inception and condensation stages Smoluchowski’s equation is deduced and PAH size distribution equations are obtained. In surface growth and oxidation process Hydrogen Abstraction - Carbon Addition (HACA) mechanism is modified due to the finding that the bound between the acetylene and the soot surface can be broken at high temperature in the experiment. Finally the analysis about soot source terms are used in turbulent combustion and different calculated results are obtained for different soot source terms. Acetylene, soot and OH densities are discussed and soot spatial distributions in the cylinder for different crank angle degree are carried out in 4JB1 diesel engine. It gives the theory and method about calculating soot exactly in diesel engine.
Modelling Stem Cells Lineages with Markov Trees
Authors: Victor Olariu, Daniel Coca, Stephen A. Billings, Visakan Kadirkamanathan
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

A variational Bayesian EM with smoothed probabilities algorithm for hidden Markov trees (HMT) is proposed for incomplete tree structured data. The full posterior of the HMT parameters is determined and the underflow problems associated with previous algorithms are eliminated. Example results for the prediction of the types of cells in real stem cell lineage trees are presented.
Semeval-2007 task 02: evaluating word sense induction and discrimination systems
Authors: Eneko Agirre, Aitor Soroa
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

The goal of this task is to allow for comparison across sense-induction and discrimination systems, and also to compare these systems to other supervised and knowledge-based systems. In total there were 6 participating systems. We reused the SemEval-2007 English lexical sample subtask of task 17, and set up both clustering-style unsupervised evaluation (using OntoNotes senses as gold-standard) and a supervised evaluation (using the part of the dataset for mapping). We provide a comparison to the results of the systems participating in the lexical sample subtask of task 17.
An optimization approach for communal home meal delivery service: A case study
Authors: Olli Bräysy, Pentti Nakari, Wout Dullaert, Pekka Neittaanmäki
Venue: Journal of Computational and Applied Mathematics (2009)

This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.
Kernel Based Subspace Projection of Near Infrared Hyperspectral Images of Maize Kernels
Authors: Rasmus Larsen, Morten Arngren, Per Waaben Hansen, Allan Aasbjerg Nielsen
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

In this paper we present an exploratory analysis of hyper-spectral 900-1700 nm images of maize kernels. The imaging device is a line scanning hyper spectral camera using a broadband NIR illumination. In order to explore the hyperspectral data we compare a series of subspace projection methods including principal component analysis and maximum autocorrelation factor analysis. The latter utilizes the fact that interesting phenomena in images exhibit spatial autocorrelation. However, linear projections often fail to grasp the underlying variability on the data. Therefore we propose to use so-called kernel version of the two afore-mentioned methods. The kernel methods implicitly transform the data to a higher dimensional space using non-linear transformations while retaining the computational complexity. Analysis on our data example illustrates that the proposed kernel maximum autocorrelation factor transform outperform the linear methods as well as kernel principal components in producing interesting projections of the data.