ppxscal/embedding_network huggingface dataset:
A Cellular Automata-Ready GIS Infrastructure for Geosimulation and Territorial Analysis
Authors: Ivan Blecic, Andrea Borruso, Arnaldo Cecchini, Antonio D'Argenio, Fabio Montagnino, Giuseppe A. Trunfio
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This paper presents an integrated GIS and cellular automata (CA) modelling and simulation environment. We hold that several concurrent facts offer the necessary critical mass to foster the development of robust and scalable general-purpose CA-modelling tools that go beyond demonstrative proof-of-concept status, allowing thus fully operational modelling and simulation of real-world territorial systems. Among these facts, we can mention the entering of the CA-based geosimulation modelling in its age of maturity, the growing computational capabilities of nowadays computers, the consolidation of general-purpose as well as specialised GIS-based geo-analysis methodologies and their availability as open-source libraries and applications. The environment hereby described is an example of a way to obtain such robust and general-purpose CA-modelling tool-box. Its main characteristics are (1) tight interoperability between GIS and CAs, (2) a sufficiently generalised and flexible underlying CA meta-model allowing for the implementation of a variety of types of CA models, (3) computationally efficiency and (4) user-friendliness. We furthermore present two test case applications to illustrate a standard operational modelling workflow within this simulation environment and to briefly illustrate its look-and-feel.
The Influence of Social Interaction on the Perception of Emotional Expression: A Case Study with a Robot Head
Authors: John C. Murray, Lola Cañamero, Kim A. Bard, Marina Davila Ross, Kate Thorsteinsson
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

In this paper we focus primarily on the influence that socio-emotional interaction has on the perception of emotional expression by a robot. We also investigate and discuss the importance of emotion expression in socially interactive situations involving human robot interaction (HRI), and show the importance of utilising emotion expression when dealing with interactive robots, that are to learn and develop in socially situated environments. We discuss early expressional development and the function of emotion in communication in humans and how this can improve HRI communications. Finally we provide experimental results showing how emotion-rich interaction via emotion expression can affect the HRI process by providing additional information.
Professional PHP6
Authors: Ed Lecky-Thompson, Steven D. Nowicki
Venue:  (2009)

Publishing in tandem with the long-awaited release of PHP 6, this book reveals the inside scoop for pushing the limits of how to maximize the full feature set of PHP 6. Youll learn how to use PHP 6 in the larger scheme of enterprise-class software development and practical examples and behind-the-scenes information will improve your skills for designing and building better large-scale, high-performance platforms using PHP 6.
A Secure Spontaneous Ad-Hoc Network to Share Internet Access
Authors: Raquel Lacuesta, Jaime Lloret, Miguel Garcia, Lourdes Peñalver
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

In this paper, we propose a secure spontaneous ad-hoc network to grant the access of the users to surf the Web. The paper shows the description of our proposal, the procedure of the nodes involved in the system and the designed messages. We also validate the success of our proposal through several simulations and comparisons with a regular architecture. The proposal has been developed with the main objective of improving the communication and integration between different study centers of low resource communities.
Stochastic k-Coverage in Wireless Sensor Networks
Authors: Habib M. Ammari
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Sensor scheduling is a critical issue in the design of wireless sensor networks (WSNs) with a goal to achieve certain coverage degree of a field. In this paper, we focus on the sensor scheduling problem to guarantee sensing k-coverage, where each point in a field is covered by at least k sensors, while maintaining network connectivity. Precisely, we propose a global framework that considers both deterministic and stochastic sensing models of the sensors. For each of these sensing models, we decompose the sensor scheduling problem for k-coverage in WSNs into two sub-problems: k-coverage characterization problem and k-coverage-preserving scheduling problem. Our solution to the first problem is based on Helly's Theorem and the analysis of a geometric structure, called Reuleaux triangle. To solve the second problem, we propose a distributed approach that enables each sensor to run a k-coverage candidacy algorithm to check whether it is eligible to turn itself on. We find a perfect match between our simulation and analytical results.
Towards a Theory of Cultural Usability: A Comparison of ADA and CM-U Theory
Authors: Torkil Clemmensen
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Cultural models in terms of the characteristics and content of folk theories and folk psychology have been important to social scientists for centuries. From Wilhelm Wundt's Volkerpsychologie to the distributed and situated cognition theorists in the global world of today, thinkers have seen human action as being controlled by cultural models. The study of cultural models for humans interacting with computers should thus be at the heart of the scientific study of human-computer interaction (HCI). This paper presents a theory of cultural usability that builds on the concept of Cultural Models of Use (CM-U theory). The theory is compared to existing Artifact Development Analysis (ADA) theory to identify its sensitivity to explain cultural usability phenomena. The conclusion is that a) the theory can account for empirical findings on cultural usability, and b) CM-U and ADA theories seem to fit different user populations' perception of usability.
A Methodology for Modeling the Influence of Construction Machinery Operators on Productivity and Fuel Consumption
Authors: Reno Filla
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

