• Title/Summary/Keyword: minimized method

Search Result 1,228, Processing Time 0.028 seconds

SOME ANALYSES ON A PROPOSED METHOD OF THE OPTIMAL NETWORK SELECTION PROBLEM

  • Lim, Jong Seul
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.539-546
    • /
    • 2014
  • This paper introduces the approximation and a proposed method to deal the optimum location network selection problem such that the total cost is minimized. For the proposed method, we derived a feasible solution and the variance. To compare the performances of the approximation and the proposed method, computer simulation is also implemented. The result showed the solutions being optimum with 74% for the proposed method and 57% for the approximation. When the solutions is not optimum, maximum and average deviations are below 4% and 2% respectively. The results indicate a slightly better performance of the proposed method in a certain case.

A Simplified Method to Estimate Travel Cost based on Traffic-Adaptable Heuristics for Accelerating Path Search

  • Kim, Jin-Deog
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.239-244
    • /
    • 2007
  • In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

Design and Implementation of X-Band Oscillator Using Compact Hairpin Resonator (소형화된 헤어핀 공진기를 이용한 X-대역 발진기의 설계 및 구현)

  • Kim, Gi-Rae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.10
    • /
    • pp.1131-1137
    • /
    • 2014
  • In this paper, oscillator with compact hairpin resonator is used to design the local oscillator of X-band radar system. The proposed hairpin resonator is minimized by increasing capacitance of line end of conventional one. By this method, size can be minimized about 40% compared with the conventional resonator and also can improve phase noise characteristic. The result of oscillator using proposed hairpin resonator is measured in oscillating frequency of 9.05 GHz, output power of 2.47 dBm, and phase noise of -101.4 dBc/Hz. The fabricated oscillator in this paper can minimize design and it's planar structure makes it easy to design MMIC.

Structural Design Optimization of a High Speed Machining Center Using a Simple Genetic Algorithm (금형가공센터 고속 이송체의 최적설계)

  • 최영휴;박선균;배병태;이재윤;김태형;박보선
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.04a
    • /
    • pp.74-78
    • /
    • 2001
  • In this study, a multi-step optimization technique combined with a simple genetic algorithm is introduce to the structural design optimization of a high speed machining center. In this case, the design problem is to find out the best design variables which minimize the static compliance, the dynamic compliance, and the weight of the machine structure and meet some design constraints simultaneously. Dimensional thicknesses of the thirteen structural members along the static force loop of the machine structure are adopted as design variables. The first optimization step is a static design optimization, in which the static compliance and the weight are minimized under some dimensional and safety constraints. The second step is a dynamic design optimization, where the dynamic compliance and the weight are minimized under the same constraints. After optimization, the weight of the moving body was reduced to 9.1% of the initial design respectively. Both static and dynamic compliances of the optimum design are also in the feasible range even thought they were slightly increased than before.

  • PDF

Design Optimization of a Rapid Moving Body Structure for a Machining Center Using G.A. with Variable Penalty Function (가변 벌점함수 유전알고리즘을 이용한 금형가공센터 고속이송체 구조물의 최적설계)

  • 최영휴;차상민;김태형;박보선;최원선
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2003.04a
    • /
    • pp.504-509
    • /
    • 2003
  • In this paper, a multi-step optimization using a G.A.(Genetic Algorithm) with variable penalty function is introduced to the structural design optimization of a high speed machining center. The design problem, in this case, is to find out the best cross-section shapes and dimensions of structural members which minimize the static compliance, the dynamic compliance, and the weight of the machine structure simultaneously. The first step is the cross-section shape optimization, in which only the section members are selected to survive whose cross-section area have above a critical value. The second step is a static design optimization, in which the static compliance and the weight of the machine structure are minimized under some dimensional constraints and deflection limits. The third step is a dynamic design optimization, where the dynamic compliance and the structure weight are minimized under the same constraints as those of the second step. The proposed design optimization method was successful applied to the machining center structural design optimization. As a result, static and dynamic compliances were reduced to 16% and 53% respectively from the initial design, while the weight of the structure are also reduced slightly.

  • PDF

Ablation rate study using short pulsed laser subjected to Alumina medium (알루미나 세라믹 소재의 초단파 레이저 어블레이션량 연구)

  • Kim, Kyunghan;Park, Jinho
    • Laser Solutions
    • /
    • v.18 no.4
    • /
    • pp.17-22
    • /
    • 2015
  • In this paper, ablation rate of $Al_2O_3$ ceramics by femtosecond laser fluence is derived with experimental method. The automatic three axis linear stage makes laser optics to move with high spatial resolution. With 10 times objective lens, minimal pattern width of $Al_2O_3$ is measured in the focal plane. Ablated surface area is shown as linear tendency increasing number of machining times with various laser power conditions. Machining times is most sensitive condition to control $Al_2O_3$ pattern width. Also, the linear increment of pattern width with laser power change is investigated. In high machining speed, the ablation volume rate is more linear with fluence because pulse overlap is minimized in this condition. Thermal effect to surrounding medium can be minimized and clean laser process without melting zone is possible in high machining speed. Ablation volume rate decelerates as increasing machining times and multiple machining times should be considered to achieve proper ablation width and depth.

QuLa: Queue and Latency-Aware Service Selection and Routing in Service-Centric Networking

  • Smet, Piet;Simoens, Pieter;Dhoedt, Bart
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.306-320
    • /
    • 2015
  • Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

Splines via Computer Programming

  • 김경태
    • Communications of the Korean Institute of Information Scientists and Engineers
    • /
    • v.1 no.1
    • /
    • pp.72-74
    • /
    • 1983
  • Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

Position Control of DC Servo Motor Using the EESM Control Method (동등 편차 슬라이딩 모드를 이용한 직류 서보 전동기의 위치 제어)

  • 이윤종;손영대
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.1
    • /
    • pp.47-57
    • /
    • 1991
  • A new control algorithm so called equal excursion sliding mode (EESM) control method is proposed to control the position of DC servo motor. This method introduces the concept of phase velocity vector that Filippov presented, and simplifies the problem of control gain selection in a conventional VSC strategy. And, by making state trajectories have equal excursions on both sides of switching hyperplane we minimized the probability of sliding mode's being collapsed, and approximated to the ideal sliding moed. Also, we proved the validity of this method by comparing the application results of this method to DC servo motor with those of conventional VSC strategy.

  • PDF

Trial Design of a Very Large Floating Airport (General Arrangement and Decision of Depth) (초대형 부유식 해상공항의 시설계 (일반배치와 깊이 결정))

  • 신현경;임춘규;정재희
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2001.10a
    • /
    • pp.45-49
    • /
    • 2001
  • The length and the breadth or a very large floating airport are determined by airplane types and airport facilities. However, the depth affect not only the structural strength but also the functional requirement such as a possibility of taking off and landing. The optimization problem for determining the depth is to select a design so that the cost is minimized. In this paper, a general arrangement and a method to decide the depth are proposed. Strength, functional requirement, and possibility of occurrence of deck wetness and slamming are considered in order to determine the depth of structure. Hydrodynamic forces of the diffraction and radiatin problems are predicted by applying the source-dipole distribution method, and the structural responses are obtained by the finite element method.

  • PDF