ppxscal/embedding_network huggingface dataset:
The Computational Complexity of Link Building
Authors: Martin Olsen
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is NP-hard if k is part of the input. We present a simple and efficient randomized algorithm for the simple case where the objective is to compute one new link pointing to a given node t producing the maximum increase in the PageRank value for t. The algorithm computes an approximation of the PageRank value for t in G(V, E ¿ {(v, t)}) for all nodes v with a running time corresponding to a small and constant number of PageRank computations. 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
A Multi-Platform Framework for Distributed Computing
Authors: Michael Grivas, Dimitris Kehagias
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

The turn in to distributed computing has reached to a crossroads, where a system can be either built for indoor usage or for large number of independent systems over the Internet, or it can consist of simple software entities that run anywhere or been built in a strict, error-proof and well-designed way. Systems that can exist in many of those categories are not common.This paper comes as a merge and advancement of previous works in several of the aforementioned models. It presents a sophisticated framework that spans several modern distributed computing models of work, including Volunteer computing, Clusters and Grid computing.
Avatars Contributions to Commercial Applications with Living ActorTM Technology
Authors: Laurent Ach, Benoît Morel
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

The technology and commercial experience of Cantoche put a new light on applications using avatars.
ERM-POT Method for Quantifying Operational Risk for Chinese Commercial Banks
Authors: Fanjun Meng, Jianping Li, Lijun Gao
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Operational risk has become increasingly important topics for Chinese Commercial Banks in recent years. Considering the huge operational losses, Extreme value theory (EVT) has been recognized as a useful tool in analyzing such data. In this paper, we presented an ERM-POT (Exponential Regression Model and the Peaks-Over-Threshold) method to measure the operational risk. The ERM-POT method can lead to bias-corrected estimators and techniques for optimal threshold selections. And the experiment results show that the method is reasonable.
A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
Authors: Hiroshi Haramoto, Makoto Matsumoto, Pierre L'Ecuyer
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Linear recurring sequences with very large periods are widely used as the basic building block of pseudorandom number generators. In many simulation applications, multiple streams of random numbers are needed, and these multiple streams are normally provided by jumping ahead in the sequence to obtain starting points that are far apart. For maximal-period generators having a large state space, this jumping ahead can be costly in both time and memory usage. We propose a new jump ahead method for this kind of situation. It requires much less memory than the fastest algorithms proposed earlier, while being approximately as fast (or faster) for generators with a large state space such as the Mersenne twister.
Architecture Modelling of Large Cooperative Environments
Authors: Martin Ota, Ivan Jelínek
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

The article is focused on the architecture of large cooperative ICT environments. The logical levels are the most important feature in the architecture. The paper introduces a system of three logical levels: the business architecture level, the application architecture level and the physical architecture level. Each level can contain several views --- either complete or partial views. Each level can have more than one instance. It provides a seamless platform for modelling how the business processes of collaborative engineering are running onto the architecture. UML is used as the modelling language. The instructions on how to use it are presented in the paper.
E-Voting Advocates Hold Out Hope
Authors: Benjamin J. Alfonsi
Venue: IEEE Distributed Systems Online (2004)

The Pentagon recently cancelled plans to use an online voting system for US citizens living overseas owing to security concerns. However, proponents of e-voting hope the Defense Department will continue to test the system.
PSO: the Reason for the Randomicity
Authors: Renyue Xiao, Chunchun Wang, Jinhai Yu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The particle swarm optimization algorithm is a new kind of random optimization algorithm based on the swarm intelligence. It has been used in many field and it work very well. Many papers about the selection of the parameters have been written. This paper shows that the velocity of the PSO is cyclic when the parameters are constants. So It gives the reason for the randomicity in the PSO.
A Flexible Concept to Establish Accessibility Information in Tourism Web-Pages
Authors: Franz Pühretmair, Wolfram Wöß
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Accessible tourism that comprises the market of people with disabilities and elderly travelers is far away from being a niche market. Nevertheless it is characterized by missing, insufficient or inaccurate accessibility information on tourism objects. The presented approach demonstrates how it is possible to overcome this deficits and how this growing but neglected market can be supported. The fundamental idea is to aggregate up-to-date, trustable and comparable accessibility information in a central accessibility database. A service-oriented architecture enables information providers to flexibly access and query accessibility information stored in the database by the use of Web services. Consequently, the accessibility information delivered can be integrated in information portals and homepages, thus enabling a wide spreading of accessibility information which is the main focus of this paper.
Introducing Grades in Deontic Logics
Authors: Pilar Dellunde, Lluís Godo
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

