ppxscal/embedding_network huggingface dataset:
Partner Selection and Evaluation in Virtual Research Center Based on Trapezoidal Fuzzy AHP
Authors: Zhimeng Luo, Jianzhong Zhou, Qingqing Li, Li Liu, Li Yang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

To the reduce the complexity and the uncertainty in selecting cooperation partner of virtual research center, a comprehensive evaluation model based on AHP and basic theory of the trapezoidal fuzzy number was proposed. In the model, the judgment matrix was first structured in trapezoid fuzzy number and the priority weights of criteria and sub-criteria were calculated, then the consistency of judgment matrix was tested in the necessary and sufficient condition of consistency. In the end, the alternatives are ranked with the integration of the fuzzy gravity method and the mean square difference method. Applying the trapezoidal fuzzy number makes the model combine qualitative analysis with quantitative analysis effectively, reduce influences of subjective factors and select the best cooperative partner objectively. In addition, the model can be easily programmed due to its simple, normative arithmetic formulas, thus can be widely used in practice. An example is presented where are four main criteria, sixteen sub-criteria and three alternatives.
Location-Based Activity Recognition
Authors: Dieter Fox
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Knowledge of a person's location provides important context information for many applications, ranging from services such as E911 to personal guidance systems that help cognitively-impaired individuals move safely through their community. Location information is also extremely helpful for estimating a person's high-level activities. In this talk we show how Bayesian filtering and conditional random fields can be applied to estimate the location and activity of a person using sensors such as GPS or WiFi. The techniques track a person on graph structures that represent a street map or a skeleton of the free space in a building. We also show how to learn a user's significant places and daily movements through the community. Our models use multiple levels of abstraction so as to bridge the gap between raw GPS measurements and high level information such as a user's mode of transportation, her current goal, and her significant places (e.g. home or work place). Finally, we will discuss recent work on using a multi-sensor board so as to better estimate a person's activities.
Additivity obstructions for integral matrices and pyramids
Authors: Miguel Santoyo, Ernesto Vallejo
Venue: Theoretical Computer Science (2008)

In Discrete Tomography there are two related notions of interest: H-uniqueness and H-additivity of finite subsets of N^m, which are defined for certain finite sets H of linear subspaces of R^m. One knows complete sets of obstructions for H-uniqueness (bad H-configurations) and for H-additivity (weakly bad H-configurations). The classical case, when H is the set of coordinate axes in R^2, is well known. Let H"m denote the set of the m coordinate hyperplanes of R^m. The following question was raised in [P.C. Fishburn, J.C. Lagarias, J.A. Reeds, L.A. Shepp, Sets uniquely determined by projections on axes II. Discrete case, Discrete Math. 91 (1991) 149-159]. Is there an upper bound on the weights of the bad H"m-configurations one needs to consider to determine H"m-uniqueness (m>=3) of an arbitrary set in N^m? This question can be asked for other sets H of linear subspaces and also for H-additivity. The answer to this question, in the case of uniqueness, is known when H is a set of lines. In this paper we answer this question for uniqueness and additivity in the case of H"3. We show that there is no upper bound on the weights of the bad configurations (resp. weakly bad configurations) one needs to consider to determine H"3-uniqueness (resp. H"3-additivity).
Comparing Document Classification Schemes Using K-Means Clustering
Authors: Artur Šilić, Marie-Francine Moens, Lovro Žmak, Bojana Dalbelo Bašić
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In this work, we jointly apply several text mining methods to a corpus of legal documents in order to compare the separation quality of two inherently different document classification schemes. The classification schemes are compared with the clusters produced by the K-means algorithm. In the future, we believe that our comparison method will be coupled with semi-supervised and active learning techniques. Also, this paper presents the idea of combining K-means and Principal Component Analysis for cluster visualization. The described idea allows calculations to be performed in reasonable amount of CPU time.
On the Optimality of Dubins Paths across Heterogeneous Terrain
Authors: Ricardo G. Sanfelice, Emilio Frazzoli
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

We derive optimality conditions for the paths of a Dubins vehicle when the state space is partitioned into two patches with different vehicle's forward velocity. We recast this problem as a hybrid optimal control problem and solve it using optimality principles for hybrid systems. Among the optimality conditions, we derive a "refraction" law at the boundary of the patches which generalizes the so-called Snell's law of refraction in optics to the case of paths with bounded maximum curvature.
Interpolation of hydrodynamic velocity data with the continuity equation
Authors: Marco A. Núñez, Ciro Flores, Héctor Juárez
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

