• 전기의세계
• /
• 제31권3호
• /
• pp.209-217
• /
• 1982

This paper considers a finite spectrum assignment Problem for a functional retarded linear differential system with delays in control only. In this problem, by generalizing from an abstract linear system characterized by Semigroups on a Hilbert space to a finite dimensional linear system, we unify the relationship between a control-delayed system and its non-delayed system, and then by using the spectrum of the generator-decomposition of Semigroup, we try to get a feedback law which yields a finite spectrum of the closed-loop system, located at an arbitrarily preassigned sets of n points in the complex plane. The comparative examinations between the standard spectrum assignment method and the method of spectral projection for the feedback law which consists of proportional and finite interval terms over present and past values of control variables are also considered. The analysis is carry down to the elementary spectral projection level because, in spite of all the research efforts, so far there has been no significant attempt to obtain the feedback implementation directly from the abstract representation forms in the case of multivariables.

• 콘크리트학회논문집
• /
• 제18권3호
• /
• pp.347-354
• /
• 2006

본 논문에서는 웨이블릿 변환이론을 동적 응답변환 알고리즘에 적용하였다. 응답변환 알고리즘에서는 변환응답의 정의에 따라 변위자료를 평가할 수 있는 기법이 제시되었으며, 측정된 가속도신호의 적분에 의한 속도와 변위응답의 추정에서 속도와 변위성분의 초기조건에 대한 정보가 불필요하도록 유도되었다. 웨이블릿 변환은 순수한 스펙트럼 해석뿐만 아니라 시간영역에서의 분해신호를 추출하는데 있어 시간-주파수 공간에서의 실제 신호형상을 제공하는 장점을 갖고 있다. 웨이블릿 분해신호를 사용한 응답변환에서는 추정된 변위곡선에서 정적성분을 추출하거나 동적 변위성분의 모우드별 분리를 가능하게 한다. 제시된 응답변환 알고리즘의 타당성을 평가하기 위해 이동하중이 재하된 실 교량의 현장시험자료를 적용하였다. 교량의 동적 재하시험에서 추정응답의 신뢰도가 확보될 경우에 제시된 방법에 의한 보다 정확한 충격계수의 평가가 가능할 것으로 사료되며, 직접적인 변위의 측정이 곤란한 대형구조물에 대한 동특성의 평가에서도 유용하게 적용될 수 있을 것으로 판단된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.921-940
• /
• 2015

In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.

• ETRI Journal
• /
• 제37권3호
• /
• pp.471-479
• /
• 2015

Traditional designs of cognitive radio (CR) focus on maximizing system throughput. In this paper, we study the joint overlay and underlay power allocation problem for orthogonal frequency-division multiple access-based CR. Instead of maximizing system throughput, we aim to maximize system energy efficiency (EE), measured by a "bit per Joule" metric, while maintaining the minimal rate requirement of a given CR system, under the total power constraint of a secondary user and interference constraints of primary users. The formulated energy-efficient power allocation (EEPA) problem is nonconvex; to make it solvable, we first transform the original problem into a convex optimization problem via fractional programming, and then the Lagrange dual decomposition method is used to solve the equivalent convex optimization problem. Finally, an optimal EEPA allocation scheme is proposed. Numerical results show that the proposed method can achieve better EE performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2063-2081
• /
• 2018

A resource allocation algorithm is proposed in this paper to simultaneously minimize the total system power consumption and maximize the system throughput for the downlink of multi-user multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems. With the Lagrange dual decomposition method, we transform the original problem to its convex dual problem and prove that the duality gap between the two problems is zero, which means the optimal solution of the original problem can be obtained by solving its dual problem. Then, we use convex optimization method to solve the dual problem and utilize bisection method to obtain the optimal dual variable. The numerical results show that the proposed algorithm is superior to traditional single-objective optimization method in both the system throughput and the system energy consumption.

• ETRI Journal
• /
• 제44권5호
• /
• pp.746-758
• /
• 2022

This paper focuses on a mobile edge-computing-enabled heterogeneous network. A battery level-aware task-scheduling framework is proposed to improve the energy efficiency and prolong the operating hours of battery-powered mobile devices. The formulated optimization problem is a typical mixed-integer nonlinear programming problem. To solve this nondeterministic polynomial (NP)-hard problem, a decomposition-based task-scheduling algorithm is proposed. Using an alternating optimization technology, the original problem is divided into three subproblems. In the outer loop, task offloading decisions are yielded using a pruning search algorithm for the task offloading subproblem. In the inner loop, closed-form solutions for computational resource allocation subproblems are derived using the Lagrangian multiplier method. Then, it is proven that the transmitted power-allocation subproblem is a unimodal problem; this subproblem is solved using a gradient-based bisection search algorithm. The simulation results demonstrate that the proposed framework achieves better energy efficiency than other frameworks. Additionally, the impact of the battery level-aware scheme on the operating hours of battery-powered mobile devices is also investigated.

• 호남수학학술지
• /
• 제38권3호
• /
• pp.583-592
• /
• 2016

In this paper, we consider the global existence of strong solutions to the incompressible Navier-Stokes equations on the cubic domain in $R^3$. While the global existence for arbitrary data remains as an important open problem, we here provide with some new observations on this matter. We in particular prove the global existence result when ${\Omega}$ is a cubic domain and initial and forcing functions are some linear combination of functions of at most two variables and the like by decomposing the spectral basis differently.

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

본 연구는 리드타임이 상이한 다단계의 공급 사슬에서 수송비용과 재고비용을 최소화하는 다기간의 차량일정계획 수립에 관한 연구이다. 일반적인 공급사슬모형과 차량일정계획 문제를 통합한 모형으로서, 각 단계의 가용차량과 차량 용량이 제한된 제약조건하에서 비용을 최소화하는 차량일정을 구하는 문제이다. 본 연구에서는 이에 대한 최적화 수리모형과 2단계의 분할해법을 제시하였으며, 다양한 공급사슬모형에 대한 발견적 기법의 성능을 분석하였다.

• 대한수학회지
• /
• 제50권2호
• /
• pp.361-377
• /
• 2013

In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze security of our scheme under the standard DDH assumption, and evaluate the performance of our construction.

• 대한수학회보
• /
• 제54권1호
• /
• pp.299-318
• /
• 2017

Sextic moment problems with an infinite algebraic variety are still widely open. We study the problem with a single cubic column relation associated to 3 parallel lines in which the variety is infinite. It turns out that this specific column relation has a strong connection with moment problems that have a symmetric algebraic variety. We present more concrete solutions to some sextic moment problems with a symmetric variety.