This paper is concerned with modeling the actions of a human operator of construction machinery and integrating this operator model into a large, complex simulation model of the complete machine and its environment. Because human operators to a large degree affect how the machine is run, adaptive operator models are a necessity when the simulation goal is quantification and optimization of productivity and energy efficiency. Interview studies and test series have been performed to determine how professionals operate wheel loaders. Two models using different approaches were realized and integrated into a multi-domain model for dynamic simulation. The results are satisfactory and the methodology is easily usable for other, similar situations.
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
Authors: Avner Magen, Mohammad Moharrami
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

This work provides a Linear Programming-based Polynomial Time Approximation Scheme (PTAS) for two classical NP-hard problems on graphs when the input graph is guaranteed to be planar, or more generally Minor Free. The algorithm applies a sufficiently large number (some function of when approximation is required) of rounds of the so-called Sherali-Adams Lift-and-Project system. needed to obtain a -approximation, where f is some function that depends only on the graph that should be avoided as a minor. The problem we discuss are the well-studied problems, the and problems. An curious fact we expose is that in the world of minor-free graph, the is harder in some sense than the .Our main result shows how to get a PTAS for in the more general "noisy setting" in which input graphs are not assumed to be planar/minor-free, but only close to being so. In this setting we bound integrality gaps by , which in turn provides a approximation of the optimum value; however we don't know how to actually find a solution with this approximation guarantee. While there are known combinatorial algorithms for the non-noisy setting of the above graph problems, we know of no previous approximation algorithms in the noisy setting. Further, we give evidence that current combinatorial techniques will fail to generalize to this noisy setting.
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Authors: Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We present a succinct representation of a set of n points on an n×n grid using $n\lg n + o(n\lg n)$ bits to support orthogonal range counting in $O(\lg n /\lg\lg n)$ time, and range reporting in $O(k\lg n/\lg\lg n)$ time, where k is the size of the output. This achieves an improvement on query time by a factor of $\lg\lg n$ upon the previous result of Mäkinen and Navarro [1], while using essentially the information-theoretic minimum space. Our data structure not only can be used as a key component in solutions to the general orthogonal range search problem to save storage cost, but also has applications in text indexing. In particular, we apply it to improve two previous space-efficient text indexes that support substring search [2] and position-restricted substring search [1]. We also use it to extend previous results on succinct representations of sequences of small integers, and to design succinct data structures supporting certain types of orthogonal range query in the plane.
More Anonymous Onion Routing Through Trust
Authors: Aaron Johnson, Paul Syverson
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

We consider using trust information to improve the anonymity provided byonion-routing networks. In particular, we introduce a model of trustin network nodes and use it to design path-selection strategies thatminimize the probability that the adversary can successfully control the entrance to and exit from the network.This minimizes the chance that the adversary can observe and correlate patterns in the data flowing over the path and thereby deanonymize the user. We first describe the general case in whichonion routers can be assigned arbitrary levels of trust.Selecting a strategy can be formulated in a straightforward way as a linear program,but it is exponential in size.We thus analyze a natural simplificationof path selection for this case. More importantly, however, whenchoosing routes in practice, only a very coarse assessment of trustin specific onion routers is likely to be feasible.Therefore, we focusnext on the special case in which there are only two trustlevels. For this more practical case we identify threeoptimal route-selection strategies such that at least one is optimal, depending on thetrust levels of the two classes, their size, and the reach of theadversary. This can yieldpractical input into routing decisions. We set out the relevant parameters and choices for makingsuch decisions.
Minimizing disk I/O in two-bit breadth-first search
Authors: Richard E. Korf
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We present a breadth-first search algorithm, two-bit breadth-first search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in several ways, and can store its data on magnetic disk. Using TBBFS, we perform complete breadth-first searches of the original pancake problem with 14 and 15 pancakes, and the burned pancake problem with 11 and 12 pancakes, determining the diameter of these problem spaces for the first time. We also performed a complete breadth-first search of the subspace of Rubik's Cube determined by the edge cubies.
What is coreference, and what should coreference annotation be?
Authors: Kees van Deemter, Rodger Kibble
Venue: Proceedings of the Workshop on Coreference and its Applications (1999)

