• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권1호
• /
• pp.100-104
• /
• 2003

The SVDD(support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the kernel feature space in order to distinguish a set of normal data from all other possible abnormal objects. The major concern of this paper is to consider the problem of modifying the SVDD into the direction of utilizing ellipsoids instead of balls in order to enable better classification performance. After a brief review about the original SVDD method, this paper establishes a new method utilizing ellipsoids in feature space, and presents a solution in the form of SDP(semi-definite programming) which is an optimization problem based on linear matrix inequalities.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2019년도 춘계학술대회
• /
• pp.288-289
• /
• 2019

This paper studies the secrecy capacity for a wireless cooperative network with perfect channel state information at the relays, and receiver. A similar assumption is also made for the instance where there exist a direct link between the transmitter and receiver. Physical Layer security techniques are employed in wireless networks to mitigate against the activity of eavesdroppers. It offers a viable alternative to computationally intensive encryption. In this paper the design of a protocol utilizing jamming (via jamming nodes) for better security and relaying (via relay nodes) for the amplify-and-forward (AF) operation, is investigated. A a signal-to-noise variant of secrecy known as secrecy gap is explored because of its use of lesser computational power - preferable for practical systems. Thus we maximize this signal-to-noise approach instead of the conventional secrecy capacity maximization method. With this, an iterative algorithm using geometric programming (GP) and semi-definite programming (SDP) is presented with appreciable benefits. The results show here highlight the benefits of using fractional components of the powers of the relays to offer better secrecy capacity.

• 한국통신학회논문지
• /
• 제41권5호
• /
• pp.539-545
• /
• 2016

이 논문에서는 단말 간 직접 통신(Device-to-Device: D2D) 링크가 있는 셀룰러 망 안에서 증폭 후 전달 (Amplify-and- Forward: AF) 방식의 조력국을 사용하여 D2D 전송률을 높이고 D2D 단말기가 셀룰러 망에 미치는 간섭을 제어하는 방법을 제안한다. 전체 시스템의 quality-of-service (QoS)를 높이기 위해 두 가지 방법으로 조력국을 설계한다. 첫 번째는 D2D 단말기가 셀룰러 망에 미치는 간섭을 제한하면서 최저 D2D 전송률을 최대화하는 문제이고, 두 번째는 이것의 dual 문제인 각 D2D 단말기의 최소 전송률을 보장하면서 D2D 단말기가 셀룰러망에 미치는 간섭을 최소화하는 문제이다. 또한, 이 문제들은 semi-definite programming (SDP) 문제로 바뀔 수 있음을 보인다. 실험 결과에서는 AF 조력국이 시스템의 성능을 획기적으로 향상시킬 수 있음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2546-2566
• /
• 2016

This paper investigates an efficient transmission scheme for the remote wireless sensors to receive information which is rarely discussed in the integrated remote wireless sensor and multibeam satellite networks (IWSMSNs). The networks can be employed to exchange sensing information for emergency scenario, ocean scenario, and so on, which are isolated from available terrestrial networks. As the efficient transmission link is important to the IWSMSNs, we propose a hybrid full frequency (HFF) precoding by taking advantage of frequency reuse and multiple-input multiple-output (MIMO) precoding. Considering energy efficiency and sinks fairness are crucial to transmission link, thus the HFF precoding problems are formulated as transmit power minimization (TPM) and max-min fair (MMF) received signal to interference plus noise ratio (SINR) problems, which can be transformed to indefinite quadratic optimization programs. Then this paper presents a semi-definite programming (SDP) algorithm to solve the problems for the IWSMSNs. The promising potential of HFF for the real IWSMSNs is demonstrated through simulations.

• 대한수학회논문집
• /
• 제9권3호
• /
• pp.753-765
• /
• 1994

The linearly constrained quadratic programming(QP) considered is : $$ min f(x) = c^T x + \frac{1}{2}x^T Hx $$ $$ (1) subject to A^T x \geq b,$$ where $c,x \in R^n, b \in R^m, H \in R^{n \times n)}$, symmetric, and $A \in R^{n \times n}$. If there are bounds on x, these are included in the matrix $A^T$. The Hessian matrix H may be positive definite or negative semi-difinite. For large problems H and the constraint matrix A are assumed to be sparse.

• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.83-99
• /
• 2002

Optimality conditions are derived for a nonlinear program in which a support function appears in the objective as well as in each constraint function. Wolfe and Mond-Weir type duals to this program are presented and various duality results are established under suitable convexity and generalized convexity assumptions. Special cases that often occur in the literature are those in which a support function is the square root of a positive semi- definite quadratic form or an Lp norm. It is pointed out that these special cases can easily be generated from our results.

• 대한수학회지
• /
• 제41권5호
• /
• pp.821-864
• /
• 2004

Both parametric and parameter-free necessary and sufficient optimality conditions are established for a class of nondiffer-entiable nonconvex optimal control problems with generalized fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Based on these optimality results, ten Wolfe-type parametric and parameter-free duality models are formulated and weak, strong, and strict converse duality theorems are proved. These duality results contain, as special cases, similar results for minmax fractional optimal control problems involving square roots of positive semi definite quadratic forms, and for optimal control problems with fractional, discrete max, and conventional objective functions, which are particular cases of the main problem considered in this paper. The duality models presented here contain various extensions of a number of existing duality formulations for convex control problems, and subsume continuous-time generalizations of a great variety of similar dual problems investigated previously in the area of finite-dimensional nonlinear programming.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제7권1호
• /
• pp.1-6
• /
• 2007

The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

• 한국항공우주학회지
• /
• 제38권1호
• /
• pp.35-41
• /
• 2010

최근의 항공기 개발에 있어 조종면을 복수 개로 분할하여 제어함으로써 예기치 못한 결함 발생 시 안전성 및 생존성을 향상 시킬 수 있는 재형상 제어에 관한 연구가 중요하게 대두되어 왔다. 본 논문은 조종면 결함 시 발생 가능한 조종면의 포화를 고려한 모델예측 제어기법을 이용한 재형상 제어를 다룬다. 모델예측 제어의 내부 모델로는 트림 조건에서 선형화된 운동방정식을 사용하며 조종면의 포화가 발생할 경우에 선형행렬부등식 기반의 반한정 프로그래밍을 이용한 최적화를 수행하며 그 외의 경우에는 모델예측 제어기법을 풀어서 구한 해석적인 해를 사용하는 제어기 구조를 제안한다. 제안된 알고리즘의 성능을 확인하기 위해 임의의 조종면 결함 상황에 대한 비선형 시뮬레이션을 수행하였다.