• Proceedings of the Korea Concrete Institute Conference
• /
• 2009.05a
• /
• pp.579-580
• /
• 2009

This paper presents a numerical simulation of quasi-brittle fracture in UHPFRC I-beam. A linear complementarity problem (LCP) is used to formulate the path-dependent hardening-softening behavior in non-holonomic rate form, and the PATH solver is employed to solve the LCP.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1389-1390
• /
• 2015

본 논문에서는 선도-추종자 로봇의 대형을 유동적으로 변형하며 장애물을 효과적으로 회피하는 방법을 제안한다. 로봇이 장애물을 회피함에 있어서 고정된 대형으로 이동하는데 어려운 문제가 발생한다. 본 논문에서는 이러한 문제점을 해결하기위해 장애물 회피시 선도로봇의 방향각과 위치, 선도로봇과 추종자 로봇의 거리를 이용하여 대형을 유동적으로 변형하여 장애물과의 충돌을 회피하는 방법을 사용하고 로봇의 경로계획을 위하여 포텐셜 필드 알고리즘을 사용하였다. 본 논문에서는 Matlab을 이용한 모의실험을 통하여 제안된 방법의 성능을 확인하였다.

• Journal of the korean Society of Automotive Engineers
• /
• v.16 no.1
• /
• pp.31-41
• /
• 1994

1. 가공성 평가실험 및 평가기술. 1.1 가공성 평가시험법. 1.2 실험방법. 1.3 피단한계. 1.4 파단발생 평가이론. 1.5 파단평가이론의 적용. Bulk재 소성가공 공정중에 있어서 거시적 가공성평가 방법 및 응용방법에 대하여 논하였다. Bolt Heading 가공과 같은 냉간압조 가공에 있어서 상기 모델들에 의한 재료고유의 가공한계선과 변형경로를 비교하므로써 가공성을 평가할 수 있으며 또한 보다 복잡한 형상제품의 최적가공을 위한 가공조건 및 재질선정의 최적화에도 유용하게 이용될 수 있다.

• Review of KIISC
• /
• v.21 no.7
• /
• pp.23-29
• /
• 2011

2010년에 최초로 발견된 스턱스넷(Stuxent)은 2011년 한해 동안 보안업계 사이에서 많은 논란이 되었다. 이는 악성코드가 사이버 무기가 될 수 있다는 가능성을 현실로 만들었고, 기술적으로도 현존하는 악성코드의 모든 기술이 포함 될 정도로 정교하고 복잡한 것으로 평가받고 있다. 특히 2011년에는 스턱스넷의 소스코드 일부가 공개되어 스턱스넷의 두 번째 버전으로 알려진 변형 Duqu가 나타나기도 하여 변형에 따른 공격 우려도 높아지고 있다. 이번 논문에서는 과거 발생한 스턱스넷을 알아보고 유사한 사이버 공격에 대비하기 위한 대응 방안도 함께 살펴 볼 예정이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.133-135
• /
• 2002

본 논문에서는 워터플로우 마이닝을 위하여 프로세스 변형 알고리즘을 제안한다. 워크플로우 마이닝이란 워크플로우의 모니터링을 이용하여 워크플로우 시스템의 프로세스의 경향을 분석하여 또 다른 정보를 제공하는 기법을 의미한다. 이러한 워크플로우 마이닝을 구한 프로세스의 변형 알고리즘은 빌드 타임에서 정의된 워크플로우 프로세스의 흐름을 마이닝을 위한 형태로 변형하는 과정으로, 데이터의 흐름정보와 프로세스의 흐름정보를 이용하여 정의된 프로세스의 로든 경로를 트리 명태로 바꾸고, 워크플로우 실행 경고일 트리의 각 줄기를 분석하여 워크플로우 마이닝을 실현할 수 있다. 이와 같은 과정은 통하여 추출된 워크플로우 마이닝은 조지 또는 기관의 프로세서 경향을 추측하여 부가적인 정보를 제공 할 수 한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.5D
• /
• pp.649-654
• /
• 2008

In the definition of non additive path, the sum of travel costs of links making up the path is not equal to the path cost. There are a variety of cases that non-additivity assumption does not hold in transportation fields. Nonetheless, traffic equilibrium models are generally built up on the fundamental hypothesis of additivity assumption. In this case traffic equilibrium models are only applicable within restrictive conditions of the path cost being linear functions of link cost. Area-wide road pricing is known as an example of realistic transportation situations, which violates such additivity assumption. Because travel fare is charged at the moment of driver's passing by exit gate while identified at entry gate, it may not be added linearly proportional to link costs. This research proposes a novel Wordrop type of traffic equilibrium model in terms of area-wide road pricing schemes. It introduces binary indicator variable for the sake of transforming non-additive path cost to additive. Since conventional shortest path and Frank-Wolfe algorithm can be applied without route enumeration and network representation is not required, it can be recognized more generalized model compared to the pre-proposed approaches. Theoretical proofs and case studies are demonstrated.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.4
• /
• pp.89-95
• /
• 2012

Recent planning for bicycle use is relatively low compared to other studies. Although studies for the bicycle roads accessibility are actively underway, those considering topographical elements and characteristics of the user behaviors are very limited. Choosing paths of cyclists is typically influenced by slopes and intersections as well as optimal distance. This study presents a method to find optimal paths considering topographical elements in case of choosing paths for school commuting using bicycles. Conversion formulae suggested here are tested on a Songpa area using round-trip directions and compared with traditional optimal path computation.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.11
• /
• pp.809-817
• /
• 2022

The development of unmanned robots and UAVs has increased the need for path planning methods such as RRT^* algorithm. It mostly works well in various environments and is utilized in many fields. A lot of research has been conducted to obtain a better path in terms of efficiency through various modifications to the RRT^* algorithm, and the performance of the algorithm is continuously improved thanks to these efforts. In this study, a method using the limitation of sampling range is proposed as an extension of these efforts. Based on the idea that a path passing close to obstacles is similar to the optimal path in obstacle environments, nodes are produced around the obstacle. Also, rewiring algorithm is modified to quickly obtain the path. The performance of the proposed algorithm is validated by comparative analysis of the previous basic algorithm and the generated path is tracked by a UAV's kinematic model for further verification.

• Journal of the Korean Society for Railway
• /
• v.14 no.1
• /
• pp.49-56
• /
• 2011

In this paper, it was compared the characteristics of the stress and settlement that occur from a track on the ground using a model test and has quantitatively analyzed the difference based on stress path and effect of the rotation of principal stress. Under identical roadbed conditions, the settlement generated by moving wheel loads were found to be 6 times and 3 times larger than that from static loads and cyclic loads, respectively. The deviator stress affecting shear deformation and the length of stress path generated by moving loads were twofold or greater increase than those by static loads. Furthermore, the stress path generated by moving loads was approached more closely to Mohr-Coulomb failure criteria compared to that by static loads. Also, it was found that ballasted track was occurred about 60% of maximum stress at $40^{\circ}$ of the rotation angle of principal stress and was affected with rotation of principal stress with moving wheel loading condition.