• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.561-569
• /
• 2014

In wireless ad hoc networks, neighbor discovery is essential in the network initialization and the design of routing, topology control, and medium access control algorithms. Therefore, efficient neighbor discovery algorithms should be devised for self-organization in wireless ad hoc networks. In this paper, we propose a probabilistic neighbor discovery (PND) algorithm, which aims at reducing the neighbor discovery time by adjusting the transmission probability of advertisement messages through the multiplicative-increase/multiplicative-decrease (MIMD) policy. To further improve PND, we consider the collision detection (CD) capability in which a device can distinguish between successful reception and collision of advertisement messages. Simulation results show that the transmission probabilities of PND and PND with CD converge on the optimal value quickly although the number of devices is unknown. As a result, PND and PND with CD can reduce the neighbor discovery time by 15.6% to 57.0% compared with the ALOHA-like neighbor discovery algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1373-1381
• /
• 2013

The purpose of this study was to examine the level of job stress and depression, and to find the associated domains of job stress with depression among local public officials. The study subjects consist of 734 local public officials in Seogu, Gwang Ju. A structure self-reported questionnaire was composed of general and job-related characteristics, job stress(KOSS), and depression(CES-D). The use statistical methods were t-test, ANOVA, Pearson's correlation analysis and multiple logistic regression analysis. The total score of job stress was $44.38{\pm}7.96$ and the score of depression was $14.46{\pm}10.19$. The result of multiple logistic regression analysis was shown that the three domains of job stress including job demand, job insecurity and lack of reward were associated with the depression.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.757-764
• /
• 2012

This research is for comparison of test statistics for homogeneity when the data is collected based on complex sample design. The survey data based on complex sample design does not satisfy the condition of independency which is required for the standard Pearson multinomial-based chi-squared test. Today, lots of data sets ara collected by complex sample designs, but the tests for categorical data are conducted using the standard Pearson chi-squared test. In this study, we compared the performance of three test statistics for homogeneity between two populations using data from the 2009 customer satisfaction evaluation survey to the service from Gyeongsangnam-do regional offices of education: the standard Pearson test, the unbiasedWald test, and the Pearsontype test with survey-based point estimates. Through empirical analyses, we fist showed that the standard Pearson test inflates the values of test statistics very much and the results are not reliable. Second, in the comparison of Wald test and Pearson-type test, we find that the test results are affected by the number of categories, the mean and standard deviation of the eigenvalues of design matrix.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.2
• /
• pp.209-214
• /
• 2018

The subway, which is an urban railway, is the core of public transportation. Urban railways are always exposed to serious problems such as theft, crime and terrorism, as many passengers use them. Especially, due to the nature of urban railway environment, the scope of surveillance is widely dispersed and the range of surveillance target is rapidly increasing. Therefore, it is difficult to perform comprehensive management by passive surveillance like existing CCTV. In this paper, we propose the implementation, design method and object recognition algorithm for intelligent object recognition system in urban railway. The object recognition system that we propose is to analyze the camera images in the history and to recognize the situations where there are objects in the landing area and the waiting area that are not moving for more than a certain time. The proposed algorithm proved its effectiveness by showing detection rate of 100% for Selected area detection, 82% for detection in neglected object, and 94% for motionless object detection, compared with 84.62% object recognition rate using existing Kalman filter.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.4
• /
• pp.987-997
• /
• 2018

Blockchain has tamper-free, so many applications are developing to leverage tamper-free features of blockchain. MIT Media Labs proposed BlockCerts, educational certificate blockchain System, to solve problems of legacy certificate verifications. Existing educational certificate blockchain Systems are based on public blockchain such as bitcoin, Ethereum, so any entity can participate educational institute in principal. Moreover, the exisitng educational certricate blockchain system utilizes the integrity of blockchain, but the confidentiality of the educational certificate is not provided. This paper propose a digital certificate system based on private blockchain, name HyperCerts. Therefore, only trusted entity can participate in the private blockchain network, Hyperledger, as the issuer of digital certificate. Furthermore, the practical byzantine fault tolerance is used as consensus algorithm, HyperCerts reduce dramatically the latency of issuing digital certificate and required computing power. HyperCerts stores the hash value of digital certificate into the ledger, so breach of personal information by malicious entity in the private blockchain is protected.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.366-369
• /
• 2005

