ppxscal/embedding_network huggingface dataset:
Shedding light on the glue logic of the internet routing architecture
Authors: Franck Le, Geoffrey G. Xie, Dan Pei, Jia Wang, Hui Zhang
Venue: ACM SIGCOMM Computer Communication Review (2008)

Recent studies reveal that the routing structures of operational networks are much more complex than a simple BGP/IGP hierarchy, highlighted by the presence of many distinct instances of routing protocols. However, the glue (how routing protocol instances interact and exchange routes among themselves) is still little understood or studied. For example, although Route Redistribution (RR), the implementation of the glue in router software, has been used in the Internet for more than a decade, it was only recently shown that RR is extremely vulnerable to anomalies similar to the permanent route oscillations in BGP. This paper takes an important step toward understanding how RR is used and how fundamental the role RR plays in practice. We developed a complete model and associated tools for characterizing interconnections between routing instances based on analysis of router configuration data. We analyzed and characterized the RR usage in more than 1600 operational networks. The findings are: (i) RR is indeed widely used; (ii) operators use RR to achieve important design objectives not realizable with existing routing protocols alone; (iii) RR configurations can be very diverse and complex. These empirical discoveries not only confirm that the RR glue constitutes a critical component of the current Internet routing architecture, but also emphasize the urgent need for more research to improve its safety and flexibility to support important design objectives.
Extending Solid Modeling Systems for Mechanism Design and Kinematic Simulation
Authors: Robert Tilove
Venue: IEEE Computer Graphics and Applications (1983)

Already operational in General Motors' GMSolid system, this technique can be implemented in most current geometric modeling systems.
Realizing the Hydrogen Economy through Semantic Web Technologies
Authors: Jane Hunter, John Drennan, Suzanne Little
Venue: IEEE Intelligent Systems (2004)

Experts have been saying that we have only another 40 or so years of cheap recoverable crude oil left. Hydrogen fuel cells offer an alternative, clean, reliable source of energy for residential use, transport, and remote communities. Many observers view as inevitable the transition from an economy powered by fossil fuels to one based on hydrogen. Before that can happen, materials scientists face the research challenges of improving fuel cells' efficiency, reducing their production costs, determining how they degrade over time, extending their life, and recycling their components. The University of Queensland's Distributed Systems Technology Centre and the Centre for Microscopy and Microanalysis are working on FUSION (Fuel Cell Understanding through Semantic Inferencing, Ontologies and Nanotechnology) a collaborative project that's applying, extending, and combining Semantic Web technologies and image analysis techniques to optimize fuel cell design. The project is developing metadata schemas, ontologies, semantic-inferencing rules, and visualization tools. These products aim to streamline the capture and assimilation of large mixed-media data sets to reveal trends and correlations between the manufacturing conditions, microstructural information, and performance of fuel cells. The technologies being developed could set new paradigms for knowledge management and sharing across a wide range of scientific and microstructural engineering applications.
On Modeling Post Decryption Error Processes in UMTS Air Interface
Authors: Fouz Sattar, Muid Mufti
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

This paper analyzes the impact of encryption over the UMTS air interface. Using a finite state Markov characterization of the UMTS decryption process, a stochastic model has been developed that quantifies the impact of bit errors in the ciphertext and cipher synchronization counter. The effects of residual bit errors, UMTS air interface power budget, interleaving span and channel coding rate on the decryption process are analyzed.
Turing Unbound: Transfinite Computation
Authors: Philip D. Welch
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The intention of this talk is to look at various models of transfinite computation and give some calculations as to their comparative power. To clarify the kind of models that we are looking at, they will all be discrete acting: this will mean that they essentially perform simple discrete tasks in simple steps or stages. The reader should have in mind the paradigm of the standard Turing Machine which of course performs such simple actions as moving one cell left or right on the tape that it is reading, altering a symbol, changing a state etc etc. We are thus not considering any kind of machine or notional device that computes in an analogue fashion, nor any machine, such as neural network with nodes primed by infinitely precise real numbers, nor computations performed in chemistry beakers, across cell membranes, or in buckets of slime. 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
Adaptive Nonlinear Control Using TSK-Type Recurrent Fuzzy Neural Network System
Authors: Ching-Hung Lee, Ming-Hui Chiu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a TSK-type recurrent fuzzy neural network (TRFNN) system and hybrid algorithm to control nonlinear uncertain systems. The TRFNN is modified from the RFNN to obtain generalization and fast convergence rate. The consequent part is replaced by linear combination of input variables and the internal variable- fire strength is feedforward to output to increase the network ability. Besides, a hybrid learning algorithm (GA_BPPSO) is proposed to increase the convergence, which combines the genetic algorithm (GA), back-propagation (BP), and particle swarm optimization (PSO). Several simulation results are proposed to show the effectiveness of TRFNN system and GA_BPPSO algorithm.
A Model to Identify Refactoring Effort during Maintenance by Mining Source Code Repositories
Authors: Raimund Moser, Witold Pedrycz, Alberto Sillitti, Giancarlo Succi
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

