• Title/Summary/Keyword: 분산알고리즘

Search Result 1,791, Processing Time 0.025 seconds

Development of SaaS cloud infrastructure to monitor conditions of wind turbine gearbox (풍력발전기 증속기 상태를 감시하기 위한 SaaS 클라우드 인프라 개발)

  • Lee, Gwang-Se;Choi, Jungchul;Kang, Seung-Jin;Park, Sail;Lee, Jin-jae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.9
    • /
    • pp.316-325
    • /
    • 2018
  • In this paper, to integrate distributed IT resources and manage human resource efficiently as purpose of cost reduction, infrastructure of wind turbine monitoring system have been designed and developed on the basis of SaaS cloud. This infrastructure hierarchize data according to related task and services. Softwares to monitor conditions via the infrastructure are also developed. Softwares are made up of DB design, field measurement, data transmission and monitoring programs. The infrastructure is able to monitor conditions from SCADA data and additional sensors. Total time delay from field measurement to monitoring is defined by modeling of step-wise time delay in condition monitoring algorithms. Since vibration data are acquired by measurements of high resolution, the delay is unavoidable and it is essential information for application of O&M program. Monitoring target is gearbox in wind turbine of MW-class and it is operating for 10 years, which means that accurate monitoring is essential for its efficient O&M in the future. The infrastructure is in operation to deal with the gearbox conditions with high resolution of 50 TB data capacity, annually.

A Scalable Resource-Lookup Protocol for Internet File System Considering the Computing Power of a Peer (피어의 컴퓨팅 능력을 고려한 인터넷 파일 시스템을 위한 확장성 있는 자원 탐색 프로토콜 설계)

  • Jung Il-dong;You Young-ho;Lee Jong-hwan;Kim Kyongsok
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.89-99
    • /
    • 2005
  • Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

Research Trend Analysis for Fault Detection Methods Using Machine Learning (머신러닝을 사용한 단층 탐지 기술 연구 동향 분석)

  • Bae, Wooram;Ha, Wansoo
    • Economic and Environmental Geology
    • /
    • v.53 no.4
    • /
    • pp.479-489
    • /
    • 2020
  • A fault is a geological structure that can be a migration path or a cap rock of hydrocarbon such as oil and gas, formed from source rock. The fault is one of the main targets of seismic exploration to find reservoirs in which hydrocarbon have accumulated. However, conventional fault detection methods using lateral discontinuity in seismic data such as semblance, coherence, variance, gradient magnitude and fault likelihood, have problem that professional interpreters have to invest lots of time and computational costs. Therefore, many researchers are conducting various studies to save computational costs and time for fault interpretation, and machine learning technologies attracted attention recently. Among various machine learning technologies, many researchers are conducting fault interpretation studies using the support vector machine, multi-layer perceptron, deep neural networks and convolutional neural networks algorithms. Especially, researchers use not only their own convolution networks but also proven networks in image processing to predict fault locations and fault information such as strike and dip. In this paper, by investigating and analyzing these studies, we found that the convolutional neural networks based on the U-Net from image processing is the most effective one for fault detection and interpretation. Further studies can expect better results from fault detection and interpretation using the convolutional neural networks along with transfer learning and data augmentation.

Distributed Hierarchical Location Placement of Core Nodes in the OCBT Multicast Protocol (OCBT 멀티캐스트 프로토콜에서 core 노드의 분산 계층 위치 결정)

  • 황경호;조동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.90-95
    • /
    • 2000
  • In the Ordered Core Based Tree(OCBT) protocol, a core location is the most important feature to affect the performance. In this paper, the location placement of multiple level cores is studied. The proposed algorithm isthat each node in the network evaluates a sum of shortest path costs from all the other nodes and the entirenetwork is divided into a hierarchy region to have 3-logical level(Small, Medium, Large). The node to have thelowest cost in each S-Region is decided to be a core node. Then, the core nodes in the each S-Region evaluatea sum of shortest path costs from all the other core nodes in the same M-Region. The core node to have thelowest cost is decided to be the upper level core node. Similarly the highest level core node is decided in theL-Region. The proposed algoritthm is compared with conventional two methods to put the core nodes in thenetwork One is the random method to put the core nodes randomly. The other is the center method to locatethe core node at the nearest node from the center of each S-Region and then to locate the highest level corenode at the nearest core node from the center of the entire network. Extensive simulations are performed in theview of mean tree cost and join latency. Simulation results show that the proposed algorithm has betterperformance than random method or center method.

  • PDF

