• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.985-988
• /
• 1993

An alternative approach to the design of application-driven fuzzy systems is proposed. A broad class of fuzzy systems applications requires a certain fuzzy partition of the input space while it demands for simple numerical quantities. For this class, a dedicated fuzzy system archictecture is presented and a design strategy is proposed. Both the single-input/single-output and multi-input/multi-output cases are considered. Numerical analysis are complete illustrating several aspects of the proposed framework.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.495-512
• /
• 2006

Recently, researches on a future position prediction of moving objects have been progressed as the importance of the future position retrieval increases. New index structures are required to efficiently retrieve the consecutive positions of moving objects. Existing index structures significantly degrade the search performance of the moving objects because the search operation makes the unnecessary extension of the node in the index structure. To solve this problem, we propose a space partition based index structure considering the mobility of moving objects. To deal with the overflow of a node, our index structure first merges it and the sibling node. If it is impossible to merge them, our method splits the overflow node in which moving properties of objects are considered. Our index structure is always partitioned into overlap free subregions when a node is split. Our split strategy chooses the split position by considering the parameters such as velocities, the escape time of the objects, and the update time of a node. In the internal node, the split position Is determined from preventing the cascading split of the child node. We perform various experiments to show that our index structure outperforms the existing index structures in terms of retrieval performance. Our experimental results show that our proposed index structure achieves about $17%{\sim}264%$ performance gains on current position retrieval and about $107%{\sim}19l%$ on future position retrieval over the existing methods.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.253-257
• /
• 2000

the objective of this study is to design and evaluate a methodology for diagnosing the appendicitis in a fuzzy neural network that integrates the partition of input space by fuzzy entropy and the generation of fuzzy control rules and learning algorithm. In particular the diagnosis of appendicitis depends on the rule of thumb of the experts such that it associates with the region, the characteristics, the degree of the ache and the potential symptoms. In this scheme the basic idea is to realize the fuzzy rle base and the process of reasoning by neural network and to make the corresponding parameters of the fuzzy control rules be adapted by back propagation learning rule. To eliminate the number of the parameters of the rules, the output of the consequences of the control rules is expressed by the network's connection weights. As a result we obtain a method for reducing the system's complexities. Through computer simulations the effectiveness of the proposed strategy is verified for the diagnosis of appendicitis.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2471-2473
• /
• 2005

We present a receding horizon control [RHC] algorithm for compensation of backlash at the input of a stable linear system under control rate constraints. The problem is posed as a receding horizon optimal control [RHOptC] problem for a piecewise affine [PWA] system by modelling the backlash nonlinearity as a PWA system with a state space partition consisting of three regions. The RHC problem involves solving, at each step, $3^N$ quadratic programmes[QP], where N is the optimization horizon. This strategy leads, at the cost of some performance degradation, to much smaller computational load since a feasible rather than optimal solution has to be obtained at each step.

• Spatial Information Research
• /
• v.23 no.3
• /
• pp.113-122
• /
• 2015

Recently, according to developing advanced construction technologies, buildings has been enlarged such as high-rise buildings or complex buildings associated with underground facilities. The number of indoor activity population has increased very quickly. Because of that, technical requirements for Indoor location based service (Indoor LBS) also have been increased. Although indoor networks have to be constructed for efficient LBSs in indoor space based on OGC IndoorGML, it is not suitable for large and complex space to apply the simple network structure to constructing indoor navigation networks. The indoor navigation network has to be constructed according to logical, physical, and functional constraints for indoor space. In order to do that, subspacing methods are required to partition large and complex indoor space into proper size of subspace. In this paper, we proposed the basic requirements of subspacing in indoor space for creating efficient indoor network, as well the work process of subspacing in indoor space.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.558-564
• /
• 2018

In distributed estimation where each node can collect only partial information on the parameter of interest without communication between nodes and quantize it before transmission to a fusion node which conducts estimation of the parameter, we consider a novel quantization technique employed at local nodes. It should be noted that the performance can be greatly improved if each node can transmit its measurement to one designated node (namely, head node) which can quantize its estimate using the total rate available in the system. For this case, the best strategy at the head node would be simply to partition the parameter space using the generalized Lloyd algorithm, producing the global codewords, one of which is closest to the estimate is transmitted to a fusion node. In this paper, we propose an iterative design algorithm that seeks to efficiently assign the codewords into each of quantization partitions at nodes so as to achieve the performance close to that of the system with the head node. We show through extensive experiments that the proposed algorithm offers a performance improvement in rate-distortion perspective as compared with previous novel techniques.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.477-490
• /
• 2006

Existing index structures need very much update cost because they repeat delete and insert operations in order to update continuously moving objects. In this paper, we propose a new index structure which reduces the update cost of continuously moving objects. The proposed index structure consists of a space partitioning index structure that stores the location of the moving objects and an auxiliary index structure that directly accesses to their current positions. In order to increase the fanout of the node, it stores not the real partitioning area but kd-tree as the information about the child node of the node. In addition, we don't traverse a whole index structure, but access the leaf nodes directly and accomplish a bottom-up update strategy for efficiently updating the positions of moving objects. We show through the various experiments that our index structure outperforms the existing index structures in terms of insertion, update and retrieval.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1631-1637
• /
• 2019

In this paper, we propose a low-complexity robust maximum likelihood (ML) receiver for generalized spatial modulation. The proposed receiver performs the transmit antenna partition to lower the computational loads. After we divide the transmit antenna combinations into two parts, one of which is "the likely TAC part," and the other of which is "the unlikely TAC part", based on the minimum mean square error (MMSE) filtering output. We first perform the maximum likelihood detection only in the likely TAC part. Then we evaluate the reliability of the solution found in the first search, and based its reliability we decide whether we continue the search in the unlikely TAC part. This partitioned search strategy maintains the performance of the conventional robust maximum likelihood receiver and simultaneously lowers computational loads. Through simulation, we found that our newly-proposed receiver achieves considerable gains over the conventional robust ML detector in terms of the computational loads while providing almost the same performance.