• 제목/요약/키워드: time integration algorithm

검색결과 349건 처리시간 0.025초

Dynamic responses of a beam with breathing cracks by precise integration method

  • Cui, C.C.;He, X.S.;Lu, Z.R.;Chen, Y.M.;Liu, J.K.
    • Structural Engineering and Mechanics
    • /
    • 제60권5호
    • /
    • pp.891-902
    • /
    • 2016
  • The beam structure with breathing cracks subjected to harmonic excitations was modeled by FEM based on Euler-Bernoulli theory, and a piecewise dynamical system was deduced. The precise integration method (PIM) was employed to propose an algorithm for analyzing the dynamic responses of the deduced system. This system was first divided into linear sub-systems, between which there are switching points resulted from the breathing cracks. The inhomogeneous terms due to the external excitations were tackled by introducing auxiliary variables to express the harmonic functions, hence the sub-systems are homogeneous. The PIM was then applied to solve the homogeneous sub-systems one by one. During the procedures, a predictor-corrector algorithm was presented to determine the switching points accurately. The presented method can provide solutions with an accuracy to a magnitude of $10^{-12}$ compared with exact solutions obtained by the theories of ordinary differential equations. The PIM results are much more accurate than Newmark ones with the same time step. Moreover, it is found that the PIM can maintain a high level of accuracy even when the time step increases within a relatively wide range.

GPS probe 및 루프 검지기 자료의 융합을 통한 통행시간추정 알고리즘 개발 (A development of travel time estimation algorithm fusing GPS probe and loop detector)

  • 정연식;최기주
    • 대한교통학회지
    • /
    • 제17권3호
    • /
    • pp.97-116
    • /
    • 1999
  • The growing demand for the real time traffic information is bringing about the category and number of traffic collection mechanism in the era of ITS. There are, however, two problems in making data into information using various traffic data. First, the information making process of making data into the representative information, for each traffic collection mechanism, for the specified analysis periods is required. Second, the integration process of fusing each representative information into "the information" for each link out of each source is also required. That is, both data reduction and/or data to information process and information fusion are required. This article is focusing on the development of information fusing algorithm based on voting technique, fuzzy regression, and, Bayesian pooling technique for estimating the dynamic link travel time of networks. The proposed algorithm has been validated using the field experiment data out of GPS probes and detectors over the roadways and the estimated link travel time from the algorithm is proved to be more useful than the mere arithmetic mean from each traffic source.

  • PDF

다중플랜트 네트워크에서의 공급사슬계획 (Supply Chain Planning in Multiplant Network)

  • 정재혁;문치웅;김종수
    • 한국산업경영시스템학회:학술대회논문집
    • /
    • 한국산업경영시스템학회 2002년도 춘계학술대회
    • /
    • pp.203-208
    • /
    • 2002
  • In case of the problems with multiple plants, alternative operation sequence, alternative machine, setup time, and transportation time between plants, we need a robust methodology for the integration of process planning and scheduling in supply chain. The objective of this model is to minimize the tardiness and to maximize the resource utilization. So, we propose a multi-objective model with limited-capacity constraint. To solve this model, we develope an efficient and flexible model using adaptive genetic algorithm(AGA), compared to traditional genetic algorithm(TGA)

  • PDF

광 마우스 센서를 이용한 이동로봇 좌표추정 (Coordinate Estimation of Mobile Robot Using Optical Mouse Sensors)

  • 박상형;이수영
    • 제어로봇시스템학회논문지
    • /
    • 제22권9호
    • /
    • pp.716-722
    • /
    • 2016
  • Coordinate estimation is an essential function for autonomous navigation of a mobile robot. The optical mouse sensor is convenient and cost-effective for the coordinate estimation problem. It is possible to overcome the position estimation error caused by the slip and the model mismatch of robot's motion equation using the optical mouse sensor. One of the simple methods for the position estimation using the optical mouse sensor is integration of the velocity data from the sensor with time. However, the unavoidable noise in the sensor data may deteriorate the position estimation in case of the simple integration method. In general, a mobile robot has ready-to-use motion information from the encoder sensors of driving motors. By combining the velocity data from the optical mouse sensor and the motion information of a mobile robot, it is possible to improve the coordinate estimation performance. In this paper, a coordinate estimation algorithm for an autonomous mobile robot is presented based on the well-known Kalman filter that is useful to combine the different types of sensors. Computer simulation results show the performance of the proposed localization algorithm for several types of trajectories in comparison with the simple integration method.

Conjunctive Query Rewriting in the Context of Data Integration

  • Moon, Kang-Sik;Lee, Jeon-Young
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
    • /
    • pp.441-447
    • /
    • 2001
  • The problem of query rewriting using views has interested in the context of data integration where source data is described by the views on global relations. When the query and views are of the form of conjunctive queries, the rewriting is a union of conjunctive queries each of which is contained in the original query and consists of only views. Most previous methods for query rewriting using views are 2-step algorithms. In the first step, they identify the views that are useful in rewriting and in the second step they construct all correct rewritings by combining the views that gained in the first step. The larger the number of selected views in the first step, the larger the number of candidate rewritings in the second step. We want to minimize the number of selected views in the first step by defining stringent conditions for a view to be participated in rewritings. In this paper, first we offer a necessary condition for the existence of a rewriting that includes a view. For the common case that predicate repetitions are not allowed in the bodies of views, we show that our algorithm for testing the condition is done in a polynomial-time. Second, we offer an algorithm to construct contained rewritings using the view instances that are computed in the first step. The exponential containment-mapping test in the second step is not needed in our algorithm.

  • PDF

