• Title/Summary/Keyword: Relative network

Search Result 851, Processing Time 0.029 seconds

A New Unsupervised Learning Network and Competitive Learning Algorithm Using Relative Similarity (상대유사도를 이용한 새로운 무감독학습 신경망 및 경쟁학습 알고리즘)

  • 류영재;임영철
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.203-210
    • /
    • 2000
  • In this paper, we propose a new unsupervised learning network and competitive learning algorithm for pattern classification. The proposed network is based on relative similarity, which is similarity measure between input data and cluster group. So, the proposed network and algorithm is called relative similarity network(RSN) and learning algorithm. According to definition of similarity and learning rule, structure of RSN is designed and pseudo code of the algorithm is described. In general pattern classification, RSN, in spite of deletion of learning rate, resulted in the identical performance with those of WTA, and SOM. While, in the patterns with cluster groups of unclear boundary, or patterns with different density and various size of cluster groups, RSN produced more effective classification than those of other networks.

  • PDF

Feature Extraction of Letter Using Pattern Classifier Neural Network (패턴분류 신경회로망을 이용한 문자의 특징 추출)

  • Ryoo Young-Jae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.2
    • /
    • pp.102-106
    • /
    • 2003
  • This paper describes a new pattern classifier neural network to extract the feature from a letter. The proposed pattern classifier is based on relative distance, which is measure between an input datum and the center of cluster group. So, the proposed classifier neural network is called relative neural network(RNN). According to definitions of the distance and the learning rule, the structure of RNN is designed and the pseudo code of the algorithm is described. In feature extraction of letter, RNN, in spite of deletion of learning rate, resulted in the identical performance with those of winner-take-all(WTA), and self-organizing-map(SOM) neural network. Thus, it is shown that RNN is suitable to extract the feature of a letter.

Development of Road-Following Controller for Autonomous Vehicle using Relative Similarity Modular Network (상대분할 신경회로망에 의한 자율주행차량 도로추적 제어기의 개발)

  • Ryoo, Young-Jae;Lim, Young-Cheol
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.5
    • /
    • pp.550-557
    • /
    • 1999
  • This paper describes a road-following controller using the proposed neural network for autonomous vehicle. Road-following with visual sensor like camera requires intelligent control algorithm because analysis of relation from road image to steering control is complex. The proposed neural network, relative similarity modular network(RSMN), is composed of some learning networks and a partitioniing network. The partitioning network divides input space into multiple sections by similarity of input data. Because divided section has simlar input patterns, RSMN can learn nonlinear relation such as road-following with visual control easily. Visual control uses two criteria on road image from camera; one is position of vanishing point of road, the other is slope of vanishing line of road. The controller using neural network has input of two criteria and output of steering angle. To confirm performance of the proposed neural network controller, a software is developed to simulate vehicle dynamics, camera image generation, visual control, and road-following. Also, prototype autonomous electric vehicle is developed, and usefulness of the controller is verified by physical driving test.

  • PDF

Relative Error Compensation of Robot Using Neural Network (신경 회로망을 이용한 로봇의 상대 오차 보상)

  • Kim, Yeon-Hoon;Jeong, Jae-Won;Kim, Soo-Hyun;Kwak, Yoon-Keun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.7
    • /
    • pp.66-72
    • /
    • 1999
  • Robot calibration is very important to improve the accuracy of robot manipulators. However, the calibration procedure is very time consuming and laborious work for users. In this paper, we propose a method of relative error compensation to make the calibration procedure easier. The method is completed by a Pi-Sigma network architecture which has sufficient capability to approximate the relative relationship between the accuracy compensations and robot configurations while maintaining an efficient network learning ability. By experiment of 4-DOF SCARA robot, KIRO-3, it is shown that both the error of joint angles and the positioning error of end effector are drop to 15$\%$. These results are similar to those of other calibration methods, but the number of measurement is remarkably decreased by the suggested compensation method.

  • PDF

Compensation Control of Mechanical Deflection Error on SCARA Robot with Constant Pay Load Using Neural Network (일정한 가반 하중이 작용하는 스카라 로봇에 대한 신경망을 이용한 기계적 처짐 오차 보상 제어)

  • Lee, Jong-Shin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.7
    • /
    • pp.728-733
    • /
    • 2009
  • This paper presents the compensation of mechanical deflection error in SCARA robot. End of robot gripper is deflected by weight of arm and pay-load. If end of robot gripper is deflected constantly regardless of robot configuration, it is not necessary to consider above mechanical deflection error. However, deflection in end of gripper varies because that moment of each axis varies when robot moves, it affects the relative accuracy. I propose the compensation method of deflection error using neural network. FEM analysis to obtain the deflection of gripper end was carried out on various joint angle, the results is used in neural network teaming. The result by simulation showed that maximum relative accuracy reduced maximum 9.48% on a given working area.

