• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• 산업경영시스템학회지
• /
• 제46권2호
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권10호
• /
• pp.3423-3438
• /
• 2014

In recent years, wearable sensor devices are reshaping the way people live, work, and play. A wearable sensor device is a computer that is subsumed into the personal space of the user, and is always on, and always accessible. Therefore, among the most salient aspects of a wearable sensor device should be a small form factor, long battery lifetime, and real-time characteristics. Thereby, sophisticated applications of a wearable sensor device use real-time operating systems to guarantee real-time deadlines. The deterministic multi-dimensional task scheduling algorithms are implemented on ARC (Actual Remote Control) with relatively limited hardware resources. ARC is a wearable wristwatch-type remote controller; it can also serve as a universal remote control, for various wearable sensor devices. In the proposed algorithms, there is no limit on the maximum number of task priorities, and the memory requirement can be dramatically reduced. Furthermore, regardless of the number of tasks, the complexity of the time and space of the proposed algorithms is O(1). A valuable contribution of this work is to guarantee real-time deadlines for wearable sensor devices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5449-5464
• /
• 2018

Recent works have validated the possibility of reducing the energy consumption in wireless heterogeneous networks, achieved by switching on/off some base stations (BSs) dynamically. In this paper, to realize energy conservation, the discrete time Markov Decision Process (DTMDP) is developed to match up the BS switching operations with the traffic load variations. Then, an asynchronous decision-making algorithm, which is based on the Bellman equation and the on/off priorities of the BSs, is firstly put forward and proved to be optimal in this paper. Through reducing the state and action space during one decision, the proposed asynchronous algorithm can avoid the "curse of dimensionality" occurred in DTMDP frequently. Finally, numerical simulations are conducted to validate the effectiveness and advantages of the proposed asynchronous on/off strategies.

• 한국정밀공학회지
• /
• 제15권6호
• /
• pp.107-115
• /
• 1998

A path planning using potential field method is very useful for the real-time navigation of mobile robots. However, the method needs high modeling cost to calculate the potential field because of complex preprocessing, and mobile robots may get stuck into local minima. In this paper, An efficient path planning algorithm for multiple mobile robots, based on the potential field method, was proposed. In the algorithm. the concepts of subgoals and obstacle priority were introduced. The subgoals can be used to escape local minima, or to design and change the paths of mobile robots in the work space. In obstacle priority, all the objects (obstacles and mobile robots) in the work space have their own priorities, and the object having lower priority should avoid the objects having higher priority than it has. In this paper, first, potential based path planning method was introduced, next an efficient collision-avoidance algorithm for multiple mobile robots, moving in the obstacle environment, was proposed by using subgoals and obstacle priority. Finally, the developed algorithm was demonstrated graphically to show the usefulness of the algorithm.

• 한국정보처리학회논문지
• /
• 제4권4호
• /
• pp.1025-1034
• /
• 1997

레졸루션(resolution)에 근거한 자동화된 추론 방법은 실제로 결론 도출에 필요 하지 않은 중간 정보를 생산하고, 또한 이런 정보가 또 다른 불 필요 정보를 생산함으로써, 컴퓨터 주기억 공간 잠식이 문제점으로 나타난다. 주어진 문제의 상황을 설명하는 모든 입력절로부터, 실제로 결론의 도출에 참여할 가능성이 낮은 입력절을 추론에의 참여를 제한하여, 소모하는 기억공간과 추론 시간을 감소시키는 조절 전략을 제안한다. 주어진 입력절을 분석하여, 실제로 추론에 참여하는 정도의 우선 순위를 결정하는 도구로서 퍼지 관계 논리곱을 이용한다.

• 한국터널지하공간학회 논문집
• /
• 제20권2호
• /
• pp.317-329
• /
• 2018

기존의 공동구에 관한 연구에서는 공동구 내부의 수용시설물들의 최적설계 및 타당성 분석 보다는 공동구 설치와 관련된 전반적인 사항에 대하여 검토 하였다. 공동구 도입과 관련된 기본계획 단계에서의 관련 지표 및 자료 등의 부족으로 수용시설물을 결정하기가 어려운 한계점을 해결하고자, 본 논문에서는 공동구 내 수용시설물의 최적 대안 결정을 위하여 VE/LCC 분석 방법을 제시하였다. 개별 수용시설물의 항목에 대한 분석 및 LCC 비용에 대한 가치지수를 종별 대안에 적용하여 검토 하였으며, 각 종별 우선순위를 분석하였다. 또한, 국내 공동구와 각 종별 시설물의 분석된 결과를 비교하였으며, 본 연구의 결과는 공동구의 도입 시에 최초 설계자를 포함한 사용자들이 수용시설물을 결정하는 과정에서 소요되는 시간을 단축하고 편의성을 높이는데 도움이 될 것으로 판단된다.

• 서비스연구
• /
• 제12권3호
• /
• pp.134-143
• /
• 2022

