• Title/Summary/Keyword: whole network

Search Result 1,072, Processing Time 0.024 seconds

A Study on the Setting Criteria and Management Area for the National Ecological Network (광역생태축 구축을 위한 기준 및 관리지역 설정 연구)

  • Jeon, Seong-Woo;Chun, Joung-Yoon;Seong, Hyeon-Chan;Song, Won-Kyong;Park, Ji-Hee
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.13 no.5
    • /
    • pp.154-171
    • /
    • 2010
  • This study was performed to show criteria of a National Ecological Network (NEN) for South Korea and it was a part of a study of ecological network for broad areas on national land showed by Ministry of Environment of Korea. After 1970s, many european countries presented methods and criteria not on individual protected area but on networking among many habitats. The PEEN (Pan European Ecological Network) and NATURA 2000 are results of those. In South Korea, concepts and mapping metheods of ecological network was studied but those were not applied to the whole national land because the equality and local specialities were not reflected. So, in this study, we presented the criteria composed of forest, river, wildlife and coastal evaluation items in conservation ecology and showed the mapping method which can applied to the national land. After the evaluation on land area which composed of forest, river and wildlife axis. Core areas were $30,616km^2$, buffer zone were $21,870km^2$ and each accounted for 31% and 22% of the national land. Except for Taebaeck-Gangwon region, whole region's core areas were accounted for 20~30% of it and buffer zone were accounted for 20~25% of it, so these can be applied to the national land with equality and local specialities. Forest axis and river axis were clearly linear and connected, but the wildlife axis was dispersed in point form. Therefore, to apply the NEN, a detailed habitat map is important and the interconnected implementation of forest, river, wildlife, and coastal axis is required.

Content Distribution Mechanism in an All-Sender-All-Receiver Ad Hoc Network (모든 Peer가 송수신자인 Ad Hoc 네트워크에서의 자료 분배 방법에 대한 고찰)

  • Kang Seung-Seok
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.161-164
    • /
    • 2005
  • Mobile device users are sensitive to pay telecommunication charge for downloading Internet data, because the cost is proportional to the amount of data received. If there are device users who want to download the same content, they may cooperate each other to form an ad hoc network and share the partially downloaded content in order to reduce the amount of data downloaded. Each mobile device, called a peer, downloads a specific portion of the whole content using fee-based telecommunication channel, and exchanges the portion with other peers with free ad hoc channel in order that all participating peers are able to reconstruct the whole content in this situation, al1 participating peers become senders and receivers at the same time. In order to distribute the partial content to other peers, the ad hoc network requires a control led distribution mechanism. This paper introduces the per-peer-based distribution method in which one designated peer can transmit partial data to its neighbors at a time. Simulation results show that 90$\%$ of the telecommunication cost is saved with as few as 10 peers .

  • PDF

A Method for Optimizing the Structure of Neural Networks Based on Information Entropy

  • Yuan Hongchun;Xiong Fanlnu;Kei, Bai-Shi
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.30-33
    • /
    • 2001
  • The number of hidden neurons of the feed-forward neural networks is generally decided on the basis of experience. The method usually results in the lack or redundancy of hidden neurons, and causes the shortage of capacity for storing information of learning overmuch. This research proposes a new method for optimizing the number of hidden neurons bases on information entropy, Firstly, an initial neural network with enough hidden neurons should be trained by a set of training samples. Second, the activation values of hidden neurons should be calculated by inputting the training samples that can be identified correctly by the trained neural network. Third, all kinds of partitions should be tried and its information gain should be calculated, and then a decision-tree correctly dividing the whole sample space can be constructed. Finally, the important and related hidden neurons that are included in the tree can be found by searching the whole tree, and other redundant hidden neurons can be deleted. Thus, the number of hidden neurons can be decided. In the case of building a neural network with the best number of hidden units for tea quality evaluation, the proposed method is applied. And the result shows that the method is effective

  • PDF

Channel Allocation Method and Job scheduling Scheme by Property of Traffic in Cellular Network (이동통신에서 멀티미디어 트래픽 속성에 따른 채널 할당 방식과 작업 스케줄링 기법)

  • Heo Bo-Jin;Son Dong-Cheul;Kim Chang-Suk;Lee Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.436-442
    • /
    • 2006
  • It is important matter that inflect well allocated frequency resource in cellular network and is still more serious element in environment that provide multimedia services. Also, that do that make job scheduling how base station system or terminal according to this service request is important constituent that evaluate performance of whole system. channel allocation according to service kind causes big effect to whole system when hand off gets up in cellular network. This paper describes model and algorithm that increase two elements that is frequency allocation and job scheduling that consider multimedia service traffic special quality by emphasis that do mapping present in CDMA cellular system.

