ppxscal/embedding_network huggingface dataset:
Protecting the Privacy Based on Reasoning in E-business Using Anonymous
Authors: Tao Peng, Minghua Jiang, Ming Hu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Nowadays, the E-Commerce plays a very important role in peoples’ life; many people like to shop on internet. At the same time, people left so much information in internet, which include the privacy information. Malicious users in internet can get users’ privacy information with directly or indirectly way. Traditional way is to protect the directly privacy. In this paper, we proposed a schema to prevent malicious users reasoning privacy information with the information which considered as security information on internet. In this schema, the single information set and multiple information sets are taken into count, based on the relations of the information, some information will be hidden, which can protect the privacy information. This schema will loss some information, but the privacy will protected.
Incremental Bayesian Network Learning for Scalable Feature Selection
Authors: Grégory Thibault, Alex Aussem, Stéphane Bonnevay
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

Our aim is to solve the feature subset selection problem with thousands of variables using an incremental procedure. The procedure combines incrementally the outputs of non-scalable search-and-score Bayesian network structure learning methods that are run on much smaller sets of variables. We assess the scalability, the performance and the stability of the procedure through several experiments on synthetic and real databases scaling up to 139 351 variables. Our method is shown to be efficient in terms of both running time and accuracy.
SEM Image Analysis for Quality Control of Nanoparticles
Authors: S. K. Alexander, R. Azencott, B. G. Bodmann, A. Bouamrani, C. Chiappini, M. Ferrari, X. Liu, E. Tasciotti
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In nano-medicine, mesoporous silicon particles provide efficient vehicles for the dissemination and delivery of key proteins at the micron scale. We propose a new quality-control method for the nanopore structure of these particles, based on image analysis software developed to automatically inspect scanning electronic microscopy (SEM) images of nanoparticles in a fully automated fashion. Our algorithm first identifies the precise position and shape of each nanopore, then generates a graphic display of these nanopores and of their boundaries. This is essentially a texture segmentation task, and a key quality-control requirement is fast computing speed. Our software then computes key shape characteristics of individual nanopores, such as area, outer diameter, eccentricity, etc., and then generates means, standard deviations, and histograms of each pore-shape feature. Thus, the image analysis algorithms automatically produce a vector from each image which contains relevant nanoparticle quality control characteristics, either for comparison to pre-established acceptability thresholds, or for the analysis of homogeneity and the detection of outliers among families of nanoparticles. 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
Power of Randomization in Automata on Infinite Strings
Authors: Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

Probabilistic Büchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined. In this paper, we present a number of results that clarify the power of such machines and properties of the languages they define. The broad themes we focus on are as follows. We precisely characterize the complexity of the emptiness, universality, and language containment problems for such machines, answering canonical questions central to the use of these models in formal verification. Next, we characterize the languages recognized by PBAs topologically, demonstrating that though general PBAs can recognize languages that are not regular, topologically the languages are as simple as ¿-regular languages. Finally, we introduce Hierarchical PBAs, which are syntactically restricted forms of PBAs that are tractable and capture exactly the class of ¿-regular languages.
Enhancing Keyword Search with a Keyphrase Index
Authors: Miro Lehtonen, Antoine Doucet
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

Combining evidence of relevance coming from two sources -- a keyword index and a keyphrase index -- has been a fundamental part of our INEX-related experiments on XML Retrieval over the past years. In 2008, we focused on improving the quality of the keyphrase index and finding better ways to use it together with the keyword index even when processing non-phrase queries. We also updated our implementation of the word index which now uses a state-of-the-art scoring function for estimating the relevance of XML elements. Compared to the results from previous years, the improvements turned out to be successful in the INEX 2008 ad hoc track evaluation of the focused retrieval task.
Using information about multi-word expressions for the word-alignment task
Authors: Sriram Venkatapathy, Aravind K. Joshi
Venue: Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties (2006)

It is well known that multi-word expressions are problematic in natural language processing. In previous literature, it has been suggested that information about their degree of compositionality can be helpful in various applications but it has not been proven empirically. In this paper, we propose a framework in which information about the multi-word expressions can be used in the word-alignment task. We have shown that even simple features like point-wise mutual information are useful for word-alignment task in English-Hindi parallel corpora. The alignment error rate which we achieve (AER = 0.5040) is significantly better (about 10% decrease in AER) than the alignment error rates of the state-of-art models (Och and Ney, 2003) (Best AER = 0.5518) on the English-Hindi dataset.
Taxonomy-Driven Lumping for Sequence Mining
Authors: Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

