• Journal of Korean Society of Rural Planning
• /
• v.15 no.4
• /
• pp.1-10
• /
• 2009

Rural amenity is regarded as a breakthrough that can revitalize the rural communities. The demand for rural amenity development is also increasing since the urban people have growing incomes and leisure time. This study was implemented to survey the needs and application directions of rural amenity database. The survey questionnaires were collected from various related groups including industry, universities, administration and research institute. Two kinds of analysis of variance (ANOVA) were carried out in order to prioritize the building rural amenity resource map among four user groups and ten rural amenity resources. The result of survey showed that most of respondents had been aware of amenity resources and the industry group had the highest level of utilization in making decisions for rural development. Although the significant difference among groups was not shown in the priority, the priority in the construction of information map was shown the significant difference among 10 kinds of amenity resources. Landscape's map and traditional resource map were relatively higher priority than the other resource map.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.495-504
• /
• 2009

As the Reliability Centered Maintenance(RCM) is being studied, maintenance tasks can be performed effectively through the Risk Priority Number(RPN) evaluation about the components in the system. The RPN is usually calculated through arithmetical operations of three values, Severity, Occurrence, and Detection for each facility. This RPN provides information that includes risk level of the facility and the priority order of maintenance tasks for facility. However, if there is no sufficient historical failure data, it is difficult to calculate the RPN. In this case, historical failure data from other sources can be used and apply this data to korean railway system. In this paper, it is proposed that a new methodology to model the failure rate as a fuzzy membership function. This method is based on failure data from other sources by means of the fuzzy theory and the expert opinion system. And considering assessment tendency of each expert, distortions that happened when the failure rate of facilities is estimated were minimized. This results determine Occurrence values of facilities. Taking advantage of this result., the RPN can be calculated with Severity and Detection of facilities by using the fuzzy operation. The proposed method is applied the rail-way power substation.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.261-266
• /
• 2006

Priority queues can be used in applications such as scheduling, sorting, and shortest path network problem. Fibonacci heap, pairing heap, and M-heap are priority queues based on pointers. This paper proposes a modified M-heap with an way representation, called MA-heap, that resolves the problem mentioned in [1]. The MA-heap takes O(1) amortized time and O(logn) time to insert an element and delete the max/min element, respectively. These time complexities are the same as those of the M-heap. In addition, it is much easier to implement an MA-heap than a heap proposed in [5] since it is based on the simple traditional heap.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.820-828
• /
• 2016

The sizable electrical load of plug-in electric vehicles may cause a severe low-voltage problem in a distribution network. The voltage drop in a distribution network can be mitigated by limiting the power consumption of a charging station. Then, the charging station operator needs a method for appropriately distributing the restricted power to all plug-in electric vehicles. The existing approaches have practical limitation in terms of the availability of future information and the execution time. Therefore, this study suggests a heuristic method based on priority indexes for fairly distributing the constrained power to all plug-in electric vehicles. In the proposed method, PEVs are ranked using the priority index, which is determined in real time, such that a near-optimal solution can be obtained within a short computation time. Simulations demonstrate that the proposed method is effective in implementation, although its performance is slightly worse than that of the optimal case.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.11-16
• /
• 2010

This paper compares and studies scheduling methods to reduce jitter in real-time control systems. While previous research has focused on dynamic-priority scheduling schemes, this paper focuses on fixed-priority scheduling which is more widely used. It is pointed out that previously defined jitter measures might not be useful in enhancing the control performance of a real-time task because the measures are relative values. We present a new jitter measure and a new scheduling scheme for fixed-priority tasks. The experimental results through simulation show that the new scheduling scheme reduces jitter and enhances control performance.

• Convergence Security Journal
• /
• v.20 no.5
• /
• pp.41-52
• /
• 2020

This paper implements a priority algorithm for active response to security event risk, and implements an event scheduler that performs efficient event processing based on this. According to the standards that have global standards such as CVE and CVSS, standards for scoring when security events are executed are prepared and standardized so that priorities can be more objectively set. So, based on this, we build a security event database and use it to perform scheduling. In addition, by developing and applying the security event scheduling priority algorithm according to the situation of security events in Korea, it will contribute to securing the reliability of information protection and industrial development of domestic or ganizations and companies.

• Journal of Information Technology Applications and Management
• /
• v.31 no.3
• /
• pp.39-52
• /
• 2024

The development of autonomous driving technology is expected to bring about a major change in the mobility rights of the transportation vulnerable. It is very important to identify user requirements in developing autonomous vehicles and service technologies for the transportation vulnerable. User requirements were derived for the wheelchair disabled and the walking disabled. Through focus interviews, a total of 58 requirements were derived for wheelchair-using disabled people and 53 requirements for walking disabled people. A Kano survey was conducted on 33 wheelchair disabled and 34 walking disabled. After that, the quality types of functional requirements in terms of autonomous vehicles and service environment development were analyzed using the Kano model. Priority analysis was conducted on the functions required by the wheelchair disabled and the walking disabled. The results of this study can be used as basic data to determine the priorities of user function requirements in the early stages of autonomous vehicle and service technology development.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.5
• /
• pp.1269-1279
• /
• 2015

Korea is recognized as the most advanced nation in regards to capabilities or environments of informatization throughout the world. Nevertheless, Korea brings on itself such stigmas as a nation vulnerable to information security. Now the globe ushered in an era requiring political balances. Yet, issues of legislative supports or system adjustments for information security policies are always pushed back on the priority list. There is a need to face problems at the center of changes departing from such frames. In order to establish a proper system for information security policies, the most urgent issues are reviews of concepts and reorganizations of systems, and then to legislate information security polities by being harmonious with public opinions. This paper is to remind what measures are needed to improve the system of priority policies depending on public backgrounds and why such measures are needed. Furthermore, the paper suggests a new legislation, 'Information Security Policy Act' as one of the specific measures.

• Journal of Information Processing Systems
• /
• v.5 no.3
• /
• pp.135-144
• /
• 2009

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS has a good performance both in communication throughput and over-load.