A cell-based robust optimal coordinated control on urban arterial road

Process of optimizing coordinated control is divided into two stages. At the first stage, the study improves a robust optimal control model of single-point intersection to optimize cycle and split. At the second stage, the study combines all links with intersections of arterial road as a complete system, and applies cell transmission model to simulate traffic flow on urban signalized arterial road. We propose a coordinated control model based on the platform to optimize offset between adjacent intersections. Genetic algorithm is executed by MATLAB to solve the model. The performance evaluations show that the model not only effectively reduces average delay and stopping rate of vehicles on arterial road and largely enhances traffic capacity of arterial road, but also lowers the sensitivity of signal control for flow fluctuations.

Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations

Recently, iteratively reweighted methods have attracted much interest in compressed sensing, outperforming their unweighted counterparts in most cases. In these methods, decision variables and weights are optimized alternatingly, or decision variables are optimized under heuristically chosen weights. In this paper,we present a novel weighted l1-norm minimization problem for the sparsest solution of underdetermined linear equations. We propose an iteratively weighted thresholding method for this problem, wherein decision variables and weights are optimized simultaneously. Furthermore, we prove that the iteration process will converge eventually. Using the homotopy technique, we enhance the performance of the iteratively weighted thresholding method. Finally, extensive computational experiments show that our method performs better in terms of both running time and recovery accuracy compared with some state-of-the-art methods.

菌蜕搭载的埃博霉素促进Caspase-3介导的HeLa细胞凋亡

[目的]初步探讨菌蜕搭载的埃博霉素抑制HeLa细胞增殖的机制。[方法]用半抑制浓度的游离或菌蜕搭载的埃博霉素B分别处理HeLa细胞4~48 h,应用凋亡检测试剂盒分析细胞凋亡情况,应用Caspase-3分析试剂盒检测Caspase-3的活性,并用透射电镜观察细胞的形态变化。[结果]菌蜕搭载的埃博霉素B能更快地诱导HeLa细胞发生时间依赖的凋亡和坏死,处理24 h时早期凋亡细胞及晚期凋亡和坏死细胞的比例分别达32.72%和18.36%,处理48 h时比例分别达23.14%和51.52%。该药物还能诱导更强的Caspase-3激活,处理24 h时其活性约为游离埃博霉素B的1.5倍。Caspase-3活性的升高程度与细胞的早期凋亡程度相平行。该药物处理的HeLa细胞显示典型的凋亡特征。[结论]菌蜕搭载的埃博霉素B能更有效地促进Caspase-3介导的HeLa细胞凋亡。

Combining Clustered Adaptive Multistart and Discrete Dynamic Convexized Method for the Max-Cut Problem

Given an undirected graph with edge weights,the max-cut problem is to find a partition of the vertices into twosubsets,such that the sumof theweights of the edges crossing different subsets ismaximized.Heuristics based on auxiliary function can obtain high-quality solutions of the max-cut problem,but suffer high solution cost when instances grow large.In this paper,we combine clustered adaptive multistart and discrete dynamic convexized method to obtain high-quality solutions in a reasonable time.Computational experiments on two sets of benchmark instances from the literature were performed.Numerical results and comparisons with some heuristics based on auxiliary function show that the proposed algorithm is much faster and can obtain better solutions.Comparisons with several state-ofthe-science heuristics demonstrate that the proposed algorithm is competitive.

EQUIVALENCE BETWEEN NONNEGATIVE SOLUTIONS TO PARTIAL SPARSE AND WEIGHTED l_1-NORM MINIMIZATIONS

Based on the range space property （RSP）, the equivalent conditions between nonnegative solutions to the partial sparse and the corresponding weighted l1-norm minimization problem are studied in this paper. Different from other conditions based on the spark property, the mutual coherence, the null space property （NSP） and the restricted isometry property （RIP）, the RSP- based conditions are easier to be verified. Moreover, the proposed conditions guarantee not only the strong equivalence, but also the equivalence between the two problems. First, according to the foundation of the strict complemenrarity theorem of linear programming, a sufficient and necessary condition, satisfying the RSP of the sensing matrix and the full column rank property of the corresponding sub-matrix, is presented for the unique nonnegative solution to the weighted l1-norm minimization problem. Then, based on this condition, the equivalence conditions between the two problems are proposed. Finally, this paper shows that the matrix with the RSP of order k can guarantee the strong equivalence of the two problems.

AN EFFECTIVE DETAILED ROUTING ALGORITHM CONSIDERING ADVANCED TECHNOLOGY NODES

Detailed routing has become much challenging in modern circuit designs due to the extreme scaling of chip size and the complicated design rules.In this paper,we give an effective algorithm for detailed routing considering advanced technology nodes.First,we present a valid pin-access candidates generation technology for handling complex pin shapes.Then,we propose a tree-based nets components selection algorithm to decide connecting order for multiple nets components.Finally,combined with global routing results and advanced technology nodes,an initial routing results optimization algorithm is presented to achieve the final detailed routing results.Experimental results on industry benchmarks show that,our proposed algorithm not only achieves 100%routability on real industrial cases in a reasonable runtime,but also optimizes total wirelength,total vias and other advanced technology nodes simultaneously.