ppxscal/embedding_network huggingface dataset:
Heterogeneous Protection in Regular and Complete Bi-partite Networks
Authors: Jasmina Omić, Robert E. Kooij, Piet Mieghem
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

We examine the influence of heterogeneous curing rates for a SIS model, used for malware spreading on the Internet, information dissemination in unreliable networks, and propagation of failures in networks. The topology structures considered are the regular graph which represents the homogenous network structures and the complete bi-partite graph which represents the hierarchical network structures. We find the threshold in a regular graph with m different curing rates.Further, we consider a complete bi-partite graph with 2 curing rates and find the threshold for any distribution of curing rates among nodes. In addition, we consider the optimization problem and show that the minimum sum of the curing rates that satisfies the threshold equation is equal to the number of links in the graph. The optimization problem is simplified by assuming fixed curing rates ¿ 1,¿ 2 and optimization of the distribution of curing rates among different sets of nodes.
Investigating the value of using sequences of natural computing heuristics to address traveling salesman problem
Authors: Lixin Tao
Venue:  (2008)

The Traveling Salesman Problem (TSP) is an important combinatorial optimization problem tackled by many researchers. A variety of existing algorithms aim at optimal or near optimal solutions to specific TSP instances. Nevertheless, as the number of cities increases, TSP becomes an NP hard problem. This research puts forward a novel approach to the TSP that employs sequences of Natural Computing Heuristics (NCH). NCHs describe a set of techniques that mimic aspects of nature as an approach to solving otherwise computationally-intractable problems. In particular, this research has applied the following five NCHs: simulated annealing (SA), genetic algorithm (GA), ant colony optimization (ACO), hill climbing (HC), and inver-over evolutionary algorithm (EA). Sequences are mapped to permutations of the heuristics, and those investigated consist of one, two, or three-heuristic combinations. The hypothesis of this research is that by investigating sequences of NCHs, one can viably predict heuristic combinations that can solve realistic TSP instances. The focus of this research is twofold: (1) to investigate the feasibility of multi-heuristic sequences as sufficient heuristics to TSP, and (2) to determine if patterns and behaviors can be extracted from the sequence experiments. Specifically, the patterns and behaviors of this investigation included percent optimality, elapsed time, city count, iterations, algorithmic scope, and city data layout. In addition, this research leveraged and expanded on insights of the Krink-Lovberg Life Cycle Model, an earlier study that used sequences of algorithms. The TSP instances investigated include previously studied problems of number-of-cities varying from a small number up to 101, 159, 280, 439, 575, and 1002 cities. The research encompassed three experiments with increasing complexity: each of the five NCH by themselves on small city size problems, sequences of all 20 pairs and all 60 triplets of NCH on small city size problems, and the 10 best second-experiment sequences and some of the best known single algorithms on the larger number-of-city problems. An analysis of the results on the larger number of cities showed that sequences beginning with GA and ending with ACO performed best, and that ACO by itself also performed well.
Influence of contact conditions on thermal responses of the hand
Authors: Jessica Galie, Hsin-Ni Ho, Lynette A. Jones
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

A series of experiments was conducted to evaluate how contact pressure and surface roughness influence the heat flux conducted out of the skin or object during contact. Changes in skin temperature assist in identifying objects held in the hand. In the first experiment an infrared thermal imaging system was used to measure skin temperature and contact area as participants generated forces ranging from 0.1 to 6 N with their index finger. The results showed that skin temperature decreased by an average of 5.5 °C across the range of forces studied and that the changes were greatest between 0.25–0.35 N and from 4–6 N. The second and third experiments examined the effect of the surface roughness of an object on skin temperature and on the perceived coldness of the object. A set of six copper blocks was machined to create a range of surface profiles. There was a slight decrease in skin temperature as the surface roughness of the object increased, contrary to theoretical predictions. Although small, these changes were perceptible as participants consistently chose the rougher of two stimuli when asked to select the cooler stimulus. These results indicate that contact pressure and surface roughness influence the change in skin temperature during contact and that they can have a perceptible influence on the perceived properties of objects held in the hand. Thermal models need to account for these effects if realistic feedback is to be presented in a thermal display.
Covariant Evolutionary Event Analysis for Base Interaction Prediction Using a Relational Database Management System for RNA
Authors: Weijia Xu, Stuart Ozer, Robin R. Gutell
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

