• Proceedings of the National Institute of Ecology of the Republic of Korea
• /
• 제2권4호
• /
• pp.274-278
• /
• 2021

Road structures play an important role in collisions involving vehicles and wildlife. Our study aimed to determine the effect of various types of road structures on the risk associated with roadkill. We surveyed 50 previously identified roadkill hotspots, ranked from one to five according to roadkill density. We collected nine types of road structure data on each hotspot road section. Structures with similar characteristics were grouped together, resulting in five categories, namely, median barrier, high edge barrier, low edge barrier, speed, and visibility. We examined the existence of each road structure category at each hotspot rank. The cumulative link model showed that the absence of bottom blocked median barrier increased the roadkill hotspot rank. Our study concluded that a visual obstacle in the middle of roads by the median barrier decreases wildlife road crossing attempts and roadkill risk. We suggest that future roadkill mitigation plans should be established considering these characteristics.

• 한국컴퓨터정보학회논문지
• /
• 제18권5호
• /
• pp.95-102
• /
• 2013

생명체 내에서 나타나는 네트워크 중 하나인 대사 경로는 화합물의 상호 관계를 그래프를 통해 표현된다. 대사 경로는 본질적인 복잡성 때문에 대사 경로 내의 흐름을 한 눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다. 이러한 가시화 도구의 경우 노드수가 증가할수록 에지 교차가 기하급수적으로 증가하는 문제가 있다. 따라서 유전체 수준의 대사 경로를 연구하기 위해서는 대사 경로 그래프 레이아웃 상에 나타나는 에지 교차를 줄이는 것이 시각화의 매우 중요한 부분이다. 본 논문은 생물학에서의 대사 경로에 대한 시각화를 위한 2-계층을 이용한 대사 경로 레이아웃 알고리즘을 제안한다. 대사 경로의 구조적 특징을 고려하여 대사 경로 그래프에 존재하는 주요 컴포넌트인 환형 컴포넌트 또는 연결성 높은 노드를 찾아 상위 계층에 레이아웃 하고 나머지 부분그래프는 하위 계층에 레이아웃 한다. 제안한 대사 경로 레이아웃 알고리즘은 유연성 있는 대사 경로 분석의 기초가 된다.

• 한국컴퓨터정보학회논문지
• /
• 제18권6호
• /
• pp.71-79
• /
• 2013

화합물의 상호 관계를 그래프를 통해 표현하는 대사 경로는 본질적인 복잡성 때문에 대사 경로 내의 흐름을 한눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다. 또한 유전체 수준의 대사 경로를 연구하기 위해서는 대사 경로 그래프 레이아웃 상에 나타나는 에지 교차를 줄이는 것이 시각화의 매우 중요한 부분이다. 본 논문은 생물학에서의 대사 경로에 대한 시각화를 위한 3-계층을 이용한 대사 경로 레이아웃 알고리즘을 제안한다. 대사경로의 구조적 특징을 고려하여 노드수가 증가하여도 에지 교차가 기하급수적으로 증가하는 문제를 해결하기 위하여 연결성 높은 노드와 환형 컴포넌트를 중앙계층에 위치시키고 나머지 부분 그래프를 상위와 하위 계층에 레이아웃 하도록 한다. 실험을 통해 에지 교차수가 줄어듦을 확인할 수 있다.

• 한국통신학회논문지
• /
• 제16권2호
• /
• pp.172-179
• /
• 1991

In this paper we have proposed an efficient coding algorithm using directional filtering. First an image is transformed by using DCT which has better energy compaction and then the transformed image is divided into a low frequency component and several high frequency components. The transformed coefficients of each parts are transmitted respectively by using huffman code and these are transformed inversely at receiver. For the directional components total edge images are reconstructed at zero crossing points. We are able to reduce the amount of data by getting of complex component and making directional angles 90. As a results, this proposed method is better than that of Kunt in respect of processing time and memories. We have 38dB of image quality with objective measurement of PSNR and 0.26bpp of compression ratio which is acceptable.

• 대한조선학회논문집
• /
• 제41권4호
• /
• pp.17-29
• /
• 2004

Internal waves are computed using a ghost fluid method on an unstructured grid. Discontinuities in density and dynamic pressure are captured in one cell without smearing or oscillations along a multimaterial interface. A time-accurate incompressible Navier-Stokes/Euler solver is developed based on a three-point backward difference formula for the physical time marching. Artificial compressibility is introduced with respect to pseudotime and an implicit method is used for the pseudotime iteration. To track evolution of an interface, a level set function is coupled with the governing equations. Roe's flux difference splitting method is used to calculate numerical fluxes of the coupled equations. To get higher order accuracy, dependent variables are reconstructed based on gradients which are calculated using Gauss theorem. For each edge crossing an interface, dynamic pressure is assigned for a ghost node to enforce the continuity of total pressure along the interface. Solitary internal waves are computed and the results are compared with other computational and experimental results.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (B)
• /
• pp.250-252
• /
• 2005

기존의 레이아웃 알고리즘은 경로의 가독성과 속도 등에 주안점을 두어 개발되었다. 따라서 이러한 시스템의 경우 노드수가 증가할수록 에지 크로싱이 기하급수적으로 증가하는 문제가 있는데, genome scale에서의 대사 경로를 연구하기 위해서는 대사 경로 그래프 레이아웃 상에 나타나는 에지 크로싱을 줄이는 것이 시각화의 매우 중요한 부분이다. 대사 경로는 효소에 의한 화합물 간의 변화를 보여주는 네트워크로서, 대부분 척도 없는 네트워크 구조를 갖는다는 것이 알려져 있다. 이러한 대사 경로의 구조적 특징을 고려하여 에지 크로싱을 최소화하는 대사 경로 레이아웃 방법을 제안하고, 그 결과 노드수의 증가에 따른 에지 크로싱의 급격한 증가현상이 $37\~40\%$의 감소된 결과를 나타냈으며, 노드수가 증가하더라도 에지 크로싱이 오히려 감소하는 경우도 관찰되었다.

