• Nuclear Engineering and Technology
• /
• v.41 no.3
• /
• pp.247-270
• /
• 2009

This paper reviews studies on information searching behavior in process control systems and discusses some implications learned from previous studies for use in human factors studies on nuclear power plants (NPPs) main control rooms (MCRs). Information searching behavior in NPPs depends on expectancy, value, salience, and effort. The first quantitative scanning model developed by Senders for instrument panel monitoring considered bandwidth (change rate) of instruments as a determining factor in scanning behavior. Senders' model was subsequently elaborated by other researchers to account for value in addition to bandwidth. There is also another type of model based on the operator's situation awareness (SA) which has been developed for NPP application. In these SA-based models, situation-event relations or rules on system dynamics are considered the most significant factor forming expectancy. From the review of previous studies it is recommended that, for NPP application, (1) a set of symptomatic information sources including both changed and unchanged symptoms should be considered along with bandwidth as determining factors governing information searching (or visual sampling) behavior; (2) both data-driven monitoring and knowledge-driven monitoring should be considered and balanced in a systematic way; (3) sound models describing mechanisms of cognitive activities during information searching tasks should be developed so as to bridge studies on information searching behavior and design improvement in HMI; (4) the attention-situation awareness (A-SA) modeling approach should be recognized as a promising approach to be examined further; and (5) information displays should be expected to have totally different characteristics in advanced control rooms. Hence much attention should be devoted to information searching behavior including human-machine interface (HMI) design and human cognitive processes.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.227-233
• /
• 2004

Complex scheduling problems are related to planning, scheduling, constraint satisfaction problems, object-oriented concepts, and agent systems. Human preference-driven scheduling technique was to solve complex scheduling problems using constraint satisfaction problems and object-oriented concepts. We have tried to apply human preference-driven scheduling technique to reservation problems. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The technique of reservation scheduling proposed in this thesis is based on object-oriented concepts. 1'o consider the over all satisfaction, the events of every object are alloted to the board along its priority. Constraints to reservation scheduling are classified to global and local. The definition of board and information of every event are global constraints and the preferences to object's board slots are local constraints. We have applied look-ahead technology to reservation scheduling in order to minimize backtracking not to fail the allotment of events.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.564-570
• /
• 2006

This paper presents a new real-time system design methodology for embedded system as well as event-driven real time application. It is required to implement a deadline handling mechanism in order to satisfy a large-scale distributed real time application. When we design real time system, it has handled a deadline and is important to measure / control a timing issue. These timing constraints usually associated with an interface between model and system. There are many case tools that supporting a real time application, for example, UML, graphic language for designing real time system, but they cannot provide efficient way to handle deadline miss. Therefore, users have to design deadline handler manually when they need to use it. This paper contributes solving the problems of user-level deadline handling for an embedded system. Also, it also discusses an efficient deadline handler design mechanism using on RoseRT, which is a graphical CASE tool supporting from UML.

• Journal of Environmental Science International
• /
• v.23 no.4
• /
• pp.553-560
• /
• 2014

The rainfall-runoff characteristics in Jeju Island significantly differ from those in inland, due to highly permeable geologic features driven by volcanic island. Streams are usually sustained in the dry conditions and thereby the rainfall-runoff characteristics changes in terms of initiating stream discharge and its types, depending highly on the antecedent precipitation. Among various the rainfall-runoff characteristics, lag time mainly used for flood warning system in river and direct runoff ratio for determining water budget to estimate groundwater recharge quantity are practically crucial. They are expected to vary accordingly with the given antecedent precipitation. This study assessed the lag time in the measured hydrograph and direct runoff ratio, which are especially in the upstream watershed having the outlet as $2^{nd}$ Dongsan bridge of Han stream, Jeju, based upon several typhoon events such as Khanun, Bolaven, Tembin, Sanba as well as a specific heavy rainfall event in August 23, 2012. As results, considering that the lag time changed a bit over the rainfall events, the averaged lag time without antecedent precipitation was around 1.5 hour, but it became increased with antecedent precipitation. Though the direct run-off ratio showed similar percentages (i.e., 23%)without antecedent precipitation, it was substantially increased up to around 45% when antecedent precipitation existed. In addition, the direct run-off ration without antecedent precipitation was also very high (43.8%), especially when there was extremely heavy rainfall event in the more than five hundreds return period such as typhoon Sanba.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1037-1044
• /
• 2006

It's difficult to check cyber attacks and the performance of a security system in a real large-scale network. Generally, a new security system or the effect of a new security attack are checked by simulation. We use SSFNet to simulate our security system and cyber attack. SSFNet is an event-driven simulation tools based on process, which has a strength to be capable of expressing a large-scale network. But it doesn't offer any API's which can manipulate not only the related function of security but also the packet. In this paper, we developed a firewall and IPS class, used for a security system, and added to them components of SSFNet. The firewall is modelled a security system based on packet filtering. We checked the function of the firewall and the IPS with network modelled as using our SSFNet. The firewall blocks packets through rules of an address and port of packets. The result of this simulation shows that we can check a status of packets through a log screen of IPS installed in a router and confirm abnormal packet to be dropped.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.87-95
• /
• 2006

We need to check into when a security system is newly developed, we against cyber attack which is expected in real network. However it is impossible to check it under the environment of a large-scale distributive network. So it is need to simulate it under the virtual network environment. SSFNet is a event-driven simulator which can be represent a large-scale network. Unfortunately, it doesn't have the module to simulate security functions. In this paper, we added the IDS module to SSFNet. We implement the IDS module by modeling a key functions of Snort. In addition, we developed some useful functions using Java language which can manipulate easily a packet for network simulation. Finally, we performed the simulation to verify the function if our developed IDS and Packets Manipulation. The simulation shows that our expanded SSFNet can be used to further large-scale security system simulator.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.141-152
• /
• 2007

In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.461-476
• /
• 2003

Due to the implementation ease and alleviation of memory bottleneck effect, NUMA architecture has dominated in the multiprocessor systems for the past several years. However, because the NUMA system distributes memory in each node, frequent remote memory access is a key factor of performance degradation. Therefore, efficient design of RAC(Remote Access Cache) in NUMA system is critical for performance improvement. In this paper, we suggest Multi-Grain RAC which can adaptively control the RAC line size, with respect to each application behavior Then we simulate NUMA system with multi-grain RAC using MINT, event-driven memory hierarchy simulator. and analyze the performance results. At first, with profile-based determination method, we verify the optimal RAC line size for each application and, then, we compare and analyze the performance differences among NUMA systems with normal RAC, with optimal line size RAC, and with multi-grain RAC. The simulation shows that the worst case can be always avoided and results are very close to optimal case with any combination of application and RAC format.