In this paper we define a framework to introduce gradedness in Deontic logics through the use of fuzzy modalities. By way of example, we instantiate the framework to Standard Deontic logic (SDL) formulas. Given a deontic formula ¿ ¿ SDL, our language contains formulas of the form $\overline{r} \to N\Phi$ or $\overline{r} \to P\Phi$, where r ¿ [0, 1], expressing that the preference or probability degree respectively of a norm ¿ is at least r. We present sound and complete axiomatisations for these logics.
Adaptive BCH coding performance analysis
Authors: Lamia Chaari, Mohamed Fourati, Nouri Masmoudi, Lotfi Kamoun
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

BCH (Bose, Chaudhuri, Hocquenghem) codes are becoming more frequently used due to the availability of VLSI components. BCH codes have a powerful random and burst correcting ability. BCH codes also leave the data in its original form which allows video decoders to be specified with "optional" error correction. The BCH code can be adapted towards the burst error correcting capabilities and this will be shown in the contribution. This paper investigates the effects of noise-induced transmission errors on the performance of BCH coding methods for different errors correction capability. First, the relations among the bit error rate, signal-to-noise ratio (SNR), and code lengths are analyzed. Further, the transmission performance of BCH codes association with different modem schemes are analyzed. Also QCIF image transmission quality over BCH codes for different errors capability are simulated, discussed and compared. The results listed in this article denote the effects of the using BCH codes in a selected method. Based on this analysis an adaptive BCH scheme is proposed to pick the correcting capabilities that offers the best reconstructed image quality for each average SNR.
Model-Based Implementation of Real-Time Systems
Authors: Krzysztof Sacha
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

A method is presented for modeling, verification and automatic programming of PLC controllers. The method offers a formal model of requirements, the means for defining and verifying safe behavior, and a technique for generating program code. The modeling language is UML state machine, which provides a widely accepted means for writing a specification at a suitable high level of abstraction. Such an abstract specification can be validated by the user, verified by means of a model-checker and translated automatically into a program code, which preserves the correctness and safety of the specification. The program code is written in one of the standardized IEC 61131 languages.
Applications of adaptive control based on nonlinear static characteristic
Authors: Ciprian Lupu, Dumitru Popescu, Andreea Udrea
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper proposes a real-time control algorithm based on a model reference adaptive control mechanism for a class of nonlinear systems. The reference model is computed off-line, while the controller's parameters are determined on-line, using a static gain adaptation criterion. The relevance of this approach was tested on several nonlinear processes, using a real-time applications package developed in LabWindows/CVI. A solution designed for a class of nonlinear systems, based on parametric adaptation for an RST controller is presented. Issues on the stability of the solution are also discussed.
The Web and the 2004 EP election: Comparing political actor Web sites in 11 EU Member States
Authors: Nicholas W. Jankowski, Kirsten Foot, Randy Kluver, Steve Schneider
Venue: Information Polity (2005)

This study reports on incorporation of the Web during the 2004 European Parliament election as played out in 11 EU Member States. Based on an analysis of Web site features related to a conceptualization of political engagement, the study examines utilization of features reflecting information provision and opportunities for discussion and political action. The findings reflect the low level of importance historically ascribed to European Parliament elections. The study also illustrates the diversity in how the Web was incorporated into this election campaign across the 11 EU Member States, which may be a consequence of the broad range of political cultural and contextual aspects shaping this pan-European event.
Supervised Incremental Learning with the Fuzzy ARTMAP Neural Network
Authors: Jean-François Connolly, Eric Granger, Robert Sabourin
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

