ppxscal/embedding_network huggingface dataset:
Towards a More Realistic Disclosure Risk Assessment
Authors: Jordi Nin, Javier Herranz, Vicenç Torra
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

The score was introduced in 2001 in order to compare different perturbative methods for statistical database protection. It measures the trade-off between utility (information loss) and privacy (disclosure risk of the released data). Since its introduction, the score has been widely accepted and used in the statistical database community. In particular, some methods are sometimes prefered to others depending on the obtained results in the original computation of the score.In this paper we argue that some original aspects of the score computation, specially those related to the disclosure risk, should be revisited. Informally, the reason is that they do not consider the best possible situation for the intruder, and so they do not measure the real level of privacy. We add some experimental results which support our claims. More importantly, we propose some modifications which can/should lead in the future to a more fair, realistic and useful computation of the score.
Information-driven sensor path planning and the treasure hunt problem
Authors: Silvia Ferrari
Venue:  (2008)

This dissertation presents a basic information-driven sensor management problem, referred to as treasure hunt, that is relevant to mobile-sensor applications such as mine hunting, monitoring, and surveillance. The objective is to classify/infer one or multiple fixed targets or treasures located in an obstacle-populated workspace by planning the path and a sequence of measurements of a robotic sensor installed on a mobile platform associated with the treasures distributed in the sensor workspace. The workspace is represented by a connectivity graph, where each node represents a possible sensor deployment, and the arcs represent possible sensor movements. A methodology is developed for planning the sensing strategy of a robotic sensor deployed. The sensing strategy includes the robotic sensor's path, because it determines which targets are measurable given a bounded field of view. Existing path planning techniques are not directly applicable to robots whose primary objective is to gather sensor measurements. Thus, in this dissertation, a novel approximate cell-decomposition approach is developed in which obstacles, targets, the sensor's platform and field of view are represented as closed and bounded subsets of an Euclidean workspace. The approach constructs a connectivity graph with observation cells that is pruned and transformed into a decision tree, from which an optimal sensing strategy can be computed. It is shown that an additive incremental-entropy function can be used to efficiently compute the expected information value of the measurement sequence over time. The methodology is applied to a robotic landmine classification problem and the board game of CLUE&reg;. In the landmine detection application, the optimal strategy of a robotic ground-penetrating radar is computed based on prior remote measurements and environmental information. Extensive numerical experiments show that this methodology outperforms shortest-path, complete-coverage, random, and grid search strategies, and is applicable to non-overpass capable platforms that must avoid targets as well as obstacles. The board game of CLUE&reg; is shown to be an excellent benchmark example of treasure hunt problem. The test results show that a player implementing the strategies developed in this dissertation outperforms players implementing Bayesian networks only, Q-learning, or constraint satisfaction, as well as human players.
Cognitive Methods for Visualizing Space, Time, and Agents
Authors: Angela M. Kessell, Barbara Tversky
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Visualizations of space, time, and agents (or objects) are ubiquitous in science, business, and everyday life, from weather maps to scheduling meetings. Effective communications, including visual ones, emerge from use in the field, but no conventional visualization form has yet emerged for this confluence of information. The real-world spiral of production, comprehension, and use that fine-tunes communications can be accelerated in the laboratory. Here we do so in search of effective visualizations of space, time, and agents. Users' production, preference, and performance aligned to favor matrix representations with time as rows or columns and space and agents as entries. Both the diagram type and the technique have broader applications.
Embedded Robot Operating Systems for Human-Robot Interaction
Authors: Taehoun Song, Jihwan Park, Soonmook Jung, Keyho Kwon, Jaewook Jeon
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

This paper focuses on the framework of the interface program that contains the controls and communication architectures to realize embedded robot operating systems for multi sensor system. The application builds the embedded operating system by using Mid Level Functions Layer for the robot's peripherals, and deploying a Low Level Functions Layer. The research proposes a hierarchical architecture for the user interface in order to realize an effective control command and status menu using an embedded sensor interface board. The operating system contained by an Ultrasonic and a Position sensing detector (PSD) and the operation of the Embedded Robot Operating System is implementation by Follow-Wall function. The proposed interface architecture gives easy and intuitive control of interaction with the robot and can be easily build to user interface program with multi sensor system.
Perturbation Analysis of the Combination Resonances of a Thin Cantilever Beam under Vertical Excitations
Authors: Dong-Jun Bang, Tae-Gun Jeong
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

