ppxscal/embedding_network huggingface dataset:
Does transparency strengthen legitimacy?
Authors: Deirdre Curtin Albert Jacob Meijer
Venue: Information Polity (2006)

Does enhanced transparency, through the Internet, boost the legitimacy of the EU? In this paper we present a critical perspective on the assumptions underlying the relation between transparency and legitimacy. We reconstruct three assumptions from EU policy documents - transparency strengthens input legitimacy, output legitimacy and social legitimacy - and then highlight several weaknesses. We conclude that transparency is a key element of democratic institutions but na&iuml;ve assumptions about the relation between transparency and legitimacy can and should be avoided. We warn against a simplified trust in the benefits of the Internet: enhancing legitimacy is much more complicated than creating fancy websites.
Cooperative Repositories for Formal Proofs
Authors: Pierre Corbineau, Cezary Kaliszyk
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

We present a new framework for the online development of formalized mathematics. This framework allows wiki-style collaboration while providing users with a rendered and browsable version of their work. We describe a prototype based on Coq, its web interface as implemented by the second author, and a modified version of the MediaWiki code-base. We discuss open issues such as dependencies and repository consistency. We explain limitations of the current prototype and we give a perspective towards a more robust solution.
Industrial Transportation Network by Utilization of a Pilot Cable with a Single Frequency
Authors: Dan Gogoncea, Lidia Cristea
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

This work presents a possibility for achieving automatic industrial transport with automated transport modules guided by pilot cables located in the floor utilising a single frequency. For the information flow, coils and Hall sensors are located on the transport modules and in the floor. A complete information graph is used to keeping track of the positions of all the automated transport modules and their relative position.
Order-batching methods for an order-picking warehouse with two cross aisles
Authors: Ying-Chin Ho, Teng-Sheng Su, Zhi-Bin Shi
Venue: Computers and Industrial Engineering (2008)

Order batching is one of the methods used in warehouses to minimize the travel distance of pickers. In this paper, we focus on developing order-batching methods for an order-picking warehouse with two cross aisles and an I/O point at one of its corners. Each of these methods is made up of one seed-order selection rule and one accompanying-order selection rule. Eleven seed-order selection rules and 14 accompanying-order selection rules are studied here. These rules include those newly proposed by us and those by others. Rules proposed by others have been shown to perform well in minimizing the travel distance of pickers. They are included here for the comparison purpose. Unlike previous studies that only focus on developing aisle or location-based rules, this study also develops rules that are distance- or area-based. In addition, two different route-planning methods and two different aisle-picking-frequency distributions are considered in this paper. This study's objective is to investigate not only the performance of seed-order selection rules and accompanying-order selection rules, but also the mutual effects between route-planning methods, aisle-picking-frequency distributions, seed-order selection rules, and accompanying-order selection rules on their performance. The result of this study shows that some of the newly proposed rules outperform those from other studies. It also shows that seed-order selection rules and accompanying-order selection rules significantly affect each other's performance. Lastly, the performance rankings of seed-order selection rules and accompanying-order selection rules are affected by aisle-picking-frequency distributions, but not by route-planning methods.
Interaction-driven Markov games for decentralized multiagent planning under uncertainty
Authors: Matthijs T. J. Spaan, Francisco S. Melo
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problems in which interaction among agents is a local phenomenon. To this purpose, we explicitly distinguish between situations in which agents should interact and situations in which they can afford to act independently. The agents are coupled through the joint rewards and joint transitions in the states in which they interact. The model combines several fundamental properties from transition-independent Dec-MDPs and weakly coupled MDPs while allowing to address, in several aspects, more general problems. We introduce a fast approximate solution method for planning in IDMGs, exploiting their particular structure, and we illustrate its successful application on several large multiagent tasks.
From RoboLab to Aibo: A Behavior-Based Interface for Educational Robotics
Authors: Rachel Goldman, M. Q. Azhar, Elizabeth Sklar
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

