• Title/Summary/Keyword: Complete network

Search Result 514, Processing Time 0.029 seconds

Estimation of Road-Network Performance and Resilience According to the Strength of a Disaster (재난 강도에 따른 도로 네트워크의 성능 및 회복력 산정 방안)

  • Jung, Hoyong;Choi, Seunghyun;Do, Myungsik
    • International Journal of Highway Engineering
    • /
    • v.20 no.1
    • /
    • pp.35-45
    • /
    • 2018
  • PURPOSES : This study examines the performance changes of road networks according to the strength of a disaster, and proposes a method for estimating the quantitative resilience according to the road-network performance changes and damage scale. This study also selected high-influence road sections, according to disasters targeting the road network, and aimed to analyze their hazard resilience from the network aspect through a scenario analysis of the damage recovery after a disaster occurred. METHODS : The analysis was conducted targeting Sejong City in South Korea. The disaster situation was set up using the TransCAD and VISSIM traffic-simulation software. First, the study analyzed how road-network damage changed the user's travel pattern and travel time, and how it affected the complete network. Secondly, the functional aspects of the road networks were analyzed using quantitative resilience. Finally, based on the road-network performance change and resilience, priority-management road sections were selected. RESULTS : According to the analysis results, when a road section has relatively low connectivity and low traffic, its effect on the complete network is insignificant. Moreover, certain road sections with relatively high importance can suffer a performance loss from major damage, for e.g., sections where bridges, tunnels, or underground roads are located, roads where no bypasses exist or they exist far from the concerned road, including entrances and exits to suburban areas. Relatively important roads have the potential to significantly degrade the network performance when a disaster occurs. Because of the high risk of delays or isolation, they may lead to secondary damage. Thus, it is necessary to manage the roads to maintain their performance. CONCLUSIONS : As a baseline study to establish measures for traffic prevention, this study considered the performance of a road network, selected high-influence road sections within the road network, and analyzed the quantitative resilience of the road network according to scenarios. The road users' passage-pattern changes were analyzed through simulation analysis using the User Equilibrium model. Based on the analysis results, the resilience in each scenario was examined and compared. Sections where a road's performance loss had a significant influence on the network were targeted. The study results were judged to become basic research data for establishing response plans to restore the original functions and performance of the destroyed and damage road networks, and for selecting maintenance priorities.

A Genetic Algorithm for the Chinese Postman Problem on the Mixed Networks (유전자 알고리즘을 이용한 혼합 네트워크에서의 Chinese Postman Problem 해법)

  • Jun Byung Hyun;Kang Myung Ju;Han Chi Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.181-188
    • /
    • 2005
  • Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

  • PDF

The Development of Mobile USB Home Control System

  • Kim, Hee-Sun;Kim, Yong-Seok;Lee, Chang-Goo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2155-2158
    • /
    • 2003
  • A term of home automation that was in fashion only a few years ago has not been used any more. Nowadays, We have been used a term of home network or digital home than home automation much. While internet infra is diffused at home, data network corp., communication corp., electric appliance corp. and home automation control system corp. which we did not mind each other particularly constructed consortium, and they have designs on home network market. Also, cellular phone's growth tried home networking by using not only wired internet but also broadband wireless communication. Regardless, many solutions are coming out it is few to be applied to real life because the standard is not determined with the protocol each other. Therefore, we developed home network system using USB(Universal Serial Bus) that has the possibility most in home networking standard. The mobile USB home control system is excellent at expansibility and portability. Also we can complete low cost and stable system using an embedded system.

  • PDF

An Efficient Cluster Based Service Discovery Model for Mobile Ad hoc Network

  • Buvana, M.;Suganthi, M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.680-699
    • /
    • 2015
  • The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

Test Generation for Combinational Logic Circuits Using Neural Networks (신경회로망을 이용한 조합 논리회로의 테스트 생성)

  • 김영우;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.9
    • /
    • pp.71-79
    • /
    • 1993
  • This paper proposes a new test pattern generation methodology for combinational logic circuits using neural networks based on a modular structure. The CUT (Circuit Under Test) is described in our gate level hardware description language. By conferring neural database, the CUT is compiled to an ATPG (Automatic Test Pattern Generation) neural network. Each logic gate in CUT is represented as a discrete Hopfield network. Such a neual network is called a gate module in this paper. All the gate modules for a CUT form an ATPG neural network by connecting each module through message passing paths by which the states of modules are transferred to their adjacent modules. A fault is injected by setting the activation values of some neurons at given values and by invalidating connections between some gate modules. A test pattern for an injected fault is obtained when all gate modules in the ATPG neural network are stabilized through evolution and mutual interactions. The proposed methodology is efficient for test generation, known to be NP-complete, through its massive paralelism. Some results on combinational logic circuits confirm the feasibility of the proposed methodology.

  • PDF

