• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.109-115
• /
• 2016

Life log started with the simple purpose of recording or sharing mainly data regarding one's personal life, but with the introduction of advanced specialized analytic methods by many corporations, a new type of business based on the life log recently emerged, with an aim of improving the quality of people's personal lives. In spite of the indispensable advantages, however, personal health lifelog service brings critical challenges that cannot be avoided from user side if the security of the data is concerned. The problem of user's privacy infringement and leaking user's sensitive medical information is increasing with the revitalization of personal health lifelog services. In this paper, we propose an information security reference model for the personal health lifelog services. Our proposal can contribute to increase the related industry to cultivate new market by suggesting the clear announcement of the guidelines using privacy protection reference model for user-specific healthcare services which uses personal lifelog.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.12
• /
• pp.718-728
• /
• 2014

The multi-band wireless local area network (WLAN) using 60 GHz band and the lower band (typically 2.4 GHz/5 GHz band) can support the very high data rate in short-distance communication using 60 GHz band and the long-distance communication using the lower band. For heightening the efficiency of multi-band WLAN, an band selection scheme is a necessity. In this paper, we propose an effective frequency band selection scheme for multi-band WLANs. By using computer simulation with NS-3, we show the performance of the proposed schemes when the stations suffer from the human blockage and the log-normal shadowing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.671-678
• /
• 2005

This paper proposed symbol rate method which does not require a priori knowledge on the symbol rate and simplified modulation identification method to classify BPSK, QPSK, 8PSK signal. In order to estimate the unknown symbol rate, sliding FFT and simple moving average to estimate the spectrum of the signals is utilized, and sliding window and decimation, LPF blcok to estimate the proper symbol rate is used. Although conventional modulation ID method must use SNR value as the test statistics, the receiver cannot estimate the SNR value since the receiver cannot know the modulation type at the start of communication, and bit resolution is high due to using nonlinear function such as log, cosh. Therefore, we proposed the simplified fixed SNR value method. The performance of symbol rate estimation and modulation ID is shown using Monte Carlo computer simulation. This paper show that symbol rate estimation also has good performance in low SNR, and proposed simplified fixed SNR method has almost equivalent performance compared to conventional method.

• Journal of Internet of Things and Convergence
• /
• v.5 no.1
• /
• pp.35-39
• /
• 2019

With the rapid development of the information society, the use of digital devices has increased dramatically and the importance of technology for analyzing them has increased. Digital evidence is stored in many places such as Prefetch, Recent, Registry, and Event Log even if the user has deleted it. Therefore, there is a disadvantage that the forensic analyst can not grasp the files used by the user at the beginning. Therefore, in this paper, we propose a method that the RemoveList folder exists so that the user can grasp the information of the deleted file first, and the information about the deleted file is automatically saved by using AES in RemoveList. Through this, it can be expected that the analyst can alleviate the difficulty of initially grasping the user's PC.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.3
• /
• pp.115-124
• /
• 2005

When the application code is downloaded into the mobile device, it is important to provide authentication. Usually, mobile code execution is overlapped with downloading to reduce transfer delay. To the best of our knowledge, there has not been any algorithm to authenticate the mobile code in this environment. In this paper, we present two efficient code authentication schemes that permit overlapping of execution and downloading under the two cases: the first is when the order of transmission of code chunks is determined before the transmission and the second is when this order is determined during the transmission. The proposed methods are based on hash chaining and authentication trees, respectively. Especially, the latter scheme utilizes previously received authentication informations to verify the currently received chunk, which reduces both communication overhead and verification delay. When the application code consists of n chunks, communication overheads of the both schemes are 0(n) and verification delays of these two schemes are O(1) and O(log n), respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.6
• /
• pp.21-31
• /
• 2018

In Hyper-Connected Society, IoT-based Lifelog data is used throughout the Internet and is an important component of customized services that reflect user requirements. Also, Users are using social network services to easily express their interests and feelings, and various life log data are being accumulated. In this paper, Intelligent characters using IoT based lifelog data have been developed and qualitative/quantitative data are collected and analyzed in order to systematically grasp emotions of users. For this, qualitative data through the social network service used by the user and quantitative data through the wearable device are collected. The collected data is verified for reliability by comparison with the persona through esnography. In the future, more intelligent characters will be developed to collect more user life log data to ensure data reliability and reduce errors in the analysis process to provide personalized services.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.1-6
• /
• 2022

