Consider a branching random walk, where the underlying branching mechanism is governed by a Galton-Watson process and the moving law of particles by a discrete random variable on the integer lattice Z. Denote by Zn（z...Consider a branching random walk, where the underlying branching mechanism is governed by a Galton-Watson process and the moving law of particles by a discrete random variable on the integer lattice Z. Denote by Zn（z） the number of particles in the n-th generation in the model for each z ∈ Z. We derive the exact convergence rate in the local limit theorem for Zn（z） assuming a condition like ＂EN（logN）1＋λ 〈 ∞＂ for the offspring distribution and a finite moment condition on the motion law. This complements the known results for the strongly non-lattice branching random walk on the real line and for the simple symmetric branching random walk on the integer lattice.展开更多
密集场景下准确人群计数和定位,对于保障公共安全具有重要的意义。针对密集人群计数与定位易受人群分布不均、背景干扰等因素的影响,导致计数定位不准确的问题,提出一种基于区域感知校准的自适应人群计数与定位方法。通过构建金字塔结...密集场景下准确人群计数和定位,对于保障公共安全具有重要的意义。针对密集人群计数与定位易受人群分布不均、背景干扰等因素的影响,导致计数定位不准确的问题,提出一种基于区域感知校准的自适应人群计数与定位方法。通过构建金字塔结构提取人群图像的多尺度特征,增强特征关联性,并设计可变形几何自适应模块学习不同分布的人群几何特征,以增强对人群分布不均的适应性。在此基础上,提出区域感知和区域校准模块,提取全局上下文特征和区域特征,克服了背景干扰造成的定位与计数不准问题。接着通过双分支卷积预测通路,输出生成点的预测位置和置信度分数,以提高网络的定位与计数精度。最后提出改进二分图最大匹配Hopcroft-Karp算法对真值点与预测点进行匹配校准,从而完成人群定位与计数。实验结果表明,所提方法分别在公开的ShanghaiTech Part A和Part B数据集、NWPU-Crowd数据集、UCF-QNRF数据集上评价指标均优于对比算法,且定位精度较P2Pnet分别提高了3.5%、6.1%、11.3%和8.1%,能够有效提高人群定位与计数的准确度。展开更多
This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (V<sub>max</sub>), maximum tardy job, denote...This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (V<sub>max</sub>), maximum tardy job, denoted by (T<sub>max</sub>), and maximum earliness (E<sub>max</sub>). We propose several algorithms based on types of objectives function to be optimized when dealing with simultaneous minimization problems with and without weight and hierarchical minimization problems. The proposed Algorithm (3) is to find the set of efficient solutions for 1//F (V<sub>max</sub>, T<sub>max</sub>, E<sub>max</sub>) and 1//(V<sub>max</sub> + T<sub>max</sub> + E<sub>max</sub>). The Local Search Heuristic Methods (Descent Method (DM), Simulated Annealing (SA), Genetic Algorithm (GA), and the Tree Type Heuristics Method (TTHM) are applied to solve all suggested problems. Finally, the experimental results of Algorithm (3) are compared with the results of the Branch and Bound (BAB) method for optimal and Pareto optimal solutions for smaller instance sizes and compared to the Local Search Heuristic Methods for large instance sizes. These results ensure the efficiency of Algorithm (3) in a reasonable time.展开更多
In order to suppress vibration in flexible manipulators, a new type of manipulator mechanism with controllable local degrees of freedom is proposed. This mechanism consists of a main chain and some branch links. The m...In order to suppress vibration in flexible manipulators, a new type of manipulator mechanism with controllable local degrees of freedom is proposed. This mechanism consists of a main chain and some branch links. The main chain is of a flexible open-chain configuration with an end-effector installed at its tip, and the rigid branch links are able to perform active movements. It is proved by kinematics and dynamic analysis that, the branch links bear no direct kinematic relation to the main chain, but their independent motions can strongly affect the dynamic behavior and performance of the flexible manipulator. Then comes a new idea of suppressing vibration, in which independent motions of the branch links are used to suppress the undesired vibration of the flexible main chain through dynamic coupling. On this basis, an optimal method for reducing vibration of flexible manipulators is proposed. Finally, the effectiveness of this method is verified by numerical simulations.展开更多
文摘Consider a branching random walk, where the underlying branching mechanism is governed by a Galton-Watson process and the moving law of particles by a discrete random variable on the integer lattice Z. Denote by Zn（z） the number of particles in the n-th generation in the model for each z ∈ Z. We derive the exact convergence rate in the local limit theorem for Zn（z） assuming a condition like ＂EN（logN）1＋λ 〈 ∞＂ for the offspring distribution and a finite moment condition on the motion law. This complements the known results for the strongly non-lattice branching random walk on the real line and for the simple symmetric branching random walk on the integer lattice.
文摘密集场景下准确人群计数和定位,对于保障公共安全具有重要的意义。针对密集人群计数与定位易受人群分布不均、背景干扰等因素的影响,导致计数定位不准确的问题,提出一种基于区域感知校准的自适应人群计数与定位方法。通过构建金字塔结构提取人群图像的多尺度特征,增强特征关联性,并设计可变形几何自适应模块学习不同分布的人群几何特征,以增强对人群分布不均的适应性。在此基础上,提出区域感知和区域校准模块,提取全局上下文特征和区域特征,克服了背景干扰造成的定位与计数不准问题。接着通过双分支卷积预测通路,输出生成点的预测位置和置信度分数,以提高网络的定位与计数精度。最后提出改进二分图最大匹配Hopcroft-Karp算法对真值点与预测点进行匹配校准,从而完成人群定位与计数。实验结果表明,所提方法分别在公开的ShanghaiTech Part A和Part B数据集、NWPU-Crowd数据集、UCF-QNRF数据集上评价指标均优于对比算法,且定位精度较P2Pnet分别提高了3.5%、6.1%、11.3%和8.1%,能够有效提高人群定位与计数的准确度。
文摘This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (V<sub>max</sub>), maximum tardy job, denoted by (T<sub>max</sub>), and maximum earliness (E<sub>max</sub>). We propose several algorithms based on types of objectives function to be optimized when dealing with simultaneous minimization problems with and without weight and hierarchical minimization problems. The proposed Algorithm (3) is to find the set of efficient solutions for 1//F (V<sub>max</sub>, T<sub>max</sub>, E<sub>max</sub>) and 1//(V<sub>max</sub> + T<sub>max</sub> + E<sub>max</sub>). The Local Search Heuristic Methods (Descent Method (DM), Simulated Annealing (SA), Genetic Algorithm (GA), and the Tree Type Heuristics Method (TTHM) are applied to solve all suggested problems. Finally, the experimental results of Algorithm (3) are compared with the results of the Branch and Bound (BAB) method for optimal and Pareto optimal solutions for smaller instance sizes and compared to the Local Search Heuristic Methods for large instance sizes. These results ensure the efficiency of Algorithm (3) in a reasonable time.
基金Ministry of Education Important Research Project of Scienceand Technology of China(307005)National Hi-Tech Research and Development Program of China(SQ2007AA04Z231266)
文摘In order to suppress vibration in flexible manipulators, a new type of manipulator mechanism with controllable local degrees of freedom is proposed. This mechanism consists of a main chain and some branch links. The main chain is of a flexible open-chain configuration with an end-effector installed at its tip, and the rigid branch links are able to perform active movements. It is proved by kinematics and dynamic analysis that, the branch links bear no direct kinematic relation to the main chain, but their independent motions can strongly affect the dynamic behavior and performance of the flexible manipulator. Then comes a new idea of suppressing vibration, in which independent motions of the branch links are used to suppress the undesired vibration of the flexible main chain through dynamic coupling. On this basis, an optimal method for reducing vibration of flexible manipulators is proposed. Finally, the effectiveness of this method is verified by numerical simulations.