In this paper, it is argued that 'coreference annotation', as currently performed in the MUC community, goes well beyond annotation of the relation of coreference as it is commonly understood. As a result, it is not always clear what semantic relation these annotations are actually encoding. The paper discusses a number of interrelated problems with coreference annotation and concludes that rethinking of the coreference task is needed before the task can be expanded (e.g., to cover part/whole relations) as has recently been advocated. As a step towards solution of the problems with coreference annotation, one possible simplification of the annotation task is suggested. This strategy can be summed up by the phrase "Coreference annotation should annotate coreference relations, and coreference relations only".
Testable design of AND-EXOR logic networks with universal test sets
Authors: Hafizur Rahaman, Debesh K. Das, Bhargab B. Bhattacharya
Venue: Computers and Electrical Engineering (2009)

This paper presents a testability enhancement technique suited for AND-EXOR based logic networks that facilitates easy detection of stuck-at and bridging faults by a universal test set. Both cascaded and tree implementations of the EXOR-part are considered. The AND-EXOR based circuit implemented with a cascaded EXOR-part requires a universal test set of size (2n+6) for an n-variable function implementation. For Generalized Reed-Muller (GRM) implementation, this test set detects all single stuck-at and bridging faults (both OR-type and AND-type) and also large number of multiple bridging faults. For an Exclusive-OR Sum-of-Products (ESOP) implementation, a few single bridging faults may remain untested under this test set, occurrence of which can be minimized by employing an appropriate design and layout technique. Next, it is shown that an AND-EXOR network with a tree-based EXOR-part can be tested for similar faults by a universal test set of size (2n+8). This paper also solves an open problem of designing a universal test for a tree-based AND-EXOR circuit. Since the EXOR-tree has depth of (@?log"2s@?+1), where s is the number of product terms in the given AND-EXOR expression, this tree-based design reduces the circuit delay significantly compared to cascaded EXOR implementation. In both the cases, the test set can be stored in a ROM on-chip for built-in self-test (BIST) purposes. For several benchmark circuits, the universal test set is found to be much smaller in size than the ATPG-generated test sets.
Spejd: A Shallow Processing and Morphological Disambiguation Tool
Authors: Aleksander Buczyński, Adam Przepiórkowski
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

This article presents a formalism and a beta version of a new tool for simultaneous morphosyntactic disambiguation and shallow parsing. Unlike in the case of other shallow parsing formalisms, the rules of the grammar allow for explicit morphosyntactic disambiguation statements, independently of structure-building statements, which facilitates the task of the shallow parsing of morphosyntactically ambiguous or erroneously disambiguated input.
Methods Supporting Product Modular Design for Assembly
Authors: Xiaoyan Teng, Fankai Kong, Jiatai Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

To manage the complexities of module partitions, a new approach to the partitions of hierarchical modules for products is proposed. Based on the assembly and manufacture process, it determines the hierarchy and basis of the module partition first, and then according to the type of connection between the parts of the block module, the degree of membership for the rational connection is gained and the fuzzy relation matrix between different parts is established. It uses the fuzzy clustering techniques to partition the modules, and then uses the method of grey comprehensive assessment to choose relative reasonable scheme. Combining with a concrete mechanical example, the systematic approach could be well adapted to the generation of product modularization for the assembly and manufacture process. Compared with other optimal algorithm, it endows with some characteristics such as simplicity and superiority.
Intel's New AES Instructions for Enhanced Performance and Security
Authors: Shay Gueron
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

The Advanced Encryption Standard (AES) is the Federal Information Processing Standard for symmetric encryption. It is widely believed to be secure and efficient, and is therefore broadly accepted as the standard for both government and industry applications. If fact, almost any new protocol requiring symmetric encryption supports AES, and many existing systems that were originally designed with other symmetric encryption algorithms are being converted to AES. Given the popularity of AES and its expected long term importance, improving AES performance and security has significant benefits for the PC client and server platforms. To this end, Intel is introducing a new set of instructions into the next generation of its processors, starting from 2009. The new architecture has six instructions: four instructions (AESENC, AESENCLAST, AESDEC, and AESDELAST) facilitate high performance AES encryption and decryption, and the other two (AESIMC and AESKEYGENASSIST) support the AES key expansion. Together, these instructions provide full hardware support for AES, offering high performance, enhanced security, and a great deal of software usage flexibility, and are therefore useful for a wide range of cryptographic applications. The AES instructions can support AES encryption and decryption with each one of the standard key lengths (128, 192, and 256 bits), using the standard block size of 128 bits. They can also be used for all other block sizes of the general RIJNDAEL cipher. The instructions are well suited to all common uses of AES, including bulk encryption/decryption using cipher modes such as ECB, CBC and CTR, data authentication using CBC-MACs (e.g., CMAC), random number generation using algorithms such as CTR-DRBG, and authenticated encryption using modes such as GCM. Beyond improving performance, the AES instructions provide important security benefits. Since the instructions run in data independent time and do not use table lookups, they help eliminating the major timing and cache-based attacks that threaten table-lookup based software implementations of AES. In addition, these instructions make AES simple to implement, with reduced code size. This helps reducing the risk of inadvertent introduction of security flaws, such as difficult-to-detect side channel leaks. This paper provides an overview of the new AES instructions and how they can be used for achieving high performance and secure AES processing. Some special usage models of this architecture are also described.
Modular over-the-wire configurable security for long-lived critical infrastructure monitoring systems
Authors: Erik Solum, Carl Hauser, Rasika Chakravarthy, Dave Bakken
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

This paper presents a modular, software-based, over-the-wire configurable, end-to-end security architecture for critical infrastructure monitoring systems. The architecture provides mechanisms allowing it to evolve, during operation, over the long lifetimes typically encountered in these systems by allowing security modules to be securely added and replaced at runtime. Our security architecture addresses these systems' need for high-performance secure multi-cast with modules for confidentiality, integrity, authentication, and obfuscation. The variety of available modules provides tradeoffs between performance and security now and for the future. Experimental performance results for various existing modules, in the context of the architecture, are presented. To achieve long system lifetime a secure management system, using protocols based on symmetric-key cryptography, is described.
A Novel Cache Organization for Tiled Chip Multiprocessor
Authors: Xi Zhang, Dongsheng Wang, Yibo Xue, Haixia Wang, Jinglei Wang
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

Increased device density and working set size are driving a rise in cache capacity, which comes at the cost of high access latency. Based on the characteristic of shared data, which is accessed frequently and consumes a little capacity, a novel two-level directory organization is proposed to minimize the cache access time in this paper. In this scheme, a small Fast Directory is used to offer fast hits for a great fraction of memory accesses. Detailed simulation results show that on a 16-core tiled chip multiprocessor, this approach reduces average access latency by 17.9% compared to the general cache organization, and improves the overall performance by 13.3% on average.
Linking Life Sciences Data Using Graph-Based Mapping
Authors: Jan Taubert, Matthew Hindle, Artem Lysenko, Jochen Weile, Jacob Köhler, Christopher J. Rawlings
Venue: Proceedings of the 6th International Workshop on Data Integration in the Life Sciences (2009)

There are over 1100 different databases available containing primary and derived data of interest to research biologists. It is inevitable that many of these databases contain overlapping, related or conflicting information. Data integration methods are being developed to address these issues by providing a consolidated view over multiple databases. However, a key challenge for data integration is the identification of links between closely related entries in different life sciences databases when there is no direct information that provides a reliable cross-reference. Here we describe and evaluate three data integration methods to address this challenge in the context of a graph-based data integration framework (the ONDEX system). A key result presented in this paper is a quantitative evaluation of their performance in two different situations: the integration and analysis of different metabolic pathways resources and the mapping of equivalent elements between the Gene Ontology and a nomenclature describing enzyme function.
Robust Monocular Egomotion Estimation Based on an IEKF
Authors: Frank Pagel
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

In this contribution a robust approach for the estimation of the camera motion is presented. For this purpose, features from a monocular image sequence are extracted and evaluated so that the threedimensional path of a moving camera can be calculated. The algorithm gives robust results even in the presence of noise and independently moving objects. The two different categories of constraint equations used in the proposed algorithm are the epipolar constraint and the trilinear constraints. The optimization of the constraints with respect to the motion parameters is implemented as a robust Iterated Extended Kalman Filter. Test results are presented from real data, captured from a moving vehicle in an urban scenario.