ppxscal/embedding_network huggingface dataset:
A Concept Lattice-Based Kernel Method for Mining Knowledge in an M-Commerce System
Authors: Qiudan Li, Chunheng Wang, Guanggang Geng, Ruwei Dai
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

With the vast amount of mobile user information available today, mining knowledge of mobile users is getting more and more important for a mobile commerce (M-commerce) system. Vector space model (VSM) is one of the most popular methods to achieve the above goal. Unfortunately, it can not identify the latent information in the user feature space, which decreases the quality of personalized services. In this paper, we present a concept-lattice based kernel method for mining the hidden user knowledge. The main idea is to employ concept lattice for constructing item proximity matrix, and then embed it into a kernel function, which transforms the original user feature space into a user concept space, and at last, perform personalized services in the user concept space. The experimental results demonstrate that our method is more encouraging than VSM.
A construction of dz-disjunct matrices in a dual space of symplectic space
Authors: Geng-sheng Zhang, Bo-li Li, Xiao-lei Sun, Feng-xia Li
Venue: Discrete Applied Mathematics (2008)

In this paper, we construct a d^z-disjunct matrix with subspaces in a dual space of symplectic space F"q^(^2^@n^), then give its several properties and a new definition, ratio efficiency t/n. As the smaller the ratio efficiency is, the better the pooling design is. We discuss the ratio efficiency of this construction and compare it with others, such as in [Anthony J. Macula, A simple construction of d-disjunct matrices with certain constant weights, Discrete Mathematics 162 (1996) 311-312; A.G. D'yachkov, Frank K. Hwang, Antony J. Macula, Pavel A. Vilenkin, Chih-wenWeng, A construction of pooling designs with some happy surprises, Journal of Computational Biology 12 (2005) 1129-1136].
Contention-based performance evaluation of multidimensional range search in peer-to-peer networks
Authors: Spyros Blanas, Vasilis Samoladas
Venue: Future Generation Computer Systems (2009)

Performance evaluation of peer-to-peer search techniques has hitherto been based on simple performance metrics, such as message hop counts and total network traffic, mostly disregarding the inherently concurrent nature of peer-to-peer networks, where contention may arise. This paper is concerned with quantifying the effects of contention in P2P networks, focusing on networks for multidimensional range search. We evaluate peer-to-peer networks derived from recently proposed works, introducing two novel metrics related to concurrency and contention, namely responsiveness and throughput. Our results highlight the impact of contention on these networks, and demonstrate that some studied networks do not scale in the presence of contention. Also, our results indicate that certain P2P network properties believed to be desirable (e.g. even data distribution or uniform peer access) may not be as critical as previously believed.
Co-operative Agents in Analysis and Interpretation of Intracerebral EEG Activity: Application to Epilepsy
Authors: Mamadou Ndiaye, Abel Kinie, Jean-Jacques Montois
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

The paper presents a distributed approach for the interpretation of epileptic signals based on a dynamical vectorial analysis method. The approach associates signal processing methods into a situated, reactive, cooperative and decentralized implementation. The objective is to identify and locate the various interictal and ictal epileptiform events (pathological and/or normal) contained in intracerebral EEG signals (one hundred recording channels in general) recorded in patients suffering from partial temporal lobe epilepsy. This approach associates some signal processing methods (spectral analysis, causality measurements, detection, classification) in a multi-agent system.
Image Retrieval: Color and Texture Combining Based on Query-Image
Authors: Ilya Markov, Natalia Vassilieva
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

It is a common way to process different image features independently in order to measure similarity between images. Color and texture are the common ones to use for searching in natural images. In [10] a technique to combine color and texture features based on a particular query-image in order to improve retrieval efficiency was proposed. Weighted linear combination of color and texture metrics was considered as a mixed-metrics. In this paper the mixed-metrics with different weights are compared to pure color and texture metrics and widely used CombMNZ data fusion algorithm. Experiments show that proposed metrics outperform CombMNZ method in some cases, and have close results in others.
Accurate Numerical Computation of Rovibrational G Matrices in Molecules of Arbitrary Size
Authors: María Eugenia Castro, Alfonso Niño, Camelia Muñoz-Caro
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

