ppxscal/embedding_network huggingface dataset:
Single document keyphrase extraction using neighborhood knowledge
Authors: Xiaojun Wan, Jianguo Xiao
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Existing methods for single document keyphrase extraction usually make use of only the information contained in the specified document. This paper proposes to use a small number of nearest neighbor documents to provide more knowledge to improve single document keyphrase extraction. A specified document is expanded to a small document set by adding a few neighbor documents close to the document, and the graph-based ranking algorithm is then applied on the expanded document set to make use of both the local information in the specified document and the global information in the neighbor documents. Experimental results demonstrate the good effectiveness and robustness of our proposed approach.
An Algorithm of Semi-supervised Web-Page Classification Based on Fuzzy Clustering
Authors: Chen Geng, Zhu Yuquan, Tan Jianing, Hu Tianhan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

It is very difficult to obtain labeled training samples. However, it is very easy to obtain non-labeled training samples. So,it is important task that how to classify Web-page using these training samples. An Algorithm called FC-TSVM based on fuzzy clustering is proposed. The algorithm FC-TSVM uses the fuzzy clustering algorithm to determine the number of positive label samples, and add the information of homepages hyperlink as part of the classifications. The experiments show that the algorithm FC-TSVM can efficiently improve the accuracy and stability of web page classification.
Paper to Electronic Questionnaires: Effects on Structured Questionnaire Forms
Authors: Anna Trujillo
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

With the use of computers, paper questionnaires are being replaced by electronic questionnaires. The formats of traditional paper questionnaires have been found to affect a subject's rating. Consequently, the transition from paper to electronic format can subtly change results. The research presented begins to determine how electronic questionnaire formats change subjective ratings. For formats where subjects used a flow chart to arrive at their rating, starting at the worst and middle ratings of the flow charts were the most accurate but subjects took slightly more time to arrive at their answers. Except for the electronic paper format, starting at the worst rating was the most preferred. The paper and electronic paper versions had the worst accuracy. Therefore, for flowchart type of questionnaires, flowcharts should start at the worst rating and work their way up to better ratings.
On the Singularity of Valuating IT Security Investments
Authors: Thomas Neubauer, Christian Hartl
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Companies spend considerable amounts of resources on minimizing security breaches but often neglect to implement efficient ones and are not aware whether their investments are effective. Literature provides many approaches aiming to define the value of IT security investments but often can not fulfill the expectation of decision makers in practice, e.g. due to lacking support for considering multiple objectives, business issues or a variety of investment alternatives. This paper identifies criteria for proper IT security evaluation methods from literature and evaluates some selected methods in order to show their applicability in practice. A focus of this evaluation lies on the comparison to methods for IT investment evaluation, in order to answer the question what the difference of evaluating IT investments and IT security investments is.
Adaptive Latency Insensitive Protocols and Elastic Circuits with Early Evaluation: A Comparative Analysis
Authors: Mario R. Casu, Luca Macchiarulo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Latency Insensitive Protocols (LIP) and Elastic Circuits (EC) solve the same problem of rendering a design tolerant to additional latencies caused by wires or computational elements. They are performance-limited by a firing semantics that enforces coherency through a lazy evaluation rule: Computation is enabled if all inputs to a block are simultaneously available. Adaptive LIP's (ALIP) and EC with early evaluation (ECEE) increase the performance by relaxing the evaluation rule: Computation is enabled as soon as the subset of inputs needed at a given time is available. Their difference in terms of implementation and behavior in selected cases justifies the need for the comparative analysis reported in this paper. Results have been obtained through simple examples, a single representative case-study already used in the context of both LIP's and EC and through extensive simulations over a suite of benchmarks.
Study of Laser Non-contact Measuring Method of Circle Path Applied to Precision Analysis of Three-Axes CNC Machine Tools
Authors: X. S. Wang, Y. Li, Y. C. Yu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Abstract—Laser non-contact precision measuring method of CNC machine tools under the high feed rate condition was put forward. The method combines the laser interferometer with the measurement principle of the double ball bar (DBB), and can measure the machine tool precision under the high feed rate condition. Two laser interferometers used as measuring the displacements and feed rate data along circular interpolation motion individually measured three group data in the XY, YZ and XZ work planes, and the space errors of the CNC can be acquired through solving the special mathematic model based on the measurement principle of DBB.
Delaunay Triangulation of Imprecise Points Simplified and Extended
Authors: Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection ${\mathcal R}$ of input regions known in advance. Building on recent work by Löffler and Snoeyink[21], we show how to leverage our knowledge of ${\mathcal R}$ for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, eg, overlapping disks of different sizes and fat regions.
A remark on parameterizing nonsingular cubic surfaces
Authors: Irene Polo-Blanco, Jaap Top
Venue: Computer Aided Geometric Design (2009)

