• Title/Summary/Keyword: topological form

Search Result 68, Processing Time 0.027 seconds

TOPOLOGY FIELDS, TOPOLOGICAL FLOWS AND TOPOLOGICAL ORGANISMS

  • Kim, Jae-Ryong
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.1
    • /
    • pp.53-69
    • /
    • 2013
  • Topology may described a pattern of existence of elements of a given set X. The family ${\tau}(X)$ of all topologies given on a set X form a complete lattice. We will give some topologies on this lattice ${\tau}(X)$ using a topology on X and regard ${\tau}(X)$ a topological space. A topology ${\tau}$ on X can be regarded a map from X to ${\tau}(X)$ naturally. Such a map will be called topology field. Similarly we can also define pe-topology field. If X is a topological flow group with acting group T, then naturally we can get a another topological flow ${\tau}(X)$ with same acting group T. If the topological flow X is minimal, we can prove ${\tau}(X)$ is also minimal. The disjoint unions of the topological spaces can describe some topological systems (topological organisms). Here we will give a definition of topological organism. Our purpose of this study is to describe some properties concerning patterns of relationship between topology fields and topological organisms.

Mesh topological form design and geometrical configuration generation for cable-network antenna reflector structures

  • Liu, Wang;Li, Dong-Xu;Jiang, Jian-Ping
    • Structural Engineering and Mechanics
    • /
    • v.45 no.3
    • /
    • pp.411-422
    • /
    • 2013
  • A well-designed mesh shape of the cable net is of essential significance to achieve high performance of cable-network antenna reflectors. This paper is concerned with the mesh design problem for such antenna reflector structure. Two new methods for creating the topological forms of the cable net are first presented. Among those, the cyclosymmetry method is useful to generate different polygon-faceted meshes, while the topological mapping method is suitable for acquiring triangle-faceted meshes with different mesh grid densities. Then, the desired spatial paraboloidal mesh geometrical configuration in the state of static equilibrium is formed by applying a simple mesh generation approach based on the force density method. The main contribution of this study is that a general technical guide for how to create the connectivities between the nodes and members in the cable net is provided from the topological point of view. With the new idea presented in this paper, multitudes of mesh configurations with different net patterns can be sought by a certain rule rather than by empiricism, which consequently gives a valuable technical reference for the mesh design of this type of cable-network structures in the engineering.

H * H-FUZZY SETS

  • Lee, Wang-Ro;Hur, Kul
    • Honam Mathematical Journal
    • /
    • v.32 no.2
    • /
    • pp.333-362
    • /
    • 2010
  • We define H*H-fuzzy set and form a new category Set(H*H) consisting of H*H-fuzzy sets and morphisms between them. First, we study it in the sense of topological universe and obtain an exponential objects of Set(H*H). Second, we investigate some relationships among the categories Set(H*H), Set(H) and ISet(H).

A Study on the Categorization and Characterization of Light in Space (공간에서 빛의 유형분류와 특성에 관한 연구)

  • Shin, Moon-Young;Kim, Joo-Yun
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.4
    • /
    • pp.22-30
    • /
    • 2010
  • Light has primary function to enlighten the darkness. However, as development and progresses in media has caused big change in our life, the range of usage and application of light is broadened. And these days, light is actively used as a communication tool in a space. This thesis is based on an idea that a new prospect of light is required and at the same time the theoretical foundation should be established to take active advantage of light. In Chapter two, analysis criteria are established to verify study hypothesis. The applied methodology is to analysis the contents based on literature review. Key words related light in space design are extracted and the frequency of those key words are quantitatively measured. Taking advantage of the result, the characteristics of light are divided into three categories, 'light as symbolic information', 'light as communication medium' and 'light as topological form'. In chapter three, analysis of cases is performed. The cases are selected based on space analyzing criteria established in Chapter two. Qualitative analysis is performed on the cases categorized into natural light and artificial light. Basic analysis elements are evaluated for each case. And each case is allocated to one of three categories, 'light as symbolic information', 'light as communication medium' and 'light as topological form'. Through this analysis, it is found that light in space has prevailing characteristics of 'light as symbolic information' and 'light as communication medium'.

A Persistent Naming of Shells

  • Marcheix, David
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.125-137
    • /
    • 2006
  • Nowadays, many commercial CAD systems support history-based, constraint-based and feature-based modeling. Unfortunately, most systems fail during the re-evaluation phase when various kind of topological changes occur. This issue is known as "persistent naming" which refers to the problem of identifying entities in an initial parametric model and matching them in the re-evaluated model. Most works in this domain focus on the persistent naming of atomic entities such as vertices, edges or faces. But very few of them consider the persistent naming of aggregates like shells (any set of faces). We propose in this paper a complete framework for identifying and matching any kind of entities based on their underlying topology, and particularly shells. The identifying method is based on the invariant structure of each class of form features (a hierarchical structure of shells) and on its topological evolution (an historical structure of faces). The matching method compares the initial and the re-evaluated topological histories, and computes two measures of topological similarity between any couple of entities occurring in both models. The naming and matching method has been implemented and integrated in a prototype of commercial CAD Software (Topsolid).

