• Title/Summary/Keyword: 연성 알고리즘

Search Result 71, Processing Time 0.031 seconds

Prediction of Layer Rutting on Pavement Foundations Based on Stress Dependency (응력의존성을 고려한 도로기초의 층변형 예측)

  • Park Seong-Wan
    • Journal of the Korean Geotechnical Society
    • /
    • v.21 no.7
    • /
    • pp.73-80
    • /
    • 2005
  • There are several major practical consequences of stress-dependent properties of unbound pavement foundations. Among those are the stress-dependent modulus and Poisson's ratio's that may change, the compressive stresses that are generated in materials under load, the stiffening and strengthening effect of repeated loading to progressively increase the unbound pavement materials resistance to permanent deformation. In order to study these, the algorithm for predicting deformations on conventional flexible pavements are proposed and the stress-dependent effects on layer deformation are presented in this paper by the developed stress-dependent finite element analysis program with the selected models.

Investigation on Inelastic Behavior of Tall Buildings Based on Efficient Analysis Algorithm (효용적인 알고리즘에 의한 초고층건물의 비탄성 해석 연구)

  • Ju, Young Kyu;Hong, Won Kee;Kim, Sang Dae;Park, Chil Lim
    • Journal of Korean Society of Steel Construction
    • /
    • v.10 no.1 s.34
    • /
    • pp.115-123
    • /
    • 1998
  • In design of tall buildings, the flows of stress and ultimate strength of structures cannot be obtained by the elastic analysis alone. The current inelastic analysis are very impractical for practical engineer due to the amount of work involved in engineering calculation. In this paper the PC-based inelastic analysis by the residual strength ratio concepts is introduced. The efficiency of inelastic analysis is evaluated by comparing the results of inelastic analysis with those of elastic analysis for the existing tall buidling located in Seoul. Some modification in terms of lateral resisting structural system is proposed to improve the system ductility.

  • PDF

Salient Motion Information Detection Method Using Weighted Subtraction Image and Motion Vector (가중치 차 영상과 움직임 벡터를 이용한 두드러진 움직임 정보 검출 방법)

  • Kim, Sun-Woo;Ha, Tae-Ryeong;Park, Chun-Bae;Choi, Yeon-Sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.779-785
    • /
    • 2007
  • Moving object detection is very important for video surveillance in modern days. In special case, we can categorize motions into two types-salient and non-salient motion. In this paper, we first calculate temporal difference image for extract moving objects and adapt to dynamic environments and next, we also propose a new algorithm to detect salient motion information in complex environment by combining temporal difference image and binary block image which is calculated by motion vector using the newest MPEG-4 and EPZS, and it is very effective to detect objects in a complex environment that many various motions are mixed.

A Study on the Ordered Subsets Expectation Maximization Reconstruction Method Using Gibbs Priors for Emission Computed Tomography (Gibbs 선행치를 사용한 배열된부분집합 기대값최대화 방출단층영상 재구성방법에 관한 연구)

  • Im, K. C.;Choi, Y.;Kim, J. H.;Lee, S. J.;Woo, S. K.;Seo, H. K.;Lee, K. H.;Kim, S. E.;Choe, Y. S.;Park, C. C;Kim, B. T.
    • Journal of Biomedical Engineering Research
    • /
    • v.21 no.5
    • /
    • pp.441-448
    • /
    • 2000
  • 방출단층영상 재구성을 위한 최대우도 기대값최대화(maximum likelihood expectation maximization, MLEM) 방법은 영상 획득과정을 통계학적으로 모델링하여 영상을 재구성한다. MLEM은 일반적으로 사용하여 여과후역투사(filtered backprojection)방법에 비해 많은 장점을 가지고 있으나 반복횟수 증가에 따른 발산과 재구성 시간이 오래 걸리는 단점을 가지고 있다. 이 논문에서는 이러한 단점을 보완하기 위해 계산시간을 현저히 단축시킨 배열된부분집합 기대값최대화(ordered subsets expectation maximization. OSEM)에 Gibbs 선행치인 membrance (MM) 또는 thin plate(TP)을 첨가한 OSEM-MAP (maximum a posteriori)을 구현함으로써 알고리즘의 안정성 및 재구성된 영상의 질을 향상시키고자 g나다. 실험에서 알고리즘의 수렴시간을 가속화하기 위해 투사 데이터를 16개의 부분집합으로 분할하여 반복연산을 수행하였으며, 알고리즘의 성능을 비교하기 위해 소프트웨어 모형(원숭이 뇌 자가방사선, 수학적심장흉부)을 사용한 영상재구성 결과를 제곱오차로 비교하였다. 또한 알고리즘의 사용 가능성을 평가하기 위해 물리모형을 사용하여 PET 기기로부터 획득한 실제 투사 데이터를 사용하였다.

  • PDF

