• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.53-59
• /
• 2015

In this paper, we developed a Hospital Information System in which the business process is formalized and a wire/wireless integrated solution is used. This system consists of the administration office program, the medical office program, the ward management program and the rounds management program. The administration office program can enroll and accept patients, issue and reissue the RFID card. The medical office program inputs a medical examination and treatment, outputs a diagnosis, requests a hospitalization, retrieves the record of a medical examination and treatment, assigns the corresponding examination room to the accepted patients, and updates the number of an waiting patient and a patient number according to the examination room on real time. The ward management program handles hospitalizations and leaving hospital, a nurse's note, and an isolation ward monitoring. The rounds management program handles a medical examination and treatment, and a leaving hospital using PDA. This developed system can be built at low cost and increase the quality of the medical services highly by making it automated the medical administration automation. Also the small number of the medical staffs can manage the inpatients efficiently by using the monitoring functions.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.111-120
• /
• 2009

Network-on-chip (NoC) architecture provides a highper-formance communication infrastructure for system-on-chip designs. Circuit-switched networks guarantee transmission latency and throughput; hence, they are suitable for NoC architecture with real-time traffic. In this paper, we propose an efficient integrated scheme which automatically maps application tasks onto NoC tiles, establishes communication circuits, and allocates a proper bandwidth for each circuit. Simulation results show that the average waiting times of packets in a switch in $6{\times}6$6, $8{\times}8$, and $10{\times}10$ mesh NoC networks are 0.59, 0.62, and 0.61, respectively. The latency of circuits is significantly decreased. Furthermore, the buffer of a switch in NoC only needs to accommodate the data of one time slot. The cost of the switch in the circuit-switched network can be reduced using our scheme. Our design provides an effective solution for a critical step in NoC design.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.669-685
• /
• 2003

Nowadays mobile phones and PDAs are part and parcel of our lives. By carrying a portable mobile device with us all the time we are already living in partial Pervasive Computing Environment (PCE) that is waiting to be exploited very soon. One of the advantages of pervasive computing is that it strongly supports the deployment of Location-Based Service(s) (LBSs). In PCE, there would be many competitive service providers (SPs) trying to sell different or similar LBSs to users. In order to reserve a particular service, it becomes very difficult for a low-computing and resource-poor mobile device to handle many such SPs at a time, and to identify and securely communicate with only genuine ones. Our paper establishes a convincing trust model through which secure job delegation is accomplished. Secure Job delegation and cost effective cryptographic techniques largely help in reducing the burden on the mobile device to securely communicate with trusted SPs. Our protocol also provides users privacy protection, replay protection, entity authentication, and message authentication, integrity, and confidentiality. This paper explains our protocol by suggesting one of the LBSs namely“Secure Automated Taxi Calling Service”.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1614-1620
• /
• 2009

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.111-120
• /
• 2004

In order to increase the productivity of software, the research to reduce the total cost in software development environments is working, Considerable time is wasted waiting for a changed program in program development, however smell the change, to be edited and compiled and executed. In case of partial change, we need incremental interpreter for reexecuting the changed parts and its affected parts, In this paper, we implement the incremental interpreter by using analyzing dynamic semantics at execution time, We define a new IMPLO(IMPerative Language with Object) language using EBNF(Extended Backus Naur Form) notation and then, design and implement the incremental interpreter of this language by using action equations to describe the dynamic semantics.

• Journal of Korean Clinical Nursing Research
• /
• v.17 no.3
• /
• pp.363-374
• /
• 2011

Purpose: The purpose of this study was to identify the types and causes of non-value-added (NVA) activities in nursing practice, and to determine the frequency of each NVA type and causes of NVA in clinical area. Methods: This study was conducted using Delphi technique. First, in order to identify NVA and their causes, 24 nurses with 7 years or more of clinical experience were recruited from medical/surgical units in six general hospitals in Korea. Then the NVA types and causes were tested using a larger sample of 130 nurses with more than 3 years of clinical experience at two general hospitals in Korea. Results: NVA was categorized into 6 different types, which are repeating, duplicating, waiting, reverse-proxy working, reworking, and searching. The most prevalent NVAs were repeating and duplicating works. Reworking and searching were less frequent types than others. The causes of NVA were classified into personnel-related, supporting departments, records, regulations, information, materials or instruments, and others. Among them, personnel-related and supporting departments were reported with the highest scores. Conclusion: NVA leads to waste cost and time. These results demonstrated the situations and causes of NVA occurred in nursing practice. Further studies on the typology and moderation of NVA activities are warranted to improve the efficiency and quality of nursing care in day-to-day practice.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.123-133
• /
• 2007

