• Title, Summary, Keyword: set priority

Search Result 415, Processing Time 0.041 seconds

Developing a Method to Define Mountain Search Priority Areas Based on Behavioral Characteristics of Missing Persons

  • Yoo, Ho Jin;Lee, Jiyeong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.5
    • /
    • pp.293-302
    • /
    • 2019
  • In mountain accident events, it is important for the search team commander to determine the search area in order to secure the Golden Time. Within this period, assistance and treatment to the concerned individual will most likely prevent further injuries and harm. This paper proposes a method to determine the search priority area based on missing persons behavior and missing persons incidents statistics. GIS (Geographic Information System) and MCDM (Multi Criteria Decision Making) are integrated by applying WLC (Weighted Linear Combination) techniques. Missing persons were classified into five types, and their behavioral characteristics were analyzed to extract seven geographic analysis factors. Next, index values were set up for each missing person and element according to the behavioral characteristics, and the raster data generated by multiplying the weight of each element are superimposed to define models to select search priority areas, where each weight is calculated from the AHP (Analytical Hierarchy Process) through a pairwise comparison method obtained from search operation experts. Finally, the model generated in this study was applied to a missing person case through a virtual missing scenario, the priority area was selected, and the behavioral characteristics and topographical characteristics of the missing persons were compared with the selected area. The resulting analysis results were verified by mountain rescue experts as 'appropriate' in terms of the behavior analysis, analysis factor extraction, experimental process, and results for the missing persons.

A Study on the Runtime Test of Priority Queues (우선순위 큐 성능 시험에 관한 연구)

  • Jung, Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.17A no.4
    • /
    • pp.167-172
    • /
    • 2010
  • This paper proposes a set of runtime test models for priority queues and shows the runtime test results based on the proposed test models for the representative priority queues: the traditional heap, post-order heap, and pairing heap. Among these heaps, the traditional heap is the worst in time complexity analyzed. But, according to our experimental results based on the test models proposed, it is shown that the slowest one is the pairing heap that utilizes pointers and the fastest one is the traditional heap. For the two implicit heaps, these results are in contrary to the fact that the post-order heap is better than the traditional heap in time complexity analyzed.

Development of Agenda Priority for Nursing Service Research and Development (간호서비스 연구개발 분야에서의 우선순위과제 도출)

  • Oh, Eui Geum;Jang, Yeon Su;Gong, Sae Lom;Lee, Yoon Ju
    • Journal of Korean Academy of Nursing Administration
    • /
    • v.21 no.1
    • /
    • pp.99-110
    • /
    • 2015
  • Purpose: The purpose of this study was to suggest agenda priorities for nursing service R&D (Research and Development) related policies development. Methods: Two steps in developing the agendas and priorities were performed in this descriptive study. First, nursing service R&D agendas were extracted through needs assessment of nursing researchers and practitioners. Then, the priority of agendas was set by Analytic Hierarchy Process by ten experts who were representatives of nursing and other healthcare professionals. Results: Six core areas and forty-six nursing service R&D agendas were developed. The priority of agendas was different according to the evaluation criteria depending on weight value of nursing services. Conclusion: In order to select and promote nursing service R&D projects within national healthcare policy, nursing service R&D policy should be proposed with consideration to the importance of the criteria in reflecting characteristics of nursing care. By strengthening R&D capabilities for quality improvement and sensitive awareness of national directions for healthcare R&D policies, nursing service R&D can be appropriately promoted.

