• Title/Summary/Keyword: 다중분기문제

Search Result 9, Processing Time 0.032 seconds

A Multiple Branching Algorithm of Contour Triangulation by Cascading Double Branching Method (이중분기 확장을 통한 등치선 삼각화의 다중분기 알고리즘)

  • Choi, Young-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.123-134
    • /
    • 2000
  • This paper addresses a new triangulation method for constructing surface model from a set of wire-frame contours. The most important problem of contour triangulation is the branching problem, and we provide a new solution for the double branching problem, which occurs frequently in real data. The multiple branching problem is treated as a set of double branchings and an algorithm based on contour merging is developed. Our double branching algorithm is based on partitioning of root contour by Toussiant's polygon triangulation algorithml[14]. Our double branching algorithm produces quite natural surface model even if the branch contours are very complicate in shape. We treat the multiple branching problem as a problem of coarse section sampling in z-direction, and provide a new multiple branching algorithm which iteratively merge a pair of branch contours using imaginary interpolating contours. Our method is a natural and systematic solution for the general branching problem of contour triangulation. The result shows that our method works well even though there are many complicated branches in the object.

  • PDF

A Surface Reconstruction Method from Contours Based on Dividing Virtual Belt (가상벨트 분할에 기반한 등고선으로부터의 표면재구성 방법)

  • Choi, Young-Kyu;Lee, Seung-Ha
    • The KIPS Transactions:PartB
    • /
    • v.14B no.6
    • /
    • pp.413-422
    • /
    • 2007
  • This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.

Partial Offloading System of Multi-branch Structures in Fog/Edge Computing Environment (FEC 환경에서 다중 분기구조의 부분 오프로딩 시스템)

  • Lee, YonSik;Ding, Wei;Nam, KwangWoo;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.10
    • /
    • pp.1551-1558
    • /
    • 2022
  • We propose a two-tier cooperative computing system comprised of a mobile device and an edge server for partial offloading of multi-branch structures in Fog/Edge Computing environments in this paper. The proposed system includes an algorithm for splitting up application service processing by using reconstructive linearization techniques for multi-branch structures, as well as an optimal collaboration algorithm based on partial offloading between mobile device and edge server. Furthermore, we formulate computation offloading and CNN layer scheduling as latency minimization problems and simulate the effectiveness of the proposed system. As a result of the experiment, the proposed algorithm is suitable for both DAG and chain topology, adapts well to different network conditions, and provides efficient task processing strategies and processing time when compared to local or edge-only executions. Furthermore, the proposed system can be used to conduct research on the optimization of the model for the optimal execution of application services on mobile devices and the efficient distribution of edge resource workloads.

A Study on Pipelined Architecture with Branch Prediction and Two Paths Strategy (분기 예측과 이중 경로 전략을 결합한 파이프라인 구조에 관한 연구)

  • Ju, Yeong-Sang;Jo, Gyeong-San
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.181-190
    • /
    • 1996
  • Pipelined architecture improves processor performance by overlapping the execution of several different instructions. The effect of control hazard stalls the pipeline and reduces processor performance. In order to reduce the effect of control hazard caused by branch, we proposes a new approach combining both branch prediction and two paths strategy. In addition, we verify the performance improvement in a proposed approach by utilizing system performance metric CPI rather than BEP.

  • PDF

Signal Processing of Guide Sensor based on Multi-Masking and Center of Gravity Method for Automatic Guided Vehicle (다중 마스킹과 무게중심법을 기반한 AGV용 가이드 센서 신호처리)

  • Lee, Byeong-Ro;Lee, Ju-Won
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.22 no.2
    • /
    • pp.79-84
    • /
    • 2021
  • The most important device of the AGV is the guide sensor, and the typical function of this sensor is high accuracy and extraction of the road. If the accuracy of the guide sensor is low or the sensor device is extracted the wrong track, this causes the problems such as the AGV collision, track-out, the load falling due to AGV swing. In order to improve these problems, this study is proposed a signal processing method of the guide sensor based on multi-maskings and the center of gravity method, and evaluated its performance. As a result, the proposed method showed that the mean error of absolute value is 2.32[mm] and it showed performance improvement of 27[%] than the center of gravity method of existence. Therefore, when the proposed signal processing method is applied, It is thought that the posture control and driving stability of the AGV will be improved.