It is useful to consider a thin cantilever beam to investigate the stability of nonlinear oscillations. When the thin cantilever beam is subjected to harmonic base excitation in vertical direction, it reveals many interesting behavior caused by nonlinear effect. In order to analyze the nonlinear oscillation phenomena, we derived two partial differential governing equations under combined parametric and external excitations and converted into two-degree-of-freedom ordinary differential Mathieu equations by using the Galerkin method. Among many perturbation techniques, we employed the method of multiple scales in order to analyze one-to-one combination resonance. We could obtain the eigenvalue problem and analyze the stability of the system. By representing the eigenvalues in nondimensional form, we could obtain the relationship between the eigenvalue and the amplitude ratio, which could explain the physical meaning of the eigenvalues. The real and imaginary plots with respect to the frequency detuning parameter could provide the stability criterion based on the eigenvalues.
Applying Safety Goals to a New Intensive Care Workstation System
Authors: Uwe Becker
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

In hospitals today, there is a trend towards the integration of different devices. Clinical workflow demands are growing for the integration of formally independent devices such as ventilator systems and patient monitoring systems. On one hand, this optimizes workflow and reduces training costs. On the other hand, testing complexity and effort required to ensure safety increase. This in turn gives rise to new challenges in the design of such systems. System designers must change their mindset because they are now designing a set of distributed systems instead of a single system which is only connected to a central monitoring system. In addition, the complexity of such workstation systems is much higher than that of individual devices. This paper presents a case-study on an intensive care workstation. To cope with this complexity, different use-cases have been devised and a set of safety goals have been defined for each use-case. The influence of the environment on the use-cases is highlighted and some measures to ensure data integrity within the workstation system are shown.
Engaging Characters at Art Interactive
Authors: Kathy Brew
Venue: IEEE MultiMedia (2004)

Media-based art exhibitions are becoming more and more prevalent in the cultural arena.After all, these are the tools of our times. However, even given this fact, there seems to be a prejudice against, or at the very least, a tendency away from, showing narrative work. Perhaps this is because it can be challenging and problematic to exhibit such work in public spaces, partially because the work is often meant to be experienced privately, as a single-user experience. 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
Card Images Binarization Based on Dual-Thresholding Identification
Authors: Chunmei Liu, Duoqian Miao, Chunheng Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, an algorithm is proposed for card images binarization. It is performed by three steps: coarse binarization, refined binarization, and postprocessing. Firstly, it uses the traditional global thresholding approach to separate a card image into several sub-images, which can be classified into two classes: text sub-images with clear background and text sub-images with complicated background. Secondly, the dual-thresholding is applied to regenerate or retouch the sub-images. According to the characteristics of text candidate sub-image, the thresholding method is selected and applied on it. Finally, the postprocessing is performed on the binary image. Experimental results demonstrate that this approach highly improved the performance of the card image binarization system.
Classification on Soft Labels Is Robust against Label Noise
Authors: Christian Thiel
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In a scenario of supervised classification of data, labeled training data is essential. Unfortunately, the process by which those labels are obtained is not error-free, for example due to human nature. The aim of this work is to find out what impact noise on the labels has, and we do so by artificially adding it. An algorithm for the noising procedure is described. Not only individual classifiers are studied, but also ensembles of classifiers whose answers are combined, increasing the overall performance. Also, we will answer the question if classifiers trained on soft labels are more resilient to label noise than those trained on hard labels.
Jacob Lorhard's Ontology: A 17th Century Hypertext on the Reality and Temporality of the World of Intelligibles
Authors: Peter Øhrstrøm, Henrik Schärfe, Sara L. Uckelman
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