This paper describes a framework designed to broaden the entry-level for the use of sophisticated robots as educational platforms. The goal is to create a low-entry, high-ceiling programming environment that, through a graphical behavior-based interface, allows inexperienced users to author control programs for the Sony Aibo four-legged robot. To accomplish this end, we have extended the popular RoboLab application, which is a simple, icon-based programming environment originally designed to interface with the LEGO Mindstorms robot. Our extension is in the form of a set of "behavior icons" that users select within RoboLab, which are then converted to low-level commands that can be executed directly on the Aibo. Here, we present the underlying technical aspects of our system and demonstrate its feasibility for use in a classroom.
Efficient Group Key Agreement for Dynamic TETRA Networks
Authors: Su Mi Lee, Su Youn Lee, Dong Hoon Lee
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Terrestrial Trunked Radio (TETRA) is the most frequency-efficient standard for mobile communication and its architecture is fully scalable, from a large high-capacity system to a low-capacity system. In the TETRA standard, various attacks such as a reply attack can occur and the key-establishment scheme used in the TETRA standard requires high communication costs. In this paper, we propose an efficient group key agreement in TETRA networks that guarantees secure communication among light-weight mobile stations. That is, computation cost per mobile station is very low, only requires XOR operation on-line, and our scheme allows mobile stations and a base station to agree a group key with 1-round complexity.
Text Retrieval through Corrupted Queries
Authors: Juan Otero, Jesús Vilares, Manuel Vilares
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

Our work relies on the design and evaluation of experimental information retrieval systems able to cope with textual misspellings in queries. In contrast to previous proposals, commonly based on the consideration of spelling correction strategies and a word language model, we also report on the use of character n-grams as indexing support.
Security Threats to Automotive CAN Networks --- Practical Examples and Selected Short-Term Countermeasures
Authors: Tobias Hoppe, Stefan Kiltz, Jana Dittmann
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

The IT security of automotive systems is an evolving area of research. To analyse the current situation we performed several practical tests on recent automotive technology, focusing on automotive systems based on CAN bus technology. With respect to the results of these tests, in this paper we discuss selected countermeasures to address the basic weaknesses exploited in our tests and also give a short outlook to requirements, potential and restrictions of future, holistic approaches.
Creating 3D virtual sculptures from vision and touch technologies
Authors: Antonio Adán Oliver, Vicente Dominguez González, Ricardo Chacón Chacón, Santiago Salamanca Miño, Hector Rodriguez Muñoz
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

One of the lacks of the current conventional 3D sensor devices is that they are unable to carry out an efficient fusion between overlapped samples and generate complete and realistic reconstruction of an object (Figure 1). The completeness concerns both geometry and colour aspects (G+C). Consequently, obtaining whole (G+C) and precise registration of multiple views of an art piece is an unsolved and important problem which is required in museums and archaeological environments. In this paper we present a computer-human interactive system based on vision and touching technologies that allows us to obtain realistic 3D sculpture models. Following a global-to-local mixture strategy, millions of points with their respective colours, taken by a laser-scanner sensor, are integrated into a unique 3D model. After that, this model can be refined by a sculptor using a force-feedback device in which he can change geometrical, texture and colour properties. The final result is a high-quality restored virtual 3D model which can be exposed in museums or demanded by art researchers. An extensive experimentation is being carrying out on millennium sculptures and pieces of the Spanish National Museum of Roman Art yielding excellent results.
Web robot detection in the scholarly information environment
Authors: Paul Huntington, David Nicholas, Hamid R. Jamali
Venue: Journal of Information Science (2008)

An increasing number of robots harvest information on the world wide web for a wide variety of purposes. Protocols developed at the inception of the web laid out voluntary procedures in order to identify robot behaviour, and exclude it if necessary. Few robots now follow this protocol and it is now increasingly difficult to filter for this activity in reports of on-site activity. This paper seeks to demonstrate the issues involved in identifying robots and assessing their impact on usage in regard to a project which sought to establish the relative usage patterns of open access and non-open access articles in the Oxford University Press published journal Glycobiology, which offers in a single issue articles in both forms. A number of methods for identifying robots are compared and together these methods found that 40% of the raw logs of this journal could be attributed to robots.
Unsupervised Haplotype Reconstruction and LD Blocks Discovery in a Hidden Markov Framework
Authors: Alessandro Perina, Marco Cristani, Giovanni Malerba, Luciano Xumerle, Vittorio Murino, Pier Franco Pignatti
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In the last years haplotype reconstruction and haplotype blocks discovery, i.e., the estimation of patterns of linkage disequilibrium (LD) in the haplotypes, riveted the attention of the computer scientists due to the involved strong computational aspects. Such tasks are usually faced separately; recently, statistical generative techniques permitted to solve them jointly. Following this trend, we propose a generative framework based on hidden Markov processes, equipped with two novel inference strategies. The first strategy estimates finely haplotypes, while the second provides a quantitative measure to estimate LD blocks boundaries. Comparative real data results validate the proposed framework.
Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks
Authors: S. Sharmila Deva Selvi, S. Sree Vivek, Naga Naresh Karuturi, Ragavendran Gopalakrishnan, Pandu Rangan Chandrasekaran
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other alternatives, ID-based schemes are arguably the best suited for its implementation in wireless ad-hoc networks because of the unique advantage that they provide - any unique, publicly available parameter of a user can be his public key, which eliminates the need for a complex public key infrastructure. In 2004, Bohio et al. proposed an ID-based broadcast signcryption (IBBSC) scheme which achieves constant ciphertext size. They claim that their scheme provides both message authentication and confidentiality, but do not give formal proofs. In this paper, we demonstrate how a legitimate user of the scheme can forge a valid signcrypted ciphertext, as if generated by the broadcaster. Moreover, we show that their scheme is not IND-CCA secure. Following this, we propose a fix for Bohio et al.'s scheme, and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA). While fixing the scheme, we also improve its efficiency by reducing the ciphertext size to two elements compared to three.
An Architectural Comparison of 32-Bit Microprocessors
Authors: Amar Gupta, Hoo-min Toong
Venue: IEEE Micro (1983)

