ppxscal/embedding_network huggingface dataset:
On Multiplicative Noise Models for Stochastic Search
Authors: Mohamed Jebalia, Anne Auger
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

In this paper we investigate multiplicative noise models in the context of continuous optimization. We illustrate how some intrinsic properties of the noise model imply the failure of reasonable search algorithms for locating the optimum of the noiseless part of the objective function. Those findings are rigorously investigated on the (1 + 1)-ES for the minimization of the noisy sphere function. Assuming a lower bound on the support of the noise distribution, we prove that the (1 + 1)-ES diverges when the lower bound allows to sample negative fitness with positive probability and converges in the opposite case. We provide a discussion on the practical applications and non applications of those outcomes and explain the differences with previous results obtained in the limit of infinite search-space dimensionality.
Masking and Dual-Rail Logic Don't Add Up
Authors: Patrick Schaumont, Kris Tiri
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

Masked logic styles use a random mask bit to de-correlate the power consumption of the circuit from the state of the algorithm. The effect of the random mask bit is that the circuit switches between two complementary states with a different power profile. Earlier work has shown that the mask-bit value can be estimated from the power consumption profile, and that masked logic remains susceptible to classic power attacks after only a simple filtering operation. In this contribution we will show that this conclusion also holds for masked pre-charged logic styles and for all practical implementations of masked dual-rail logic styles. Up to now, it was believed that masking and dual-rail can be combined to provide a routing-insensitive logic style. We will show that this assumption is not correct. We demonstrate that the routing imbalances can be used to detect the value of the mask bit. Simulations as well as analysis of design data from an AES chip support this conclusion.
Reasoning about agent execution strategies
Authors: Natasha Alechina, Brian Logan, Mehdi Dastani, John-Jules Ch. Meyer
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We present a logic for reasoning about properties of agent programs under different agent execution strategies. Using the agent programming language SimpleAPL as an example, we show how safety and liveness properties can be expressed by translating agent programs into expressions of the logic. We give sound and complete axiomatizations of two different program execution strategies for SimpleAPL programs, and, for each of those strategies, prove a correspondence between the operational semantics of SimpleAPL and the models of the corresponding logic.
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Authors: Viktor Kuncak, Martin Rinard
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BAPA can express relationships between integer variables and cardinalities of unbounded sets. In combination with other decision procedures and theorem provers, BAPA is useful for automatically verifying quantitative properties of data structures. This paper examines QFBAPA, the quantifier-free fragment of BAPA. The computational complexity of QFBAPA satisfiability was previously unknown; previous QFBAPA algorithms have non-deterministic exponential time complexity due to an explosion in the number of introduced integer variables.This paper shows, for the first time, how to avoid such exponential explosion. We present an algorithm for checking satisfiability of QFBAPA formulas by reducing them to formulas of quantifier-free PA, with only O(n log(n)) increase in formula size. We prove the correctness of our algorithm using a theorem about sparse solutions of integer linear programming problems. This is the first proof that QFBAPA satisfiability is in NP and therefore NP-complete. We implemented our algorithm in the context of the Jahob verification system. Our preliminary experiments suggest that our algorithm, although not necessarily better for proving formula unsatisfiability, is more effective in detecting formula satisfiability than previous approaches.
Adventures in the Blogosphere
Authors: Nick Koudas
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Blogs, social networks, wikis and microblogging are proliferating at unprecedented pace. The numbers reported quantifying user engagement are profound. In this talk, I will present BlogScope (www.blogscope.net) a system under development at the University of Toronto, that aims to collect, process and distill in real time the information in social media. I will present the system, its architecture the difficulties encountered and highlight the various research challenges in building the various components of the system. I will also present, Grapevine, BlogScope's sister project that aims to make sense in real time of the social media space. I will detail areas of research related to the scope of these projects and present challenges that could be addressed via the utilization of scientific and statistical database techniques. If time permits, I'll present demos.
iNIU A Services Portal for NIU Students
Authors: Raghu Kumar Reddy Ariga, Karthik Akula, Shreya Reddy Gujjala, Momtazul Karim, Shishira Ramesh, Jia Zhang
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

