ppxscal/embedding_network huggingface dataset:
Gender stereotyping over instant messenger: The effects of gender and context
Authors: Emily Christofides, Towhidul Islam, Serge Desmarais
Venue: Computers in Human Behavior (2009)

Researchers have observed that contrary to the high expectations for online communications, gender stereotyping has not disappeared in this medium, and is sometimes even accentuated. This study aimed to understand the effect of gender over instant messenger, a relatively new and unexplored medium. Instant messenger was chosen because it is a medium that is used most by youth who have grown up communicating online. Participants were interviewed over instant messenger about a potential online support service and were then asked to judge the effectiveness of their interviewer. The interviewer was identified only by a masculine or feminine name and was computer-simulated so as to remove any bias. The topic of discussion was stereotypically masculine or stereotypically feminine. Male participants were found to employ a male superiority heuristic, whereby they judged the male interviewer as more competent, regardless of the context. Female participants were hypothesized to judge the female interviewer as more competent in the feminine context, and the male interviewer as more competent in the masculine context (the context-gender match heuristic), but this hypothesis was not supported. The findings are discussed in the context of previous research on gender stereotyping in online communication.
A multi-agent system for service discovery, selection and negotiation
Authors: Stefano Bromuri, Visara Urovi, Maxime Morge, Kostas Stathis, Francesca Toni
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Service-oriented computing can benefit from multi-agent system technologies by adopting the coordination mechanisms, interaction protocols, and decision-making tools designed for multi-agent systems. We demonstrate here the use of a fully decentralised multi-agent system supporting the discovery, selection, and negotiation of services.
Smart Structures: Blurring the Distinction Between the Living and the Nonliving
Authors: Vinod K. Wadhawan
Venue: Monographs On The Physics And Chemistry Of Materials (2007)

A structure is an assembly that serves an engineering function. A smart structure is one that serves this function smartly i.e. by responding adaptively in a pre-designed useful and efficient manner to changing environmental conditions. Adaptive behavior of one of more materials constituting a smart structure requires nonlinear response. This book describes the three main types of nonlinear-response materials: ferroic materials, sort materials, and nanostructured materials. Information processing by biological and artificial smart structures is also discussed. A smart structure typical has sensors, actuators and a control system. Progress in all these aspects of smart structures has leant heavily on mimicking Nature and the all-important notion in this context has been that of evolution. Artificial Darwinian and Lamarckian evolution holds the key to the development of truly smart structures. Modestly intelligent robots are already on the horizon. Projections about the low cost availability of adequate computing power and memory size indicate that the future really belongs to smart structures. This book covers in a compact format the entire gamut of concepts relevant to smart structures. It will be of interest to a wide range of students and professionals in science and engineering. 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
Robust Unsupervised and Semi-supervised Bounded ν - Support Vector Machines
Authors: Kun Zhao, Ying-Jie Tian, Nai-Yang Deng
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Support Vector Machines (SVMs) have been dominant learning techniques for more than ten years, and mostly applied to supervised learning problems. These years two-class unsupervised and semi-supervised classification algorithms based on Bounded C-SVMs, Bounded &nu;-SVMs, Lagrangian SVMs (LSVMs) and robust version to Bounded C &nu; SVMs respectively, which are relaxed to Semi-definite Programming (SDP), get good classification results. But the parameter C in Bounded C-SVMs has no specific in quantification. Therefore we proposed robust version to unsupervised and semi-supervised classification algorithms based on Bounded &nu;- Support Vector Machines (B&nu;-SVMs). Numerical results confirm the robustness of proposed methods and show that our new algorithms based on robust version to B&nu;-SVM often obtain more accurate results than other algorithms.
Game theoretic packet relaying model for wireless ad hoc networks
Authors: Lu Yan
Venue: International Journal of Communication Networks and Distributed Systems (2009)

