ppxscal/embedding_network huggingface dataset:
Extending autocompletion to tolerate errors
Authors: Surajit Chaudhuri, Raghav Kaushik
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the table containing as their prefix the search string typed so far. Just as there is a need for making the lookup operation tolerant to typing errors, we argue that autocompletion also needs to be error-tolerant. In this paper, we take a first step towards addressing this problem. We capture input typing errors via edit distance. We show that a naive approach of invoking an offline edit distance matching algorithm at each step performs poorly and present more efficient algorithms. Our empirical evaluation demonstrates the effectiveness of our algorithms.
The Complete RFID Handbook: A Manual and DVD for Assessing, Implementing, and Managing Radio Frequency Identification Technologies in Libraries
Authors: Diane Marie Ward
Venue:  (2007)

To RFID Radio Frequency IDentification or not to RFID is one of the hottest debates in libraries today. This practical and straightforward manual lays out all the information you need to make a decision about whether or not RFID belongs in your library and how to select a vendor and implement the technology if the answer is yes. Diane Marie Ward, one of the nation s foremost experts in this area, shows you how to: develop a plan for specific types of libraries (public, academic, special, government, and more); solicit a request for proposal; work with vendors; implement and maintain your system; assure patron privacy; market new services; educate staff and patrons, and assess the success of your program. This easy-to understand manual includes detailed information on both equipment (tags, readers, security gates, networks) and uses (inventory, self-check in and out, material handling and sorting, security). The companion DVD demonstrates the technology s use in libraries that have already implemented it and can be used for both presentations to decision-making boards and committees, as well as a staff training tool. 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
Analytical modelling: an investigation into the effect of absorption processes on the performance of a waveguide-based biosensor
Authors: Hj Kadim
Venue: Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication (2009)

Factors such as temperature and other fundamental parameters and properties of a waveguide have a profound effect on the performance of a waveguide-based sensor. Analytical modelling expressions are considered to investigate the effect of parameters - in particular absorption processes - on the performance of a waveguide-based biosensor. The modelling expressions also provide useful information for pre and post design of sensors.
Adding incentives to file-sharing systems
Authors: Aviv Zohar, Jeffrey S. Rosenschein
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Modern peer-to-peer file sharing systems rely heavily on the willingness of users to distribute files to others. A selfish user can choose to download a file and consume resources without uploading in return. This form of free-riding plagues all currently deployed peer-to-peer systems. We present a novel protocol for a BitTorrent-like system (i.e., one in which only one file is being shared) that strongly discourages users from downloading a file without sharing it. Our protocol requires very little computation, and can easily be implemented in today's peer-to-peer systems. It is resistant to all forms of manipulation, including the use of multiple free identities, and does not require any coordination among seeds. We analyze our protocol and show that if downloading peers are rational, a new system equilibrium is reached in which all peers upload at least some percentage of the file they are given.
Improving query performance through application-driven processing and retrieval
Authors: Hakan Ferhatosmanoglu
Venue:  (2008)

The proliferation of massive data sets across many domains and the need to gain meaningful insights from these data sets highlight the need for advanced data retrieval techniques. Because I/O cost dominates the time required to answer a query, sequentially scanning the data and evaluating each data object against query criteria is not an effective option for large data sets. An effective solution should require reading as small a subset of the data as possible and should be able to address general query types. Access structures built over single attributes also may not be effective because (1) they may not yield performance that is comparable to that achievable by an access structure that prunes results over multiple attributes simultaneously, and (2) they may not be appropriate for queries with results dependent on functions involving multiple attributes. Indexing a large number of dimensions is also not effective, because either too many subspaces must be explored or the index structure becomes too sparse at high dimensionalities. The key is to find solutions that allow for much of the search space to be pruned while avoiding this 'curse of dimensionality'. This thesis pursues query performance enhancement using two primary means (1) processing the query effectively based on the characteristics of the query itself; and (2) physically organizing access to data based on query patterns and data characteristics. Query performance enhancements are described in the context of several novel applications including (1) Optimization Queries, which presents an I/O-optimal technique to answer queries when the objective is to maximize or minimize some function over the data attributes, (2) High-Dimensional Index Selection, which offers a cost-based approach to recommend a set of low dimensional indexes to effectively address a set of queries, and (3) Multi-Attribute Bitmap Indexes, which describes extensions to a traditionally single-attribute query processing and access structure framework that enables improved query performance.
Fast communication: H∞ bounds for quasi-Newton adaptive algorithm
Authors: N. Kalyanasundaram, Abhishek Jindal, Anindya Gupta
Venue: Signal Processing (2009)

