• KDI Journal of Economic Policy
• /
• 제32권1호
• /
• pp.131-169
• /
• 2010

본고에서는 노동자들이 위험 기피적이고 차입제약을 갖는 Mortensen-Pissarides(1994) 매칭모형에 경제활동참여 의사결정을 내생화하여 실업급여 지급기간 변화가 노동시장에 미치는 영향을 분석하였다. 모형의 실업은 구직활동을 하였으나 일자리를 찾지 못한 상태로 정의하고, 비경제활동은 비구직활동으로 정의한다. 경제활동참여 의사결정을 내생화하기 위하여 개별 노동자들이 노동시장으로부터 서로 다른 정확성을 갖는 정보를 관찰하고, 이러한 정보가 개별 구직확률에 영향을 준다고 가정한다. 개별 경제주체들의 자산보유규모가 서로 다르기 때문에 구직활동을 하는 것과 하지 않는 것을 무차별하게 만드는 의중구직확률 또한 서로 다르다. 따라서 자신이 관찰한 정보의 정확성이 충분히 높아서 실제 구직확률이 자신의 의중구직확률보다 높은 사람들은 구직활동을 선택하게 된다. 이러한 모형을 바탕으로 실업급여 지급기간 3개월을 벤치마크로 하여 지급기간을 각각 4개월부터 6개월까지 연장할 때 전체 노동시장 및 경제활동상태 간 노동자들의 이동비율에 미치는 효과는 다음과 같다. 첫째, 실업급여 지급기간의 연장은 취업자들의 근속기간을 늘리는데, 근속기간이 늘어나면 취업자들의 예비적 동기에 의한 저축이 늘어나고, 저축에 따른 자산보유규모의 증가는 노동의 한계비용을 증가시켜 노동시장에서 이탈할 유인을 제공한다. 따라서 경제활동참가율을 떨어뜨린다. 둘째, 실업급여 지급기간이 늘어날 때 실업급여 수급자격을 갖춘 경제주체들의 의중구직확률은 떨어지고 실업상태에 남을 확률은 높아져 실업자 수가 증가한다. 따라서 실업률이 상승한다. 셋째, 실업자 수의 증가는 균형 공석-실업비율을 감소시켜 경제 전체의 구직확률을 낮추게 되며, 이는 차례로 비경제활동상태에 있는 사람들의 경제활동참여를 저해하는 효과를 야기한다. 이러한 결과는 비경제활동을 고려하지 않았을 때에는 나타나지 않는 현상이다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• Journal of Korean Neurosurgical Society
• /
• 제51권5호
• /
• pp.316-319
• /
• 2012

A 24-year-old man presented with mental change, fever, abdominal pain, tenderness and palpable mass on the lower abdomen. He was a non-Korean engineer and did not accompany a legal guardian, so medical history taking was difficult due to his mental status. Brain magnetic resonance imaging showed multiple rim-enhanced lesions of the brain, and abdominal computed tomography showed huge paraspinal abscess. Chest X-ray and computed tomography showed poorly defined nodular opacities. We initially thought that this patient was infected with toxoplasmosis with typical cerebral image finding and immunoglobulin laboratory finding of cerebrospinal fluid and serum study. The abdominal abscess was confirmed as tuberculosis through the pathologic finding of caseous necrosis. We used anti-tuberculosis medication and anti-toxoplasmosis medication for almost 4 months, and then his clinical state and radiological findings were considerably improved.

• International journal of advanced smart convergence
• /
• 제2권2호
• /
• pp.23-26
• /
• 2013

Social networking services that connect a person to other people are attracting people's attention and various types of services are provided on the Internet. Library has been playing a role of social media by providing us with materials such as books and magazines, and with a place for reading, studying, getting lectures, etc. In this paper, we present a method for finding candidates of groups of the library's patrons who share interest areas by utilizing the loan records, which are obtainable in every library. Such a homogeneous group can become a candidate for a study group, a community for exchange ideas, and other activity group. We apply the method to a collection of loan records of a university library, find some problems to be solved, and propose measures for more detailed solutions. Even though the potential group finding problem still remains a lot of issues to be solved, its potential importance is very high and thus to be studies even more for future applications.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1367-1370
• /
• 1997

This paper presents a vision algorithm for finding the centers of steam generator tubes using the generalized symmetry transform, which is used for ECT(Eddy Current Test) of steam generator tubes in nuclear power plants. The geometrical properties of the image representing steam generator tubes shows that they have amost circular or somewhat elliptic appearances and each tube has strong symmetry about its center. So we apply the generalized symmetry transform to finding centers of steam geneator tubes. But applying the generalized symmetry transform itself without any modification gives difficulties in obtaining the exact centers of steam generator tubes. But applying the generalized symmetry transform itself without any modification gives difficulties in obtaining the exact centers of tubes due to the shadow effect generated by the local light installed inside steam generator. Therefore we make the generalized symmetry transform modified, which uses a modified phase weight function in getting the symmetry magnitude in order to overcome the misleading effect by the local light. The experimental results indicate that the proposed vision algorithm efficiently recongnizes centers of steam generator tubes.

• East Asian mathematical journal
• /
• 제27권1호
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2015년도 추계 학술논문 발표대회
• /
• pp.170-171
• /
• 2015

Resource procurement and material handling are considered as a significant part of construction project especially in large or tall building construction site. There are multiple variables that must be considered in a construction site during finishing work such as movement of materials, equipments, and workers. Therefore, it is difficult for construction workers to find the material handling path solely by intuition. The aim of this study is to propose a real-time path finding model suitable for complicated logistics flow in the field. The model explores the optimal transport path of finishing material with its basis on optimization algorithm, and it determines the direction of the Smart Sign. The proposed model is expected to be utilized for planning of efficient finishing material handling.

• East Asian mathematical journal
• /
• 제33권2호
• /
• pp.149-175
• /
• 2017

The effort to find the volume of pyramids has been done by mathematicians for a long time, and many trial-and-error calculations and proofs give various perspectives and educational material. In the early days, finding the volume of pyramids was mainly studied by calculating the volume of triangular pyramids or quadrangular pyramids by cutting and the relationship between pyramids. Thereafter, methods based on infinite, infinitesimal, limit, etc. appeared, but the research topic was still about them. The purpose of this study is to examine the four themes appearing the mathematics history in terms of methodology, and to think about its implications from the viewpoint of improving the professionalism of the teachers.

• 한국컴퓨터정보학회논문지
• /
• 제9권3호
• /
• pp.71-77
• /
• 2004

게임을 하다보면 유닛들이 목표를 찾아 가야하는데 알고리즘에 따라 시간과 거리가 많이 차이 나게 된다. 본 논문에서는 깊이 우선 탐색과 너비 우선 탐색 그리고 거리 값을 주어 개선된 알고리즘과 A* 알고리즘의 각각을 비교하며 특징들을 기술하고 알고리즘을 논하였다. 또한 A* 알고리즘에서 실제로 추정값을 구하여 가장 개선된 값을 찾는다. 마지막으로 A* 알고리즘과 다른 알고리즘의 비교를 통하여 A* 알고리즘을 우수성을 입증하고 A* 알고리즘을 이용한 간단한 길찾기를 제안하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.447-449
• /
• 2004

We proposed the method of the production of the humanoid biped robot and apply the A* path finding algorithm, for that robot mainly used in game and mobile robot, to avoid obstacles at real time. Actually we made the robot which has 20 DOF, 12 DOF in the two legs, 6 DOF in the two arms and each 1 DOF in the neck and waist, to realize human motions with minimal DOF, And we use the CATIA V5 for 3D modeling design and simulate.