• Title/Summary/Keyword: strong topology

Search Result 60, Processing Time 0.019 seconds

A Hierarchical Autonomous System Based Topology Control Algorithm in Space Information Network

  • Zhang, Wei;Zhang, Gengxin;Gou, Liang;Kong, Bo;Bian, Dongming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3572-3593
    • /
    • 2015
  • This article investigates the topology control problem in the space information network (SIN) using a hierarchical autonomous system (AS) approach. We propose an AS network topology control (AS-TC) algorithm to minimize the time delay in the SIN. Compared with most existing approaches for SIN where either the purely centralized or the purely distributed control method is adopted, the proposed algorithm is a hybrid control method. In order to reduce the cost of control, the control message exchange is constrained among neighboring sub-AS networks. We prove that the proposed algorithm achieve logical k-connectivity on the condition that the original physical topology is k-connectivity. Simulation results validate the theoretic analysis and effectiveness of the AS-TC algorithm.

Topology Optimization of a Brake Pad to Avoid the Brake Moan Noise Using Genetic Algorithm (Brake Moan Noise 소피를 위한 Brake Pad 위상최적화의 GA적용)

  • 한상훈;윤덕현;이종수;유정훈
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.4
    • /
    • pp.216-222
    • /
    • 2002
  • Brake Moan is a laud and strong noise occurring at any vehicle speed over 2 mph as a low frequency in below 600Hz. In this study, we targeted to shift the unstable mode that causes the brake moan from the moats frequency range to sufficiently higher frequency range to avoid the moan phenomenon. We simulated the finite element model and found out the nodes in which the brake moan occurs the most and we regarded the boundary and its relationship between the brake pad and the rotor as a spring coefficient k. With the binary set of the spring coefficient k, we finally used genetic algorithm (GA) to get the optimal topology of the brake pad and its shape to avoid the brake moan. The final result remarkably shows that genetic algorithm can be used in topology optimization procedures requiring complex eigenvalue problems.

Topology optimization of Reissner-Mindlin plates using multi-material discrete shear gap method

  • Minh-Ngoc Nguyen;Wonsik Jung;Soomi Shin;Joowon Kang;Dongkyu Lee
    • Steel and Composite Structures
    • /
    • v.47 no.3
    • /
    • pp.365-374
    • /
    • 2023
  • This paper presents a new scheme for constructing locking-free finite elements in thick and thin plates, called Discrete Shear Gap element (DSG), using multiphase material topology optimization for triangular elements of Reissner-Mindlin plates. Besides, common methods are also presented in this article, such as quadrilateral element (Q4) and reduced integration method. Moreover, when the plate gets too thin, the transverse shear-locking problem arises. To avoid that phenomenon, the stabilized discrete shear gap technique is utilized in the DSG3 system stiffness matrix formulation. The accuracy and efficiency of DSG are demonstrated by the numerical examples, and many superior properties are presented, such as being a strong competitor to the common kind of Q4 elements in the static topology optimization and its computed results are confirmed against those derived from the three-node triangular element, and other existing solutions.

A NOTE ON RADON-NIKODYM THEOREM FOR OPERATOR VALUED MEASURES AND ITS APPLICATIONS

  • Ahmed, Nasiruddin
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.2
    • /
    • pp.285-295
    • /
    • 2013
  • In this note we present sufficient conditions for the existence of Radon-Nikodym derivatives (RND) of operator valued measures with respect to scalar measures. The RND is characterized by the Bochner integral in the strong operator topology of a strongly measurable operator valued function with respect to a nonnegative finite measure. Using this result we also obtain a characterization of compact sets in the space of operator valued measures. An extension of this result is also given using the theory of Pettis integral. These results have interesting applications in the study of evolution equations on Banach spaces driven by operator valued measures as structural controls.

q-FREQUENT HYPERCYCLICITY IN AN ALGEBRA OF OPERATORS

  • Heo, Jaeseong;Kim, Eunsang;Kim, Seong Wook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.2
    • /
    • pp.443-454
    • /
    • 2017
  • We study a notion of q-frequent hypercyclicity of linear maps between the Banach algebras consisting of operators on a separable infinite dimensional Banach space. We derive a sufficient condition for a linear map to be q-frequently hypercyclic in the strong operator topology. Some properties are investigated regarding q-frequently hypercyclic subspaces as shown in [5], [6] and [7]. Finally, we study q-frequent hypercyclicity of tensor products and direct sums of operators.