Extending a geometric construction due to Sederberg and to Bajaj, Holt, and Netravali, an algorithm is presented for parameterizing a nonsingular cubic surface by polynomials of degree three. The fact that such a parametrization exists is classical. The present algorithm is, by its purely geometric nature, a very natural one. Moreover, it contains a practical way of finding all lines in an implicitly given cubic surface. Two explicit examples are presented, namely the classical Clebsch diagonal surface and the cubic Fermat surface.
Evolutionary construction of multiple graph alignments for the structural analysis of biomolecules
Authors: Thomas Fober, Marco Mernberger, Gerhard Klebe, Eyke Hüllermeier
Venue: Bioinformatics (2009)

The concept of multiple graph alignment (MGA) has recently been introduced as a novel method for the structural analysis of biomolecules. Using approximate graph matching techniques, this method enables the robust identification of approximately conserved patterns in biologically related structures. In particular, MGA enables the characterization of functional protein families independent of sequence or fold homology. This article first recalls the concept of MGA and then addresses the problem of computing optimal alignments from an algorithmic point of view. In this regard, a method from the field of evolutionary algorithms is proposed and empirically compared with a hitherto existing heuristic approach. Empirically, it is shown that the former yields significantly better results than the latter, albeit at the cost of an increased runtime. Contact: eyke@mathematik.uni-marburg.de Supplementary information: Supplementary data are available at Bioinformatics online.
q-difference operators for orthogonal polynomials
Authors: Mourad E. H. Ismail, Plamen Simeonov
Venue: Journal of Computational and Applied Mathematics (2009)

In this work we apply a q-ladder operator approach to orthogonal polynomials arising from a class of indeterminate moment problems. We derive general representation of first and second order q-difference operators and we study the solution basis of the corresponding second order q-difference equations and its properties. The results are applied to the Stieltjes-Wigert and the q-Laguerre polynomials.
Study of the Correlation between the Concrete Wall Thickness Measurement Results by Ultrasonic Pulse Echo and the PTF Model for Assymetrical Functions
Authors: Lucian Pusca
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This paper presents an interpretation of the results of the Pulse-echo methods (Radar Impact-Echo, Ultrasonic Impulse-echo) and simulation of wave propagation for testing concrete specimens with metal ducts given in [1-15], in terms of the invariance properties of PTF (Practical Test Function) model for asymmetrical pulses presented and developed in [20] and [26].The interpreted results include various aspects of the pulse echo method (previously published by Krause, Maierhofer, Wiggenhauser, Bärmann, Langenberg, Frielinghaus, Krautkramer, Neisecke, Wollbold, Schickert) as: radar: propagation, reflection and scattering of electromagnetic pulses; impact echo: propagation, reflection and scattering of elastic waves after mechanical impact; ultrasonic pulse echo: propagation and dispersion of sound waves after indication with ultrasonic transducers.The interpretation of the above results with the help of the PTF model for asymmetrical functions revealed the compatibility between the first and second order therms representation of a sharp pulse-defined as a practical test function- and some of the experimental results.As a possible application, is mentioned phase detection by multiplying the alternating input signal with an assymetrical function and integration of the resulting function for more robust results than the one presented in [27].The second part of the paper presents the a heuristic algorithm for generating asymmetrical practical test functions (that could be used to describe impact echo phenomena for the elastic waves in various materials, including concrete) using MATLAB procedures some possibilities for obtaining asymmetrical pulses as related to this middle of the working interval using the derivative of such symmetrical pulse for certain diferential equations corresponding to second order systems (with unity-step input and for an input represented by a gaussian pulse). 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
A Novel Mining Algorithm for Negative Association Rules
Authors: Yuan Ben-gang, Chen Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Negative association rules mining considers not only existed items but absent items in databases as well. A concept of complete negative association rules is present in this paper. A tree-based algorithm named Free-PNP is presented by which negative frequent patterns can be found from databases and complete negative association can be then obtained. Experiments demonstrated its effectiveness and efficiency.
A Proposal of New Interface Based on Natural Phenomena and So on (2)
Authors: Ichiro Hirata, Toshiki Yamaoka, Akio Fujiwara, Sachie Yamamoto, Daijirou Yamaguchi, Mayuko Yoshida, Rie Tutui
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