In wireless ad hoc networks, nodes are both routers and terminals, and they have to cooperate to communicate. Cooperation at the network layer means routing (finding a path for a packet) and forwarding (relaying packets for others). However, because wireless nodes are usually constrained by limited power and computational resources, a selfish node may be unwilling to spend its resources in forwarding packets that are not of its direct interest, even though it expects other nodes to forward its packets to the destination. In this paper, we propose a game theoretic model to facilitate the study of the non cooperative behaviours in wireless ad hoc networks and analyse incentive schemes to motivate cooperation among wireless ad hoc network nodes to achieve a mutually beneficial networking result.
Load Balancing Scheme Based on Real Time Traffic in Wibro
Authors: Wongil Park, Hyoungjin Kim
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

The WiBro operates at the 2.3GHz broadband and the communication infrastructure is a cellular system. The WiBro is based on IEEE 802.16e standard and it is designed to maintain connectivity on mobile environment at a speed of up to 60 km/h. ACR(Access Control Router) manages several RAS(Radio Access Station). When mobile node moves to another domain from the present domain, which is managed by different ACR, MN sends Binding Update to HA (Home Agent) or CN (Correspondent Node). However ACR may be a single point of performance bottleneck because the ACR should not only handle signaling traffics but also process data tunneling traffic for all MNs registered in its domain. In this paper, we propose ACR load balancing method by priority queue. Quantitative results of the performance analysis show that our proposal has superior performance.
GPU-Quicksort: A practical Quicksort algorithm for graphics processors
Authors: Daniel Cederman, Philippas Tsigas
Venue: Journal of Experimental Algorithmics (JEA) (2009)

In this article, we describe GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multicore graphics processors. Quicksort has previously been considered an inefficient sorting solution for graphics processors, but we show that in CUDA, NVIDIA's programing platform for general-purpose computations on graphical processors, GPU-Quicksort performs better than the fastest-known sorting implementations for graphics processors, such as radix and bitonic sort. Quicksort can thus be seen as a viable alternative for sorting large quantities of data on graphics processors.
On the dilation spectrum of paths, cycles, and trees
Authors: Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel Smid
Venue: Computational Geometry: Theory and Applications (2009)

Let G be a graph with n vertices which is embedded in Euclidean space R^d. For any two vertices of G, their dilation is defined to be the ratio of the length of a shortest connecting path in G to the Euclidean distance between them. In this paper, we study the spectrum of the dilation, over all pairs of vertices of G. For paths, cycles, and trees in R^2, we present O(n^3^/^2^+^@e)-time randomized algorithms that compute, for a given value @k>1, the exact number of vertex pairs of dilation at most @k. Then we present deterministic algorithms that approximate the number of vertex pairs of dilation at most @k to within a factor of 1+@e. They run in O(nlog^2n) time for paths and cycles, and in O(nlog^3n) time for trees, in any constant dimension d.
Using Bloom's taxonomy to code verbal protocols of students solving a data structure problem
Authors: Jennifer Parham, Donald Chinn, D. E. Stevenson
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

We describe a preliminary study exploring how computer science students solve a problem in an attempt to understand differences between the successful and the unsuccessful problem solver. Students followed a verbal protocol as they solved a data structures problem, and we analyzed the transcripts of these problem-solving sessions, classifying the statements students made using the revised Bloom's taxonomy. Based on our analysis in this case study, we conclude that the successful problem solver seems to move more frequently from one type of cognitive process to another than the unsuccessful problem solver. For the particular data structure problem the students attempted to solve, we observed that all problem solvers, successful or unsuccessful, tend to follow patterns in their problem-solving process.
Storage and Retrieval of Individual Genomes
Authors: Veli Mäkinen, Gonzalo Navarro, Jouni Sirén, Niko Välimäki
Venue: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (2009)

A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. Flexible and efficient data analysis on a such typically huge collection is plausible using suffix trees. However, suffix tree occupies O(N logN) bits, which very soon inhibits in-memory analyses. Recent advances in full-text self-indexing reduce the space of suffix tree to O(N log¿) bits, where ¿ is the alphabet size. In practice, the space reduction is more than 10-fold, for example on suffix tree of Human Genome. However, this reduction factor remains constant when more sequences are added to the collection.We develop a new family of self-indexes suited for the repetitive sequence collection setting. Their expected space requirement depends only on the length n of the base sequence and the number s of variations in its repeated copies. That is, the space reduction factor is no longer constant, but depends on N/n.We believe the structures developed in this work will provide a fundamental basis for storage and retrieval of individual genomes as they become available due to rapid progress in the sequencing technologies.
Inferring learning and attitudes from a Bayesian Network of log file data
Authors: Ivon Arroyo, Beverly Park Woolf
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