Monte Carlo Simulation based Optimal Aiming Point Computation Against Multiple Soft Targets on Ground (몬테칼로 시뮬레이션 기반의 다수 지상 연성표적에 대한 최적 조준점 산출)

  • Kim, Jong-Hwan;Ahn, Nam-Su
    • Journal of the Korea Society for Simulation
    • /
    • v.29 no.1
    • /
    • pp.47-55
    • /
    • 2020
  • This paper presents a real-time autonomous computation of shot numbers and aiming points against multiple soft targets on grounds by applying an unsupervised learning, k-mean clustering and Monte carlo simulation. For this computation, a 100 × 200 square meters size of virtual battlefield is created where an augmented enemy infantry platoon unit attacks, defences, and is scatted, and a virtual weapon with a lethal range of 15m is modeled. In order to determine damage types of the enemy unit: no damage, light wound, heavy wound and death, Monte carlo simulation is performed to apply the Carlton damage function for the damage effect of the soft targets. In addition, in order to achieve the damage effectiveness of the enemy units in line with the commander's intention, the optimal shot numbers and aiming point locations are calculated in less than 0.4 seconds by applying the k-mean clustering and repetitive Monte carlo simulation. It is hoped that this study will help to develop a system that reduces the decision time for 'detection-decision-shoot' process in battalion-scaled combat units operating Dronebot combat system.

Optimi Design for R.C. Beam with Discrete Variables (이산형 설계변수를 갖는 철그콘크리트보의 최적설계)

  • 구봉근;한상훈;김홍룡
    • Magazine of the Korea Concrete Institute
    • /
    • v.5 no.4
    • /
    • pp.167-178
    • /
    • 1993
  • The objective of this paper is to look into the possibility of the detailed and practical optimum design of rt:inforced concrete beam using methods oi discrete mathematical programming. In this discrete optimum formulation, the design variables are the overall depth, width and effective depth of members, and area of longitudinal reinforcement. In addition, the details such as the amount of web reinforcement and cutoff points of longitudinal reinforcement are also considered as variables. Total cost has been used as the objective function. The constraints include the code requirments such as flexural strength, shear strength, ductility, serviceability, concrete cover. spacing, web reinforcement, and development length and cutoff points of longitudinal renforcement. An optimization algorithm is presented for effective optimum design of R.C. beam with discrete de sign variables. First, the continuous variable optimization can be achieved by Feasible Direction Method. Using the results obtained from the continuous variable optimization, a branch and bound method is used to obtained the discrete design values. The proposed algorithm is applied to test problem for reliability, and the results are compared with those of graphical method and rounded-up method. And a simply supported R.C. beam and a two-span continuous R.C. beam are presented as numerical examples for effectiveness and applicability. It is considered that the presented algorithm can be effectively applied to the discrete optimum design of R.C. beams.

