ppxscal/embedding_network huggingface dataset:
Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter
Authors: Yu Zhang, Hong Shen, Hui Tian, Xianchao Zhang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The duplicate-insensitive and time-decayed sum of an arbitrary subset in a stream is an important aggregation for various analyses in many distributed stream scenarios. In general, precisely providing this sum in an unbounded and high-rate stream is infeasible. Therefore, we target at this problem and introduce a sketch, namely, time-decaying Bloom Filter (TDBF). The TDBF can detect duplicates in a stream and meanwhile dynamically maintain decayed-weight of all distinct elements in the stream according to a user-specified decay function. For a query for the current decayed sum of a subset in the stream, TDBF provides an effective estimation. In our theoretical analysis, a provably approximate guarantee has been given for the error of the estimation. In addition, the experimental results on synthetic stream validate our theoretical analysis.
Name perplexity
Authors: Octavian Popescu
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

The accuracy of a Cross Document Coreference system depends on the amount of context available, which is a parameter that varies greatly from corpora to corpora. This paper presents a statistical model for computing name perplexity classes. For each perplexity class, the prior probability of coreference is estimated. The amount of context required for coreference is controlled by the prior coreference probability. We show that the prior probability coreference is an important factor for maintaining a good balance between precision and recall for cross document coreference systems.
Context Awareness and Perceived Interactivity in Multimedia Computing
Authors: Xiao Dong, Pei-Luen Patrick Rau
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

Context awareness and perceived interactivity are two factors that might benefit mobile multimedia computing. This research takes mobile TV advertisements as a scenario and verifies the impacts of perceived interactivity and its interaction with context awareness. Seventy-two participants were recruited and an experiment was conducted in order to identify those impacts. The main findings indicated the following: (1) the effect of high perceived interactivity advertisement is significantly better than the effect of low perceived interactivity advertisement; (2) the interaction of context awareness and perceived interactivity has a significant influence on the effect of mobile TV advertising.
Examining human values in adopting ubiquitous technology in school
Authors: Minna Isomursu, Mari Ervasti, Marianne Kinnula, Pekka Isomursu
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

This paper summarizes value analysis of adopting technology-supported attendance control service in a primary school. The results are based on a case study that explored a 14-week trial where two classes of elementary school children used an attendance control system that was implemented using networked technology components, including smart cards, NFC enabled mobile phones and card readers, a web-portal, and SMS messaging. The findings from the trial are analyzed from the viewpoint of three end user groups, namely children, parents and teachers. Value modeling adopted from social psychology is used for interpreting the perceived value for each user group.
An automated distributed meeting scheduler for FCVW plug-in
Authors: Hsiang-Hwa Koo, Elhadi Shakshuki
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

People have faced conflicts for shifting scheduled meetings to other time slots in order to fit incoming meetings or to find a time slot to book a meeting. The goal of this research is to develop a personal distributed meeting scheduler in FCVW (Federated Collaborative Virtual Workspace) that assists users to deal with these situations. FCVW is an extension of CVW [6] developed by MITRE. In our approach to meeting scheduling, is to provide each user with meeting scheduler agent. Each agent is able to manage, negotiate and schedule tasks, meetings, events, appointments for its user. This paper describes the objective of our research to develop an automated distributed meeting scheduler.
Near-optimal Bayesian localization via incoherence and sparsity
Authors: Volkan Cevher, Petros Boufounos, Richard G. Baraniuk, Anna C. Gilbert, Martin J. Strauss
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework for the localization problem and provide sparse approximations to its optimal solution. By exploiting the spatial sparsity of the posterior density, we demonstrate that the optimal solution can be computed using fast sparse approximation algorithms. We show that exploiting the signal sparsity can reduce the sensing and computational cost on the sensors, as well as the communication bandwidth. We further illustrate that the sparsity of the source locations can be exploited to decentralize the computation of the source locations and reduce the sensor communications even further. We also discuss how recent results in 1-bit compressive sensing can significantly reduce the amount of inter-sensor communications by transmitting only the intrinsic timing information. Finally, we develop a computationally efficient algorithm for bearing estimation using a network of sensors with provable guarantees.
FutureTrust Algorithm in Specific Factors on Mobile Agents
Authors: Michał Wolski, Mieczysław Kłopotek
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