DEVELOPMENT OF A CORE THERMO-FLUID ANALYSIS CODE FOR PRISMATIC GAS COOLED REACTORS

  • Tak, Nam-Il;Lee, Sung Nam;Kim, Min-Hwan;Lim, Hong Sik;Noh, Jae Man
    • Nuclear Engineering and Technology
    • /
    • v.46 no.5
    • /
    • pp.641-654
    • /
    • 2014
  • A new computer code, named CORONA (Core Reliable Optimization and thermo-fluid Network Analysis), was developed for the core thermo-fluid analysis of a prismatic gas cooled reactor. The CORONA code is targeted for whole-core thermo-fluid analysis of a prismatic gas cooled reactor, with fast computation and reasonable accuracy. In order to achieve this target, the development of CORONA focused on (1) an efficient numerical method, (2) efficient grid generation, and (3) parallel computation. The key idea for the efficient numerical method of CORONA is to solve a three-dimensional solid heat conduction equation combined with one-dimensional fluid flow network equations. The typical difficulties in generating computational grids for a whole core analysis were overcome by using a basic unit cell concept. A fast calculation was finally achieved by a block-wise parallel computation method. The objective of the present paper is to summarize the motivation and strategy, numerical approaches, verification and validation, parallel computation, and perspective of the CORONA code.

A Study on Secure Cooperative Caching Technique in Wireless Ad-hoc Network (Wireless Ad-hoc Network에서 보안 협력 캐싱 기법에 관한 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.91-98
    • /
    • 2013
  • Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

OPTIMAL DESIGN MODEL FOR A DISTRIBUTED HIERARCHICAL NETWORK WITH FIXED-CHARGED FACILITIES

  • Yoon, Moon-Gil;Baek, Young-Ho;Tcha, Dong-Wan
    • Management Science and Financial Engineering
    • /
    • v.6 no.2
    • /
    • pp.29-45
    • /
    • 2000
  • We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

  • PDF

Human Face Recognition used Improved Back-Propagation (BP) Neural Network

  • Zhang, Ru-Yang;Lee, Eung-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.4
    • /
    • pp.471-477
    • /
    • 2018
  • As an important key technology using on electronic devices, face recognition has become one of the hottest technology recently. The traditional BP Neural network has a strong ability of self-learning, adaptive and powerful non-linear mapping but it also has disadvantages such as slow convergence speed, easy to be traversed in the training process and easy to fall into local minimum points. So we come up with an algorithm based on BP neural network but also combined with the PCA algorithm and other methods such as the elastic gradient descent method which can improve the original network to try to improve the whole recognition efficiency and has the advantages of both PCA algorithm and BP neural network.

Speaker Verification Using Hidden LMS Adaptive Filtering Algorithm and Competitive Learning Neural Network (Hidden LMS 적응 필터링 알고리즘을 이용한 경쟁학습 화자검증)

  • Cho, Seong-Won;Kim, Jae-Min
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.51 no.2
    • /
    • pp.69-77
    • /
    • 2002
  • Speaker verification can be classified in two categories, text-dependent speaker verification and text-independent speaker verification. In this paper, we discuss text-dependent speaker verification. Text-dependent speaker verification system determines whether the sound characteristics of the speaker are equal to those of the specific person or not. In this paper we obtain the speaker data using a sound card in various noisy conditions, apply a new Hidden LMS (Least Mean Square) adaptive algorithm to it, and extract LPC (Linear Predictive Coding)-cepstrum coefficients as feature vectors. Finally, we use a competitive learning neural network for speaker verification. The proposed hidden LMS adaptive filter using a neural network reduces noise and enhances features in various noisy conditions. We construct a separate neural network for each speaker, which makes it unnecessary to train the whole network for a new added speaker and makes the system expansion easy. We experimentally prove that the proposed method improves the speaker verification performance.

Communication Scheme Availability Evaluation for Hand off Scheme in Mobile Communication Networks (핸드오프 구조를 갖는 이동통신망에서의 통신 구조 가용도 계정)

  • Lee, Jun-Hyuk;Oh, Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.8 no.4
    • /
    • pp.193-204
    • /
    • 2008
  • In this paper, we proposed availability evaluation of network in mobile communication network that have hand off structure. Radio mobile communication network is essential hand off action to keep communication that is no discontinuance by transfer of terminal. Part by state and hand off state ago hand off by transfer of terminal and communication network is estimated performance according to the hand off rate and hand off completion rate of system. we applied MS, SM, MM communication structure in radio CORBA for network availability evaluate. System availability in mobile communication network that can repair that propose in this study uses the hand off rate and hand off completion rate of system by transfer of terminal and availability of whole system did evaluate.

  • PDF