ppxscal/embedding_network huggingface dataset:
Nature-Inspired Algorithms for Optimisation, 1st edition
Authors: Raymond Chiong
Venue: Studies In Computational Intelligence (2009)

Nature-Inspired Algorithms are gaining much popularity in recent years due to the fact that many real-world optimisation problems have become increasingly large, complex and dynamic. The size and complexity of the problems nowadays require the development of methods and solutions whose efficiency is measured by their ability to find acceptable results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This volume "Nature-Inspired Algorithms for Optimisation" is a collection of the latest state-of-the-art algorithms and important studies for tackling various kinds of optimisation problems. It comprises 18 chapters, including two introductory chapters which address the fundamental issues that have made optimisation problems difficult to solve and explain the rationale for seeking inspiration from nature. The contributions stand out through their novelty and clarity of the algorithmic descriptions and analyses, and lead the way to interesting and varied new applications. 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 fuzzy logic based approach for structure-free aggregation in vehicular ad-hoc networks
Authors: Stefan Dietzel, Boto Bako, Elmar Schoch, Frank Kargl
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

Information aggregation is used to merge correlated data items from different nodes before redistributing them. Thus, using aggregation the number of transmissions and the communication overhead can be reduced significantly. Especially for applications which require periodic dissemination of information into a large region, aggregation is a prerequisite. Consider for example a traffic information system where each vehicle periodically disseminates information about road conditions. The aim is to provide drivers with accurate information on traffic conditions for a large road section, so drivers can be informed in time and can take alternate routes in case of traffic congestion, for example. Many aggregation approaches for VANETs use a fixed or structured segmentation of roads for these applications. Based on such segments the aggregation function is applied to fuse data. We argue that such fixed bounds contradict the real situation on roads. Thus either the segments are too large, resulting in loss of accuracy or the segments are too small, resulting in high communication load. Therefore, we propose in this work a system for completely structure-free aggregation. We employ fuzzy reasoning to allow for aggregation decisions to be based on a flexible and extensible set of criteria. These criteria can be application specific and enable a dynamic fragmentation of the road according to the applications' requirements.
Information Systems for Federated Biobanks
Authors: Johann Eder, Claus Dabringer, Michaela Schicho, Konrad Stark
Venue: Transactions on Large-Scale Data- and Knowledge-Centered Systems I (2009)

Biobanks store and manage collections of biological material (tissue, blood, cell cultures, etc.) and manage the medical and biological data associated with this material. Biobanks are invaluable resources for medical research. The diversity, heterogeneity and volatility of the domain make information systems for biobanks a challenging application domain. Information systems for biobanks are foremost integration projects of heterogenous fast evolving sources.The European project BBMRI (Biobanking and Biomolecular Resources Research Infrastructure) has the mission to network European biobanks, to improve resources for biomedical research, an thus contribute to improve the prevention, diagnosis and treatment of diseases.We present the challenges for interconnecting European biobanks and harmonizing their data. We discuss some solutions for searching for biological resources, for managing provenance and guaranteeing anonymity of donors. Furthermore, we show how to support the exploitation of such a resource in medical studies with specialized CSCW tools.
A Scheme for Computing Minimum Covers within Simple Regions
Authors: Matthew J. Katz, Gila Morgenstern
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Let X be a simple region (e.g., a simple polygon), and let Q be a set of points in X. Let O be a convex object, such as a disk, a square, or an equilateral triangle. We present a scheme for computing a minimum cover of Q with respect to X, consisting of homothetic copies of O. In particular, a minimum disk cover of Q with respect to X, can be computed in polynomial time.
Using Sensor Noise to Identify Low Resolution Compressed Videos from YouTube
Authors: Wiger Houten, Zeno Geradts
Venue: Proceedings of the 3rd International Workshop on Computational Forensics (2009)

The Photo Response Non-Uniformity acts as a digital fingerprint that can be used to identify image sensors. This characteristic has been used in previous research to identify scanners, digital photo cameras and digital video cameras. In this paper we use a wavelet filter from Lukáš et al [1] to extract the PRNU patterns from multiply compressed low resolution video files originating from webcameras after they have been uploaded to YouTube. The video files were recorded with various resolutions, and the resulting video files were encoded with different codecs. Depending on video characteristics (e.g. codec quality settings, recording resolution), it is possible to correctly identify cameras based on these videos.
Quality Improvement of Knee Resurfacing with the Galileo Navigation System
Authors: Wilhelm Friedl, Ralf Imig
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