This paper deals with the maximum cardinality matching(MCM) problem. The augmenting path technique is well known in MCM. MCM is obtained by $O({\sqrt{n}}m)$ time complexity augmenting path algorithm for the general graph, and O(m log n) algorithm for the bipartite graph. On the other hand, this paper suggests O(n) linear time algorithm. The proposed algorithm based on the basic principle of as possible as largest selected inter-vertex edges in order to obtain the MCM. This paper simply selects edge {u,𝜐} that the minimum degree vertex u and minimum degree vertex 𝜐 in N_G(u) 𝜈(G)=k times iteration. For various general and bipartite graphs experimental data, this algorithm can be get the 𝜈(G) exactly.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.867-876
• /
• 2023

In this study, the attributes of the NHPP software development cost model applying the Gamma family distribution (Erlang, Log-Logistic, Rayleigh) were newly analyzed, and after comparing with the Goel-Okumoto basic model to verify the properties of the model, the optimal model was also presented based on this. To analyze software reliability, failure time data that occurred randomly during system operation was used, and the calculation of the parameters was solved using the maximum likelihood estimation. As a result of comprehensive evaluation through various attribute analysis (mean value function, development cost, optimal release time), it was confirmed that the Rayleigh model had the best performance. Through this study, the attributes of the software development cost model applying the Gamma family distribution, which has no previous research case, were newly identified. Also, basic design data could also be presented so that developers can efficiently utilize this research data at an early stage.

• International Journal of Computer Science & Network Security
• /
• v.24 no.8
• /
• pp.85-104
• /
• 2024

The DNA (Deoxyribonucleic Acid) database size increases tremendously transmuting from millions to billions in a year. Ergo for storing, probing the DNA database requires efficient lossless compression and encryption algorithm for secure communication. The DNA short pattern repetitions are of paramount characteristics in biological sequences. This algorithm is predicated on probing exact reiterate, substring substitute by corresponding ASCII code and engender a Library file, as a result get cumulating of the data stream. In this technique the data is secured utilizing ASCII value and engendering Library file which acts as a signature. The security of information is the most challenging question with veneration to the communication perspective. The selective encryption method is used for security purpose, this technique is applied on compressed data or in the library file or in both files. The fractional part of a message is encrypted in the selective encryption method keeping the remaining part unchanged, this is very paramount with reference to selective encryption system. The Huffman's algorithm is applied in the output of the first phase reiterate technique, including transmuting the Huffman's tree level position and node position for encryption. The mass demand is the minimum storage requirement and computation cost. Time and space complexity of Repeat algorithm are O(N²) and O(N). Time and space complexity of Huffman algorithm are O(n log n) and O(n log n). The artificial data of equipollent length is additionally tested by this algorithm. This modified Huffman technique reduces the compression rate & ratio. The experimental result shows that only 58% to 100% encryption on actual file is done when above 99% modification is in actual file can be observed and compression rate is 1.97bits/base.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.1-8
• /
• 2011

Traditional transactional memory systems are no longer able to guarantee the performance of diverse applications with overflowed transactions since there is the drawback that tracking the data for logging is difficult. Especially, this mechanism has a disadvantage of increasing communication delay for sustaining the state which is required to detect the conflict on the overflowed transactions from the first level cache in the transactional memory systems. To address this point, we have focused on the cache architecture of the systems to reduce the overhead caused by overflows and cache misses. In this paper, we present Supportive Cache which reduces additional overhead during transactions. Supportive Cache performs a parallel look-up with L1 private cache and uses the same replacement policy as L1 private cache. We evaluate the performance of the proposed design by comparing LogTM-SE with and without Supportive Cache. The simulation results show that our system improves the performance by 37% on average, compared to the original LogTM-SE which uses the same hardware resource.