• Fire Science and Engineering
• /
• v.32 no.4
• /
• pp.103-109
• /
• 2018

The call-takers in the 119 General Situation Room are playing important roles in recognizing the first crisis situation such as fire, rescue, and emergency, and in starting up the response system. In particular, with regard to the emergency calls, the prompt and accurate surveillance can determine the patient's life as well as the prognosis. Based on April 8-December 31, 2014 Prehospital Care Reports in a metropolitan city, we analyzed the conversation turns and the conversation time between the agent and the caller, and the time of the conversation structure and sequence according to the reception routes and the severity of symptoms. The conversation analysis between the agent and the caller will be useful for the development and improvement of the action manual in the future.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.243-250
• /
• 2008

This paper proposes a system which extracts necessary information from call-for-paper (CFP) documents using a hidden Markov model (HMM). Even though a CFP does not follow a strict form, there is, in general, a relatively-fixed sequence of information within most CFPs. Therefore, a hiden Markov model is adopted to analyze CFPs which has an advantage of processing consecutive data. However, when CFPs are intuitively modeled with a hidden Markov model, a problem arises that the boundaries of the information are not recognized accurately. In order to solve this problem, this paper proposes a two-phrase hidden Markov model. In the first step, the P-HMM (Phrase hidden Markov model) which models a document with phrases recognizes CFP documents locally. Then, the D-HMM (Document hidden Markov model) grasps the overall structure and information flow of the document. The experiments over 400 CFP documents grathered on Web result in 0.49 of F-score. This performance implies 0.15 of F-measure improvement over the HMM which is intuitively modeled.

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

It is difficult to identify reusable and independent components in component-based development(CBD) process. Therefore existing methodologies have dealt the problem of component identification based on only developer's intuition and heuristics. As a result, it is difficult to identify the business components by common developers. Therefore, in this paper, we propose a new baseline and technique to identify the business components based on domain model such as use case diagrams, class diagrams, and sequence diagrams. proposed method identifies components through two phases; system component identification and business component identification. Especially, we consider structural characteristics as well as dependency characteristics according to methods call types and directions in identifying components. We also present a case study and comparative analysis and assessment to prove the practical use of our technique.

• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1185-1192
• /
• 2003

In the component assembly and composition technique of software architecture, It is operated that the existing composition techniques based on architecture, ACME, Wright etc., used in FIFO with the direct connection structure between components through connector's Role. But, when the non-synchronizing request of components that have different characteristics occurs, the FIFO techniques is applied to the connector is difficult to process and operate effectively because of the high performance component waiting the sequence order if the low performance component is allocated first. Thus, the allocated request process according to the priority considering the characteristics of each call components in connector is necessary to improve the operation of assembled component. In this research, we extend the connector part that is available in multiplex connection structure based on existent Wright specification. For service process requested from component, the connector part is designed and implemented to operating with priority sequence through calculating the weight of CPU use rate, bean requesting process time and memory use rate among the efficiency elements of assembled components. To verify the efficiency if this designed connector, we implemented 20 samples EJB components that have different efficiency characteristics and applied these samples components to designed connector. The operating results with this designed connector show that the efficient operation of whole system is possible though the processing time takes 481ms more than the time of the existing FIFO techniques.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.17 no.4
• /
• pp.297-305
• /
• 2014

In this study, we installed the Automatic Identification System (AIS) receiver on the Ieodo Ocean Research Station (IORS) from November 21 to 30, 2013 in order to monitor marine traffic and fishery activity in the jurisdictional sea area. The collected AIS raw data consist of static data report (MMSI, IMO NO., Call Sign, Ship Name, etc.) and position information report (position, speed, course, etc.), and the developed program was applied to classify ships according to ship flag and type information. The nationalities are released from the first three-digit numbers (MID) of MMSI, but in general most of small ships do not send an exact ship flag through Class B type AIS, a simplified and low-power equipment. From AIS data with flag information, ships under the flag of China had the highest frequency and the second was Korean flag, while in ship type cargo and fishing vessels were dominant in sequence. As for the ships without flag information, we compared the tracks with others in order to estimate ship flags. It can be said that fleets of ships with Chinese frequently appear sail together for fisheries over the waters, because the unknown ships followed a similar moving pattern with Chinese fishing vessels.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.6
• /
• pp.155-164
• /
• 2018

