• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.3
• /
• pp.89-108
• /
• 2022

The purpose of this study is to reveal the specific current and future shapes of the collaborative network among organizations witch cope the COVID-19 in Korea. For this, this study conducted social network analysis, based on the response data of 73 experts from 36 COVID-19-related organizations. As a result of the analysis, it was confirmed that the Korea Disease Control and Prevention Agency (KDCA) plays a pivotal role as a control tower in coping COVID-19 in all of the analysis of degree, betweenness, and closeness centrality. In addition, the results revealed concrete forms of collaborative relationships among participating organizations in the public and private sectors that constitute the present and future networks centered on the KDCA. Furthermore, this study presented which organizations and relationships should be the focus of establishing a future collaborative network through comparative analysis between the current cooperative network and the network to be built in the future. The analysis results and discussions of this study are expected to be used as useful information for policy development related to collaborative networks that can effectively respond to disasters caused by new diseases in the future.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.581-592
• /
• 2016

WebRTC has quickly grown to be the world's advanced real-time communication in several platforms such as web and mobile. In spite of the advantage, the current technology in WebRTC does not handle a big-streaming efficiently between peers and a large amount request of users on the Signaling server. Therefore, in this paper, we put our work to handle the problem by delivering the flow of data with dynamical load balancing algorithms. We analyze the request source users and direct those streaming requests to a load balancing component. More specifically, the component determines an amount of the requested resource and available resource on the response server, then it delivers streaming data to the requesting user parallel or alternately. To show how the method works, we firstly demonstrate the load-balancing algorithm by using a network simulation tool OPNET, then, we seek to implement the method into an Ubuntu server. In addition, we compare the result of our work and the original implementation of WebRTC, it shows that the method performs efficiently and dynamically than the origin.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.3
• /
• pp.1-12
• /
• 2024

In this paper, we fine-tuned KoAlpaca, a large-scale Korean language model, and implemented a blog text generation system utilizing it. Blogs on social media platforms are widely used as a marketing tool for businesses. We constructed training data of positive reviews through emotion analysis and refinement of collected sponsored blog texts and applied QLoRA for the lightweight training of KoAlpaca. QLoRA is a fine-tuning approach that significantly reduces the memory usage required for training, with experiments in an environment with a parameter size of 12.8B showing up to a 58.8% decrease in memory usage compared to LoRA. To evaluate the generative performance of the fine-tuned model, texts generated from 100 inputs not included in the training data produced on average more than twice the number of words compared to the pre-trained model, with texts of positive sentiment also appearing more than twice as often. In a survey conducted for qualitative evaluation of generative performance, responses indicated that the fine-tuned model's generated outputs were more relevant to the given topics on average 77.5% of the time. This demonstrates that the positive review generation language model for sponsored content in this paper can enhance the efficiency of time management for content creation and ensure consistent marketing effects. However, to reduce the generation of content that deviates from the category of positive reviews due to elements of the pre-trained model, we plan to proceed with fine-tuning using the augmentation of training data.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.113-130
• /
• 2014

In this paper, we propose BLOCS algorithm to find sequence of data that should be saved in cache device of hybrid storage system which uses SSD as a cache device. BLOCS algorithm which uses a sequence pattern mining scheme, creates a set of frequently requested sectors with respect to requested order of sectors. To compare the performance of the proposed scheme, we introduce Distance (DIST) based scheme, Request Frequency (FREQ) based scheme, and Frequency times Size (F-S) based scheme. We measure the hit ratio and I/O latency of different caching schemes using hybrid storage caching simulator. We acquired booting workload along with ten scenarios of launching applications and use the workloads as input to the cache simulator. After experiment with booting workload, we find that BLOCS scheme gives hit ratio of 61% which is about 15% higher than the least performing DIST scheme.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.7
• /
• pp.283-290
• /
• 2015