In many application domains, events are naturally organized in a hierarchy. Whether events describe human activities, system failures, coordinates in a trajectory, or biomedical phenomena, there is often a taxonomy that should be taken into consideration. A taxonomy allow us to represent the information at a more general description level, if we choose carefully the most suitable level of granularity.Given a taxonomy of events and a dataset of sequences of these events, we study the problem of finding efficient and effective ways to produce a compact representation of the sequences. This can be valuable by itself, or can be used to help solving other problems, such as clustering.
Research of Blog Quality Based on Similarity and Influence Analysis
Authors: Xiaorui Chen
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

This work presents a combination of several techniques (such as RSS Feed, Lucene, and MySQL) that constituted a powerful, efficient system to acquire, parse, and optimize data from Blogs, and then based on analyzing TF (Term Frequency) and Links we make a contribution to Similarity Analysis and Influence Analysis by proposing another two novel Algorithms which are Similarity Score and Influence Score. Hence it becomes much easier and more effective to rank the related and authoritative Blogs under the comparison of Scores.
An Automata-Theoretic Approach to Regular XPath
Authors: Diego Calvanese, Giuseppe Giacomo, Maurizio Lenzerini, Moshe Y. Vardi
Venue: Proceedings of the 12th International Symposium on Database Programming Languages (2009)

In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: linear-time query evaluation and exponential-time reasoning. To establish these results, we devise a unifying automata-theoretic framework based on two-way weak alternating tree automata. Specifically, we consider automata that have infinite runs on finite trees. This enables us to leverage and simplify existing automata-theoretic machinery and develop algorithms both for query evaluation and for reasoning over queries. With respect to the latter problem, we consider RXPath as a constraint language, and study constraint satisfiability, and query satisfiability and containment under constraints in the setting of RXPath.
Max-Margin Weight Learning for Markov Logic Networks
Authors: Tuyen N. Huynh, Raymond J. Mooney
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

Markov logic networks (MLNs) are an expressive representation for statistical relational learning that generalizes both first-order logic and graphical models. Existing discriminative weight learning methods for MLNs all try to learn weights that optimize the Conditional Log Likelihood (CLL) of the training examples. In this work, we present a new discriminative weight learning method for MLNs based on a max-margin framework. This results in a new model, Max-Margin Markov Logic Networks (M3LNs), that combines the expressiveness of MLNs with the predictive accuracy of structural Support Vector Machines (SVMs). To train the proposed model, we design a new approximation algorithm for loss-augmented inference in MLNs based on Linear Programming (LP). The experimental result shows that the proposed approach generally achieves higher F 1 scores than the current best discriminative weight learner for MLNs.
A Hotline-Based Reliable Topology for Wireless Sensor Networks
Authors: Ali Tufail, Syed Ali Khayam, Son Dong Hwan, Ki-Hyung Kim
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Many anticipated deployment scenarios, in particular military, healthcare, and disaster-recovery applications, of Wireless Sensor Networks require reliable source to sink communication. In this paper, we introduce a novel reliable topology that uses hotlines between sensor gateways to enhance the reliability of end-to-end transmissions. These hotlines reduce the number of average hops from source to the sink and serve as reliable and efficient backbone routing alternatives. We show analytically that communication using hotlines is noticeably more reliable than traditional Wireless Sensor Networks routing.
Intelligence in wikipedia
Authors: Daniel S. Weld, Fei Wu, Eytan Adar, Saleema Amershi, James Fogarty, Raphael Hoffmann, Kayur Patel, Michael Skinner
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

The Intelligence in Wikipedia project at the University of Washington is combining self-supervised information extraction (IE) techniques with a mixed initiative interface designed to encourage communal content creation (CCC). Since IE and CCC are each powerful ways to produce large amounts of structured information, they have been studied extensively - but only in isolation. By combining the two methods in a virtuous feedback cycle, we aim for substantial synergy. While previous papers have described the details of individual aspects of our endeavor [25, 26, 24, 13], this report provides an overview of the project's progress and vision.
The Twin Diffie&#x2013;Hellman Problem and Applications
Authors: David Cash, Eike Kiltz, Victor Shoup
Venue: Journal of Cryptology (2009)

