• Title/Summary/Keyword: Optimal Order Point

Search Result 425, Processing Time 0.025 seconds

Mobile Device-to-Device (D2D) Content Delivery Networking: A Design and Optimization Framework

  • Kang, Hye Joong;Kang, Chung Gu
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.568-577
    • /
    • 2014
  • We consider a mobile content delivery network (mCDN) in which special mobile devices designated as caching servers (caching-server device: CSD) can provide mobile stations with popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSD's are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We demonstrate that the proposed ODSA takes fewer iterations, on the order of O(log N) searches, for caching N contents in the system to find the optimal solution, as compared to the number of iterations in the conventional subgradient method, with an acceptable accuracy in practice. Furthermore, we identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing the mCDN.

Selection of target for the minimum expected loss in plating processes (도금공정에서 최소기대손실을 위한 목표치의 설정)

  • Park, Chang-soon;Kim, Jung-Jun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.6
    • /
    • pp.1051-1060
    • /
    • 2010
  • In the plating process of the IC chips for the printed circuit board manufacturing, specification limits for the plating thickness are usually given but its target is not specified in most cases. When the target is not specified, the center point of the specification limits is used instead. When the process capability is large, however, the use of the center point for the target is not the best choice in the context of the total cost. In this paper, the total cost is defined in terms of the production cost and the loss function, and then the optimal choice for target is studied in order to minimize the expected loss. As a consequence, the optimal choice of the target reduces the expected loss significantly, while reducing the process capability slightly.

A Proposal of 3 Point Search Algorithm for Optimal Design (최적 설계를 위한 3점 탐색 알고리즘의 제안)

  • 김주홍;공휘식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.7
    • /
    • pp.640-650
    • /
    • 1991
  • In the paper, the threepoint search algorithm used direct search method for optimal design is proposed. Proposed algorithm is composed of two iteration procedure to determine the minimum value of performance index. The minumum value of three-point existing in the inner N-order searching is firstly determined and next searching space is then reduced by the result of first procedure. To compute performance index. 3N iteration for a searching is necessary. 3N searching method is also described and confirmed with exception of parameter included multiphicator and divisor. Proposed algorithm have good stability and reliability when performance index is linear or quadratic function.

  • PDF

Guide Lines for Optimal Structure of Silicon-based Pocket Tunnel Field Effect Transistor Considering Point and Line Tunneling (포인트 터널링과 라인 터널링을 모두 고려한 실리콘 기반의 포켓 터널링 전계효과 트랜지스터의 최적 구조 조건)

  • Ahn, Tae-Jun;Yu, Yun Seop
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.167-169
    • /
    • 2016
  • The structure guide lines of pocket tunnel field effect transistor(TFET) considering Line and Point tunneling are introduced. As the pocket doping concentration or thickness increase, on-current $I_{on}$ increases. As the pocket thickness or gate insulator increase, subthreshold swing(SS) increases. Optimal structure reducing the hump effects should be proposed in order to enhance SS.

  • PDF

Lp and W1,p Error Estimates for First Order GDM on One-Dimensional Elliptic and Parabolic Problems

  • Gong, Jing;Li, Qian
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.41-57
    • /
    • 2000
  • In this paper, we consider first order generalized difference scheme for the two-point boundary value problem and one-dimensional second order parabolic type problem. The optimal error estimates in $L_p$ and $W^{1,p}$ ($2{\leq}p{\leq}{\infty}$) as well as some superconvergence estimates in $W^{1,p}$ ($2{\leq}p{\leq}{\infty}$) are obtained. The main results in this paper perfect the theory of GDM.

  • PDF

A Robust Pricing/Lot-sizing Model and A Solution Method Based on Geometric Programming

  • Lim, Sung-Mook
    • Management Science and Financial Engineering
    • /
    • v.14 no.2
    • /
    • pp.13-23
    • /
    • 2008
  • The pricing/lot-sizing problem of determining the robust optimal order quantity and selling price is discussed. The uncertainty of parameters characterized by an ellipsoid is explicitly incorporated into the problem. An approximation scheme is proposed to transform the problem into a geometric program, which can be efficiently and reliably solved using interior-point methods.

Minimum time Algorithm for intercepting a Moving Object on Conveyor System (컨베이어 상의 이동 물체 획득을 위한 로봇의 최소시간 알고리즘)

  • Shin, Ik-Sang;Moon, Seung-Bin B.
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.526-528
    • /
    • 2004
  • This paper focuses on planning strategies for object interception, especially with minimum time. Herein, the goal is for robot to intercept object with minimum time on a conveyor line that flows to x-axis with respect to world coordinate system. In order to do it, conveyor system needs the algorithms for minimizing time. This objective is achieved by solving about two problems: selection of a minimum-time interception point and planning of an optimal robot trajectory. Herein, the first problem is formulated a minimization of the robot-object interception time.

  • PDF

An (s, S) spare-part inventory model with general leadtime (일반적인 조달기간을 갖는 (s, S) 예비품 재고 모형)

  • 박원재;박영택
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.285-288
    • /
    • 1996
  • This paper deals with an (s, S) spare-part inventory model with general leadtime. In the model, if the inventory level falls to a reorder point s, a replenishment order quantity Q is ordered. Assumming that the number of operating units is one and the lifetime of a unit follows an exponential distribution, we derive the expected cost rate and suggest a procedure to obtain the optimal pair of (s, S) minimizing the cost rate.

  • PDF

A study on the arc suppressing method of switch gear using auxiliary contactor (보조접점에 의한 차단기의 arc억제에 관한 연구)

  • 노창주
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.8 no.2
    • /
    • pp.67-73
    • /
    • 1984
  • The Author researched and published its results on how effectively the arcs suppressed when the contactors are opened at current zero point which indispensively exsists in AC circuits. In order to increase the effectiveness of suppressing the arcs in larger current, the author suggests a new suppressing method using auxiliary contactor which contains resistance which is connected in parallel with main contactor. The author's firm belief is that the arcs are suppressed remarkably, but there are several problems, especially how to determine the optimal resistance connected in series with auxiliary contactor.

  • PDF

Tuning Rules of the PID Controller Based on Genetic Algorithms (유전알고리즘에 기초한 PID 제어기의 동조규칙)

  • Kim, Do-Eung;Jin, Gang-Gyoo
    • Proceedings of the KIEE Conference
    • /
    • 2002.07d
    • /
    • pp.2167-2170
    • /
    • 2002
  • In this paper, model-based tuning rules of the PID controller are proposed incorporating with genetic algorithms. Three sets of optimal PID parameters for set-point tracking are obtained based on the first-order time delay model and a genetic algorithm as a optimization tool which minimizes performance indices(IAE, ISE and ITAE). Then tuning rules are derived using the tuned parameter sets, potential rule models and a genetic algorithm. Simulation is carried out to verify the effectiveness of the proposed rules.

  • PDF