Algorithm for Maximum Cycle Detection of Directed and Undirected General Graphs (방향과 무 방향 일반 그래프의 최대 사이클 검출 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.91-97
    • /
    • 2022
  • There is hare and tortoise racing algorithm(HTA) for single-source(SS) singly linked list(SLL) with O(n) time complexity. But the fast method is unknown for general graph with multi-source, multi-destination, and multi-branch(MSMDMB). This paper suggests linear time cycle detection algorithm for given undirected and digraph with MSMDMB. The proposed method reduced the given graph G contained with unnecessary vertices(or nodes) to cycle into reduced graph G' with only necessary vertices(or nodes) to cycle based on the condition of cycle formation. For the reduced graph G', we can be find the cycle set C and cycle length λ using linear search within linear time. As a result of experiment data, the proposed algorithm can be obtained the cycle for whole data.

Design of Wavelength-free 1×N Optical Splitter using a Tapered Waveguide (Compact, Fiber Array-free 광패키징 구현을 위한 신개념 광소자 설계)

  • Bae, Han Uk;Shim, Young Bo;Park, Jun Tae;Lee, Chang rin;Jeong, Myung Yung
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.24 no.4
    • /
    • pp.19-22
    • /
    • 2017
  • In this study, wavelength-free $1{\times}N$ optical splitter using a tapered polymer waveguide was studied to realize the transmission network of high-speed information communication network. Based on the evaluation of mode converting characteristics of splitter having two tapered multi-mode interference structures, an optimized structure of the $1{\times}N$ splitter was proposed for wide-range of input wavelength. 2D-BPM analysis $1{\times}8$ model showed that insertion loss of the proposed splitter is less than 10 dB for wavelength of input source from 1260 nm to 1650 nm.

Discrete Optimization of Unsymmetric Composite Laminates Using Linear Aproximation Method (선형 근사화방법을 이용한 비대칭 복합 적층평판의 이산최적화)

  • 이상근;구봉근;한상훈
    • Computational Structural Engineering
    • /
    • v.10 no.2
    • /
    • pp.255-263
    • /
    • 1997
  • The optimum design of most structural systems used in practice requires considering design variables as discrete quantities. The present paper shows that the linear approximation method is very effective as a tool for the discrete optimum designs of unsymmetric composite laminates. The formulated design problem is subjected to a multiple in-plane loading condition due to shear and axial forces, bending and twisting moments, which is controlled by maximum strain criterion for each of the plys of a composite laminate. As an initial approach, the process of continuous variable optimization by FDM is required only once in operating discrete optimization. The nonlinear discrete optimization problem that has the discrete and continuous variables is transformed into the mixed integer programming problem by SLDP. In numerical examples, the discrete optimum solutions for the unsymmetric composite laminates consisted of six plys according to rotated stacking sequence were found, and then compared the results with the nonlinear branch and bound method to verify the efficiency of present method.

  • PDF

The Prediction of Currency Crises through Artificial Neural Network (인공신경망을 이용한 경제 위기 예측)

  • Lee, Hyoung Yong;Park, Jung Min
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.4
    • /
    • pp.19-43
    • /
    • 2016
  • This study examines the causes of the Asian exchange rate crisis and compares it to the European Monetary System crisis. In 1997, emerging countries in Asia experienced financial crises. Previously in 1992, currencies in the European Monetary System had undergone the same experience. This was followed by Mexico in 1994. The objective of this paper lies in the generation of useful insights from these crises. This research presents a comparison of South Korea, United Kingdom and Mexico, and then compares three different models for prediction. Previous studies of economic crisis focused largely on the manual construction of causal models using linear techniques. However, the weakness of such models stems from the prevalence of nonlinear factors in reality. This paper uses a structural equation model to analyze the causes, followed by a neural network model to circumvent the linear model's weaknesses. The models are examined in the context of predicting exchange rates In this paper, data were quarterly ones, and Consumer Price Index, Gross Domestic Product, Interest Rate, Stock Index, Current Account, Foreign Reserves were independent variables for the prediction. However, time periods of each country's data are different. Lisrel is an emerging method and as such requires a fresh approach to financial crisis prediction model design, along with the flexibility to accommodate unexpected change. This paper indicates the neural network model has the greater prediction performance in Korea, Mexico, and United Kingdom. However, in Korea, the multiple regression shows the better performance. In Mexico, the multiple regression is almost indifferent to the Lisrel. Although Lisrel doesn't show the significant performance, the refined model is expected to show the better result. The structural model in this paper should contain the psychological factor and other invisible areas in the future work. The reason of the low hit ratio is that the alternative model in this paper uses only the financial market data. Thus, we cannot consider the other important part. Korea's hit ratio is lower than that of United Kingdom. So, there must be the other construct that affects the financial market. So does Mexico. However, the United Kingdom's financial market is more influenced and explained by the financial factors than Korea and Mexico.