• 제목/요약/키워드: end-to-end optimization

검색결과 523건 처리시간 0.027초

열전달 및 열하중을 고려한 자동차 연료전지(PEMFC) 분리판의 두께 최적설계 (Optimization of Automotive PEMFC Bipolar Plates considering Heat Transfer and Thermal Loads)

  • 김영성;김철
    • 한국자동차공학회논문집
    • /
    • 제23권1호
    • /
    • pp.34-40
    • /
    • 2015
  • A stack in the proton exchange membrane fuel cell (PEMFC) consists of bipolar plates, a membrane electrode assembly, a gas diffusion layer, a collector and end plates. High current density is usually obtainable partially from uniform temperature distribution in the fuel cell. A size optimization method considering the thermal expansion effect of stacked plates was developed on the basis of finite element analyses. The thermal stresses in end, bipolar, and cooling plates were calculated based on temperature distribution obtained from thermal analyses. Finally, the optimization method was applied and optimum thicknesses of the three plates were calculated considering both fastening bolt tension and thermal expansion of each unit cell (72 cells, 5kW). The optimum design considering both thermal and mechanical loads increases the thickness of an end plate by 0.64-0.83% the case considering only mechanical load. The effect can be enlarged if the number of stack increases as in an automotive application to 200-300 stacks.

On the Formulation and Optimal Solution of the Rate Control Problem in Wireless Mesh Networks

  • Le, Cong Loi;Hwang, Won-Joo
    • 한국통신학회논문지
    • /
    • 제32권5B호
    • /
    • pp.295-303
    • /
    • 2007
  • An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

OPTIMAL PERIOD SELECTION TO MINIMIZE THE END-TO-END RESPONSE TIME

  • SHIN M.;LEE W.;SUNWOO M.
    • International Journal of Automotive Technology
    • /
    • 제6권1호
    • /
    • pp.71-77
    • /
    • 2005
  • This paper presents a systematic approach which determines the optimal period to minimize performance measure subject to the schedulability constraints of a real-time control system by formulating the scheduling problem as an optimal problem. The performance measure is derived from the summation of end-to-end response times of processed I/Os scheduled by the static cyclic method. The schedulability constraint is specified in terms of allowable resource utilization. At first, a uniprocessor case is considered and then it is extended to a distributed system connected through a communication link, local-inter network, UN. This approach is applied to the design of an automotive body control system in order to validate the feasibility through a real example. By using the approach, a set of optimal periods can easily be obtained without complex and advanced methods such as branch and bound (B&B) or simulated annealing.

엔드밀에 의한 슬롯가공의 최적화에 관한 연구 (A Study on the Optimization of Slot Cut in the End Milling Processes)

  • 최종근;김형선
    • 한국공작기계학회논문집
    • /
    • 제15권6호
    • /
    • pp.38-43
    • /
    • 2006
  • A slot cut in end milling processes is one of the laborious works because the cutting force is likely to deflect the tools excessively, then to make large errors or to fracture the tool. This difficulty is owing to the poor stiffness of slender shaped end mills. Though, in most cases, additional finish cuts are followed after rough cuts, the accuracy of rough cuts is still important because it affects the final accuracy after finish cuts and productivity. The accuracy in slot cuts depends on the tool stiffness and the cutting conditions including depth of cut and feed. In order to meet the desired accuracy, diameter of end mill and cutting allowance have to be selected carefully. This study suggests several guidances for selecting the end mill diameter and the slot cut allowance to improve machining accuracy and productivity in slot end millings. Some experiments were done with the various cutting parameters of tool diameter, depth of cut and feed.

A Study on Bandwidth Provisioning Mechanism using ATM Shortcut in MPLS Networks

  • Lee, Gyu-Myoung;Park, Jun-Kyun
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.529-532
    • /
    • 2000
  • This paper addresses how to be connected with end-to-end shortcut using ATM Switched Virtual Connection (SVC) in ATM-based Multi-Protocol Label Switching (MPLS) Networks. Without additionally existing ATM Ships-in-the-Night (SIN) mode, when the stream is continuously transmitted at the same destination with the lapse of determined aging time, the connection is changed with end-to-end shortcut connection using ATM signaling. An ATM direct short circuit is performed an IP and ATM effective integration. An ATM shortcut has a number of advantages, like higher throughput, shorter end-to-end delay, reduced router load, better utilization of L2 Quality of Service (QoS) capabilities, and route optimization. In particular between other MPLS domains, this can be efficiently improved the performance of networks.

  • PDF

Analytic Throughput Model for Network Coded TCP in Wireless Mesh Networks

  • Zhang, Sanfeng;Lan, Xiang;Li, Shuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권9호
    • /
    • pp.3110-3125
    • /
    • 2014
  • Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

POWER AWARE ROUTING OPTIMIZATION: AN ENHANCEMENT

  • Nguyen, VanDong;Song, Joo-Seok
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2004년도 춘계학술발표대회
    • /
    • pp.1453-1456
    • /
    • 2004
  • PARO, a power-aware routing optimization mechanism, is proposed in [1] to minimize the transmission power needed to forward packets between wireless devices in ad hoc network. The mechanism works by redirecting the route to pass through one or more intermediate nodes on behalf on source-destination pairs, then reducing the end-to-end transmission power. This paper will show an extension of this model and provide an analysis of the geometrical area lying between source and destination in which the intermediate node elects to perform redirection. The duration the intermediate node stays in that area is also computed.

  • PDF

볼 엔드밀 헬릭스 각에 따른 절삭 특성 (Cutting Characteristics of Ball-end Mill with Different Helix Angle)

  • 조철용;류시형
    • 한국정밀공학회지
    • /
    • 제31권5호
    • /
    • pp.395-401
    • /
    • 2014
  • Development of five axis tool grinding machine and CAD/CAM systems increase tool design flexibility. In this research, investigated are cutting characteristics of ball-end mill with different helix angle. Special WC ball-end mills with $0^{\circ}$, $10^{\circ}$, $20^{\circ}$, $30^{\circ}$ helix angles are designed and used in various cutting tests. Machining performance according to helix angle variation is evaluated from cutting forces, surface roughness, tool wear, produced chip shape, and vibration characteristics. The ball-end mill with $10^{\circ}$ helix angle shows the best cutting performance due to appropriate chip load distribution and smooth chip flow. This research can be used for cutting edge geometry optimization and novel design of ball-end mill.

Buckling optimization of unsymmetrically laminated plates under transverse loads

  • Hu, Hsuan-Teh;Chen, Zhong-Zhi
    • Structural Engineering and Mechanics
    • /
    • 제7권1호
    • /
    • pp.19-33
    • /
    • 1999
  • The critical buckling loads of unsymmetrically laminated rectangular plates with a given material system and subjected to combined lateral and inplane loads are maximized with respect to fiber orientations by using a sequential linear programming method together with a simple move-limit strategy. Significant influence of plate aspect ratios, central circular cutouts, lateral loads and end conditions on the optimal fiber orientations and the associated optimal buckling loads of unsymmetrically laminated plates has been shown through this investigation.

양극단 지연시간의 분할을 이용한 분산 실시간 시스템의 설계 (Designing Distributed Real-Time Systems with Decomposition of End-to-End Timing Donstraints)

  • 홍성수
    • 제어로봇시스템학회논문지
    • /
    • 제3권5호
    • /
    • pp.542-554
    • /
    • 1997
  • In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

  • PDF