ppxscal/embedding_network huggingface dataset:
Partition clustering of high dimensional low sample size data based on p-values
Authors: George von Borries, Haiyan Wang
Venue: Computational Statistics Data Analysis (2009)

Clustering techniques play an important role in analyzing high dimensional data that is common in high-throughput screening such as microarray and mass spectrometry data. Effective use of the high dimensionality and some replications can help to increase clustering accuracy and stability. In this article a new partitioning algorithm with a robust distance measure is introduced to cluster variables in high dimensional low sample size (HDLSS) data that contain a large number of independent variables with a small number of replications per variable. The proposed clustering algorithm, PPCLUST, considers data from a mixture distribution and uses p-values from nonparametric rank tests of homogeneous distribution as a measure of similarity to separate the mixture components. PPCLUST is able to efficiently cluster a large number of variables in the presence of very few replications. Inherited from the robustness of rank procedure, the new algorithm is robust to outliers and invariant to monotone transformations of data. Numerical studies and an application to microarray gene expression data for colorectal cancer study are discussed.
Structure and Recognition of Graphs with No 6-wheel Subdivision
Authors: Rebecca Robinson, Graham Farr
Venue: Algorithmica (2009)

The subgraph homeomorphism problem has been shown by Robertson and Seymour to be polynomial-time solvable for any fixed pattern graph H. The result, however, is not practical, involving constants that are worse than exponential in |H|. Practical algorithms have only been developed for a few specific pattern graphs, the most recent of these being the wheels with four and five spokes. This paper looks at the subgraph homeomorphism problem where the pattern graph is a wheel with six spokes. The main result is a theorem characterizing graphs that do not contain subdivisions of W 6. We give an efficient algorithm for solving the subgraph homeomorphism problem for W 6. We also give a strengthening of the previous W 5 result.
On a graded mesh method for a class of weakly singular Volterra integral equations
Authors: Jingtang Ma, Yingjun Jiang
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper a class of weakly singular Volterra integral equations with an infinite set of solutions is investigated. Among the set of solutions only one particular solution is smooth and all others are singular at the origin. The numerical solution of this class of equations has been a difficult topic to analyze and has received much previous investigation. The aim of this paper is to improve the convergence rates by a graded mesh method. The convergence rates are proved and a variety of numerical examples are provided to support the theoretical findings.
Layered RDF: An object-oriented approach to web information representation
Authors: Torunn Vølstad, Fei Liu, Sheng-Uei Guan
Venue: Web Intelligence and Agent Systems (2009)

Based on XML, RDF(S) has been recommended as the basic layer of the Semantic Web, providing a foundation for the higher layers of ontology, logic and trust. Although RDF(S) enables specification and identification of data and relationships between data, it has some limitations as a foundational language of the Semantic Web. Firstly, the unconstrained framework of the RDF Schema makes it hard to share information from different sources. Furthermore, RDF(S) has limited expres-siveness as a vocabulary description language, which is partly due to insufficient object-oriented features. Finally, the unclear semantics of RDF(S), caused by language constructs with dual roles, impede any approach to provide reasoning support for the language. To overcome some of the limitations, this paper presents Layered RDF, a web information representation language based on RDF(S). Layered RDF distinguishes schema information from instance information by having separated layers. Furthermore, Layered RDF provides more powerful schema mechanisms than does RDF Schema, by incorporating object-oriented features such as inheritance and polymorphism.
A First-Order Policy Language for History-Based Transaction Monitoring
Authors: Andreas Bauer, Rajeev Goré, Alwen Tiu
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting, the decision to trust a user may sensibly be based on that user's past behaviour. We introduce a specification language based on linear temporal logic for expressing a policy for categorising the behaviour patterns of a user depending on its transaction history. We also present an algorithm for checking whether the transaction history obeys the stated policy. To be useful in a real setting, such a language should allow one to express realistic policies which may involve parameter quantification and quantitative or statistical patterns. We introduce several extensions of linear temporal logic to cater for such needs: a restricted form of universal and existential quantification; arbitrary computable functions and relations in the term language; and a "counting" quantifier for counting how many times a formula holds in the past. We then show that model checking a transaction history against a policy, which we call the history-based transaction monitoring problem, is PSPACE-complete in the size of the policy formula and the length of the history, assuming that the underlying interpreted functions and relations are polynomially computable. The problem becomes decidable in polynomial time when the policies are fixed. We also consider the problem of transaction monitoring in the case where not all the parameters of actions are observable. We formulate two such "partial observability" monitoring problems, and show their decidability under certain restrictions.
Towards a Channel Capacity of Communication Networks
Authors: Frank Emmert-Streib, Matthias Dehmer
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

