• 대한전자공학회논문지
• /
• 제27권11호
• /
• pp.135-143
• /
• 1990

본 논문에서는 채널의 배선 밀도 뿐만 아니라 셀 영역 내의 배선 밀도도 효과적으로 감소시키는 새로운 over-the-cell배선 시스템을 제안한다. over-the-cell 배선 시스템은, 일반적으로 셀 영역에서의 배선 과정, 채널에서 배선될 터미널의 선택 과정, 그리고 채널 배선 과정으로 구성된다. 본 논문에서는 셀 영역에서 배선할 신호선을 효율적으로 선택하기 위하여 intersection graph 상에 채널의 배선 밀도와 다른 신호선과 교차 관계를 고려한 웨이트를 부여한다. 선택된 신호선이 feedthrough나 셀 내부 로직을 형성하는 메탈층과 교차할 경우, maze 알고리듬을 사용하여 셀 영역에 배선한다. 또한 minimum weight spanning tree를 이용하여 채널에 배선할 터미널들을 효율적으로 선택하여 채널 밀도를 감소시킨다. 채널 배선은 HAN-LACADMG의 채널 배선기를 사용한다. Benchma가 데이타를 사용한 실험과 게이트 어레이 레이아웃 시스템에 적용함으로써 본 over-the-cell 배선 시스템의 효용성을 보인다.

• 한국멀티미디어학회논문지
• /
• 제17권12호
• /
• pp.1418-1429
• /
• 2014

In this paper we suggest a new two-wheelers detection algorithm using local cell features. The first, we propose new feature vector matrix extraction algorithm using the correlation two cells based on local cell histogram and shifting from the result of histogram of oriented gradients(HOG). The second, we applied new weighting values which are calculated by the modified histogram intersection showing the similarity of two cells. This paper applied the Adaboost algorithm to make a strong classification from weak classification. In this experiment, we can get the result that the detection rate of the proposed method is higher than that of the traditional method.

• 한국지하수토양환경학회:학술대회논문집
• /
• 한국지하수토양환경학회 2001년도 추계학술발표회
• /
• pp.27-30
• /
• 2001

Flow and transport at fracture intersections, and their effects on network scale transport, are investigated in three-dimensional random fracture networks. Fracture intersection mixing rules complete mixing and streamline routing are defined in terms of fluxes normal to the intersection line between two fractures. By analyzing flow statistics and particle transfer probabilities distributed along fracture intersections, it is shown that for various network structures with power law size distributions of fractures, the choice of intersection mixing rule makes comparatively little difference in the overall simulated solute migration patterns. The occurrence and effects of local flows around an intersection (local flow cells) are emphasized. Transport simulations at fracture intersections indicate that local flow circulations can arise from variability within the hydraulic head distribution along intersections, and from the internal no flow condition along fracture boundaries. These local flow cells act as an effective mechanism to enhance the nondiffusive breakthrough tailing often observed in discrete fracture networks. It is shown that such non-Fickian (anomalous) solute transport can be accounted for by considering only advective transport, in the framework of a continuous time random walk model. To clarify the effect of forest environmental changes (forest type difference and clearcut) on water storage capacity in soil and stream flow, watershed had been investigated.

• 한국정밀공학회지
• /
• 제25권3호
• /
• pp.147-156
• /
• 2008

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

• 대한전자공학회논문지
• /
• 제26권8호
• /
• pp.1270-1281
• /
• 1989

This paper presents two new storage schemes of 3-D objects to accelerate the finding of the first intersecting object and the shadow computation steps in ray tracing. The 3-D objects which are potentially intersected with the first reflection (refraction)ray are enrolled within a so called reflection (refraction) frustum' for a polygon object. Only those objects registered in the corres ponding frustum are immediately checked for intersection with the secondary rays emanating from the same polygon. The other is called a shadow pyramid' which contains the candidate objects possibly blocking the path from the relevant light source to any point on the relevant polgon. The shadow testing of a point is performed only against the objects contained in the associated shadow pyramid. Despite the cost needed for registration of objects within frusta or shadow pyramids, the total rendering time of ray tracing using the proposed approaches was reduced by approximately 50% (10% in color rendering time and 70% in shadoe testing time) from the conventional cell 50% (10% in color rendering time and 70% in shadow testing time) from the conventional cell traversal scheme under the 3-D uniform subdivision environment due to the fast finding of candidate objects for intersection and the reduced number of intersection calculations.

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

