• 제목/요약/키워드: Dual optimization

검색결과 325건 처리시간 0.024초

A Study on Efficient Use of Dual Data Memory Banks in Flight Control Computers

  • Cho, Doosan
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제9권1호
    • /
    • pp.29-34
    • /
    • 2017
  • Over the past several decades, embedded system and flight control computer technologies have been evolved to meet the diverse needs of the mobile device market. Current embedded systems are at the heart of technologies that can take advantage of small-sized specialized hardware while still providing high-efficiency performance at low cost. One of these key technologies is multiple memory banks. For example, a dual memory bank can provide two times more memory bandwidth in the same memory space. This benefit take lower cost to provide the same bandwidth. However, there is still few software technologies to support the efficient use of multiple memory banks. In this study, we present a technique to efficiently exploit multiple memory banks by software support. Specifically, our technique use an interference graph to optimally allocate data to different memory banks by an optimizing compiler. As a result, the execution time can be improved upto 7% with the proposed technique.

NEW INTERIOR POINT METHODS FOR SOLVING $P_*(\kappa)$ LINEAR COMPLEMENTARITY PROBLEMS

  • Cho, You-Young;Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제13권3호
    • /
    • pp.189-202
    • /
    • 2009
  • In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

  • PDF

이동 통신 네트워크에서의 듀얼 호밍 셀 스위치 할당을 위한 유전자 알고리듬 (A Genetic Algorithm for Assignments of Dual Homing Cell-To-Switch under Mobile Communication Networks)

  • 우훈식;황선태
    • Journal of Information Technology Applications and Management
    • /
    • 제13권2호
    • /
    • pp.29-39
    • /
    • 2006
  • There has been a tremendous need for dual homing cell switch assignment problems where calling volume and patterns are different at different times of the day. This problem of assigning cells to switches in the planning phase of mobile networks consists in finding an assignment plan which minimizes the communication costs taking into account some constraints such as capacity of switches. This optimization problem is known to be difficult to solve, such that heuristic methods are usually utilized to find good solutions in a reasonable amount of time. In this paper, we propose an evolutionary approach, based on the genetic algorithm paradigm, for solving this problem. Simulation results confirm the appropriateness and effectiveness of this approach which yields solutions of good quality.

  • PDF

Selection of a Remote Phosphor Configuration to Enhance the Color Quality of White LEDs

  • Anh, Nguyen Doan Quoc;Le, Phan Xuan;Lee, Hsiao-Yi
    • Current Optics and Photonics
    • /
    • 제3권1호
    • /
    • pp.78-85
    • /
    • 2019
  • The remote phosphor structure has been proven to bear greater luminous efficiency than both the conformal phosphor and in-cup phosphor structures; however, controlling its color quality is much more challenging. To solve this dilemma, various researchers have proposed dual-layer phosphor and triple-layer phosphor configuration as techniques to enhance the display brightness of white LEDs (WLEDs). Likewise, this study picked one of these configurations to utilize in multichip WLEDs with five distinct color temperatures in the range from 5600 to 8500 K, for the purpose of improving the optical properties of WLEDs, such as color rendering index (CRI), color quality scale (CQS), luminous efficacy (LE), and chromatic homogeneity. According to the results of this research, the triple-layer phosphor configuration has superior performance compared to other configurations in terms of CRI, CQS, and LE, and yields higher chromatic stability for WLEDs.

최적화 기법을 이용한 두 개의 회전하는 사분파장판으로 구성된 타원편광분석기에서의 체계적인 오차 보정 (Systematic Error Correction in Dual-Rotating Quarter-Wave Plate Ellipsometry using Overestimated Optimization Method)

  • 김덕현;정해두;김봉진
    • 한국광학회지
    • /
    • 제25권1호
    • /
    • pp.29-37
    • /
    • 2014
  • 두 개의 회전하는 사분파장판으로 구성된 타원편광분석기의 체계적인 오차를 보정하는 방법을 연구하고 이를 실증하였다. 두개의 사분파장판으로 구성된 타원편광분석기의 5가지 오차(두 개의 회전 사분파장판들의 회전 시작 각도 오차 및 상 지연 값의 오차, 그리고 편광 분석기의 정렬 각도 오차)를 근사 과정 없이 계산하기 위하여 시료가 없이 타원편광신호를 얻고 이로부터 25개의 퓨리에 성분을 추출하였다. 25개의 퓨리에 계수에서 관련된 11개의 성분만 이용하여 상호 비선형적으로 얽혀 있는 5개의 값을 비선형 최적화 방법으로 구할 수 있었다. 오차 보정 결과 회전광소자들의 정렬 각도 오차(${\epsilon}_3$, ${\epsilon}_4$, ${\epsilon}_5$)가 위상지연 오차(${\epsilon}_1$, ${\epsilon}_2$)보다 더 중요하며, 모든 오차에서 0.05 rad 이하의 정밀도를 지니면 충분히 그 오차를 보정할 수 있다는 것을 확인할 수 있었다. 최종적으로는 이렇게 구한 광학계의 초기 정렬 오차 값을 미지의 광학 부품에 적용하여 미지의 광학부품의 위상 지연의 양과 빠른 축을 알 수 있었다. 오차 보정 검증을 위하여 미지의 샘플로 반파장판을 이용하였으며, 반파장판의 위상 지연 양과 빠른 축을 찾을 수 있었다.

