• Title/Summary/Keyword: Objective distance

Search Result 1,041, Processing Time 0.031 seconds

Design Optimization of an Impingement Jet on Concave Surface for Enhancement of Heat Transfer Performance (곡면에서의 열전달성능 향상을 위한 충돌제트의 최적설계)

  • Heo, M.W.;Lee, K.D.;Kim, K.Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2011.05a
    • /
    • pp.100-103
    • /
    • 2011
  • In the present work, a numerical study of fluid flow and heat transfer on the concave surface with impinging jet has been performed by solving three-dimensional Reynods-averaged Naver-Stokes(RANS) equations. The constant temperature condition was applied to the concave impingement surface. The inclination angle of jet nozzle and the distance between jet nozzles are chosen as design variables under equivalent mass flow rate of working fluid into cooling channel, and area averaged Nusselt number on concave impingement surface is set as the objective function. Thirteen training points are obtained by Latin Hypercube sampling method, and the PEA model is constructed by using the objective function values at the trainging points. And, the sequential quadratic programming is used to search for the optimal paint from the PBA model. Through the optimization, the optimal shape shows improved heat transfer rate as compared to the reference geometry.

  • PDF

Micro Displacement Sensor Using an Astigmatic Method (비점수차법을 이용한 변위센서 개발)

  • Lee C.W.;Song J.Y.;Ha T.H.;Kim J.H.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.257-258
    • /
    • 2006
  • This paper presents the displacement sensor based on astigmatic method that has a small measurement range. The sensor has the characteristic that the measuring range is changed easily by exchanging a objective lens or distance between a objective lens and a collimator lens. The measuring range and resolution is evaluated by a laser interferometer.

  • PDF

Optimum Logical Topology for WDM Networks

  • Nittayawan, Jittima;Runggeratigul, Suwan
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1371-1374
    • /
    • 2002
  • This paper compares four network con-figurations for using as the logical topology in multi- hop wavelength division multiplexing (WDM) networks. The regular network configurations studied in this paper axe ShuffleNet, de Bruijn graph, hypercube, and Man-hattan street network. Instead of using the weight mean hop distance of node placement problem for comparing optimum logical topology, we introduce a new objective function that includes h and the network cost. It can be seen that the network cost strongly depends on the logical topology selected for the implementation of the network. The objective of this paper is to find an optimum logical topology for WDM networks that gives low as well as low network cost.

  • PDF

Empirical Comparisons of Clustering Algorithms using Silhouette Information

  • Jun, Sung-Hae;Lee, Seung-Joo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.10 no.1
    • /
    • pp.31-36
    • /
    • 2010
  • Many clustering algorithms have been used in diverse fields. When we need to group given data set into clusters, many clustering algorithms based on similarity or distance measures are considered. Most clustering works have been based on hierarchical and non-hierarchical clustering algorithms. Generally, for the clustering works, researchers have used clustering algorithms case by case from these algorithms. Also they have to determine proper clustering methods subjectively by their prior knowledge. In this paper, to solve the subjective problem of clustering we make empirical comparisons of popular clustering algorithms which are hierarchical and non hierarchical techniques using Silhouette measure. We use silhouette information to evaluate the clustering results such as the number of clusters and cluster variance. We verify our comparison study by experimental results using data sets from UCI machine learning repository. Therefore we are able to use efficient and objective clustering algorithms.

The Multiple Traveling Purchaser Problem for Minimizing Logistics Response Time in Wartime (전시 군수반응시간 최소화를 위한 복수 순회구매자 문제)

  • Choi, Myung-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.3
    • /
    • pp.431-437
    • /
    • 2010
  • It's strongly needed to minimize the logistics response time for supporting military operations in wartime. In this paper, we suggest the ILP formulation for minimizing logistics response time in wartime. Main structure of this formulation is based on the traveling purchaser problem(TPP) which is a generalized form of the well-known traveling salesman problem(TSP). In the case of general TPP, objective function is to minimize the sum of traveling cost and purchase cost. But, in this study, objective function is to minimize traveling cost only. That's why it's more important to minimize traveling cost(time or distance) than purchase cost in wartime. We find out optimal solution of this problem by using ILOG OPL STUDIO(CPLEX v.11.1) and do the sensitive analysis about computing time according to number of operated vehicles.

A Polynomial-time Algorithm for Choosing the Shortest Transportation Path of Logistic Material (최적 보급수송로 선정을 위한 다항시간 알고리듬)

  • 서성철;정규련
    • Journal of the military operations research society of Korea
    • /
    • v.23 no.2
    • /
    • pp.103-119
    • /
    • 1997
  • This paper considers the shortest path problem combined with Min-Min-Sum objective for solving the problem of the military logistics. This paper develops a polynomial-time algorithm for the optimal solution. To analyze the real combat situation, the ability time and distance time of communication line are considered. The complexities of algorithm between previous study and the algorithm developed in this paper is presented. Finally we provide a simple example of application with randomly generated problem.

  • PDF

The development of the remote robot controller using the internet (인터넷을 이용한 원격 로봇 제어기의 개발)

  • 임재환;이종수;최경삼
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.776-778
    • /
    • 1997
  • We propose a remote controller for a SCARA typed direct drive manipulator with two degrees-of-freedom(DOF). A remote controller system for SCARA robot of DDA is designed using a 2 DSP (TMS320c31) board and Winsock(Internet program class library supplied by Microsoft). The design objective of the system is to implement real time dynamic control algorithms which have been tested only by simulations so far and remote control regardless of the distance between user and robot. Because this system runs on Win95, we developed a VxD program to communicate with DSP controller.

  • PDF

Acquirment and Linguistic Expressions of Fuzzy Rules

  • Maebashi, Satoru;Onisawa, Takehsa
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.258-263
    • /
    • 1998
  • Fuzzy rules are often obtained by experts who know an objective system well. fuzzy rules acquired by experts, however, do not express all input-output relations of the system. This paper proposes a method fuzzy rules are expressed in plain language so that the fuzzy rules are understood easily. The proposed method is applied to the control of the distance between cars and running through a crank-typed road, and the validity of the method is confirmed.

  • PDF

A study on MRP/JIT system for vendor management

  • Lee, Soon-Yo;Yang, Seun-Mo
    • Korean Management Science Review
    • /
    • v.5 no.2
    • /
    • pp.57-70
    • /
    • 1988
  • This paper examines both MRP and JIT for reducing WIP(Work In Process). The MRP/JIT system is suitable for multi-model, small-production manufacturing comparies in Korea because of the short delivery distance and low risk of accident during delivery. The objective of this paper is to manage vendors effectively by informing supply points and quantity of parts of vendors with MRP and JIT.

  • PDF

A Modified Gradient Precedure for Multifacility Euclidean Distance Location Problems

  • Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.2
    • /
    • pp.25-33
    • /
    • 1988
  • An efficient heuristic solution procedure is developed for the minimum location problems. The gradient direction method and modified gradient approach are developed due to the differentiability of the objective functions. Suboptimal step size is obtained analytically. A Modified Gradient Procedure (NGP) is presented and compared with the hyperboloid approximation procedure (HAP) which is one of the best known methods.

  • PDF