• Title/Summary/Keyword: Object Topology

Search Result 65, Processing Time 0.033 seconds

Design Object Model for Implementation of Integrated Structural Design System for Building Structures (건물 구조 통합 구조설계 시스템의 구현을 위한 설계 객체 모델)

  • 천진호;박연수;이병해
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.13 no.1
    • /
    • pp.115-127
    • /
    • 2000
  • The purpose of this study is to propose the Design Object Model for implementation of an integrated structural design system for building structures. This study outlines the step-by-step development methodologies of the Design Object Model, which covers classification and modeling of the building design information. The Design Object Model has been efficiently developed through the proposed development methodologies. As a result, the Design Object Model has been proved to be efficient in design information management by representing the information from planning perspective, in recognition of structural member in space by the topology design object, and in representation of analysis s design information.

  • PDF

Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects (복수객체의 윤곽추출을 위한 스네이크 분리 및 연결 알고리즘의 실험적 분석)

  • Cui, Guo;Hwang, Jae-Yong;Jang, Jong-Whan
    • The KIPS Transactions:PartB
    • /
    • v.19B no.4
    • /
    • pp.221-224
    • /
    • 2012
  • The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can't split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.

The Development of An Object-Oriented Graphic Database Management System in Geographic Information Systems (토지정보체계의 객체지향 도형정보데이타베이스 개발)

  • Hwang, Kook-Woong;Lee, Kyoo-Seock
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.4 no.1 s.6
    • /
    • pp.23-29
    • /
    • 1996
  • The purpose of this study is to develope an Object-Oriented Graphic database management system to handle geographic data of geographic information systems. As the result of this study, unstructured vector model was developed to handle geographic data and graphic database management was implemented by object-oriented programming. This study was focused on liking function between graphic data and attribute data, and not focused on network analysis function.

  • PDF

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2473-2489
    • /
    • 2022
  • Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

On teaching the concept of continuous functions in calculus

  • Pak, Hong-Kyung;Kim, Tae-Wan
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.4
    • /
    • pp.859-868
    • /
    • 2007
  • The present paper deals with the ordering problem for how to teach mathematical concepts successfully. Main object is the concept of continuous functions which is fundamental in analysis and topology. At first, the theoretical organization of this concept is investigated through several texts in related field, calculus, analysis and topology. And next, the historical order for this concept from the viewpoint of problem-solving is considered. Based on these two materials, we suggest a lecturing organization order in order to establish a balanced unification of three concepts - intuitive, logical and formal concepts.

  • PDF

Topology Optimization of Muffler Hole of Rotary Compressor using GA (유전자 알고리즘을 이용한 회전식 압축기 머플러 토출구의 위상 최적설계)

  • ;Altay Dikec
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.790-795
    • /
    • 2002
  • The object of this research is limited to the reduction of compression process noise only among the main sources of compressor noise such as motor noise, compression process noise, and valve port flow noise. Thus the research is focused on the wave motion rather than the particle motion of sound wave travels. A muffler is a commonly used device to reduce the compression process noise, generated by the pressure pulsations caused by the cyclic compression process. In this research, the acoustic characteristics of the muffler are analyzed by using the normal gradient integral equation proposed by Wu and Wan. Moreover, a commercial code SYSNOISE developed by indirect variational boundary integral equation is also used to validate the results. For the noise reduction, the topology optimization technique using a genetic algorithm is used. The number, size and position of the muffler holes are considered as design variables. Compared with original design, the optimized design has very improved acoustic characteristics. Both numerical and experimental analyses are used to evaluate new design.

  • PDF

GROUPOID AS A COVERING SPACE

  • Park, Jong-Suh;Lee, Keon-Hee
    • Bulletin of the Korean Mathematical Society
    • /
    • v.21 no.2
    • /
    • pp.67-75
    • /
    • 1984
  • Let X be a topological space. We consider a groupoid G over X and the quotient groupoid G/N for any normal subgroupoid N of G. The concept of groupoid (topological groupoid) is a natural generalization of the group(topological group). An useful example of a groupoid over X is the foundamental groupoid .pi.X whose object group at x.mem.X is the fundamental group .pi.(X, x). It is known [5] that if X is locally simply connected, then the topology of X determines a topology on .pi.X so that is becomes a topological groupoid over X, and a covering space of the product space X*X. In this paper the concept of the locally simple connectivity of a topological space X is applied to the groupoid G over X. That concept is defined as a term '1-connected local subgroupoid' of G. Using this concept we topologize the groupoid G so that it becomes a topological groupoid over X. With this topology the connected groupoid G is a covering space of the product space X*X. Further-more, if ob(.overbar.G)=.overbar.X is a covering space of X, then the groupoid .overbar.G is also a covering space of the groupoid G. Since the fundamental groupoid .pi.X of X satisfying a certain condition has an 1-connected local subgroupoid, .pi.X can always be topologized. In this case the topology on .pi.X is the same as that of [5]. In section 4 the results on the groupoid G are generalized to the quotient groupoid G/N. For any topological groupoid G over X and normal subgroupoid N of G, the abstract quotient groupoid G/N can be given the identification topology, but with this topology G/N need not be a topological groupoid over X [4]. However the induced topology (H) on G makes G/N (with the identification topology) a topological groupoid over X. A final section is related to the covering morphism. Let G$_{1}$ and G$_{2}$ be groupoids over the sets X$_{1}$ and X$_{2}$, respectively, and .phi.:G$_{1}$.rarw.G$_{2}$ be a covering spimorphism. If X$_{2}$ is a topological space and G$_{2}$ has an 1-connected local subgroupoid, then we can topologize X$_{1}$ so that ob(.phi.):X$_{1}$.rarw.X$_{2}$ is a covering map and .phi.: G$_{1}$.rarw.G$_{2}$ is a topological covering morphism.

  • PDF

Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks

  • Shin, Min-Ho;Arbaugh, William A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.1
    • /
    • pp.5-25
    • /
    • 2009
  • In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

Series-resonant High efficiency Induction Heating System following Resonant Frequency (공진주파수 추종 직렬공진형 고효율 유도.가열장치에 관한 연구)

  • 성병기;박성준;김광태;김철우
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.13 no.3
    • /
    • pp.124-128
    • /
    • 1999
  • The object of the present study is to obtain a 20[kHz], 10[kW] rating, high efficiency induction heating system by high frequency serises-resonant inverter. Proposed is a topology that minimize a reactive power, by which direct iOIrt voltage is variable corresponding to the variation of the load, heated-object, and by which the switching of inverter is forced to follow a resonant frequency. And assured that the power foctor of the inverter in a induction heating system is proper about O.96 through the simulation and results.esults.

  • PDF

Spatial relationship operations of the Satellite image for the Remote sensing based on an Object oriented data model (객체지향 데이터 모델에 기반 원격탐사를 위한 위성영상의 공간 관계 연산)

  • Shin, Un-Sseok;Lee, Jae-Bong;Kim, Hyung-Moo;Lee, Hong-Ro
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2004.11a
    • /
    • pp.251-256
    • /
    • 2004
  • This paper will show examples and methods of spatial relationship operations that extract spatial information from satellite images. Geographical information system phenomena of complex and variant real world can abstract and implement simple features. The abstract features classify geo_objects and geo_field. The geo_object and the geo_field can represent vector and raster respectively. The raster based satellite image can use remote sensing applications. This paper needs topology operations and geometric operations for extracting the remote sensing. The spatial information transforms the raster based image to the vector based object, and extract from the spatial information. The extracted information will contribute on the application of the remote sensing satellite images.

  • PDF