ppxscal/embedding_network huggingface dataset:
A routing protocol for extend network lifetime through the residual battery and link stability in MANET
Authors: GunWoo Park, SangHoon Lee
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

MANET(Mobile Ad-hoc Network) which does not use a wired network and base station system is composed of a group of mobile and wireless nodes. There are various types of restrictions. The main restriction is the frequent change of network topology and confined energy of the batteries. In MANET, route is only maintained during short time and mobile nodes are connected with each others having limited battery capacity. Namely, it is very important that we consider Link Stability and Battery Capacity at the same time in MANET. In recent years, much research has been under taken to not only improve the energy efficiency but also to lengthen the network lifetime. In this paper, we propose EBL(A Routing Protocol for Extend network life time through the Residual Battery and Link Stability in MANET). The EBL considers distance among neighbor nodes, Residual Battery Capacity and Link Stability. The EBL is based on AODV(Ad-hoc On-demand Distance Vector Routing). We use ns-2 for simulation. This simulation result shows EBL is able to extend network lifetime by reducing power consumption and distributing traffic load centralized into special node.
Learning from Imprecise Granular Data Using Trapezoidal Fuzzy Set Representations
Authors: Ronald R. Yager
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

We discuss the role and benefits of using trapezoidal fuzzy representa-tions of granular information. We focus on the use of level sets as a tool for implementing many operations involving trapezoidal fuzzy sets. Attention is particularly brought to the simplification that the linearity of the trapezoid brings in that it often allows us to perform operations on only two level sets. We investigate the classic learning algorithm in the case when our observations are granule objects represented as trapezoidal fuzzy sets. An important issue that arises is the adverse effect that very uncertain observations have on the quality of our estimates. We suggest an approach to addressing this problem using the specificity of the observations to control its effect. Throughout this work particular emphasis is placed on the simplicity of working with trapezoids while still retaining a rich representational capability.
Equivalence, Indicators, Quasi-indicators and Optimal Steiner Topologies on Four Points in Space
Authors: J. F. Weng, J. MacGregor Smith, M. Brazil, D. A. Thomas
Venue: Fundamenta Informaticae (2008)

The Steiner tree problem is an intractable optimization problem, which asks for a network, in fact a tree, interconnecting a given point set V in a metric space and minimizing the total length of the network. The tree topology t of the network is called a Steiner topology and a tree T with minimum length with respect to its Steiner topology is called a Steiner tree. As a combinatorial optimization problem, the Steiner tree problem asks for a Steiner tree T with minimum length over all possible topologies t on V. It has been proved that if T is in E$^3$ then the length of T cannot be expressed by radicals even when T spans just 4 points. For such optimization problems in which the objective functions do not have closed form solutions the traditional approach is approximation. In this paper we propose a new approach by introducing some new concepts: equivalence, indicators and quasi-indicators, and then we apply these concepts to the Steiner tree problem. Roughly speaking, a quasi-indicator is a function that is simple to compute but indicates with high probability the optimal solution to the original optimisation problem. For a specific optimisation problem - finding the optimal Steiner topologies on 4 points in space, we demonstrate how to find good quasiindicators. The extensive computational experiments over 5000 random 4-point sets show that the best quasi-indicator for finding optimal Steiner topologies on 4 points in space is not only easy to compute but also extremely successful with less than 1.5% failures in indicating optimal topologies even if degeneracy of Steiner minimal trees exists. Moreover, within the 1.5% cases of failure, the maximum and the average relative error are 1.5% and 0.2% respectively. Therefore, the performance of the proposed Q-indicator is very good and could be applied to the four vertices surrounding any pair of adjacent Steiner points in a Steiner tree on n (> 4) points in space to make local improvements to the topology of the Steiner minimal tree in space.
The computation of approximate competitive equilibrium is PPAD-hard
Authors: Xiaotie Deng, Ye Du
Venue: Information Processing Letters (2008)