The upper and lower bounds for the H^~ norm of the quasi-Newton (QN) family of adaptive filtering algorithms are obtained. A simulation study of the behaviour of the bounds with respect to the iteration order and the weight-vector dimension for a practical input data model reveals that the QN family is quite robust against modelling errors and errors due to the uncertainty in the initial weight-vector assumption.
Can feature design reduce the gender gap in end-user software development environments?
Authors: Valentina Grigoreanu, Jill Cao, Todd Kulesza, Christopher Bogart, Kyle Rector, Margaret Burnett, Susan Wiedenbeck
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

Recent research has begun to report that female end-user programmers are often more reluctant than males to employ features that are useful for testing and debugging. These earlier findings suggest that, unless such features can be changed in some appropriate way, there are likely to be important gender differences in end-user programmers’ benefits from these features. In this paper, we compare end-user programmers’ feature usage in an environment that supports end-user debugging, against an extension of the same environment with two features designed to help ameliorate the effects of low self-efficacy. Our results show ways in which these features affect female versus male enduser programmers’ self-efficacy, attitudes, usage of testing and debugging features, and performance.
Towards a constructivist approach to learning from hypertext
Authors: Iyad AlAgha, Liz Burd
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

How to help learners construct knowledge from hypertext and plan a navigation process on the Web are important issues in Web based learning. To provide solutions to these issues, this paper presents Knowledge Puzzle, a tool for knowledge construction from the Web. Its main contribution to Web-based learning is the personalization of information structure on the Web to cope with the knowledge structure in the learner's mind. Self-directed learners will be able to adapt the path of instruction on the Web to their way of thinking, regardless of how the Web content is delivered. The way to achieve that is to provide learners with a meta-cognitive tool that enables them to bring knowledge gained from the Web to the surface and visualize what they have in mind. Once we get the learner's viewpoint externalized, it will be converted to a hypermedia layer that will be laid over the Web pages visited by the learner. The attached layer adapts the views of Web pages to the learner's information needs by associating information pieces that are not already linked in hyperspace and attaching the learner's notes to the page content. Finally, a hypertext version of the whole constructed knowledge is produced to enable fast and easy reviewing.
TANGENT: a novel, 'Surprise me', recommendation algorithm
Authors: Kensuke Onuma, Hanghang Tong, Christos Faloutsos
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored with his/her usual genre of items (e.g., books, movies, hobbies), and may want a recommendation that is related, but off the beaten path, possibly leading to a new genre of books/movies/hobbies. How would we define, as well as automate, this seemingly selfcontradicting request? We introduce TANGENT, a novel recommendation algorithm to solve this problem. The main idea behind TANGENT is to envision the problem as node selection on a graph, giving high scores to nodes that are well connected to the older choices, and at the same time well connected to unrelated choices. The method is carefully designed to be (a) parameter-free (b) effective and (c) fast. We illustrate the benefits of TANGENT with experiments on both synthetic and real data sets. We show that TANGENT makes reasonable, yet surprising, horizon-broadening recommendations. Moreover, it is fast and scalable, since it can easily use existing fast algorithms on graph node proximity.
Utilizing quantum dot transistors with programmable threshold voltages for low-power mobile computing
Authors: Shuo Wang, Jianwei Dai, El-Sayed Hasaneen, Lei Wang, Faquir Jain
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2009)

Power consumption poses one of the fundamental barriers for deploying mobile computing devices in energy-constrained situations with varying operation conditions. In particular, leakage power is projected to increase exponentially in future semiconductor process nodes. This challenging problem is pressing for renewed focus on power-performance optimization at all levels of design abstract, from novel device structures to fundamental shifts in design paradigm. In this article, we propose to exploit the programmable threshold voltage quantum dot (QD) transistors to reduce leakage thereby improving the energy efficiency for mobile computing. The unique programmability and reconfigurability enabled by QD transistors extend our capability in design optimization for new power-performance trade-offs. Simulation results demonstrate the significant leakage reduction over conventional techniques.
Neural network for audio visual moving robot tracking to speaking person
Authors: Alexander Bekiarski, Snejana Pleshkova
Venue: Proceedings of the 10th WSEAS international conference on Neural networks (2009)

