ppxscal/embedding_network huggingface dataset:
Seeing the World through an Expert's Eyes: Context-Aware Display as a Training Companion
Authors: Marc T. Tomlinson, Michael Howe, Bradley C. Love
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Responsive Adaptive Display Anticipates Requests (RADAR) is a domain general system that learns to highlight an individual's preferred information displays, given the current context. Previous studies with human subjects in a video game environment demonstrate that RADAR is an effective cognitive aid. RADAR increases situation awareness and reduces cognitive load by anticipating and providing task relevant information. Additionally, because RADAR's fit to a user's behavior encapsulates the user's situation-driven information preferences, RADAR also excels as a descriptive and predictive assessment tool. Here, we focus RADAR as a training aid. We test the hypothesis that novices can benefit from training under a RADAR model derived from an expert's behavioral patterns. The results indicate that novices exposed to an expert's information preferences through RADAR rapidly learn to conform to the expert's preferences.
Poster abstract: Exploiting the LQI variance for rapid channel quality assessment
Authors: Carlo Alberto Boano, Thiemo Voigt, Adam Dunkels, Fredrik Osterlind, Nicolas Tsiftes, Luca Mottola, Pablo Suarez
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Communicating over a reliable radio channel is vital for an efficient resource usage in sensor networks: a bad radio channel can lead to poor application performance and higher energy consumption. Previous research has shown that the LQI mean value is a good estimator of the link quality. Nevertheless, due to its high variance, many packets are needed to obtain a reliable estimation. Based on experimental results, we show instead that the LQI variance is not a limitation. We show that the variance of the LQI can be used as a metric for a rapid channel quality assessment. Our initial results indicate that identifying good channels using the LQI variance requires an order of magnitude fewer packets than when using the mean LQI.
De-anonymizing Social Networks
Authors: Arvind Narayanan, Vitaly Shmatikov
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and data-mining researchers.Privacy is typically protected by anonymization, i.e., removing names, addresses, etc.We present a framework for analyzing privacy and anonymity in social networks and develop a new re-identification algorithm targeting anonymized social-network graphs.To demonstrate its effectiveness on real-world networks, we show that a third of the users who can be verified to have accounts on both Twitter, a popular microblogging service, and Flickr, an online photo-sharing site, can be re-identified in the anonymous Twitter graph with only a 12% error rate.Our de-anonymization algorithm is based purely on the network topology, does not require creation of a large number of dummy "sybil" nodes, is robust to noise and all existing defenses, and works even when the overlap between the target network and the adversary's auxiliary information is small.
A cognitive schema approach to diagnose intuitiveness: an application to onboard computers
Authors: Sandrine Fischer, Makoto Itoh, Toshiyuki Inagaki
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

Intuitive use is met when prior knowledge is transferred to new task environments. The empirical fact that transfer relies on schemas led us to diagnose intuitiveness based on schema induction. Two cognitive tasks were designed to make novice users perceive versus induce all the states of a prototype onboard computer. Subsequent interaction performances with the system validated the induction effect of the procedure and its interaction with familiarity, known as a primary factor of intuitive use. Implications for the diagnosis and the design of intuitive interfaces are discussed.
Modeling and Application of OPNET-Based Pipeline Stages for HF Channel Simulation
Authors: Song Yu, Jiang Xuping
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

HF communication plays an indispensable role in military communication with its characteristics of simple facility, rapid line construction and low cost of communication. HF channel simulation has always been a hot research subject in the field of HF communication. Owing to the particular features of HF channel, the default OPNET pipeline stages are not suitable for simulation. Based on the study of OPNET pipeline stages, this paper designs and implements a set of practical HF channel pipeline stages, with modification of pipeline stages as Receiver Group, Closure, Propagation Delay, Receiver Power and Background Noise. A typical HF communication network has been simulated by taking the modified HF channel pipeline stages into consideration. The simulation results indicate that the modified HF channel pipeline stages provide HF channel models available for HF communication networks.
Analysis of a symplectic difference scheme for a coupled nonlinear Schrödinger system
Authors: Tingchun Wang, Tao Nie, Luming Zhang
Venue: Journal of Computational and Applied Mathematics (2009)

