• Title/Summary/Keyword: partitioned networks

Search Result 59, Processing Time 0.026 seconds

Design of ATM Networks to transfer for Electric Power System Informations (전력정보 전달을 위한 ATM 망 설계)

  • Jeong, Young-Kyeung;Kim, Han-Kyeung
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.572-574
    • /
    • 1998
  • In this paper, we are proposed design of ATM networks to transfer for electric power system informations, proposed transport networks is partitioned management part and functional part, management part is partitioned edge network, core network, local network, authority network, functional part is partitioned core network, access network, edge area. It is based on laying and partitioning by ITU-T G.805, we also proposed ATM network requirements for Carrier Relay traffic acceptability in electric power system information.

  • PDF

Social network monitoring procedure based on partitioned networks (분할된 네트워크에 기반한 사회 네트워크 모니터링 절차)

  • Hong, Hwiju;Lee, Joo Weon;Lee, Jaeheon
    • The Korean Journal of Applied Statistics
    • /
    • v.35 no.2
    • /
    • pp.299-310
    • /
    • 2022
  • As interest in social network analysis increases, researchers' interest in detecting changes in social networks is also increasing. Changes in social networks appear as structural changes in the network. Therefore, detecting a change in a social network is detecting a change in the structural characteristics of the network. A local change in a social network is a change that occurs in a part of the network. It usually occurs between close neighbors. The purpose of this paper is to propose a procedure to efficiently detect local changes occurring in the network. In this paper, we divide the network into partitioned networks and monitor each partitioned network to detect local changes more efficiently. By monitoring partitioned networks, we can detect local changes more quickly and obtain information about where the changes are occurring. Simulation studies show that the proposed method is efficient when the network size is small and the amount of change is small. In addition, under a fixed overall false alarm rate, when we partition the network into smaller sizes and monitor smaller partitioned networks, it detects local changes better.

Multiple component neural network architecture design and learning by using PCA (PCA를 이용한 다중 컴포넌트 신경망 구조설계 및 학습)

  • 박찬호;이현수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.107-119
    • /
    • 1996
  • In this paper, we propose multiple component neural network(MCNN) which learn partitioned patterns in each multiple component neural networks by reducing dimensions of input pattern vector using PCA (principal component analysis). Procesed neural network use Oja's rule that has a role of PCA, output patterns are used a slearning patterns on small component neural networks and we call it CBP. For simply not solved patterns in a network, we solves it by regenerating new CBP neural networks and by performing dynamic partitioned pattern learning. Simulation results shows that proposed MCNN neural networks are very small size networks and have very fast learning speed compared with multilayer neural network EBP.

  • PDF

Routing in UAV based Disruption Tolerant Networks (무인항공기 기반 지연 허용 네트워크에서의 라우팅)

  • Kim, Tea-Ho;Lim, Yu-Jin;Park, Joon-Sang
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.521-526
    • /
    • 2009
  • Disruption/Delay Tolerant Network(DTN) is a technology for interconnecting partitioned networks. These days, DTN, especially routing in DTN, draws significant attention from the networking community. In this paper, we investigate DTN routing strategies for highly partitioned ad hoc networks where Unmanned Aerial Vehicles (UAVs) perform store-carry-forward functionality for improved network connectivity. Also we investigate UAV trajectory control mechanisms via simulation studies.

Corporate Credit Rating using Partitioned Neural Network and Case- Based Reasoning (신경망 분리모형과 사례기반추론을 이용한 기업 신용 평가)

  • Kim, David;Han, In-Goo;Min, Sung-Hwan
    • Journal of Information Technology Applications and Management
    • /
    • v.14 no.2
    • /
    • pp.151-168
    • /
    • 2007
  • The corporate credit rating represents an assessment of the relative level of risk associated with the timely payments required by the debt obligation. In this study, the corporate credit rating model employs artificial intelligence methods including Neural Network (NN) and Case-Based Reasoning (CBR). At first we suggest three classification models, as partitioned neural networks, all of which convert multi-group classification problems into two group classification ones: Ordinal Pairwise Partitioning (OPP) model, binary classification model and simple classification model. The experimental results show that the partitioned NN outperformed the conventional NN. In addition, we put to use CBR that is widely used recently as a problem-solving and learning tool both in academic and business areas. With an advantage of the easiness in model design compared to a NN model, the CBR model proves itself to have good classification capability through the highest hit ratio in the corporate credit rating.

  • PDF

