• Title/Summary/Keyword: Local Computing

Search Result 532, Processing Time 0.022 seconds

Wind Field Change Simulation before and after the Regional Development of the Eunpyeong Area at Seoul Using a CFD_NIMR_SNU Model (CFD_NIMR_SNU 모형을 활용한 은평구 건설 전후의 바람환경 변화 모사 연구)

  • Cho, Kyoungmi;Koo, Hae-Jung;Kim, Kyu Rang;Choi, Young-Jean
    • Journal of Environmental Impact Assessment
    • /
    • v.20 no.4
    • /
    • pp.539-555
    • /
    • 2011
  • Newly constructed, high-rise dense building areas by urban development can cause changes in local wind fields. Wind fields were analyzed to assess the impact on the local meteorology due to the land use changes during the urban redevelopment called "Eunpyeong new town" in north-western Seoul using CFD_NIMR_SNU (Computational Fluid Dynamics, National Institute of Meteorological Research, Seoul National University) model. Initial value of wind speed and direction use analysis value of AWS (Automatic Weather Station) data during 5 years. In the case of the pre-construction with low rise built-up area, it was simulated that the spatial distribution of horizontal wind fields depends on the topography and wind direction of initial inflow. But, in the case of the post-construction with high rise built-up area, it was analyzed that the wind field was affected by high rise buildings as well as terrain. High-rise buildings can generate new circulations among buildings. In addition, small size vortexes were newly generated by terrain and high rise buildings after the construction. As high-rise buildings act as a barrier, we found that the horizontal wind flow was separated and wind speed was reduced behind the buildings. CFD_NIMR_SNU was able to analyze the impact of high-rise buildings during the urban development. With the support of high power computing, it will be more common to utilize sophisticated numerical analysis models such as CFD_NIMR_SNU in evaluating the impact of urban development on wind flow or channel.

Analytical Approach of Multicasting-based Fast Mobility Management Scheme in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 멀티캐스팅기반 빠른 이동성관리 기법의 분석적 접근법)

  • Kim, Young Hoon;Jeong, Jong Pil
    • Journal of Internet Computing and Services
    • /
    • v.14 no.3
    • /
    • pp.67-79
    • /
    • 2013
  • In wireless networks, efficient mobility management to support of mobile users is very important. Several mobility management schemeshave been proposed with the aim of reducing the signaling traffic of MN(Mobile Node). Among them, PMIPv6 (Proxy Mobile IPv6) is similar with host-based mobility management protocols but MN does not require any process for mobility. By introducing new mobile agent like MAG (Mobile Access Gateway) and LMA (Local Mobility Anchor), it provides IP mobility to MN. In this paper, we propose the analytical model to evaluate the mean signalingdelay and the mean bandwidth according to the type of MN mobility. As a result of mathematical analysis, MF-PMIP (Multicasting-based FastPMIP) outperforms compared to F-PMIP and PMIP in terms of parameters for the performance evaluation.

PC Cluster based Parallel Adaptive Evolutionary Algorithm for Service Restoration of Distribution Systems

  • Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Kim, Hyung-Su;Hwang, Gi-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.4
    • /
    • pp.435-447
    • /
    • 2006
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

A Tree-Based Indexing Method for Mobile Data Broadcasting (모바일 데이터 브로드캐스팅을 위한 트리 기반의 인덱싱 방법)

  • Park, Mee-Hwa;Lee, Yong-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.141-150
    • /
    • 2008
  • In this mobile computing environment, data broadcasting is widely used to resolve the problem of limited power and bandwidth of mobile equipments. Most previous broadcast indexing methods concentrate on flat data. However. with the growing popularity of XML, an increasing amount of information is being stored and exchanged in the XML format. We propose a novel indexing method. called TOP tree(Tree Ordering based Path summary tree), for indexing XML document on mobile broadcast environments. TOP tree is a path summary tree which provides a concise structure summary at group level using global IDs and element information at local level using local IDs. Based on the TOP tree representation, we suggest a broadcast stream generation and query Processing method that efficiently handles not only simple Path queries but also multiple path queries. We have compared our indexing method with other indexing methods. Evaluation results show that our approaches can effectively improve the access time and tune-in time in a wireless broadcasting environment.

  • PDF

