ppxscal/embedding_network huggingface dataset:
A new rank correlation coefficient for information retrieval
Authors: Emine Yilmaz, Javed A. Aslam, Stephen Robertson
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In the field of information retrieval, one is often faced with the problem of computing the correlation between two ranked lists. The most commonly used statistic that quantifies this correlation is Kendall's Τ. Often times, in the information retrieval community, discrepancies among those items having high rankings are more important than those among items having low rankings. The Kendall's Τ statistic, however, does not make such distinctions and equally penalizes errors both at high and low rankings. In this paper, we propose a new rank correlation coefficient, AP correlation (Τap), that is based on average precision and has a probabilistic interpretation. We show that the proposed statistic gives more weight to the errors at high rankings and has nice mathematical properties which make it easy to interpret. We further validate the applicability of the statistic using experimental data.
A New Approach to Calculate the Best Context of a Tree and its Application in Defining a Constructive, Context Aware Crossover for GP
Authors: Hammad Majeed, Conor Ryan
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Genetic Programming (GP) is an evolutionary algorithm that evolves computer programs. Its main recombination operator is standard one point crossover which is generally accepted to be one of GP's weak points, due to its ignorance of the context into which genetic material is placed. This work introduces a new context aware recombination operator called Context-aware crossover. It implicitly calculates the best possible context of the subtree-to-be-exchanged in the other parent and places it there. It is tested on a wide range of problems and found quite constructive in general and quite effective on hard problems, in particular. It has also shown the ability to generate quite smaller trees than standard GP without effecting the fitness of a population adversely. 1 Problem Description The current state of the art in Evolutionary Computation for evolving computer programs is Genetic Programming (GP). The representation it employs is that of program trees, and crossover operates by exchanging sub-tree. One point crossover is the simplest and most commonly used recombination operator in standard GP. Although GP has enjoyed much success with this operator, its reliance on random selection and placement is widely accepted as the factor limiting its performance [4, 1]. This realization shifted the focus of the research in GP's standard crossover operator to define less destruc
C-index: trust depth, trust breadth, and a collective trust measurement
Authors: Weigang Wang, Mohd Mokhtar, Linda Macaulay
Venue: Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence (2008)

Many computational trust models measure collective trust or reputation by the total number or the percentage of (pure) positive feedback a collaborator received from a community. Such measurement usually failed to reflect on how deep a trust is (i.e., how many repeated/re-tested trustworthy collaborations a collaborator has had with another) and also how widely a trust is distributed across a community (i.e. how many trustworthy collaboration occurred with different collaborators). In this work, we have defined Trust Depth (TD), Trust Breadth (TB) to measure these two aspects and proposed a C-Index to measure them in one number. Scenarios are provided to show how the C-index might be used for identifying and selecting collaborative partners.
Power shifts in web-based translation memory
Authors: Ignacio Garcia
Venue: Machine Translation (2007)

Web-based translation memory (TM) is a recent and little-studied development that is changing the way localisation projects are conducted. This article looks at the technology that allows for the sharing of TM databases over the internet to find out how it shapes the translator's working environment. It shows that so-called pre-translation--until now the standard way for clients to manage translation tasks with freelancers--is giving way to web-interactive translation. Thus, rather than interacting with their own desktop databases as before, translators now interface with each other through server-based translation memories, so that a newly entered term or segment can be retrieved moments later by another translator working at a remote site. The study finds that, while the interests of most stakeholders in the localisation process are well served by this web-based arrangement, it can involve drawbacks for freelancers. Once an added value, technical expertise becomes less of a determining factor in employability, while translators lose autonomy through an inability to retain the linguistic assets they generate. Web-based TM is, therefore, seen to risk disempowering and de-skilling freelancers, relegating them from valued localisation partners to mere servants of the new technology.
Autonomic resource management in virtualized data centers using fuzzy logic-based approaches
Authors: Jing Xu, Ming Zhao, José Fortes, Robert Carpenter, Mazin Yousif
Venue: Cluster Computing (2008)