With an increasingly large amount of sequences properly aligned, comparative sequence analysis can accurately identify not only common structures formed by standard base pairing but also new types of structural elements and constraints. However, traditional methods are too computationally expensive to perform well on large scale alignment and less effective with the sequences from diversified phylogenetic classifications. We propose a new approach that utilizes coevolutional rates among pairs of nucleotide positions using phylogenetic and evolutionary relationships of the organisms of aligned sequences. With a novel data schema to manage relevant information within a relational database, our method, implemented with a Microsoft SQL Server 2005, showed 90% sensitivity in identifying base pair interactions among 16S ribosomal RNA sequences from Bacteria, at a scale 40 times bigger and 50% better sensitivity than a previous study. The results also indicated covariation signals for a few sets of cross-strand base stacking pairs in secondary structure helices, and other subtle constraints in the RNA structure.
Hybrid viscosity-like approximation methods for nonexpansive mappings in Hilbert spaces
Authors: Lu-Chuan Ceng, Sy-Ming Guu, Jen-Chih Yao
Venue: Computers Mathematics with Applications (2009)

Consider on a real Hilbert space H a nonexpansive mapping T with a fixed point, a contraction f with coefficient 00, respectively. Let 0=1, with @m"n->@m(n->~), and prove the strong convergence of the iterative algorithm to a fixed point x@?@?Fix(T)@?C which is the unique solution of the variational inequality (for short, V I(A-I+@m(B-@cf),C)): >=0,@?x@?C. On the other hand, assume C is the intersection of the fixed-point sets of a finite number of nonexpansive mappings on H. We devise another iterative algorithm which generates a sequence {x"n} from an arbitrary initial point x"0@?H. The sequence {x"n} is proven to converge strongly to an element of C which is the unique solution x^* of the V I(A-I+@m(B-@cf),C). Applications to constrained generalized pseudoinverses are included.
Experimental results on the nonlinear ∞ control via quasi-lpv representation and game theory for wheeled mobile robots
Authors: Roberto s. Inoue, Adriano a. g. Siqueira, Marco h. Terra
Venue: Robotica (2009)

In this paper, nonlinear dynamic equations of a wheeled mobile robot are described in the state-space form where the parameters are part of the state (angular velocities of the wheels). This representation, known as quasi-linear parameter varying, is useful for control designs based on nonlinear <private-char><inline-graphic mime-subtype="gif" xlink="S0263574708004931_char2"/></private-char>∞ approaches. Two nonlinear <private-char><inline-graphic mime-subtype="gif" xlink="S0263574708004931_char2"/></private-char>∞ controllers that guarantee induced <private-char><inline-graphic mime-subtype="gif" xlink="S0263574708004931_char3"/></private-char>2-norm, between input (disturbances) and output signals, bounded by an attenuation level γ, are used to control a wheeled mobile robot. These controllers are solved via linear matrix inequalities and algebraic Riccati equation. Experimental results are presented, with a comparative study among these robust control strategies and the standard computed torque, plus proportional-derivative, controller.
The Influence of Picture Quality Scale Measure on Choosing the Wavelet Transform during Image Compression
Authors: Maria Skublewska-Paszkowska, Jakub Smołka
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

One important issue of the image compression is the quality of the resultant image. The Picture Quality Scale Measure (PQS) was used to improve this quality. This perceptual measure evaluates the visual distortions in color compressed image on the basis of the original and the resultant ones. This measure uses also a group of observers who are needed to evaluate the distortions. The implementation of PQS measure together with neural network enabled the independence of human observers. It was also possible to use this measure to influence the quality during the process of image compression. Each level of the wavelet transform was compressed with one wavelet function which caused the least visual distortions which were computed by Picture Quality Scale. The image was compressed with different transforms. The choice of a particular transform was taken on the ground of the PQS value. There were five different wavelet transforms to choose: Haar, Daubechies degree 4, Daubechies degree 6, Daubechies degree 8 and 5/3 transform. The image was coded with Embedded Zerotree Wavelet Coding (EZW).
Antenna Design Optimization
Authors: T. L. Pitzer
Venue:  (2007)

A Genetic Algorithm (GA) is used in concert with the Numerical Electromagnetics Code, Version 4 (NEC4) to create and optimize typical wire antenna designs including single elements and arrays, the result being antennas with impressive characteristics. Previous work in antenna optimization is discussed as it relates to this method. The method shown applies to antennas whose basis of designs are both the Yagi-Uda antenna and the Log Periodic Dipole Array (LPDA) antenna. Also covered are applications in Passive Remote Sensing (PRS) and Over the Horizon Radar (OTHR). With color illustrations. Chapter titles are ...(1) Introduction ...(2) Background in Antenna Design and Optimization with Genetic Algorithms ...(3) Methodology for Designing, Testing and Analyzing Antennas ...(4) Experimental Results and Analysis of Synthesized Antennas ...(5) Conclusions ...(6) Appendix A: How to Use GNEC inside of iSIGHT ...(7) Appendix B: GNEC Code. 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
Robust 6DOF Motion Estimation for Non-Overlapping, Multi-Camera Systems
Authors: Brian Clipp, Jae-Hak Kim, Jan-Michael Frahm, Marc Pollefeys, Richard Hartley
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