In this work we present a methodology for the accurate numerical computation of the rovibrational G matrix in any molecule. A C++ program is developed to apply this methodology. Using polymorphism, the program can handle the output of any of the available electronic structure codes. The objective is to compute the kinetic contribution to the rovibrational Hamiltonian from the results of molecular structure scans, performed in heterogeneous and distributed systems such as Internet-based Grids of computers. The numerical derivatives needed to compute the G matrix in curvilinear, internal coordinates are obtained from an adapted Richardson extrapolation. The procedure is optimized to maximize the number of significant digits in the derivatives. Using the program, we compute the vibrational kinetic terms for several simultaneous torsional motions in Glycolaldehyde, Methyl formate and Ethyl methyl ether. The results show the existence of an important coupling among the torsional vibration modes.
Information Efficiency
Authors: Joel Ratsaby
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Shannon's theory of information stands on a probabilistic representation of events that convey information, e.g., sending messages over a communication channel. Kolmogorov argues that information is a more fundamental concept which exists also in problems with no underlying stochastic model, for instance, the information contained in an algorithm or in the genome. In a classic paper he defines the discrete entropy of a finite set which establishes a combinatorial based definition of the information I(x:y) conveyed by a variable x (taking a binary string value x) about the unknown value of a variable y. The current paper extends Kolmogorov's definition of information to a more general setting where given `x= x' there may still be uncertainty about the set of possible values of y. It then establishes a combinatorial based description complexity of x and introduces a novel concept termed information width, similar to n-widths in approximation theory. This forms the basis of new measures of cost and efficiency of information which give rise to a new framework whereby information of any input source, e.g., sample-based, general side-information or a hybrid of both, is represented and computed according to a single common formula. As an application, we consider the space of Boolean functions where input strings x correspond to descriptions of properties of classes of Boolean functions.
Synthesis of explicit model predictive control system with feasible region shrinking
Authors: Zhang Ju, Wang Wanliang
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

Based upon the multi-parametric programming for the linear constrained optimal control problem, the feasible region gradually shrinking approach for synthesis of the explicit Model Predictive Control (MPC) systems are proposed, so that the state trajectories of the resulting explicit MPC systems starting from any original states in its state partitions is always infinite time feasible. With the piecewise Quadratic Lyapunov and the PWA model, the stability and convergence of the resulting explicit MPC systems are analyzed. Numerical simulations are made, and show that the proposed approach is valid.
Classification and Dimension Reduction in Bank Credit Scoring System
Authors: Bohan Liu, Bo Yuan, Wenhuang Liu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Customer credit is an important concept in the banking industry, which reflects a customer's non-monetary value. Using credit scoring methods, customers can be assigned to different credit levels. Many classification tools, such as Support Vector Machines (SVMs), Decision Trees, Genetic Algorithms can deal with high-dimensional data. However, from the point of view of a customer manager, the classification results from the above tools are often too complex and difficult to comprehend. As a result, it is necessary to perform dimension reduction on the original customer data. In this paper, a SVM model is employed as the classifier and a "Clustering + LDA" method is proposed to perform dimension reduction. Comparison with some widely used techniques is also made, which shows that our method works reasonably well.
Adaptive Parallel Immune Evolutionary Strategy
Authors: Cheng Bo, Guo Zhenyu, Cao Binggang, Wang Junping
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Based on Clonal Selection Theory, an adaptive Parallel Immune Evolutionary Strategy (PIES) is presented. On the grounds of antigen-antibody affinity, the original antibody population can be divided into two subgroups. Correspondingly, two operators, Elitist Clonal Operator (ECO) and Super Mutation Operator (SMO), are proposed. The former is adopted to improve the local search ability while the latter is used to maintain the population diversity. Thus, population evolution can be actualized by concurrently operating ECO and SMO, which can enhance searching efficiency of the algorithm. Experimental results show that PIES is of high efficiency and can effectively prevent premature convergence. Therefore, it can be employed to solve complicated optimization problems.
Efficient Facial Features Warping Using BSM (Bayesian Shape Model)
Authors: Joo-Hyung Kwon, Gye-Young Kim, Youngsong Mun
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper proposes an efficient method for warping facial features. The existing methods use points, which are standard for facial features warping, without the reason or calculation. And existing methods have difficulties for facial feature warping. We estimate the standard points by using BSM(Bayeian Shape Model). From the experiment results for the various image, the proposed algorithm shows more natural results than the conventional algorithm and is more efficient than ASM(Active shape model).
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
Authors: Tom Ridge, Michael Norrish, Peter Sewell
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

Despite more then 30 years of research on protocol specification, the major protocols deployed in the Internet, such as TCP, are described only in informal prose RFCs and executable code. In part this is because the scale and complexity of these protocols makes them challenging targets for formalization.In this paper we show how these difficulties can be addressed. We develop a high-level specification for TCP and the Sockets API, expressed in the HOL proof assistant, describing the byte-stream service that TCP provides to users. This complements our previous low-level specification of the protocol internals, and makes it possible for the first time to state what it means for TCP to be correct: that the protocol implements the service. We define a precise abstraction function between the models and validate it by testing, using verified testing infrastructure within HOL. This is a pragmatic alternative to full proof, providing reasonable confidence at a relatively low entry cost.Together with our previous validation of the low-level model, this shows how one can rigorously tie together concrete implementations, low-level protocol models, and specifications of the services they claim to provide, dealing with the complexity of real-world protocols throughout.
Simulation of ad hoc networks: ns-2 compared to JiST/SWANS
Authors: Elmar Schoch, Michael Feiri, Frank Kargl, Michael Weber
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

For the evaluation of ad hoc network protocols, researchers traditionally use simulations because they easily allow for a large number of nodes and reproducible environment conditions. But still, simulations are costly in terms of required processing time and memory. New approaches like the Javabased simulator JiST/SWANS promise to provide significant performance advantages compared to existing, well-known network simulators like ns-2. Though its creators have done comparison studies regarding processing time and memory requirements of JiST/SWANS, they did not test the validity of the results produced by the SWANS stack as well as its performance in detail. In this work, we focus on the comparability of implemented protocols and models in SWANS. Using the corresponding counterparts both in SWANS and ns-2, with an identical set of parameters, we are able to produce results and compare them afterward. In addition, we also provide a performance analysis using these simulations. By showing that JiST/SWANS produces equivalent simulation results as ns-2 in less time and with less memory, we support JiST/SWANS as a potential alternative.
Study on Computer Assistance for Telepresent Reaching Movements
Authors: Ulrich Unterhinninghofen, Franziska K. Freyberger, Martin Buss
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

A new computer assistance concept for bilateral telepresence is introduced which increases telepresent task performance without being explicitly perceived by the operator. Therefore, no training related to the assistance functions is needed, and intuitive telepresence is maintained. In the presented study, we analyze how an intelligent teleoperator can correct the inputs of the operator most efficiently without degrading the feeling of presence. It is expected that there is a tradeoff between maximizing task performance and maintaining feeling of presence. However, our experiments show that appropriate computer assistance methods can increase task performance and feeling of presence at the same time.
Using Event Calculus for Behaviour Reasoning and Assistance in a Smart Home
Authors: Liming Chen, Chris Nugent, Maurice Mulvenna, Dewar Finlay, Xin Hong, Michael Poland
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

Smart Homes (SH) have emerged as a viable solution capable of providing assistive living for the elderly and disabled. Nevertheless, it still remains a challenge to assist the inhabitants of a SH in performing the correct action(s) at the correct time in the correct place. To address this challenge, this paper introduces a novel logic-based approach to cognitive modeling based on a highly developed logical theory of actions - the Event Calculus. Cognitive models go beyond behavioral models in that they govern an inhabitant's behavior by reasoning about its knowledge, actions and events. We present a formal cognitive model for a SH and describe the mechanisms for its use in facilitating assistive living. In addition we present a system architecture and demonstrate the use of the proposed approach through a real world daily activity.
AmbienNet: an intelligent environment to support people with disabilities and elderly people
Authors: Julio Abascal, Borja Bonail, Álvaro Marco, Roberto Casas, José Luis Sevillano
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

AmbienNet is an ongoing project aiming to demonstrate the viability of accessible intelligent environments to support people with disabilities and elderly people living autonomously. Based on the Ambient Intelligence paradigm, it tries to study in depth its advantages and disadvantages for people with sensory, physical or cognitive restrictions. To this end diverse supporting technologies and applications have been designed, in order to test their accessibility, usability and validity. After introducing the objectives and findings of the project, in this paper a number of preliminary results are presented and discussed.
Max-sum decentralised coordination for sensor systems
Authors: W. T. L. Teacy, A. Farinelli, N. J. Grabham, P. Padhy, A. Rogers, N. R. Jennings
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

A key challenge for the successful deployment of systems consisting of multiple autonomous networked sensors is the development of decentralised mechanisms to coordinate the activities of these physically distributed devices in order to achieve good system-wide performance. Such mechanisms must act in the presence of local constraints (such as limited power, communication and computational resources) and dynamic environments (where the topology, constraints and utility of the sensor network may change at any time). We propose the use of message passing techniques based on the max-sum algorithm to address this challenge, and in this paper, we demonstrate its use in two different settings. We first present a software simulation where our max-sum decentralised coordination algorithm is used to coordinate sectored radar sensors tracking multiple moving targets (see the ARGUS II DARP project - http://www.ecs.soton.ac.uk/research/projects/ARGUS). We then present a hardware implementation of the same algorithm that performs decentralised graph colouring - an intermediate step towards deploying the algorithm to coordinate the sleep/sense cycles of a network of low-power embedded sensors (see the DIF DTC 'Adaptive Energy-Aware Sensor Network' project - http://www.ecs.soton.ac.uk/research/projects/AEASN).
On the reputation of communities of web services
Authors: Hamdi Yahyaoui, Zakaria Maamar, Jamal Bentahar, Nabil Sahli, Said Elnaffar, Philippe Thiran
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

Web services communities are virtual clusters that agglomerate Web services with the same functionality. However, selecting the best community to deal with is challenging to both users and providers. Reputation has been widely used for evaluating and ranking candidates. In this paper, we introduce a reputation-based Web services community architecture and define some of the performance metrics that are needed to assess the reputation of a Web service community as perceived by the users and providers.
FPGA Design of Fast Lifting Wavelet Transform
Authors: Wenbing Fan, Yingmin Gao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

The new fully integer processing of the wavelet transform scheme enables very fast application and thus it can be very useful for application in real-time systems. The most important property of this concept seems to be the possibility of simple and fast application into FPGA chip. In this paper lifting scheme is an alternative implementation of DWT. It requires fewer operations and provides in-place computation of the wavelet coefficients. This paper presents a method which implements 2-D lifting wavelet by FPGA. The result of simulation displays that lifting scheme needs less memory requirement.
More Concise Representation of Regular Languages by Automata and Regular Expressions
Authors: Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We consider two formalisms for representing regular languages: constant height pushdown automata and straight line programs for regular expressions. We constructively prove that their sizes are polynomially related. Comparing them with the sizes of finite state automata and regular expressions, we obtain optimal exponential and double exponential gaps, i.e., a more concise representation of regular languages.
Leveraging User Interactions for In-Depth Testing of Web Applications
Authors: Sean Mcallister, Engin Kirda, Christopher Kruegel
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Over the last years, the complexity of web applications has grown significantly, challenging desktop programs in terms of functionality and design. Along with the rising popularity of web applications, the number of exploitable bugs has also increased significantly. Web application flaws, such as cross-site scripting or SQL injection bugs, now account for more than two thirds of the reported security vulnerabilities.Black-box testing techniques are a common approach to improve software quality and detect bugs before deployment. There exist a number of vulnerability scanners, or fuzzers, that expose web applications to a barrage of malformed inputs in the hope to identify input validation errors. Unfortunately, these scanners often fail to test a substantial fraction of a web application's logic, especially when this logic is invoked from pages that can only be reached after filling out complex forms that aggressively check the correctness of the provided values.In this paper, we present an automated testing tool that can find reflected and stored cross-site scripting (XSS) vulnerabilities in web applications. The core of our system is a black-box vulnerability scanner. This scanner is enhanced by techniques that allow one to generate more comprehensive test cases and explore a larger fraction of the application. Our experiments demonstrate that our approach is able to test more thoroughly these programs and identify more bugs than a number of open-source and commercial web vulnerability scanners.
Using Genetic Algorithm to Balance the D-Index Algorithm for Metric Search
Authors: Tao Ban
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The Distance Index (D-index) is a recently introduced metric indexing structure which capable of state-of-the-art performance in large scale metric search applications. In this paper we address the problem of how to balance the D-index structure for more efficient similarity search. A group of evaluation functions measuring the balance property of a D-index structure are introduced to guide the construction of the indexing structure. The optimization is formulated in a genetic representation that is effectively solved by a generic genetic algorithm (GA). Compared with the classic D-index, balanced D-index structures show a significant improvement in reduction of distance calculations while maintaining a good input-output (IO) performance.