iNIU is a centralized online portal aiming for Northern Illinois University (NIU) students to access various services, from the university as well as the Internet, in one Web portal using a single login id. The portal exploits the Web 2.0 technology to mash-up a variety of existing Web services that NIU students frequently use, including Blog, Weather, Clock, Calendar, News, Facebook Profile Viewer, and Search. This paper reports our design and implement of the iNIU services portal.
Classifying Evolving Data Streams Using Dynamic Streaming Random Forests
Authors: Hanady Abdulsalam, David B. Skillicorn, Patrick Martin
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams using an entropy-based drift-detection technique. The algorithm automatically adjusts its parameters based on the data seen so far. Experimental results show that the algorithm handles multi-class problems for which the underlying class boundaries drift, without losing accuracy.
Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments
Authors: Roozbeh Derakhshan, Bela Stantic, Othmar Korn, Frank Dehne
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

In order to facilitate efficient query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize represent a challenge in order to minimize view maintenance and query processing costs. Some existing approaches are applicable only for small problems, which are far from reality. In this paper we introduce a new approach for materialized view selection using Parallel Simulated Annealing (PSA) that selects views from an input Multiple View Processing Plan (MVPP). With PSA, we are able to perform view selection on MVPPs having hundreds of queries and thousands of views. Also, in our experimental study we show that our method provides a significant improvement in the quality of the obtained set of materialized views over existing heuristic and sequential simulated annealing algorithms.
Neural Development on the Ubichip by Means of Dynamic Routing Mechanisms
Authors: Andres Upegui, Andres Perez-Uribe, Yann Thoma, Eduardo Sanchez
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

The ubichip is a bio-inspired reconfigurable circuit developed in the framework of the european project Perplexus. The ubichip offers special reconfigurability capabilities as self-replication and dynamic routing. This paper describes how to exploit the dynamic routing capabilities of the ubichip in order to implement plastic neural networks. We present an approach for dynamically generating a network topology, where synapses among neurons can be created or destroyed depending on the input stimuli. We describe their implementation in the ubichip, and we analyse the resulting network topology and the network development. This work constitutes a first step toward plastic neural circuits exhibiting more realistic biological features.
Theory and Practice of Probabilistic Timed Game for Embedded Systems
Authors: Satoshi Yamane
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Recent embedded systems are composed of many components, and each component is an open system, and it has both real-time properties and uncertainties. We specify each component using timing constraints and probabilities, and compose systems from all the components. In order to treat them, we develop the followings: First we develop probabilistic timed game automata based on a probabilistic timed game as a computational model. Next we develop probabilistic timed game verification.
Wireless Certificate Management Protocol Supporting Mobile Phones
Authors: Yong Lee, Jaeil Lee, GooYeon Lee
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

PKI (Public Key Infrastructure) in wired internet is not suitable for the mobile phone because of the limitation of performance such as less memory and less powerful CPU. Therefore, we need to develop a wireless PKI that provides the similar security level as the wired PKI to support a mobile phone. Especially, certificate management is the start point of PKI. In this paper, we propose a lightweight and secure Wireless Certificate Management Protocol(CMP) that is executable to the mobile phone that has a constrained communication environment and limitation of performance, and show the implementation results of the scheme on the mobile phone. We minimize data sizes processed in mobile phone, and optimize protocols for the certificate management. This results in the reduced module sizes to be able to execute in mobile phone and shows as the same level as the wired CMP.
A SGeMS code for pattern simulation of continuous and categorical variables: FILTERSIM
Authors: Jianbing Wu, Alexandre Boucher, Tuanfeng Zhang
Venue: Computers Geosciences (2008)

The new multiple-point geostatistical algorithm (FILTERSIM), which can handle both categorical and continuous variable training images, is implemented in the SGeMS software. The spatial patterns depicted by the training image are first summarized into a few filter scores; then classified into pattern groups in the filter score space. The sequential simulation approach proceeds by associating each conditioning data event to a closest pattern group using some distance function. A training pattern is then sampled from that group and pasted back onto the simulation grid. Local multiple-point statistics carried by patterns are captured from the training image, and reproduced in the simulation realizations. Hence complex multiple-scale geological structures can be re-constructed in the simulation grid, conditional to a variety of sub-surface data such as well data and seismic survey.
The Numerical Solution of a Partial Differential on the IBM Type 701 Electronic Data Processing Machine
Authors: D. W. Ladd, J. W. Sheldon
Venue: IEEE Annals of the History of Computing (1983)

