• Title/Summary/Keyword: Intersection point

Search Result 293, Processing Time 0.024 seconds

Plastochron indices for leaf development of glycine max (Glycine max 잎의 성장 분석을 위한 Plastochron 에 관한 연구)

  • Kim, Jong-Hee
    • The Korean Journal of Ecology
    • /
    • v.15 no.1
    • /
    • pp.1-7
    • /
    • 1992
  • The dvelopment of leaves in soybean(glycine max cv. yellow grain and glycine max cv. black grain)plant were assessed for the applicability of the plastochron index. The plastochron ages versus time in days were respectively 6.4 days in black grain and 9.6 days in yellow grain. Plots of plastochron indes(pi) versus time were linear, there were two distinct groups of regression line. when a point of intersection in the lines were upper than the reference length, pi was estimated n+(ln Ln-ln LR)/(ln Ln-ln Ln+2) or (n-1)+(ln Ln-1-ln LR)/(ln Ln-1-ln Ln+1) . When a point of intersection in the lines were less than the reference length, pl was estimated n+(ln Ln-ln LR)/(ln Ln-ln Ln+2) or (n-1)+(ln Ln-1-ln LR)/(ln Ln-1-ln Ln+1) . The growth rate of black grain plants analysed by pl was higher than yellow grain plants.

  • PDF

Efficient Storage Management Scheme for Graph Historical Retrieval (그래프 이력 데이터 접근을 위한 효과적인 저장 관리 기법)

  • Kim, Gihoon;Kim, Ina;Choi, Dojin;Kim, Minsoo;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.2
    • /
    • pp.438-449
    • /
    • 2018
  • Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.

Comparative Study of Analytical Intersection Methods for Determination of Geodetic Coordinates (대지좌표결정(大地座標決定)을 위한 해석적(解析的) 교회법(交會法)의 비교연구(比較研究))

  • Yeu, Bock Mo;Kang, In Joon;Cho, Gi Sung;Kim, Uk Nam
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.6 no.1
    • /
    • pp.51-60
    • /
    • 1986
  • With the improvement of the accuracy of EDM and theodolite, three-dimensional geodetic coordinates can be determinated by means of analytical Intersection & Resection using vector approach. In this paper the accuracy of Resection, Intersection and Multilateration, by which the geodetic coordinates of a unknown point are determinated using the geodetic coordinates, horizontal angles, vertical angles, and slope distances to a known point are analyzed. As a result, it is found that the solution of multilateration method converges into an allowable limit and the method is better than other two methods in accuracy. And it is found that if the known points are over five points, the solution of Resection and Intersection method can also converge into an allowable limit.

  • PDF

Robust GPU-based intersection algorithm for a large triangle set (GPU를 이용한 대량 삼각형 교차 알고리즘)

  • Kyung, Min-Ho;Kwak, Jong-Geun;Choi, Jung-Ju
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.3
    • /
    • pp.9-19
    • /
    • 2011
  • Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.

Operation Analysis of Downstream Intersections at Urban Freeway Off-ramps (도시고속도로 진출램프 하류부교차로 운영 분석 (중동 IC 사례 분석을 중심으로))

  • Jeon, Jae-Hyeon;Kim, Young-Chan;Jeoung, Young-Je
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.4
    • /
    • pp.7-16
    • /
    • 2008
  • Severe congestion is happening at urban freeway off-ramps in Seoul. Major causes of congestion at off-ramps are a shortage of capacity and inefficient signal operations at the downstream intersection at off-ramps. It is necessary to control congestion by improving design or operations in the downstream intersection. In this study, the authors analyzed the case of the Jungdong interchange that was improved for design in the downstream intersection. When a freeway and an arterial road cross, diamond interchanges are usually selected with a single-point urban interchange (SPUI) as an alternative. To compare the effectiveness of a diamond interchange with a SPUI, the authors applied these two configurations to the Jungdong interchange using a simulation. The result of the analysis shows that congestion at off-ramps in diamond interchanges can be reduced by improving signal operations such as the application of "4 phase with overlaps" and that diamond interchanges are more efficient than a SPUI with a frontage road. Efficient operation of the downstream intersection by these findings can minimize congestion of not only the downstream intersection but also the freeway mainline.

Suggestion of Installation Criteria on Intersection Notification Divice (교차로 알림이 설치기준 제시에 관한 연구)

  • Jin, Tae-Hee;Kwon, Sung-Dae;Oh, Seok-Jin;Ha, Tae-Jun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.39 no.1
    • /
    • pp.73-80
    • /
    • 2019
  • Traffic Safety and efficient Road Traffic Policy of Traffic management came into effect over the certain size of the road like main road. Comparatively, Safety for Living street is deteriorated. Especially, Vehicle are usually priority to the life-zone street, even though Safety for the Passengers are essential to the life-zone street in the residential area. Improvement for the Living street has not been achieved In this study, To suggest Intersection Notifications standard of installation in Living Street, We execute on-site survey in priority to Gwangju Metropolitan City. Furthermore, After We suggest experimental value for the Intersection Notifications' standard of installation Prediction model in the Living street, Intersection Notifications compare & veritfy experimental value to the installation point's value to suggest the standard of installation in the living street. As a result, We can prevent frequent traffic accident in the Living Street. Furthermore, We are judged by installation of intersection Notifications considering stability and convenience to the passengers who are using the living street.