The supermicros have arrived. Their 32-bit structure-and their performance-quite justifiably earn them the name "micromainframes."
Segmentation of Hyperspectral Images for the Detection of Rotten Mandarins
Authors: J. Gómez-Sanchis, G. Camps-Valls, E. Moltó, L. Gómez-Chova, N. Aleixos, J. Blasco
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

The detection of rotten citrus in packing lines is carried out manually under ultraviolet illumination, which is dangerous for workers. Light emitted by the rotten region of the fruit due to the ultraviolet-induced fluorescence is used by the operator to detect the damages. This procedure is required because the low contrast between the damaged and sound skin under visible illumination difficult their detection. We study a set of techniques aimed to detect rottenness in citrususing visible and near infrared lighting trough an hyperspectral imaging system. Methods for selecting a proper set of wavelengths are investigated such as correlation analysis, mutual information, stepwise or genetic algorithms. The image segmentation relies on the combination of band selection techniques and pixel classification methods such as classification and regression trees and linear discriminant analysis.
The Trusted Execution Module: Commodity General-Purpose Trusted Computing
Authors: Victor Costan, Luis F. Sarmenta, Marten Dijk, Srinivas Devadas
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

This paper introduces the Trusted Execution Module (TEM); a high-level specification for a commodity chip that can execute user-supplied procedures in a trusted environment. The TEM is capable of securely executing partially-encrypted procedures/closures expressing arbitrary computation. These closures can be generated by any (potentially untrusted) party who knows the TEM's public encryption key. Compared to a conventional smartcard, which is typically used by pre-programming a limited set of domain- or application- specific commands onto the smartcard, and compared to the Trusted Platform Module (TPM), which is limited to a fixed set of cryptographic functions that cannot be combined to provide general-purpose trusted computing, the TEM is significantly more flexible. Yet we present a working implementation using existing inexpensive Javacard smartcards that does not require any export-restricted technology. The TEM's design enables a new style of programming, which in turn enables new applications. We show that the TEM's guarantees of secure execution enable exciting applications that include, but are not limited to, mobile agents, peer-to-peer multiplayer online games, and anonymous offline payments.
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
Authors: V. Rybakov
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We present a framework for constructing algorithms recognizing admissible inference rules (consecutions) in temporal logics with Until and Since based on Kripke/Hintikka structures modeling parallel time with common past. Logics $\mathcal{PTL}_\alpha$ with various branching factor $\alpha\in {\mathcal N} \cup \{\omega\}$ after common past are considered. The offered technique looks rather flexible, for instance, with similar approach we showed [33] that temporal logic based on sheafs of integer numbers with common origin is decidable by admissibility. In this paper we extend obtained algorithms to logics $\mathcal{PTL}_\alpha$. We prove that any logic $\mathcal{PTL}_\alpha$ is decidable w.r.t. admissible consecutions (inference rules), as a consequence, we solve satisfiability problem and show that any $\mathcal{PTL}_\alpha$ itself is decidable.
On the existence and uniqueness of the solution for a non-stationary transport equation
Authors: Nikos Mastorakis, Olga Martin
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

The neutron transport equation has a significant importance in the radiative transfer theory. In this paper we present a method that allows us to rewrite a mixed problem for an integral-differential equation in an operational form. The existence of a unique solution in a non-stationary case is proved using the concepts of the abstract functional analysis.
Caps: concurrent automatic programming system
Authors: Dennis Stevenson
Venue:  (2008)