3×3의 9개 셀을 가진 격자 보드 판에서 4개 셀을 하나의 블록으로 하는 4개 합 실마리와 C개의 숫자 실마리를 가진 수지코 퍼즐은 다항시간으로 퍼즐을 풀 수 있는 방법이 알려져 있지 않은 NP-완전 문제이다. 이 퍼즐을 풀기 위해서는 (9-C)!의 가능한 모든 경우수를 대입해 보는 전수탐색 법을 적용해야 한다. 본 논문은 빈 셀들에 들어갈 수 있는 후보 숫자들을 축소시키는 방법으로 유일 숫자 셀의 실마리를 확정하였다. 유일 숫자 셀이 더 이상 존재하지 않으면 합 실마리 블록들 간의 교집합 숫자들을 선택하는 방법을 제안하였다. 제안된 알고리즘을 52개 벤치마킹 실험 데이터에 적용한 결과 모든 문제에 대해 퍼즐을 다항시간으로 풀 수 있음을 보였다.

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

3×3의 9개 셀을 가진 격자 보드 판에서 4개 셀을 하나의 블록으로 하는 4개 고정 합 실마리와 가변적 합 실마리를 가진 합 실마리 수지코 퍼즐은 다항시간으로 퍼즐을 풀 수 있는 방법이 알려져 있지 않은 NP-완전 문제이다. 이 퍼즐을 풀기 위해서는 9!의 가능한 모든 경우수를 대입해 보는 전수탐색 법을 적용해야 한다. 본 논문은 빈 셀들에 들어갈 수 있는 후보 숫자들을 축소시키는 방법으로 유일 숫자 조합 셀을 결정하였다. 유일 숫자 조합 셀이 더 이상 존재하지 않으면 FSC+VSC의 교집합 셀에 공통인 숫자를 갖는 숫자조합 망을 결정하는 방법을 제안하였다. 제안된 알고리즘을 9개 벤치마킹 실험 데이터에 적용한 결과 모든 문제에 대해 퍼즐을 다항시간으로 풀 수 있음을 보였다.

• 대한전자공학회논문지TE
• /
• 제39권2호
• /
• pp.104-109
• /
• 2002

본 논문에서는 전파경로를 구할 수 있는 모델을 제안하였다. 이 모델은 가시거리영역에서 마지막으로 이루어지는 반사위치를 입사각의 변화에 따라 다르게 구하였고. 도심지역의 다양한 형태를 고려하기 위해 도로폭과 교차각을 각각 변화시켰다. 그 결과 전파경로는 교차각이 15$^{\circ}$~75$^{\circ}$로 변화함에 따라 증가하였으며 기존모델 보다 대략 1[dB]~2[dB]정도 감쇄됨을 알 수 있었다.

• Clinical and Experimental Pediatrics
• /
• 제54권6호
• /
• pp.241-245
• /
• 2011

Tuberous sclerosis complex (TSC) is a genetic multisystem disorder that results from mutations in the TSC1 or TSC2 genes, and is associated with hamartomas in several organs, including subependymal giant cell tumors. The neurological manifestations of TSC are particularly challenging and include infantile spasms, intractable epilepsy, cognitive disabilities, and autism. The TSC1- and TSC2-encoded proteins modulate cell function via the mammalian target of rapamycin (mTOR) signaling cascade, and are key factors in the regulation of cell growth and proliferation. The mTOR pathway provides an intersection for an intricate network of protein cascades that respond to cellular nutrition, energy levels, and growth factor stimulation. In the brain, TSC1 and TSC2 have been implicated in cell body size, dendritic arborization, axonal outgrowth and targeting, neuronal migration, cortical lamination, and spine formation. The mTOR pathway represents a logical candidate for drug targeting, because mTOR regulates multiple cellular functions that may contribute to epileptogenesis, including protein synthesis, cell growth and proliferation, and synaptic plasticity. Antagonism of the mTOR pathway with rapamycin and related compounds may provide new therapeutic options for TSC patients.

• ETRI Journal
• /
• 제42권4호
• /
• pp.608-618
• /
• 2020

We present a novel GPU-based ray-casting algorithm for volume rendering of unstructured grid data. Our volume rendering system uses a ray-casting method that guarantees accurate rendering results. We also employ the per-pixel intersection list concept in the Bunyk algorithm to guarantee an accurate result for non-convex meshes. For efficient memory access for the lists on the GPU, we represent the intersection lists for all faces as an array with our novel construction algorithm. With the intersection lists, we perform ray-casting on a GPU, and a GPU thread handles each ray. To increase ray-coherency in a thread block and improve memory access efficiency, we extend a prior image-tile-based work distribution method to fit modern GPU architectures. We also show that a prior approach using a per-thread local buffer to reduce redundant computation is not appropriate for modern GPU architectures. Instead, we take an on-demand calculation strategy that achieves better performance even though it allows duplicate computations. We applied our method to three unstructured grid datasets with different characteristics. With a GPU, our method achieved up to 36.5 times higher performance for the ray-casting process and 19.7 times higher performance for the whole volume rendering process compared with the Bunyk algorithm using a CPU core. Also, our approach showed up to 8.2 times higher performance than a GPU-based cell projection method while generating more accurate rendering results. These results demonstrate the efficiency and accuracy of our method.