Many malicious programs have been compressed or encrypted using various commercial packers to prevent reverse engineering, So malicious code analysts must decompress or decrypt them first. The OEP (Original Entry Point) is the address of the first instruction executed after returning the encrypted or compressed executable file back to the original binary state. Several unpackers, including PinDemonium, execute the packed file and keep tracks of the addresses until the OEP appears and find the OEP among the addresses. However, instead of finding exact one OEP, unpackers provide a relatively large set of OEP candidates and sometimes OEP is missing among candidates. In other words, existing unpackers have difficulty in finding the correct OEP. We have developed new tool which provides fewer OEP candidate sets by adding two methods based on the property of the OEP. In this paper, we propose two methods to provide fewer OEP candidate sets by using the property that the function call sequence and parameters are same between packed program and original program. First way is based on a function call. Programs written in the C/C++ language are compiled to translate languages into binary code. Compiler-specific system functions are added to the compiled program. After examining these functions, we have added a method that we suggest to PinDemonium to detect the unpacking work by matching the patterns of system functions that are called in packed programs and unpacked programs. Second way is based on parameters. The parameters include not only the user-entered inputs, but also the system inputs. We have added a method that we suggest to PinDemonium to find the OEP using the system parameters of a particular function in stack memory. OEP detection experiments were performed on sample programs packed by 16 commercial packers. We can reduce the OEP candidate by more than 40% on average compared to PinDemonium except 2 commercial packers which are can not be executed due to the anti-debugging technique.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.508-519
• /
• 2007

Flash memory based storage has been used in various mobile systems and now is to be used in Laptop computers in the name of Solid State Disk. The Flash memory has not only merits in terms of weight, shock resistance, and power consumption but also limitations like erase-before-write property. To overcome these limitations, Flash memory based storage requires special address mapping software called FTL(Flash-memory Translation Layer), which often performs merge operation for block recycling. In order to reduce block recycling cost in NAND Flash memory based storage, we introduce another block recycling scheme which we call migration. As a result, the FTL can select either merge or migration depending on their costs for each block recycling. Experimental results with Postmark benchmark and embedded system workload show that this cost-based selection of migration/merge operation improves the performance of Flash memory based storage. Also, we present a solution of macroscopic optimal migration/merge sequence that minimizes a block recycling cost for each migration/merge combination period. Experimental results show that the performance of Flash memory based storage can be more improved by the macroscopic optimization than the simple cost-based selection.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.12 s.103
• /
• pp.1229-1238
• /
• 2005

OFDM(Orthogonal Frequency Division Multiplexing) communications system is very attractive for the high data rate wireless transmission. However, it may be distorted in the nonlinear HPA(High Power Amplifier) since OFDM signal has hish PAPR(Peak-to-Average Power Ratio). In this paper, a new method using control tone is studied for reducing the PAPR and we call it PCT(PAPR Control Tone) method. This proposed PCT method is to assign control tones for PAPR reduction at the predefined sub-carriers. After IFFT(Inverse Fast Fourier Transform) and PAPR calculation, the OFDM data signal of the lowest PAPR is selected to transmit. Unlike the conventional method, it can cut down the computational complexity because it does not require the transmission and demodulation process of side information about the phase rotation. Furthermore, if this method is made up in parallel configuration, it can solve the time delay problem so that it can be processed in real time processing. This proposed method is compared with the conventional selected mapping(SLM) technique. We find out the PAPR reduction performance and BER when the number of control tone is 6 and nonlinear HPA is considered.