Colour Appearance Modelling based on Background Lightness and Colour Stimulus Size in Displays (디스플레이에서 배경의 밝기와 색채 자극의 크기에 따른 컬러 어피어런스 모델링)

  • Hong, Ji Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.4
    • /
    • pp.43-48
    • /
    • 2018
  • This study was conducted to reproduce digital colour based on the lightness of the background and size of the colour stimulus so that colour can be similarly perceived under different conditions. With the evolution of display technologies, display devices of various sizes can now reproduce more accurate colour and enhanced images, thus affecting the overall quality of display images. This study reproduced digital colour by considering the visual characteristics of the digital media environment. To accomplish this, we developed a colour appearance model which distinguishes the properties of foveal and peripheral vision. The proposed model is based on existing research on the lightness of the background and size of the colour stimulus. Based on experimental results, an analysis of variance was performed in order to develop the colour appearance model. The algorithm and modelling were verified based on the proposed model. In addition, to apply this model to display technologies, a practical colour control system and a method for handling complex input images were developed. Through this research, colour conversion errors which might occur when the input image is converted to fit a specific display size are resolved from the perspective of the human visual system. As a result, more accurate colour can be displayed and enhanced images can be reproduced.

QoS-Guaranteed IP Mobility Management For Fast Moving Vehicles Using Multiple Tunnels (멀티 터널링을 이용한 고속 차량에서 QoS 보장 IP 이동성 관리 방법)

  • Chun, Seung-Man;Nah, Jae-Wook;Park, Jong-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.11
    • /
    • pp.44-52
    • /
    • 2011
  • In this article, we present a QoS-guaranteed IP mobility management scheme of Internet service for fast moving vehicles with multiple wireless network interfaces. The idea of the proposed mechanism consists of two things. One is that new wireless connections are established to available wireless channels whenever the measured data rate at the vehicle equipped with mobile gateway drops below to the required data rate of the user requirement. The other is that parallel distribution packet tunnels between an access router and the mobile gateway are dynamically constructed using multiple wireless network interfaces in order to guarantee the required data rate during the mobile gateway's movement. By doing these methods, the required data rate of the mobile gateway can be preserved while eliminating the possible delay and packet loss during handover operation, thus resulting in the guaranteed QoS. The architecture of the IETF standard HMIPv6 has been extended to realize the proposed scheme, and detailed algorithms for the extension of HMIPv6 has been designed. Finally, simulation has been done for performance evaluation, and the simulation results show that the proposed mechanism demonstrates guaranteed QoS during the handover with regard to the handover delay, packet loss and throughput.

Load balancing Direction strategies in star network configurations (스타형 컴퓨터 네트워크의 부하균형방향 정책)

  • Im, Gyeong-Su;Kim, Su-Jeong;Kim, Jong-Geun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.4
    • /
    • pp.427-437
    • /
    • 1994
  • Optimal static load balancing in star network configurations is considered. Three kinds of load balancing direction strategies are considered. First, a job arriving at the peripheral nodes may be processed either where it arrived(origin node) or transferred directly to central node Second, a job arriving at the central node may be processed there, or transferred to lightly loaded peripheral nodes. A nonlinear optimization problem is formulated. Using the optimal solution, an optimal load balancing algorithm is derived for the second load balancing strategy. Third a job arriving at the central node or a peripheral node may be processed either at origin node or transferred to another lightly loaded node (central or peripheral). A load balancing algorithm is derived for the third load balancing strategy. The effects of these three load balancing strategies are compared by numerical experiments. During the conduct of these in numerical experiments, several interesting phenomena were observed. The third load balancing strategy improved performance more than the first two other strategies. The second load balancing strategy, as a whole, resulted in only slightly improved performance. Finally, of the central node has larger processing power than the peripheral nodes, the first and third load balancing strategies produce equal performance improvement.

  • PDF

A Dynamic Server Power Mode Control for Saving Energy in a Server Cluster Environment (서버 클러스터 환경에서 에너지 절약을 위한 동적 서버 전원 모드 제어)

  • Kim, Ho-Yeon;Ham, Chi-Hwan;Kwak, Hu-Keun;Kwon, Hui-Ung;Kim, Young-Jong;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.19C no.2
    • /
    • pp.135-144
    • /
    • 2012
  • All the servers in a traditional server cluster environment are kept On. If the request load reaches to the maximum, we exploit its maximum possible performance, otherwise, we exploit only some portion of maximum possible performance so that the efficiency of server power consumption becomes low. We can improve the efficiency of power consumption by controlling power mode of servers according to load situation, that is, by making On only minimum number of servers needed to handle current load while making Off the remaining servers. In the existing power mode control method, they used a static policy to decide server power mode at a fixed time interval so that it cannot adapt well to the dynamically changing load situation. In order to improve the existing method, we propose a dynamic server power control algorithm. In the proposed method, we keep the history of server power consumption and, based on it, predict whether power consumption increases in the near future. Based on this prediction, we dynamically change the time interval to decide server power mode. We performed experiments with a cluster of 30 PCs. Experimental results show that our proposed method keeps the same performance while reducing 29% of power consumption compared to the existing method. In addition, our proposed method allows to increase the average CPU utilization by 66%.

A Study on the Statistical GIS for Regional Analysis (지역분석을 위한 웹 기반 통계GIS 연구)

  • 박기호;이양원
    • Spatial Information Research
    • /
    • v.9 no.2
    • /
    • pp.239-261
    • /
    • 2001
  • A large suite of official statistical data sets has been compiled for geographical units under the national directives, and it is the quantitative regional analysis procedures that could add values to them. This paper reports our attempts at prototyping a statistical GIS which is capable of serving over the Web a variety of regional analysis routines as well as value-added statistics and maps. A pilot database of some major statistical data was ingested for the city of Seoul. The baseline subset of regional analysis methods of practical usage was selected and accommodated into the business logic of the target system, which ranges from descriptive statistics, regional structure/inequality measures, spatial ANOVA, spatial (auto) correlation to regression and residual analysis. The leading-edge information technologies including the application server were adopted in the system design and implementation so that the database, analysis modules and analytic mapping components may cooperate seamlessly behind the Web front-end. The prototyped system supports tables, maps, and files of downloadable format for input and output of the analyses. One of the most salient features of out proposed system is that both the database and analysis modules are extensible via the bi-directional interface for end users; The system provides users with operators and parsers for algebraic formulae such that the stored statistical variables may be transformed and combined into the newly-derived set of variables. This functionality eventually leads to on-the-fly fabrication of user-defined regional analysis algorithms. The stored dataset may also be temporarily augmented by user-uploaded dataset; The extension of this form, in essence, results in a virtual database which awaits for users commands as usual. An initial evaluation of the proposed system confirms that the issues involving the usage and dissemination of information can be addressed with success.

  • PDF

Integrated Authentication and Key Management Method among Heterogeneous Wireless Mobile Networks (이기종 무선 이동망간 통합 인증 및 키관리 기법)

  • Park Hyung-Soo;Lee Hyung-Woo;Lee Dong-Hoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.50-59
    • /
    • 2006
  • The new communication paradigm is rapidly shifted from wireless mobile networks to an All-IP(Internet Protocol) network, led by service industry leaders and communication manufacturers. In this paradigm, providing authentication and session keys of a subscriber becomes one of the critical tasks because of IP open accessibility among heterogeneous networks. In this paper, we introduce authentication process procedure of heterogeneous wireless mobile networks and develop so-called IMAS(Integrated Mobile Authentication Server) which can securely inter-work among all mobile networks and support the legacy networks with backward compatibility. Especially, in designing IMAS, mobile authentication inter-working mechanism, key management technique, and other issues to be overcome are presented. We analyze and evaluate the performance of authentication algorithm which creates session key. A simulation environment of IMAS is established, and a performance(TPS; Transaction Per Second) result is analyzed and evaluated. It turned out that IMAS works among heterogeneous wireless mobile networks without compensating efficiency and functionalities of the legacy networks and decrease the entropy of data redundancy and data inconsistency among networks because of the integrity of the distributed Data Base(DB).