Development of a Characteristic Point Detection Algorithm for the Calculation of Pulse Wave Velocity (맥파전달속도 계산을 위한 특징점 검출 알고리즘 개발)

  • Lee, Lark-Beom;Im, Jae-Joong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.5
    • /
    • pp.902-907
    • /
    • 2008
  • Shape of the pulse waveform is affected by the visco-elasticity characteristics of the arterial wall and the reflection waves generated at the bifurcations of arterial branches. This study was designed to improve the accuracy for the extraction of pulse wave features, then proved the superiority of the developed algorithm by clinical evaluation. Upstroke point of the pulse wave was used as an extraction feature since it is minimally affected by the waveform variation. R-peak of the ECG was used as a reference to decide the minimum level, then intersection of the least squares of regression line was used as an upstroke point. Developed algorithm was compared with the existing minimum value detection algorithm and tangent-intersection algorithm using data obtained from 102 subjects. Developed algorithm showed the least standard deviation of $0.29{\sim}0.44\;m/s$ compared with that of the existing algorithms, $0.91{\sim}3.66\;m/s$. Moreover, the rate of standard deviation of more than 1.00m/s for the PWV values reduced with the range of $29.0{\sim}42.4%$, which proved the superiority of the newly developed algorithm.

GPU-accelerated Global Illumination for Point Set Rendering (GPU 가속을 이용한 점집합 렌더링을 위한 전역 조명기법)

  • Min, Heajung;Kim, Young J.
    • Journal of the Korea Computer Graphics Society
    • /
    • v.26 no.1
    • /
    • pp.7-15
    • /
    • 2020
  • In the process of visualizing a point set representing a smooth manifold surface, global illumination techniques can be used to render a realistic scene with various effects of lighting. Thanks to the continuous demand for ray tracing and the development of graphics hardware, dedicated GPUs and programmable pipeline for ray tracing have been introduced in recent years. In this paper, real-time global illumination rendering is studied for a point-set model using ray-tracing GPUs. We apply the moving least-squares (MLS) method to approximate the point set to a smooth implicit surface and render it using global illumination by performing massive ray-intersection tests with the surface and generating shading effects at the intersection point. As a result, a complicated point-set scene consisting of more than 0.5M points can be generated in real-time.

Signal Timing and Intersection Waiting Time Calculation Model using Analytical Method for Active Tram Signal Priority (해석적 방법을 이용한 능동식 트램 우선신호의 신호시간 및 교차로 대기시간 산정 모형)

  • Jeong, Youngje;Jeong, Jun Ha;Joo, Doo Hwan;Lee, Ho Won;Heo, Nak Won
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.4
    • /
    • pp.410-420
    • /
    • 2014
  • This research suggests a new tram signal priority model which determines signal timings and tram intersection waiting time using analytical method. This model can calculate the signal timings for Early Green and Green Extension among the active tram signal priority techniques by tram detection time of upstream detector. Moreover, it can determine the tram intersection waiting time that means tram intersection travel time delay from a vantage point of tram travel. Under the active tram signal priority condition, priority phases can bring additional green time from variable green time of non-priority phases. In this study, the signal timing and tram intersection waiting time calculation model was set up using analytical methods. In case studies using an isolated intersection, this study checks tram intersection waiting time ranged 12.7 to 29.4 seconds when variable green times of non-priority phases are 44 to 10 seconds under 120 seconds of cycle length.

Numerical Simulation of the Experimental Investigation of the Two Dimensional Ram Accelerator Combustion Flow Field (이차원 램 가속기 연소 유동장의 실험적 연구의 수치 모사)

  • 최정열;정인석;윤영빈
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.1 no.1
    • /
    • pp.8-23
    • /
    • 1997
  • Steady and unsteady numerical simulations are conducted for the comparison with the experiments performed to investigate the ram accelerator flow field by using an expansion tube facility in Stanford University. Wavier-Stokes equations for chemically reacting flows are analyzed by fully implicit and time accurate numerical methods with Jachimowski's detailed chemistry model for hydrogen-air combustion involving 9 species and 19 reaction steps. Although the steady state numerical simulation shows a good agreement with the experimental schlieren and OH PLIF images for the case of $2H_2$$O_2$$17N_2$ fails in reproducing the combustion region behind the shock intersection point shown in the case of $2H_2$$O_2$$12N_2$ mixture. Therefore, an unsteady numerical simulation is conducted for this case and the result shows all the detailed flow stabilization process. From the result of unsteady numerical simulation, the experimental result seems to be an instantaneous state during the flow stabilization process. The combustion behind the shock intersection point is the result of a normal detonation formed by the intersection of strong oblique shocks that exist at early stage of the stabilization process. At final stage, the combustion region behind the shock intersection point disappears and the steady state result is retained. The time required for stabilization of the reacting flow in the model ram accelerator is found to be very long in comparison with the experimental test time.

  • PDF