• Journal of Agricultural Extension & Community Development
• /
• v.7 no.1
• /
• pp.137-153
• /
• 2000

The purpose of this study was to develop long and short-run educational programs for u-turn farmers based on their need assesment. This study was conducted by review of literature and surveys. Subjects of this surveys were 310 participants of agricultural training programs developed by the Rural Development Administration for u-turn farmers in 1997 and 1998. According to major findings, many participants were faced with problems such as financial shortage, deficiency of farming skills, difficulty of marketing, new neighbours unfavourable gazing and farm labour shortage. These problems could be classified into the problems at their preparing stage and the problems of adjusting stage in their farms. And also the participants suggested that educational programs for them contain knowledge based teaching and technical practices with focus on their problems solving. With their suggestion various knowledge and technical modules were selected. Using these module several kinds of long and short-run educational programs could be developed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.10
• /
• pp.948-956
• /
• 2014

Today, Intelligent Vehicle Detection System seeks to reduce the negative factors, such as accidents over to get the traffic information of existing system. This paper proposes detection algorithm for the illegal U-turn vehicles which can cause critical accident among violations of road traffic laws. We predicted that if calculated optical flow vectors were shown on the illegal U-turn path, they would be cause of the illegal U-turn vehicles. To reduce the high computational complexity, we use the algorithm of pyramid Lucas-Kanade. This algorithm only track the key-points likely corners. Because of the high computational complexity, we detect center lane first through the color information and progressive probabilistic hough transform and apply to the around of center lane. And then we select vectors on illegal U-turn path and calculate reliability to check whether vectors is cause of the illegal U-turn vehicles or not. Finally, In order to evaluate the algorithm, we calculate process time of the type of algorithm and prove that proposed algorithm is efficiently.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.13-21
• /
• 2015

This study focuses on operational analysis of 2 types of intersection shared lanes. First, the analysis showed that a through & right-turn shared lane is always less used than the adjacent through-only lanes and as a result, operational efficiency deteriorates. To improve the efficiency fine-tuning in signal timing optimization using lane-by-lane traffic volume data is required. Further improvement can be achieved by guiding drivers to equally use the shared lane. For left-turn & U-turn shared lanes, it was found that saturation flow rate is affected by interference between U-turn and conflicting right-turn movements. However, since such interference does not occur in every cycle, a statistical model must be established to develop realistic adjustment factor for saturation flow rate of the shared lane.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.323-326
• /
• 2007

When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

• 한국신재생에너지학회:학술대회논문집
• /
• 2009.06a
• /
• pp.476-479
• /
• 2009

Unison의 U50 풍력발전기는 실증실험을 거쳐서 상용화 되어 시장에 제품으로 나와 있다. U50에 사용되는 영구자석 동기발전기는 Stator 내경 3.32 m 로 84극을 가지고 있으며 정격 25 rpm으로 운전되는 직접구동형이다. 직접구동형 발전기는 Gearbox 가 불필요한 반면에 높은 torque로 인해서 발전기가 무거운 단점이 있다. 기존의 U50 에 사용되는 발전기는 지지 구조물까지 포함할 경우 총중량이 약 20톤 이상이다. 발전기의 중량을 줄이고 경량화 시키기 위하여 slot에 들어가는 Ampere turn을 증가시키고 turn 수를 증가시켜서 기존과 유사한 전압, 전류, 출력을 유지하면서 축방향 Stator 길이를 감소시킨 최적화 모델에 대한 설계에 대하셔 연구를 진행하였으며 이 보고에서는 그 결과와 절차에 대해서 요약한다.

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.89-99
• /
• 2003

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

• 대한족부족관절학회:학술대회논문집
• /
• 2008.11a
• /
• pp.27-27
• /
• 2008

• IE interfaces
• /
• v.14 no.4
• /
• pp.374-384
• /
• 2001

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop a genetic algorithm(GA) for finding the multiple shortest paths in real traffic network. The proposed GA finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn that are genetically evolved until an acceptable solution is reached. This paper also shows the procedure to find the multiple shortest paths in traffic network of Seoul.

• Journal of Korean Society of Transportation
• /
• v.17 no.3
• /
• pp.73-85
• /
• 1999

In metropolitan area, intersections having turn Prohibitions are often found and it is important to consider them in path planning. This Paper presents a new path planning method road networks having turn prohibitions. A new road network model is proposed in which an alter-native route for each turn-Prohibition is constructed in off-line using U-turn or P-turn and then Put into road network database. The proposed network model is efficient since it requires no virtual nodes that are usually used in the conventional road networks to represent turns at intersections. In order to find a shortest path with the proposed network, a new shortest path algorithm is proposed. A knot for the turn-Prohibited node is newly defined and is used in comparing the cost of the alternative route with that of the other path.

• Proceedings of the KOR-KST Conference
• /
• 2007.11a
• /
• pp.447-456
• /
• 2007