Topological Observability Analysis Using Incidence Matrix in Power Systems (접속행열을 이용한 전력계통 입상학적 가관측성 해석)

  • Seog-Joo Kim;Young-Hyun Moon
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.36 no.11
    • /
    • pp.769-776
    • /
    • 1987
  • This paper deals with the topological observability analysis and the development of an observable island identification algorithm for state estimation in power systems, by using the incidence matrix and bus voltage grouping. An analogy of the DC power flow method to the DC circuit analysis is introduced, and all the relationships between power flows and phase angles are replaced by the corresponding current-voltage relation. As a result, a set of topological measurement equation expressed in the form of the incidince matrix is derived for the topological analysis, and the observability test is carried out by examining the rand of the measuremint matrix. The integer Gauss elimination method is introduced in the determination of matrix rand, so that the proposed observability test yields a precise observability criterion without any nearly-zero pivot problem encountered in the conventional algorithm. Also, an observable island identification algorithm reduced its computational time in comparision with the conventional algorithms. The proposed algorithms have been tested for sample systems, and their practicability has verified.

ORGANIC RELATIONSHIP BETWEEN LAWS BASED ON JUDICIAL PRECEDENTS USING TOPOLOGICAL DATA ANALYSIS

  • Kim, Seonghun;Jeong, Jaeheon
    • Korean Journal of Mathematics
    • /
    • v.29 no.4
    • /
    • pp.649-664
    • /
    • 2021
  • There have been numerous efforts to provide legal information to the general public easily. Most of the existing legal information services are based on keyword-oriented legal ontology. However, this keyword-oriented ontology construction has a sense of disparity from the relationship between the laws used together in actual cases. To solve this problem, it is necessary to study which laws are actually used together in various judicial precedents. However, this is difficult to implement with the existing methods used in computer science or law. In our study, we analyzed this by using topological data analysis, which has recently attracted attention very promisingly in the field of data analysis. In this paper, we applied the the Mapper algorithm, which is one of the topological data analysis techniques, to visualize the relationships that laws form organically in actual precedents.

GENERALIZED BI-QUASI-VARIATIONAL INEQUALITIES FOR QUASI-PSEUDO-MONOTONE TYPE III OPERATORS ON COMPACT SETS

  • Mohammad S. R. Chowdhury;Liliana Guran
    • Nonlinear Functional Analysis and Applications
    • /
    • v.29 no.3
    • /
    • pp.825-839
    • /
    • 2024
  • A new type of more general form of variational inequalities for quasi-pseudo-monotone type III and strong quasi-pseudo-monotone type III operators has been obtained on compact domains in locally convex Hausdorff topological vector spaces. These more general forms of variational inequalities for the above types of operators used the more general form of minimax inequality by Chowdhury and Tan in [3] as the main tool to derive them. Our new results established in this paper should have potential applications in nonlinear analysis and related applications, e.g., see Aubin [1], Yuan [11] and references wherein.

A Study on the Analysis of Incompressible and Looped Flow Network Using Topological Constitutive Matrix Equation (위상구성행렬식을 이용한 비압축성 순환망 형태의 유로망 해석에 관한 연구)

  • Yoo, Seong-Yeon;Kim, Bum-Shin
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.22 no.8
    • /
    • pp.573-578
    • /
    • 2010
  • Topological matrix which reflects characteristics of network connectivity has been widely used in efficient solving for complicated flow network. Using topological matrix, one can easily define continuity at each node of flow network and make algorithm to automatically generate continuity equation of matrix form. In order to analyze flow network completely it is required to satisfy energy conservation in closed loops of flow network. Fundamental cycle retrieving algorithm based on graph theory automatically constructs energy conservation equation in closed loops. However, it is often accompanied by NP-complete problem. In addition, it always needs fundamental cycle retrieving procedure for every structural change of flow network. This paper proposes alternative mathematical method to analyze flow network without fundamental cycle retrieving algorithm. Consequently, the new mathematical method is expected to reduce solving time and prevent error occurrence by means of simplifying flow network analysis procedure.

CO-CLUSTER HOMOTOPY QUEUING MODEL IN NONLINEAR ALGEBRAIC TOPOLOGICAL STRUCTURE FOR IMPROVING POISON DISTRIBUTION NETWORK COMMUNICATION

  • V. RAJESWARI;T. NITHIYA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.861-868
    • /
    • 2023
  • Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x(a,b)→ax2+bx2 = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.