Meteorologists have developed a way of obtaining a velocity field V that satisfies the incompressible-flow continuity equation &nabla; &middot; V=0 in a bounded domain &Omega;, starting from a finite set of data {V$_{true}$(x$_k$)}$_{k=1}^{N}$ measured in &Omega;. In this work a mathematical framework of the scheme, is given. The approach can be extended to consider data provided by experimental methods such as the so-called particle image velocimetry technique. The viability of the scheme is tested with synthetic data from analytic solutions of the two-dimensional version of the equation &nabla;&middot; V=0. Numerical examples show that the scheme can yield an accurate approximation V of the true velocity field V$_{true}$.
Upstream traffic management in EPONs: a simulation based analysis
Authors: M. Thanh NGO, Kamal Gakhar, Annie Gravey
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

An access network architecture using Passive Optical Networks (PON) with Dynamic Bandwidth Allocation (DBA) is currently considered to be one of the most promising solutions to meet increasing traffic demands. Upstream traffic management in PONs is fairly complex, which implies using simulation methods to assess its effectiveness. This paper presents the characteristics of a generic simulation platform that is currently developed in our team to evaluate the performance characteristics of PONs DBAs and to assess the efficiency of their QoS support.
An Incentive-Based System for Information Providers over Peer-to-Peer Mobile Ad-Hoc Networks
Authors: Jordi Castellà-Roca, Vanesa Daza, Josep Domingo-Ferrer, Jesús A. Manjón, Francesc Sebé, Alexandre Viejo
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

An architecture for a peer-to-peer mobile ad-hoc network offering distributed information provision is presented. Any user can volunteer to become an information server (a server-user). Volunteering implies devoting some of the user's computational resources (storage, bandwidth, processing power) to serving information. An incentive scheme is proposed to encourage end-users to become server-users. The latter are rewarded proportionally to the number of end-user queries served. The proposed architecture is specified as a protocol suite taking security and privacy aspects into account. Details are given on an implementation completed on a WiFi ad-hoc network for the specific case of a distributed tourist information service.
Real-Time Simulation of Granular Materials Using Graphics Hardware
Authors: Ren Yasuda, Takahiro Harada, Yoichiro Kawaguchi
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

We present a method to compute friction in a particle-based simulation of granular materials on GPUs and its data structure. We use Distinct Element Method to compute the force between particles. There has been a method to accelerate Distinct Element Method using GPUs, but the method does not compute friction. We implemented friction into the DEM simulation on GPUs and this leads to the real-time simulation of granular materials.
Joining the Semantic Web and Information Visualization
Authors: Karen Lawson
Venue: IEEE Distributed Systems Online (2004)

A book review of Visualizing the Semantic Web: XML-Based Internet and Information Visualization, edited by Vladimir Geroimenko and Chaomei Chen. 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
Sustained Petascale: The Next MPI Challenge
Authors: Al Geist
Venue: Proceedings of the 14th European PVM/MPI User's Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2007)

The National Science Foundation in the USA has launched an ambitious project to have a sustained petaflop computer in production by 2011. For applications to run at a sustained petaflop, the computer will need to have a peak performance of nearly 20 PF and millions of threads. This talk will address the challenges MPI must face to be used in sustained petascale applications.The first significant challenge for MPI will be the radical change in supercomputer architectures over the next few years. The architectures are shifting from using faster processors to using multi-core processors. It is also speculated that the processors will be heterogeneous with the cores on a single processor having different functions. This change in architecture is as disruptive to software as the shift from vector to distributed memory supercomputers 15 years ago. That change required complete restructuring of scientific application codes and gave rise to the message passing programming paradigm that drove the popularity of PVM and MPI. Similarly, will these new architectures drive the creation of a new programming paradigm or will MPI survive? Or perhaps MPI becomes part of a new hybrid paradigm. These questions will be addressed in this talk.The configuration of these sustained petascale systems will require applications to exploit million-way parallelism and significant reductions in the bandwidth and amount of memory available to a million cores. Most science teams have no idea how to efficiently scale their applications to this level and those teams that have thought about it believe that MPI may not be the right approach. Several talks at this conference describe potential features and capabilities that may allow MPI to be more effective for the reduced bandwidth and increased parallelism. The talk will point out these features and their associated talks.The third significant challenge for MPI will be fault tolerance and fault recovery. The amount of memory in sustained petascale systems makes writing out checkpoints impractical. While the need to restart an application when 900,000 CPUs are still working fine but one has failed is an inefficient use of resources. This talk will describe the latest ideas for fault recovery in MPI and will describe a new idea called holistic fault tolerance that is being investigated.Finally the talk will describe productivity issues for sustained petascale application performance and their implications for MPI. The productivity of scientists and engineers is based on how easy and how fast they can solve a new science problem. Issues such as debugging, performance tuning, scalability, validation, and knowledge discovery all play a part. The talk will address the challenges MPI has in these areas.
A comparative evaluation of imperative and functional implementations of the imap protocol
Authors: Francesco Cesarini, Viviana Pappalardo, Corrado Santoro
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

This paper describes a comparative analysis of several implementations of the IMAP4 client-side protocol, written in Erlang, C#, Java, Python and Ruby. The aim is basically to understand whether Erlang is able to fit the requirements of such a kind of applications, and also to study some parameters to evaluate the suitability of a language for the development of certain type of programs. We analysed five different libraries, comparing their characteristics through some software metrics: number of source lines of code, memory consumption, performances (execution time) and functionality of primitives. We describe pros and cons of each library and we conclude on the suitability of Erlang as a language for the implementation of protocol- and string-intensive TCP/IP-based applications.
Towards Privacy Taxonomy-Based Attack Tree Analysis for the Protection of Consumer Information Privacy
Authors: Kamil Reddy, H. S. Venter, Martin Olivier, Iain Currie
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

There is a strong legal and ethical imperative for organisations to protect consumer information privacy. In this paper we present a method called privacy taxonomy-based attack tree analysis (PTATA). PTATA involves the combination of privacy violation taxonomies and attack trees. It assists organisations in protecting information privacy by providing a means to analyze weaknesses in their protective measures. We define privacy violation taxonomies, as well as review attack trees, and illustrate the practical implementation of PTATA through example scenarios. The advantages and drawbacks to our method are also discussed. The paper ends with future research which may build on this work.
Time, wavelet and Hilbert-Huang domain analysis of signals from ultrasonic based NDT
Authors: S. Barmada, M. Raugi, A. Musolino, M. Tucci, F. Turcu
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In this paper we compare the effectiveness of the time, wavelet and Hilbert Huang domain analysis of waveforms from a Non Destructive Test (NDT) equipment. The analysis of the signals from NDT systems is one of the most important activities since it allows to locate the actual defects. Very often the echoes traveling back to the sensors are superimposed with the signal from the transducer. We analyze the waveforms obtained by couples of sensors in order to extract the echoes and to recognize the points were they originate. A preliminary numerical analysis has been used to catch the main features of the elastic waves propagations in inhomogeneous materials.
The Impact of Readability on the Usefulness of Online Product Reviews: A Case Study on an Online Bookstore
Authors: Nikolaos Korfiatis, Daniel Rodríguez, Miguel-Angel Sicilia
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Online product reviews is an important advantage for consumers of experience goods in online marketplaces and act as a useful source of information during the purchase of a good. Furthermore in some online marketplaces consumers have the opportunity to evaluate how helpful a review was by using a binary evaluation interface provided by the online marketplace. This results to the usefulness score of a review which is calculated as a fraction of helpful votes over the total votes that this review has received. Our early results indicate that the usefulness score of a particular review is affected in a significant way by the qualitative characteristics of the review as measured by readability tests applied to a large dataset of reviews collected from the UK section of the popular online marketplace Amazon.
A Hybrid Approach to Improving Automatic Speech Recognition Via NLP
Authors: Kimberly Voll
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

In many domains, automated speech recognition (ASR) demands highly robust and accurate recognition software. Unfortunately, in such domains, even a 99% accurate recognizer is inadequate, and other methods for increasing the reliability and performance of ASR must be considered. As a possible solution to this problem, post-speech-recognition error detection can assist in proofreading more efficiently. To this end, we have developed a multi-heuristic algorithm using natural language processing to detect recognition errors. As a proof of concept, we have applied this algorithm to the radiology domain. The results are encouraging, showing a 22% increase in the recall performance, and a 6% increase in the precision performance, over the best individual technique. 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
On the Computational Power of Enhanced Mobile Membranes
Authors: Shankara Narayanan Krishna, Gabriel Ciobanu
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

The enhanced mobile membranes is a variant of membrane systems which has been proposed for describing some biological mechanisms of the immune system. In this paper, we study the computational power of the enhanced mobile membranes. In particular, we focus on the power of mobility given by the operations endo, exo, fendo and fexo. The computational universality is obtained with 12 membranes, while systems with 8 membranes subsume ET0L, and those with 3 membranes are contained in MAT.
SAGE at North Bay
Authors: Henry S. Tropp
Venue: IEEE Annals of the History of Computing (1983)

The author gives an account of his trip to the NORAD site at North Bay, Ontario, Canada.
Optimal Insertion of a Segment Highway in a City Metric
Authors: Matias Korman, Takeshi Tokuyama
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (where the city distance is measured with speed v > 1 on a highway and 1 in the underlying metric elsewhere). Extending the results of Ahn et al. ([7]), we consider the option that there are already some built highways. We give a unified approach to this problem to design polynomial-time algorithms for several combinations of objective functions and types of the inserted highway (turnpike or freeway).
On the Fast Searching Problem
Authors: Danny Dyer, Boting Yang, Öznur Yaşar
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

Edge searching is a graph problem that corresponds to cleaning a contaminated graph using the minimum number of searchers. We define fast searching as a variant of this widely studied problem. Fast searching corresponds to an internal monotone search in which every edge is traversed exactly once and searchers are not allowed to jump. We present a linear time algorithm to compute the fast search number of trees. We investigate the fast search number of bipartite graphs. We also propose a general cost function for evaluating search strategies that utilizes both edge searching and fast searching.
Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information
Authors: Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

The algorithms that are based on the Weighted Minimum Letter Flips (WMLF) model are more accurate in haplotype reconstruction than those based on the Minimum Letter Flips (MLF) model, but WMLF is effective only when the error rate in SNP fragments is low. In this paper, we first establish a new computational model that employs the related genotype information as an improvement of the WMLF model and show its NP-hardness, and then we propose an efficient genetic algorithm to solve for the haplotype assembly problem. The results of experiments on a real data set indicate that the introduction of genotype information to the WMLF model is quite effective in improving the reconstruction rate especially when the error rate in SNP fragments is high.
Impostor Users Discovery Using a Multimodal Biometric Continuous Authentication Fuzzy System
Authors: Antonia Azzini, Stefania Marrara
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In the last few years the security of the user's identity has become of paramount importance. In this paper we investigate the behavior of a fuzzy controller with a multimodal biometric system as input designed with the aim of preventing user substitution after the initial authentication process. In particular this paper presents the results of the system behavior tested with impostor users.
Blind Source-Separation in Mixed-Signal VLSI Using the InfoMax Algorithm
Authors: Waldo Valenzuela, Gonzalo Carvajal, Miguel Figueroa
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

This paper describes a VLSI implementation of the InfoMax algorithm for Independent Component Analysis in mixed-signal CMOS. Our design uses on-chip calibration techniques and local adaptation to compensate for the effect of device mismatch in the arithmetic modules and analog memory cells. We use our design to perform two-input blind source-separation on mixtures of audio signals, and on mixtures of EEG signals. Our hardware version of the algorithm successfully separates the signals with a resolution within less than 10% of a software implementation of the algorithm. The die area of the circuit is 0.016mm2 and its power consumption is 15μW in a 0.35μm CMOS process.
Multivariate refinable functions, differences and ideals - a simple tutorial
Authors: Tomas Sauer
Venue: Journal of Computational and Applied Mathematics (2008)

This paper summarizes the algebraic quotient ideal approach to polynomial generation by refinable functions and connects it to Strang-Fix conditions and factorization with respect to difference operators. Motivated by the latter one, we also consider vector subdivision schemes with matrix valued coefficients and review some of their properties.
An application of genetic algorithms and direct search methods to crack parameters identification in electromagnetic non-destructive testing
Authors: Ivaylo Dolapchiev
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

This paper presents some results from the inverse problem solution, based on the application of genetic algorithm (GA) and mesh adaptive search (MADS) technique. The investigation is directed to the identification of defects in metallic structures by means of electromagnetic Non-destructive Testing (NDT) methods. The proposed solution scheme uses rough identification procedure (RIP) and finite element method (FEM) as forward problem solver. The validity of the approach is tested with information acquired from numerical and physical experiments.