• Title/Summary/Keyword: Optimal Layout

Search Result 307, Processing Time 0.03 seconds

Research on the Lubrication Characteristics of Driving Modules (구동 모듈 감속기 윤활 특성에 관한 연구)

  • Kim, EunKyum;Kim, HyunChan;Park, JunYoung
    • Tribology and Lubricants
    • /
    • v.38 no.2
    • /
    • pp.70-72
    • /
    • 2022
  • In this study, we report on a power system developed as a decelerator for a driving module in an electric vehicle. The system is to be mounted in a limited space. The research focus was on development of miniaturization, light weight, and high power density. In particular, we aimed to minimize the layout of existing external components as integrated or built-in, and to maximize the power density by applying optimal cooling technology to increased requirements for developing modular power systems applicable to various OEM models. South Korean automakers ranked fourth in global electric-vehicle sales in 2020, but domestic sales are relatively slow. Despite government's expansion in subsidies for eco-friendly cars, consumers are delaying purchases after 2021 considering the cost-effectiveness of electric vehicles. In major European markets, the demand for electric vehicles exceeded the demand for diesel cars, and sales of hybrid cars, which used to represent eco-friendly cars, are slowing down as Toyota, started selling electric vehicles. In this study, the internal lubrication characteristics of a decelerator installed in an electric vehicle were analyzed in terms of the deceleration time while driving. By selecting the proper oil and oil viscosity, it was confirmed that there is no problem in lubricating the bearings and gears of the decelerator.

Optimal layout of tidal current turbine array in open channel flow (개수로 흐름에서 조류 터빈의 최적 배열)

  • Han, Jisu;Jung, Jaeyoung;Hwan, Hwang Jin
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2021.06a
    • /
    • pp.433-433
    • /
    • 2021
  • 본 연구는 개수로 흐름에서 조류발전단지의 터빈 최적 배열의 거시적 특성에 관한 연구를 수행하였다. 천수방정식을 통해 직사각형 개수로의 흐름장을 해석하였고, 상류와 하류단에 대해 각각 유입경계조건(inlet boundary condition)과 Flather 형식의 개방경계조건(open boundary condition)을 부여하여 일정 유량으로 흐르는 개수로 흐름을 구현하였다. 더불어, Strickler의 법칙을 확장한 반력공식을 연계하여, 개수로 흐름에 대한 조류 터빈의 영향을 반영하였다. 주어진 상류의 흐름 조건에 대해 조류발전량을 최대로 하는 최적 배열을 구하기 위해 터빈 반력모형을 연계한 천수방정식, 터빈간 최소간격, 그리고 발전단지영역을 제한조건으로 하는 발전량 최대화 문제를 구성하였다. 여기서 조류 터빈의 위치를 나타내는 벡터를 설계변수로 두었는데, 설계되는 터빈의 수가 증가함에 따라 최적화 문제의 계산량이 증가하지 않도록 수반법(adjoint method)을 경사도기반법(gradient-based method)에 연계한 방법이 이용되었다. 다수의 터빈초기배치로 상당한 수치실험이 수행되었고, 발전량 최대화를 이루도록 최적화된 터빈의 배치들이 큰 규모에서 고유한 형상으로 수렴함을 확인하였다. 이러한 특성은 발전단지의 너비와 터빈의 최소간격의 함수로 정의된 무차원수 E를 바탕으로 설명되었다. 구체적으로, E가 1보다 작을 때에는 선형배열이 최적배열로 나타났고, E가 1을 넘어 점차 커짐에 따라 하류에 오목한 형상을 보이다가 V-형태로 발전하는 양상을 보였다. 또한, 어느 임계 수 이상의 터빈이 배치되는 경우 일열 배열을 유지하지 못하고 이열 배열로 분리됨이 관찰되었다.

  • PDF

