• Title/Summary/Keyword: minimum flow problem

Search Result 98, Processing Time 0.029 seconds

A Low Power-Driven Data Path Optimization based on Minimizing Switching Activity (스위칭 동작 최소화를 통한 저전력 데이터 경로 최적화)

  • 임세진;조준동
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.4
    • /
    • pp.17-29
    • /
    • 1999
  • This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

  • PDF

Estimation of Unprotected Left-Turn Saturation Flows (비보호 좌회전 포화유률 추정)

  • 김경환
    • Proceedings of the KOR-KST Conference
    • /
    • 1998.10a
    • /
    • pp.236-244
    • /
    • 1998
  • When the capacity and traffic operation at signalized intersections are analyzed in Korea, the unprotected left-turn saturation flow rate, which is an important parameter for the analysis, is estimated form the USHCM model. thus, exact analysis of the left-turn is not possible because of the difference of traffic environments between two contries. In order to improve this problem, it is undertaken in this study to develop techniques for the estimation of unprotected left-turn saturation flows based on Korean drivers' data. As study intersections, signalized or unsignalized intersections on the 6, 4 and 2 lane streets are selected. the data for the saturation flow measurement and gap-acceptance behavior analysis are inputed in a notebook computer on the sites. The critical acceptance gaps of the 6, 4, and 2 lane streets are analyzed to be 6.0 secs, 4.6 secs, and 4.3 secs respectively. the average minimum headway of the left-turn vehicle was observed to be 2.6 secs. As the model to estimate unportected left-turn saturation flows, the drew model is recommended for 6 and 4 lane streets, and a graph is suggested for the 2-lane street. As the values of the parameters of the Drew model, the 2.6 secs of this study is recommended for the average minimum headway of the left-turn. But, the critical acceptance gap varies according to the approach speed of opposing traffic and driver population, it requires field survey to measure the gap of an intersection; however, the values of the gaps studied in this study may be used for the general intersections in urban area in Korean.

  • PDF

Count-Min HyperLogLog : Cardinality Estimation Algorithm for Big Network Data (Count-Min HyperLogLog : 네트워크 빅데이터를 위한 카디널리티 추정 알고리즘)

  • Sinjung Kang;DaeHun Nyang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.3
    • /
    • pp.427-435
    • /
    • 2023
  • Cardinality estimation is used in wide range of applications and a fundamental problem processing a large range of data. While the internet moves into the era of big data, the function addressing cardinality estimation use only on-chip cache memory. To use memory efficiently, there have been various methods proposed. However, because of the noises between estimator, which is data structure per flow, loss of accuracy occurs in these algorithms. In this paper, we focus on minimizing noises. We propose multiple data structure that each estimator has the number of estimated value as many as the number of structures and choose the minimum value, which is one with minimum noises, We discover that the proposed algorithm achieves better performance than the best existing work using the same tight memory, such as 1 bit per flow, through experiment.

Mismatching Problem between Generic Pole-assignabilities by Static Output Feedback and Dynamic Output Feedback in Linear Systems

  • Kim Su-Wood
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.1
    • /
    • pp.56-69
    • /
    • 2005
  • In this paper, it is clearly shown that the two well-known necessary and sufficient conditions mp n as generic static output feedback pole-assignment and mp + d(m+p) n+d as generic minimum d-th order dynamic output feedback pole-assignment on complex field, unbelievably, do not match up each other in strictly proper linear systems. For the analysis, a diagram analysis is newly created (which is defined by the analysis of 'convoluted rectangular/dot diagrams' constructed via node-branch conversion of the signal flow graphs of output feedback gain loops). Under this diagram analysis, it is proved that the minimum d-th order dynamic output feedback compensator for pole-assignment in m-input, p-output, n-th order systems is quantitatively decomposed into static output feedback compensator and its associated d number of arbitrary 1st order dynamic elements in augmented (m+d)-input, (p+d)-output, (n+d)-th order systems. Total configuration of the mismatched data is presented in a Table.

Separation of Antibiotics-Producing Mycelia by Cross-Flow Filteration (Cross-Flow Filtration에 의한 항생물질 생산 균사체의 분리)

  • 정상철;윤종원
    • KSBB Journal
    • /
    • v.4 no.2
    • /
    • pp.177-184
    • /
    • 1989
  • In separating mycelia from antibiotic fermentation broths, high permeate flux was obtained by cross-flow filtration using modified regenerated cellulose membrane. The flux was increased most effectively by increasing the flow rate. There existed a critical mycelium density (about 20% PMV) at which the highest flux was observed. In a batchwise concentration of the fermentation broth, the system suffered from a severe fouling problem, which was relieved drastically by applying diafiltration technique, although it increased the permeate volume. A combined concentration/diafiltration process was ideal in keeping relatively high flux together with a high product recovery yield. The best result was obtained by starting diafiltration after concentrating the broth to 20% PMV. By doing so, a 98% product recovery yield was achieved in the shortest time while keeping the permeate volume at a minimum level.

  • PDF