Accelerated Monte Carlo analysis of flow-based system reliability through artificial neural network-based surrogate models

  • Yoon, Sungsik;Lee, Young-Joo;Jung, Hyung-Jo
    • Smart Structures and Systems
    • /
    • v.26 no.2
    • /
    • pp.175-184
    • /
    • 2020
  • Conventional Monte Carlo simulation-based methods for seismic risk assessment of water networks often require excessive computational time costs due to the hydraulic analysis. In this study, an Artificial Neural Network-based surrogate model was proposed to efficiently evaluate the flow-based system reliability of water distribution networks. The surrogate model was constructed with appropriate training parameters through trial-and-error procedures. Furthermore, a deep neural network with hidden layers and neurons was composed for the high-dimensional network. For network training, the input of the neural network was defined as the damage states of the k-dimensional network facilities, and the output was defined as the network system performance. To generate training data, random sampling was performed between earthquake magnitudes of 5.0 and 7.5, and hydraulic analyses were conducted to evaluate network performance. For a hydraulic simulation, EPANET-based MATLAB code was developed, and a pressure-driven analysis approach was adopted to represent an unsteady-state network. To demonstrate the constructed surrogate model, the actual water distribution network of A-city, South Korea, was adopted, and the network map was reconstructed from the geographic information system data. The surrogate model was able to predict network performance within a 3% relative error at trained epicenters in drastically reduced time. In addition, the accuracy of the surrogate model was estimated to within 3% relative error (5% for network performance lower than 0.2) at different epicenters to verify the robustness of the epicenter location. Therefore, it is concluded that ANN-based surrogate model can be utilized as an alternative model for efficient seismic risk assessment to within 5% of relative error.

Predicting residual compressive strength of self-compacted concrete under various temperatures and relative humidity conditions by artificial neural networks

  • Ashteyat, Ahmed M.;Ismeik, Muhannad
    • Computers and Concrete
    • /
    • v.21 no.1
    • /
    • pp.47-54
    • /
    • 2018
  • Artificial neural network models can be successfully used to simulate the complex behavior of many problems in civil engineering. As compared to conventional computational methods, this popular modeling technique is powerful when the relationship between system parameters is intrinsically nonlinear, or cannot be explicitly identified, as in the case of concrete behavior. In this investigation, an artificial neural network model was developed to assess the residual compressive strength of self-compacted concrete at elevated temperatures ($20-900^{\circ}C$) and various relative humidity conditions (28-99%). A total of 332 experimental datasets, collected from available literature, were used for model calibration and verification. Data used in model development incorporated concrete ingredients, filler and fiber types, and environmental conditions. Based on the feed-forward back propagation algorithm, systematic analyses were performed to improve the accuracy of prediction and determine the most appropriate network topology. Training, testing, and validation results indicated that residual compressive strength of self-compacted concrete, exposed to high temperatures and relative humidity levels, could be estimated precisely with the suggested model. As illustrated by statistical indices, the reliability between experimental and predicted results was excellent. With new ingredients and different environmental conditions, the proposed model is an efficient approach to estimate the residual compressive strength of self-compacted concrete as a substitute for sophisticated laboratory procedures.

Cognitive Virtual Network Embedding Algorithm Based on Weighted Relative Entropy

  • Su, Yuze;Meng, Xiangru;Zhao, Zhiyuan;Li, Zhentao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1845-1865
    • /
    • 2019
  • Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithm based on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.

Analysis of Marketing Channel Competition under Network Externality (네트워크 외부성을 고려한 마케팅 채널 경쟁 분석)

  • Cho, Hyung-Rae;Rhee, Minho;Lim, Sang-Gyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.1
    • /
    • pp.105-113
    • /
    • 2017
  • Network externality can be defined as the effect that one user of a good or service has on the value of that product to other people. When a network externality is present, the value of a product or service is dependent on the number of others using it. There exist asymmetries in network externalities between the online and traditional offline marketing channels. Technological capabilities such as interactivity and real-time communications enable the creation of virtual communities. These user communities generate significant direct as well as indirect network externalities by creating added value through user ratings, reviews and feedback, which contributes to eliminate consumers' concern for buying products without the experience of 'touch and feel'. The offline channel offers much less scope for such community building, and consequently, almost no possibility for the creation of network externality. In this study, we analyze the effect of network externality on the competition between online and conventional offline marketing channels using game theory. To do this, we first set up a two-period game model to represent the competition between online and offline marketing channels under network externalities. Numerical analysis of the Nash equilibrium solutions of the game showed that the pricing strategies of online and offline channels heavily depend not only on the strength of network externality but on the relative efficiency of online channel. When the relative efficiency of online channel is high, the online channel can greatly benefit by the network externality. On the other hand, if the relative efficiency of online channel is low, the online channel may not benefit at all by the network externality.

Suggestion of the Relative Elevation Analysis Methods for Conservation of Local Topography : Focused on Analysis Range (지역규모의 지형경관 보전을 위한 상대고도 분석 방법론 제안 : 분석범위 설정을 중심으로)

  • Song, Wonkyong
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.17 no.5
    • /
    • pp.19-28
    • /
    • 2014
  • Given the structure of Korean mountains, it is more appropriate to apply the relative elevation method than the absolute elevation method. However, so far there were not suitable quantitative methodologies to analyze relative elevation, these analytical concepts were difficult to be utilized in urban environmental planning. This study suggested three methods for analyzing relative elevation, and one method for setting the analytical scope of relative elevation by calculating terrain relief. The results showed that the procedure considering 500m radius of each point and standardizing to 30% of the 7th height ridge was the most effective method to extract the local topography. This methodology is the quantitative tool to be able to conserve local important hills and ridges, and apply to fields of urban environmental planning and ecological restoration, especially urban ecological network.