Clinical Problem: the knee joint has in the femur as well as tibia very long leaver arms. Therefore a misalignment of only 2 degrees of the femur already results with a 2cm distance of the mechanical axis to the centre of the femoral head. This leads to an asymmetric load distribution and so increased wear.
Ridges Based Curled Textline Region Detection from Grayscale Camera-Captured Document Images
Authors: Syed Saqib Bukhari, Faisal Shafait, Thomas M. Breuel
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

As compared to scanners, cameras offer fast, flexible and non-contact document imaging, but with distortions like uneven shading and warped shape. Therefore, camera-captured document images need preprocessing steps like binarization and textline detection for dewarping so that traditional document image processing steps can be applied on them. Previous approaches of binarization and curled textline detection are sensitive to distortions and loose some crucial image information during each step, which badly affects dewarping and further processing. Here we introduce a novel algorithm for curled textline region detection directly from a grayscale camera-captured document image, in which matched filter bank approach is used for enhancing textline structure and then ridges detection is applied for finding central line of curled textlines. The resulting ridges can be potentially used for binarization, dewarping or designing new techniques for camera-captured document image processing. Our approach is robust against bad shading and high degrees of curl. We have achieved around 91% detection accuracy on the dataset of CBDAR 2007 document image dewarping contest.
Incremental Learning In the Application of Intrusion Detection
Authors: Zhu Xiaorong, Wang Dianchun, Liu Jin, Tian Wei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The paper summarizes the characteristics of the support vector set and its changes in the incremental learning process, analyzes the concept of the support vector classification and the relationship with the separate super plane, gives the improvement of the Syed’s method, and verifies the superiority of the algorithm through numerical experimentation.
Nash Stability in Additively Separable Hedonic Games and Community Structures
Authors: Martin Olsen
Venue: Theory of Computing Systems (2009)

We prove that the problem of deciding whether a Nash stable partition exists in an Additively Separable Hedonic Game is NP-complete. We also show that the problem of deciding whether a non trivial Nash stable partition exists in an Additively Separable Hedonic Game with non-negative and symmetric preferences is NP-complete. We motivate our study of the computational complexity by linking Nash stable partitions in Additively Separable Hedonic Games to community structures in networks. Our results formally justify that computing community structures in general is hard.
Hair meshes
Authors: Cem Yuksel, Scott Schaefer, John Keyser
Venue: ACM Transactions on Graphics (TOG) (2009)

Despite the visual importance of hair and the attention paid to hair modeling in the graphics research, modeling realistic hair still remains a very challenging task that can be performed by very few artists. In this paper we present hair meshes, a new method for modeling hair that aims to bring hair modeling as close as possible to modeling polygonal surfaces. This new approach provides artists with direct control of the overall shape of the hair, giving them the ability to model the exact hair shape they desire. We use the hair mesh structure for modeling the hair volume with topological constraints that allow us to automatically and uniquely trace the path of individual hair strands through this volume. We also define a set of topological operations for creating hair meshes that maintain these constraints. Furthermore, we provide a method for hiding the volumetric structure of the hair mesh from the end user, thus allowing artists to concentrate on manipulating the outer surface of the hair as a polygonal surface. We explain and show examples of how hair meshes can be used to generate individual hair strands for a wide variety of realistic hair styles.
An integrated agent for playing real-time strategy games
Authors: Josh McCoy, Michael Mateas
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

We present a real-time strategy (RTS) game AI agent that integrates multiple specialist components to play a complete game. Based on an analysis of how skilled human players conceptualize RTS gameplay, we partition the problem space into domains of competence seen in expert human play. This partitioning helps us to manage and take advantage of the large amount of sophisticated domain knowledge developed by human players. We present results showing that incorporating expert high-level strategic knowledge allows our agent to consistently defeat established scripted AI players. In addition, this work lays the foundation to incorporate tactics and unit micromanagement techniques developed by both man and machine.
Mapping Computation with No Memory
Authors: Serge Burckel, Emeric Gioan, Emmanuel Thomé
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