The purpose of this research is "realization of the user interface that is kind to person". We live together with nature. Therefore, it is effective to use natural phenomena for the user-interface. To explore the new user-interface based on natural phenomena and so on, the data of three categories ("Accustomed manners friendly", "natural phenomenon", "Movement, behavior of plants and animals") were gathered by field survey. The gathered data were classified and structured. New user-interface that combines many user-interfaces (picture scroll interface, water lily interface, fish shoal interface, and so on) was constructed. This paper presents the example of four user-interfaces that are selected from collected data.
Incremental Updating Algorithm Based on Partial Support Tree for Mining Association Rules
Authors: Wang Yuping, Dong Nanping, Zhou Guanling
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

A new algorithm, which is based on partial support tree (PS_Tree), is proposed to deal with the incremental updating problem when a new database is inserted and the minimum support is not changed. This algorithm use effectively the association rules mined and the partial support tree reserved to improve the performance. It only need scan the updated part of the database once so that the efficiency of algorithm can be further improved . The performance study shows that the algorithm is efficient for incremental updating problems of association rules.
A 1D-3D mixed method for the numerical simulation of blast waves in confined geometries
Authors: Adel M. Benselama, Mame J. -P. William-Louis, François Monnoyer
Venue: Journal of Computational Physics (2009)

Blast wave generated by a high detonating spherical charge and propagating in confined domains is modeled using the Euler equations. The problem is split into two parts. The first calculation part relies on spherical isotropy to solve the problem in the radial component. Overpressure distribution is presented and shows a very good agreement with experimental and numerical data. The one-dimensional data need to be made three-dimensional mesh-compatible thanks to an appropriate remapping technique. To this end, a remapping technique is presented and its effectiveness, accuracy and efficiency are demonstrated. The second calculation part consists of a three-dimensional computation fed with the remapped data. The effectiveness of this mixed approach is demonstrated through three-dimensional applications in confined domains.
Performance Analysis of Communications Networks and Systems, 1st edition
Authors: Piet Van Mieghem
Venue:  (2009)

This rigorous and self-contained book describes mathematical and, in particular, stochastic methods to assess the performance of networked systems. It consists of three parts. Part one is a review of probability theory. Part two covers the classical theory of stochastic processes (Poisson, renewal, Markov, and queuing theory), which are considered to be the basic building blocks for performance evaluation studies. Part three focuses on the relatively new field of the physics of networks. This part deals with the recently obtained insights that many very different large complex networks - such as the Internet, World Wide Web, proteins, utility infrastructures, social networks - evolve and behave according to more general common scaling laws. This understanding is useful when assessing the end-to-end quality of communications services, for example, in Internet telephony, real-time video, and interacting games. Containing problems and solutions, this book is ideal for graduate students taking courses in performance analysis. 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
Mining High-Correlation Association Rules for Inferring Gene Regulation Networks
Authors: Xuequn Shang, Qian Zhao, Zhanhuai Li
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Construction gene regulation networks can provide insights into the understanding the molecular mechanisms underlying important biological processes. We present a novel association rule mining for building large-scale gene regulation networks from microarray data. Gene expression microarray data typically contains a very high gene dimension and a very low sample size, rendering a great challenge for existing association rule mining algorithms. In this paper, we develop a novel algorithm, HCMiner, to mine high-correlation association rules from microarray data. HCMiner initially overlapping partitions the dimension of genes according to their correlations and introduces the support-free framework for mining association rules. Several experiments on Yeast dataset show that the proposed algorithm outperforms existing algorithms with respect to scalability and effectiveness.
Adaptive splitting and pre-signaling for RFID tag anti-collision
Authors: Ming-Kuei Yeh, Jehn-Ruey Jiang, Shing-Tsaan Huang
Venue: Computer Communications (2009)