Background subtraction is mainly used for the real-time extraction and tracking of moving objects from image sequences. In the outdoor environment, there are many changeable factor such as gradually changing illumination, swaying trees and suddenly moving objects, which are to be considered for the adaptive processing. Normally, GMM(Gaussian Mixture Model) is used to subtract the background adaptively considering the various changes in the scenes, and the adaptive GMMs improving the real-time performance were worked. This paper, for on-line background subtraction, applied the improved adaptive GMM, which uses the small constant for learning rate ${\alpha}$ and is not able to speedily adapt the suddenly movement of objects, So, this paper proposed and evaluated the dynamic control method of ${\alpha}$ using the adaptive selection of the number of component distributions and the global variances of pixel values.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.913-921
• /
• 2012

The current PC-based desktop environment is being converted into server-based virtual desktop environment due to security, mobility, and low upgrade cost. In this paper, a desktop virtualization system is implemented using an open source-based cloud computing platform and hypervisor. The implemented system is applied to the virtualziation of computer in university. In order to reduce the image transfer time, we propose a solution using HDFS. In addition, an image management structure needed for desktop virtualization is designed and implemented, and applied to a real computer lab which accommodates 30 PCs. The performance of the proposed system is evaluated in various aspects including implementation cost, power saving rate, reduction rate of license cost, and management cost. The experimental results showed that the proposed system considerably reduced the image transfer time for desktop service.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.655-664
• /
• 2002

In many data-parallel applications massive parallelism can be easily extracted through data distribution. But it often causes very long communication latency. This paper shows that task parallelism, which is extracted from data-parallel programs, can be exploited to hide such communication latency Unlike the most previous researches over exploitation of task parallelism which has not been considered together with data parallelism, this paper describes exploitation of task parallelism in the context of data parallelism. PCFG(Parallel Control Flow Graph) is proposed to represent a multithreaded program consisting of a few task threads each of which can include a few data-parallel loops. It is also described how a PCFG is constructed from a source data-parallel program through HDG(Hierarchical Dependence Graph) and how the multithreaded program can be constructed from the PCFG.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.533-543
• /
• 2003

With the increase of interests in cluster, there have been a number of research efforts to address the high availability issues on cluster. However, there are no kernel-level group communication systems to support the development of kernel-level application programs and it is not easy to use traditional user-level group communication systems for the kernel-level applications. This paper presents the design and implementation issues of KCGCS(Kernel-level Cluster Group Communication System), which is a kernel-level group communication module for linux cluster. Unlike traditional user-level group communication systems, the KCGCS uses light-weight heartbeat messages and a ring-based heartbeat mechanism, which allows users to implement scalable failure detection mechanisms. Moreover, the KCGCS improves the reliability by using distributed coordinators to maintain membership information.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.539-549
• /
• 2002

PC cluster-based Information Retrieval (IR) systems improve their performances by parallel processing of query terms using cluster nodes. However TCP/IP based communication used to exchange data between cluster nodes prevents the performance from being improved further. The user-level communication mechanisms solve the problem by eliminating the time-consuming kernel access in exchanging data between cluster nodes. The Virtual Interface Architecture (VIA) is one of the representative user-level communication mechanisms which provide low latency and high bandwidth. In this paper, we propose a VIA-based parallel IR system on a PC cluster. The IR system is implemented using the following three communication methods: Sealable Coherent Interface (SCI) based VIA, MPI on SCI based VIA, MPI on Fast Ethernet based VIA. Through experiments, the performances of the three methods are analyzed in various aspects.