The Experts below are selected from a list of 16557 Experts worldwide ranked by ideXlab platform
Haibo Zeng - One of the best experts on this subject based on the ideXlab platform.
-
traffic assignment with maximum Delay Constraint in stochastic network
Vehicular Technology Conference, 2016Co-Authors: Chuansheng Dong, Qingyu Liu, Haibo ZengAbstract:Increasing the throughput by balancing the traffic load through the whole network is important for the transportation system. User optimal routing service usually results in congestions in the bottleneck links. On the other hand, individual travelers typically have Delay Constraints to satisfy, which might be ignored in the system optimum. In this work, we look into the traffic assignment problem in the stochastic network, considering the maximum Delay Constraint, so that any route suggested by the system optimal traffic assignment does not incur a Delay longer than the Constraint in most cases. We formulate the Stochastic Delay Constrained Maximum Flow problem (SDCMF), and prove that it is NP- Complete. The Delay aware algorithms are proposed to solve the SDCMF problem, which not only find a set of paths with maximum flow, but also consider the Delay of each path.
-
VTC Spring - Traffic Assignment with Maximum Delay Constraint in Stochastic Network
2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), 2016Co-Authors: Chuansheng Dong, Qingyu Liu, Haibo ZengAbstract:Increasing the throughput by balancing the traffic load through the whole network is important for the transportation system. User optimal routing service usually results in congestions in the bottleneck links. On the other hand, individual travelers typically have Delay Constraints to satisfy, which might be ignored in the system optimum. In this work, we look into the traffic assignment problem in the stochastic network, considering the maximum Delay Constraint, so that any route suggested by the system optimal traffic assignment does not incur a Delay longer than the Constraint in most cases. We formulate the Stochastic Delay Constrained Maximum Flow problem (SDCMF), and prove that it is NP- Complete. The Delay aware algorithms are proposed to solve the SDCMF problem, which not only find a set of paths with maximum flow, but also consider the Delay of each path.
Chuansheng Dong - One of the best experts on this subject based on the ideXlab platform.
-
traffic assignment with maximum Delay Constraint in stochastic network
Vehicular Technology Conference, 2016Co-Authors: Chuansheng Dong, Qingyu Liu, Haibo ZengAbstract:Increasing the throughput by balancing the traffic load through the whole network is important for the transportation system. User optimal routing service usually results in congestions in the bottleneck links. On the other hand, individual travelers typically have Delay Constraints to satisfy, which might be ignored in the system optimum. In this work, we look into the traffic assignment problem in the stochastic network, considering the maximum Delay Constraint, so that any route suggested by the system optimal traffic assignment does not incur a Delay longer than the Constraint in most cases. We formulate the Stochastic Delay Constrained Maximum Flow problem (SDCMF), and prove that it is NP- Complete. The Delay aware algorithms are proposed to solve the SDCMF problem, which not only find a set of paths with maximum flow, but also consider the Delay of each path.
-
VTC Spring - Traffic Assignment with Maximum Delay Constraint in Stochastic Network
2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), 2016Co-Authors: Chuansheng Dong, Qingyu Liu, Haibo ZengAbstract:Increasing the throughput by balancing the traffic load through the whole network is important for the transportation system. User optimal routing service usually results in congestions in the bottleneck links. On the other hand, individual travelers typically have Delay Constraints to satisfy, which might be ignored in the system optimum. In this work, we look into the traffic assignment problem in the stochastic network, considering the maximum Delay Constraint, so that any route suggested by the system optimal traffic assignment does not incur a Delay longer than the Constraint in most cases. We formulate the Stochastic Delay Constrained Maximum Flow problem (SDCMF), and prove that it is NP- Complete. The Delay aware algorithms are proposed to solve the SDCMF problem, which not only find a set of paths with maximum flow, but also consider the Delay of each path.
Yongzhi Liu - One of the best experts on this subject based on the ideXlab platform.
-
design of arbitrary complex coefficient wls fir filters with group Delay Constraints
IEEE Transactions on Signal Processing, 2009Co-Authors: Zhiping Lin, Yongzhi LiuAbstract:This correspondence presents a new method for the weighted least-squares (WLS) design of complex coefficient finite-impulse response (FIR) digital filters with arbitrary frequency responses by imposing an explicit group Delay Constraint. The nonlinearity of the group Delay with respect to the filter coefficients is circumvented by linearization so that the group Delay Constraint can be successfully incorporated into the second-order cone programming (SOCP) framework. The effectiveness of the proposed method is illustrated by two nontrivial examples and compared favorably with some existing methods.
-
Design of WLS FIR filters with group Delay Constraint
2007 6th International Conference on Information Communications & Signal Processing, 2007Co-Authors: Yongzhi Liu, Zhiping LinAbstract:This paper presents a weighted least-squares method for the design of real coefficient finite impulse response digital filters with arbitrary magnitude and group Delay responses. To meet with both the prescribed magnitude response and group Delay, a complex magnitude Constraint and an explicit group Delay Constraint are imposed in the design formulation. Through analytical derivation of the group Delay and its gradient, the group Delay error is linearized by a sequence of approximations, each of which can be cast and solved efficiently in the second-order cone programming (SOCP) framework.
Zhiping Lin - One of the best experts on this subject based on the ideXlab platform.
-
design of arbitrary complex coefficient wls fir filters with group Delay Constraints
IEEE Transactions on Signal Processing, 2009Co-Authors: Zhiping Lin, Yongzhi LiuAbstract:This correspondence presents a new method for the weighted least-squares (WLS) design of complex coefficient finite-impulse response (FIR) digital filters with arbitrary frequency responses by imposing an explicit group Delay Constraint. The nonlinearity of the group Delay with respect to the filter coefficients is circumvented by linearization so that the group Delay Constraint can be successfully incorporated into the second-order cone programming (SOCP) framework. The effectiveness of the proposed method is illustrated by two nontrivial examples and compared favorably with some existing methods.
-
Design of WLS FIR filters with group Delay Constraint
2007 6th International Conference on Information Communications & Signal Processing, 2007Co-Authors: Yongzhi Liu, Zhiping LinAbstract:This paper presents a weighted least-squares method for the design of real coefficient finite impulse response digital filters with arbitrary magnitude and group Delay responses. To meet with both the prescribed magnitude response and group Delay, a complex magnitude Constraint and an explicit group Delay Constraint are imposed in the design formulation. Through analytical derivation of the group Delay and its gradient, the group Delay error is linearized by a sequence of approximations, each of which can be cast and solved efficiently in the second-order cone programming (SOCP) framework.
Qingyu Liu - One of the best experts on this subject based on the ideXlab platform.
-
traffic assignment with maximum Delay Constraint in stochastic network
Vehicular Technology Conference, 2016Co-Authors: Chuansheng Dong, Qingyu Liu, Haibo ZengAbstract:Increasing the throughput by balancing the traffic load through the whole network is important for the transportation system. User optimal routing service usually results in congestions in the bottleneck links. On the other hand, individual travelers typically have Delay Constraints to satisfy, which might be ignored in the system optimum. In this work, we look into the traffic assignment problem in the stochastic network, considering the maximum Delay Constraint, so that any route suggested by the system optimal traffic assignment does not incur a Delay longer than the Constraint in most cases. We formulate the Stochastic Delay Constrained Maximum Flow problem (SDCMF), and prove that it is NP- Complete. The Delay aware algorithms are proposed to solve the SDCMF problem, which not only find a set of paths with maximum flow, but also consider the Delay of each path.
-
VTC Spring - Traffic Assignment with Maximum Delay Constraint in Stochastic Network
2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), 2016Co-Authors: Chuansheng Dong, Qingyu Liu, Haibo ZengAbstract:Increasing the throughput by balancing the traffic load through the whole network is important for the transportation system. User optimal routing service usually results in congestions in the bottleneck links. On the other hand, individual travelers typically have Delay Constraints to satisfy, which might be ignored in the system optimum. In this work, we look into the traffic assignment problem in the stochastic network, considering the maximum Delay Constraint, so that any route suggested by the system optimal traffic assignment does not incur a Delay longer than the Constraint in most cases. We formulate the Stochastic Delay Constrained Maximum Flow problem (SDCMF), and prove that it is NP- Complete. The Delay aware algorithms are proposed to solve the SDCMF problem, which not only find a set of paths with maximum flow, but also consider the Delay of each path.