Jacob Lorhard published his ontology in 1606. In this work the term ontologia `ontology' was used for the first time ever. In this paper, it is argued that Lorhard's ontology provides a useful key to the understanding of the early 17th-century world view in Protestant Europe. Among other things, Lorhard's ontology reflects how the relations between scientific investigation and religious belief were seen. It is also argued that several of the conceptual choices which Lorhard made in order to establish his ontology may still be relevant for modern makers of ontological systems. In particular, Lorhard's considerations on the notions of reality and time deserve modern reflections. Also his assumption of the educational value of diagrammatical ontology deserves a modern discussion. Along with this paper an online hypertext version of Lorhard's ontology has been presented in order to create a useful tool for historical research in early 17th-century thought and in order to illustrate the problems, which characterized the early attempt at establishing a diagrammatical approach to ontology.Note: References with just a page number (e.g. [p.17]) refer to the English translation of Lorhard's Ontology [7].
Simulating Electromagnetic NDT Probe Fields
Authors: Nathan Ida, William Lord
Venue: IEEE Computer Graphics and Applications (1983)

Using computer graphics and film technologies, engineers can now numerically model the nondestructive testing technique that detects flaws in the pressurized steam pipes of nuclear power plants.
Automatic Acquisition of Robot Motion and Sensor Models
Authors: A. Tuna Ozgelen, Elizabeth Sklar, Simon Parsons
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

For accurate self-localization using probabilistic techniques, robots require robust models of motion and sensor characteristics. Such models are sensitive to variations in lighting conditions, terrain and other factors like robot battery strength. Each of these factors can introduce variations in the level of noise considered by probabilistic techniques. Manually constructing models of noise is time-consuming, tedious and error-prone. We have been developing techniques for automatically acquiring such models, using the AIBO robot and a modified RoboCup Four-Legged League field with an overhead camera. This paper describes our techniques and presents preliminary results.
Research on Diversity Measure of Niche Genetic Algorithm
Authors: Lihua Yuan, Ming Li, Junhua Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Niche genetic algorithm (NGA) is superior to genetic algorithm (GA) in multiple hump function optimization. NGA could search all global optimums of multiple hump function in a running. It is a class of parallel evolutionary method which suppresses genetic drift by forming stable subpopulations to maintain population diversity. To algorithm population diversity plays an important role to avoid trapping in premature convergence. In this paper diversity methods and measures from the literature are introduced. An obvious contrast between NGA and GA has been analyzed in diversity. The results show that NGA is of good advantage to maintain diversity during different stage of the evolutionary process.
Permutation algorithms on optical multi-trees
Authors: Prasanta K. Jana, Koushik Sinha
Venue: Computers Mathematics with Applications (2008)

The Optical Multi-Trees (OMULT) is an interconnection network proposed by Sinha and Bandyopadhyay [B.P. Sinha, S. Bandyopadhyay, OMULT: An optical interconnection system for parallel computing, Lecture notes in Computer Science 3149 (2004) 302-312], for optoelectronic parallel computers. Various algorithms including matrix multiplication, DFT computation, sorting, prefix sum have been successfully mapped on this architecture. In this paper, we develop efficient parallel algorithms for some commonly used permutations namely, bit reversal, vector reversal, perfect shuffle, unshuffle and transpose on the OMULT network. Our algorithm for bit reversal permutation requires 8logn electronic moves +7 optical moves for n^2 data elements and O(n) electronic moves +3 optical moves for n^3 data elements; the vector reversal for n^3 data elements requires 3g(n) electronic moves +4 optical moves, where g(n) is the time for local vector reversal on n data elements; the perfect shuffle for n^3 data elements requires (3f(n)+8) electronic moves +8 optical moves, where f(n) is the time for local perfect shuffle on n data elements, and the transpose for n^3 data elements runs in at most three optical moves, all using 2n^3-n^2 processors.
RPC and REST: Dilemma, Disruption, and Displacement
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2008)

Technologists act as if the "REST vs. RPC" debate is purely technical, but technology choices are never really quite so black and white. This column examines the non-intuitive theories and evidence behind Clayton Christensen's "innovator's dilemma" to explore technology life cycles, discuss what makes different customers choose different technologies, and consider how different types of innovation affect the evolution of integration products.
Children's Interactions with Inspectable and Negotiated Learner Models
Authors: Alice Kerly, Susan Bull
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

The Learner Model of an Intelligent Tutoring System (ITS) may be made visible (opened) to its users. An Open Learner Model (OLM) may also become a learning resource in its own right, independently of an ITS. OLMs offer potential for learner reflection and support to metacognitive skills such as self-assessment, in addition to improving learner model accuracy. This paper describes an evaluation of an inspectable and a negotiated OLM (one that can be jointly maintained through student-system discussion) in terms of facilitating self-assessment accuracy and modification of model contents. Both inspectable and negotiated models offered significant support to users in increasing the accuracy of self-assessments, and reducing the number and magnitude of discrepancies between system and user beliefs about the user's knowledge. Negotiation of the model demonstrated further significant improvements.
A Rich-Media Solution for Distance Education
Authors: Michael L. Vasu, Ali O. Ozturk
Venue: Social Science Computer Review (2008)

MediaSite by Sonic Foundry is a web communication and content management system that automatically webcasts lectures and presentations. These presentations can be viewed as a live stream or as an archive over the Internet. MediaSite is frequently used to supplement traditional classes and distance education applications. In this review, the authors share their experience in using a rich-media tool MediaSite that added a great teaching quality and affectivity to an undergraduate survey methodology course within distance education format. Their experience leads them to believe that this technology can enhance a methods course such as survey research by providing visual reinforcement of what are otherwise textbook lectures. This is also true with respect to the expectations of assignments and reviews for final exams.
SAKE: Software Attestation for Key Establishment in Sensor Networks
Authors: Arvind Seshadri, Mark Luk, Adrian Perrig
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

This paper presents a protocol called SAKE (Software Attestation for Key Establishment), for establishing a shared key between any two neighboring nodes of a sensor network. SAKE guarantees the secrecy and authenticity of the key that is established, without requiring any prior authentic or secret information in either node. In other words, the attacker can read and modify the entire memory contents of both nodes before SAKE executes. Further, to the best of our knowledge, SAKE is the only protocol that can perform key re-establishment after sensor nodes are compromised, because the presence of the attacker's code in the memory of either protocol participant does not compromise the security of SAKE. Also, the attacker can perform any active or passive attack using an arbitrary number of malicious, colluding nodes. SAKE does not require any hardware modification to the sensor nodes, human mediation, or secure side channels. However, we do assume the setting of a computationally-limited attacker that does not introduce its own computationally powerful nodes into the sensor network.SAKE is based on ICE (Indisputable Code Execution), a primitive we introduce in previous work to dynamically establish a trusted execution environment on a remote, untrusted sensor node.
Supersingular Elliptic Curves in Cryptography
Authors: Alfred Menezes
Venue: Proceedings of the 1st international conference on Pairing-Based Cryptography: Pairing 2007 (2007)

I will survey the checkered history of supersingular elliptic curves in cryptography, from their first consideration in the seminal papers of Koblitz and Miller, to their rejection after the discovery of the Weil and Tate pairing attacks on the discrete logarithm problem for these curves, and concluding with their resurrection alongside the discovery of pairing-based cryptography.
Made-to-Measure Technologies for an Online Clothing Store
Authors: Frederic Cordier, Hyewon Seo, Nadia Magnenat-Thalmann
Venue: IEEE Computer Graphics and Applications (2003)

The authors present a Web application that provides more powerful access and manipulation of garment related items to facilitate garment design, pattern derivation, and sizing. A significant step in this process is the application of 3D graphics technology to help create and simulate the virtual store. In this article, the authors discuss various relevant research problems, the creation of a shopper's body and garments, simulation of body and garment movement, and online sizing.
Petri Net-Based Episode Detection and Story Generation from Ubiquitous Life Log
Authors: Young-Seol Lee, Sung-Bae Cho
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

As mobile devices improve their performance in ubiquitous spaces, they have a variety of applications with more information. Active exploration follows for collecting and utilizing the information accumulated in ubiquitous environment. If user information in mobile devices can be summarized in a more intuitive and interesting form, like cartoon, it can help to share his experience with other people, and recall his meaningful memory. In this paper, we propose a method that organizes a story and generates cartoons using the information collected in ubiquitous environment. We generate cartoons with Petri net-based method, which describes causal relationship between experienced events and the precondition of events. Mobile information used in the experiment is collected from two female undergraduate students for two weeks. We confirm the potential of the proposed method for ambient intelligence through the analysis of the results.
Imagination: Exploiting Link Analysis for Accurate Image Annotation
Authors: Ilaria Bartolini, Paolo Ciaccia
Venue: Adaptive Multimedial Retrieval: Retrieval, User, and Semantics: 5th International Workshop, AMR 2007, Paris, France, July 5-6, 2007 Revised Selected Papers (2007)

The advent of digital photography calls for effective techniques for managing growing amounts of color images. Systems that only rely on low-level image features are nowadays limited by the semantic gap problem, which leads to a mismatch between the user subjective notion of similarity and the one adopted by a system. A possible way to reduce the semantic gap is to (semi-)automatically assign meaningful terms to images, so as to enable a high-level, concept-based, retrieval. In this paper we explore the opportunities offered by graph-based link analysis techniques in the development of a semi-automatic image captioning system. The approach we propose is appealing since the predicted terms for an image are in variable number, depending on the image content, represent correlated terms, and can also describe abstract concepts. We present preliminary results on our prototype system and discuss possible extensions.