• Title/Summary/Keyword: minimum flow problem

Search Result 98, Processing Time 0.029 seconds

Understanding of a Rate of Return Analysis using an IRR (내부수익률을 이용한 수익률분석법에 대한 이해)

  • 김진욱;이현주;차동수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.25 no.5
    • /
    • pp.9-14
    • /
    • 2002
  • A capital investment problem is essentially one of determining whether the anticipated cash inflows from a proposed project are sufficiently attractive to invest funds in the project. The net present value(NPV) criterion and internal rate of return(IRR) criterion are widely used as means of making investment decisions. A positive NPV means the equivalent worth of the inflows is greater than the equivalent worth of outflows, so, the project makes profit. Business people are familiar with rates of return because they all borrow money to finance ventures, even if the money they borrow is their own. Thus they are apt to use the IRR in preference to the NPV. The IRR can be defined as the discount rate that causes the net present value of a cash flow to equal zero. Why the project are accepted if the project's IRR is greater than the investor's minimum attractive rate of return\ulcorner Against the NPV, the definition cannot distinctly explain the concept of the IRR as decision criterion. We present a new definition of the IRR as the ratio of profit on the invested capital.

Assessment of Design Method about Sanitary Sewer Network according to RDII and Established Scenario (RDII발생 및 기존 시나리오에 따른 오수간선 네트워크 설계방법 검토)

  • Kim, Jungryul;Oh, Jeill
    • Journal of Korean Society on Water Environment
    • /
    • v.32 no.4
    • /
    • pp.367-374
    • /
    • 2016
  • In this study, the RDII impact on sewer designing in the upstream monitoring area (A site) was considered. Based on the long-term (1/1/2011~12/31/2011) rainfall and flow data consisting of 10-min interval sampling in the nearby design area (B site), the maximum RDII/DWF ratio was selected. The sewer network system at B site was evaluated by the Manning equation. Scenario 1 considering the hourly maximum flow with respect to the flow velocity showed that none of the sewer pipes satisfied the minimum flow velocity condition (0.6 m/s), and 40 pipes did not achieve half of the velocity condition. In scenario 2 considering I/I, 1 the pipes satisfied 0.6 m/s, and 35 pipes showed 0.3 m/s. Scenario 3 reflected the effect of RDII. Velocities in 26 pipes were less than 0.3 m/s, and 4 pipes satisfied the velocity condition. With respect to the allowance rate, 17 pipes were shown to have more than 99%, and none of the pipes satisfied less than 95% of the allowance rate in scenario 1. In scenario 2, 17 Ed: Per the Table pipes showed more than 99% and one pipe showed less than 95%. In scenario 3, 16 pipes showed more than 99% of the allowance rate, and 19 pipes showed less than 95%. Based on these results, it is predicted that deposition would occur due to the slow flow velocity; however, capacity would not be a problem.