Audition and vision are the most important human perception systems working together, when a person walks and decides to make the next step toward a speaking person. The same is important also for the moving robots, when they hear and see a speaking person. Both, audio and video information, perceived from the robot, are different, use different processing methods and means to determine the speaking person position, but the goal is identical and can be determined as using both. Therefore in this paper the separate results of speaker position from audio and video systems are treated together and are used as inputs for a neural network. The purpose of this network is to estimate and predict the next speaker position calculations audio and video systems. This facilitates the robot moving tracing, decrease the calculations and increase the precision and ability to real time working.
Local Discontinuous Galerkin Method for Surface Diffusion and Willmore Flow of Graphs
Authors: Yan Xu, Chi-Wang Shu
Venue: Journal of Scientific Computing (2009)

In this paper, we develop a local discontinuous Galerkin (LDG) finite element method for surface diffusion and Willmore flow of graphs. We prove L 2 stability for the equation of surface diffusion of graphs and energy stability for the equation of Willmore flow of graphs. We provide numerical simulation results for different types of solutions of these two types of the equations to illustrate the accuracy and capability of the LDG method.
Challenges to Supporting Federated Assurance
Authors: Paul Madsen, Hiroki Itoh
Venue: Computer (2009)

Typically, federated identity manifests itself as transferring some aspect of a user's identity from one entity to another. Web single sign-on is an archetypical example of a federated transaction, in which a user authenticates to one website and can then access another with the same login.
Entering a parallel universe
Authors: Gregory Goth
Venue: Communications of the ACM (2009)

The multicore processors that help extend Moore's Law may run afoul of Amdahl's Law.
The motivational and control structure underlying the acceptance of adaptive museum guides - An empirical study
Authors: Fabio Pianesi, Ilenia Graziola, Massimo Zancanaro, Dina Goren-Bar
Venue: Interacting with Computers (2009)

Acceptance of adaptive museum guides raises important issues stemming from both the nature of the scenario (museum visit) and the very kind of technological approach adopted (adaptivity). As to the former, museum guides play a utilitarian role in a hedonic scenario; at present, however, it is not clear how this reflects on the balance between intrinsic and extrinsic motivations for guide acceptance. The adaptive nature of the guide, in turn, raises questions about the impact of the opaqueness of the system behavior, of the alleged loss of perceived control over the interaction, and the role of presentation personalization. All these issues are explored in this paper by means of a model derived from TAM and comprising both extrinsic and intrinsic motivational constructs. The results of a analysis of data from 115 subjects show that the motivational structure of the guide usage is mainly utilitarian, with intrinsic motivations playing a role insofar as they acquire an instrumental value. The impact of the control issues on acceptability is low and indirect, while the importance of the feedback provided by the system is confirmed. Finally, personalization positively impacts on user engagement, this way strengthening the empirical and theoretical groundings for work in adaptive systems.
An inverse problem arising from the displacement of oil by water in porous media
Authors: Elena M. Fernández-Berdaguer, Gabriela B. Savioli
Venue: Applied Numerical Mathematics (2009)

The purpose of the present work is to analyze an inverse problem whose forward model is a non-linear hyperbolic-elliptic system. We present theoretical results on the inverse problem and prove them. The forward model arises from the displacement of oil by water in porous media. The inverse problem consists in the estimation of oil-water relative permeability functions, which are coefficients of the forward model differential equations. We also formulate an algorithm on functional spaces prior to any discretization. The algorithm is based on the linearization of the parameter-to-output mapping. This technique is new in the case where the parameter depends on the solution of the forward model. It has the advantage of laying aside parametric models. The algorithm is iterative and is of prediction-correction type. We use synthetic data to test the new algorithm.
A microcantilever-based gas flow sensor for flow rate and direction detection
Authors: Rong-Hua Ma, Po-Cheng Chou, Yu-Hsiang Wang, Tzu-Han Hsueh, Lung-Ming Fu, Chia-Yen Lee
Venue: Microsystem Technologies (2009)