In general, proofs of convergence and stability are difficult for symplectic schemes of nonlinear equations. In this paper, a symplectic difference scheme is proposed for an initial-boundary value problem of a coupled nonlinear Schrodinger system. An important lemma and an induction argument are used to prove the unique solvability, convergence and stability of numerical solutions. An iterative algorithm is also proposed for the symplectic scheme and its convergence is proved. Numerical examples show the efficiency of the symplectic scheme and the correction of our numerical analysis.
Cooperative behaviour-based complete exploration for an autonomous robot
Authors: Alberto Poncela
Venue: AI Communications (2009)

This thesis presents a navigation system to completely explore a total or partially unknown environment by an autonomous robot. It is based on three behaviours: Wall Following, Corridor Following and Door Crossing. The system works in indoor and dynamic environments. Its performance is efficient when using available resources, allowing its adaptation to changes. The complete exploration is achieved in an autonomous way.
Variations on Muchnik's Conditional Complexity Theorem
Authors: Daniil Musatov, Andrei Romashchenko, Alexander Shen
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

Muchnik's theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length and is simple conditional on b. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be generalized to prove a version of Muchnik's theorem for space-bounded Kolmogorov complexity.
Simulation-Based Predictive Control for Discrete Production System State
Authors: Guo-dong Wang, Ren-zhong Tang, Zhi-guo Wang, Yi Xie
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The production state could not be predicativecontrolled in discrete production enterprises, and the task was delayed. Based on the model of predictive control, an objectoriented approach was adopted to model and simulate the discrete production system. The method of simulation-based predictive control for discrete production system state was proposed to predict and display the throughput, equipment utilization, etc., of the system intuitively, in order to actualize effective control for the system parameter such as product flow, equipment amount, and operation time. The applicationshows that the method could improve the management ofproduction in plants observably and ensure the task to beaccomplished on schedule.
International Financial Reporting Standards: A Practical Guide, 5th edition
Authors: Hennie Van Greuning
Venue:  (2009)

International Financial Reporting Standards (IFRS) in a business situation can have a significant effect on the financial results and position of a division or an entire business enterprise. "International Financial Reporting Standards: A Practical Guide" gives private or public sector executives, managers, and financial analysts without a strong background in accounting the tools they need to participate in discussions and decisions on the appropriateness or application of IFRS. Each chapter summarizes an International Financial Reporting Standard, following a consistent structure: problems addressed by the IFRS; scope of the Standard; key concepts and definitions; accounting treatment; presentation and disclosure; and, financial analysis and interpretation. 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
From active towards InterActive learning: using consideration information to improve labeling correctness
Authors: Abraham Bernstein, Jiwen Li
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

Active learning methods have been proposed to reduce the labeling effort of human experts: based on the initially available labeled instances and information about the unlabeled data those algorithms choose only the most informative instances for labeling. They have been shown to significantly reduce the size of the required labeled dataset to generate a precise model [17]. However, active learning framework assumes "perfect" labelers, which is not true in practice (e.g., [22, 23]). In particular, an empirical study for hand-written digit recognition [5] has shown that active learning works poorly when a human labeler is used. Thus, as active learning enters the realm of practical applications, it will need to confront the practicalities and inaccuracies of human expert decision-making. Specifically, active learning approaches will have to deal with the problem that human experts are likely to make mistakes when labeling the selected instances.
ARWeather — An Augmented Reality Weather ystem
Authors: Marko Heinrich, Bruce H. Thomas, Stefan Mueller
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

This paper presents the design and development of an ARWeather simulation application, which can simulate various types of precipitation: rain, snow, and hail. We analysed various real occurrences weather types and how they could be simulated in a mobile Augmented Reality system. The Tinmith system is wearable computer system for the development and deployment of the final ARWeather system that allows for autonomous and free movement for the user. The users can move freely inside the simulated weather without limitation.
Books: That Perfect Algorithm for Any Occasion
Authors: William H. Press
Venue: IEEE Design Test (2009)