The use of refactoring as a way to continuously improve the design and quality of software and prevent its aging is mostly limited to Agile Methodologies and to a lower amount to software reengineering. In these communities refactoring is supposed to improve in the long-term the structure of existing code in order to make it easier to modify and maintain. To sustain such claims and analyze the impact of refactoring on maintenance we need to know how much refactoring developers do. In few cases such information is directly available for example from CVS log messages. In this study we propose a model on how to mine software repositories in order to obtain information of refactoring effort throughout the evolution of a software system. Moreover, we have developed a prototype that implements our model and validate our approach with two small case studies.
A Frequent Pattern Mining Algorithm for Understanding Genetic Algorithms
Authors: Minh Nghia Le, Yew Soon Ong
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, we present a Frequent Schemas Analysis (FSA) approach as an instance of Optinformatics for extracting knowledge on the search dynamics of Binary GA using the optimization data generated during the search. The proposed frequent pattern mining algorithm labeled here as LoFIA in FSA effectively mines for interesting implicit frequent schemas. Subsequently these schemas may be visualized to provide new insights into the workings of the search algorithm. A case study using the Royal Road problem is used to explain the search performance of Genetic Algorithm (GA) based on FSA in action.
Enhancing the Cooperative Transport of Multiple Objects
Authors: Antoine Decugnière, Benjamin Poulain, Alexandre Campo, Carlo Pinciroli, Bruno Tartini, Michel Osée, Marco Dorigo, Mauro Birattari
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In this paper we present an approach to the cooperative transport of multiple objects in swarm robotics. The approach is motivated by the observation that the performance of cooperative transport in insect colonies as well as in groups of robots grows in a super linear way with the number of individuals participating in the transport. The transport relies on a cart in which multiple objects are collected and stored before being moved to destination. The cart is carried by a group of robot that would be otherwise allocated to the transport of single objects. The cart is endowed with computational and communication abilities that allow it to cooperate with the transporting robots. This research is carried out within the framework of the Swarmanoid project and aims at enhancing the transport capabilities of the robot swarms developed in this project.
MTL with Bounded Variability: Decidability and Complexity
Authors: Carlo A. Furia, Matteo Rossi
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the case of generic dense-time behaviors, MTL is proved to be fully decidable over models with bounded variability, if the variability bound is given. In these decidable cases, MTL complexity is shown to match that of simpler decidable logics such as MITL. On the contrary, MTL is undecidable if all behaviors with variability bounded by some generic constant are considered, but with an undecidability degree that is lower than in the case of generic behaviors.
Synchronization and Parameter Identification for a Class of Chaotic Neural Networks with Time-Varying Delays Via Adaptive Control
Authors: Zhongsheng Wang, Yanjun Liang, Nin Yan
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The paper aims to present a new synchronization and parameter identification scheme for a class of time-varying neural networks. By combining the adaptive control method and the Razumikhin-type Theorem, a novel delay-independent and decentralized linear-feedback control with appropriate updated law is designed to achieve the synchronization and parameter identification. The updating law of parameters can be directly constructed. Hopfield neural networks with time-varying delays are given to show the effectiveness of the presented synchronization scheme.
Eulogy: Niels Ivar Bech, 1920-1975
Authors: Isaac L. Auerbach
Venue: IEEE Annals of the History of Computing (1984)

