• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• pp.40-44
• /
• 1995

In this paper, we propose a retrieval system using knowledges of database expressed linguistically, where the relation between data are constructed by FCM. Several algorithms have been proposed to solve the major problem in the conventional retrieval system that the system doesn't reply in case of no data equal to user's query, and to express knowledge of database linguistically. This paper proposes the improved method of adding new cluster and the method of retrieving database from user's query. The validity of this retrieval system is shown by applying its algorithm to an example : the mail order service in post office.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.3
• /
• pp.587-593
• /
• 2012

We study Bayesian estimates for finite population proportions in multinomial problems. To do this, we consider a three-stage hierarchical Bayesian model. For prior, we use Dirichlet density to model each cell probability in each cluster. Our method does not require complicated computation such as Metropolis-Hastings algorithm to draw samples from each density of parameters. We draw samples using Gibbs sampler with grid method. We apply this algorithm to a couple of simulation data under three scenarios and we estimate the finite population proportions using two kinds of approaches We compare results with the point estimates of finite population proportions and their standard deviations. Finally, we check the consistency of computation using differen samples drawn from distinct iterates.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.197-200
• /
• 2008

In most sensor networks, nodes can be easily compromised by adversaries due to hostile environments. Adversaries may use compromised nodes to inject false reports into the sensor networks. Such false report attacks will cause false alarms that can waste real-world response effort, and draining the finite amount of energy resource in the battery-powered network. A dynamic enroute scheme proposed by Yu and Guan can detect and drop such false reports during the forwarding phase. In this scheme, choosing a threshold value is very important, as it trades off between security power and energy consumption. In this paper, we propose a threshold determining method which uses the fuzzy rule-based system. The base station periodically determines a threshold value though the fuzzy rule-based system. The number of cluster nodes, the value of the key dissemination limit, and the remaining energy of nodes are used to determine the threshold value.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.225-230
• /
• 2003

In this paper, we develope algorithms that distribute the load on the heterogeneously clustered web system, The response time based on the concurrent user is examined for the suggested algorithms. Simulation experience shows that the response time using the dynamically weighted methods seems to have a good results compare to that with the fixed weighted methods. And, also the effectiveness of clustered system becomes better as long as the number of concurrent user increases.

• Journal of Korea Multimedia Society
• /
• v.12 no.12
• /
• pp.1769-1777
• /
• 2009

With the advent of the ubiquitous technology age, the progress of network technology has enabled a robust sensor communication, not just in cities, but also in poor surroundings such as deserts, polar regions, or underwater environments. In this paper, we propose a Multiple Acknowledgement (MA) technique to replace the conventional Automatic Repeat request (ARQ) technique. The MA mechanism is to send an Ack to many receivers simultaneously. The CH (master, coordinator) of the unit cluster broadcasts a Beacon frame where Ack information of the previously transmitted data is included. This technique can reduce the number of transmissions and overhead significantly. The proposed technique is a scheme improving the efficiency of an underwater sensor network where the uplink data transmission is the mainstream. The Performance of the ARQ, Block Ack, Pervasive Block Ack and the proposed method were compared with one another and analyzed. The proposed method showed significant performance improvement as compared with the ARQ, BA, and PBA in its channel efficiency.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.109-116
• /
• 2005

In this paper, we investigate the visual and quantitative analysis at the same time with an electronic tongue(e-tongue) system using an array of ISE(ion-selective electrode). We apply the FCM(fuzzy c-means) algorithm combined with PCA(principal component analysis), which can be reduced multi-dimensional data to third-dimensional data, to classify data patterns detected by E-Tongue system. The proposed technique can be designed to solve the cluster centers and membership grade of patterns combined with the output results obtained by PCA method. According to the proposed technique, the membership grade of unknown pattern, which does not shown previously can be determined and analyzed visually. Conclusionally, the relationship between the standard patterns and unknown pattern can be easily analyzed. Throughout the experimental trials, the proposed technique has been confirmed using developed E-Tongue system.

• Korean Journal of Remote Sensing
• /
• v.8 no.1
• /
• pp.15-26
• /
• 1992

This paper describes an implementation of adaptive stereo matching for DBM generation. The matching method of two stereo satellite images to find corresponding points used in this paper is area-based matching, which is usually used in the field of making DBM. Same window size and search area used as in the conventional matching methods and we propose adaptive stereo matching algorithm in this paper. We cluster three areas which are consist of mountainous areas, cultivated areas and cities, and rivers and lakes by using proposed linear feature extracting method. These classified areas are matched by adaptive window size and search area, but rivers and lakes is excluded in this experiment. The matching time is three times faster than conventional methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.49
• /
• pp.11-21
• /
• 1999

The purpose of this study is to present the method to select optimal size for the industrial products which are closely related to human's body size. For this purpose, human factors such as body characteristics, body features, and preference in product selection which needs to be considered in setting standards were analyzed. This analysis is to select optimal size to minimize losses caused by the difference of size between demand by the customers and supply from the manufacturers. Using loss function, repetitive calculation process algorithm by using bisearch method was applied in selecting the sizes of demand and supply which minimize the total expected losses. For cumulative normal distribution probability, IMSL routine DNORDF was used. In case study, comparison has been made between the result which was calculated using presented algorithm and the results calculated by the process currently used by KS and ISO by measuring aged women's body size in human factors side and sorting them through the factor analysis and cluster analysis for feature factor extraction. Thus, they can be used as a basis for establishing industrial product standards.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.410-421
• /
• 2019

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

• Journal of Korea Game Society
• /
• v.19 no.5
• /
• pp.5-14
• /
• 2019

This paper proposes a remote partitioned rendering method for displaying 3D applications on large tiled displays, which were developed using the Unity game engine. With the proposed method, one can represent them without additional development or any modifications to the applications. The paper verifies its feasibility by applying to a sample Unity-based application.