• Title/Summary/Keyword: Minimum-time

Search Result 4,155, Processing Time 0.03 seconds

A Algorithm on Optimizing Traffic Network by the Control of Traffic Signal Timing (교통신호등 제어를 통한 교통망 최적화 알고리즘)

  • An, Yeong-Pil;Kim, Dong-Choon;Na, Seung-kwon
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.5
    • /
    • pp.472-478
    • /
    • 2017
  • In this paper, we deals with optimizing traffic signal timing in grid networks by using a network topology design method. Optimizing traffic signal timing includes minimizing delay time delay between departure and destination by interlocking straight traffic signal in the minimum spanning tree(MST). On the assumption that users of network abide by the paths provided in this paper, this paper shows optimizing traffic signal timing in grid networks. the paths provided in this paper is gathered by using Dijkstra algorithm used in computer networks. The results indicate minimizing delay time of passing through the grid network and interlocking traffic signal in the grid network.

An Integrated MIN Circuit Design of DTW PE for Speech Recognition (음성인식용 DTW PE의 IC화를 위한 MIN회로의 설계)

  • 정광재;문홍진;최규훈;김종교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.8
    • /
    • pp.639-647
    • /
    • 1990
  • Dynamic time warp(DTW) needs for interative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at the real time recognition design which enables large dictionary hardware realization using DTW algorithm. The DTW PE cell is seperated into three large blocks. "MIN" is the one block for counting accumulated minimum distance, "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. We have accomplisehd circuit design and verification for the MIN blocks, and performed MIN layout and DRC(design rule check) using 3um CMOS N-Well rule base.ing 3um CMOS N-Well rule base.

  • PDF

Synergistic Effect in Combination of Danshen (Salvia miltiorrhiza) Extracts with Antibiotics against Methicillin-resistant Staphylococcus aureus

  • Cha, Jeong-Dan
    • Food Science and Biotechnology
    • /
    • v.18 no.5
    • /
    • pp.1263-1272
    • /
    • 2009
  • Danshen (Salvia miltiorrhiza Bunge) is a traditional Korean medicine that is commonly used for the treatment of inflammatory diseases such as edema, arthritis, hepatitis, and endangitis. The several extracts of danshen were tested for antimicrobial activity against methicillin-resistant Staphylococcus aureus (MRSA) isolated in clinic by broth microdilution method, the checkerboard, and time-kill methods to evaluate the synergistic effects of the combination of the extracts with antibiotics. The chloroform ($CHCl_3$) and n-hexane (HEX) extracts [minimum inhibitory concentration (MIC), 0.0078-0.3125${\mu}g/mL$; minimum bactericidal concentration (MBC), 0.019-0.625${\mu}g/mL$] were found to have strong antibacterial activity against MRSA. Additionally, when the $CHCl_3$ and HEX extracts were co-administered with ampicillin or oxacillin, a synergistic effect against MRSA was observed. Furthermore, a time-kill study evaluating the effects of the extracts against MRSA indicated that treatment with the $CHCl_3$ extract in combination with ampicillin or oxacillin produced rapid bactericidal activity. These results suggest that danshen extracts may have potently antimicrobial activity and thus, it can be a suitable phytotherapeutic agent for treating MRSA infections.

High Performance Glass Beads for Traffic Marking in Wet Weather (차선의 우천시 야간 시인성 향상을 위한 그라스 비드 적용 연구)

  • Lee, Chang-Geun;Lee, Hyun-Seock;Oh, Heung-Un
    • International Journal of Highway Engineering
    • /
    • v.14 no.1
    • /
    • pp.9-16
    • /
    • 2012
  • The performance of road markings is classified into the visibility at daytime, night time, wet condition and rainy conditions. The objective of this study is to obtain the driving safety of drivers under conditions of unstable weather condition such as the rain. The visibility of road markings is closely related to the preview time and detection distances and the ways to improve road marking materials and increase the dry retroreflectivity and wet retroreflectivity, which are the measures of daytime and nighttime visibility is researched to decrease the traffic accidents. For this purpose, Road marking glass beads with the refraction rate of 1.5 and 2.2 are introduced to raise the retroreflectivity. After investigating the minimum threshold retroreflectivity and Install Minimum retroreflectivity at home and abroad, minimum control values for the roadmarking visibility and improvement of nightime rainy retroreflectivity are suggested by physical properties and retroreflectivity experiments.