Niels Ivar Bech was one of Europe's most creative leaders in the field of electronic digital computers. He originated Danish computer development under the auspices of the Danish Academy of Technical Sciences and was first managing director of its subsidiary, Regnecentralen, which was Denmark's (and one of Europe's) first independent designer and builder of electronic computers.
An agent-oriented approach to support change propagation in software evolution
Authors: Khanh Hoa Dam
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program (2008)

Software maintenance and evolution is arguably a lengthy and expensive phase in the life cycle of a software system. A critical issue at this phase is change propagation: given a set of primary changes that have been made to software, what additional secondary changes are needed? Although many approaches have been proposed, automated change propagation is still a significant technical challenge in software maintenance and evolution. This paper presents a Ph.D. research in the final stages of developing and evaluating a novel, agent-based, framework to support semi-automated change propagation in evolving software systems.
Simplicial Powers of Graphs
Authors: Andreas Brandstädt, Van Bang Le
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k ¿ 2, a graph G = (V G ,E G ) is the k-simplicial power of a graph H = (V H ,E H ) (H a root graph of G) if V G is the set of all simplicial vertices of H, and for all distinct vertices x and y in V G , xy ¿ E G if and only if the distance in H between x and y is at most k. This concept generalizes k-leaf powers introduced by Nishimura, Ragde and Thilikos which were motivated by the search for underlying phylogenetic trees; k-leaf powers are the k-simplicial powers of trees. Recently, a lot of work has been done on k-leaf powers and their roots as well as on their variants phylogenetic roots and Steiner roots. For k ¿ {3,4,5}, k-leaf powers can be recognized in linear time, and for k ¿ {3,4}, structural characterizations are known. For all other k, recognition and structural characterization of k-leaf powers is open.Since trees and block graphs (i.e., connected graphs whose blocks are cliques) have very similar metric properties, it is natural to study k-simplicial powers of block graphs. We show that leaf powers of trees and simplicial powers of block graphs are closely related, and we study simplicial powers of other graph classes containing all trees such as ptolemaic graphs and strongly chordal graphs.
The Tools We Use
Authors: Diomidis Spinellis
Venue: IEEE Software (2007)

If we look at the tools we use to convert source code into executable format, we can get an accurate picture of the abstraction level that programmers face during construction and maintenance (where the largest chunk of software development effort takes place). Collecting data from the building of 7,000 application programs showed that most CPU time is spent compiling C and C++ code using tools with roots in the 1970s and 1980s. To see order-of-magnitude productivity improvements, we must raise our code's level of abstraction by adopting more modern technologies such as domain-specific languages, general purpose declarative languages, and executable UML.
Gem #11: limited types in Ada 2005: constructor functions part 2
Authors: Bob Duff
Venue: ACM SIGAda Ada Letters (2008)

Ada Gem #11 We show here how limited constructor functions can be used in various contexts to build new limited objects in place.
Clifford Edward Berry, 1918-1963: His Role in Early Computers
Authors: Jean R. Berry
Venue: IEEE Annals of the History of Computing (1986)

The author describes Clifford E. Berry role in early computing from her perspective. Berry was the co-inventor, along with J.V. Atanasoff, of the first digital Computer. 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
Consistency of sensor data in presence of updates
Authors: Levent Gürgen, Cyril Labbé, Claudia Roncancio, Vincent Olive
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

With the emergence of more and more intelligent, autonomous, small and cheap sensors, sensor-based applications become very popular in various domains, e.g., industrial, domestic, medical, environmental and military. Sensor data management has become a very actif research domain. However, existing research has principally focused on querying of sensor data. Their "updates" are little explored in this context. The updates concern for instance modification of properties, reconfigurations or firmware updates. These operations are necessary for remote management of sensors by their providers. However, updates may may invalidate the results of the concurrently executing continuous queries. This article studies the sensor updates and their impact on the coherency of query results.
Examining the Effect of Elitism in Cellular Genetic Algorithms Using Two Neighborhood Structures
Authors: Hisao Ishibuchi, Noritaka Tsukamoto, Yusuke Nojima
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Elitism has a large effect on the search ability of evolutionary algorithms. Many studies, however, did not discuss its different implementations in cellular algorithms. Usually a replacement policy called "replace-if-better" is applied to each cell in cellular algorithms as a kind of elitism. In this paper, we examine three implementations of elitism. One is global elitism where a prespecified number of the best individuals in the entire population are viewed as being the elite. The replace-if-better policy is applied only to the globally best individuals. Another scheme is local elitism where an individual is viewed as being the elite if it is the best among its neighbors. The replace-if-better policy is applied only to the locally best individuals. The other scheme is cell-wise elitism where the replace-if-better policy is applied to all individuals. Effects of elitism are examined through computational experiments using a cellular genetic algorithm with two neighborhood structures. One is for local competition among neighbors. This competition neighborhood is used in the local elitism to determine the locally best individuals. The other is for local selection of parents. This selection neighborhood is also called the mating neighborhood. Since we have the two neighborhood structures, we can specify the size of the competition neighborhood for the implementation of the local elitism independent of the selection neighborhood for mating. Experimental results show that the use of the replace-if-better policy at all cells is not always the best choice.
Making Scale with Units by Using Order Statistics from the Normal Distribution in AHP
Authors: Taki Kanda
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

AHP (Analytic Hierarchy Process) was created as a method to help us make decision by Tomas Saaty in 1970s and has been widely adopted in various fields such as economic problems, management problems, economic problems, energy problems or city planning etc. in many areas --- U.S.A., Europe and other areas. In AHP paired comparison is used and the values to answers in paired comparison are ratio-based scale. It is generally said that AHP has a problem such that the values for evaluation do not have units. In order to let the values for evaluation have units, order statistics from the normal distribution are used for the values to answers in paired comparison. By using order statistics for the values to answers in paired comparison, the values for evaluation are obtained, the units of which are the standard deviations of the standard normal distribution(¿= 1) on the basis of 0. Here taking a problem of selecting meals based upon human feeling, AHP is applied so as to obtain the values for evaluation of meal products which make us possible to easily compare our meal preference.
Three-Dimensional Imaging and Tracking for Constrained Brownian Motion of Single Nano-Scaled Particles in Solution
Authors: Danying Lin, Wanyun Ma, Xiaochen Liu, Yunxu Sun, Yao Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Objective-type total internal reflection fluorescence technique and Gaussian fit single particle tracking algorithm have been used to study the constrained Brownian motion characteristics of single fluorescent microspheres of 40 nm diameter in real-time. Three-dimensional tracking has been realized from the two-dimensional images by utilizing the exponential decay of the fluorescence intensity excited by the evanescent field. Trajectory analyses have shown that single fluorescent beads diffused in a constrained Brownian mode with a diffusion coefficient a little smaller than theoretical estimates in the plane-parallel direction.
An Approach to Natural Language Equation Reading in Digital Talking Books
Authors: Carlos Juzarte Rolo, António Joaquim Serralheiro
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

Mathematic equations are, of necessity, a must in any mathematic textbooks but also in physics, communications and, in general, in any technology related texts. Furthermore, their usage in Digital Talking Books (DTB)[1] can be eased if its corresponding counterpart in both text and/or spoken forms can be automatically generated. Therefore, an automatic system to translate or convert them into text and latter to speech is needed to broaden the scope of the DTBs.DTBs are based on different types of data, structured according to some standard. They also require a player or browser that allows users to navigate, to index and to retrieve information (text, sound, images, etc.). The player was developed using a model based framework for adaptive multi-modal environments [2]. Besides supporting the features described in the DTB standard, the player introduces features complementing the synchronized presentation of text and audio, such as: addition of content related images; variable synchronization units, ranging from word to paragraph; annotation controlled navigation; definition of new reading paths; adaptation of the visual elements; behavioral adaptation reflecting user interaction, amongst others.
Interoperable Bayesian Agents for Collaborative Learning Environments
Authors: Elisa Boff, Elder Rizzon Santos, Moser S. Fagundes, Rosa Maria Vicari
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

Collaborative work can be supported by many tools and it has been included in a large number of learning environments design. This paper presents issues related to an educational portal design and collaboration in Intelligent Tutoring Systems (ITS). In order to achieve the collaboration it was necessary to provide a way to interoperate knowledge among the heterogeneous systems. We have been developing ITS as resources to improve the individual and personalized learning. We believe that individual experiences can be more successful when the student has more autonomy and he is less dependent of the professor. In this research direction, this paper details the Social Agent reasoning, an agent to improve student's learning stimulating his interaction with other students, and how this agent exchange bayesian knowledge among AMPLIA agents. The AMPLIA environment is an Intelligent Probabilistic Multi-agent Environment to support the diagnostic reasoning development and the diagnostic hypotheses modeling of domains with complex and uncertain knowledge, like medical area.