A student's goals and attitudes while interacting with a tutor are typically unseen and unknowable. However their outward behavior (e.g. problem-solving time, mistakes and help requests) is easily recorded and can reflect hidden affect status. This research evaluates the accuracy of a Bayesian Network to infer a student's hidden attitude toward learning, amount learned and perception of the system from log-data. The long term goal is to develop tutors that self-improve their student models and their teaching, dynamically can adapt pedagogical decisions about hints and help improve student's affective, intellectual and learning situation based on inferences about their goals and attitude.
Performance prediction based on hierarchy parallel features captured in multi-processing system
Authors: Jiaxin Li, Feng Shi, Ning Deng, Qi Zuo
Venue: Proceedings of the 18th ACM international symposium on High performance distributed computing (2009)

As the computing ability of high performance computers are improved by increasing the number of computing elements, how to utilize the available computing resources becomes an important issue. Different strategies to solve an problem based on a multi-processing system can bring about distinct performance. In this paper, we propose a method to predict the performance of parallel applications. The method describes the parallel features of the multi-processing systems in a hierarchy way, and evaluates solutions based on the description. In this way, programmers can find the better solution of an application before real programming.
Periodicity, repetitions, and orbits of an automatic sequence
Authors: Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit
Venue: Theoretical Computer Science (2009)

We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately periodic. We prove that it is decidable whether a given k-automatic sequence is overlap-free (or squarefree, or cubefree, etc.). We prove that the lexicographically least sequence in the orbit closure of a k-automatic sequence is k-automatic, and use this last result to show that several related quantities, such as the critical exponent, irrationality measure, and recurrence quotient for Sturmian words with slope @a, have automatic continued fraction expansions if @a does.
Data Mining for Security Applications and Its Privacy Implications
Authors: Bhavani Thuraisingham
Venue: Privacy, Security, and Trust in KDD: Second ACM SIGKDD International Workshop, PinKDD 2008, Las Vegas, NV, USA, August 24, 2008, Revised Selected Papers (2009)

In this paper we first examine data mining applications in security and their implications for privacy. We then examine the notion of privacy and provide an overview of the developments especially those on privacy preserving data mining. We then provide an agenda for research on privacy and data mining.
Diagrams, Tensors and Geometric Reasoning
Authors: J&#x00fc;rgen Richter-Gebert, Peter Lebmeir
Venue: Discrete Computational Geometry (2009)

Geometry and in particular projective geometry (and its corresponding invariant theory) deals a lot with structural properties of geometric objects and their interrelations. This papers describes how concepts of tensor calculus can be used to express geometric invariants and how, in particular, diagrammatic notation can be used to deal with invariants in a highly intuitive way. In particular we explain how geometries like euclidean or spherical geometry can be dealt with in this framework.
Compressing Binary Decision Diagrams
Authors: Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparisons with previously introduced techniques, showing that the new technique dominate on all tested instances.
Integers Powers of Certain Asymmetric Matrices
Authors: Roman Wituła, Damian Słota
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

In this paper we derive the recurrent formulae for any integers powers of certain asymmetric matrices five order which covers also constans tridiagonal matrices and some asymmetric (and symmetric) pentadiagonal matrices. Since we find also the Binet's formulae for the elements of the powers of these matrices, it is possible to operate with powers series of these matrices. We note that this method is alternative to the Jordan method decomposition.
Range assignment problem on the Steiner tree based topology in ad hoc wireless networks
Authors: Rashid Bin Muhammad
Venue: Mobile Information Systems (2009)

This paper describes an efficient method for introducing relay nodes in the given communication graph. Our algorithm assigns transmitting ranges to the nodes such that the cost of range assignment function is minimal over all connecting range assignments in the graph. The main contribution of this paper is the O(N log N) algorithm to add relay nodes to the wireless communication network and 2-approximation to assign transmitting ranges to nodes (original and relay). It does not assume that communication graph to be a unit disk graph. The output of the algorithm is the minimal Steiner tree on the graph consists of terminal (original) nodes and relay (additional) nodes. The output of approximation is the range assignments to the nodes.
A numerical model for the Boltzmann equation with applications to micro flows
Authors: Hans Babovsky
Venue: Computers Mathematics with Applications (2009)