Automatic pattern classifiers that allow for on-line incremental learning can adapt internal class models efficiently in response to new information without retraining from the start using all training data and without being subject to catastrophic forgeting. In this paper, the performance of the fuzzy ARTMAP neural network for supervised incremental learning is compared to that of supervised batch learning. An experimental protocole is presented to assess this network's potential for incremental learning of new blocks of training data, in terms of generalization error and resource requirements, using several synthetic pattern recognition problems. The advantages and drawbacks of training fuzzy ARTMAP incrementally are assessed for different data block sizes and data set structures. Overall results indicate that error rate of fuzzy ARTMAP is significantly higher when it is trained through incremental learning than through batch learning. As the size of training blocs decreases, the error rate acheived through incremental learning grows, but provides a more compact network using fewer training epochs. In the cases where the class distributions overlap, incremental learning shows signs of over-training. With a growing numbers of training patterns, the error rate grows while the compression reaches a plateau.
The Application of Full Adaptive RBF NN to SMC Design of Missile Autopilot
Authors: Jinyong Yu, Chuanjin Cheng, Shixing Wang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

A new adaptive sliding-mode control (SMC) scheme was proposed, which incorporated Full Adaptive RBF NN into sliding-mode control using Full Adaptive RBF NN to approximate the equivalent control and the upper bound of uncertainty which involved the disturbance and approximation error, thus the influence of modeling error was reduced and the gain of sliding-mode control part was more fitting, such that the chattering effects could be alleviated . Lyapunov stability theorem was used to prove the stability of the system and the adaptive laws were deduced. Finally, simulation results of some BTT missile were included to illustrate the effectiveness of the adaptive sliding-mode control scheme.
Physics Based Algorithms for Sparse Graph Visualization
Authors: Milovan Šuvakov
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Graph visualization represents an important computational tool in analysis of complex networks. Recently, variety of network structures in complex dynamical systems have been found which require appropriately adjusted visualization algorithms. We are testing quantitatively performance of two visualization algorithms based on energy minimization principle on variety of complex networks from cell-aggregated planar graphs to highly clustered scale-free networks. We found that fairly large structures with high clustering can be efficiently visualized with spring energy model with truncated interaction.
A Prototype for Human-Like e-Learning System
Authors: Kenji Yoshida, Yuji Shinoda, Koji Miyazaki, Kayoko Nakagami, Hirotaka Nakayama
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

There are two types of e-Learning systems, namely, a synchronous type system and an asynchronous type system. Interactive communications with a teacher are important for education. However, an asynchronous, lecture type e-Learning system has some difficulty for keeping students' motivation and encouraging active learning. In this paper, we introduce a human-like e-Learning system based on machine learning techniques. This system has 3 kinds of subsystem. The fist is the detection of students' situation by patterning. The second is the automatic question answering. The third is to generate facial expressions of animations synchronized with pre-recorded audio data. Our human-like e-Learning system provides experimental contents for active learning and communicative functions such as chat. As a result, students can learn with a pleasant feeling.
A Novel Chaotic Neural Network for Function Optimization
Authors: Ting Zhou, Zhenhong Jia, Xiuling Liu
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Chaotic neural networks have been proved to be powerful tools to solve the optimization problems. And the chaotic neural networks whose activation function is non-monotonous will be more effective than Chen's chaotic neural network in solving optimization problems, especially in searching global minima of continuous function and traveling salesman problems. In this paper, a novel chaotic neural network for function optimization is introduced. In contrast to the Chen's chaotic neural network, the activation function of the novel chaotic neural network is wavelet function and the different-parameters annealing function are adopted in different period, so it performs extremely better when compared to the convergence speed and the accuracy of the results. And two elaborate examples of function optimization are given to show its superiority. This chaotic neural network can be a new powerful approach to solving a class of function optimization problems.
A Dynamic Committee Scheme on Multiple-Criteria Linear Programming Classification Method
Authors: Meihong Zhu, Yong Shi, Aihua Li, Jing He
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

