• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.238-243
• /
• 2007

The TAM(Topographic Attentive Mapping) network neural network model is an especially effective one for pattern analysis. It is composed of of Input layer, category layer, and output layer. Fuzzy rule, lot input and output data are acquired from it. The TAM network with three pruning rules for reducing links and nodes at the layer is called fuzzy TAM network. In this paper, we apply fuzzy TAM network to pattern analysis of leadership type for organizational leader and show its usefulness. Here, criteria of input layer and target value of output layer are the value and leadership related personality type variables of the Egogram and Enneagram, respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.1
• /
• pp.86-93
• /
• 2006

The TAM(Topographic Attentive Mapping) network based on a biologically-motivated neural network model is an especially effective one for pattern analysis. It is composed of of input layer, category layer, and output layer. Fuzzy rule, for input and output data are acquired from it. The TAM network with three pruning rules for reducing links and nodes at the layer is called fuzzy TAM network. In this paper, we apply fuzzy TAM network to pattern analysis of core competency model for subcontractors of construction companies and show its usefulness.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.1
• /
• pp.33-51
• /
• 2002

A fully connected Artificial Neural Network (ANN) contains many connections. Compared to the pruned ANN with fewer connections, the fully connected ANN takes longer time to produce solutions end may not provide appropriate solutions to new unseen date. Therefore, by reducing the sloe of ANN, we can overcome the overfitting problem and increase the computing speed. In this research, we reduced the size of ANN by destroying the connections. In other words, we investigated the performance change of the reduced ANN by systematically destroying the connections. Then we found the acceptable level of connection-destruction on which the resulting ANN Performs as well as the original fully connected ANN. In the previous researches on the sloe reduction of ANN, the reduced ANN had to be retrained every time some connections were eliminated. Therefore, It tool lolly time to obtain the reduced ANN. In this research, however, we provide the acceptable level of connection-destruction according to the size of the fully connected ANN. Therefore, by applying the acceptable level of connection-destruction to the fully connected ANN without any retraining, the reduced ANN can be obtained efficiently.

• Child Health Nursing Research
• /
• v.25 no.4
• /
• pp.458-467
• /
• 2019

Purpose: The purpose of this study was to identify human papillomavirus (HPV) vaccination research trends by visualizing a keyword network. Methods: Articles about HPV vaccination were retrieved from the PubMed and Web of Science databases. A total of 1,448 articles published in 2006~2016 were selected. Keywords from the abstracts of these articles were extracted using the text mining program WordStat and standardized for analysis. Sixty-four keywords out of 287 were finally chosen after pruning. Social network analysis using NetMiner was applied to analyze the whole keyword network and the betweenness centrality of the network. Results: According to the results of the social network analysis, the central keywords with high betweenness centrality included "health education", "health personnel", "parents", "uptake", "knowledge", and "health promotion". Conclusion: To increase the uptake of HPV vaccination, health personnel should provide health education and vaccine promotion for parents and adolescents. Using social media, governmental organizations can offer accurate information that is easily accessible. School-based education will also be helpful.

• Korean Journal of Biological Psychiatry
• /
• v.6 no.1
• /
• pp.12-20
• /
• 1999

In order to understand the pathogenesis and progression of some synaptic loss related neuropsychiatric diseases, We attempted to develop a computer model in this study. We made a simple autoassociative memory network remembering numbers, transformed it into a disease model by pruning synapses, and measured its memory performance as a function of synaptic deletion. Decline in performance was measured as amount of synaptic loss increases and its mode of decline is sudden or gradual according to the mode of synaptic pruning. The developed computer model demonstrated how synaptic loss could cause memory impairment through a series of computer simulations, and suggested a new way of research in neuropsychiatry.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of Broadcast Engineering
• /
• v.25 no.2
• /
• pp.200-207
• /
• 2020

Recently, deep neural networks such as CNN are showing excellent performance in various fields such as image classification, object recognition, visual quality enhancement, etc. However, as the model size and computational complexity of deep learning models for most applications increases, it is hard to apply neural networks to IoT and mobile environments. Therefore, neural network compression algorithms for reducing the model size while keeping the performance have been being studied. In this paper, we apply few compression methods to CNN models and evaluate their performances in the embedded environment. For evaluate the performance, the classification performance and inference time of the original CNN models and the compressed CNN models on the image inputted by the camera are evaluated in the embedded board equipped with QCS605, which is a customized AI chip. In this paper, a few CNN models of MobileNetV2, ResNet50, and VGG-16 are compressed by applying the methods of pruning and matrix decomposition. The experimental results show that the compressed models give not only the model size reduction of 1.3~11.2 times at a classification performance loss of less than 2% compared to the original model, but also the inference time reduction of 1.2~2.21 times, and the memory reduction of 1.2~3.8 times in the embedded board.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.406-409
• /
• 2008

Clustering data streams has an importance over many applications like sensor networks. Existing hierarchical methods follow a semi fuzzy clustering that yields duplicate clusters. In order to solve the problems, we propose an extended online divisive agglomerative clustering on data streams. It builds a tree-like top-down hierarchy of clusters that evolves with data streams using geometric time frame for snapshots. It is an enhancement of the Online Divisive Agglomerative Clustering (ODAC) with a pruning strategy to avoid duplicate clusters. Our main features are providing update time and memory space which is independent of the number of examples on data streams. It can be utilized for clustering sensor data and network monitoring as well as web click streams.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.1226-1228
• /
• 2022

FHD 이상을 넘어선 UHD급의 고해상도 동영상 콘텐츠의 수요 및 공급이 증가함에 따라 전반적인 산업 영역에서 네트워크 자원을 효율적으로 이용하여 동영상 콘텐츠를 제공하는 데에 관심을 두게 되었다. 기존 방법을 통한 bi-cubic, bi-linear interpolation 등의 방법은 딥 러닝 기반의 모델에 비교적 인풋 이미지의 특징을 잘 잡아내지 못하는 결과를 나타내었다. 딥 러닝 기반의 초 해상화 기술의 경우 기존 방법과 비교 시 연산을 위해 더 많은 자원을 필요로 하므로, 이러한 사용 조건에 따라 본 논문은 초 해상화가 가능한 딥 러닝 모델을 경량화 기법을 사용하여 기존에 사용된 모델보다 비교적 적은 자원을 효율적으로 사용할 수 있도록 연구 개발하는 데 목적을 두었다. 연구방법으로는 structure pruning을 이용하여 모델 자체의 구조를 경량화 하였고, 학습을 진행해야 하는 파라미터를 줄여 하드웨어 자원을 줄이는 연구를 진행했다. 또한, Residual Network의 개수를 줄여가며 PSNR, LPIPS, tOF등의 결과를 비교했다.