통계적 기계학습에서의 ADMM 알고리즘의 활용 (ADMM algorithms in statistics and machine learning)

  • 최호식;최현집;박상언
    • Journal of the Korean Data and Information Science Society
    • /
    • 제28권6호
    • /
    • pp.1229-1244
    • /
    • 2017
  • 최근 여러 분야에서 데이터에 근거한 분석방법론에 대한 수요가 증대됨에 따라 이를 처리할 수 있는 최적화 방법이 발전되고 있다. 특히 통계학과 기계학습 분야의 문제들에서 요구되는 다양한 제약 조건은 볼록 최적화 (convex optimization) 방법으로 해결할 수 있다. 본 논문에서 리뷰하는 alternating direction method of multipliers (ADMM) 알고리즘은 선형 제약 조건을 효과적으로 처리할 수 있으며, 합의 방식을 통해 병렬연산을 수행할 수 있어서 범용적인 표준 최적화 툴로 자리매김 되고 있다. ADMM은 원래의 문제보다 최적화가 쉬운 부분문제로 분할하고 이를 취합함으로써 복잡한 원 문제를 해결하는 방식의 근사알고리즘이다. 부드럽지 않거나 복합적인 (composite) 목적 함수를 최적화할 때 유용하며, 쌍대이론과 proximal 작용소 이론을 토대로 체계적으로 알고리즘을 구성할 수 있기 때문에 통계 및 기계학습 분야에서 폭 넓게 활용되고 있다. 본 논문에서는 최근 통계와 관련된 여러 분야에서 ADMM알고리즘의 활용도를 살펴보고자 하며 주요한 두 가지 주제에 중점을 두고자 한다. (1) 목적식의 분할 전략과 증강 라그랑지안 방법 및 쌍대문제의 설명과 (2) proximal 작용소의 역할이다. 알고리즘이 적용된 사례로, 별점화 함수 추정 등의 조정화 (regularization)를 활용한 방법론들을 소개한다. 모의 자료를 활용하여 lasso 문제의 최적화에 대한 실증결과를 제시한다.

Adaptive Cross-Layer Resource Optimization in Heterogeneous Wireless Networks with Multi-Homing User Equipments

  • Wu, Weihua;Yang, Qinghai;Li, Bingbing;Kwak, Kyung Sup
    • Journal of Communications and Networks
    • /
    • 제18권5호
    • /
    • pp.784-795
    • /
    • 2016
  • In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

유한요소해석과 다구찌 방법에 의한 디스크 캘리퍼 씰 홈의 형상 최적화에 관한 연구 (A Study on Shape Optimization for Seal Groove of Disc Caliper using Finite Element Method and Taguchi's Method)

  • 김진한;김수태
    • 한국공작기계학회논문집
    • /
    • 제15권1호
    • /
    • pp.88-94
    • /
    • 2006
  • A typical disk brake system consists of caliper housing, piston, seal and two pads etc. The configuration of seal groove, dimension of piston and seal, and seal material properties are important ones for brake performance, as these affect the retraction of piston. The rubber seal is designed to perform dual functions of sealing the brake oil at brake-applied and retracting the caliper piston at brake-released. In this paper, the seal stress is analyzed using Finite Element Method and experiment is conducted by Taguchi's Method. We attempt to quantify the critical design factors in the seal groove and evaluate their impact on some of brake performance factors. The investigation obtained from this study can not only enhance the seal groove design optimization, but also reduce product prototype testing and development time.

근접장 광기록용 서스펜션의 최적설계 (Optimal Design of a Near-field Optical Recording Suspension)

  • 조태민;임경화
    • 한국소음진동공학회논문집
    • /
    • 제14권4호
    • /
    • pp.295-302
    • /
    • 2004
  • In this study the optimization of a NFR suspension is performed using finite element method and experimental modal analysis. NFR suspensions are required to have low compliance modes to allow the slider to comply with the rotating disk, and high tracking stiffness modes to maximize the servo bandwidth of the tracking controller First of all, the dual suspension model is designed based on the characteristics of NFR drives. And the parametric study on the sensitivities of compliance modes and tracking stiffness modes is investigated. Finally, the model satisfying static characteristics is selected and shape optimization is performed to improve dynamic characteristics. A prototype of a NFR suspension is made by etching and modal ekperiment in free state is performed. The results of experiment almost agree with those of finite element method.

AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION

  • Asadi, Soodabeh;Mansouri, Hossein;Zangiabadi, Maryam
    • 대한수학회보
    • /
    • 제53권6호
    • /
    • pp.1831-1844
    • /
    • 2016
  • In this paper, we improve the full-Newton step infeasible interior-point algorithm proposed by Mansouri et al. [6]. The algorithm takes only one full-Newton step in a major iteration. To perform this step, the algorithm adopts the largest logical value for the barrier update parameter ${\theta}$. This value is adapted with the value of proximity function ${\delta}$ related to (x, y, s) in current iteration of the algorithm. We derive a suitable interval to change the parameter ${\theta}$ from iteration to iteration. This leads to more flexibilities in the algorithm, compared to the situation that ${\theta}$ takes a default fixed value.