Sampling Biases in IP Topology Measurements

Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute studies have led some authors to conclude that the router graph of the Internet is a scale-free graph, or more generally a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. In this paper we argue that the evidence to date for this conclusion is at best insufficient. We show that graphs appearing to have power-law degree distributions can arise surprisingly easily, when sampling graphs whose true degree distribution is not at all like a power-law. For example, given a classical Erdös-Rényi sparse, random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can easily appear to show a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to distinguish measurements taken from the Erdös-Rényi graphs from those taken from power-law random graphs. When we apply this distinction to a number of well-known datasets, we find that the evidence for sampling bias in these datasets is strong.

On the set of hypercyclic vectors for the differentiation

Let D be the differentiation operator Df = f' acting on the Fréchet space H of all entire functions in one variable with the standard (compact-open) topology. It is known since the 1950’s that the set H(D) of hypercyclic vectors for the operator D is non-empty. We treat two questions raised by Aron, Conejero, Peris and Seoane-Sepúlveda whether the set H(D) contains (up to the zero function) a non-trivial subalgebra of H or an infinite-dimensional closed linear subspace of H. In the present article both questions are answered affirmatively.

Central-Tapped Node Linked Modular Fault-Tolerance Topology for SRM Applications

Electric vehicles (EVs) and hybrid electric vehicles (HEVs) can reduce greenhouse gas emissions while switched reluctance motor (SRM) is one of the promising motor for such applications. This paper presents a novel SRM fault-diagnosis and fault-tolerance operation solution. Based on the traditional asymmetric half-bridge topology for the SRM driving, the central tapped winding of the SRM in modular half-bridge configuration are introduced to provide fault-diagnosis and fault-tolerance functions, which are set idle in normal conditions. The fault diagnosis can be achieved by detecting the characteristic of the excitation and demagnetization currents. An SRM fault-tolerance operation strategy is also realized by the proposed topology, which compensates for the missing phase torque under the open-circuit fault, and reduces the unbalanced phase current under the short-circuit fault due to the uncontrolled faulty phase. Furthermore, the current sensor placement strategy is also discussed to give two placement methods for low cost or modular structure. Simulation results in MATLAB/Simulink and experiments on a 750-W SRM validate the effectiveness of the proposed strategy, which may have significant implications and improve the reliability of EVs/HEVs.

Topology via enriched categories

Having as a starting point the characterization of probabilistic metric spaces as enriched categories over the quantale , conditions that allow the generalization of results relating Cauchy sequences, convergence of sequences, adjunctions of V-distributors and its representability are established. Equivalence between L-completeness and L-injectivity is also established. L-completeness is characterized via the Yoneda embedding, and injectivity is related with exponentiability. Another kind of completeness is considered and the formal ball model is analyzed.

Efficient topology estimation for large scale optical mapping

Large scale image mosaicing methods are in great demand among scientists who study different aspects of the seabed, and have been fostered by impressive advances in the capabilities of underwater robots in gathering optical data from the seafloor. Cost and weight constraints mean that lowcost Remotely operated vehicles (ROVs) usually have a very limited number of sensors. When a low-cost robot carries out a seafloor survey using a down-looking camera, it usually follows a predetermined trajectory that provides several non time-consecutive overlapping image pairs. Finding these pairs (a process known as topology estimation) is indispensable to obtaining globally consistent mosaics and accurate trajectory estimates, which are necessary for a global view of the surveyed area, especially when optical sensors are the only data source. This thesis presents a set of consistent methods aimed at creating large area image mosaics from optical data obtained during surveys with low-cost underwater vehicles. First, a global alignment method developed within a Feature-based image mosaicing (FIM) framework, where nonlinear minimisation is substituted by two linear steps, is discussed. Then, a simple four-point mosaic rectifying method is proposed to reduce distortions that might occur due to lens distortions, error accumulation and the difficulties of optical imaging in an underwater medium. The topology estimation problem is addressed by means of an augmented state and extended Kalman filter combined framework, aimed at minimising the total number of matching attempts and simultaneously obtaining the best possible trajectory. Potential image pairs are predicted by taking into account the uncertainty in the trajectory. The contribution of matching an image pair is investigated using information theory principles. Lastly, a different solution to the topology estimation problem is proposed in a bundle adjustment framework. Innovative aspects include the use of fast image similarity criterion combined with a Minimum spanning tree (MST) solution, to obtain a tentative topology. This topology is improved by attempting image matching with the pairs for which there is the most overlap evidence. Unlike previous approaches for large-area mosaicing, our framework is able to deal naturally with cases where time-consecutive images cannot be matched successfully, such as completely unordered sets. Finally, the efficiency of the proposed methods is discussed and a comparison made with other state-of-the-art approaches, using a series of challenging datasets in underwater scenarios

On universal and periodic β-expansions, and the Hausdorff dimension of the set of all expansions

We study the topology of a set naturally arising from the study of β-expansions. After proving several elementary results for this set we study the case when our base is Pisot. In this case we give necessary and sufficient conditions for this set to be finite. This finiteness property will allow us to generalise a theorem due to Schmidt and will provide the motivation for sufficient conditions under which the growth rate and Hausdorff dimension of the set of β-expansions are equal and explicitly calculable.

Integrable maps with non-trivial topology: application to divertor configurations

We explore a method for constructing two-dimensional area-preserving, integrable maps associated with Hamiltonian systems, with a given set of fixed points and given invariant curves. The method is used to find an integrable Poincare map for the field lines in a large aspect ratio tokamak with a poloidal single-null divertor. The divertor field is a superposition of a magnetohydrodynamic equilibrium with an arbitrarily chosen safety factor profile, with a wire carrying an electric current to create an X-point. This integrable map is perturbed by an impulsive perturbation that describes non-axisymmetric magnetic resonances at the plasma edge. The non-integrable perturbed map is applied to study the structure of the open field lines in the scrape-off layer, reproducing the main transport features obtained by integrating numerically the magnetic field line equations, such as the connection lengths and magnetic footprints on the divertor plate.

A non-normal topology generated by a two-point selection

We construct a two-point selection f : [P](2) -> P, where P is the set of the irrational numbers, such that the space (P, tau(f)) is not normal and it is not collectionwise Hausdorff either. Here, tau(f) denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if f :[X](2) -> X is a two-point selection such that the topology tau(f) has countable pseudocharacter, then tau(f) is a Tychonoff topology. (C) 2008 Elsevier B.V. All rights reserved.

In silico network topology-based prediction of gene essentiality

The identification of genes essential for survival is important for the understanding of the minimal requirements for cellular life and for drug design. As experimental studies with the purpose of building a catalog of essential genes for a given organism are time-consuming and laborious, a computational approach which could predict gene essentiality with high accuracy would be of great value. We present here a novel computational approach, called NTPGE (Network Topology-based Prediction of Gene Essentiality), that relies on the network topology features of a gene to estimate its essentiality. The first step of NTPGE is to construct the integrated molecular network for a given organism comprising protein physical, metabolic and transcriptional regulation interactions. The second step consists in training a decision-tree-based machine-learning algorithm on known essential and non-essential genes of the organism of interest, considering as learning attributes the network topology information for each of these genes. Finally, the decision-tree classifier generated is applied to the set of genes of this organism to estimate essentiality for each gene. We applied the NTPGE approach for discovering the essential genes in Escherichia coli and then assessed its performance. (C) 2007 Elsevier B.V. All rights reserved.

Search for scalar leptoquarks and T-odd quarks in the acoplanar jet topology using 2.5 fb(-1) of p(p)over-bar collision data at root s=1.96 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Search for neutral Higgs bosons in the multi-b-jet topology in 5.2 fb(-1) of p(p)over-bar collisions at root s=1.96 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Search for the Standard Model Higgs Boson in the Missing Energy and Acoplanar b-Jet Topology at root s=1.96 TeV

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Quantum topology change and large-N gauge theories

We study a model for dynamical localization of topology using ideas from non-commutative geometry and topology in quantum mechanics. We consider a collection X of N one-dimensional manifolds and the corresponding set of boundary conditions (self-adjoint extensions) of the Dirac operator D. The set of boundary conditions encodes the topology and is parameterized by unitary matrices g. A particular geometry is described by a spectral triple x(g) = (A X, script H sign X, D(g)). We define a partition function for the sum over all g. In this model topology fluctuates but the dimension is kept fixed. We use the spectral principle to obtain an action for the set of boundary conditions. Together with invariance principles the procedure fixes the partition function for fluctuating topologies. The model has one free-parameter β and it is equivalent to a one plaquette gauge theory. We argue that topology becomes localized at β = ∞ for any value of N. Moreover, the system undergoes a third-order phase transition at β = 1 for large-N. We give a topological interpretation of the phase transition by looking how it affects the topology. © SISSA/ISAS 2004.

Controllability of control systems on complex simple lie groups and the topology of flag manifolds

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)