• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.1
• /
• pp.37-42
• /
• 2003

In this paper a self-organizing fuzzy system with rule pruning is proposed. A conventional self-organizing fuzzy system having only rule generation has a drawback in generating many slightly different rules from the existing rules which results in increased computation time and slowly learning. The proposed self-organizing fuzzy system generates fuzzy rules based on input-output data and prunes redundant rules which are caused by parameter training. The proposed system has a simple structure but performs almost equivalent function to the conventional self-organizing fuzzy system. Also, this system has better learning speed than the conventional system. Simulation results on several numerical examples demonstrate the performance of the proposed system.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.88-92
• /
• 2023

Lithium-ion batteries are actively used in various industrial sites such as field robots, drones, and electric vehicles due to their high energy efficiency, light weight, long life span, and low self-discharge rate. When using a lithium-ion battery in a field, it is important to accurately estimate the SoC (State of Charge) of batteries to prevent damage. In recent years, SoC estimation using data-based artificial neural networks has been in the spotlight, but it has been difficult to deploy in the embedded board environment at the actual site because the computation is heavy and complex. To solve this problem, neural network lightening technologies such as network pruning have recently attracted attention. When pruning a neural network, the performance varies depending on which layer and how much pruning is performed. In this paper, we introduce an optimized pruning technique by improving the existing pruning method, and perform a comparative experiment to analyze the results.

• Journal of Forest and Environmental Science
• /
• v.24 no.1
• /
• pp.47-51
• /
• 2008

The first pruning works of planted trees on forest area carry out when tree height reached at 6 meters. And the second works carry out when it grow to 12~13 meters of tree height. Pruning works are necessary for producing straight log without knar by tool or machine. Generally, the mechanized pruning works Self-propelled pruning machine, chain pruning saw and other tools are used in mechanized pruning works. However, manual pruning saw which is usually using pruning tool was for this study. To investigate the pruning works efficiency, Pinus densiflora, Pinus koraiensis and Pinus rigida which were distributed in Kangwon-Do was surveyed. Height of surveyed the trees were 10~16 meters and its pruning works range were 6.2~6.7 meters of tree height. As results, pruning works efficiency of Pinus densiflora, Pinus koraiensis and Pinus rigida were 3.14 min/tree, 5.06 min/tree and 4.44 min/tree, respectively. Also, possible pruning works of man-day for Pinus densiflora, Pinus koraiensis and Pinus rigida was 104, 64, and 81 trees, respectively.

• Molecules and Cells
• /
• v.22 no.1
• /
• pp.89-96
• /
• 2006

"Determinate" and "indeterminate" inflorescences in plants are controlled by a single recessive gene, for example, SELF-PRUNING (SP) in Solanum lycopersicum, TERMINAL FLOWER1 in Arabidopsis, CENTRORADIALIS in Antirrhinum, and CENTRORADIALIS-like gene in tobacco. Pepper (Capsicum annuum L.) is an indeterminate species in which shoots grow indefinitely. In this study, we cloned and characterized the pepper SP-like gene (CaSP). RT-PCR revealed that the CaSP transcript accumulates to higher levels in floral buds than in other organs. Comparison of genomic DNA and cDNA sequences from indeterminate and determinate pepper plants revealed the insertion of a single base in the first exon of CaSP in the determinate pepper plants. CaSP is annotated in linkage group 8 (chromosome 6) of the SNU2 pepper genetic map and showed similar synteny to SP in tomato. Transgenic tobacco plants overexpressing CaSP displayed late-flowering phenotypes similar to the phenotypes caused by overexpression of CaSP orthologs in other plants. Collectively, these results suggest that pepper CaSP is an ortholog of SP in tomato.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.170-177
• /
• 2005

Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.

• Smart Structures and Systems
• /
• v.32 no.3
• /
• pp.179-193
• /
• 2023

This study explores an alternative to the existing centralized process for data anomaly detection in modern Internet of Things (IoT)-based structural health monitoring (SHM) systems. An edge intelligence framework is proposed for the early detection and classification of various data anomalies facilitating quality enhancement of acquired data before transmitting to a central system. State-of-the-art deep neural network pruning techniques are investigated and compared aiming to significantly reduce the network size so that it can run efficiently on resource-constrained edge devices such as wireless smart sensors. Further, depthwise separable convolution (DSC) is invoked, the integration of which with advanced structural pruning methods exhibited superior compression capability. Last but not least, quantization-aware training (QAT) is adopted for faster processing and lower memory and power consumption. The proposed edge intelligence framework will eventually lead to reduced network overload and latency. This will enable intelligent self-adaptation strategies to be employed to timely deal with a faulty sensor, minimizing the wasteful use of power, memory, and other resources in wireless smart sensors, increasing efficiency, and reducing maintenance costs for modern smart SHM systems. This study presents a theoretical foundation for the proposed framework, the validation of which through actual field trials is a scope for future work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.351-357
• /
• 2007

Numerous papers that study ad hoc networks have used a hierarchical network structure to enhance scalability. The hierarchical structure typically consists of a number of clusters, each of which has its own clusterhead that maintains information. Clusterheads often need to exchange information among themselves in order to maintain information, and for such cases, a mechanism is needed to efficiently deliver information from one clusterhead to another. Here, we proposed a new distributed algorithm in which every node independently makes the decision about whether or not it forwards a received message. We used a simulation to demonstrate that the algorithm developed for this study is a considerable improvement over the control overhead algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.725-728
• /
• 2011

멀티홉 네트워크에서 플러딩(Flooding) 기법은 토폴로지 내의 모든 노드에게 패킷을 전달하는 것이다. 대표적인 플러딩 기법인 Blind 플러딩은 패킷을 받은 모든 노드가 플러딩을 하기 때문에, 무선 네트워크의 전체적인 성능이 감소한다. 기존 연구에서는 성능 향상을 위해 중복 수신되는 패킷을 줄이는 데에만 초점이 맞춰져 있다. 하지만 실제 무선 네트워크 환경에서는 간섭에 따른 패킷 손실이 발생하고, 플러딩은 Broadcast 로 전송하기 때문에 재전송하여 손실 패킷을 복구할 수 없다. 본 논문에서는 Blind, Self-Pruning, Dominant-pruning 플러딩 기법에 재전송이 필요 없는 오류정정 기법(FEC)를 적용하여, 추가적인 잉여 데이터에 따른 전체 전송 패킷의 수와 플러딩 기법의 신뢰성을 분석 하였다.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.515-522
• /
• 2001

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Map(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented about k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.