• Title/Summary/Keyword: Transfer penalty

Search Result 36, Processing Time 0.025 seconds

Micro-scale Public Transport Accessibility by Stations - KTX Seoul Station Case Study - (정류장 단위의 미시적 대중교통 접근성 분석 - KTX 서울역 사례연구 -)

  • Choi, Seung U;Jun, Chul Min;Cho, Seong Kil
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.9-16
    • /
    • 2016
  • As the need of eco-friendly transportation systems for sustainable development increases, public transport accessibility has been considered as an important element of transportation system design. When analyzing the accessibility, shortest path algorithms can be utilized to reflect the actual movement and we can obtain high resolution accessibility for all other stations on the network with shortest distance and time. This study used the algorithm improved by reflecting the penalty of number of transfers and waiting time of overlapped routes to get the accessibility. KTX Seoul Station is a target place and this algorithm is applied to multi-layer subway bus network of Seoul to calculate the accessibility, therefore this study presented the accessibility of KTX Seoul station by stations.

Optimal Release Policies of Software System with Scheduled Delivery Time (예정된 인도시기를 가진 Software시스템의 최적방출정책)

  • 정영배;신현재
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.9 no.13
    • /
    • pp.29-32
    • /
    • 1986
  • A decision procedure to determine when computer software should be released after testing is described. This paper extends optimum release policies minimizing the total expected software cost with a scheduled software delivery time under reliability requirement constraint. Such cost considerations enable us to make a release decision as to when transfer a software system from testing phase to operational phase. The underlying model is software reliability growth model described by a nonhomogeneous poisson process. It is assumed that the penalty cost function due to delay for a scheduled software delivery time is linearly proportional to time. Numerical examples are shown to illustrate the results.

  • PDF

10 Gbps Optical Signal Transmission via Long-Range Surface Plasmon Polariton Waveguide

  • Ju, Jung-Jin;Kim, Min-Su;Park, Sun-Tak;Kim, Jin-Tae;Park, Seung-Koo;Lee, Myung-Hyun
    • ETRI Journal
    • /
    • v.29 no.6
    • /
    • pp.808-810
    • /
    • 2007
  • We demonstrate 10 Gbps optical signal transmission via long-range surface plasmon polaritons (LR-SPPs) in a very thin metal strip-guided geometry. The LR-SPP waveguide was fabricated as a 14 nm thick, 2.5 ${\mu}m$ wide, and 4 cm long gold strip embedded in a polymer and pigtailed with single-mode fibers. The total insertion loss of 16 dB was achieved at a wavelength of 1.55 ${\mu}m$ as a carrier wave. In a 10 Gbps optical signal transmission experiment, the LR-SPP waveguide exhibits an excellent eye opening and a 2.2 dB power penalty at $10^{-12}$ bit error rate. We confirm, for the first time, that LR-SPPs can efficiently transfer data signals as well as the carrier light.

  • PDF

Design and Configuration of Reconfigurable ATM Networks with Unreliable Links

  • Lee, Jong-Hyup
    • ETRI Journal
    • /
    • v.21 no.4
    • /
    • pp.9-22
    • /
    • 1999
  • This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

  • PDF

Design of a knowledge-based controller for job scheduling in assembly (조립 작업에서의 생산계획 수립을 위한 지식베이스형 제어기의 설계)

  • 김성수;서기성;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.514-518
    • /
    • 1990
  • This paper describes an experimental Knowledge-Based Control System, named KBCS, for manufacturing and assembly. The KBCS of five parts and function : data-base, knowledge acquisition, optimization, and graphic monitoring. The KBCS is utilized for a FMS which is of five machine centers and automatic assembly lines. Each machine can perform almost all manufacturing functions which some difference in efficiency. Buffers store temporarily the incoming components and the outing components. Parts arrive at assembly lines after many steps of manufacturing, and the transfer path and time are determined by procedural knowledge of control systems. Nine different incoming components are set up. The total control system is expected to perform four algorithms, timing algorithm ,sequencing algorithm, penalty algorithm, and cart algorithm. The construction of controller require basic components of manufacturing systems in which knowledges are formulated on the base of the results and the repeated simulation of KBCS with graphic monitoring system. Simulation results by KBCS are compared with those by the other rules of manufacturing.

  • PDF

Critical buckling load optimization of the axially graded layered uniform columns

  • Alkan, Veysel
    • Structural Engineering and Mechanics
    • /
    • v.54 no.4
    • /
    • pp.725-740
    • /
    • 2015
  • This study presents critical buckling load optimization of the axially graded layered uniform columns. In the first place, characteristic equations for the critical buckling loads for all boundary conditions are obtained using the transfer matrix method. Then, for each case, square of this equation is taken as a fitness function together with constraints. Due to explicitly unavailable objective function for the critical buckling loads as a function of segment length and volume fraction of the materials, especially for the column structures with higher segment numbers, initially, prescribed value is assumed for it and then the design variables satisfying constraints are searched using Differential Evolution (DE) optimization method coupled with eigen-value routine. For constraint handling, Exterior Penalty Function formulation is adapted to the optimization cycle. Different boundary conditions are considered. The results reveal that maximum increments in the critical buckling loads are attained about 20% for cantilevered and pinned-pinned end conditions and 18% for clamped-clamped case. Finally, the strongest column structure configurations will be determined. The scientific and statistical results confirmed efficiency, reliability and robustness of the Differential Evolution optimization method and it can be used in the similar problems which especially include transcendental functions.