We investigate the computation of mappings from a set S n to itself with in situ programs, that is using no extra variables than the input, and performing modifications of one component at a time. We consider several types of mappings and obtain effective computation and decomposition methods, together with upper bounds on the program length (number of assignments). Our technique is combinatorial and algebraic (graph coloration, partition ordering, modular arithmetics).For general mappings, we build a program with maximal length 5n ¿ 4, or 2n ¿ 1 for bijective mappings. The length is reducible to 4n ¿ 3 when |S| is a power of 2. This is the main combinatorial result of the paper, which can be stated equivalently in terms of multistage interconnection networks as: any mapping of {0,1} n can be performed by a routing in a double n-dimensional Beneš network. Moreover, the maximal length is 2n ¿ 1 for linear mappings when S is any field, or a quotient of an Euclidean domain (e.g. ¿/s¿). In this case the assignments are also linear, thereby particularly efficient from the algorithmic viewpoint.The in situ trait of the programs constructed here applies to optimization of program and chip design with respect to the number of variables, since no extra writing memory is used. In a non formal way, our approach is to perform an arbitrary transformation of objects by successive elementary local transformations inside these objects only with respect to their successive states.
The Geometrical Distortion of Discrete Global Grid in Multi-resolution Expression
Authors: Ming Tao, Zhuang Dafang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Multi-resolution expression is the import characteristic of discrete global grid. The geometrical distortion in multi-resolution expression can decide the ability of multi-scale transformation of discrete global grid. It is also the influencing factor of stability of discrete global grid. The source of geometrical distortion in multi-resolution expression was analyzed in this article. The method of expressing low-resolution partition by high-resolution partition in different parting depth was researched. The difference of error between expression by partition in steady depth and expression by direct calculation was analysed. Four representative discrete global grids were selected as objectsof study. They were QTM, Synder, SQT and STQIE. To every kind of discrete global grid, the quantity of area distortion and side distortion of parting triangle between actual partition and ideal partition was calculated. Based on the data of area and side and their error of each grid, the statistical indicators such as mean value standard deviation, relative range, Relative error of mean were analyzed. Finally the rules of area distortion in multi-resolution expression of different kind of discrete global grid were gotton. And it was also concluded that the influence of side distortion was few in multi-resolution expression.
Evaluating choice in universal access: an example from rehabilitation robotics
Authors: A. S. White, R. Adams, S. Prior
Venue: Universal Access in the Information Society (2009)

This paper describes a technique using dimensional analysis that so far has been rarely, if ever, used in studies of universal access. However, this procedure can produce a robust decision support process for inclusive designs. In this paper, it is applied to a case study of a wheelchair robot computer interface with choices in data input methods, addressing disparate requirements of different groups of intended users. The main underlying issue is to combine technical measurements, speed of operation and cost with subjective opinion. It turns out that Braglia&#x2019;s method has greater robustness in determining rank compared to standard techniques. In this, case a simple switch was rated better than a mouse or voice operation for control.
MACs: Multi-Attribute Co-clusters with High Correlation Information
Authors: Kelvin Sim, Vivekanand Gopalkrishnan, Hon Nian Chua, See-Kiong Ng
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

