• Title/Summary/Keyword: mesh-topology

Search Result 173, Processing Time 0.019 seconds

Finite Element Analysis of Two-Dimensional Cold Forging By Using Modular Remeshing and Expert System (단위체 격자 재구성법과 전문가 시스템을 이용한 2차원 냉간 단조의 유한 요소 해석)

  • Yun, Hui-Do;Kim, Yeong-Tae;Lee, Nak-Gyu;Yang, Dong-Yeol;Lee, Byeong-Chae
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.9 no.3
    • /
    • pp.83-101
    • /
    • 1992
  • A systematic method of remeshing is required due to severe mesh distortion after some finite deformation in the finite element analysis of practical forging processes. In order to cope with the problem of mesh degeneracy during deformation, the proper design of meshes plays an improtant role in the analysis. In so-called "Modular Remeshing", the physical characteristics of metal flow and geometric characteristics are incorporated in "Module", which can be applied to the mesh design for a certain mode of deformation in so far as the topology of deforming region remains the same. For the purpose of more effective and systematic use of the modular remeshing scheme, an expert system has been developed in the framework of the proposed remeshing schemel. In oredr to show the effectiveness of the method, the rib-web type forging with axial relief or radial relief and spike forging are simulated. It has been thus shown that the proposed method of automatic remeshing by using modular remeshing and expert system can be futher extended and applied to various forging problems with complicated geometrical configurations.ical configurations.

  • PDF

CANCAR - Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

  • Pertovt, Erik;Alic, Kemal;Svigelj, Ales;Mohorcic, Mihael
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4205-4227
    • /
    • 2018
  • Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

Geometric Implicit Function Modeling and Analysis Using R-functions (R-function을 이용한 형상의 음함수 모델링 및 해석)

  • Shin, Heon-Ju;Sheen, Dong-Woo;Kim, Tae-Wan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.3
    • /
    • pp.220-232
    • /
    • 2007
  • Current geometric modeling and analysis are commonly based on B-Rep modeling and a finite elements method respectively. Furthermore, it is difficult to represent an object whose material property is heterogeneous using the B-Rep method because the B-Rep is basically used for homogeneous models. In addition, meshes are required to analyze a property of a model when the finite elements method is applied. However, the process of generating meshes from B-Rep is cumbersome and sometimes difficult especially when the model is deformed as time goes by because the topology of deforming meshes are changed. To overcome those problems in modeling and analysis including homogeneous and heterogeneous materials, we suggest a unified modeling and analysis method based on implicit representation of the model using R-function which is suggested by Rvachev. For implicit modeling of an object a distance field is approximated and blended for a complex object. Using the implicit function mesh-free analysis is possible where meshes are not necessary. Generally mesh-free analysis requires heavy computational cost compared to a finite elements method. To improve the computing time of function evaluation, we utilize GPU programming. Finally, we give an example of a simple pipe design problem and show modeling and analysis process using our unified modeling and analysis method.

Segmentation of LiDAR Point Data Using Contour Tree (Contour Tree를 이용한 LiDAR Point 데이터의 분할)

  • Han Dong-Yeob;Kim Yong-Il
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2006.04a
    • /
    • pp.463-467
    • /
    • 2006
  • Several segmentation algorithms have been proposed for DTM generation or building modeling from airborne LiDAR data. Three components are important for accurate segmentation: (i) the adjacent relationship of n-nearest points or mesh, etc. (ii) the effective decision parameters of height, slope, curvature, and plane condition, (iii) grouping methods. In this paper, we created the topology of point cloud data using the contour tree and implemented the region-growing Terrain and non-terrain points were classified correctly in the segmented data, which can be used also for feature classification.

  • PDF

A Study on Task Duplication Scheduling on 2D-Mesh Topology (2차원 매쉬 구조에서 타스크 중복 스케줄링 연구)

  • 전태건;정경훈;김창수
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 1998.04a
    • /
    • pp.371-375
    • /
    • 1998
  • 타스크 그래프로 표현되는 병렬 타스크의 수행시간을 단축시키기 위한 타스크 중복 알고리즘의 많은 연구들은 완전연결, 비제한 처리기 상에서 연구되었다. 본 연구에서는 2차원 매쉬구조를 가지는 처리기 상에서의 처리기간 통신 흡수를 고려한 효율적인 타스크 중복 알고리즘을 제안하고자 한다. 또한 기존의 타스크 중복 알고리즘과 비교를 위해 평균 수행시간과 평균 처리기 사용 수에 대해서 시뮬레이션하였다.

  • PDF