This paper introduces a novel, robust approach for 6DOF motion estimation of a multi-camera system with non-overlapping views. The proposed approach is able to solve the pose estimation, including scale, for a two camera system with non-overlapping views. In contrast to previous approaches, it degrades gracefully if the motion is close to degenerate. For degenerate motions the technique estimates the remaining 5DOF. The proposed technique is evaluated on real and synthetic sequences.
Magnetic geometric dynamics around Tornado trap
Authors: Constantin Udriste, Monica Pirvan
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The contents of this paper include modeling and qualitative geometric analysis of magnetic Tornado trap. Section 1 gives a description of the Tornado magnetic trap, produced by two opposite currents flowing through a couple of concentric helical conductors, connected at the poles by two jumpers. Section 2 gives the components of the magnetic field around a Tornado configuration, using Biot-Savart-Laplace integrals. Section 3 presents magnetic morphology, simulations and critical points for the magnetic energy. Section 4 deals with linearizations of the magnetic dynamical systems around critical points of the magnetic energy.
Mosaicfaces: a discrete representation for face recognition
Authors: Jania Aghajanian, Simon J. D. Prince
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

Most face recognition algorithms use a "distance-based" approach: gallery and probe images are projected into a low dimensional feature space and decisions about matching are based on distance in this space. In this paper we use a very different representation, where each face is approximated by a regular grid of patches (a mosaicface). Each of these patches is chosen from a library. Faces are now represented as a list of indices to this library. Since there is no obvious way to measure distance between two such lists, we use a probabilistic approach in which the observed face data is explained by a generative model. There are two phases: (i) Learning - we estimate library contents and associated variability (noise). (ii) Recognition - we evaluate the probability that probe and gallery images were generated from the same library patches. Our method performs significantly better than contemporary approaches in the presence of large illumination changes. Variation in viewing conditions is handled by extending this model to learn equivalences between multiple patch appearances. We demonstrate that our method provides a major improvement on the lighting subset of the XM2VTS database compared to "distance-based" methods.
CCNA Voice Exam Cram, 1st edition
Authors: David Bateman, William Burton
Venue:  (2009)

CCNA Voice Exam Cram IIUC Exam 640-460 David Bateman William Burton, CCIE No. 1119 In this book youll learn how to Understand digital and analog circuits Use voice signaling protocols Connect your VoIP system to the rest of the world Configure your network to support VoIP Configure QoS and Cisco AutoQoS Configure Cisco Unified CME to support endpoints and connect to a service provider Configure Cisco Unity Express Implement business features Maintain and troubleshoot Cisco Unified CME and Cisco Unity Express Implement the Smart Business Communications System WRITTEN BY LEADING EXPERTs: David Bateman is a certified Cisco instructor with more than 20 years of internetworking experience. David is currently the director of curriculum development for Skyline-ATS. William Burton, CCIE No. 1119, CCVP, CCNP, CCVA, CCNA, is an author, instructor, and IT implementer with more than 35 years of experience. Mr. Burtons experience includes small to global network architecture and deployments for federal agencies, state and local governments, corporations, and educational institutions. CD Features Test Engine Powered by MeasureUp! This book includes a CD-ROM that features Complete coverage of CCNA Voice exam objectives Practice exams with detailed explanations of correct and incorrect answers Multiple exam modes An electronic copy of the book informit.com/examcram ISBN-13: 978-0-7897-3799-1 ISBN-10: 0-7897-3799-X
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Authors: Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The paper presents a case study on the synthesis of labelled transition systems (LTSs) for process calculi, choosing as testbed Cardelli and Gordon's Mobile Ambients (MAs). The proposal is based on a graphical encoding: each process is mapped into a graph equipped with suitable interfaces, such that the denotation is fully abstract with respect to the usual structural congruence. Graphs with interfaces are amenable to the synthesis mechanism proposed by Ehrig and Konig and based on borrowed contexts (BCs), an instance of relative pushouts, introduced by Leifer and Milner. The BC mechanism allows the effective construction of a LTS that has graphs with interfaces as both states and labels, and such that the associated bisimilarity is automatically a congruence. Our paper focuses on the analysis of a LTS over (processes as) graphs with interfaces, as distilled by exploiting the graphical encoding of MAs. In particular, we use the LTS on graphs to recover a suitable LTS directly defined over the structure of MAs processes.
Toward evaluation that leads to best practices: reconciling dialog evaluation in research and industry
Authors: Tim Paek
Venue: Proceedings of the Workshop on Bridging the Gap: Academic and Industrial Research in Dialog Technologies (2007)