Arrow and Debreu showed in 1954 that, under mild conditions, a competitive economy always has an equilibrium. In this paper, we show that, given a competitive economy that fully respects all the conditions of Arrow-Debreu's existence theorem, for any positive constant h>0, it is PPAD-hard to compute a 1n^h-approximate competitive equilibrium.
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Authors: Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky, Clemens Grelck, Kai Trojahner
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this paper we propose an approach based on partial evaluation which tries to prove such constraints statically as far as possible and inserts efficient dynamic checks otherwise.
Evolving Fuzzy Modeling of an Uncalibrated Visual Servoing System
Authors: P. J. Gonçalves, J. M. Sousa, J. R. Pinto
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this paper, inverse fuzzy models obtained online for uncalibrated visual servoing, are developed and validated in a six degrees of freedom robotic manipulator. This approach will recursively update the inverse fuzzy model based only on measurements at a given time instant. The uncalibrated approach does not require calibrated kinematic and camera models, as needed in classical visual servoing to obtain the Jacobian. Experimental results obtained in a PUMA robot performing eye-to-hand visual servoing are used to demonstrate the validity of the proposed approach, when compared to the previous developed off-line learning.
Semi Supervised Spectral Clustering for Regulatory Module Discovery
Authors: Alok Mishra, Duncan Gillies
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

We propose a novel semi-supervised clustering method for the task of gene regulatory module discovery. The technique uses data on dna binding as prior knowledge to guide the process of spectral clustering of microarray experiments. The microarray data from a set of repeat experiments are converted to an affinity, or similarity, matrix using a Gaussian function. We have investigated two methods to determine the optimal Gaussian variance for this purpose. The first method was based on a statistical measure of cluster coherence, and the second on optimising the number of constraints satisfied in the clustering process. The constraints, which were derived from dna-binding data, were used to adjust the affinity matrix to include known gene-gene interactions. Clusters were found using a spectrical clustering algorithm, and validated by using a biological significance score which was the proportion of gene pairs sharing a common transcription factor in the resulting clusters. Our results indicate that our technique can successfully leverage the information available in the dna-binding data. To the best of our knowledge this is a novel formulation for the purpose of gene module discovery.
Decision Procedures for the Grand Challenge
Authors: Daniel Kroening
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a suitably chosen logic. This paper discusses possible choices for this logic, and how to solve the resulting decision problems. A framework for reducing decision problems to propositional logic is described, which allows the surprising improvements in the performance of propositional SAT solvers to be exploited. The only assumption the framework makes is that an axiomatization of the desired logic is given.
Prototype Prolog API for Mindstorms NXT
Authors: Grzegorz J. Nalepa
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

The paper presents a Prolog API for controlling the LEGO Mindstorms NXT robot platform. It uses a multilayer architecture, composed of a behavioral, sensomotoric, and connection layer. The platform can be used as a generic solution for programming the NXT in Prolog.
The Scientific Library of Charles Babbage
Authors: M. R. Williams
Venue: IEEE Annals of the History of Computing (1981)

In the early nineteenth century, Charles Babbage compiled a large scientific library that included many rare works. This paper describes the history, contents, and present location of the library. The contents are classified under twenty-one headings. 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
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Authors: Omar Kermia, Yves Sorel
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non-preemptive scheduling in the case of hard real-time systems where missing deadline leads to catastrophic situations. This paper presents a necessary and sufficient schedulability condition for determining whether a task will satisfy its period and precedences constraints when some tasks have already been scheduled. Tasks we are dealing with are non-preemptive and the periods considered here are strict.
A Method Based on ICA and SVM/GMM for Mixed Acoustic Objects Recognition
Authors: Yaobo Li, Zhiliang Ren, Gong Chen, Changcun Sun
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

With independent component analysis (ICA) to realize the blind separation from mixed acoustic objects, a recognition method based on support vector machine/Gaussian mixture models (SVM/GMM) is proposed through extracting linear prediction coefficient (LPC) feature. It is revealed that LPC is consistently better than wavelet energy feature, ICA is efficient algorithm to estimate the unknown signal level. This method uses the output of GMM to adjust the probabilistic output of SVM. The validity of the ICA and SVM/GMM model is verified via examples in mixed acoustic objects recognition system.
Words Not Cast in Stone
Authors: Carlo Strapparava, Alessandro Valitutti, Oliviero Stock
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