This is a book review of the Encyclopedia of Algorithms.
High Performance Analytics with the R3-Cache
Authors: Todd Eavis, Ruhan Sayeed
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Contemporary data warehouses now represent some of the world's largest databases. As these systems grow in size and complexity, however, it becomes increasingly difficult for brute force query processing approaches to meet the performance demands of end users. Certainly, improved indexing and more selective view materialization are helpful in this regard. Nevertheless, with warehouses moving into the multi-terabyte range, it is clear that the minimization of external memory accesses must be a primary performance objective. In this paper, we describe the R 3-cache, a natively multi-dimensional caching framework designed specifically to support sophisticated warehouse/OLAP environments. R 3-cache is based upon an in-memory version of the R-tree that has been extended to support buffer pages rather than disk blocks. A key strength of the R 3-cache is that it is able to utilize multi-dimensional fragments of previous query results so as to significantly minimize the frequency and scale of disk accesses. Moreover, the new caching model directly accommodates the standard relational storage model and provides mechanisms for pro-active updates that exploit the existence of query "hot spots". The current prototype has been evaluated as a component of the Sidera DBMS, a "shared nothing" parallel OLAP server designed for multi-terabyte analytics. Experimental results demonstrate significant performance improvements relative to simpler alternatives.
Traitor Tracing without A Priori Bound on the Coalition Size
Authors: Hongxia Jin, Serdar Pehlivanoglu
Venue: Proceedings of the 12th International Conference on Information Security (2009)

Traitor tracing is an essential mechanism for discouraging the piracy in digital content distribution. An adversarial model is identified as rebroadcasting the content encrypting keys or the content in the clear form. It is possible to fight against these piracy models by employing a fingerprinting code that gives a way to differentiate the encryption capability of each individual. We point three important characteristics of a fingerprinting code that affects its deployment in traitor tracing scheme against pirate rebroadcasting: (i) A robust fingerprinting code tolerates an adversary that chooses not to rebroadcast some messages. (ii) A tracing algorithm for fingerprinting code that does not require a priori upper-bound on coalition size to be successful in detecting a traitor. (iii) Extending the length of the fingerprinting code which refers to traitor-identification procedure of the code that doesn't depend on the length of the code or the distribution of the markings over the code.We presented the first traitor tracing scheme with formal analysis of its success in traitor-identification that doesn't assume a priori bound on a traitor-coalition size while at the same time it is possible to extend the code without degrading the success of traitor identification due to non-extended part. This construction also supports the robustness without requiring a high pirate rebroadcasting threshold.
A Dual-Purpose Real/Complex Logarithmic Number System ALU
Authors: Mark G. Arnold, Sylvain Collange
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advances in higher-order and multipartite table methods, together with cotransformation, allow real LNS ALUs to be implemented effectively on FPGAs for a wide variety of medium-precision special-purpose applications. The Complex LNS (CLNS) is a generalization of LNS which represents complex values in log-polar form. CLNS is a more compact representation than traditional rectangular methods, reducing the cost of busses and memory in intensive complex-number applications like the FFT; however, prior CLNS implementations were either slow CORDIC-based or expensive 2D-table-based approaches. This paper attempts to leverage the recent advances made in real-valued LNS units for the more specialized context of CLNS. This paper proposes a novel approach to reduce the cost of CLNS addition by re-using a conventional real-valued LNS ALU with specialized CLNS hardware that is smaller than the real-valued LNS ALU to which it is attached. The resulting ALU is much less expensive than prior fast CLNS units at the cost of some extra delay. The extra hardware added to the ALU is for trigonometric-related functions, and may be useful in LNS applications other than CLNS. The novel algorithm proposed here is implemented using the FloPoCo library (which incorporates recent HOTBM advances in function-unit generation), and FPGA synthesis results are reported.
Discontinuity-Adaptive Shape from Focus Using a Non-convex Prior
Authors: Krishnamurthy Ramnath, Ambasamudram N. Rajagopalan
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Shape from focus (SFF) is a widely used technique for determining the 3D structure of textured microscopic objects. However, SFF output depends critically on the number of observations used and the focus measure operator adopted. In this paper, we propose a new SFF method that can provide rich structure information given limited number of observations. We observe that depth is non-linearly related to the observations and pose the shape estimation as a minimization problem within a Maximum A Posteriori (MAP) - Markov Random Field (MRF) framework. We incorporate a discontinuity-adaptive MRF prior for the underlying structure. The resulting cost function is non-convex in nature which we minimize using Graduated non-convexity algorithm. When tested on synthetic as well as real objects, the results obtained are quite impressive.
StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures
Authors: Cédric Augonnet, Samuel Thibault, Raymond Namyst, Pierre-André Wacrenier
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In the field of HPC, the current hardware trend is to design multiprocessor architectures that feature heterogeneous technologies such as specialized coprocessors (e.g. Cell/BE SPUs) or data-parallel accelerators (e.g. GPGPUs).Approaching the theoretical performance of these architectures is a complex issue. Indeed, substantial efforts have already been devoted to efficiently offload parts of the computations. However, designing an execution model that unifies all computing units and associated embedded memory remains a main challenge.We have thus designed StarPU, an original runtime system providing a high-level, unified execution model tightly coupled with an expressive data management library. The main goal of StarPU is to provide numerical kernel designers with a convenient way to generate parallel tasks over heterogeneous hardware on the one hand, and easily develop and tune powerful scheduling algorithms on the other hand.We have developed several strategies that can be selected seamlessly at run time, and we have demonstrated their efficiency by analyzing the impact of those scheduling policies on several classical linear algebra algorithms that take advantage of multiple cores and GPUs at the same time. In addition to substantial improvements regarding execution times, we obtained consistent superlinear parallelism by actually exploiting the heterogeneous nature of the machine.
Bridging Language Modeling and Divergence from Randomness Models: A Log-Logistic Model for IR
Authors: Stéphane Clinchant, Eric Gaussier
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