Data centers, as resource providers, are expected to deliver on performance guarantees while optimizing resource utilization to reduce cost. Virtualization techniques provide the opportunity of consolidating multiple separately managed containers of virtual resources on underutilized physical servers. A key challenge that comes with virtualization is the simultaneous on-demand provisioning of shared physical resources to virtual containers and the management of their capacities to meet service-quality targets at the least cost. This paper proposes a two-level resource management system to dynamically allocate resources to individual virtual containers. It uses local controllers at the virtual-container level and a global controller at the resource-pool level. An important advantage of this two-level control architecture is that it allows independent controller designs for separately optimizing the performance of applications and the use of resources. Autonomic resource allocation is realized through the interaction of the local and global controllers. A novelty of the local controller designs is their use of fuzzy logic-based approaches to efficiently and robustly deal with the complexity and uncertainties of dynamically changing workloads and resource usage. The global controller determines the resource allocation based on a proposed profit model, with the goal of maximizing the total profit of the data center. Experimental results obtained through a prototype implementation demonstrate that, for the scenarios under consideration, the proposed resource management system can significantly reduce resource consumption while still achieving application performance targets.
Witnesses for Boolean matrix multiplication and for shortest paths
Authors: N. Alon
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The subcubic (O(n/sup w/) for w(3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C=A.B but if C/sub ij/=1 they do not find an index k (a witness) such that A/sub ik/=B/sub kj/=1. The authors design a deterministic algorithm for computing the matrix of witnesses that runs in O(n/sup w/) time, where here O(n/sup w/) denotes O(n/sup w/(log n)/sup O(1)/). The subcubic methods to compute the shortest distances between all pairs of vertices also do not provide for witnesses; namely they compute the shortest distances but do not generate information for computing quickly the paths themselves. A witness for a shortest path from v/sub i/ to v/sub j/ is an index k such that v/sub k/ is the first vertex on such a path. They describe subcubic methods to compute such witnesses for several versions of the all pairs shortest paths problem. As a result, they derive shortest paths algorithms that provide characterization of the shortest paths in addition to the shortest distances in the same time (up to a polylogarithmic factor) needed for computing the distances; namely O(n/sup (3+w)/2/) time in the directed case and O(n/sup w/) time in the undirected case. They also design an algorithm that computes witnesses for the transitive closure in the same time needed to compute witnesses for Boolean matrix multiplication.
A VLSI architecture for image registration in real time
Authors: Nisgeeth Gupta, Nikhil Gupta
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Image registration is an ubiquitous task occurring in countless image analysis applications. A dedicated implementation of image registration algorithms is the best approach to meet the intensive computation requirements of implementing image registration schemes in real time. This paper presents an efficient VLSI architecture for real-time implementation of image registration algorithms using an exhaustive search method. Normalized cross correlation function, mean square error, and blue screen technique algorithms are implemented for image registration. The architecture is based on a data flow design that allows sequential inputs but performs parallel processing. Based on the architecture, a programmable chip can be designed for image registration. Chips can be cascaded to achieve better performance and sizes of both the search and the reference image which can vary with time from a small to a very large value.
Models of population dynamics (abstract only)
Authors: Brandon Burkhart
Venue: ACM Communications in Computer Algebra (2008)

This project explains the mathematical equations used to approximate species populations. The equations used are the exponential growth rate, logistic growth rate, and the predator-prey systems. The purpose is to show how the equations are taken from simple mathematical principles and assumptions. Basic techniques in Calculus and Linear Algebra are used to analyze the quantitative properties of solutions to the differential equation models.
A note on vertex pancyclic oriented graphs
Authors: Jørgen Bang-Jensen, Yubao Guo
Venue: Journal of Graph Theory (1999)

Let D be an oriented graph of order n &ge; 9, minimum degree at least n - 2, such that, for the choice of distinct vertices x and y, either xy &epsilon; E(D) or d+(x) + d-(y) &ge; n - 3. Song (J. Graph Theory 18 (1994), 461468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also generalizes a result of Jackson (J. Graph Theory 5 (1981), 147157) for the existence of a hamiltonian cycle in oriented graphs. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 313318, 1999
Map Matching and Data Association for Large-Scale Two-dimensional Laser Scan-based SLAM
Authors: Michael Bosse, Robert Zlot
Venue: International Journal of Robotics Research (2008)

Reliable data association techniques for simultaneous localization and mapping (SLAM) are necessary for the generation of large-scale maps in unstructured outdoor environments. Data association techniques are required at two levels: the local level represents the inner loop of the mapping algorithm, and the global level where newly mapped areas are matched to previously mapped areas to detect repeated coverage and close loops. Local map building is achieved using a robust iterative scan matching technique incorporated into an extended Kalman filter where the state consists of the current pose and previous poses sampled periodically and at a fixed lag from the current time. The introduction of states at a fixed time lag significantly reduces the growth of errors in the location estimate and the resultant map. For global matching, we enhance existing histogram cross-correlation techniques, introducing entropy sequences of projection histograms and an exhaustive correlation approach for reliable matching in unstructured environments. This enables loop closure without depending on prior knowledge of map alignment. These data association techniques are incorporated into the Atlas SLAM framework, enabling the generation of accurate two-dimensional laser maps over tens of kilometers in challenging outdoor environments.
In Vivo Proton Magnetic Resonance Spectroscopic Study of the Healthy Chinese Adult Pons
Authors: J. T. Guan, X. H. Xu, Y. Q. Geng, X. J. Yu, R. H. Wu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Objective: To detect the normal standard of metabolic ratios in the Pons of healthy adult Chinese subjects by using proton magnetic resonance spectroscopy (1HMRS). Materials and Methods: Eighty healthy Chinese subjects were divided into four groups, containing of 20 subjects per decade, ranging 21 to 60 years. Spectra were obtained from at 1.5T MR scanner by using a PRESS sequence with Repetition Time (TR)/ Echo Time (TE) of 1500/144ms. Results: The total mean ratios of N-acetylasparate/ creatine-phosphocreatine(NAA/Cr), NAA/Cr+ choline-containing compound(Cho) and Cho/Cr in subjects ranging from 21 to 60 years were 2.127±0.071, 0.811±0.059 and 1.814±0.094, respectively. The metabolic ratios in men were higher than in women. However, there was no significant difference with respect to age or gender. Conclusions: The ratios of NAA/Cr, NAA/Cr+Cho, Cho/Cr in the Pons did not correlate with age or gender of healthy subjects.
Mobile analytics for emergency response and training
Authors: SungYe Kim, Ross Maciejewski, Karl Ostmo, Edward J. Delp, Timothy F. Collins, David S. Ebert
Venue: Information Visualization (2008)

During emergency response events, situational awareness is critical in effectively managing and safe-guarding civilians and in-field personnel. To better support both command center controllers and in-field operators, we have developed a mobile visual analytics tool to help enhance situational awareness and support rapid decision making. Our mobile visual analytics tool consists of a 2D/3D visualization component, which shows personnel-related information, situational and static scene-related information, integrated multi media playback functionality for personnel outfitted with cameras, and fast-forward/rewind capabilities for reviewing events. Our current system has been employed in the evaluation of two different scenarios: a simulated evacuation of The Station nightclub fire that occurred in Rhode Island during 2003 and a testing exercise for a rescue operation in an elementary school. Our system has been deployed on a Dell Axim X51v PDA, an OQO 02, and on a Sprint PCS VisionSM smart device PPC-6700.
The Business of Digital Disability
Authors: Gerard Goggin, Christopher Newell
Venue: The Information Society (2007)

The paradox of disability and inclusive information technology is considered. If we are now possessed of greater knowledge about disability and design, why is accessible and inclusive technology so difficult to bring about? Is it because inclusive technology is not profitable, and so unattractive for businesses and unsustainable as an industry? Or is the answer more education and awareness? This paper seeks to reframe dominant approaches to disability, information technology, and policy, by offering a thesis centred upon the power relations of disability and the crucial role played by disability's cultural and social constitution. In explaining and testing the theory, we look at case studies from telecommunications, mobile phones, and the Internet.
A collaborative filtering framework based on both local user similarity and global user similarity
Authors: Heng Luo, Changyong Niu, Ruimin Shen, Carsten Ullrich
Venue: Machine Learning (2008)

Collaborative filtering as a classical method of information retrieval has been widely used in helping people to deal with information overload. In this paper, we introduce the concept of local user similarity and global user similarity, based on surprisal-based vector similarity and the application of the concept of maximin distance in graph theory. Surprisal-based vector similarity expresses the relationship between any two users based on the quantities of information (called surprisal) contained in their ratings. Global user similarity defines two users being similar if they can be connected through their locally similar neighbors. Based on both of Local User Similarity and Global User Similarity, we develop a collaborative filtering framework called LS GS. An empirical study using the MovieLens dataset shows that our proposed framework outperforms other state-of-the-art collaborative filtering algorithms.
Promoting levels of openness on component-based adaptable middleware
Authors: Tarcisio da Rocha, Anna-Brith Arntsen, Arne Ketil Eidsvik, Maria Beatriz Felgar de Toledo, Randi Karlsen
Venue: Proceedings of the 6th international workshop on Adaptive and reflective middleware: held at the ACM/IFIP/USENIX International Middleware Conference (2007)

It is widely accepted that middleware is an important architectural element which facilitates the development of software systems. In this paper we propose a novel approach for designing middleware. It is based on hardware motherboards and two distinct views with a clear separation of concerns. The view for middleware designer (MD-view) is concerned with all complex details of middleware structure and the view for middleware users (MU-view) is only concerned with an abstract set of open architectural elements that can be used to customize the middleware.
Reconfigurable grooming of dynamic traffic in SONET/WDM ring networks
Authors: Shu-tong Xie, Yong Xu
Venue: Journal of High Speed Networks (2007)

Traffic grooming is one of the most important problems in optical networks with high scientific and commercial value. Efficient grooming of traffic can not only effectively reduce the network's cost but also optimize its performance. To deal with the grooming of changing traffic in SONET/WDM rings, we classified it into the following two types: (1) reconfigurable grooming of deterministic dynamic traffic (REGDT); (2) reconfigurable grooming of non-deterministic dynamic traffic (REGNT). Two types of REGNT are studied, and two cases (best-fit and full-fit) for handling it were proposed in this paper. Further more, two heuristic algorithms, GA1 and GA2, which combine genetic algorithm with traffic-splitting heuristics, were developed to deal with each case. Computer simulations showed that the algorithms proposed in this paper can achieve much better results than previous ones for these two cases.
Optimal Audio Transmission over Wireless Tandem Channels
Authors: Ala' Khalifeh, Homayoun Yousefi'zadeh
Venue: Proceedings of the Data Compression Conference (2008)

In this paper, we propose a statistical optimization framework for transmitting audio sequences over wireless links. Our proposed framework protects audio frames against both temporally correlated random bit errors introduced by a fading channel and packet erasures caused by network buffering. Forming a two-dimensional grid of symbols, our framework forms horizontal packets that are compensated only vertically against both types of errors. The utilized one-dimensional error correction coding scheme of our framework assigns parity bits according to the perceptual importance of frames such that the Segmented SNR of a received audio sequence is maximized. In addition, the proposed framework suggests an effective way of reducing the packetization overhead of small audio frames.
An operational deforestation mapping system using MODIS data and spatial context analysis
Authors: N. C. Ferreira, L. G. Ferreira, A. R. Huete, M. E. Ferreira
Venue: International Journal of Remote Sensing (2007)

The Brazilian Amazon has the world's highest absolute rate of forest loss, currently averaging nearly 2 million hectares per year. In this study, we present a near-real-time automated deforestation mapping system for the Brazilian Amazon based on the analysis of spatial context information and MODIS Vegetation Index products and implemented on an ArcGIS 9.0 platform. This system, already validated and operational, was developed as part of the "Integrated Warning Deforestation System for the Amazon" (SIAD), an initiative of the Brazilian government within the scope of the Amazon Protection System (SIPAM), which also comprises: (1) a spatial information module, aimed at the assessment of the causes and impacts of the deforested areas; (2) a prediction module, indicative of deforestation trends; and (3) a data and information gateway based on map server technology.
Towards Autonomic Communication Mechanisms for Service Composability Management
Authors: Thomas Magedanz, José A. Lozano, Florian Schreiner, Fabricio Gouveia, Juan M. González
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

The Autonomic Communication Forum dedicates itself to leverage innovative mechanisms in order to provide new levels of integrated autonomicity to a future self-managed networks and network elements. Current trends in networking technologies are applying Services Oriented Architecture (SOA) principles and concepts. Trying to improve the SOA capacities with the autonomic principles, the Autonomic Communications Forum (ACF) has created the Service Composability Management Working Group (SCM WG). This document outlines the fundamental objectives of the ACF SCM WG explaining potential benefits for the telecommunication industry, they are extending the spectrum of research. As Next Generation Networks seem to be the next telecommunication network and services architecture, the main section explains where SCM principles will be utilized in order to enhance NGN service composition mechanisms as well as NGN composite service management mechanisms.
FEDC: Control Flow Error Detection and Correction for Embedded Systems without Program Interruption
Authors: Navid Farazmand, Mahdi Fazeli, Seyyed Ghasem Miremadi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper proposes a new technique called CFEDC to detect and correct control flow errors (CFEs) without program interruption. The proposed technique is based on the modification of application software and minor changes in the underlying hardware. To demonstrate the effectiveness of CFEDC, it has been implemented on an OpenRISC 1200 as a case study. Analytical results for three workload programs show that this technique detects all CFEs and corrects on average about 81.6% of CFEs. These figures are achieved with zero error detection/correction latency. According to the experimental results, the overheads are generally low as compared to other techniques; the performance overhead and the memory overhead are on average 8.5% and 9.1%, respectively. The area overhead is about 4% and the power dissipation increases by the amount of 1.5% on average.