In this paper we made a comparative analysis of the well-known reputation systems with our proposal in the light of external factors. We present a new meta-heuristic formula to use in reputation systems and show how different well-known global and local reputation metrics are optimized by it. The presented experiments are to continue our research into the behavior of mobile agents in an open environment.
Merging Virtual and Real Worlds --- Holistic Concepts for the Office of the Future
Authors: Hermann Hartenthaler
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

Information, communication, media, building and security technologies are growing together. The key to the integration of all infrastructure systems is the use of IP in all technical systems. The real and the virtual worlds are merging. This means that the real world around us and the world of IT systems are connected to one another. This paper shows how these concepts can be implemented in an innovative office infrastructure to increase the efficiency in the office.
Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction
Authors: Shinya Umeno
Venue: Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems (2009)

We present machine-assisted timing-parameter synthesis of the biphase mark protocol (BMP) [1] using event order abstraction (EOA)[2]. By using EOA, we separate the task of synthesizing parameter constraints that guarantee key safety properties of BMP into two parts: 1. Safety property verification of the protocol by a conventional untimed model-checker under the condition that "bad" event orders do not occur; and 2. Derivation of timing parameter constraints that are sufficient to exclude bad event orders in the protocol, using our tool MeTEOrS. Though the user has to provide information about bad event orders, the rest of the synthesis process is automated. With the case study presented in this paper, we provide the community with two new pieces of information about BMP. First, the synthesis process using EOA produces, as a by-product, a list of all "bad scenarios" of BMP that would happen when parameters are tuned incorrectly. Second, the MeTEOrS tool provides information about which parameter constraint in the finally derived conjunction of constraints is actually sufficient to exclude each of these bad scenarios. 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
Learning field compatibilities to extract database records from unstructured text
Authors: Michael Wick, Aron Culotta, Andrew McCallum
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper presents a record extraction system that assembles mentions into records (i.e. database tuples). We construct a probabilistic model of the compatibility between field values, then employ graph partitioning algorithms to cluster fields into cohesive records. We also investigate compatibility functions over sets of fields, rather than simply pairs of fields, to examine how higher representational power can impact performance. We apply our techniques to the task of extracting contact records from faculty and student homepages, demonstrating a 53% error reduction over baseline approaches.
Robustness considerations in selecting efficient two-color microarray designs
Authors: A. H. M. Mahbub Latif, Frank Bretz, Edgar Brunner
Venue: Bioinformatics (2009)

The main goal of microarray experiments is to select a small subset of genes that are differentially expressed among competing mRNA samples. For a given set of such mRNA samples, it is possible to consider a number of two-color cDNA microarray designs with a fixed number of arrays. Appropriate criteria can be used to select an efficient design from such a set of alternative experimental designs. In practice, however, microarray expression data often contain missing observations and the most efficient design (with complete observations) for a specific setup may not be efficient in the presence of missing observations. In this article, we propose two criteria to address the robustness of microarray designs against missing observations. We demonstrate the simultaneous use of efficiency and robustness criteria to select good microarray designs for both one-factor and multi-factor experiments. Contact: mlatif@isrt.ac.bd
Finding Object Depth Using Stereoscopic Photography
Authors: Yu-Hua Lee, Tai-Pao Chuang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Stereoscopic scenes of the mankind is naturally caused by synthesizing two images produced by the parallax of the two eyes of human. Such being the case, mankind can distinguish the relative position of the objects. In the study of related stereovision, some persons aim at the framework of taking simulated images with two eyes using one or two cameras from front and back or simultaneously at the same time to obtain a pair of parallax mages; someone pay more attention to the theoretical analysis of the relative positions of the parallax images, and some others do the work of using parallax images as material to carry out the job of image classification, comparison and analysis. The purpose of this paper is to estimate the distance between the objects and the camera in an outdoor environment using commercial digital camera.
ABET accreditation: what do the new guidelines mean to me?
Authors: Cathy Bareiss
Venue: Journal of Computing Sciences in Colleges (2009)