• 천문학회보
• /
• 제35권1호
• /
• pp.48.1-48.1
• /
• 2010

Four of nine exoplanets found by microlensing were detected by the resonant caustic, which represents the merging of the planetary and central caustics at the position when the projected separation of a host star and a bounded planet is s~1. One of the resonant caustic lensing events, OGLE-2005-BLG-169, was a caustic-crossing high-magnification event with A_max ~800 and the source star was much smaller than the caustic, nevertheless the perturbation was not obviously apparent on the light curve of the event. In this paper, we investigate the perturbation pattern of the resonant caustic to understand why the perturbations induced by the caustic do not leave strong traces on the light curves of high-magnification events despite a small source/caustic size ratio. From this study, we find that the regions with small magnification excess around the center of the resonant caustic are rather widely formed, and the event passing the small-excess region produces a high-magnification event with a weak perturbation that is small relative to the amplification caused by the star and thus does not noticeably appear on the light curve of the event. We also find that the positive excess of the inside edge of the resonant caustic and the negative excess inside the caustic become stronger and wider as q increases, and thus the resonant caustic-crossing high-magnification events with the weak perturbation occur in the range of q $\leq$ 10-4. We determine the probability of the occurrence of events with the small excess $|\varepsilon|{\leq}3%$ in high-magnification events induced by a resonant caustic. As a result, we find that for the Earth-mass planets with a separation of ~2.5 AU the resonant caustic high-magnification events with the weak perturbation can occur with a significant frequen.

• Nuclear Engineering and Technology
• /
• 제53권11호
• /
• pp.3790-3797
• /
• 2021

Although the individual channel readout method can improve the performance of PET detectors with pixelated photo-sensors, such as silicon photomultiplier (SiPM), this method leads to a significant increase in the number of readout channels. In this study, we proposed a novel multiplexing method that could effectively reduce the number of readout channels to reduce system complexity and development cost. The proposed multiplexing circuit was designed to generate bipolar pulses with different zero-crossing points by adjusting the time constant of the high-pass filter connected to each channel of a pixelated photo-sensor. The channel position of the detected gamma-ray was identified by estimating the width between the rising edge and the zero-crossing point of the bipolar pulse. In order to evaluate the performance of the proposed multiplexing circuit, four detector blocks, each consisting of a 4 × 4 array of 3 mm × 3 mm × 20 mm LYSO and a 4 × 4 SiPM array, were constructed. The average energy resolution was 13.2 ± 1.1% for all 64 crystal pixels and each pixel position was accurately identified. A coincidence timing resolution was 580 ± 12 ps. The experimental results indicated that the novel multiplexing method proposed in this study is able to effectively reduce the number of readout channels while maintaining accurate position identification with good energy and timing performance. In addition, it could be useful for the development of PET systems consisting of a large number of pixelated detectors.

• 한국인터넷방송통신학회논문지
• /
• 제24권3호
• /
• pp.95-101
• /
• 2024

주어진 숫자 쌍 간에 빈 셀을 경유하는 선을 연결함에 있어 다른 숫자의 연결선과 교차가 발생하지 않도록 하는 숫자 연결 퍼즐은 다항시간으로 퍼즐을 풀 수 있는 방법이 알려져 있지 않은 NP-완전 문제이다. 지금까지는 임의의 숫자를 선정하여 시행착오 법으로 퍼즐을 풀고 있다. 본 논문은 주어진 문제에 대해 빈 셀을 정점으로, 인접 셀들 간에 간선으로 연결한 격자 그래프로 변환하였다. 다음으로 숫자 쌍 들 간에 직선을 긋고, 교차가 발생한 숫자 그룹으로 분할하였다. 교차 숫자 그룹에서 교차를 회피하는 우회 경로를 설정하였다. 제안된 알고리즘을 18개의 벤치마킹 데이터들에 적용한 결과 모든 데이터에 대해 퍼즐을 O(n)의 선형시간 복잡도로 풀 수 있음을 보였다.

• 한국컴퓨터그래픽스학회논문지
• /
• 제4권1호
• /
• pp.55-66
• /
• 1998

This paper presents a simple method for relieving the ambiguity problems within the sub-voxel based surface-fitting approach for the surface construction. ECB algorithm is proposed to avoid the ambiguity problem which is the root of the holes within the resulting polygon based approximation. The basic idea of our disambiguation strategy is the use of a set of predefined modeling primitives (we call SMP) which guarantees the topological consistency of resulted surface polygons. 20 SMPs are derived from the extension of the concept of the elementary modeling primitives in the CB algorithm [3], and fit one to five faces of them to the iso-surface crossing a cell with no further processing. A look-up table which has a surface triangle list is pre-calculated using these 20 SMPs. All of surface triangles in the table are from the faces of SMPs and are stored in the form of edge list on which vertices of each surface triangle are located. The resulted polygon based approximation is unique at every threshold value and its validity is guaranteed without considering the complicated problems such as average of density and postprocessing. ECB algorithm could be free from the need for the time consuming post-processing, which eliminates holes by revisiting every boundary cell. Through three experiments of surface construction from volume data, its capability of hole avoidance is showed.