An advertising message induces in the recipient a positive (or negative) attitude toward the subject to advertise, for example through the evocation of a appropriate emotion. This paper is about the use of text processing techniques for proposing solutions to advertising professionals, opening up the way to a full automatization of the whole process. The system has two steps: (i) the creative variation of familiar expressions, taking into account the affective content of the produced text, (ii) the automatic animation (semantically consistent with the affective text content) of the resulting headline, using kinetic typography techniques.
Design of a high-speed CMOS multi-bit quantizer for continuous-time Delta-Sigma Modulator applications
Authors: André Mariano, Birama Goumballa, Dominique Dallet, Yann Deval, Jean-Baptiste Bégueret
Venue: Analog Integrated Circuits and Signal Processing (2008)

Digital front-end receivers realize direct conversion of an analog signal to digital form at intermediate frequencies (IF), simplifying the overall system design and alleviating the problems associated with IF mixers. The trend is to eliminate any RF/analog mixers and digitize the RF signal as near as possible to the antenna. In order to digitize directly the analog input signal, a high dynamic-range and high-speed ADC is needed. Continuous-Time Bandpass Delta-Sigma Modulator can meet these requirements, using high-performance multi-bit quantizers. This article presents the design of a high-speed CMOS Analog-to-Digital Converter (ADC) which can be used as a quantizer in Continuous-Time Delta-Sigma Modulator. It is designed in a 130 nm CMOS technology from STMicroelectronics. The main features of the ADC are 3-bit resolution with 4 GHz sampling rate in a 0.8---2 GHz bandwidth.
Improving User Taught Task Models
Authors: Phillip Michalak, James Allen
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Task models are essential components in many approaches to user modelling because they provide the context with which to interpret, predict, and respond to user behavior. The quality of such models is critical to their ability to support these functions. This paper describes work on improving task models that are automatically acquired from demonstration. Modifications to a standard planning algorithm are described and applied to an example learned task model, showing the utility of incorporating plan-based reasoning into task learning systems.
Characterization on Irregular Tight Wavelet Frames with Matrix Dilations
Authors: Deyun Yang, Zhengliang Huan, Zhanjie Song, Hongxiang Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

There are many results in one dimensional wavelet frame theory in recent years. However, since there are some essential differences in high dimensional cases, the classical methods for one dimensional regular wavelet frames are unsuitable for the cases. In this paper, under some conditions on matrix-dilated sequences, a characterization formula for irregular tight frames of matrix-dilated wavelets is developed. It is based on the regular formulation by Chui, Czaja, Maggioni, Weiss, and on the recent multivariate results by Yang and Zhou.
Social facilitation and human-computer interaction
Authors: Byron Hall, David Dryden Henningsen
Venue: Computers in Human Behavior (2008)