We propose a new measure that quantifies the communication capabilities of networks. More precisely, in this paper we show that the well known channel capacity of a memoryless channel, introduced in information theory, can be defined for arbitrary directed networks. We argue that this new measure, which we call network channel capacity, might be useful for characterizing and classifying communication networks. As first examples we present results for random networks and discuss practical implications.
Conceptual Graphs and Datatypes
Authors: Thomas Raimbault, David Genest, Stéphane Loiseau
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

Datatypes, like numbers or strings, are widely used in Knowledge Representation (e.g. in RDF(S)/OWL or UML languages). The usual model of simple conceptual graphs does not support datatypes. Some extensions of conceptual graphs have been proposed for using datatypes, however these extensions often wander from initial model of conceptual graphs by introducing for instance procedural relations between nodes. This paper proposes a datatype extension for the simple conceptual graph model. Our contribution is threefold. First, we allow the use of datatypes for typing concept nodes. Second, we define two families of conceptual graphs: factual graphs and query graphs, both close to initial model. Factual graph is used to represent factual knowledge, including values of datatypes. Query graph may contain concept nodes that represent conditional queries on values of datatypes; these conditions are expressed by regular operators on datatypes. Third, we adapt projection to operate from a query graph to a factual graph.
The Art of 3D Computer Animation and Effects, 4th edition
Authors: Isaac Kerlow
Venue:  (2009)

Master the art of computer animation and visual effects production with the latest edition of this cutting-edge guide This remarkable edition of The Art of 3D Computer Animation and Effects offers clear, step-by-step guidelines for the entire process of creating a fully rendered 3D computer animation. With up-to-date coverage of the latest computer animation styles and techniques, this versatile guide provides insightful information for creating animations and visual effectsfrom creative development and preproduction to finished animation. Designed to work with any computer platform, this Fourth Edition cuts through technical jargon and presents numerous easy-to-understand instructivediagrams. Full-color examples are presentedincluding VFX and animated feature movies, games, and TV commercialsby such leading companies as Blue Sky, Blur, BUF, Disney, DreamWorks, Electronic Arts, Framestore, ILM, Imagi, Microsoft, Mac Guff, The Mill, Menfond, Pixar, Polygon, Rhythm & Hues, Sony Imageworks, Tippett, Ubisoft, and Weta, and many other studios and groundbreaking independent artists from around the world. This fully revised edition features new material on the latest visual effects techniques, a useful update of the traditional principles of animation, practical information on creative development, multiple production pipeline ideas for shorts and visual effects, plus updated information on current production trends and techniques in animation, rendering, modeling, rigging, and compositing. Whether you are a student, an independent artist or creator, or a production company team member, The Art of 3D Computer Animation and Effects, Fourth Edition gives you a broad palette of tips and techniques for bringing your visions to life through 3D computer animation.
Study on Pre-processing Methods of Precision Bearing Vibration Signal
Authors: Qing-jie Liu, Xiao-fang Liu, Zhan Jun
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

As pre-processing methods, both eliminating polynomial trend and five points three times smooth are used to analyze the vibration signal which sampling from an experiment. The original signal’s curve smoothness and high-low-frequency are compared with those processed using of each method. The result shows that the five point three times smooth pre-processing method is effective in denoising precision bearing vibration signal while eliminating polynomial trend method is useless.
Grid Services and Satellite Image Processing for Urban and River Bed Changes Assessment
Authors: Cristina Gherghina, Eliza Isbasoiu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Satellite images can provide huge amounts of data that in principle could be processed and provide very useful information in many areas. Grid based architectures might be suitable platforms for their digital processing and analysis because they offer the required computational power to process satellite data in real time. Here, we describe several Grid Services which implement some of the satellite images processing and analysis techniques used to detect urban growth and river bed changes. Thus, we have implemented a supervised image classification algorithm which marks out the urban or river bed areas, and a comparison image algorithm, which compares two classified images, taken in 1970 and 2000, and highlights the urban or river bed changes.
Alleviating reader collision problem in mobile RFID networks
Authors: Ching-Hsien Hsu, Shih-Chang Chen, Chia-Hao Yu, Jong Hyuk Park
Venue: Personal and Ubiquitous Computing (2009)