In an RFID system a reader requests tags to send their IDs by RF signal backscattering for the purpose of identification. When multiple tags respond to the request simultaneously, tag collisions occur and the tag identification performance is degraded. There are several tag anti-collision protocols proposed for reducing tag collisions. The protocols can be categorized into two classes: ALOHA-based and tree-based protocols that include deterministic tree-based and probabilistic counter-based subclasses of protocols. ALOHA-based protocols have the tag starvation problem; deterministic tree-based protocols have the problem that their performances are influenced by the length and/or the distribution of tag IDs. On the contrary, probabilistic counter-based protocols do not have such problems. In this paper, we propose a probabilistic counter-based tag anti-collision protocol, called ASPS, to reduce tag collisions by adaptively splitting tags encountering collisions into several groups according to the estimated number of tags to be split, and to reduce the number of messages sent between the reader and tags by utilizing a pre-signaling bit. We simulate and analyze ASPS and compare it with related ones to show its advantages.
Mining Healthcare Data with Temporal Association Rules: Improvements and Assessment for a Practical Use
Authors: Stefano Concaro, Lucia Sacchi, Carlo Cerra, Pietro Fratino, Riccardo Bellazzi
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

The Regional Healthcare Agency (ASL) of Pavia has been maintaining a central data repository which stores healthcare data about the population of Pavia area. The analysis of such data can be fruitful for the assessment of healthcare activities. Given the crucial role of time in such databases, we developed a general methodology for the mining of Temporal Association Rules on sequences of hybrid events. In this paper we show how the method can be extended to suitably manage the integration of both clinical and administrative data. Moreover, we address the problem of developing an automated strategy for the filtering of output rules, exploiting the taxonomy underlying the drug coding system and considering the relationships between clinical variables and drug effects. The results show that the method could find a practical use for the evaluation of the pertinence of the care delivery flow for specific pathologies.
Quality Enhancement Based on Reinforcement Learning and Feature Weighting for a Critiquing-Based Recommender
Authors: Maria Salamó, Sergio Escalera, Petia Radeva
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

Personalizing the product recommendation task is a major focus of research in the area of conversational recommender systems. Conversational case-based recommender systems help users to navigate through product spaces, alternatively making product suggestions and eliciting users feedback. Critiquing is a common form of feedback and incremental critiquing-based recommender system has shown its efficiency to personalize products based primarily on a quality measure. This quality measure influences the recommendation process and it is obtained by the combination of compatibility and similarity scores. In this paper, we describe new compatibility strategies whose basis is on reinforcement learning and a new feature weighting technique which is based on the user's history of critiques. Moreover, we show that our methodology can significantly improve recommendation efficiency in comparison with the state-of-the-art approaches.
Introduction to Social Network Analysis
Authors: Panayiotis Zaphiris, Chee Siang Ang
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Social Network analysis focuses on patterns of relations between and among people, organizations, states, etc. It aims to describe networks of relations as fully as possible, identify prominent patterns in such networks, trace the flow of information through them, and discover what effects these relations and networks have on people and organizations. Social network analysis offers a very promising potential for analyzing human-human interactions in online communities (discussion boards, newsgroups, virtual organizations). This Tutorial provides an overview of this analytic technique and demonstrates how it can be used in Human Computer Interaction (HCI) research and practice, focusing especially on Computer Mediated Communication (CMC). This topic acquires particular importance these days, with the increasing popularity of social networking websites (e.g., youtube, myspace, MMORPGs etc.) and the research interest in studying them.
Knowledge-increasable Neural Network Group and its Control Application
Authors: Jin Lv, Hai-wei Fan, Xiang-mo Zhao
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Aiming at the complex dynamic feature of large ship, an intelligent control structure based on Library-similar Knowledge-increasable Neural Network Group is presented. This compounded control structure using the dynamic knowledge-increasable learning capability of the neural network groups, solve the problems of online identification and online design of the controller, so that the high precise output tracking control of uncertain nonlinear large ship can be realized. Simulating results show that it is feasible and effective.
Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
Authors: Nathan Beckmann, Miodrag Potkonjak
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

A physically unclonable function (PUF) is a multiple-input, multiple-output, large entropy physical system that is unreproducible due to its structural complexity. A public physically unclonable function (PPUF) is a PUF that is created so that its simulation is feasible but requires very large time even when ample computational resources are available. Using PPUFs, we have developed conceptually new secret key exchange and public key protocols that are resilient against physical and side channel attacks and do not employ unproven mathematical conjectures. Judicious use of PPUF hardware sharing, parallelism, and provably correct partial simulation enables 1016 advantage of communicating parties over an attacker, requiring over 500 of years of computation even if the attacker uses all global computation resources.