INTEGRAL OPERATORS FOR OPERATOR VALUED MEASURES

  • Park, Jae-Myung
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.2
    • /
    • pp.331-336
    • /
    • 1994
  • Let $P_{0}$ be a $\delta$-ring (a ring closed with respect to the forming of countable intersections) of subsets of a nonempty set $\Omega$. Let X and Y be Banach spaces and L(X, Y) the Banach space of all bounded linear operators from X to Y. A set function m : $P_{0}$ longrightarrow L(X, Y) is called an operator valued measure countably additive in the strong operator topology if for every x $\epsilon$ X the set function E longrightarrow m(E)x is a countably additive vector measure. From now on, m will denote an operator valued measure countably additive in the strong operator topology.(omitted)

  • PDF

OPENNESS OF ANOSOV FAMILIES

  • Acevedo, Jeovanny de Jesus Muentes
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.575-591
    • /
    • 2018
  • Anosov families were introduced by A. Fisher and P. Arnoux motivated by generalizing the notion of Anosov diffeomorphism defined on a compact Riemannian manifold. Roughly, an Anosov family is a two-sided sequence of diffeomorphisms (or non-stationary dynamical system) with similar behavior to an Anosov diffeomorphisms. We show that the set consisting of Anosov families is an open subset of the set consisting of two-sided sequences of diffeomorphisms, which is equipped with the strong topology (or Whitney topology).

TYPE SPACES AND WASSERSTEIN SPACES

  • Song, Shichang
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.447-469
    • /
    • 2018
  • Types (over parameters) in the theory of atomless random variable structures correspond precisely to (conditional) distributions in probability theory. Moreover, the logic (resp. metric) topology on the type space corresponds to the topology of weak (resp. strong) convergence of distributions. In this paper, we study metrics between types. We show that type spaces under $d^{\ast}-metric$ are isometric to Wasserstein spaces. Using optimal transport theory, two formulas for the metrics between types are given. Then, we give a new proof of an integral formula for the Wasserstein distance, and generalize some results in optimal transport theory.

Energy-efficient Custom Topology Generation for Link-failure-aware Network-on-chip in Voltage-frequency Island Regime

  • Li, Chang-Lin;Yoo, Jae-Chern;Han, Tae Hee
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.6
    • /
    • pp.832-841
    • /
    • 2016
  • The voltage-frequency island (VFI) design paradigm has strong potential for achieving high energy efficiency in communication centric manycore system-on-chip (SoC) design called network-on-chip (NoC). However, because of the diminished scaling of wire-dimension and supply voltage as well as threshold voltage in modern CMOS technology, the vulnerability to link failure in VFI NoC is becoming a crucial challenge. In this paper, we propose an energy-optimized topology generation technique for VFI NoC to cope with permanent link failures. Based on the energy consumption model, we exploit the on-chip communication traffic patterns and characteristics of link failures in the early design stage to accommodate diverse applications and architectures. Experimental results using a number of multimedia application benchmarks show the effectiveness of the proposed three-step custom topology generation method in terms of energy consumption and latency without any degradation in the fault coverage metric.

Optimization of Tree-like Core Overlay in Hybrid-structured Application-layer Multicast

  • Weng, Jianguang;Zou, Xuelan;Wang, Minhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3117-3132
    • /
    • 2012
  • The tree topology in multicast systems has high transmission efficiency, low latency, but poor resilience to node failures. In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. Backbone nodes are reliable enough and have strong upload capacity as well, which is helpful to overcome the shortcomings of tree topology. The core overlay is organized into a spanning tree while the whole overlay is of mesh-like topology. This paper focuses on improving the performance of the application-layer multicast overlay by optimizing the core overlay which is periodically adjusted with the proposed optimization algorithm. Our approach is to construct the overlay tree based on the out-degree weighted reliability where the reliability of a node is weighted by its upload bandwidth (out-degree). There is no illegal solution during the evolution which ensures the evolution efficiency. Simulation results show that the proposed approach greatly enhances the reliability of the tree-like core overlay systems and achieves shorter delay simultaneously. Its reliability performance is better than the reliability-first algorithm and its delay is very close to that of the degree-first algorithm. The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay.