• Title/Summary/Keyword: parallel/distributed simulation

Search Result 142, Processing Time 0.024 seconds

A Prediction of the Plane Failure Stability Using Artificial Neural Networks (인공신경망을 이용한 평면파괴 안정성 예측)

  • Kim, Bang-Sik;Lee, Sung-Gi;Seo, Jae-Young;Kim, Kwang-Myung
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2002.10a
    • /
    • pp.513-520
    • /
    • 2002
  • The stability analysis of rock slope can be predicted using a suitable field data but it cannot be predicted unless suitable field data was taken. In this study, artificial neural networks theory is applied to predict plane failure that has a few data. It is well known that human brain has the advantage of handling disperse and parallel distributed data efficiently. On the basis of this fact, artificial neural networks theory was developed and has been applied to various fields of science successfully In this study, error back-propagation algorithm that is one of the teaching techniques of artificial neural networks is applied to predict plane failure. In order to verify the applicability of this model, a total of 30 field data results are used. These data are used for training the artificial neural network model and compared between the predicted and the measured. The simulation results show the potentiality of utilizing the neural networks for effective safety factor prediction of plane failure. In conclusion, the well-trained artificial neural network model could be applied to predict the plane failure stability of rock slope.

  • PDF

Structural system simulation and control via NN based fuzzy model

  • Tsai, Pei-Wei;Hayat, T.;Ahmad, B.;Chen, Cheng-Wu
    • Structural Engineering and Mechanics
    • /
    • v.56 no.3
    • /
    • pp.385-407
    • /
    • 2015
  • This paper deals with the problem of the global stabilization for a class of tension leg platform (TLP) nonlinear control systems. It is well known that, in general, the global asymptotic stability of the TLP subsystems does not imply the global asymptotic stability of the composite closed-loop system. Finding system parameters for stabilizing the control system is also an issue need to be concerned. In this paper, we give additional sufficient conditions for the global stabilization of a TLP nonlinear system. In particular, we consider a class of NN based Takagi-Sugeno (TS) fuzzy TLP systems. Using the so-called parallel distributed compensation (PDC) controller, we prove that this class of systems can be globally asymptotically stable. The proper design of system parameters are found by a swarm intelligence algorithm called Evolved Bat Algorithm (EBA). An illustrative example is given to show the applicability of the main result.

Position Control of The Robot Manipulator Using Fuzzy Logic and Multi-layer Neural Network (퍼지논리와 다층 신경망을 이용한 로봇 매니퓰레이터의 위치제어)

  • Kim, Jong-Soo;Jeon, Hong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.2 no.1
    • /
    • pp.17-32
    • /
    • 1992
  • The multi-layer neural network that has broadly been utilized in designing the controller of robot manipulator possesses the desirable characteristics of learning capacity, by which the uncertain variation of the dynamic parameters of robot can be handled adaptively, and parallel distributed processing that makes it possible to control on real-time. However the error back propagation algorithm that has been utilized popularly in the learning of the multi-layer neural network has the problem of its slow convergence speed. In this paper, an approach to improve the convergence speed is proposed using the fuzzy logic that can effectively handle the uncertain and fuzzy informations by linguistic level. The effectiveness of the proposed algorithm is demonstrated by computer simulation of PUMA 560 robot manupulator.

  • PDF

Performance Evaluation of Hash Join Algorithms Supporting Dynamic Load Balancing for a Database Sharing System (데이타베이스 공유 시스템에서 동적 부하분산을 지원하는 해쉬 조인 알고리즘들의 성능 평가)

  • Moon, Ae-Kyung;Cho, Haeng-Rae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3456-3468
    • /
    • 1999
  • Most of previous parallel join algorithms assume a database partition system(DPS), where each database partition is owned by a single processing node. While the DPS is novel in the sense that it can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to the database sharing system(DSS). In this paper, we propose a dynamic load balancing strategy by exploiting the characteristics of the DSS, and then extend the conventional hash join algorithms to the DSS by using the dynamic load balancing strategy. With simulation studies under a wide variety of system configurations and database workloads, we analyze the effects of the dynamic load balancing strategy and differences in the performances of hash join algorithms in the DSS.

  • PDF

Distributed Information Extraction in Wireless Sensor Networks using Multiple Software Agents with Dynamic Itineraries

  • Gupta, Govind P.;Misra, Manoj;Garg, Kumkum
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.123-144
    • /
    • 2014
  • Wireless sensor networks are generally deployed for specific applications to accomplish certain objectives over a period of time. To fulfill these objectives, it is crucial that the sensor network continues to function for a long time, even if some of its nodes become faulty. Energy efficiency and fault tolerance are undoubtedly the most crucial requirements for the design of an information extraction protocol for any sensor network application. However, most existing software agent based information extraction protocols are incapable of satisfying these requirements because of static agent itineraries and large agent sizes. This paper proposes an Information Extraction protocol based on Multiple software Agents with Dynamic Itineraries (IEMADI), where multiple software agents are dispatched in parallel to perform tasks based on the query assigned to them. IEMADI decides the itinerary for an agent dynamically at each hop using local information. Through mathematical analysis and simulation, we compare the performance of IEMADI with a well known static itinerary based protocol with respect to energy consumption and response time. The results show that IEMADI provides better performance than the static itinerary based protocols.