The Computers As Social Actors (CASA) research paradigm has examined how individuals respond to computers programmed to interact in various ways. In the current research, we extend the principles of CASA to determine whether computer icons can be used to produce social facilitation effects. Varying task difficulty and the presence or absence of a computer icon (i.e., Microsoft word's Clip), performance on a typing task is considered. Overall, results provide some support for the contention that the mere presence of a computer icon may influence task performance.
Discovery of Linear Non-Gaussian Acyclic Models in the Presence of Latent Classes
Authors: Shohei Shimizu, Aapo Hyvärinen
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled experiments, and hence one often has to resort to methods for discovering good initial causal models from data which do not come from such controlled experiments. We have recently proposed such a discovery method based on independent component analysis (ICA) called LiNGAM and shown how to completely identify the data generating process under the assumptions of linearity, non-gaussianity, and no latent variables. In this paper, after briefly recapitulating this approach, we extend the framework to cases where latent classes (hidden groups) are present. The model identification can be accomplished using a method based on ICA mixtures. Simulations confirm the validity of the proposed method.
Recommender System for the Multi-channel TV Production
Authors: Janez Zaletelj
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

This paper presents the concept of content recommendations for the production of multi-channel TV shows. Within the IST project "LIVE --- Live Staging of Media Events" [1] we are developing a production support system which will have a functionality of content recommendations and will support production of multi-channels programs. The paper outlines a concept of a recommender system for the multi-channel TV production and presents basic architecture and workflows within the system. The recommendation of the archive content for a given channel is personalized by taking into account the profile of the target audience.
Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis
Authors: Shang-Hua Teng
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

I will present some recent advances in algorithmic game theory especially about Nash equilibria. As you may have already known, the notion of Nash equilibria has captured the imagination of much of the computer science theory community, both for its many applications in the growing domain of online interactions and for its deep and fundamental mathematical structures. As the complexity and scale of typical Internet applications increase, the problem of efficiently analyzing their game-theoretic properties becomes more pointed.
On Covering Attribute Sets by Reducts
Authors: Mikhail Ju. Moshkov, Andrzej Skowron, Zbigniew Suraj
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

For any fixed natural k, there exists a polynomial in time algorithm which for a given decision table T and given k conditional attributes recognizes if there exist a decision reduct of T containing these k attributes.
A Spatial Deinterlacing Algorithm Based on Edge Orientation Optimized in Local Area
Authors: Chen Wang, Hua Han, Silong Peng
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

In this paper, a novel de-interlacing algorithm in spatial domain is proposed based on an edge orientation optimizing strategy. Taking advantage of the resolution invariant character of edge orientation, we calculate the edge orientation in interlaced image by minimizing the cost function, sum of absolute difference (SAD). Under the assumption that edge orientation in local area is stationary, SAD stands for the possibilities of each edge orientation. Interpolation in the orientation with the least SAD will bring in the continuous value of missing pixels. In addition, a threshold is set to distinguish the texture area from edge or plain area, which makes the algorithm more robust.
SWHi System Description: A Case Study in Information Retrieval, Inference, and Visualization in the Semantic Web
Authors: Ismail Fahmi, Junte Zhang, Henk Ellermann, Gosse Bouma
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Search engines have become the most popular tools for finding information on the Internet. A real-world Semantic Web application can benefit from this by combining its features with some features from search engines. In this paper, we describe methods for indexing and searching a populated ontology by using an information retrieval tool; its results are enriched with inference. For visualization purposes, all of the retrieved ontology instances are clustered based on their classes; and the clusters are linked using instance properties. The approach is illustrated using our SWHi (Semantic Web for History) prototype as a case study.
On the Descriptive Complexity of Linear Algebra
Authors: Anuj Dawar
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

The central open question in the field of descriptive complexity theory is whether or not there is a logic that expresses exactly the polynomial-time computable properties of finite structures. It is known, from the work of Cai, Fürer and Immerman that fixed-point logic with counting (${\ensuremath{\textsf{FP}+\textsf{C}}}$) does not suffice for this purpose. Recent work has shown that natural problems involving systems of linear equations are not definable in this logic. This focuses attention on problems of linear algebra as a possible source of new extensions of the logic. Here, I explore the boundary of definability in ${\ensuremath{\textsf{FP}+\textsf{C}}}$ with respect to problems from linear algebra and look at suggestions on how the logic might be extended.
3D Freehand Canvas
Authors: Miao Wang, Guangzheng Fei, Zijun Xin, Yi Zheng, Xin Li
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper presents a 3D freehand sketching system. Replacing the traditional 3D cartoon process, which contains modeling, texture mapping, it uses 2D input for generating projective strokes on a user-definable 3D canvas, which makes it possible that artist can sketch freehand in 3D space with no limitation. The freehand style animation could be created, which is nearly impossible for modern 3D animation tools. Most of the 2D painting features are also supported such as varieties of colors and abundant user-defined alpha stroke, and all of these features could be used in 3D space as well. Moreover, the 3D animation features could also be used, including space view, perspective view and freely 3D movement both for the object and the camera. It is a brand new tool both for traditional 2D cartoon makers and modern 3D animation craftsmen.
An Integrated Approach to Parametric and Discrete Fault Diagnosis in Hybrid Systems
Authors: Matthew Daigle, Xenofon Koutsoukos, Gautam Biswas
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

Fault diagnosis is crucial for ensuring the safe operation of complex engineering systems. Faults and degradations need to be quickly identified so that corrective actions can avoid catastrophic situations. Most real-world, embedded systems are hybrid in nature. In such systems, hybrid models have to be employed for correct tracking and diagnosis. The majority of hybrid systems diagnosis work, however, has focused on either discrete or parametric fault diagnosis. In contrast, we present an integrated model-based approach to diagnosing both parametric and discrete faults in hybrid systems. This extends our previous work in diagnosis of parametric faults in hybrid systems [1,2] by including discrete faults, resulting in a unified hybrid diagnosis methodology. We demonstrate our approach using experimental results performed on a complex electrical power system.