Meta-Heuristic Algorithm Comparison for Droplet Impingements (액적 충돌 현상기반 최적알고리즘의 비교)

  • Joo Hyun Moon
    • Journal of ILASS-Korea
    • /
    • v.28 no.4
    • /
    • pp.161-168
    • /
    • 2023
  • Droplet impingement on solid surfaces is pivotal for a range of spray and heat transfer processes. This study aims to optimize the cooling performance of single droplet impingement on heated textured surfaces. We focused on maximizing the cooling effectiveness or the total contact area at the droplet maximum spread. For efficient estimation of the optimal values of the unknown variables, we introduced an enhanced Genetic Algorithm (GA) and Particle swarm optimization algorithm (PSO). These novel algorithms incorporate its developed theoretical backgrounds to compare proper optimized results. The comparison, considering the peak values of objective functions, computation durations, and the count of penalty particles, confirmed that PSO method offers swifter and more efficient searches, compared to GA algorithm, contributing finding the effective way for the spray and droplet impingement process.

Numerical simulation and investigation of jet impingement cooling heat transfer for the rotor blade

  • Peiravi, Amin;Bozorg, Mohsen Agha Seyyed Mirza;Mostofizadeh, Alireza
    • Advances in aircraft and spacecraft science
    • /
    • v.7 no.6
    • /
    • pp.537-551
    • /
    • 2020
  • Investigation of leading edge impingement cooling for first stage rotor blades in an aero-engine turbine, its effect on rotor temperature and trailing edge wake loss have been undertaken in this study. The rotor is modeled with the nozzle for attaining a more accurate simulation. The rotor blade is hollowed in order for the coolant to move inside. Also, plenum with the 15 jet nozzles are placed in it. The plenum is fed by compressed fresh air at the rotor hub. Engine operational and real condition is exerted as boundary condition. Rotor is inspected in two states: in existence of cooling technique and non-cooling state. Three-dimensional compressible and steady solutions of RANS equations with SST K-ω turbulent model has been performed for this numerical simulation. The results show that leading edge is one of the most critical regions because of stagnation formation in those areas. Another high temperature region is rotor blade tip for existence of tip leakage in this area and jet impingement cooling can effectively cover these regions. The rotation impact of the jet velocity from hub to tip caused a tendency in coolant streamlines to move toward the rotor blade tip. In addition, by discharging used coolant air from the trailing edge and ejecting it to the turbines main flow by means of the slot in trailing edge, which could reduce the trailing edge wake loss and a total decrease in the blade cooling loss penalty.

Taint Inference for Cross-Site Scripting in Context of URL Rewriting and HTML Sanitization

  • Pan, Jinkun;Mao, Xiaoguang;Li, Weishi
    • ETRI Journal
    • /
    • v.38 no.2
    • /
    • pp.376-386
    • /
    • 2016
  • Currently, web applications are gaining in prevalence. In a web application, an input may not be appropriately validated, making the web application susceptible to cross-site scripting (XSS), which poses serious security problems for Internet users and websites to whom such trusted web pages belong. A taint inference is a type of information flow analysis technique that is useful in detecting XSS on the client side. However, in existing techniques, two current practical issues have yet to be handled properly. One is URL rewriting, which transforms a standard URL into a clearer and more manageable form. Another is HTML sanitization, which filters an input against blacklists or whitelists of HTML tags or attributes. In this paper, we make an analogy between the taint inference problem and the molecule sequence alignment problem in bioinformatics, and transfer two techniques related to the latter over to the former to solve the aforementioned yet-to-be-handled-properly practical issues. In particular, in our method, URL rewriting is addressed using local sequence alignment and HTML sanitization is modeled by introducing a removal gap penalty. Empirical results demonstrate the effectiveness and efficiency of our method.

Identification of impact forces on composite structures using an inverse approach

  • Hu, Ning;Matsumoto, Satoshi;Nishi, Ryu;Fukunaga, Hisao
    • Structural Engineering and Mechanics
    • /
    • v.27 no.4
    • /
    • pp.409-424
    • /
    • 2007
  • In this paper, an identification method of impact force is proposed for composite structures. In this method, the relation between force histories and strain responses is first formulated. The transfer matrix, which relates the strain responses of sensors and impact force information, is constructed from the finite element method (FEM). Based on this relation, an optimization model to minimize the difference between the measured strain responses and numerically evaluated strain responses is built up to obtain the impact force history. The identification of force history is performed by a modified least-squares method that imposes the penalty on the first-order derivative of the force history. Moreover, from the relation of strain responses and force history, an error vector indicating the force location is defined and used for the force location identification. The above theory has also been extended into the cases when using acceleration information instead of strain information. The validity of the present method has been verified through two experimental examples. The obtained results demonstrate that the present approach works very well, even when the internal damages in composites happen due to impact events. Moreover, this method can be used for the real-time health monitoring of composite structures.