A Human Factors Study in Instrument Panel Layout of the Korean Air Force Aircraft. (항공기 계기판의 적정배열을 위한 인간공학적 연구)

  • Park Jong-Sun
    • Journal of the military operations research society of Korea
    • /
    • v.2 no.1
    • /
    • pp.127-143
    • /
    • 1976
  • The purpose of this thesis is to study the optimal arrangement of aircraft instrument panels through the human factors approach. Human factors engineering is the process of effectively fitting the human component to the machine component in any man-machine system. The human factors. are especially important to an aircraft pilot who must constantly shift his attention between the instrument panel within the cockpit and the surrounding area of the aircraft. The preliminary part of this study is to find the general patterns of the Korean pilot's eye movements during their various flying maneuvers, and which instruments require the most attention while in flight. It is assumed that all pilots have a general pattern of eye movement when observing the aircraft instrument panel and that an optimum arrangement would be to minimize the eye travel distance between instruments. In this thesis the arrangements of instruments is taken to be the independent variable and the eye travel distance between instruments the dependent variable. la order to compile the information necessary for this study, sixty Korean Air Force pilots were interviewed and requested to complete information forms. These information forms listed various flying maneuvers and listed each instrument used on the instrument panel. The compilation of the information on these completed forms listed the instruments most frequently used by the pilots. The second part of this study was to determine the optimum instrument arrangement. It was necessary to study the various number of possible arrangements of instruments depending upon the number of instruments involved. Therefore, these instruments are grouped by two major functions, The flight instruments were subdivided into three groups, and the engineering instruments were subdivided into six groups. With this subdivision we arrive at the possible number of arrangements of 4,320. Through the simulation method, total eye travel distance for each of these 4,320 arrangements is calculated and the arrangement which appears to be of optimum distance between the most frequently used aircraft instruments is determined. The results of this study indicate that the optimum distance between instruments would be 33,028cm and that the corresponding distance of the instrument panel now being used is 34,288cm. Therefore, an increased efficiency of $3.8\%$ would be realized if the existing aircraft instrument panel were re-arranged according to layout proposed in this thesis.

  • PDF

Algorithm Deciding Offshore Cable Layout Valid for Integrated Power Supply Between Adjacent Islands (근거리 도서간 통합전력공급에 유효한 해저케이블 포설 방안 결정 알고리즘)

  • Kim, Mi-Young;Rho, Dae-Seok;Moon, Guk-Hyun;Seo, In-Yong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.2
    • /
    • pp.28-36
    • /
    • 2018
  • Islands are supplied with power from diesel generation or from photovoltaic power generation, and problems with offshore environmental impacts (age deterioration, salt pollution), environmental pollution (exhaust gas, noise, dust) and power generation costs (installation, maintenance) have increasingly emerged. In 2016, the cost recovery rate was only 27%, and deficits reached 73% on 65 islands managed by KEPCO. In terms of deficits, the costs incurred in the power generation sector accounted for 91%, with the ratio of fixed costs at about 60%. Analysis suggests that operating costs can be reduced with an optimal power supply system that improves power generation efficiency and makes operating systems more efficient. Therefore, it is possible to simplify fuel transportation and facility maintenance, because one island integrates the power plants of remote islands, and offshore cable is used to supply power to the other islands. From the economic evaluations in this paper, an algorithm deciding offshore cable layout validity for an integrated power supply between adjacent islands is presented. Simulation results based on the proposed algorithm confirmed that an integrated power supply is economical for existing stand-alone operations on islands having diesel generation, low peak power, and near distances.

Optimization of Reinforcement of Thin-Walled Structures for a Natural Frequency (고유진동수를 고려한 박판 구조물의 보강재 최적설계)

  • Lim O-Kaung;Jeong Seung-Hwan;Choi Eun-Ho;Kim Dae-Woo
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.19 no.2 s.72
    • /
    • pp.195-202
    • /
    • 2006
  • Thin-walled structures are efficiently utilized an automobiles, aircraft, satellite and ship as well as needed light weight simultaneously. This paper presents new shape of automobile hood reinforcement that rotating parts as engine, transmission are protected by thin-walled structures. The automobile hood is concerned about the resonance occurs due to the frequency of the rotating parts. The hood must be designed by supporting the stiffness of design loads and considering the natural frequencies. Hence, it is sustained the stiffness and considered the vibration by resonance. It is deep related to ride. Therefore, the topology, shape and size optimization methods are used to design the automobile hood. Topology technique is applied to determine the layout of a structural component optimum size with maximized natural frequency by volume reduction. In this research, The optimal structure layout of an inner reinforcement of an automobile hood for the natural frequency of a designated mode is obtained by using topology optimization method. The optimum size and the optimum shape are determined by PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm.

Declustering of High-dimensional Data by Cyclic Sliced Partitioning (주기적 편중 분할에 의한 다차원 데이터 디클러스터링)

  • Kim Hak-Cheol;Kim Tae-Wan;Li Ki-Joune
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.596-608
    • /
    • 2004
  • A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

Parameter Analysis for Design of Pretension Girder Bridge for Urban Maglev Transit (도시형 자기부상열차 프리텐션 거더교의 설계변수 분석)

  • Lee, Jae-Ho;Kim, Do-Hak;Kim, Seung-Hyun;Kim, Sung-Il
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.4
    • /
    • pp.515-525
    • /
    • 2016
  • Parameter analysis of a pretension girder bridge for urban maglev transit was performed to identify the main design parameters and their effect. Girder deflection at mid-span is the most important design criteria of urban maglev transit. Therefore, concrete compressive strength, girder height, girder length, and unbonded tendon length were selected as the design parameters that relate to girder deflection. In addition, tendon layout and unbonded tendon ratios were also considered as design parameters to control the top stress of the pretension girder section at the support. The analysis results show that both the girder height and length are dominant design parameters governing girder deflection, more important than compressive strength and unbounded tendon length. And, sensitivity analysis makes this study suggest design weight value. In terms of stress, a tendon layout that can satisfy the unbounded tendon rule requires an additional tendon or rebar at the upper section to control the tensile stress on top of the section. Therefore, to improve feasibility and constructability in the future, an enhanced unbonded tendon rule considering the load characteristics of the urban maglev system should be studied.

Temporal-Spatial Analysis of Landscape Diversity using FRAGSTATS (FRAGSTATS를 활용한 경관다양성의 시공간적 분석)

  • Kwon, Oh-Sung;Ra, Jung-Hwa;Ku, Ji-Na;Kim, Jin-Hyo
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.18 no.3
    • /
    • pp.39-50
    • /
    • 2015
  • This research selected Daegu Metropolitan City representing a combination of natural space and urban space for this case study. To achieve this, a prerequisite was to set up an optimal block size to evaluate landscape diversity of the research site by using a RPR-Area Curve. Further, landscape diversity evaluation was conducted based on land cover map by using FRAGSTATS to analyze spatio-temporal changes. Notably, this research regarded it as the most significant to set forth criteria in order to apply landscape diversity to the development plans of the newtown and outskirt of a city under high pressure development. Results derived from this research are summarized as follows. According to the results derived from establishing the optimal block size, a size about $2km^2$ was analyzed to measure landscape diversity of the research site. Also, according to the results derived from land diversity evaluation based on land cover map, land diversity was highly measured around urban stream such as Nakdong River and Geumho River, and in particular, the value of landscape diversity was measured considerably high around the urban parks. Results derived from analysis on spatio-temporal changes of land diversity demonstrated that a certain level of urban development exerted a positive effect on an increase in land diversity, but consistent urban development lowered a value of landscape diversity. Results derived from regression analysis to set forth the optimal urban space showed that an urban area of a space about $2km^2$ exerted a positive effect at a rate of about 0~43.3% and a negative effect at a rate about 43.3~100%. In conclusion, the results of this research are considered to provide important basic data for future urban and landscape planning. Nonetheless, as only the layout on the 2D plane was analyzed in this research, further research in future is required to complexly consider diverse factors such as height of structure and change in visible real area arising from geographical features.

Algorithm for Minimum Linear Arrangement(MinLA) of Binary Tree (이진트리의 최소선형배열 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.2
    • /
    • pp.99-104
    • /
    • 2024
  • In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S(k)min=2k-1+4+S(k-1)min+2S(k-2)min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

Algorithm for a Minimum Linear Arrangement(MinLA) of Lattice Graph (격자 그래프의 최소선형배열 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.2
    • /
    • pp.105-111
    • /
    • 2024
  • This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r1,r2,r3 and n columns into c1,c2,c3, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C2,C4,C6 is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.