A Bottleneck Search Algorithm for Digraph Using Maximum Adjacency Merging Method (최대 인접 병합 방법을 적용한 방향 그래프의 병목지점 탐색 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.5
    • /
    • pp.129-139
    • /
    • 2012
  • Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

Handover Control for WCDMA Femtocell Networks

  • Chowdhury, Mostafa Zaman;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.741-752
    • /
    • 2010
  • The ability to seamlessly switch between the macro networks and femtocell networks is a key driver for femtocell network deployment. The handover procedures for the integrated femtocell/macrocell networks differ from the existing handovers. Some modifications of existing network and protocol architecture for the integration of femtocell networks with the existing macrocell networks are also essential. These modifications change the signal flow for handover procedures due to different 2-tier cell (macrocell and femtocell) environment. The handover between two networks should be performed with minimum signaling. A frequent and unnecessary handover is another problem for hierarchical femtocell/macrocell network environment that must be minimized. This work studies the details mobility management schemes for small and medium scale femtocell network deployment. To do that, firstly we present two different network architectures for small scale and medium scale WCDMA femtocell deployment. The details handover call flow for these two network architectures and CAC scheme to minimize the unnecessary handovers are proposed for the integrated femtocell/macrocell networks. The numerical analysis for the proposed M/M/N/N queuing scheme and the simulation results of the proposed CAC scheme demonstrate the handover call control performances for femtocell environment.

Time Series Crime Prediction Using a Federated Machine Learning Model

  • Salam, Mustafa Abdul;Taha, Sanaa;Ramadan, Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.119-130
    • /
    • 2022
  • Crime is a common social problem that affects the quality of life. As the number of crimes increases, it is necessary to build a model to predict the number of crimes that may occur in a given period, identify the characteristics of a person who may commit a particular crime, and identify places where a particular crime may occur. Data privacy is the main challenge that organizations face when building this type of predictive models. Federated learning (FL) is a promising approach that overcomes data security and privacy challenges, as it enables organizations to build a machine learning model based on distributed datasets without sharing raw data or violating data privacy. In this paper, a federated long short- term memory (LSTM) model is proposed and compared with a traditional LSTM model. Proposed model is developed using TensorFlow Federated (TFF) and the Keras API to predict the number of crimes. The proposed model is applied on the Boston crime dataset. The proposed model's parameters are fine tuned to obtain minimum loss and maximum accuracy. The proposed federated LSTM model is compared with the traditional LSTM model and found that the federated LSTM model achieved lower loss, better accuracy, and higher training time than the traditional LSTM model.

Quasi-steady three-degrees-of-freedom aerodynamic model of inclined/yawed prisms: Formulation and instability for galloping and static divergence

  • Cristoforo Demartino;Zhen Sun;Giulia Matteoni;Christos T. Georgakis
    • Wind and Structures
    • /
    • v.37 no.1
    • /
    • pp.57-78
    • /
    • 2023
  • In this study, a generalized three-degree-of-freedom (3-DoF) analytical model is formulated to predict linear aerodynamic instabilities of a prism under quasi-steady (QS) conditions. The prism is assumed to possess a generic cross-section exposed to turbulent wind flow. The 3-DoFs encompass two orthogonal horizontal directions and rotation about the prism body axis. Inertial coupling is considered to account for the non-coincidence of the mass center and the rotation center. The aerodynamic force coefficients-drag, lift, and moment-depend on the Reynolds number based on relative flow velocity, angle of attack, and the angle between the wind and the cable. Aerodynamic forces are linearized with respect to the static equilibrium configuration and mean wind velocity. Routh-Hurwitz and Liénard and Chipart criteria are used in the eigenvalue problem, yielding an analytical solution for instabilities in galloping and static divergence types. Additionally, the minimum structural damping and stiffness required to prevent these instabilities are numerically determined. The proposed 3-DoF instability model is subsequently applied to a conductor with ice accretion and a full-scale dry inclined cable. In comparison to existing models, the developed model demonstrates superior prediction accuracy for unstable regions compared with results in wind tunnel tests.

Labyrinth Seal Design for Preventing Internal Inflow of Plating Solution (도금액의 내부 유입 방지를 위한 래버린스 시일 설계)

  • Lee, Duck-Gyu;Kim, Wan-Doo
    • Tribology and Lubricants
    • /
    • v.33 no.6
    • /
    • pp.256-262
    • /
    • 2017
  • Molten zinc plating is a process in which zinc is thinly coated over a metallic or non-metallic surface. It is used in various industrial fields for corrosion resistance and decoration. During the process, a steel sheet is passed through a roll that rotates inside the molten zinc liquid in the temperature range of $460^{\circ}C$ to $680^{\circ}C$, and the plating liquid flows into the roll causing abrasion and erosion of the roll surface. This problem is known to accelerate the replacement cycle of the roll and cause considerable economic loss owing to production line stoppage. Here, we propose a mechanism that operates at high temperature and pressure with a labyrinth type seal design to resolve this problem. We theoretically investigate the flow of the plating solution inside the seal and compute the minimum rotation speed required to prevent the plating solution from entering the seal chamber. In addition, we calculate the thermal deformation of the seal during operation and display thermally deformed dimensions at high temperatures. To verify the theoretical results, we perform experiments using pilot test equipment working in the actual plating environment. The experimental results are in good agreement with theoretical results. We expect our results to contribute towards the extension of the roll's life span and thereby reduce the economic losses.

Optimal Long-term Transmission Planning Algorithm using Non-linear Branch-and-bound Method (비선형 분산안전법을 이용한 최적장기송전계률 알고리)

  • 박영문;신중린
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.5
    • /
    • pp.272-281
    • /
    • 1988
  • The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

Optimum Scheduling Algorithm for Job Sequence, Common Due Date Assignment and Makespan to Minimize Total Costs for Multijob in Multimachine Systems (다수(多数) 기계(機械)의 총비용(總費用)을 최소화(最小化)하는 최적작업순서, 공통납기일 및 작업완료일 결정을 위한 일정계획(日程計劃))

  • No, In-Gyu;Kim, Sang-Cheol
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.1
    • /
    • pp.1-11
    • /
    • 1986
  • This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

  • PDF

A Study on the Flow Friction Loss of a Shrouded Rotating Disk (밀폐된 단일 회전 원판 주위의 유동손실에 관한 연구)

  • 조성욱;임윤철
    • Tribology and Lubricants
    • /
    • v.19 no.5
    • /
    • pp.292-297
    • /
    • 2003
  • The fundamental fluid mechanics associated with the rotation of a smooth plane disk enclosed within a cylindrical chamber have been studied experimentally. In order to acquire systematic information pertinent to this problem torque and friction loss data were obtained over a wide range of disk Reynolds numbers for axial clearance-disk radius ratio H/R from 0.025 to 0.2 and radial tip gap-disk radius ratio s/R from 0.021 to 0.105. Loss analysis of hard disk drive (HDD) is presented to describe the contribution of windage loss of a rotating disk. The minimum loss form factor of HDD can be obtained from this analysis at each operation conditions.