We are interested in this paper in revisiting the Divergence from Randomness (DFR) approach to Information Retrieval (IR), so as to better understand the different contributions it relies on, and thus be able to simplify it. To do so, we first introduce an analytical characterization of heuristic retrieval constraints and review several DFR models wrt this characterization. This review shows that the first normalization principle of DFR is necessary to make the model compliant with retrieval constraints. We then show that the log-logistic distribution can be used to derive a simplified DFR model. Interestingly, this simplified model contains Language Models (LM) with Jelinek-Mercer smoothing. The relation we propose here is, to our knowledge, the first connection between the DFR and LM approaches. Lastly, we present experimental results obtained on several standard collections which validate the simplification and the model we propose.
Modelling and compact inversion of magnetic data: A Matlab code
Authors: S. Stocco, A. Godio, L. Sambuelli
Venue: Computers Geosciences (2009)

The modelling and inversion of the total magnetic field (TMF), its vertical gradient (VGTMF) and the vertical component of TMF (VMF) according to the basic principle to minimize the cross-sectional area of the source bodies are described. The software code, with an interactive graphical interface, operates in Matlab environment (version 7.0). The code of the inversion procedure is based on a weighted-damped least-squares algorithm, according to a criterion of balancing the weight of the data inaccuracies and the compactness of the solution. We have applied the approach to both synthetic and field data. This software can be used for didactical purposes or for a fast estimate of magnetic source bodies in archaeological and environmental prospecting.
Proposing Strategies to Prevent the Human Error in Automated Industrial Environments
Authors: José A. N. Neto, Maria F. Vieira, Charles Santoni, Daniel Scherer
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

This paper presents a process to conceive strategies to prevent the human error when operating industrial systems. The process adopts a broader view to error prevention, going beyond the error analysis to consider the user profile, the task and context description. The error classification is done according to a task execution cognitive model. The conceived strategies focus on the human interface component of those systems since it is this work's premise that the human interface design has a strong impact on the human error rate.