• Title/Summary/Keyword: Dynamic Process

Search Result 4,330, Processing Time 0.04 seconds

An application of wave equation analysis program to pile dynamic formulae

  • Tokhi, H.;Ren, G.;Li, J.
    • Geomechanics and Engineering
    • /
    • v.9 no.3
    • /
    • pp.345-360
    • /
    • 2015
  • Wave equation analysis programs (WEAP) such as GRLWEAP and TNOWave were primarily developed for pre-driving analysis. They can also be used for post-driving measurement applications with some refinements. In the case of pre-driving analysis, the programs are used for the purpose of selecting the right equipment for a given ground condition and controlling stresses during pile driving processes. Recently, the program is increasingly used for the post-driving measurement application, where an assessment based on a variety of input parameters such as hammer, driving system and dynamic behaviour of soil is carried out. The process of this type of analysis is quite simple and it is performed by matching accurately known parameters, such as from CAPWAP analysis, to the parameters used in GRLWEAP analysis. The parameters that are refined in the typical analysis are pile stresses, hammer energy, capacity, damping and quakes. Matching of these known quantities by adjusting hammer, cushion and soil parameters in the wave equation program results in blow counts or sets and stresses for other hammer energies and capacities and cushion configuration. The result of this analysis is output on a Bearing Graph that establishes a relationship between ultimate capacity and net set per blow. A further application of this refinement method can be applied to the assessment of dynamic formulae, which are extensively used in pile capacity calculation during pile driving process. In this paper, WEAP analysis is carried out to establish the relationship between the ultimate capacities and sets using the various parameters and using this relationship to recalibrate the dynamic formula. The results of this analysis presented show that some of the shortcoming of the dynamic formula can be overcome and the results can be improved by the introduction of a correction factor.

Architecture and Hardwarw Implementation of Dynamic GSMP V3 with Dynamic Buffer Management Scheme (동적 버퍼관리 방식의 Dynamic GSMP V3의 구조와 하드웨어 구현)

  • Kim, Young-Chul;Lee, Tae-Won;Kim, Kwang-Ok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.8
    • /
    • pp.30-41
    • /
    • 2001
  • In this paper, the architecture of Dynamic GSMP V3(General Switch Management Protocol Version 3), an open interface protocol with resource management functions for efficient IP service on ATM over MPLS, is proposed and implemented in hardware. And we compare and analyze the proposed GSMP with the GSMP under standardization process in terms of CLR (Cell Loss Rate). We design the Slave block of the Dynamic GSMP V3 using SAM-SUNG SoG $0.5{\mu}m$ process, which performs functions for switch connection control in the ATM Switch. In order to compare difference performanaces between the proposed method and the conventional one, we conducts simulations using the minimum buffer search algorithm with random cell generation. The exponential results show that the proposed method leads to performance enhancement in CLR.

  • PDF

A Empirical Study on Effects of Dynamic Capabilities and Entrepreneurial Orientation of SMEs on Big Data Utilization Intention (중소기업의 동적역량과 기업가지향성이 빅 데이터 활용의도에 미치는 영향에 관한 실증연구)

  • Han, Byung Jae;Yang, Dong Woo
    • Journal of Digital Convergence
    • /
    • v.16 no.11
    • /
    • pp.237-253
    • /
    • 2018
  • In a rapidly changing environment, dynamic resources have become important factors for companies, the use of Big Data come into focus new core value of business but researches on the major resources and capabilities of companies are insufficient. In this study, the effect of dynamic capability and entrepreneurial orientation in the SMEs on the intention of Big Data utilization are explored. For the purpose of empirical analysis, the survey condusted of 364 domestic SMEs to analyze the effect of dynamic capability on the intention of Big Data utilization through entrepreneurial orientation, performed a parallel multi-parameter analysis of using SPSS Win Ver.22.0 and PROCESS macro v3.0. The results of hypothesis testing showing that dynamic resources and entrepreneurial orientation had positive influence intention of big data utilization. For the determinants of Big Data utilization related to AI it provide suggestions thereby improving the understanding of dynamic capabilities and entrepreneurial orientation and helping to improve the management of SMEs.