With the emergence of wireless RFID technologies, the problem of scheduling transmissions in dynamic RFID systems has been arousing attention. In recent year, it has also instigated researches to propose different heuristic algorithms for scheduling transactions between RFID readers and tags. In this paper, we present a two phase dynamic modulation (TPDM) technique, which consists of regional scheduling and hidden terminal scheduling phases, aims to efficiently perform communications between readers and tags in high density and mobile RFID networks. TPDM is a simple mechanism for coordinating simultaneous transmissions among multiple readers and hidden terminals. A significant improvement of this approach is that TPDM can prevent reader collisions by using a distributed self-scheduling scheme. An advantage of the proposed technique is that TPDM is adaptive in both static and dynamic RFID environments. To evaluate the performance of the proposed technique, we have implemented the TPDM scheme along with the Colorwave and Pulse protocols. The experimental results show that the TPDM scheduling techniques provide superior and stable performance in both static and dynamic circumstance, especially in mobile and high density RFID environments. The TPDM is shown to be effective in terms of throughput, system efficiency, and easy to implement.
Achieving High Availability on Linux for System Z With Linux-ha Release 2
Venue:  (2009)

As Linux on System z becomes more prevalent and mainstream in the industry, the need for it to deliver higher levels of availability is increasing. IBM supports the High Availability Linux (Linux-HA) project, which provides high availability functions to the open source community. One component of the Linux-HA project is the Heartbeat program, which runs on every known Linux platform. Heartbeat is part of the framework of the Linux-HA project. This IBM Redbooks publication provides information to help you evaluate and implement Linux-HA release 2 by using Heartbeat 2.0 on the IBM System z platform with either SUSE Linux Enterprise Server version 10 or Red Hat Enterprise Linux 5. To begin, we review the fundamentals of high availability concepts and terminology. Then we discuss the Heartbeat 2.0 architecture and its components. We examine some of the special considerations when using Heartbeat 2.0 on Linux on System z, particularly Linux on z/VM, with logical partitions (LPARs), interguest communication by using HiperSocketsTM, and Shoot The Other Node In The Head (STONITH) by using VSMSERVE for Simple Network IPL (snIPL). By reading this book, you can examine our environment as we outline our installation and setup processes and configuration. We demonstrate an active and passive single resource scenario and a quorum scenario by using a single resource with three guests in the cluster. Finally, we demonstrate and describe sample usage 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
An Advanced Modality of Visualization and Interaction with Virtual Models of the Human Body
Authors: Lucio T. Paolis, Marco Pulimeno, Giovanni Aloisio
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

The developed system is the first prototype of a virtual interface designed to avoid contact with the computer so that the surgeon is able to visualize models of the patient's organs more effectively during surgical procedure. In particular, the surgeon will be able to rotate, to translate and to zoom in on 3D models of the patient's organs simply by moving his finger in free space; in addition, it is possible to choose to visualize all of the organs or only some of them. All of the interactions with the models happen in real-time using the virtual interface which appears as a touch-screen suspended in free space in a position chosen by the user when the application is started up. Finger movements are detected by means of an optical tracking system and are used to simulate touch with the interface and to interact by pressing the buttons present on the virtual screen.
Postgraduate Studies in the Field of HCI
Authors: Teija Vainio, Veikko Surakka, Roope Raisamo, Kari-Jouko Räihä, Poika Isokoski, Kaisa Väänänen-Vainio-Mattila, Sari Kujala
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

In September of 2007, the Tampere Unit for Computer Human Interaction (TAUCHI) at the University of Tampere and The Unit of Human-Centered Technology (IHTE) at the Tampere University of Technology initiated a joint effort to increase collaboration in the field of human-technology interaction (HTI). One of the main aims was to develop higher quality education for university students and to carry out joint internationally recognized HTI research. Both research units have their own master and postgraduate students while the focus of education is at IHTE on usability and humancentered design of interactive products and services whereas TAUCHI focuses on human-technology interaction developing it by harmonizing the potential of technology with human abilities, needs, and limitations. Based on our joint analysis we know now that together TAUCHI and IHTE are offering an internationally competitive master's program consisting of more than 40 basic, intermediate and advanced level courses. Although both units are partners in the national Graduate School in User- Centered Information Technology (UCIT) led by TAUCHI we have recognized a clear need for developing and systematizing our doctoral education.
Learning Language and Culture Via Public Internet Discussion Forums
Authors: Barbara Hanna, Juliana De Nooy
Venue:  (2009)