ABET Computing guidelines have gone through a major change. They are much more flexible and allow for a greater variety of programs and departments (even small ones)! Most (if not all) of the specific numbers are gone. These changes make accreditation more accessible to more programs. This session will explain the new guidelines and talk about what is needed for accreditation.
Breaking the Ice in Human-Agent Communication: Eye-Gaze Based Initiation of Contact with an Embodied Conversational Agent
Authors: Nikolaus Bee, Elisabeth André, Susanne Tober
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

In human-human conversation, the first impression decides whether two people feel attracted by each other and whether contact between them will be continued or not. Starting from psychological work on flirting, we implemented an eye-gaze based model of interaction to investigate whether flirting tactics help improve first encounters between a human and an agent. Unlike earlier work, we concentrate on a very early phase of human-agent conversation (the initiation of contact) and investigate which non-verbal signals an agent should convey in order to create a favourable atmosphere for subsequent interactions and increase the user's willingness to engage in an interaction with the agent. To validate our approach, we created a scenario with a realistic 3D agent called Alfred that seeks contact with a human user. Depending on whether the user signals interest in the agent by means of his or her gaze, the agent will finally engage in a conversation or not.
An Approach to Web-Scale Named-Entity Disambiguation
Authors: Luís Sarmento, Alexander Kehlenbeck, Eugénio Oliveira, Lyle Ungar
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

We present a multi-pass clustering approach to large scale, wide-scope named-entity disambiguation (NED) on collections of web pages. Our approach uses name co-occurrence information to cluster and hence disambiguate entities, and is designed to handle NED on the entire web. We show that on web collections, NED becomes increasingly difficult as the corpus size increases, not only because of the challenge of scaling the NED algorithm, but also because new and surprising facets of entities become visible in the data. This effect limits the potential benefits for data-driven approaches of processing larger data-sets, and suggests that efficient clustering-based disambiguation methods for the web will require extracting more specialized information from documents.
Design of Portable System of Measurement and Analysis for Vibration Based on S3C2440
Authors: Qing He, Bin Tang, Dongmei Du
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A new handheld vibration analyzer based on the S3C2440, a 32-bit ARM9 CPU and the ADS1274, a △-Σ high-speed simultaneous 24-bit analog to digital converter, is presented. The design of the hardware is described. The LS037V7DW03, a TFT-LCD touch screen with resolution 480´640 in 3.7 inches, was employed to display the various graphics and curves of vibration. The hardware drivers based on Windows CE 5.0 that is an embedded operating system has been developed, in which the problem between high-speed data acquisition and mass data via the serial transmission SPI has been solved by the fast interruption technology. It is proved that the sampling frequency is up to the largest sampling designed and the sampled signal is accurate and reliable.
Self-Referential Event Lists for Self-Organizing Modular Reinforcement Learning
Authors: Johane Takeuchi, Osamu Shouno, Hiroshi Tsujino
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Hybrid systems consisting of model-based and model-free systems will be engaged in the behavior/dialog control systems of future robots/agents to satisfy several user's requirements and simultaneously cope with diverse and unexpected situations. We have constructed a modular neural network model based on reinforcement learning for model-free learning. For an effective hybrid system, the model-free learning system should be aware of the current targets. This can be achieved by automatically acquiring a list of important sequential events. We propose a basic mechanism that can automatically acquire the list of sequential events with confidence measures reflecting current situations.
Digital Holography Used for Shape Measurement of Microscopic Object
Authors: Jingbo Liu, Xiufa Song, Min Huang, Huaying Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Digital holography is an emergent imaging technique which provides complete three-dimensional information of an object. An off-axis Fresnel digital holographic system with pre-magnification is built. The recording and numerical reconstruction of digital hologram is analyzed. Experimental investigations have been performed for a USAF test target. The focal plane is determined automatically by Fourier spectrum algorithm. The accurate phase image is obtained based on the automatic phase aberration compensation procedure. The lateral resolution with better than 1 and the axial resolution of no larger than 10nm have been achieved experimentally. The results show that digital holography is very suited for imaging and measurement of microscopic object.
Generating Saliency Map Related to Motion Based on Self-organized Feature Extracting
Authors: Satoru Morita
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