TCP Fairness Improvement Scheme using Adaptive Contention Window in Wireless Mesh Networks (무선 메쉬 네트워크에서 적응적 경쟁 윈도우를 이용한 TCP Fairness 개선 방안)

  • Jang, In Sik;Min, Seok Hong;Kim, Bong Gyu;Choi, Hyung Suk;Lee, Jong Sung;Kim, Byung Chul;Lee, Jae Yong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.16 no.3
    • /
    • pp.322-331
    • /
    • 2013
  • Wireless Mesh Networks(WMNs) is generally composed of radio nodes in the mesh topology. WMNs consists of mesh client, mesh router and gateway connected to a wired network. Each client and router relay messages to the gateway for communication. WMNs is widely used recently in many areas can provide extended coverage based on multi-hop communication and ubiquitous communication at any time and any location. However the competition and collision between each node to transmit data is inevitable when the same channel is used for transmission. The transmission opportunities and the throughput of nodes located far from gateway decrease more if the communication channel is accessed based on competitive CSMA/CA scheme using DCF(Distributed Coordination Function) provided by IEEE 802.11 MAC. In this paper, we improve the performance of the TCP fairness and throughput of the nodes with more than 2 hops by applying various algorithms for controlling contention window values. Also, we evaluate the performance using ns-2 simulator, According to the results, proposed scheme can enhance the fairness characteristic of each node irrespective of data to the gateway.

Design of an Image Processing ASIC Architecture using Parallel Approach with Zero or Little (통신부담을 감소시킨 영상처리를 위한 병렬처리 방식 ASIC구조 설계)

  • 안병덕;정지원;선우명훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.10
    • /
    • pp.2043-2052
    • /
    • 1994
  • This paper proposes a new parallel ASIC architecture for real-time image processing to reduce inter-processing element (inter-PE) communication overhead, called a Sliding Memory Plane (SliM) Image Processor. The Slim Image Processor consists of $3\times3$ processing elements (PEs) connected by a mesh topology. With easy scalability due to the topology. a set of SliM Image Processors can form a mesh-connected SIMD parallel architecture. called the SliM Array Processor. The idea of sliding means that all pixels are slided into all neighboring PEs without interrupting PEs and without a coprocessor or a DMA controller. Since the inter-PE communication and computation occur simultaneously. the inter-PE communication overhead, significant disadvantage of existing machines greatly diminishes. Two I/O planes provide a buffering capability and reduce the date I/O overhead. In addition, using the by-passing path provides eight-way connectivity even with four links. with these salient features. SliM shows a significant performance improvement. This paper presents architectures of a PE and the SliM Image Processor, and describes the design of an instruction set.

  • PDF

The Design of Knockout Switch Structure For Improving Performance of Inter- Processor Communication in Mobile Communication System. (이동통신시스템의 프로세서간 통신성능향상을 위한 넉아웃 스위치의 구조설계)

  • Park, Sang-Gyu;Kim, Jae-Hong;Lee, Sang-Jo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1868-1879
    • /
    • 1996
  • There are limitations to process high bandwidth traffic in B-ISDN with mesh- topology single bus architecture of current mobile communication system. And, it is impossible to import ATM switch using fixed length packet rather than variable length packet. Some implementations are able to process variable length packet, but there are some problems such as pre-processing for synchronization and bit delay. In this paper, we design a concentrator that can manipulate variable length packet without additional pre-process. There is on bit delay for packet starting signal in input interface, So it is more efficient to process packets, such that the concentrator can reduce he processing time as $\ulcornerlog2N\lrcorne+1$ bit-time rather than N bit-time delay in ordinary concentrator. It is expected that the mobile communication system with partial mesh topology bus adopting the knockout switch architecture can process high bandwidth traffic in B-ISDN.

  • PDF

Design of a Dynamically Reconfigurable Switch for Hybrid Network-on-Chip Systems (Hybrid Noc 시스템을 위한 재구성 가능한 스위치 설계)

  • Lee, Dong-Yeol;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8B
    • /
    • pp.812-821
    • /
    • 2009
  • This paper proposes a novel dynamically reconfigurable switch for various multimedia applications in hybrid NoC systems. Current NoC systems, which adopt hybrid NoC structure with fixed switch and job distribution algorithms, require designers to precisely predict the property of applications to be processed. This paper proposes a reconfigurable switch which minimizes buffer overflow in various multimedia applications running on an NoC system. To verify the performance of the proposed system, we performed experiments on various multimedia applications running on embedded systems, such as MPEG4 and MP3 decoder, GPS positioning system, and OFDM demodulator. Experimental results show that buffer overflow has been decreased by 41.8% and 29.0%, respectively, when compared with NoC systems having sub-clusters with mesh or star topology. Power usage has been increased by 2.3% compared with hybrid NoC systems using fixed switches, and chip area has been increased from -0.6% to 5.7% depending on sub-cluster topology.

The File Splitting Distribution Scheme Using the P2P Networks with The Mesh topology (그물망 위상의 P2P 네트워크를 활용한 파일 분리 분산 방안)

  • Lee Myoung-Hoon;Park Jung-Su;Kim Jin-Hong;Jo In-June
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1669-1675
    • /
    • 2005
  • Recently, the small sized wireless terminals have problems of processing of large sized file because of the trends of a small sized terminals and a large sized files. Moreover, the web servers or the file servers have problems of the overload because of the concentration with many number of files to the them. Also, There is a security vulnerability of the data processing caused by the processing with a unit of the independent file. To resolve the problems, this paper proposes a new scheme of fat splining distribution using the P2P networks with the mesh topology. The proposed scheme is to distribute blocks of file into any peer of P2P networks. It can do that the small sized wireless terminals can process the large size file, the overload problems of a web or file servers can solve because of the decentralized files, and, the security vulnerability of the data processing is mitigated because of the distributed processing with a unit of the blocks to the peers.