In this paper, we propose a hybrid method for the recognition of answer types in the WiseQA system. The answer types are classified into two categories: the lexical answer type (LAT) and the semantic answer type (SAT). This paper proposes two models for the LAT detection. One is a rule-based model using question focuses. The other is a machine learning model based on sequence labeling. We also propose two models for the SAT classification. They are a machine learning model based on multiclass classification and a filtering-rule model based on the lexical answer type. The performance of the LAT detection and the SAT classification shows F1-score of 82.47% and precision of 77.13%, respectively. Compared with IBM Watson for the performance of the LAT, the precision is 1.0% lower and the recall is 7.4% higher.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.965-973
• /
• 2007

We analyzed that the loss of data in TCP protocol based wireless networks caused by overlapped responses in bi-directional nodes that were resulted in out of the data sequence. This loss can be prevented by using revised TCP rate control algorithm and the performance of throughput can also be improved. The rate control algorithm is applied when the congestion happens between nodes while traffic packets are retransmitting in TCP bandwidth. In addition to applying the rate control algorithm, we determine the number of system clients in bandwidth and the average of pausing time between transmitting serial files to produce a competitive level so that an efficient performance of rapid retransmitting for the loss of multi-packets. This paper discusses the improvement of congestion control in that the decrease of the loss, firstly, as ensuring an efficient connection rate and, secondly, as using sliding window flow control.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.53-64
• /
• 2005

Previous secure routing protocols for wireless sensor networks assume that a sink is static. In many cases, however, a sink operated by man or vehicle is moving. A mobile sink creates a lot of technical problems such as reconfiguration of routing path exposure of sink location. and selection of secure access point node, which are not considered by many previous researches. In this paper, we propose a new secure routing scheme for solving such problems using hi-directional hash chain and delegation nodes of grid structure. This scheme provides a secure routing path and prevents attacker from recognizing the location of a mobile sink in sensor networks. This new method reduces the resource requirements compared to the cashed routing schemes. Simulation results also show that the system is secure and efficient enough.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.171-181
• /
• 2013

Recently, ground penetrating radar(GPR) has been widely used in detecting metallic and nonmetallic buried landmines and a number of related researches have been reported. A novel preprocessing method is proposed in this paper to flag potential locations of buried mine-like objects from GPR array measurements. GPR operates by measuring the reflection of an electromagnetic pulse from discontinuities in subsurface dielectric properties. As the GPR pulse propagates in the geologic medium, it suffers nonlinear attenuation as the result of absorption and dispersion, besides spherical divergence. In the proposed algorithm, a logarithmic transformed regression model which successfully represents the time-varying signal amplitude of the GPR data is estimated at first. Then, background signals may be densely distributed near the regression model and candidate signals of targets may be far away from the regression model in the time-amplitude space. Based on the observation, GPR signals are decomposed into candidate signals of targets and background signals using residuals computed from the estimated value by regression and the measurement of GPR. Candidate signals which may contain target signals and noise signals need to be refined. Finally, targets are detected through the refinement of candidate signals based on geometric signatures of mine-like objects. Our algorithm is evaluated using real GPR data obtained from indoor controlled environment and the experimental results demonstrate remarkable performance of our mine-like object detection method.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.10 no.3 s.49
• /
• pp.101-111
• /
• 2006

This paper proposes a method for modeling new fault ground motion due to moderate size earthquakes in Stable Continental Regions (SCRs) for the first time. The near fault ground motion is characterized by a single long period velocity pulse of large amplitude. In order to model the velocity pulse, its period and peak amplitude need be determined in terms of earthquake magnitude and distance from the causative fault. Because there have been observed very few new fault ground motions, it is difficult to derive the model directly from the recorded data in SCRs. Instead an indirect approach is adopted in this work. The two parameters, the period and peak amplitude of the velocity pulse, are known to be functions of the rise time and the slip velocity. For Western United States (WUS) that belongs active tectonic regions, there art empirical formulas for these functions. The relations of rise time and slip velocity on the magnitude in SCRs are derived by comparing related data between Western United States and Central-Eastern United States that belongs to SCRs. From these relations, the functions of these pulse parameters for NFGM in SCRs can be expressed in terms of earthquake magnitude and distance. A time history of near fault ground motion of moderate magnitude earthquake in stable continental regions is synthesized by superposing the velocity pulse on the for field ground motion that is generated by stochastic method. As an demonstrative application, the response of a single degree of freedom elasto-plastic system is studied.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.