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.

Prediction of Oncogenic Interactions and Cancer-Related Signaling Networks Based on Network Topology

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

The influence of self-weight of elastic 2D structures in topology optimization via numerical technique Smooth Evolutionary Structural Optimization (SESO)

This paper deals with topology optimization in plane elastic-linear problems considering the influence of the self weight in efforts in structural elements. For this purpose it is used a numerical technique called SESO (Smooth ESO), which is based on the procedure for progressive decrease of the inefficient stiffness element contribution at lower stresses until he has no more influence. The SESO is applied with the finite element method and is utilized a triangular finite element and high order. This paper extends the technique SESO for application its self weight where the program, in computing the volume and specific weight, automatically generates a concentrated equivalent force to each node of the element. The evaluation is finalized with the definition of a model of strut-and-tie resulting in regions of stress concentration. Examples are presented with optimum topology structures obtaining optimal settings. (C) 2012 CIMNE (Universitat Politecnica de Catalunya). Published by Elsevier Espana, S.L.U. All rights reserved.

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)

Virtual Topology Reconfiguration of Wavelength-routed Optical WDM Networks

The bandwidth requirements of the Internet are increasing every day and there are newer and more bandwidth-thirsty applications emerging on the horizon. Wavelength division multiplexing (WDM) is the next step towards leveraging the capabilities of the optical fiber, especially for wide-area backbone networks. The ability to switch a signal at intermediate nodes in a WDM network based on their wavelengths is known as wavelength-routing. One of the greatest advantages of using wavelength-routing WDM is the ability to create a virtual topology different from the physical topology of the underlying network. This virtual topology can be reconfigured when necessary, to improve performance. We discuss the previous work done on virtual topology design and also discuss and propose different reconfiguration algorithms applicable under different scenarios.

Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with Shared Risk Link Groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in [1]. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to [1]) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we computed the survivable virtual topology routing against link and SRLG failures for small and medium sized networks efficiently. As even our improved ILP formulation becomes intractable for large networks, we present a congestion-based heuristic and a tabu search heuristic (which uses the congestion-based heuristic solution as the initial solution) for computing survivable routing of a virtual topology. Our experimental results show that tabu search heuristic coupled with the congestion based heuristic (used as initial solution) provides fast and near-optimal solutions.

An Analytical Model for Virtual Topology Reconfiguration in Optical Networks and A Case Study

An analytical model for Virtual Topology Reconfiguration (VTR) in optical networks is developed. It aims at the optical networks with a circuit-based data plane and an IPlike control plane. By identifying and analyzing the important factors impacting the network performance due to VTR operations on both planes, we can compare the benefits and penalties of different VTR algorithms and policies. The best VTR scenario can be adaptively chosen from a set of such algorithms and policies according to the real-time network situations. For this purpose, a cost model integrating all these factors is created to provide a comparison criterion independent of any specific VTR algorithm and policy. A case study based on simulation experiments is conducted to illustrate the application of our models.

Class Notes for Math 871: General Topology, Instructor Jamie Radcliffe

Topics include: Topological space and continuous functions (bases, the product topology, the box topology, the subspace topology, the quotient topology, the metric topology), connectedness (path connected, locally connected), compactness, completeness, countability, filters, and the fundamental group.

Selection of Switching Sites in All-Optical Nework Topology Design

In this paper, we consider the problem of topology design for optical networks. We investigate the problem of selecting switching sites to minimize total cost of the optical network. The cost of an optical network can be expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. To the best of our knowledge, this problem has not been studied in its general form as investigated in this paper. We present a mixed integer quadratic programming (MIQP) formulation of the problem to find the optimal value of the total network cost. We also present an efficient heuristic to approximate the solution in polynomial time. The experimental results show good performance of the heuristic. The value of the total network cost computed by the heuristic varies within 2% to 21% of its optimal value in the experiments with 10 nodes. The total network cost computed by the heuristic for 51% of the experiments with 10 node network topologies varies within 8% of its optimal value. We also discuss the insight gained from our experiments.

Topology Verification for Isosurface Extraction

The broad goals of verifiable visualization rely on correct algorithmic implementations. We extend a framework for verification of isosurfacing implementations to check topological properties. Specifically, we use stratified Morse theory and digital topology to design algorithms which verify topological invariants. Our extended framework reveals unexpected behavior and coding mistakes in popular publicly available isosurface codes.

TOPOLOGY OF SINPLE SINGULARITIES OF RULED SURFACES IN R-p

In this work we compare the simple singularities of germs from R-2 to R-p with multiplicity 2 or 3 with the singularities appearing in the set of 2-ruled surfaces. We also study the topological type of all finitely determined singularities by studying generic projections of these singularities in R-3. (C) 2011 Elsevier B.V. All rights reserved.