Transient Overloads Control Mechanism for Virtual Memory System (가상 메모리 시스템의 일시적인 과부하 완화 기법)

  • Go, Young-Woong;Lee, Jae-Yong;Hong, Cheol-Ho;Yu, Hyukc
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.319-330
    • /
    • 2001
  • In virtual memory system, when a process attempts to access a page that is not resident in memory, the system generates and handles a page fault that causes unpredictable delay. So virtual memory system is not appropriate for the real-time system, because it can increase the deadline miss ratio of real-time task. In multimedia system, virtual memory system may degrade the QoS(quality of service) of multimedia application. Furthermore, in general-purpose operating system, whenever a new task is dynamically loaded, virtual memory system suffers from extensive page fault that cause transient overloading state. In this paper, we present efficient overloading control mechanism called RBPFH (Rate-Based Page Fault Handling). A significant feature of the RBPFH algorithm is page fault dispersion that keeps page fault ratio from exceeding available bound by monitoring current system resources. Furthermore, whenever the amount of available system resource is changed, the RBPFH algorithm dynamically adjusts the page fault handling rate. The RBPFH algorithm is implemented in the Linux operating system and its performance measured. The results demonstrate RBPFH\`s superior performance in supporting multimedia applications. Experiment result shows that RBPFH could achieve 10%∼20% reduction in deadline miss ratio and 50%∼60% reduction in average delay.

  • PDF

Enhancement of Response Time of Real-Time Tasks with Variable Execution Times by Using Shared Bandwidth (가변 실행시간의 실시간 태스크들에 대하여 공유대역폭을 활용한 응답시간의 개선)

  • Kim, Yong-Seok
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.77-85
    • /
    • 2009
  • Execution times of tasks can be variable depend on input data. If we choose a high performance processor to satisfy the worst case execution times, the hard cost becomes high and the energy consumption also becomes large. To apply a lower performance processor, we have to utilize processor capacity maximally while overrunning tasks can not affect deadlines of other tasks. To be used for such systems, this paper presents SBP (Shared Bandwidth Partitioning) that a processor bandwidth is reserved and shared among all tasks. If a task needs more processor capacity, it can use a portion of the shared bandwidth. A simulation result shows that SBP provides better performance than previous algorithms. SBP reduces deadline miss ratio which is related to scheduling quality. And the number of context switches, which is related to system overhead, is also reduced.

A Study on Contents-based Retrieval using Wavelet (Wavelet을 이용한 내용기반 검색에 관한 연구)

  • 강진석;박재필;나인호;최연성;김장형
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.1051-1066
    • /
    • 2000
  • According to the recent advances of digital encoding technologies and computing power, large amounts of multimedia informations such as image, graphic, audio and video are fully used in multimedia systems through Internet. By this, diverse retrieval mechanisms are required for users to search dedicated informations stored in multimedia systems, and especially it is preferred to use contents-based retrieval method rather than text-type keyword retrieval method. In this paper, we propose a new contents-based indexing and searching algorithm which aims to get both high efficiency and high retrieval performance. To achieve these objectives, firstly the proposed algorithm classifies images by a pre-processing process of edge extraction, range division, and multiple filtering, and secondly it searches the target images using spatial and textural characteristics of colors, which are extracted from the previous process, in a image. In addition, we describe the simulation results of search requests and retrieval outputs for several images of company's trade-mark using the proposed contents-based retrieval algorithm based on wavelet.

  • PDF

Development of DCOC Algorithm Considering the Variation of Effective Depth in the Optimum Design of PRC Continuous Beam (PRC연속보 최적설계에서 단면의 유효깊이 변화를 고려한 DCOC알고리즘 개발)

  • 조홍동;한상훈
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.2
    • /
    • pp.281-291
    • /
    • 2002
  • This paper describes the minimum cost design of prestressed reinforced concrete (PRC) hem with rectangular section. The cost of construction as objective function which includes the costs of concrete, prestressing steel, non prestressing steel, and formwork is minimized. The design constraints include limits on the minimum deflection, flexural and shear strengths, in addition to ductility requirements, and upper-Lower bounds on design variables as stipulated by the specification. The optimization is carried out using the methods based on discretized continuum-type optimality criteria(DCOC). Based on Kuhn-Tucker necessary conditions, the optimality criteria are explicitly derived in terms of the design variables - effective depth, eccentricity of prestressing steel and non prestressing steel ratio. The prestressing profile is prescribed by parabolic functions. In this paper the effective depth is considered to be freely-varying and one uniform for the entire multispan beam respectively. Also the maximum eccentricity of prestressing force is considered in every span. In order to show the applicability and efficiency of the derived algorithm, several numerical examples of PRC continuous beams are solved.