Editor's Note: In addition to component and system testing performed by the Engineering Department, tests were run by the Applied Science Department to decide whether the 701 would be acceptable to customers. Jerrier A. Haddad assigned one shift a day to D. W. Ladd and John W. Sheldon ,for this purpose. The results were satisfactory, and the problem that was run repeatedly for a number of weeks is described in the 1952 Ladd and Sheldon paper reprinted here. (Sheldon now says that the problem used all of the tapes and drums and electronic storage available.)
An ontology engineering methodology for DOGMA
Authors: Peter Spyns, Yan Tang, Robert Meersman
Venue: Applied Ontology (2008)

Although ontologies occupy a central place in the Semantic Web and related research domains, there are currently not many fully fledged ontology engineering methodologies available. In this paper, we want to present an integrated methodology for ontology engineering from scratch, inspired by various scientific disciplines, in particular database semantics and natural language processing.
A case study of developing game edutainment: "addictive danger"
Authors: Suwichai Phunsa, Suwich Tirakoat
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This paper aims at developing a game edutainment that combines learning with playing. Game content intends to give knowledge about 7 addictives -- opium, heroin, inhalant, methamphetamine, marijuana, cigarette and alcohol. We explore the satisfaction of players towards this game and examine how the players could learn about addictive danger. We found that this game would stimulate the players to avoid the addictives while enjoying 3D adventure computer game.
Exploiting Attribute-Wise Distribution of Keywords and Category Dependent Attributes for E-Catalog Classification
Authors: Young-Gon Kim, Taehee Lee, Sang-Goo Lee, Jong-Heung Park
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

E-catalogs are semi-structured documents that consist of multiple attributes and values. Although the conventional text classification techniques are applicable to the e-catalog classification as well, they cannot use the attribute information effectively to improve the classification accuracy. In this paper, we propose an e-catalog classification algorithm by extending Naïve Bayesian Classifier to use the attribute information. Specifically, we focus on exploiting two e-catalog specific characteristics: the attribute-wise keyword distribution and the category dependent attributes. Experiments on real data validate the proposed method.
A Fast Entry Path into User Microcode on the VAX-11/780
Authors: David Abrahamson
Venue: IEEE Micro (1983)

Entry time into the extended writable control store on the VAX-11/780 can be reduced to 200 nanoseconds by means of this simple hardware modification.
Exploring a Computer---Assisted Managing System with Competence Indicators in Taiwan
Authors: Yen-Shou Lai, Hung-Hsu Tsai, Yuan-Hou Chang, Pao-Ta Yu
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Grade 1-9 Curriculum connects elementary school and junior high school in Taiwan with Competence Indicators (CIs). CIs are the references for editing teaching materials, designing instruction, planning and implementing evaluation. Teachers can follow CIs while designing the teaching materials or offering supplement teaching materials. In order to allow the instructors to acquire suitable teaching materials from Internet and the students to access to the learning materials suitable for them from Internet, this study proposes a computer-assisted learning system which uses a clustering strategy to systematically access instructional materials according to learning map and CIs, so that correct learning components can be found efficiently and learning sequence can be designed effectively. This study takes numbers and quantities of mathematics at third grade students of elementary school as an example, then further investigate the changes of 32 students' mathematics achievement after learning. This study conclusion is that the students can enhance the learning effects by learning on their own.
Using Bounded Model Checking to Verify Consensus Algorithms
Authors: Tatsuhiro Tsuchiya, André Schiper
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

This paper presents an approach to automatic verification of asynchronous round-based consensus algorithms. We use model checking, a widely practiced verification method; but its application to asynchronous distributed algorithms is difficult because the state space of these algorithms is often infinite. The proposed approach addresses this difficulty by reducing the verification problem to small model checking problems that involve only single phases of algorithm execution. Because a phase consists of a finite number of rounds, bounded model checking, a technique using satisfiability solving, can be effectively used to solve these problems. The proposed approach allows us to model check some consensus algorithms up to around 10 processes.
HANNA: A Tool for Hardware Prototyping and Benchmarking of ANNs
Authors: Javier Garrigós, José J. Martínez, Javier Toledo, José M. Ferrández
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