A study on the characteristics of end region flow field for partially cavitating hydrofoil (익형에 발생하는 부분 캐비테이션 후연영역 유동장 특성 연구)

  • 문철진;김시영
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.53-61
    • /
    • 1988
  • Most of the recent for the flow field hydrofoil in partially cavitating condition are the ones which are linearized, and the problem of cavity end region for hydrofoil is not verified. This paper deals with a study on characteristics of end region flow field for partially cavitating hydrofoil by using a characteristics of shear turbulence flow and nonlinear cavity flow theory. The results obtained as follows : 1) Shear layer thickness is decreased gradually going to the end section of hydrofoil. When attack angle is large, it is appeared largely at the region of partial cavitation after its collapsing. 2) The fluctuation velocity of a second-degree relative direction have minimum value at the front of hydrofoil or at the end of hydrofoil. The difference for the validity of attack angle is appeared largely at the surrounding of .chi.$_{e}$ point. 3) The fluctuation velocity of transverse direction decrease from the maximum thickness of cavitation to the end of hydrofoil, but it undergoes largely the effect of pressure recovery. The difference is larger at the region of partial cavitation after its collapsing than at the of hydrofoil. 4) The distribution of Reynolds stress have maximum values at the region of partial cavitation after its collapsing and the end of foil, and the larger attack angle, the larger the distribution of value.e.

  • PDF

On Minimum-Cost Rectilinear Steiner Distance-Preserving Tree (최소 비용 직각선분 Steiner 거리 유지 트리의 최적화)

  • Jo, Jun-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1707-1718
    • /
    • 1996
  • Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

  • PDF

Efficiency criteria for optimization of separation cascades for uranium enrichment

  • Sulaberidze, Georgy;Zeng, Shi;Smirnov, Andrey;Bonarev, Anton;Borisevich, Valentin;Jiang, Dongjun
    • Nuclear Engineering and Technology
    • /
    • v.50 no.1
    • /
    • pp.126-131
    • /
    • 2018
  • As it is known, uranium enrichment is carried out on industrial scale by means of multistage separation facilities, i.e., separation cascades in which gas centrifuges (GCs) are connected in series and parallel. Design and construction of these facilities require significant investment. So, the problem of calculation and optimization of cascade working parameters is still relevant today. At the same time, in many cases, the minimum unit cost of a product is related to the cascade having the smallest possible number of separation elements/GCs. Also, in theoretical studies, it is often acceptable to apply as an efficiency criterion the minimum total flow to supply cascade stages instead of the abovementioned minimum unit cost or the number of separation elements. In this article, cascades with working parameter of a single GC changing from stage to stage are optimized by two of the abovementioned performance criteria and are compared. The results obtained allow us to make a conclusion about their differences.

Shape Optimization of Cavitator for a Supercavitating Projectile Underwater (초공동(超空洞) 하의 수중 주행체 캐비데이터 형상최적설계)

  • Grandhli Ramana V.;Choi JooHo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.10
    • /
    • pp.1566-1573
    • /
    • 2004
  • When a projectile travels at high speed underwater, supercavitating flow arises, in which a huge cavity is generated behind the projectile so that only the nose, i.e., the cavitator, of the projectile is wetted, while the rest of it should be surrounded by the cavity. In that case, the projectile can achieve very high speed due to the reduced drag. Furthermore if the nose of the body is shaped properly, the attendant pressure drag can be maintained at a very low value, so that the overall drag is also reduced dramatically. In this study, shape optimization technique is employed to determine the optimum cavitator shape for minimum drag, given certain operating conditions. Shape optimization technique is also used to solve the potential flow problem fur any given cavitator, which is a free boundary value problem having the cavity shape as unknown a priori. Analytical sensitivities are derived for various shape parameters in order to implement a gradient-based optimization algorithm. Simultaneous optimization technique is proposed for efficient cavitator shape optimization, in which the cavity and cavitator shape are determined in a single optimization routine.

Shape Optimization of Cavitator for a Supercavitating Projectile Underwater (초공동(超空洞) 하의 수중 주행체 캐비테이터 형상최적설계)

  • Choi, Joo-Ho;Grandhi, Ramana V.
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1876-1881
    • /
    • 2003
  • When a projectile travels at high speed underwater, supercavitating flow arises, in which a huge cavity is generated behind the projectile so that only the nose, i.e., the cavitator, of the projectile is wetted, while the rest of it should be surrounded by the cavity. In that case, the projectile can achieve very high speed due to the reduced drag. Furthermore if the nose of the body is shaped properly, the attendant pressure drag can be maintained at a very low value, so that the overall drag is also reduced dramatically. In this study, shape optimization technique is employed to determine the optimum cavitator shape for minimum drag, given certain operating conditions. Shape optimization technique is also used to solve the potential flow problem for any given cavitator, which is a free boundary value problem having the cavity shape as unknown a priori. Analytical sensitivities are derived for various shape parameters in order to implement a gradient-based optimization algorithm. Simultaneous optimization technique is proposed for efficient cavitator shape optimization, in which the cavity and cavitator shape are determined in a single optimization routine.

  • PDF