통신사업자의 B2B사업모델 및 진입전략

  • 여인갑
    • Proceedings of the Korea Technology Innovation Society Conference
    • /
    • 2000.11a
    • /
    • pp.69-87
    • /
    • 2000
  • Models and Strategies for Network Operator's B2B Ecommerce The B2B ecommerce market is one of the fastest growing areas in the telecom industry. However network operators have been slow to enter the arena, Network operator have been held back by their general unsurety about the Internet business. Network operators'core business(the supply of connectivity and transport service) is becoming unprofitable. As a result they are looking to diversify into areas where margins are higher. B2B ecommerce offers them a major way to achieve this. It is possible to identify various business models for offering ecommerce services to end user, ranging from the provision of complete packaged applications to the implementation and management of customized ecommerce solution. In this study the three main approaches available to network operators are the traditional IT outsourcing model, the ASP model and the community builder model.

  • PDF

MFSC: Mean-Field-Theory and Spreading-Coefficient Based Degree Distribution Analysis in Social Network

  • Lin, Chongze;Zheng, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3630-3656
    • /
    • 2018
  • Degree distribution can provide basic information for structural characteristics and internal relationship in social network. It is a critical procedure for social network topology analysis. In this paper, based on the mean-field theory, we study a special type of social network with exponential distribution of time intervals. First of all, in order to improve the accuracy of analysis, we propose a spreading coefficient algorithm based on intimate relationship, which determines the number of the joined members through the intimacy among members. Then, simulation show that the degree distribution of follows the power-law distribution and has small-world characteristics. Finally, we compare the performance of our algorithm with the existing algorithms, and find that our algorithm improves the accuracy of degree distribution as well as reducing the time complexity significantly, which can complete 29.04% higher precision and 40.94% lower implementation time.

Proportional-Fair Downlink Resource Allocation in OFDMA-Based Relay Networks

  • Liu, Chang;Qin, Xiaowei;Zhang, Sihai;Zhou, Wuyang
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.633-638
    • /
    • 2011
  • In this paper, we consider resource allocation with proportional fairness in the downlink orthogonal frequency division multiple access relay networks, in which relay nodes operate in decode-and-forward mode. A joint optimization problem is formulated for relay selection, subcarrier assignment and power allocation. Since the formulated primal problem is nondeterministic polynomial time-complete, we make continuous relaxation and solve the dual problem by Lagrangian dual decomposition method. A near-optimal solution is obtained using Karush-Kuhn-Tucker conditions. Simulation results show that the proposed algorithm provides superior system throughput and much better fairness among users comparing with a heuristic algorithm.

MATHEMATICS RESOURCES ON THE INTERNET

  • Noh, Sun-Sook
    • The Mathematical Education
    • /
    • v.33 no.2
    • /
    • pp.155-166
    • /
    • 1994
  • The purpose of this study is to determine thy type and amount of math education related information that is available on the worldwide Internet computer network and to summarize the ways of using network to its fullest potential for mathematics education research. The survey and analysis of the network shows that a great deal of information covering a broad range of subjects regarding mathematics education exists on the network. The type of information ranges from simple mathematics study plans to the complete mathematics education assessment database for grade school and high school students in the U.S. In addition to the wide ranging information, the network is also valuable as a communication link for exchanging ideas and obtaining feedbacks from educators and students around the world. Through the use of electronic mail, the Internet offers the ability to communicate with over 20 million users around the world.

  • PDF

Residual Learning Based CNN for Gesture Recognition in Robot Interaction

  • Han, Hua
    • Journal of Information Processing Systems
    • /
    • v.17 no.2
    • /
    • pp.385-398
    • /
    • 2021
  • The complexity of deep learning models affects the real-time performance of gesture recognition, thereby limiting the application of gesture recognition algorithms in actual scenarios. Hence, a residual learning neural network based on a deep convolutional neural network is proposed. First, small convolution kernels are used to extract the local details of gesture images. Subsequently, a shallow residual structure is built to share weights, thereby avoiding gradient disappearance or gradient explosion as the network layer deepens; consequently, the difficulty of model optimisation is simplified. Additional convolutional neural networks are used to accelerate the refinement of deep abstract features based on the spatial importance of the gesture feature distribution. Finally, a fully connected cascade softmax classifier is used to complete the gesture recognition. Compared with the dense connection multiplexing feature information network, the proposed algorithm is optimised in feature multiplexing to avoid performance fluctuations caused by feature redundancy. Experimental results from the ISOGD gesture dataset and Gesture dataset prove that the proposed algorithm affords a fast convergence speed and high accuracy.