• Structural Engineering and Mechanics
• /
• 제8권4호
• /
• pp.325-341
• /
• 1999

A procedure for the computation of the load carrying capacity of perfectly plastic plates in bending is presented. The approach, based on the kinematic theorem of limit analysis, requires the evaluation of the minimum of a convex, but non-smooth, function under linear equality constraints. A systematic solution procedure is devised, which detects and eliminates the finite elements which are predicted as rigid in the collapse mechanism, thus reducing the problem to the search for the minimum of a smooth and essentially unconstrained function of nodal velocities. Both Kirchhoff and Mindlin plate models are considered. The effectiveness of the approach is illustrated by means of some examples.

• 대한기계학회논문집
• /
• 제14권2호
• /
• pp.331-338
• /
• 1990

In adaptive control, the lack of persistent and rich excitation causes the estimated parameters to drift, which degrade the performance of the system and may introduces instability to the system in a stochastic environment. To solve the problem of the parameter drift, the concept of single parameter adaptation is presented. For the parameter identification, a priori error is directly used for adaptation error. The structure of the controller is based upon the minimum variance control technique. The stability and robustness analysis is carried out by the sector stability theorem for the second order system. The computer simulation is performed to justify the theoretical analysis for the various cases.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.23-30
• /
• 2002

본 연구는 추가제약이 있는 최소 신장나무 문제(Constrained Minimum Spanning Tree : CMST문제)에 대한 유사다항시간 알고리듬 및 근사 해법 개발에 관한 것이다. CMST문제는 NP-hard문제임이 이미 증명되었으며, 이후 이 문제에 대해서는 근사해법 개발이 주된 관심이 되어왔다 [Ravi and Goemans 96]는 다항시간 근사 해법(PTAS)을 이미 개발하였고, [Marathe et at 98]은 가능해(feasible solution)는 아니지만, 앞으로 서술할 $(1+1/\varepsilon,\;+\epsilon)$사해를 구하는 완전다항시간 근사해법 (FPTAS)을 제시하였다. 이와는 달리 [Papa. and Yan, 00]는 파레토 근사 최적해를 구하는 FPTAS를 제시하였는데, 본 연구는 이들의 연구에서 주로 의존하고 있는 행렬-나무 정리(Tree-Matrix Theorem)를 보다 일반화하여, CMST문제에 대한 유사다항시간 알고리듬과 $(1+\varepsilon,\;1+\epsilon)$근사해를 구하는 FPTAS를 제시할 것이다.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.105-114
• /
• 1993

In this article, a planar geodesic (2-dimensional minimum length curve between two points) on which the maximum curvature is constrained and with prescribed initial and terminal directions is studied. A generic problem is formulated by the minimum-time optimal control problem in free terminal time. It is shown that the optimal path ($G^2$) may contain a singular arc or not and that the general types of $G^2$ can he classified into the 3 classes of control sequences. Finally, the explicit form of $G^2$ is derived geometrically as well as algebraically form the main theorem of this article.

• 대한수학회지
• /
• 제59권3호
• /
• pp.595-619
• /
• 2022

The purpose of this paper is to introduce an iterative algorithm for approximating a solution of split equality variational inequality problem for pseudomonotone mappings in the setting of Banach spaces. Under certain conditions, we prove a strong convergence theorem for the iterative scheme produced by the method in real reflexive Banach spaces. The assumption that the mappings are uniformly continuous and sequentially weakly continuous on bounded subsets of Banach spaces are dispensed with. In addition, we present an application of our main results to find solutions of split equality minimum point problems for convex functions in real reflexive Banach spaces. Finally, we provide a numerical example which supports our main result. Our results improve and generalize many of the results in the literature.

• 한국항해항만학회지
• /
• 제38권6호
• /
• pp.689-694
• /
• 2014

The Korean government has introduced and enforced maritime traffic safety assessment to secure traffic safety since 2010. The maritime traffic safety assessment is needed by law to design a new port or modify an existing one. According to Korea Maritime Safety Act, in the assessment the propriety of marine traffic system consists of the safety of channel transit and berthing/unberthing maneuver, safety of mooring, and safety of marine traffic flow. The safety of channel transit and berthing/unberthing maneuver can be evaluated only by ship-handling simulation. The ship-handling simulation is carried out by sea pilots working with the port concerned. The vessel's proximity measure is an important factor to evaluate traffic safety. The proximity measure is composed of vessel's closest distance to channel boundary and probability of grounding/collision. What is more, the probability of grounding becomes important. According to central limit theorem, a sample has a normal distribution on condition that its size is more than 30. However, more than 30 simulation runs bring about the increase of assessment period and difficulty of employing sea pilots. Therefore this paper is to find out minimum sample size for evaluating vessel's proximity. First sample sets of size of 3, 5, 7, 9 etc. are selected randomly on the basis of normal distribution. And then KS test for goodness of fit and t-test for confidence interval are applied to each sample set. Finally this paper decides the minimum sample size. As a result this paper suggests the minimum sample size of 5, that is, the simulation of more than five times.

• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.101-108
• /
• 1997

The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.825-826
• /
• 2006

In this paper, we propose an algorithm that applies Rolle's theorem to automatically detect and label peak III and V of the normal, suprathreshold auditory brainstem response (ABR). ABR waveform were recorded from 55 normal-hearing ears at screening levels varying from 30 to 60 dBnHL. For each ABR waveform, the peak-finding algorithm proceeded in fourth steps: (1) Select maximum and minimum values of the target ABR waveform, (2) divide this range into n equal parts, (3) effective candidate peaks in the ABR waveform are identified using Rolle's theorem (4) peak III and V are identified from these candidate peaks based on their latency and morphology. As a result, proposed auto dectection method showed high correlation and accuracy with manual detection method performed by clinician. By using proposed algorithm, clinician can detect and label peak III and V faster and more efficient than manual detection method.

• Journal of Information Processing Systems
• /
• 제19권2호
• /
• pp.149-163
• /
• 2023

Affected by external factors, errors in time series data collected by sensors are common. Using the traditional method of constraining the speed change rate to clean the errors can get good performance. However, they are only limited to the data of stable changing speed because of fixed constraint rules. Actually, data with uneven changing speed is common in practice. To solve this problem, an online cleaning algorithm for time series data based on dynamic speed change rate constraints is proposed in this paper. Since time series data usually changes periodically, we use the extreme learning machine to learn the law of speed changes from past data and predict the speed ranges that change over time to detect the data. In order to realize online data repair, a dual-window mechanism is proposed to transform the global optimal into the local optimal, and the traditional minimum change principle and median theorem are applied in the selection of the repair strategy. Aiming at the problem that the repair method based on the minimum change principle cannot correct consecutive abnormal points, through quantitative analysis, it is believed that the repair strategy should be the boundary of the repair candidate set. The experimental results obtained on the dataset show that the method proposed in this paper can get a better repair effect.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.557-559
• /
• 2005

This paper proposes a method for choosing the best composite power system expansion plan considering a contingency security criterion. The proposed method minimizes the investment budget fer constructing new transmission lines subject to contingency criterion. it models the power system expansion problem as an integer programming one. The method solves for the optimal strategy using a branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Although the proposed method is applied to a simple sample study, the test results demonstrate that the proposed method is suitable for solving the power system expansion-planning problem subject to practical future uncertainties.