MCMC Algorithm for Dirichlet Distribution over Gridded Simplex (그리드 단체 위의 디리슐레 분포에서 마르코프 연쇄 몬테 칼로 표집)

  • Sin, Bong-Kee
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.94-99
    • /
    • 2015
  • With the recent machine learning paradigm of using nonparametric Bayesian statistics and statistical inference based on random sampling, the Dirichlet distribution finds many uses in a variety of graphical models. It is a multivariate generalization of the gamma distribution and is defined on a continuous (K-1)-simplex. This paper presents a sampling method for a Dirichlet distribution for the problem of dividing an integer X into a sequence of K integers which sum to X. The target samples in our problem are all positive integer vectors when multiplied by a given X. They must be sampled from the correspondingly gridded simplex. In this paper we develop a Markov Chain Monte Carlo (MCMC) proposal distribution for the neighborhood grid points on the simplex and then present the complete algorithm based on the Metropolis-Hastings algorithm. The proposed algorithm can be used for the Markov model, HMM, and Semi-Markov model for accurate state-duration modeling. It can also be used for the Gamma-Dirichlet HMM to model q the global-local duration distributions.

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June-Ho
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.116-124
    • /
    • 2005
  • This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

Hierarchical Power Management Architecture and Optimal Local Control Policy for Energy Efficient Networks

  • Wei, Yifei;Wang, Xiaojun;Fialho, Leonardo;Bruschi, Roberto;Ormond, Olga;Collier, Martin
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.540-550
    • /
    • 2016
  • Since energy efficiency has become a significant concern for network infrastructure, next-generation network devices are expected to have embedded advanced power management capabilities. However, how to effectively exploit the green capabilities is still a big challenge, especially given the high heterogeneity of devices and their internal architectures. In this paper, we introduce a hierarchical power management architecture (HPMA) which represents physical components whose power can be monitored and controlled at various levels of a device as entities. We use energy aware state (EAS) as the power management setting mode of each device entity. The power policy controller is capable of getting information on how many EASes of the entity are manageable inside a device, and setting a certain EAS configuration for the entity. We propose the optimal local control policy which aims to minimize the router power consumption while meeting the performance constraints. A first-order Markov chain is used to model the statistical features of the network traffic load. The dynamic EAS configuration problem is formulated as a Markov decision process and solved using a dynamic programming algorithm. In addition, we demonstrate a reference implementation of the HPMA and EAS concept in a NetFPGA frequency scaled router which has the ability of toggling among five operating frequency options and/or turning off unused Ethernet ports.

Distribution System Reconfiguration Using the PC Cluster based Parallel Adaptive Evolutionary Algorithm

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho;Hwang Gi-Hyun;Yoon Yoo-Soo
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.3
    • /
    • pp.269-279
    • /
    • 2005
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

A Study of an Undergraduate Project Course on IT Distribution in Small and Medium Industries (물류 중소 IT 기업과 학부 프로젝트 교과목 운영 연구)

  • Jang, Jin-wook;Choi, Boo-kwan
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.11
    • /
    • pp.739-744
    • /
    • 2015
  • In this paper, we examine the project-based educational practice that is co-developing a solution to the local food inventory management system. This project is aimed at the practical business of IT distribution in small and medium industries, and is linked with the project course on undergraduate students of IT division. For the practical project of the IT distribution in small and medium industries, an employee in charge of the project participates as a mentor such that he presents the project subject and the students develop the system for the subject. This system emerges from existing theory and the necessity for a term project, and this course leads students to learn practical knowledge through discussion with the employee in charge. Through this course, the latest technology is shared mutually, and students have the opportunity to understand a domain of the IT distribution business. As students experience how to understand and solve cost, quality and delivery time for the project by themselves, they build confidence. Also, the company can save on costs for the development of prototypes, while creating an opportunity for students to experience working with seasoned staff.

An Improvement of Fast Handoff Protocol using Modified Local Registration in Mobile Computing Environment (이동 컴퓨팅 환경에서 수정된 지역 위치등록을 이용한 고속 핸드오프 프로토콜 개선)

  • Han, Seung-Jin;Choe, Seong-Yong;Lee, Jeong-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.267-276
    • /
    • 2002
  • By using wireless terminal, User that want to transmit multimedia traffic as well as simple text and voice have a tendency to increase. This paper proposes a fast handoff protocol that is suitable transmission for real-tim of multimedia traffic by using modified local registration. The proposed protocol solves the Triangle Routing Protocol that is one of existing opened issues without modifying protocol of CN, and we propose the method that MN is able to received a packet by real-time, even if MN is being handoff. We compare fast handoff protocol proposed in this paper with existing method n the registration cost and data packet transmission cost. As a result, we showed that fast handoff protocol proposed in this paper outperforms existing method.