Comparison and Analysis on the Process of Master Curve Determination for Hot Mix Asphalt (아스팔트 혼합물의 마스터곡선 작성 방법의 비교 및 분석)

  • Lee, Kwan-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.9
    • /
    • pp.4199-4204
    • /
    • 2011
  • The dynamic modulus of hot mix asphalt is one of the important indicators to evaluate the durability and performance of asphalt pavement. In resent, the dynamic modulus is suggested by a key property of asphalt pavement design and analysis in AASHTO 2002 Design Guide and Korean Pavement Research Project(KPRP). Master curve from laboratory test results should be needed for pavement design and analysis. The process to get the master curve is standardized. But, there are some setup and testing error at low temperature(-$10^{\circ}C$) and high temperature ($55^{\circ}C$). In this paper, a simplified process which is used 3 testing temperatures (5, 21, 40) is adopted to get the master curve. Comparison was carried out for standard process and simplified process. The suggested process can be used to get the master curve of asphalt pavement, even though some difference was shown at high temperature.

ANALYSIS OF DYNAMIC PRIORITY QUEUE WITH APPLICATIONS IN ATM NETWORKS

  • Choi, Doo-Il;Lee, Yu-Tae
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.2
    • /
    • pp.617-627
    • /
    • 2000
  • ATM networks support diverse traffic types with different service requirement such as data, voice, video and image. This paper analyzes a dynamic priority queue to satisfy Quality of Service (QoS) requirements of traffic. to consider the burstiness of traffic, we assume the arrival to be a Markovian arrival process(MAP) . Performance measures such as loss and delay are derived, Finally, some numerical results show the performance of the system.

Optimal Control of Large-Scale Dynamic Systems using Parallel Processing (병렬처리를 이용한 대규모 동적 시스템의 최적제어)

  • Park, Ki-Hong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.4
    • /
    • pp.403-410
    • /
    • 1999
  • In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

  • PDF

A Dynamic Discount Approach to the Poisson Process

  • Shim, Joo-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.8 no.2
    • /
    • pp.271-276
    • /
    • 1997
  • A dynamic discount approach is proposed for the estimation of the Poisson parameter and the forecasting of the Poisson random variable, where the parameter of the Poisson distribution varies over time intervals. The recursive estimation procedure of the Poisson parameter is provided. Also the forecasted distribution of the Poisson random variable in the next time interval based on the information gathered until the current time interval is provided.

  • PDF

DYNAMIC DESIGN METHODS OF ROCK ENGINEERING

  • Feng, Xia-Ting
    • Proceedings of the Korean Society for Rock Mechanics Conference
    • /
    • 2011.09a
    • /
    • pp.23-33
    • /
    • 2011
  • The key features of an intelligent and dynamic design methodology for rock engineering projects has been introduced and summarized firstly, which include some new functions such as intelligent recognition of mechanical rockmass parameters, strategies to select modeling methods and codes, integrated feedback modeling and information, and technical auditing in rock engineering design process. Then typical examples of applications of the dynamic design methodology in some large slopes, underground powerhouses in China are summarized. The discussions are given for the future of the methodology.

  • PDF

A Decomposition Method for the Multi-stage Dynamic Location Problem

  • Kahng, Hyun-Kon
    • Management Science and Financial Engineering
    • /
    • v.1 no.1
    • /
    • pp.21-37
    • /
    • 1995
  • This paper suggests a procedure of decomposing a multi-stage dynamic location problem into stages with respect stage. The problem can be formulated as a mixed integer programming problem, which is difficult to be solved directly. We perform a series of transformations in order to divide the problem into stages. In the process, the assumption of PSO (production-system-only) plays a critical role. The resulting subproblem becomes a typical single-stage dynamic location problem, whose efficient algorithms have been developed efficiently. An extension of this study is to find a method to integrate the solutions of subproblems for a final solution of the problem.

  • PDF

Control of an stochastic nonlinear system by the method of dynamic programming

  • Choi, Wan-Sik
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.156-161
    • /
    • 1994
  • In this paper, we consider an optimal control problem of a nonlinear stochastic system. Dynamic programming approach is employed for the formulation of a stochastic optimal control problem. As an optimality condition, dynamic programming equation so called the Bellman equation is obtained, which seldom yields an analytical solution, even very difficult to solve numerically. We obtain the numerical solution of the Bellman equation using an algorithm based on the finite difference approximation and the contraction mapping method. Optimal controls are constructed through the solution process of the Bellman equation. We also construct a test case in order to investigate the actual performance of the algorithm.

  • PDF