PREDICTION OF THE DETECTION LIMIT IN A NEW COUNTING EXPERIMENT

  • Seon, Kwang-Il
    • 천문학회지
    • /
    • 제41권4호
    • /
    • pp.99-107
    • /
    • 2008
  • When a new counting experiment is proposed, it is crucial to predict whether the desired source signal will be detected, or how much observation time is required in order to detect the signal at a certain significance level. The concept of the a priori prediction of the detection limit in a newly proposed experiment should be distinguished from the a posteriori claim or decision whether a source signal was detected in an experiment already performed, and the calculation of statistical significance of a measured source signal. We formulate precise definitions of these concepts based on the statistical theory of hypothesis testing, and derive an approximate formula to estimate quickly the a priori detection limit of expected Poissonian source signals. A more accurate algorithm for calculating the detection limits in a counting experiment is also proposed. The formula and the proposed algorithm may be used for the estimation of required integration or observation time in proposals of new experiments. Applications include the calculation of integration time required for the detection of faint emission lines in a newly proposed spectroscopic observation, and the detection of faint sources in a new imaging observation. We apply the results to the calculation of observation time required to claim the detection of the surface thermal emission from neutron stars with two virtual instruments.

Highly accurate family of time integration method

  • Rezaiee-Pajand, Mohammad;Esfehani, S.A.H.;Karimi-Rad, Mahdi
    • Structural Engineering and Mechanics
    • /
    • 제67권6호
    • /
    • pp.603-616
    • /
    • 2018
  • In this study, the acceleration vector in each time step is assumed to be a mth order time polynomial. By using the initial conditions, satisfying the equation of motion at both ends of the time step and minimizing the square of the residual vector, the m+3 unknown coefficients are determined. The order of accuracy for this approach is m+1, and it has a very low dispersion error. Moreover, the period error of the new technique is almost zero, and it is considerably smaller than the members of the Newmark method. The proposed scheme has an appropriate domain of stability, which is greater than that of the central difference and linear acceleration techniques. The numerical tests highlight the improved performance of the new algorithm over the fourth-order Runge-Kutta, central difference, linear and average acceleration methods.

면역알고리즘 기반의 MECs (에너지 허브) 시스템 (An Immune Algorithm based Multiple Energy Carriers System)

  • 손병락;강유경;이현
    • 한국태양에너지학회 논문집
    • /
    • 제34권4호
    • /
    • pp.23-29
    • /
    • 2014
  • Recently, in power system studies, Multiple Energy Carriers (MECs) such as Energy Hub has been broadly utilized in power system planners and operators. Particularly, Energy Hub performs one of the most important role as the intermediate in implementing the MECs. However, it still needs to be put under examination in both modeling and operating concerns. For instance, a probabilistic optimization model is treated by a robust global optimization technique such as multi-agent genetic algorithm (MAGA) which can support the online economic dispatch of MECs. MAGA also reduces the inevitable uncertainty caused by the integration of selected input energy carriers. However, MAGA only considers current state of the integration of selected input energy carriers in conjunctive with the condition of smart grid environments for decision making in Energy Hub. Thus, in this paper, we propose an immune algorithm based Multiple Energy Carriers System which can adopt the learning process in order to make a self decision making in Energy Hub. In particular, the proposed immune algorithm considers the previous state, the current state, and the future state of the selected input energy carriers in order to predict the next decision making of Energy Hub based on the probabilistic optimization model. The below figure shows the proposed immune algorithm based Multiple Energy Carriers System. Finally, we will compare the online economic dispatch of MECs of two algorithms such as MAGA and immune algorithm based MECs by using Real Time Digital Simulator (RTDS).

복구조정 활동과 복구조정 후 시간경과에 따라 퇴화하는 작업시간을 갖는 단일기계의 일정계획에 관한 연구 (A Study on Single Machine Scheduling with a Rate-Modifying Activity and Time-Dependent Deterioration After the Activity)

  • 김병수;주철민
    • 경영과학
    • /
    • 제30권1호
    • /
    • pp.15-24
    • /
    • 2013
  • We consider the single machine scheduling problem with a rate-modifying activity and time-dependent deterioration after the activity. The class of scheduling problems with rate-modifying activities and the class of scheduling problems with time-dependent processing times have been studied independently. However, the integration of these classes is motivated by human operators of tasks who has fatigue while carrying out the operation of a series of tasks. This situation is also applicable to machines that experience performance degradation over time due to mal-position or mal-alignment of jobs, abrasion of tools, and scraps of operations, etc. In this study, the integration of the two classes of scheduling problems is considered. We present a mathematical model to determine job-sequence and a position of a rate-modifying activity for the integration problem. Since the model is difficult to solve as the size of real problem being very large, we propose genetic algorithms. The performance of the algorithms are compared with optimal solutions with various problems.

직접적분법의 비교 (comparison of direct Integration methos)

  • 지현우
    • 한국지진공학회:학술대회논문집
    • /
    • 한국지진공학회 1999년도 추계 학술발표회 논문집 Proceedings of EESK Conference-Fall
    • /
    • pp.155-161
    • /
    • 1999
  • Many direct integration methods have been developed for dynamic analysis of structures, In order to compare each other methods and give guideline for selecting a time increment the amplification matrix is constructed according to algorithm of each method and stability and accuracy analysis is done. Four story shear building under external excitations is analyzed by each method and the RMS errors of displacements of top floor and compared with each other.

  • PDF