In the past few years, the focus in microprocessors has shifted from increasing speed to creating processors that contain multiple cores. In order to effectively use the new processors, concurrent specifications and applications must be developed. Additionally, there are many applications that require the specifications to be provably correct. CAPS (Concurrent Automatic Programming System) is designed to aid the user in the creation, execution, and formal verification of concurrent specifications. The specification language of CAPS (CAPSL) is a very high-level language designed for concurrency and automatic conversion to a colored Petri net (CP-net). For each statement of the language, there exists a mapping to a colored Petri net. Once in the form of a CP-net, the specifications can be formally verified or a simulation can be run.
A trait based re-engineering technique for Java hierarchies
Authors: Lorenzo Bettini, Viviana Bono, Marco Naddeo
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

Traits are pure behavior components introduced in the Smalltalk community in order to integrate the traditional class inheritance with a composition mechanism: a class is composed by traits and inherits from superclasses. This offers the advantage of promoting code reuse. In this paper, we tackle the problem of re-engineering a Java hierarchy into traits, by adapting to a Java setting a methodology developed by Lienhard, Ducasse, and Ar&eacute;valo for a Smalltalk setting, based on Formal Concept Analysis. We illustrate the approach by applying it to the Java input stream library. We also obtain two by-products: (i) we identify clearly some workarounds that programmers must exploit in order to overcome some of the limitations of Java single inheritance; (ii) we single out some features a Java with traits might include, as none of the proposals in the literature in this sense has taken the lead yet.
Novel Coupled Map Lattice Model for Prediction of EEG Signal
Authors: Minfen Shen, Lanxin Lin, Guoliang Chang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Considering that electroencephalogram(EEG) signal is a typical chaotic signal induced from the nonlinear spatial temporal dynamic system, in this paper, we propose a new spatial temporal model combined couple map lattices(CML) with normalized radial basis function(NRBF), namely CML-NRBF model. NRBF neural network is employed to reconstruct the nonlinear map to obtain a more robust model with low sensitive for the selection of the basis function parameters. In particular, genetic algorithm (GA) is used to search for the optimal parameters of the proposed model, including the spatial coupling coefficients and the centers of NRBF network. The effectiveness of the proposed model is illustrated in terms of several experiments with real EEG by comparing the prediction and detection results of the presented model with the common RBF network.
Harmonic Variation of Edge Size in Meshing CAD Geometries from IGES Format
Authors: Maharavo Randrianarivony
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

We shall describe a mesh generation technique on a closed CAD surface composed of a few parametric surfaces. The edge size function is a fundamental entity in order to be able to apply the process of generalized Delaunay triangulation with respect to the first fundamental form. Unfortunately, the edge size function is not known a-priori in general. We describe an approach which invokes the Laplace-Beltrami operator to determine it. We will discuss theoretically the functionality of our methods. Our approach is illustrated by numerical results from the harmonicity of triangulations of some CAD objects. The IGES format is used in order to acquire the initial geometries.
Cross-Domain Mediation in Collaborative Filtering
Authors: Shlomo Berkovsky, Tsvi Kuflik, Francesco Ricci
Venue: Proceedings of the 11th international conference on User Modeling (2007)

One of the main problems of collaborative filtering recommenders is the sparsity of the ratings in the users-items matrix, and its negative effect on the prediction accuracy. This paper addresses this issue applying cross-domain mediation of collaborative user models, i.e., importing and aggregating vectors of users' ratings stored by collaborative systems operating in different application domains. The paper presents several mediation approaches and initial experimental evaluation demonstrating that the mediation can improve the accuracy of the generated predictions.
A Stock Portfolio Selection Method through Fuzzy Delphi
Authors: Mehdi Fasanghari, Gholam Ali Montazer
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

The evaluation and selection of stocks is one of the most important decision issues for stock market managers. Owing to vague concept frequently represented in decision data, an agent-based decision-making approach is proposed to solve the stock portfolio selection problem. In the proposed method, the experts' opinions are described by trapezoidal fuzzy numbers, and the Fuzzy Delphi method is adopted to adjust each expert's opinion to achieve the consensus condition. Finally, a practical example of stock portfolio selection in Tehran Stock Exchange (TSE) is demonstrated its engineering. The results show that the method is flexible and credible in stock market decision-making.