Performance and parameter region for real time use in IEEE 802.4 token bus network

  • Park, Hong-Seong;Kim, Deok-Woo;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10b
    • /
    • pp.1805-1810
    • /
    • 1991
  • This paper derives the upper and the lower bound of the mean cycle time and the mean service time of the class 6 and the class 4, within which the minimum utilization constrain of the class 4 is guaranteed. Also, derived are conditions under which the token bus network is stable or unstable. These bounds and stable conditions are represented in terms of the high priority token hold time, the token rotation time and the arrival rate and the total station number etc. This paper suggest a parameter tuning algorithm in a partially symmetric token bus network with two classes, which maximizes the token rotation time for a suitable high priority token hold time and at the same time meets the stability condition of the network, the real time constraint and the minimum utilization constraint of the class 4.

  • PDF

Mechanism for Connecting Input Edges Using Steiner Tree (스타이너 트리를 이용한 입력 선분의 연결)

  • Kim, Joon-Mo;Kim, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.213-220
    • /
    • 2010
  • In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.

Minimum thickness of flat plates considering construction load effect

  • Hwang, Hyeon-Jong;Ma, Gao;Kim, Chang-Soo
    • Structural Engineering and Mechanics
    • /
    • v.69 no.1
    • /
    • pp.1-10
    • /
    • 2019
  • In the construction of flat plate slabs, which are widely used for tall buildings but have relatively low flexural stiffness, serviceability problems such as excessive deflections and cracks are of great concern. To prevent excessive deflections at service load levels, current design codes require the minimum slab thickness, but the requirement could be unconservative because it is independent on loading and elastic modulus of concrete, both of which have significant effects on slab deflections. In the present study, to investigate the effects of the construction load of shored slabs, reduced flexural stiffness and moment distribution of early-age slabs, and creep and shrinkage of concrete on immediate and time-dependent deflections, numerical analysis was performed using the previously developed numerical models. A parametric study was performed for various design and construction conditions of practical ranges, and a new minimum permissible thickness of flat plate slabs was proposed satisfying the serviceability requirement for deflection. The proposed minimum slab thickness was compared with current design code provisions and numerical analysis results, and it agreed well with the numerical analysis results.

Efficient Construction of Large Scale Grade of Services Steiner Tree Using Space Locality and Polynomial-Time Approximation Scheme (공간 지역성과 PTAS를 활용한 대형 GOSST의 효과적 구성)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.153-161
    • /
    • 2011
  • As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.

A Polynomial Time Approximation Scheme for Enormous Euclidean Minimum Spanning Tree Problem (대형 유클리드 최소신장트리 문제해결을 위한 다항시간 근사 법)

  • Kim, In-Bum
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.5
    • /
    • pp.64-73
    • /
    • 2011
  • The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

Minimum Wages and Wage Inequality in the OECD Countries

  • Joe, Dong-Hee;Moon, Seongman
    • East Asian Economic Review
    • /
    • v.24 no.3
    • /
    • pp.253-273
    • /
    • 2020
  • This paper investigates the impact of the effective minimum wage, defined as the log difference between the minimum and the median wages, on wage inequalities in the OECD countries. Unlike the previous studies that focus on single countries in which the minimum wage has no cross-sectional variation and rely instead on within-country variations of wage distribution across regions or socio-economic characteristics, we use a country panel that allows for both cross-sectional and time-series variations in minimum wage. We also control for more factors than in the previous studies whose absence may cause endogeneity. Our results confirm the previous findings that increases in minimum wage alleviate the wage inequality at the lower tail of the wage distribution, while having little effect at the upper tail. The estimated effect is larger for women than for men, which is consistent with the fact that the share of workers who are directly affected by the changes in minimum wage is bigger among women than men. An application of the IVs of Autor, Manning and Smith (2016) supports the robustness of our findings.