Influence of pattern gradation on the design of piezocomposite energy harvesting devices using topology optimization

Piezoelectric materials can be used to convert oscillatory mechanical energy into electrical energy. Energy harvesting devices are designed to capture the ambient energy surrounding the electronics and convert it into usable electrical energy. The design of energy harvesting devices is not obvious, requiring optimization procedures. This paper investigates the influence of pattern gradation using topology optimization on the design of piezocomposite energy harvesting devices based on bending behavior. The objective function consists of maximizing the electric power generated in a load resistor. A projection scheme is employed to compute the element densities from design variables and control the length scale of the material density. Examples of two-dimensional piezocomposite energy harvesting devices are presented and discussed using the proposed method. The numerical results illustrate that pattern gradation constraints help to increase the electric power generated in a load resistor and guides the problem toward a more stable solution. (C) 2012 Elsevier Ltd. All rights reserved.

Base-Paired and Base-Stacked Structures of the Anti-HIV Drug Lamivudine: A Nucleoside DNA-Mimicry with Unprecedented Topology

We have prepared a DNA-mimicry of nucleosides in which the anti-HIV drug lamivudine (beta-L-2',3'-dideoxy-3'-thiacytidine, 3TC) self-assembles into a base-paired and helically base-stacked hexagonal structure. Face-to-face and face-to-tail stacked 3TC=3TC dimers base-paired through two hydrogen bonds between neutral cytosines by either N-H center dot center dot center dot O or N-H center dot center dot center dot N atoms give rise to a right-handed DNA-mimicry of lamivudine with an unusual highly symmetric hexagonal lattice and topology. In addition, a base-paired and base-stacked supramolecular architecture of lamivudine hemihydrochloride hemihydrate was also obtained as a result of our crystal screenings. This structure is formed through partially face-to-face stacked lamivudine pairs held together by protonated and neutral fragments. However, no helical stacking occurs in this structure in which lamivudine also adopts unusual conformations as the C1'-endo and C1'-exo sugar puckers and cytosine orientations intermediate between the anti and syn conformations. As a conclusion drawn from the nucleoside duplex, the hexagonal DNA-mimicry of lamivudine reveals that such double-stranded helices can be assembled without counterions and organic solvents but with higher crystallographic symmetry instead, because only water crystallizes together with lamivudine in this structure.

Designing piezoresistive plate-based sensors with distribution of piezoresistive material using topology optimization

Piezoresistive sensors are commonly made of a piezoresistive membrane attached to a flexible substrate, a plate. They have been widely studied and used in several applications. It has been found that the size, position and geometry of the piezoresistive membrane may affect the performance of the sensors. Based on this remark, in this work, a topology optimization methodology for the design of piezoresistive plate-based sensors, for which both the piezoresistive membrane and the flexible substrate disposition can be optimized, is evaluated. Perfect coupling conditions between the substrate and the membrane based on the `layerwise' theory for laminated plates, and a material model for the piezoresistive membrane based on the solid isotropic material with penalization model, are employed. The design goal is to obtain the configuration of material that maximizes the sensor sensitivity to external loading, as well as the stiffness of the sensor to particular loads, which depend on the case (application) studied. The proposed approach is evaluated by studying two distinct examples: the optimization of an atomic force microscope probe and a pressure sensor. The results suggest that the performance of the sensors can be improved by using the proposed approach.

Three-feature model to reproduce the topology of citation networks and the effects from authors' visibility on their h-index

Various factors are believed to govern the selection of references in citation networks, but a precise, quantitative determination of their importance has remained elusive. In this paper, we show that three factors can account for the referencing pattern of citation networks for two topics, namely "graphenes" and "complex networks", thus allowing one to reproduce the topological features of the networks built with papers being the nodes and the edges established by citations. The most relevant factor was content similarity, while the other two - in-degree (i.e. citation counts) and age of publication - had varying importance depending on the topic studied. This dependence indicates that additional factors could play a role. Indeed, by intuition one should expect the reputation (or visibility) of authors and/or institutions to affect the referencing pattern, and this is only indirectly considered via the in-degree that should correlate with such reputation. Because information on reputation is not readily available, we simulated its effect on artificial citation networks considering two communities with distinct fitness (visibility) parameters. One community was assumed to have twice the fitness value of the other, which amounts to a double probability for a paper being cited. While the h-index for authors in the community with larger fitness evolved with time with slightly higher values than for the control network (no fitness considered), a drastic effect was noted for the community with smaller fitness. (C) 2012 Elsevier Ltd. All rights reserved.