• KDI Journal of Economic Policy
• /
• v.34 no.3
• /
• pp.67-94
• /
• 2012

Despite continuous efforts of the government, youth joblessness in Korea has remained as a top policy priority. At this end, the study focuses on the causes of youth labor market problems and tries to seek for policy directions. While the previous research attempted to explain youth joblessness based on the labor demand and supply, this study follows a job search model which emphasizes a job matching process. A theoretical model and empirical results predict that a mean duration of unemployment could decrease if an implicit income of unemployment declines or a rate of job offer rises. From policy point of view, it is advisable to raise incentives for labor demand and to strengthen employment services because a policy to lower an implicit income of unemployment may not secure policy target efficiency.

• School Mathematics
• /
• v.15 no.2
• /
• pp.315-335
• /
• 2013

Probability has distinctive characteristics which are different from other areas of school mathematics. The critical change can be noticed in the domain, 'probability and statistics' of 2009 revised national curriculum for elementary school mathematics. This indicates that the concept of chance is supposed to be taught in the 5~6 grade band instead of the definition of probability which is moved to the middle school level. The purpose of this study is to seek desirable methods for teaching the concept of chance which reflect the achievement criteria and the attention point for teaching and learning of the curriculum at the point of time when textbooks haven't yet been developed. To do this, based on theoretical considerations and comparative analysis of the curricula in the longitudinal - latitudinal dimensions respectively, the validity of the latest curriculum change was confirmed and several learning activities were devised. And then two lessons were planned for applying these activities to eight fifth graders and were implemented along the plan. As a result, the relevance of the learning activities was examined and students' difficulties in learning the concept of chance with educational implications were discussed.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of KIISE:Software and Applications
• /
• v.28 no.11
• /
• pp.833-841
• /
• 2001

Abstract In this work, we analyze the Levy mutation operations based on the Levy probability distribution in the evolutionary programming via the mean square displacement and the distinctness. The Levy probability distribution is characterized by an infinite second moment and has been widely studied in conjunction with the fractals. The Levy mutation operators not only generate small varied offspring, but are more likely to generate large varied offspring than the conventional mutation operators. Based on this fact, we prove mathematically, via the mean square displacement and the distinctness, that the Levy mutation operations can explore and exploit a search space more effectively. As a result, one can get better performance with the Levy mutation than the conventional Gaussian mutation for the multi-valued functional optimization problems.

• Journal of the Korean Society for Railway
• /
• v.12 no.4
• /
• pp.488-498
• /
• 2009

The characteristics of intercity rail network are different from those of public transit network in urban area. In this paper, we proposed a new transit assignment model which is generalized form of deterministic assignment model by introducing line selection probability on route section. This model consider various characteristics of intercity rail and simplify network expansion for appling search algorithms developed in road assignment model. We showed the model availability by comparing with existing models using virtual networks. The tests on a small scale network show that this model is superior to existing models for predicting intercity rail demand.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.6
• /
• pp.61-70
• /
• 2013

This paper proposes a design of SARPE(Speed and Azimuth based Routing Protocol for Emergency) system which transfers an emergency message rapidly and accurately by minimizing path disconnection with a vehicle's speed and azimuth in case of accidents. The SARPE system accomplishes the path search based on an azimuth in order to minimize unnecessary messages and workload. It also selects the paths with the lowest probability that the path disconnection will happen by using the difference between the speed(maximum, minimum) of intermediate nodes and the average speed of a source node and destination node. Therefore, this paper minimizes the path resetting work happening due to path disconnection and transfers an emergency message rapidly and accurately.

• Journal of Digital Convergence
• /
• v.13 no.2
• /
• pp.135-140
• /
• 2015

General CHMM vocabulary recognition system is model observation probability for vocabulary recognition of recognition rate's low. Used as the limiting unit is applied only to some problem in the phoneme model. Also, they have a problem that does not conform to the needs of the search range to meaning of the words in the vocabulary. Performs a phoneme recognition using GMM to improve these problems. We solve the problem according to the limited search words characterized by an improved k-means algorithm. Measure the effectiveness represented by the accuracy and reproducibility as compared to conventional system performance experiments. Performance test results accuracy is 83%p, and recall is 67%p.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.191-199
• /
• 2001

This paper presents a new genetic algorithm for job-shop scheduling problems. When we design a genetic algorithm for difficult ordering problems such as job-shop scheduling problems, it is important to design encoding/crossover that is excellent in characteristic preservation and to maintain a diversity of population. We used Job-based order crossover(JOX). Since the schedules generated by JOX are not always active-schedule, we proposed a method to transform them into active schedulesby using the GT method with c)laracteristic preservation. We introduce strategies for maintaining a diversity of the population by eliminating same individuals in the population. Furthermore, we are not used mutation. Experiments have been done on two examples: Fisher s and Thompson s $lO\timeslO and 20\times5$ benchmark problem.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.398-398
• /
• 2021

섬진강은 한국 주요 5대강 중 하나로 유량 변동계수가 가장 크다. 이로 인해, 극심한 가뭄이나 홍수의 발생 확률이 높을 뿐만 아니라, 가뭄에서 홍수 또는 홍수에서 가뭄으로 갑작스러운 극한 수문 기상 변화가 일어날 수 있다. 수자원의 안정적인 확보와 수재해로 인한 피해를 최소화하기 위한 수자원 관리와 장기적 수문분석이 필요하다. 이에 본 연구에서는 섬진강 유역의 수문 관측소(56개)에서 10년 이상 장기 관측된 일유량 자료(1997년~2020년)를 이용하여 비모수 검정 방법을 통한 추세 분석과 변동점을 탐색하였다. 우선, 일유량 관측 자료를 이용하여 누락된 일유량 관측값으로 생겨날 수 있는 불확실성을 배제하기 위해 관측 기간 중 누락된 일유량 관측값들의 월별 비율을 조사하였다. 그리고 월별 일유량 관측값 누락이 없는 관측소들의 월평균 하천 유량 값으로 연평균 하천 유량 값을 계산하였다. 관측 기간 동안 결측된 값이 없는 28개의 관측소를 대상으로 비모수 검정 방법을 통한 연별 추세 분석(Mann-Kendall Test)과 변동점 탐색(Pettitt Test)을 하였다. 연별 추세 분석 경우 28개의 관측소 중 8개의 관측소에서 통계적으로 의미 있는 추세(신뢰도> 99%)가 탐지되었다. 이들 중 3개의 관측소에서는 증가하는 추세를 보였고 5개의 관측소에서 감소하는 추세가 보였다. 7개의 관측소에서는 통계적으로 의미가 있는 변동점도 탐색되었고 그 변동점이 탐색된 연도는 2011년(4개), 2012년(3개)로 나타났다. 계절적 추세 분석에서는 28개의 관측소 중 각각 봄(MAM) 11개, 여름(JJA) 11개, 가을(SON) 9개, 겨울(DJF) 11개 관측소에서 통계적 추세(신뢰도> 99%)가 탐지되었다. 또한 봄 17개, 여름 7개, 가을 18개, 겨울 18개 관측소에서 변동점이 탐색되었고, 그 연도는 관측소마다 달랐다. 이러한 유량의 추세와 변동점의 원인(기후적/인위적 요소)을 더욱 잘 이해하기 위해, 계절별 유량과 강수량의 상관관계 분석이 연구될 필요가 있다. 이러한 장기 수문기후학적 추세와 변동성에 대한 이해는 농업이 중요한 섬진강 유역의 수자원 관리와 기후변화에 선제대응 할 수 있는 기초를 마련할 것이다.