Dialog evaluation is approached in different ways by research and industry. While researchers have sought commensurable evaluation metrics that allow for comparison of disparate systems with varying tasks and domains, industry engineers have focused mostly on best practices and delivering a return-on-investment to customers. In this paper, we contend that the problem of finding commensurable metrics also applies to commercial evaluation, and critically survey four candidate metrics for commensurability. Finally, in light of the problems faced by the candidate metrics, we advocate a collaborative agenda for dialog evaluation based on using statistical meta-analysis for empirically establishing best practices from any evaluation metric.
Power of peripheral designers: how users learn to design
Authors: Yutaka Yamauchi
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

In information system development, end-users often participate in design and in many cases learn to design their own system. Design, however, requires a distinct approach that users typically are not familiar with. The unique position in which users find themselves makes users' learning even more complicated: They have no interest in designing and becoming designers. To understand how users learn to design despite such difficulties, longitudinal ethnography was conducted in an accounting system development project. The analysis reveals how a user progressively acquired the design capability in two months. In the beginning, the user treated the problem as given and rejected design proposed by designers that did not solve the given problems. The user then gradually learned the details of the system and started to explore various configurations of features; however, this design focused on parts, with the problem remaining fixed. The user finally demonstrated her design capability by constructing creative designs both in parts and on the whole. Drawing on situated learning theory, the notion of the peripheral designer is used to illustrate this type of design practice. The user became a peripheral designer in that she could design in a competent but peripheral manner without becoming a full designer. Power relationships posed challenges to this learning. The notion of the peripheral designer clarifies what designing is, beyond active participation in discussion and configuration of parts, and delineates a realistic picture of how a user learns to design in the real world.
Characterization of Vehicle-to-Vehicle Radio Channels from Measurements at 5.2 GHz
Authors: Alexander Paier, Johan Karedal, Nicolai Czink, Charlotte Dumard, Thomas Zemen, Fredrik Tufvesson, Andreas F. Molisch, Christoph F. Mecklenbräuker
Venue: Wireless Personal Communications: An International Journal (2009)

The development of efficient vehicle-to-vehicle (V2V) communications systems requires an understanding of the underlying propagation channels. In this paper, we present results on pathloss, power-delay profiles (PDPs), and delay-Doppler spectra from a high speed measurement campaign on a highway in Lund, Sweden. Measurements were performed at a carrier frequency of 5.2 GHz with the communicating vehicles traveling on the highway in opposite directions. A pathloss coefficient of 1.8 shows the best fit in the mean square sense with our measurement. The average root mean square (RMS) delay spread is between 263 ns and 376 ns, depending on the noise threshold. We investigate and describe selected paths in the delay-Doppler domain, where we observe Doppler shifts of more than 1,000 Hz.
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Authors: Elena Czeizler, Wojciech Plandowski
Venue: Theoretical Computer Science (2009)

In this paper, we investigate the open question, formulated in 1983 by Culik II and Karhumaki, asking whether there exist independent systems of three word equations over three unknowns admitting non-periodic solutions. In particular, we answer negatively the above mentioned question for systems in which one of the unknowns occurs at most six times. That is, we show that such systems admit only periodic solutions or they are not independent.
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Authors: Sofus A. Macskassy
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised learning algorithm that uses Gaussian fields and harmonic functions. This classifier is relational in nature: it relies on having the data presented as a partially labeled graph (also known as a within-network learning problem). This work showed yet again that empirical risk minimization (ERM) was the best method to find the next instance to label and provided an efficient way to compute ERM with the semi-supervised classifier. The computational problem with ERM is that it relies on computing the risk for all possible instances. If we could limit the candidates that should be investigated, then we can speed up active learning considerably. In the case where the data is graphical in nature, we can leverage the graph structure to rapidly identify instances that are likely to be good candidates for labeling. This paper describes a novel hybrid approach of using of community finding and social network analytic centrality measures to identify good candidates for labeling and then using ERM to find the best instance in this candidate set. We show on real-world data that we can limit the ERM computations to a fraction of instances with comparable performance.