Public Internet discussion forums offer opportunities for intercultural interaction in many languages on a vast range of topics, butare often overlooked by language educators in favour of purpose-built exchanges between learners. The book investigates this untapped pedagogical potential.
Machine structure oriented control code logic
Authors: J. A. Bergstra, C. A. Middelburg
Venue: Acta Informatica (2009)

Control code is a concept that is closely related to a frequently occurring practitioner&#x2019;s view on what is a program: code that is capable of controlling the behaviour of some machine. We present a logical approach to explain issues concerning control codes that are independent of the details of the behaviours that are controlled. Using this approach, such issues can be explained at a very abstract level. We illustrate this among other things by means of an example about the production of a new compiler from an existing one. The approach is based on abstract machine models, called machine structures. We introduce a model of systems that provide execution environments for the executable codes of machine structures and use it to go into portability of control codes.
A New Approach for Segmentation and Recognition of Arabic Handwritten Touching Numeral Pairs
Authors: Huda Alamri, Chun Lei He, Ching Y. Suen
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper, we propose a new approach on segmentation and recognition of off-line unconstrained Arabic handwritten numerals, which failed to be segmented with connected component analysis. In our approach, the touching numerals are automatically segmented when a set of parameters is chosen. Models with different sets of parameters for each numeral pair are designed for recognition. Each image in each model is recognized as an isolated numeral. After normalizing and binarizing the images, gradient features are extracted and recognized using SVMs. Finally, a post-processing is proposed by based on the optimal combinations of the recognition probabilities for each model. Experiments were conducted on the CENPARMI Arabic, Dari, and Urdu touching numeral pair databases [1,12].
An Interactive Level Set Approach to Semi-automatic Detection of Features in Food Micrographs
Authors: Gaetano Impoco, Giuseppe Licitra
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Microscopy is often employed in food research to inspect the microstructural features of food samples. Accurate detection of microscopic features is required for reliable quantitative analysis. We propose a user-assisted approach that can be easily integrated into a graphical interface. The proposed algorithm is based on a fast approximation of the common region-based level set equation, providing interactive computations. Experiments have been run on cheese micrographs acquired with electron and confocal microscopes.
Attributed Data for CHR Indexing
Authors: Beata Sarna-Starosta, Tom Schrijvers
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing indexing strategies for ground terms, based on hash tables, incur considerable performance overhead, especially when frequently computing hash values for large terms.In this paper we (1) propose attributed data, a new data representation for ground terms inspired by attributed variables, that avoids the overhead of hash-table indexing, (2) describe program analysis and transformation techniques that make attributed data more effective, and (3) provide experimental results that establish the usefulness of our approach.
Identification of Success and Failure Factors of Two Agile Software Development Teams in an Open Source Organization
Authors: Periklis Tsirakidis, Felix Kobler, Helmut Krcmar
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Agile Software Development Methods and Free/Libre Open Source Development have been two embracing movements in the software industry for more than a decade. However, little is known about the composition of both while today a variety of studies provide us with key characteristics of each one. The study extracts the similarities and differences of both topics by means of an extensive literature review focusing on teams as research unit. Furthermore this study investigates two agile software development teams in an open source organization based on an explorative research design. The focus is on the empirical identiﬁcation of success and failure in the application of agile methods in teams with open source background, structure and characteristics and in comparison with the literature ﬁndings. This study is still in progress, however ﬁrst results as well as the methodology will be presented hereafter.
Expressive Power of Definite Clauses for Verifying Authenticity
Authors: Gilberto Filè, Roberto Vigo
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

Thanks to the work of Bruno Blanchet definite clauses are an established technique for verifying security properties of communication protocols. We investigate the expressive power of this approach with respect to verifying authenticity. A translation from protocols into definite clauses is given, and direct proofs for correctness and completeness of the authenticity verification based on these clauses are shown. These proofs are new, and in particular the completeness result is surprising. These results, beside their intrinsic value, shed light on some interesting issues about existing proposals for exploiting definite clauses in protocols verification.