A Priority Based Transmission Control Scheme Considering Remaining Energy for Body Sensor Network

  • Encarnacion, Nico;Yang, Hyunho
    • Smart Media Journal
    • /
    • v.4 no.1
    • /
    • pp.25-32
    • /
    • 2015
  • Powering wireless sensors with energy harvested from the environment is coming of age due to the increasing power densities of both storage and harvesting devices and the electronics performing energy efficient energy conversion. In order to maximize the functionality of the wireless sensor network, minimize missing packets, minimize latency and prevent the waste of energy, problems like congestion and inefficient energy usage must be addressed. Many sleep-awake protocols and efficient message priority techniques have been developed to properly manage the energy of the nodes and to minimize congestion. For a WSN that is operating in a strictly energy constrained environment, an energy-efficient transmission strategy is necessary. In this paper, we present a novel transmission priority decision scheme for a heterogeneous body sensor network composed of normal nodes and an energy harvesting node that acts as a cluster head. The energy harvesting node's decision whether or not to clear a normal node for sending is based on a set of metrics which includes the energy harvesting node's remaining energy, the total harvested energy, the type of message in a normal node's queue and finally, the implementation context of the wireless sensor network.

Simple priority setting method for Screening in public health assessment of waste incineration facilities (폐기물 소각시설 주변 환경보건평가 중 스크리닝 단계에서의 우선순위 선정기법에 관한 연구)

  • Kim, Gi Young;Hong, Seung Cheol
    • Journal of Environmental Impact Assessment
    • /
    • v.21 no.5
    • /
    • pp.813-821
    • /
    • 2012
  • Environmental and public health concern for the emission of air pollutants from burn-up process in waste incineration plants located in the vicinity of living environment was increased during the past decade. The purpose of this study was to suggest of the simple and rapid method of priority setting model for the decision of full-scale public health assessment. This method was consists of total 5-step. Step 1 was "secure the satellite map" and we can use the satellite map which serves from the website such as NAVER Co. Step 2 was "drawing mesh on the map" for catch the point of occupation of environmental sensitivity facilities, and step 3 was "identification and sorting of the facilities", Step 4 was "setting of weight" using the "weighted linear combination (WLC) method". Finally, all facility was sorted by score. As a result, we can set a priority of 145 facilities based on 177 facilities which managed in local government. Facilities in Seoul metropolitan area was high rank in priority list. On the other side, Facilities located at the country or rural area was low rank because of low occupation of the house and the environmental sensitivity facilities such as kindergarten, elementary school, and hospital. In this study, we suggested simple and rapid method that using for screening procedure of public health assessment.

Multiple Rotating Priority Queue Scheduler to Meet Variable Delay Requriment in Real-Time Communication (실시간 통신에서 가변 지연을 만족하기 위한 Multiple Rotating Priority Queue Scheduler)

  • Hur, Kwon;Kim, Myung-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2543-2554
    • /
    • 2000
  • Packet schedulers for real-time communication must provide bounded delay and efficient use of network resources such as bandwidth, buffers and so on. In order to satisfy them, a large number of packet scheduling methods have been proposed. Among packet scheduling methods, an EDF (Earliest Deadline First) scheduling is the optimal one for a bounded delay service. A disadvantage of EDF scheduling is that queued packets must be sorted according to their deadlines, requiring a search operation whenever a new packet arrives at the scheduler. Although an RPQ (Rotating Priority Queue) scheduler, requiring large size of buffers, does not use such operation, it can closely approximate the schedulability of an EDF scheduler. To overcome the buffer size problem of an RPQ scheduler, this paper proposes a new scheduler named MRPQ (Multiple Rotating Priority Queue). In a MRPQ scheduler, there are several layers with a set of Queues. In a layer, Queues are configured by using a new strategy named block Queue. A MRPQ scheduler needs nearly half of buffer size required in an RPQ scheduler and produces schedulability as good as an RPQ scheduler.

  • PDF

Cell Marking Priority Control Considering User Level Priority in ATM Network (ATM 네트워크에서 사용자 레벨 우선 순위를 고려한 셀 마킹 및 우선 순위 제어)

  • O, Chang-Se;Kim, Tae-Yun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.4
    • /
    • pp.490-501
    • /
    • 1994
  • In this study the problems of cell marking method used in the field of ATM network traffic control are presented. Also an extended cell marking method considering the user level priority is proposed. The conventional traffic monitoring schemes set the CLP bit of a cell to 1 only under the circumstance of the violation of traffic contract. It causes that the number of low level cells increases and the levels of cells are lowered regardless of the user level priority. The three level priority control method combining FCI bit with CLP bit has also been proposed. It divides CLP=0 cells into two levels. Consequently, the proposed method preserves more cells in high level than the conventional one and the real loss of high level cells can be reduced. The performance of the proposed scheme has also been analyzed by the PBS(partial buffer sharing) with two thresholds for the proposed three levels. The result shows that the PBS with two thresholds can give more efficient control than the scheme with no priority, or the PBS with one threshold.

  • PDF

