• Current Optics and Photonics
• /
• 제2권5호
• /
• pp.413-421
• /
• 2018

We propose a novel methodology based on the multiplication function to improve the signal-to-noise ratio (SNR) for vibration detection in a phi optical time-domain reflectometer system (phi-OTDR). The extreme-mean complementary empirical mode decomposition (ECEMD) is designed to break down the original signal into a set of inherent mode functions (IMFs). The multiplication function in terms of selected IMFs is used to determine a vibration's position. By this method, the SNR of a phi-OTDR system is enhanced by several orders of magnitude. Simulations and experiments applying the method to real data prove the validity of the proposed approach.

• 정보처리학회논문지D
• /
• 제11D권6호
• /
• pp.1301-1310
• /
• 2004

물리적으로 분산된 개발자들은 분산 페어 프로그래밍 지원 시스템을 활용하여 페어 프로그래밍을 수행할 수 있다. 하지만 원격 화면 공유기능 위주의 기존 CSCW 기반의 분산 페어 프로그래밍 지원 시스템들은 많은 개발자들이 분산 페어 프로그래밍을 수용하기에는 사용의 접근성, 용이성 등의 측면에서 미흡한 점이 많다. 본 논문에서 우리는 소프트웨어 개발자들이 분산 페어 프로그래밍을 수용하기 적합한 형태의 시스템 모델로서 IDE(Integrated Development Environment) 기반의 분산 페어 프로그래밍 시스템을 제안한다. 본 시스템의 GUI와 사용자 시나리오는 분산 페어 프로그래밍이 용이하도록 개발되었으며 디자인 패턴 을 적용하여 확장성이 높도록 시스템을 설계하고 자바언어로 구현하였다. 본 연구결과는 기존의 상업용 IDE에서 분산 페어 프로그래밍 기능과 GUI를 구현하는 개발자들에게 도움이 될 것이다.

• Steel and Composite Structures
• /
• 제33권3호
• /
• pp.319-332
• /
• 2019

This study is aimed to predict the behaviour of channel shear connectors in composite floor systems at different temperatures. For this purpose, a soft computing approach is adopted. Two novel intelligence methods, including an Extreme Learning Machine (ELM) and a Genetic Programming (GP), are developed. In order to generate the required data for the intelligence methods, several push-out tests were conducted on various channel connectors at different temperatures. The dimension of the channel connectors, temperature, and slip are considered as the inputs of the models, and the strength of the connector is predicted as the output. Next, the performance of the ELM and GP is evaluated by developing an Artificial Neural Network (ANN). Finally, the performance of the ELM, GP, and ANN is compared with each other. Results show that ELM is capable of achieving superior performance indices in comparison with GP and ANN in the case of load prediction. Also, it is found that ELM is not only a very fast algorithm but also a more reliable model.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.659-662
• /
• 1998

In this paper, lower and upper possibility distributions are identified to reflect two extreme opinions in portfolio selection problems based on upper and lower possibility distributions are formalized as quadratic programming problems. Portfolios for compromising two extreme opinions from upper and lower possibility distributions and balancing the opinions of a group of experts can be obtained by quadratic optimization problems, respectively.

• 한국국방경영분석학회지
• /
• 제14권1호
• /
• pp.33-41
• /
• 1988

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• 한국국방경영분석학회지
• /
• 제13권2호
• /
• pp.33-41
• /
• 1987

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• 한국측량학회지
• /
• 제19권2호
• /
• pp.163-172
• /
• 2001

본 연구에서는 원격탐사 데이터의 분류방법으로서 이차계획법을 토지피복 추출에 적용하였으며, 주제도 추출에 일반적으로 사용되는 최대우도와 신경망의 분류결과와 정확도를 비교하여 그 적용성을 검토하였다. 그 결과, 이차계획법에 의한 분류방법이 최대우도법에 비하여 평균 6%정도의 향상된 분류결과를 도출할 수 있어서 원격탐사 데이터의 분류에 이차계획법을 적용할 수 있으리라 판단되었다. 또한 이차계획법에 의한 분류에서는 클래스 구성비가 클래스 결정에 직접적인 영향을 주어 기존의 이진적인 분류방법에서 무시되었던 결과 값들을 명확하게 나타낼 수 있었다.

• Management Science and Financial Engineering
• /
• 제10권2호
• /
• pp.103-118
• /
• 2004

$\epsilon$-sensitivity analysis is a kind of methods for performing sensitivity analysis for linear programming. Its main advantage is that it can be directly applied for interior-point methods with a little computation. Although $\epsilon$-sensitivity analysis was proposed several years ago, there have been no studies on its relationship with other sensitivity analysis methods. In this paper, we discuss the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using an optimal basis. First. we present a property of $\epsilon$-sensitivity analysis, from which we derive a simplified formula for finding the characteristic region of $\epsilon$-sensitivity analysis. Next, using the simplified formula, we examine the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using optimal basis when an $\epsilon$-optimal solution is sufficiently close to an optimal extreme solution. We show that under primal nondegeneracy or dual non degeneracy of an optimal extreme solution, the characteristic region of $\epsilon$-sensitivity analysis converges to that of sensitivity analysis using an optimal basis. However, for the case of both primal and dual degeneracy, we present an example in which the characteristic region of $\epsilon$-sensitivity analysis is different from that of sensitivity analysis using an optimal basis.

• Management Science and Financial Engineering
• /
• 제7권1호
• /
• pp.41-56
• /
• 2001

This linear fractional - quadratic bilevel programming problem, in which the leader's objective function is a linear fractional function and the follower's objective function is a quadratic function, is studied in this paper. The leader's and the follower's variables are related by linear constraints. The derivations of the optimality conditions are based on Kuhn-Tucker conditions and the duality theory. It is also shown that the original linear fractional - quadratic bilevel programming problem can be solved by solving a standard linear fractional program and the optimal solution of the original problem can be achieved at one of the extreme point of a convex polyhedral formed by the new feasible region. The algorithm is illustrated with the help of an example.

• 경영과학
• /
• 제10권2호
• /
• pp.11-26
• /
• 1993

This paper presents a new interactive procedure for multiple objective linear programming problem (MOLP). In practical multiple objective linear programming applications, there is usually no need for the decision maker to consider solutions which are not efficient. Therefore, the interactive procedure presented here searches only among efficient solutions and terminates with a solution that is guaranteed to be efficient. It also can converge to nonextreme efficient final solutions rather than being restricted to only extreme efficient points of the feasible set. The procedure does not require sophisticated judgements or inputs from the decision maker. One of the most attractive features of the procedure however, is that the method allows the DM to examine the efficient faces it finds. As iteration goes, the DM can explore a wide variety of efficient faces rather than efficient faces confined to only certain subregion of the feasible set of problem MOLP since the efficient faces that the procedure finds need not be adjacent. This helps the DM explore the nature of the efficient set of problem MOLP and also helps the DM have confidence with a final solution. For these reasons, I feel that the procedure offer significant promise in solving multiple objective linear programs rapidly and in a satisfying manner to the DM.