A computational theory concept generating saliency maps from feature maps generated in the bottom-up using various filters such as Fourier transformation was discussed. We proposed saliency map related to motion based on self-organized feature extracting not using general filter such as Fourier transform. We introduce the ICA base function to realize the self-organized Saliency Map. We extend the ICA base function estimation to apply for the non-uniform positioned photoreceptor cells which receives the current image and the previous image to get the motion information. We show the effectiveness of our model by applying this model for real images.
A theory of expressiveness in mechanisms
Authors: Michael Benisch, Norman Sadeh, Tuomas Sandholm
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness of mechanisms to their efficiency in a domain-independent manner. We introduce two new expressiveness measures, 1) maximum impact dimension, which captures the number of ways that an agent can impact the outcome, and 2) shatterable outcome dimension, which is based on the concept of shattering from computational learning theory. We derive an upper bound on the expected efficiency of any mechanism under its most efficient Nash equilibrium. Remarkably, it depends only on the mechanism's expressiveness. We prove that the bound increases strictly as we allow more expressiveness. We also show that in some cases a small increase in expressiveness yields an arbitrarily large increase in the bound. Finally, we study channel-based mechanisms, which subsume most combinatorial auctions, multi-attribute mechanisms, and the Vickrey-Clarke-Groves scheme. We show that our domain-independent measures of expressiveness appropriately relate to the natural measure of expressiveness of channel-based mechanisms: the number of channels allowed. Using this bridge, our general results yield interesting implications. For example, any (channel-based) multi-item auction that does not allow rich combinatorial bids can be arbitrarily inefficient--unless agents have no private information.
The Strength of the Grätzer-Schmidt Theorem
Authors: Paul Brodhead, Bjørn Kjos-Hanssen
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

The Grätzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. A lattice is algebraic if it is complete and generated by its compact elements. We show that the set of indices of computable lattices that are complete is $\Pi^1_1$-complete; the set of indices of computable lattices that are algebraic is $\Pi^1_1$-complete; and that there is a computable lattice L such that the set of compact elements of L is $\Pi^1_1$-complete. As a corollary, there is a computable algebraic lattice that is not computably isomorphic to any computable congruence lattice.
Antecedents and consequences of team memory in software development projects
Authors: Halit Keskin
Venue: Information and Management (2009)

Team memory is important, yet it is rarely addressed in papers on software development. We investigated the antecedents and consequences of team memory (both declarative and procedural) in software development projects. By examining 67 projects in the IT departments of 38 firms, we found, using PLS that customer orientation and innovation orientation was positively associated with both declarative and procedural memory, social responsibility was positively related to declarative memory, and systematic management control were negatively associated with declarative memory but positively associated with procedural memory. We also found that: declarative memory was positively related to the market success of the software, and procedural memory was positively related to speed-to-market (launching software faster) to the extent that memory was dispersed throughout the project team. Managerial and theoretical implication were further discussed.
Weblog classification for fast splog filtering: a URL language model segmentation approach
Authors: Franco Salvetti, Nicolas Nicolov
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper shows that in the context of statistical weblog classification for splog filtering based on n-grams of tokens in the URL, further segmenting the URLs beyond the standard punctuation is helpful. Many splog URLs contain phrases in which the words are glued together in order to avoid splog filtering techniques based on punctuation segmentation and unigrams. A technique which segments long tokens into the words forming the phrase is proposed and evaluated. The resulting tokens are used as features for a weblog classifier whose accuracy is similar to that of humans (78% vs. 76%) and reaches 93.3% of precision in identifying splogs with recall of 50.9%.