The topographic effect of ground motion based on Spectral Element Method

  • Liu, Xinrong;Jin, Meihai;Li, Dongliang;Hu, Yuanxin;Song, Jianxue
    • Geomechanics and Engineering
    • /
    • v.13 no.3
    • /
    • pp.411-429
    • /
    • 2017
  • A Spectral Element Method for 3D seismic wave propagation simulation is derived based on the three-dimensional fluctuating elastic dynamic equation. Considering the 3D real terrain and the attenuation characteristics of the medium, the topographic effect of Wenchuan earthquake is simulated by using the Spectral Element Method (SEM) algorithm and the ASTER DEM model. Results show that the high PGA (peak ground acceleration) region was distributed along the peak and the slope side away from the epicenter in the epicenter area. The overall distribution direction of high PGA and high PGV (peak ground velocity) region is parallel to the direction of the seismogenic fault. In the epicenter of the earthquake, the ground motion is to some extent amplified under the influence of the terrain. The amplification effect of the terrain on PGA is complicated. It does not exactly lead to amplification of PGA at the ridge and the summit or attenuation of PGA in the valley.

Analysis of Distributed Computational Loads in Large-scale AC/DC Power System using Real-Time EMT Simulation (대규모 AC/DC 전력 시스템 실시간 EMP 시뮬레이션의 부하 분산 연구)

  • In Kwon, Park;Yi, Zhong Hu;Yi, Zhang;Hyun Keun, Ku;Yong Han, Kwon
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.8 no.2
    • /
    • pp.159-179
    • /
    • 2022
  • Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

Determination of Optimum Bead Size by Calculating Effectiveness Factors in Cyclosporin A Fermentation by Immobilized Cells (Cyclosporin A 고정상 발효에서 효율인자의 계산을 통한 고정화 담체의 최적크기 결정)

  • 전계택;이태호장용근
    • KSBB Journal
    • /
    • v.11 no.1
    • /
    • pp.30-36
    • /
    • 1996
  • Based on fermentation data for cyclosporin A production, simple Monod kinetics was proposed for both immobilized and suspended cultures. Higher value of $\mu$mas and lower value of Km suggest better catalytic activity of the immobilized cells than the parallel suspended cells. Furthermore, lower Km value in the immobilized cell system indicates higher affinity of the immobilized cells for carbon substrate as compared with the suspended cells. For immobilized cell cultures, these parameters were also utilized for the estimation of effectiveness factor, an indicator for intraparticle mass transfer resistance. Based on simulation studies, optimum radius of celite beads was turned out $100 ~ 500{\mu}m$In this simulation work, we examined the influence of biosupport size and immobilized biomass density on diffusional resistance of substrate inside the bead matrix. In order to maintain uniformly distributed cell activities in biosupport, it was essential to determine optimum slze of particle, and then to estimate the most economic loaded biomass content.

  • PDF

Resource Availability-based Multi Auction Model for Cloud Service Reservation and Resource Brokering System (자원 가용성 기반 다중 경매 모델을 이용한 서비스 예약형 클라우드 자원 거래 시스템)

  • Lee, Seok Woo;Kim, Tae Young;Lee, Jong Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.1
    • /
    • pp.1-10
    • /
    • 2014
  • A cloud computing is one of a parallel and distributed computing. The cloud computing provides some service for user with virtual resources. However, a user's service request does not show a time pattern. As a result, each resource also shows a different availability at the same time. This difference affects a quality of service (QoS) and a resource selection for users. Therefore, we propose the resource availability-based multi auction model for cloud service reservation and resource brokering system. The proposed system is to select the proper resource provider based on the users' request. The proposal adopts the multi phase of the auction to transact resources. The system evaluates the available factor of each resource on the auction phase, and finally reserves the service on the adaptive queue. The proposed model shows the better performance than other existing method.

A Converting Method to Simulate DEVS Models on AddSIM (컴포넌트기반 체계모의환경(AddSIM)에서 실행하기 위한 DEVS 모델 변환 방법)

  • Kim, Dohyung;Oh, Hyunshik;Park, Juhye;Park, Samjoon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.7
    • /
    • pp.488-493
    • /
    • 2015
  • An AddSIM(Adaptive distributed and parallel Simulation environment for Interoperable and reusable Models) is an integrated engagement simulation environment with high-resolution weapon system models for estimation and analysis of their performance and effectiveness. AddSIM can simultaneously handle the continuous dynamical system models based on continuous time, and command, control(C2) and network system models based on a discrete event. To accommodate legacies based on DEVS(Discrete Event System Specification) modeling, DEVS legacies must first be converted into AddSIM models. This paper describes how to implement DEVS models on AddSIM. In this study a method of mapping from hierarchical DEVS models to AddSIM players was developed: The hierarchical DEVS model should be flattened into a one layered model and four DEVS functions of the model, external transition, internal transition, output and time advance, should be mapped into functions of the AddSIM player.