• The Journal of Information Systems
• /
• v.29 no.1
• /
• pp.93-111
• /
• 2020

Purpose The purpose of this paper is to observe the relative priorities of importances among the modified versions of Block chain system, being based on AHP decision support model which should be also proposed in this paper. Design/methodology/approach Four versions modified from the beginning of Block chain were divided into Public& Permissionless, Private&Permissionless, Public&Permissioned and Private&Permissioned types. Five criteria for evaluating the four versions whether the version were suitable for Medical information system were introduced from five factors of Technologies Accept Model, which were Security, Availability, Variety, Reliability and Economical efficiency. We designed Decision support model based on AHP which would select the best alternative version suitable for introducing the Block chain technology into the medical information systems. We established the objective of the AHP model into finding the best choice among the four modified versions. First low layer of the model contains the five factors which consisted of Security, Availability, Variety, Reliability and Economical efficiency. Second low layer of the model contains the four modified versions which consisted Public&Permissionless, Private&Permissionless, Public&Permissioned and Private& Permissioned types. The structural questionnaire based on the AHP decision support model was designed and used to survey experts of medical areas. The collected data by the question investigation was analyzed by AHP analysis technique. Findings The importance priority of Security was highest among five factors of Technologies Accept Mode in the first layer. The importance priority of Private&Permissioned type was highest among four modified versions of Block chain technologies in second low layer. The second importance priority was Private&Permissionless type. The strong point of Private&Permissioned type is to be able to protect personal information and have faster processing speeds. The advantage of Private& Permissionless type is to be also able to protect personal information as well as from forging and altering transaction data. We recognized that it should be necessary to develop new Block chain technologies that would enable to have faster processing speeds as well as from forging and altering transaction data.

• Journal of the Korean Society of Safety
• /
• v.39 no.1
• /
• pp.16-26
• /
• 2024

This study aims to introduce a method for risk assessment analysis aimed at preventing electrical fires within the manufacturing industry. Initially, we provided a functional block diagram illustrating the electrical equipment employed in various processes within a food manufacturing company in Chungcheongbuk-do. Subsequently, we categorized the components of each machine outlined in the functional block diagram and determined the priority of failure for each classified component. Upon implementing the model in the frying process of the food manufacturing company, specific components, including MC, motor, mixer heater, electric wiring, and terminal block, exhibit a risk priority number (RPN) of 40 or higher. This identified an electrical issue within the manufacturing process and environment. Consequently, we propose a methodology to identify latent failure modes that could escalate into fires or systemic issues if not promptly addressed. It is essential to note that while the FMEA presented in this study may not immediately impact food manufacturing, its applicability extends to various workplaces.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.55-60
• /
• 2020

In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.162-168
• /
• 2007

TCAM(Ternary content-addressable memory) has been widely used to perform fast routing lookup. It is able to accomplish the LPM(longest prefix matching) search in O(1) time without considering the number of prefixes and their lengths. As compared to software-based solutions, especially for IPv6, TCAM can oner sustained throughput and simple system architecture. However, There is no research for Priority-TCAM which can assign priority to each memory block. This paper addresses the difference or priority-TCAM compared to the existing TCAM and proposes CAO-PA algerian to manage the lookup table efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.232-238
• /
• 2006

We propose a novel call admission control scheme which improves the handoff drop and the new call block probabilities of high priority services, minimizing the negative impact on low priority services, in multimedia service cellular networks. This paper proposes three schemes to solve this problem; the packing scheme in which available channels of a cell distributed to each frequency channel are concentrated on one frequency channel and a high transmission rate service is assigned to the frequency channel; the queuing scheme in which the queue is used for high transmission rate calls; and the power reallocation scheme in which the power assigned to calls under service is temporarily reduced and a high transmission rate service is allowed. The simulation results revealed that our scheme improved the drop and the block probabilities of the high priority services compared with the conventional scheme.

• Proceedings of the KSR Conference
• /
• 2011.05a
• /
• pp.1848-1859
• /
• 2011

A subsidiary-main track for passenger station is a low-speed track section distinct from a through route such as a main track. It is parallel to a through track and connected to it at both ends by switches. Sidetracks allow for fast, high priority trains to pass slower or lower priority trains going the same direction. They are important for efficiency to order and organize the flow of rail traffic. In this paper we first describe the minimum headway between trains using the concept of occupation time in a block section, which depends on block systems, signalling system and safety technology. And then a stepwise approach is presented to select station, which is suitable to install sidetrack for a given train-traffic pattern. This approach is tested with sample example data, which are surveyed from track geometry based on the to-be-constructed line.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.4
• /
• pp.23-30
• /
• 2013

Reliability Centered Maintenance(RCM) is one of most widely used methods in the modern power system to schedule a maintenance cycle and determine the priority of inspection. A precedence study for the new structure of rearranged system should be performed due to introduction of additional installation. This paper proposes a new method to evaluate the priority of maintenance and inspection of the power system facilities. In order to calculate that risk index, it is required that the reliability block diagram should be analyzed for the power system. Additionally, a fault cause analysis is also performed through the event-tree analysis.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.55-60
• /
• 2007

This paper proposes a fast and scalable priority queue architecture for use in high-speed networks which supports quality of service (QoS) guarantees. This architecture is cost-effective since a single queue can generate outputs to multiple out-links. Also, compared with the previous multiple systolic array priority queues, the proposed queue provides fast output generation which is important to high-speed packet schedulers, using a special control block. In addition this architecture provides the feature of high scalability.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.370-374
• /
• 1993

This paper describes a study on the expert system based process planning of the block division process in shipbuilding. The prototype system developed deterines the block division line of the midship of crude-oil tanker. Case-based reasoning (CBR) approach relying on previous similar cases to solve the problem is applied instead of rule-based reasoning (RBR). Similar cases are retrieved from case base according to the similarity metrics between input problem and cases. The retrieved case with the highest priority is then adapted to fit to the input problem buy adaptation rules. The adapted solution is proposed as the division line for the input problem.