The continuous advances in VLSI technologies, computer architecture and software development tools make it difficult to find the adequate implementation platform of an ANN for a given application. This paper describes HANNA, a software tool designed to automate the generation of hardware prototypes of MLP and MLP-like neural networks over FPGA devices. Coupled with traditional Matlab®/Simulink® environments the generated model can be synthesized, downloaded to the FPGA and co-simulated with the software version to trade off area, speed and precision requirements. The tool and our design methodology are validated through two examples.
Email Refresher: Defending against the Slow Slide toward Inefficiency
Authors: Linda Wilbanks
Venue: IT Professional (2008)

Email has become the dominant form of communication in the business world and far beyond. Yet, without conscious attention to how to use it effectively, this powerful tool can undermine efficiency and ultimately prove harmful to bottom-line needs.
The Effects of Customer Value on Loyalty and Profits in a Dynamic Competitive Market
Authors: Ting-Hua Chang, Jun-Yen Lee, Ru-Hwa Chen
Venue: Computational Economics (2008)

Providing high value products and services to customers normally leads to customer loyalty and profits. In practice, the relationship of customer value, loyalty, and profits can be observed in the market. However, the dynamic interactive relationships which lead to customer loyalty and profits still remain ambiguous. In this paper, the Agent-Based Computational Economics (ACE) model is introduced to explore the formation of customer loyalty in the Taiwanese imported lumber market. Using agents with reinforced learning algorithms in trading simulations, the effects of customer value on loyalty and profit are incorporated and examined in this interactive dynamic model. As results, the positive correlations among variables of customer value, loyalty, and profits are observed. A controlled experiment shows that changing customer value leads to changes in customer loyalty and profits, but price is not the determinant factor for improving customer loyalty. The R 2 values of customer loyalty and profits elucidate that they are increasing as the time lapsed elongate. Providing high value of products and services is a better strategy for suppliers to attract potential loyal customers.
Linked Local Visual Navigation and Robustness to Motor Noise and Route Displacement
Authors: Lincoln Smith, Andrew Philippides, Paul Graham, Phil Husbands
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

This paper presents an investigation into the robustness to motor noise of an insect-inspired visual navigation method that links together local view-based navigation in a series of visual locales automatically defined by the method. The method is tested in the real world using specialist robotic equipment that allows a controllable level of motor noise to be used. Extensions to the method, which can improve its robustness to severe motor noise and to major disruptions such as being displaced along its route, are investigated.
SVM Based Adaptive Inverse Controller for Excitation Control
Authors: Xiaofang Yuan, Yaonan Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

An adaptive inverse controller based on support vector machines (SVM) was designed for excitation control. Two SVM networks were utilized in the controller, one is SVM identifier (SVMI) and the other is SVM inverse controller (SVMC). The plant was identified by SVMI, which provided the sensitivity information of the plant to SVMC. SVMC was established using inverse system method as the pseudo-inverse model. Both SVMI and SVMC are offline learned firstly and are online trained using back propagation algorithm. To guarantee convergence and for faster learning, adaptive learning rates and convergence theorems are developed. Simulations show that this controller has better performance in system damping and transient improvement.
The Convertible Undeniable Multi-Signature Scheme Suitable for Digital Copyright Protection
Authors: SungHyun Yun, HeuiSeok Lim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In this paper, the convertible undeniable multisignature scheme is proposed. An undeniable signature scheme has a property that a verifier can not authenticate the signature of the document without help of the signer. An undeniable multi-signature scheme also has similar property that the signature of the document can not be verified without co-operation of all participating signers. The proposed convertible undeniable multi-signature scheme can convert the undeniable multi-signature to the ordinary multisignature. The authenticity of confidential document can only be verified with co-operation of all signers. If the document is no longer confidential, it can be opened to public use by converting the undeniable multi-signature on the document to the ordinary one. The proposed scheme satisfies undeniable property and can be applied to copyright protection of digital contents made by many authors.