This paper aims to provide a scheme for effectively and efficiently finding an approximately optimal example size with respect to a given dataset when using Multiple-Criteria Linear Programming (MCLP) classification method. By integrating techniques of both progressive sampling and classification committee, it designs a dynamic classification committee scheme for MCLP. The experimental results have shown that our idea is feasible and the scheme is effective and efficient for exploring an approximately optimal sample size. The empirical results also help us to further investigate some general specialties of MCLP, such as the more general function expressions reflecting the relationship between accuracy and sample size, and between computing cost and sample size.
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
Authors: Emanuele G. Fusco, Andrzej Pelc
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We study broadcasting time in radio networks, modeled as unit disk graphs (UDG). Emek et al. showed that broadcasting time depends on two parameters of the UDG network, namely, its diameter D (in hops) and its granularity g. The latter is the inverse of the density d of the network which is the minimum Euclidean distance between any two stations. They proved that the minimum broadcasting time is $ \Theta \left( \min\left\{ D + g^2, D \log{g} \right\} \right) $, assuming that each node knows the density of the network and knows exactly its own position in the plane.In many situations these assumptions are unrealistic. Does removing them influence broadcasting time? The aim of this paper is to answer this question, hence we assume that density is unknown and nodes perceive their position with some unknown error margin ¿. It turns out that this combination of missing and inaccurate information substantially changes the problem: the main new challenge becomes fast broadcasting in sparse networks (with constant density), when optimal time is O(D). Nevertheless, under our very weak scenario, we construct a broadcasting algorithm that maintains optimal time $ O \left( \min\left\{ D + g^2, D \log{g} \right\}\right)$ for all networks with at least 2 nodes, of diameter D and granularity g, if each node perceives its position with error margin ¿ = ¿d, for any (unknown) constant ¿< 1/2. Rather surprisingly, the minimum time of an algorithm stopping if the source is alone, turns out to be ¿(D + g 2). Thus, the mere stopping requirement for the special case of the lonely source causes an exponential increase in broadcasting time, for networks of any density and any small diameter. Finally, broadcasting is impossible if ¿ ¿ d/2.
A boundary-integral model for drop deformation between two parallel plates with non-unit viscosity ratio drops
Authors: P. J. A. Janssen, P. D. Anderson
Venue: Journal of Computational Physics (2008)

A boundary-integral method is presented for drop deformation between two parallel walls for non-unit viscosity ratio systems. To account for the effect of the walls the Green's functions are modified and all terms for the double-layer potential are derived. The full three-dimensional implementation is validated, and the model is shown to be accurate and consistent. The method is applied to study drop deformation in shear flow. An excellent match with small-deformation theory is found at low capillary numbers, and our results match with other BIM simulations for pressure-driven flows. For shear flow with moderate capillary numbers, we see that the behavior of a low-viscosity drop is similar to that of drop with a viscosity ratio of unity. High-viscosity drops, on the other hand, are prevented from rotating in shear flow, which results in a larger deformation, but less overshoot in the drop axes is observed. In contrast with unconfined flow, high-viscosity drops can be broken in shear flow between parallel plates; for low-viscosity drops the critical capillary number is higher in confined situations.
An Effective SPARQL Support over Relational Databases
Authors: Jing Lu, Feng Cao, Li Ma, Yong Yu, Yue Pan
Venue: Semantic Web, Ontologies and Databases: VLDB Workshop, SWDB-ODBIS 2007, Vienna, Austria, September 24, 2007, Revised Selected Papers (2008)

Supporting SPARQL queries over relational databases becomes an active topic recently. However, it has not received enough consideration when SPARQL queries include restrictions on values (i.e filter expressions), whereas such a scenario is very common in real life applications. Challenges to solve this problem come from two aspects, (1) databases aspect. In order to fully utilize the well-developed SQL optimization engine, the generated SQL query is desired to be a single statement. (2) SPARQL query aspect. A practical SPARQL query often embeds several filters, which require comparisons between RDF results of different types. The type of RDF resources needs to be dynamically determined in the translation. In this paper, we propose an effective approach to support SPARQL queries over relational databases, with the above challenges in mind. To ensure the seamless translation, a novel facet-based scheme is designed to handle filter expressions. Optimization strategies are proposed to reduce the complexity of the generated SQL query. Experimental results confirm the effectiveness of our proposed techniques.
A Tailored V-Model Exploiting the Theory of Preemptive Time Petri Nets
Authors: Laura Carnevali, Leonardo Grassi, Enrico Vicario
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

We describe a methodology that embeds the theory of preemptive Time Petri Nets (pTPN) along development and verification activities of a V-Model lifecycle to support the construction of concurrent real time SW components. Design activities leverage on a pTPN specification of the set of concurrent timed tasks. This supports design validation through simulation and state space analysis, and drives disciplined coding based on conventional primitives of a real-time operating system. In verification activities, the pTPN model comprises an Oracle for unit and integration testing and its symbolic state space supports test case selection, test sensitization and coverage evaluation.