국립묘지는 나라를 위해 목숨을 바친 분들의 뜻을 기리고 충의와 위훈을 영구히 추앙하기 위해 국가적 차원의 보훈을 실현하기 위한 공간이다. 국립묘지 설립의 목적은 국가와 민족을 위해 희생한 호국정신을 본받자는 것이다. 국가는 사적(私的)인 죽음과 국가를 위한 희생으로서의 공적(公的)인 죽음을 구분한다. 나아가 공적인 것으로 분류된 죽음을 세심하게 관리한다. 국립묘지는 바로 그러한 공적인 죽음을 관리하는 제도적 공간이다. 헌신과 훈격에 따른 예우로 안장 및 추모를 위한 기준이 신분 또는 계급 중심에서 벗어나야 한다. 국립묘지는 예우의 정도와 우선순위를 헌신 및 훈격 중심(重心)으로 전환하는 것이 민주 사회에서의 진정한 보훈 시스템이 될 것이다. 무엇보다도 먼저, 전사자와 더불어 국권 회복을 위해 헌신한 독립유공자들을 최고, 최우선 예우로 모실 때가 되었다. 이는 우리 국립묘지가 겪고 있는 갈등을 해소하고 국민의 공감을 얻는 첩경이다. 본 연구는 국립묘지가 국민으로부터 사랑받는 열린 추모 공간 및 역사 공간으로는 부족한 점이 있음을 전제로 출발하고 있으며, 국립묘지가 국민들로부터 사랑받는 열린 공간으로 거듭나도록 서비스 개선 중심으로 종합적인 발전방안을 제시하고자 한다, 또한 국내외 우수 사례와 고품격이면서도 친환경적인 선진국 국립묘지 조성사례를 통해 시사점과 적용 가능성을 검토한다.

• 한국조경학회지
• /
• 제32권2호
• /
• pp.11-24
• /
• 2004

The purpose of this study is to present data on the human activities responding to the physical environment of ‘Ulsan’s Grand Parks by evaluating user behavior and activity, visiting motivations, and user satisfaction. This study was conducted using multi-methods such as interviews and questionnaires surveys. The main findings of this study can be summarized in six parts as follows: \circled1 Behavior patterns showed that the users visited the park left within 30 minutes and the frequency of visits was 1 or 2 times per week. They spent their time mostly on ‘walking’ and ‘picnicking’. The users visited regardless of the seasons or the day of the week. \circled2 The priorities for improvements were analyzed as follows: the users expressed their demands for ‘shadowing facilities’ like shelters and pergolas because they used these facilities frequently. Also, the users would like an ‘event program’, ‘sign system’ and ‘guide program’. \circled3 Analysis of the the user’s perception of the park showed that they perceive the park as ‘representative source of the landscape and open space in Ulsan and place for making contact with nature. \circled4 In examining the visiting motivations of the users of Ulsan Grand Park, it was revealed that people use the park for ‘time with family and friends’, ‘to escape from city life’, ‘to relieve fatigue. As a result of factor analysis, 4 factors were identified such as ‘physical motive(MF1)’, ‘exploratory motive(MF2)’, ‘social motive(MF3)’ and ‘emotional motive(MF4). \circled5 Park users’ evaluation for park facilities showed that people are satisfied with most of the facilities and especially, they have high level of satisfaction for ‘footpaths’, ‘squares’ and ‘picnicspace’. The evaluation of the park user’s of activity reveals that they are content with nearly all the variables. Especially, they have high level of satisfaction for the variables of ‘convenience for dynamic activities’, ‘making of a beautiful atmosphere, ‘accessibility from the outside’ and, ‘convenience in group activitie. Factor analysis of the park user’s of activity revealed 5 factors such as ‘convenience and interest factor (AF1)’, ‘park maintenance, management and use program(AF2)’, ‘visual beauty(AF3)’, ‘safety and accessibility(AF4)’ and ‘crowding(AF5)’. \circled6 Regression analysis was employed to get the predictor factors of overall satisfaction with a result of 60.0%($R^2$). The variance was explained as ‘quality of the picnic space’, ‘convenience and interest factor while using the park’, ‘park program for maintain and management in the park’, ‘visually beauty while using the park’, ‘safety and accessibility of the parks’, ‘quality of the pond’, ‘crowding’, ‘quality of the square’.

• Asian Pacific Journal of Cancer Prevention
• /
• 제15권4호
• /
• pp.1557-1561
• /
• 2014

Background: Breast cancer is the most frequently diagnosed cancer in women and estimating its relative risks and trends of incidence at the area-level is helpful for health policy makers. However, traditional methods of estimation which do not take spatial heterogeneity into account suffer from drawbacks and their results may be misleading, as the estimated maps of incidence vary dramatically in neighboring areas. Spatial methods have been proposed to overcome drawbacks of traditional methods by including spatial sources of variation in the model to produce smoother maps. Materials and Methods: In this study we analyzed the breast cancer data in Iran during 2004-2008. We used a method proposed to cover spatial and temporal effects simultaneously and their interactions to study trends of breast cancer incidence in Iran. Results: The results agree with previous studies but provide new information about two main issues regarding the trend of breast cancer in provinces of Iran. First, this model discovered provinces with high relative risks of breast cancer during the 5 years of the study. Second, new information was provided with respect to overall trend trends o. East-Azerbaijan, Golestan, North-Khorasan, and Khorasan-Razavi had the highest increases in rates of breast cancer incidence whilst Tehran, Isfahan, and Yazd had the highest incidence rates during 2004-2008. Conclusions: Using spatial methods can provide more accurate and detailed information about the incidence or prevalence of a disease. These models can specify provinces with different health priorities in terms of needs for therapy and drugs or demands for efficient education, screening, and preventive policy into action.