We propose a new computational problem called the twin Diffie&#x2013;Hellman problem. This problem is closely related to the usual (computational) Diffie&#x2013;Hellman problem and can be used in many of the same cryptographic constructions that are based on the Diffie&#x2013;Hellman problem. Moreover, the twin Diffie&#x2013;Hellman problem is at least as hard as the ordinary Diffie&#x2013;Hellman problem. However, we are able to show that the twin Diffie&#x2013;Hellman problem remains hard, even in the presence of a decision oracle that recognizes solutions to the problem&#x2014;this is a feature not enjoyed by the Diffie&#x2013;Hellman problem, in general. Specifically, we show how to build a certain &#x201c;trapdoor test&#x201d; that allows us to effectively answer decision oracle queries for the twin Diffie&#x2013;Hellman problem without knowing any of the corresponding discrete logarithms. Our new techniques have many applications. As one such application, we present a new variant of ElGamal encryption with very short ciphertexts, and with a very simple and tight security proof, in the random oracle model, under the assumption that the ordinary Diffie&#x2013;Hellman problem is hard. We present several other applications as well, including a new variant of Diffie and Hellman&#x2019;s non-interactive key exchange protocol; a new variant of Cramer&#x2013;Shoup encryption, with a very simple proof in the standard model; a new variant of Boneh&#x2013;Franklin identity-based encryption, with very short ciphertexts; a more robust version of a password-authenticated key exchange protocol of Abdalla and Pointcheval.
Delay Asymptotics and Scalability for Peer-to-Peer Live Streaming
Authors: Gyorgy Dan, Viktoria Fodor
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

A large number of peer-to-peer streaming systems have been proposed and deployed in recent years. Yet, there is no clear understanding of how these systems scale and how multipath and multihop transmission, properties of all recent systems, affect the quality experienced by the peers. In this paper, we present an analytical study that considers the relationship between delay and loss for general overlays: we study the trade-off between the playback delay and the probability of missing a packet and we derive bounds on the scalability of the systems. We present an exact model of push-based overlays and show that the bounds hold under diverse conditions: in the presence of errors, under node churn, and when using forward error correction and various retransmission schemes.
Last Bank: Dealing with Address Reuse in Non-Uniform Cache Architecture for CMPs
Authors: Javier Lira, Carlos Molina, Antonio González
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In response to the constant increase in wire delays, Non-Uniform Cache Architecture (NUCA) has been introduced as an effective memory model for dealing with growing memory latencies. This architecture divides a large memory cache into smaller banks that can be accessed independently. Banks close to the cache controller therefore have a faster response time than banks located farther away from it. In this paper, we propose and analyse the insertion of an additional bank into the NUCA cache. This is called Last Bank. This extra bank deals with data blocks that have been evicted from the other banks in the NUCA cache. Furthermore, we analyse the behaviour of the cache line replacements done in the NUCA cache and propose two optimisations of Last Bank that provide significant performance benefits without incurring unaffordable implementation costs.
Articles as Assignments --- Modalities and Experiences of Wikipedia Use in University Courses
Authors: Klaus Wannemacher
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

In spite of perceived quality deficits, Wikipedia is a popular information resource among students. Instructors increasingly take advantage of the positive student attitude through actively integrating Wikipedia as a learning tool into university courses. The contribution raises the question if Wikipedia assignments in university courses are suited to make complex research, editing and bibliographic processes through which scholarship is produced transparent to students and to effectively improve their research and writing skills.
Research Summary: Tabled Evaluation for Transaction Logic Programs
Authors: Paul Fodor
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