Given an integer lattice L@?R^d, we define G as the orthogonal group leaving L invariant. Starting from a basic kinetic model on G we construct a collision operator on L which keeps all the essential features of the classical Boltzmann collision operator. For a particular 3D lattice we demonstrate the suitability of this discrete model for the numerical simulation of rarefied flows. For several examples, e.g. in the context of micro flows, we find a good qualitative and quantitative agreement of our simulation results with test data.
Accelerated Discovery of Discrete M-Clusters/Outliers on the Raster Plane Using Graphical Processing Units
Authors: Christian Trefftz, Joseph Szakas, Igor Majdandzic, Gregory Wolffe
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

This paper presents two discrete computational geometry algorithms designed for execution on Graphics Processing Units (GPUs). The algorithms are parallelized versions of sequential algorithms intended for application in geographical data mining. The first algorithm finds clusters of m points, called m-clusters, in the rasterized plane. The second algorithm complements the first by identifying outliers, those points which are not members of any m-clusters. The use of a raster representation of coordinates provides an ideal data stream environment for efficient GPU utilization. The parallel algorithms have low memory demands, and require only a limited amount of inter-process communication. Initial performance analysis indicates the algorithms are scalable, both in problem size and in the number of seeds, and significantly outperform commercial implementations.
Governance-Knowledge Fit in Systems Development Projects
Authors: Amrit Tiwana
Venue: Information Systems Research (2009)

This study addresses the theoretically underexplored question of how fit between project governance configurations, and the knowledge of specialized information technology (IT) and client departments, influences information systems development (ISD) performance. It conceptualizes project governance configurations using two classes of project decisions rights---decision control rights and decision management rights. The paper then develops a middle-range theory of how governance-knowledge fit shapes ISD performance by influencing the effective exercise of these decision rights during the development process. Further, the two dimensions of ISD performance---efficiency and effectiveness---are shaped by different classes of project decision rights. Data from 89 projects in 89 firms strongly support the proposed ideas. Implications for theory and practice are also discussed.
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
Authors: Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Consider the longest path problem for directed acyclic graphs (DAGs), where a mutually independent random variable is associated with each of the edges as its edge length. Given a DAG G and any distributions that the random variables obey, let F MAX(x) be the distribution function of the longest path length. We first represent F MAX(x) by a repeated integral that involves n ¿ 1 integrals, where n is the order of G. We next present an algorithm to symbolically execute the repeated integral, provided that the random variables obey the standard exponential distribution. Although there can be ¿(2 n ) paths in G, its running time is bounded by a polynomial in n, provided that k, the cardinality of the maximum anti-chain of the incidence graph of G, is bounded by a constant. We finally propose an algorithm that takes x and ¿> 0 as inputs and approximates the value of repeated integral of x, assuming that the edge length distributions satisfy the following three natural conditions: (1) The length of each edge (v i ,v j ) ¿ E is non-negative, (2) the Taylor series of its distribution function F ij (x) converges to F ij (x), and (3) there is a constant ¿ that satisfies $\sigma^p \le \left|\left(\frac{d}{dx}\right)^p F_{ij}(x)\right|$ for any non-negative integer p. It runs in polynomial time in n, and its error is bounded by ¿, when x, ¿, ¿ and k can be regarded as constants.
Standard calibration procedures for automated non-invasive measurement of blood pressure
Authors: E. Balestrieri, S. Rapuano
Venue: International Journal of Advanced Media and Communication (2009)

This paper focuses on the need for standardised calibration procedures for automated non-invasive measurement of blood pressure. A critical overview of the existing standards and protocols dealing with the calibration of these devices is provided highlighting the need for a univocal definition of their performance and accuracy, together with objective test methods. This is an expanded version of a paper presented at the 3rd IEEE International Workshop on Medical Measurements and Applications, 9 10 May 2008, Ottawa, ON, Canada.