Utilizing conventional micro-electro-mechanical systems techniques, this study fabricates and characterizes a novel micro gas flow sensor comprising four silicon nitride/silicon wafer cantilever beams arranged in a cross-form configuration. The residual stresses induced within the beams during their fabrication cause the tip of each beam to curve slightly in the upward direction. However, as air travels over the surface of the sensor, the upstream cantilevers are deflected in the downward direction, while the downstream cantilevers are deflected in the upward direction. The velocity of the air flow is then determined by measuring the corresponding change in resistance of the piezoresistors patterned on the upper surface of each cantilever beam. It is shown that by measuring the change in resistance of all four cantilever beams, the proposed sensor can detect not only the velocity of the air flow, but also its direction.
Flex 3 in Action
Authors: Tariq Ahmed, Jon Hirschi, Faisal Abid
Venue:  (2009)

New Web applications require engaging user-friendly interfaces-and the cooler, the better. With Flex 3, Web developers at any skill level can create high-quality, effective, and interactive Rich Internet Applications (RIAs) quickly and easily. Flex removes the complexity barrier from RIA development by offering sophisticated tools and a straightforward programming language so you can focus on what you want to do instead of how to do it. And now that the major components of Flex are free and open source, the cost barrier is gone, as well! Flex 3 in Action is an easy-to-follow, hands-on Flex tutorial. Chock full of examples, this book goes beyond feature coverage and helps you put Flex to work in real day-to-day tasks. You'll quickly master the Flex API and learn to apply the techniques that make your Flex applications stand out from the crowd. Interesting themes, styles, and skins? It's in there. Working with databases? You got it. Interactive forms and validation? You bet. Charting techniques to help you visualize data? Bam! The expert authors of Flex 3 in Action have one goal - to help you get down to business with Flex 3. Fast. Many Flex books are overwhelming to new users-focusing on the complexities of the language and the super-specialized subjects in the Flex eco-system; Flex 3 in Action filters out the noise and dives into on the core topics you need every day. Using numerous easy-to-understand examples, Flex 3 In Action gives you a strong foundation that you can build on as the compexity of your projects increases. And now, purchase the print edition and you'll get the Flex 3 in Action ebook and the Flex 4 in Action ebook upon its release both for free! Simply follow instructions on the insert to redeem your two free ebooks.
Discovering and Building Semantic Models of Web Sources
Authors: Craig A. Knoblock
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

To achieve widespread use of the Semantic Web depends on having a critical mass of Web data available with semantic annotations. Since there are a huge number of sources available today without any such annotations, the challenge is how to find and build semantic models for these sources. In this talk I will describe an integrated end-to-end approach that automatically discovers information-producing web sources, invokes and extracts the data from these sources, builds semantic models of the sources, and validates the results by comparing the data produced by the source with the model of the source. These techniques are implemented in a system called DEIMOS, which integrates a diverse set of technologies to completely automate this task. DEIMOS starts with a "seed" source and finds other similar sources online using data from a social networking web site. Next the system learns how to invoke these sources through experimentation and then extracts data from these sources with automatic wrapping techniques. Finally, DEIMOS learns a semantic model of a source, which identifies the semantic types of the data produced by a source as well as the function that maps the inputs to the outputs. I will describe the challenges in integrating the component technologies into a unified approach to discovering, extracting and modeling new online sources. I will also present an evaluation of the integrated system on three different domains to demonstrate that it can automatically discover and model new Web sources.
Personal name-matching through name transformation
Authors: Jun Gong, Lidan Wang, Douglas W. Oard
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

A graph theory based method is proposed to exploit name transformation for personal name-matching. Experiment results on three personal name datasets show that the method is effective.
Environment-Driven Skeletal Plan Execution for the Medical Domain
Authors: Peter Votruba, Andreas Seyfang, Michael Paesold, Silvia Miksch
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

An important application of both data abstraction and plan execution is the execution of clinical guidelines and protocols (CGP), both to validate them against a large set of test cases and to provide decision support at the point of care. CGPs can be represented and executed as a hierarchy of skeletal plans. To bridge the gap between low-level data and high-level concepts in the CGP, intelligent temporal data abstraction must be integrated with plan execution. In this paper we describe a solution to this challenge which was implemented as part of the European project Protocure II to improve the quality of CGPs. They are translated to the high-level plan representation language Asbru which again is compiled into a network of abstraction modules by the system. Then this network performs the content of the plans triggered by the arriving patient data. By this, we seamlessly integrate the synchronisation of guideline execution with observed patient state, complex temporal abstractions and execution of complex plans without requiring the user to handle the low-level details. Instead, user-friendly tools are used to create and maintain the guideline.