• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.85-93
• /
• 1984

In the paper, a new constructive initial placement algorithm is proposed in computer aided layout design in LSI. An useful object function are proposed to place the modules in logic design diagram laid down by manual to the fixed chip, reflecting the relative positions between modules and cells, and then an initial placement are determined by the function. In order to show the usefulness of the proposed method, it was compared with clustering development method in maximum cut numbers and total routing lengths by program experiments.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.114-122
• /
• 2000

This paper proposes a classification method using an amorphous Prototype to minimize classification error caused by such fixed-Prototype-based methods as Fuzzy C-Means, Nearest Neighborring Classification, FMMCNN, and Fuzzy-ART. For this method, a new fuzzy neural network is introduced, in which a convex polytope is generated or adaptively reshaped to classify the given datum into a proper group. Thus, this method contains a function to classify sequential data set. To show the validity of this method, various numerical experiments including comparison results with FMMCNN are presented

• Journal of KIISE:Databases
• /
• v.28 no.1
• /
• pp.69-85
• /
• 2001

공간 데이터베이스에서 효율적으로 공간 질의를 처리하기 위해서는 클러스터링을 통해서 이스크 접근 비용을 줄이는 것이 필요하다. 이 논문은 공간 지역성에 기반을 둔 여러 가지 클러스터링 알고리즘을 제안하고 실험을 통해 제안한 클러스터링 알고리즘의 성능을 평가하였다. 이 논문에서 제안하는 클러스터링 알고리즘은 객체 클러스터링 알고리즘과 셀 클러스터링 알고리즘으로 나뉜다. 객체 클러스터링 알고리즘은 정규 준할 공간 색인 구조에서 영역 분할 선과 겹치는 객체들의 저장 위치를 결정하는데 사용된다. 셀 클러스터링 알고리즘은 클러스터를 만들기 위해 정규 분할된 영역들을 그룹화하는데 사용된다. 실험결과 객체 클러스터링 알고리즘에서는 객체간의 거리를 이용한 경우에 대체로 좋은 성능을 보였지만, 버퍼 크기가 커지거나 데이터가 희박한 영역의 질의에 있어서는 알고리즘 별로 성능의 차이는 거의 없었다. 셀 클러스터링 알고리즘에 대한 실험에서는 이 논문에서 제안한 클러스터링 알고리즘은 N-순서화 기법에 의한 클러스터링 알고리즘에 비해 우수한 성능을 보였다. 특히 중복 참조도를 이용한 경우와 셀의 무게 중심간 거리를 이용한 방법이 가장 우수하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1098-1104
• /
• 2010

Recently, a variety of research of multi-hop routing protocol have been done to balance the sensor node energy consumption of WSN(wireless sensor network) and to improve the node efficiency for extending the life of the entire network. Especially in multi-hop protocol, a variety of models have been concerned to improve energy efficiency and apply in the reality. In multi-hop protocol, we assumption that energy consumption can be adjusted based on the distance between the sensor nodes. However, according to the physical property of the actual WSN, it's hard to establish this assumption. In this dissertation, we propose low-power sub-cluster protocol to improve the energy efficiency based on the spread of distance. Compared with the previous protocols, this proposed protocol can be effectively used in the wireless sensing networks.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1058-1065
• /
• 2014

In order to assist user's who are in the process of executing a search, a query expansion method suggests keywords that are related to an input query. Recently, several studies have suggested keywords that are identified by finding domains using a clustering method over the documents that are retrieved. However, the clustering method is not relevant when presenting various domains because the number of clusters should be fixed. This paper proposes a method that suggests keywords by finding various domains related to the input queries by using a community detection algorithm. The proposed method extracts words from the top-30 documents of those that are retrieved and builds communities according to the word graph. Then, keywords representing each community are derived, and the represented keywords are used for the query expansion method. In order to evaluate the proposed method, we compared our results to those of two baseline searches performed by the Google search engine and keyword recommendation using TF-IDF in the search results. The results of the evaluation indicate that the proposed method outperforms the baseline with respect to diversity.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.210-222
• /
• 2011

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.10
• /
• pp.941-948
• /
• 2016

In this paper, we efficiently simulated for collecting the data from the fixed sensor and mobile sensor of patients using the LEACH-Mobile method. The LEACH-Mobile method is the protocol to increase the mobility by adding the mobile node to the existed LEACH(:Low Energy Adaptive Clustering Hierarchy) protocol. It improves the mobility of The LEACH-Mobile in the LEACH, however it consumes more energy than the existed LEACH. There is reason why we use the LEACH-Mobile that the monitoring system is generally done by the CCTV and an periodic checkup by nurses. However the number of nurse is a few in the most of hospital. It can happen the accidents of the patients in out of the CCTV when the nurse can not see the monitoring system in the hospital. Therefore it is simulated to continuously gather the data of the position and sensors in the five situation of moving the patients in the hospital, it gets the result that the management of the mobile patients is more efficient.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.5
• /
• pp.1-12
• /
• 2000

In this paper we propose a design method of the adaptive fuzzy controller for autonomous navigation of mobile robots based on the fuzzy theory. We present two improvements. First, unnecessary rules in the fuzzy inference process make data processing time increase. We reduce this data processing time by generating suitable fuzzy inference rules and membership functions according to the current state of a mobile robot. It is implemented with the clustering method using input and output data pairs, and then it is possible for a mobile robot to navigate in shorter processing time with less fuzzy inference rules. Second, existing algorithms used fixed membership functions of input and output variables, hence converged slowly. We improve convergence time via scaling membership functions generated by the clustering method. To evaluate and compare the performance of the proposed method with the existing fuzzy navigation controller, computer simulations and navigation experiments of a mobile robot are Presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.845-854
• /
• 2008

In this paper, we propose a clustering algorithm for efficient energy management of sensor network consisted of sensor nodes that have restricted energy to solve these problem. Proposed algorithm improves energy efficiency by controlling sensing power. And it has distinctive feature that is applied in various network environment. The performance evaluation result shows that the energy efficiency is improved by 5% in the case of all sensor node fixed and by $10{\sim}15%$ in the case of all sensor node moving. It is confirmed through experiment process that the proposed algorithm brings energy efficiency ratio improvement of $5{\sim}15%$ more than the existing algorithm. Proposed algorithm derived an upper bound on the energy efficiency for Ubiquitous Computing environment that have various network environment that is with ZigBee technology of IEEE 802.15.4 bases. Also, we can blow bring elevation for lifetime of sensor network greatly for lifetime of sensor node as is small. And we think that may expand practical use extent of a sensor network technology more in fast changed network environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.141-150
• /
• 2011

In this paper, we propose a Cross-Layer Cooperative Routing(CLCR) architecture to support transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed architecture and method are as follows. First, the clustering which uses the location information of nodes is utilized as infrastructure. Second, a cross-layer strategy which uses the technologies of network layer, MAC layer, physical layer together to support transmission efficiency and channel efficiency for cooperative-aided routing and transmission. Third, we consider realistic approach in the view points of the mobile ad-hoc wireless sensor networks while conventional methods just consider fixed sensor network environments. The performance evaluation of the proposed method is performed via simulation using OPNET and theoretical analysis. The results of performance evaluation of the proposed CLCR show improvement of transmission efficiency by the proposed CLCR.