This study analyzed whether a transit network with hierarchy is efficient or not, and if transit network hierarchy has cost efficiency, then which condition guarantees the efficiency of the transit network hierarchy. The authors modeled the total cost of the transit network and suggested the conditions in which the transit network hierarchy has cost efficiency through comparing the cost of the transit network with and without hierarchy. The efficiency of transit network hierarchy is guaranteed when the travel cost savings induced by using a higher hierarchy transit network is larger than the increasing non-travel cost, which is the sum of access cost, waiting cost, and operating cost, induced by the introduction of a higher hierarchy transit network. This result is consistent with common sense and with the concept of cost and benefit analysis. If a passenger traveling within the area divided by a higher hierarchy transit network uses only a lower hierarchy transit network and the passenger traveling out of the area divided by the higher hierarchy transit network uses both lower and higher hierarchy transit networks, the travel demand using the higher hierarchy transit network is inversely proportional to the square of the line spacing. This means that the transit network becomes more efficient and small increases of travel demand guarantee the efficiency of the transit network hierarchy as the connectivity of the network becomes higher. This result shows that transit networks have economies of aggregation. This study is the first analytical research on transit network hierarchy and is expected to be a basis for numerical research. However, numerical research should complement this study, since analytical research has some limitations for considering a real network.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.85-94
• /
• 2005

The scale and operating conditions of logistical systems very sensitively varies according to the variation of traffic intensity that is affected by the arrival characteristics of trucks and the attributes of loading/unloading services in logistics facilities. More exactly, logistics costs are incurred according to variations of traffic intensity. which are intimately linked with in a given time period. Also. although traffic intensity changes minutely, the range of cost variation is wide. Nevertheless, with regard to operating logistics systems, the existing studies make no attempt to analyze these factors. Therefore, it was the purpose of this study to determine the optimal traffic intensity to minimize excessive logistics costs resulting from the generation of unnecessary costs such as waiting costs and overcosts in operating a facility. For the purposes of this analysis. a determination model of optimal traffic intensity was constructed according to queuing theory. The inflow/outflow conditions of trucks and the terminal operational conditions were collected from an off-dock container terminal in Busan. On the basis of this data. the optimal traffic intensity that could off-set excessive waiting and operating costs was determined quantitatively. Also. using the optimal traffic intensity to be determined. we consider the improvements of operating system in the logistics facilities.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.122-124
• /
• 2022

Handling Passenger Traffic is the main challenge for designing an elevator group-control algorithm. Advanced control systems such as Hyundai's Destination Selection System(DSS) lets passengers select the destination by pressing on a selecting screen, and the systems have shown great efficiency. However, the algorithm cannot be applied to the general elevator control system due to the expensive cost of the technology. Often many elevator systems use Nearest Car(NC) algorithms based on the SCAN algorithm, which results in time efficiency problems. In this paper, we designed an elevator group-control algorithm for specific buildings that have approximate timetable data for most of the passengers in the building. In that way, it is possible to predict the destination and the location of passenger calls. The algorithm consists of two parts; the waiting function and the assignment function. They evaluate elevators' actions with respect to the calls and the overall situation. 10 different timetables are created in reference to a real timetable following midday traffic and interfloor traffic. The specific coefficients in the function are set by going through the genetic algorithm process that represents the best algorithm. As result, the average waiting time has shortened by a noticeable amount and the efficiency was close to the known DSS result. Finally, we analyzed the algorithm by evaluating the meaning of each coefficient result from the genetic algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.646-680
• /
• 2000

In this paper, we discuss the design and implementation of a concurrency control manager for a main memory DBMS(MMDBMS). Since an MMDBMS, unlike a disk-based DBMS, performs all of data update or retrieval operations by accessing main memory only, the portion of the cost for concurrency control in the total cost for a data update or retrieval is fairly high. Thus, the development of an efficient concurrency control manager highly accelerates the performance of the entire system. Our concurrency control manager employs the 2-phase locking protocol, and has the following characteristics. First, it adapts the partition, an allocation unit of main memory, as a locking granule, and thus, effectively adjusts the trade-off between the system concurrency and locking cost through the analysis of applications. Second, it enjoys low locking costs by maintaining the lock information directly in the partition itself. Third, it provides the latch as a mechanism for physical consistency of system data. Our latch supports both of the shared and exclusive modes, and maximizes the CPU utilization by combining the Bakery algorithm and Unix semaphore facility. Fourth, for solving the deadlock problem, it periodically examines whether a system is in a deadlock state using lock waiting information. In addition, we discuss various issues arising in development such as mutual exclusion of a transaction table, mutual exclusion of indexes and system catalogs, and realtime application supports.