Design of Hard Partition-based Non-Fuzzy Neural Networks

  • Park, Keon-Jun;Kwon, Jae-Hyun;Kim, Yong-Kab
    • International journal of advanced smart convergence
    • /
    • v.1 no.2
    • /
    • pp.30-33
    • /
    • 2012
  • This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.

Adaptive Partition-Based Address Allocation Protocol in Mobile Ad Hoc Networks

  • Kim, Ki-Il;Peng, Bai;Kim, Kyong-Hoon
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.141-147
    • /
    • 2009
  • To initialize and maintain self-organizing networks such as mobile ad hoc networks, address allocation protocol is essentially required. However, centralized approaches that pervasively used in traditional networks are not recommended in this kind of networks since they cannot handle with mobility efficiently. In addition, previous distributed approaches suffer from inefficiency with control overhead caused by duplicated address detection and management of available address pool. In this paper, we propose a new dynamic address allocation scheme, which is based on adaptive partition. An available address is managed in distributed way by multiple agents and partitioned adaptively according to current network environments. Finally, simulation results reveal that a proposed scheme is superior to previous approach in term of address acquisition delay under diverse simulation scenarios.

Object Segment Grouping for Wireless Mobile Streaming Media Services (무선 모바일 스트리밍 미디어 서비스를 위한 객체 세그먼트 그룹화)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.10 no.4
    • /
    • pp.199-206
    • /
    • 2012
  • Increment of mobile client's information request in wireless mobile networks requires a new method to manage and serve the streaming media object. This paper proposes a new object segment grouping method for enhancing the performance of streaming media services in wireless mobile networks. The proposed method performs the similarity metric for the partitioned object segments, and it process the disjunction, conjunction, and filtering for these metrics. This paper was to decided the partitioned group of object segments for these operation metrics, and it decided the performance of streaming media services. The simulation result showed that the proposed method has better performance in throughput, average startup latency, and cache hit ratio.

Federated Architecture of Multiple Neural Networks : A Case Study on the Configuration Design of Midship Structure (다중 인공 신경망의 Federated Architecture와 그 응용-선박 중앙단면 형상 설계를 중심으로)

  • 이경호;연윤석
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.2
    • /
    • pp.77-84
    • /
    • 1997
  • This paper is concerning the development of multiple neural networks system of problem domains where the complete input space can be decomposed into several different regions, and these are known prior to training neural networks. We will adopt oblique decision tree to represent the divided input space and sel ect an appropriate subnetworks, each of which is trained over a different region of input space. The overall architecture of multiple neural networks system, called the federated architecture, consists of a facilitator, normal subnetworks, and tile networks. The role of a facilitator is to choose the subnetwork that is suitable for the given input data using information obtained from decision tree. However, if input data is close enough to the boundaries of regions, there is a large possibility of selecting the invalid subnetwork due to the incorrect prediction of decision tree. When such a situation is encountered, the facilitator selects a tile network that is trained closely to the boundaries of partitioned input space, instead of a normal subnetwork. In this way, it is possible to reduce the large error of neural networks at zones close to borders of regions. The validation of our approach is examined and verified by applying the federated neural networks system to the configuration design of a midship structure.

  • PDF

Adaptive Reversal Tree Protocol with Optimal Path for Dynamic Sensor Networks

  • Hwang, Kwang-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.1004-1014
    • /
    • 2007
  • In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.