In many real-world applications that analyze correlations between two groups of diverse entities, each group of entities can be characterized by multiple attributes. As such, there is a need to co-cluster multiple attributes' values into pairs of highly correlated clusters. We denote this co-clustering problem as the multi-attribute co-clustering problem. In this paper, we introduce a generalization of the mutual information between two attributes into mutual information between two attribute sets. The generalized formula enables us to use correlation information to discover multi-attribute co-clusters (MACs). We develop a novel algorithm MACminer to mine MACs with high correlation information from datasets. We demonstrate the mining efficiency of MACminer in datasets with multiple attributes, and show that MACs with high correlation information have higher classification and predictive power, as compared to MACs generated by alternative high-dimensional data clustering and pattern mining techniques.
Analyzing CSCL-mediated science argumentation: how different methods matter
Authors: Jennifer Yeo, Yew-Jin Lee, Aik-Ling Tan, Seng-Chee Tan, Shawn Lum
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Research on argumentation has increased our understanding of knowledge construction, group learning, and scaffolding structures in CSCL although analyses of argumentation pose many difficulties. This could be due to the many theoretical positions that can be taken when approaching discourse data. In this paper, we use three popular analytic methods (interactional, content-specific, and linguistic) to compare the same fragment of scientific argumentation by Grade 4 children in Singapore. We show the complementary emphases and strengths of each disciplinary position as well as their weaknesses. The results imply that analytic methods arising from different disciplinary positions can potentially broaden our overall understanding of using argumentation in CSCL.
Multi-Domain Logic and its Applications to SAT
Authors: Tudor Jebelean, Gabor Kusper
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the satisfiability problem (SAT). AMulti–Domain Logic (MDL) formula is quantifier–free and contains only atoms of the form x ∈ A, where x is a variable and A is a constant set. For formulae in conjunctive normal form, we are interested in finding solutions (assignments to variables which satisfy all clauses). Classical propositional logic corresponds to the special case when each set is either {T} or {F}. The union of all the sets occurring for a certain variable can be seen as ”the domain” of that variable, thus MDL is also a generalization of multi-valued logic, but with different domains for variables. The most distinctive feature is, however, the indication of the sub-domain in each clause. The notions of resolution, subsumption, as well as the basic steps of the DPLL method generalize in an elegant and straightforward way. As a novel MDL specific technique, variable clustering consists in creating a new variable ranging over the cartesian product of the domains of several ”clustered” variables. This allows the transformation of classical SAT problems in MDL problems with less literals, and in which the propagation of information can be performed more efficiently than classical unit propagation. The basic idea of MDL originates from the earlier work of the second author on ”hyper-unit” propagation (that is simultaneous propagation of several unit clauses) and on the representation and propagation of ”k-literals” (generalized literals containing information on several propositional variables). Preliminary experiments with a prototype Java implementation exhibit speed–ups of up to 30 times
Brief paper: Adaptive neural network tracking control for manipulators with uncertain kinematics, dynamics and actuator model
Authors: Long Cheng, Zeng-Guang Hou, Min Tan
Venue: Automatica (Journal of IFAC) (2009)

A neural-network-based adaptive controller is proposed for the tracking problem of manipulators with uncertain kinematics, dynamics and actuator model. The adaptive Jacobian scheme is used to estimate the unknown kinematics parameters. Uncertainties in the manipulator dynamics and actuator model are compensated by three-layer neural networks. External disturbances and approximation errors are counteracted by robust signals. The actuator controller is designed based on the backstepping scheme. Compared with the existing work, the proposed method considers the manipulator kinematics uncertainty, does not need the ''linearity-in-parameters'' assumption for the uncertain terms in the dynamics of manipulator and actuator, and guarantees the tracking error to be as small as desired. Finally, the performance of the proposed approach is illustrated by the simulation example.
Study on Relationship between Beijing's Living Water Demand and Urbanization with Simple Partial Least-Squares Regression
Authors: Zhihong Zou, Yi Yun, Wei Zhang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

The rapid economic development has brought great change to the city of Beijing, and the living water demand is an important concern during the process of the booming urbanization. In this paper, the influence of urbanization on the city’s living water demand is analyzed. The indexes indicating urbanization were carefully chosen, and by studying the historical data of the city living water demand a simple partial least-squares (PLS) regression was constructed. The method provided an effective quantitative analysis for city water resource management, and could also be used for future prediction of living water demand.
A multi-rater nonparametric test of agreement and corresponding agreement plot
Authors: Alan D. Hutson
Venue: Computational Statistics Data Analysis (2010)

In this note we develop a new method for testing agreement in both the two-dimensional and p-dimensional settings. Our approach takes advantage of some readily available tests of uniformity found in most statistical software packages. In addition, we develop a corresponding agreement plot and define the agreement region. We compare our approach to the concordance correlation coefficient and the intraclass correlation in two dimensions. We conclude that our new test of agreement is more suited towards examining the specific hypothesis of perfect agreement between raters, devices or other such types of measures as defined by points falling precisely on the line of concordance in terms of power and type I error control.