Signal Timing and Intersection Waiting Time Calculation Model using Analytical Method for Active Tram Signal Priority (해석적 방법을 이용한 능동식 트램 우선신호의 신호시간 및 교차로 대기시간 산정 모형)

  • Jeong, Youngje;Jeong, Jun Ha;Joo, Doo Hwan;Lee, Ho Won;Heo, Nak Won
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.4
    • /
    • pp.410-420
    • /
    • 2014
  • This research suggests a new tram signal priority model which determines signal timings and tram intersection waiting time using analytical method. This model can calculate the signal timings for Early Green and Green Extension among the active tram signal priority techniques by tram detection time of upstream detector. Moreover, it can determine the tram intersection waiting time that means tram intersection travel time delay from a vantage point of tram travel. Under the active tram signal priority condition, priority phases can bring additional green time from variable green time of non-priority phases. In this study, the signal timing and tram intersection waiting time calculation model was set up using analytical methods. In case studies using an isolated intersection, this study checks tram intersection waiting time ranged 12.7 to 29.4 seconds when variable green times of non-priority phases are 44 to 10 seconds under 120 seconds of cycle length.

Performance Analysis of Timer Assignment and Utilization of the IEEE 802.4 Token Bus for Real Time Processing (실시간 처리를 위한 IEEE 802.4 토큰버스 네트워크의 타이어 할당과 유용도 처리 성능 해석)

  • Kim, Jeong-Ho;Lee, Min-Nam;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.357-366
    • /
    • 1994
  • The IEEE 802.4 token bus has been widely accepted as the standard for factory local area networks. The priority option of the 802.4 standard supports multiple classes of traffic by using a set of timers to control information exchange. The performance of the 802.4 priority mechanism in industrial real time control is examined. A timer assignment technique is presented for such applications. The timers are set to satisfy the worst case access delay requirements of real time control applications. Other applications that are not time constrainted can be supported simultaneously. In fact under certain conditions, such applications can also be guaranteed a minimum bandwidth allocation. Simulation results are used to evaluate the timer assignment and utililization.

  • PDF

Improvement Strategy of System Unavailability by Review of Logical Structure and Reliability Importance of Reliability Block Diagram (RED) and Fault Tree Analysis (FTA) (RBD와 FTA의 논리구조와 신뢰성 중요도의 고찰에 의한 시스템 비시간가동률 개선방안)

  • Choi, Sung-Woon
    • Journal of the Korea Safety Management and Science
    • /
    • v.13 no.3
    • /
    • pp.45-53
    • /
    • 2011
  • The research proposes seven elimination rules of redundant gates and blocks in Fault Tree Analysis (FTA) and Reliability Block Diagram (RBD). The computational complexity of cut sets and path sets is NP-hard. In order to reduce the complexity of Minimal Cut Set (MCS) and Minimal Path Set (MPS), the paper classifies generation algorithms. Moreover, the study develops six implementation steps which reflect structural importance (SI) and reliability importance (RI) from Reliability Centered Maintenance (RCM) that a priority of using the functional logic among components is to reduce (improve) the system unavailability (or availability). The proposed steps include efficient generation of state structure function by Rare Event Enumeration (REA). Effective use of importance measures, such as SI and ill measures, is presented based on the number and the size of MCS and MPS which is generated from the reference[5] of this paper. In addition, numerical examples are presented for practitioners to obtain the comprehensive understanding of six steps that is proposed in this research.