In my thesis, I present problems and techniques in tabling Transaction Logic ($\mathcal{TR}$). $\mathcal{TR}$ is an extension of classical logic programming with backtrackable state updates and it has a top-down evaluation algorithm similar to Prolog's SLD derivation extended with execution paths of states instead of a single global state. This backward chaining algorithm can be very inefficient by re-computing the same transactional queries more than once, or can enter into infinite loops by visiting the same paths of states an infinite number of times when computing answers to recursive programs. We solve these problems by memoizing (caching) the calls, call initial states, unifications (answers) and return states in a searchable structure for the Sequential Transaction Logic, respective building a graph for the query and tabling the nodes ready for current execution for the Concurrent Transaction Logic. Important problems of tabling $\mathcal{TR}$ are to store, index, update, query and resume states into memory. I implemented and measured the efficiency of multiple data structures used in tabling programs with backtrackable updates in XSB Prolog. My thesis studies the data structures and their performance for various applications of TR, such as, artificial intelligence planning, NP-complete graph algorithms (Hamiltonian cycle, clique, shortest consuming paths, connected components) and active databases. One of the most promising techniques was storing logs (i.e., inserts and deletes relative to a materialized state) into individual tries (optimized for querying), while keeping a global page trie as a common index for restarting.
DySCon: Dynamic Sharing Control for Distributed Team Collaboration in Networked Enterprises
Authors: Ahmad Kamran Malik, Hong-Linh Truong, Schahram Dustdar
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Networked enterprises create virtual teams of distributed experts belonging to different enterprises where one user can be part of multiple teams; How to effectively control the sharing of personal and shared context information among members of multiple overlapping teams without compromising their privacy is a challenging research question. This paper describes sharing control in Peer to Peer and Web service based collaborative systems. In contrast to other sharing systems which mostly use static policy and context of requester and owner, we propose DySCon, a context based Dynamic Sharing Control mechanism which allows system defined as well as owner defined runtime policy adaptation for different levels using various contexts. We evaluate our Dynamic Sharing Control architecture by implementing a prototype Dynamic Sharing Control Messenger to enhance privacy of the owner.
Applying Human-Centered Design to Rehabilitation Device
Authors: Lan-Ling Huang, Dengchuan Cai
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The current study investigated the patients' problems and needs during therapy process. The investigation results were transferred to the product requirements of the rehabilitation device. The features of the new rehabilitation device included the following: 1) a webcam that can provide patients to communicate with his/her families or doctors during the therapy process, 2) a visual display that provides patients the function to see their posture and is able to correct their actions immediately, 3) physiological data such as movement angle, strength, and exercise time which were provided for diagnosis application for the doctors and their families, and 4) the main operational was designed to be adjustable for different individuals including its height, angle, and direction. The current design obtained positive evaluation preliminary by the occupational therapists. The procedure, methods and design of this study can be used as a reference for rehabilitation product design.
Towards gameplay analysis via gameplay metrics
Authors: Anders Drachen, Alessandro Canossa
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

User-oriented research in the game industry is undergoing a change from relying on informal user-testing methods adapted directly from productivity software development to integrating modern approaches to usability- and user experience testing. Gameplay metrics analysis form one of these techniques, being based on instrumentation methods in HCI. Gameplay metrics are instrumentation data about the user behavior and user-game interaction, and can be collected during testing, production and the live period of the lifetime of a digital game. The use of instrumentation data is relatively new to commercial game development, and remains a relatively unexplored method of user research. In this paper, the focus is on utilizing game metrics for informing the analysis of gameplay during commercial game production as well as in research contexts. A series of case studies are presented, focusing on the major commercial game titles Kane & Lynch and Fragile Alliance.
User Experience Research and Management of Online Advertising and Merchandising
Authors: Frank Y. Guo
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Managing user experience of advertising on eCommerce sites poses unique challenges due to the need of balancing profiting and optimizing user experience. Merchandising on eCommerce sites is similar to online advertising, because users oftentimes do not perceive and interact with them differently due to their similar look and feel. This paper proposes a framework of user experience management, an approach towards user research, and a number of design recommendations for online advertising and merchandising.
Increasing the Dimension of Creativity in Rotation Invariant Feature Design Using 3D Tensorial Harmonics
Authors: Henrik Skibbe, Marco Reisert, Olaf Ronneberger, Hans Burkhardt
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Spherical harmonics are widely used in 3D image processing due to their compactness and rotation properties. For example, it is quite easy to obtain rotation invariance by taking the magnitudes of the representation, similar to the power spectrum known from Fourier analysis. We propose a novel approach extending the spherical harmonic representation to tensors of higher order in a very efficient manner. Our approach utilises the so called tensorial harmonics [1] to overcome the restrictions to scalar fields. In this way it is possible to represent vector and tensor fields with all the gentle properties known from spherical harmonic theory. In our experiments we have tested our system by using the most commonly used tensors in three dimensional image analysis, namely the gradient vector, the Hessian matrix and finally the structure tensor. For comparable results we have used the Princeton Shape Benchmark [2] and a database of airborne pollen, leading to very promising results.