浅谈拆除爆破工程中存在的问题和对策

拆除爆破工程的广泛应用为社会主义经济建设提供了有益的帮助,充分体现了科学技术是第一生产力。但是在拆除爆破领域也存在不少问题,如设计、施工、安全防护、爆破器材管理、爆破理论研究等方面还有许多不足,这需要我们认真正视,并采取切实有效的对策加以解决。文中针对存在的问题提出了一些对策,可以为拆除爆破界的同行们借鉴。     

皮带输送机运行过程中常见问题及处理对策

皮带输送机是煤矿井下重要的煤炭运输设备,其稳定运行关系着煤矿生产的高产高效。由于煤矿井下生产环境恶劣,皮带输送机很容易发生各种问题。因此,对皮带输送机运行过程中出现的问题进行准确分析并进行处理显得十分重要。对皮带输送机运行过程中出现的一些常见问题进行了分析,并给出了一些相应的处理对策,有助于实现煤矿生产的高产高效。     

回弹检测法检测混凝土强度相关问题的探讨

本文就当前社会人们对建筑安全水平和质量要求不断提高的背景下,对回弹检测法检测混凝土强度的相关问题进行探讨,并以此推动回弹法检测混凝土强度行业标准的规范化发展进程,希望能够给从事相关行业的工作者提供帮助。     

The generalized discrete ‐centroid problem

The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included.     

Maximizing Convergence Speed for Second Order Consensus in Leaderless Multi-Agent Systems

The paper deals with the consensus problem in a leaderless network of agents that have to reach a common velocity while forming a uniformly spaced string. Moreover, the final common velocity (reference velocity) is determined by the agents in a distributed and leaderless way. Then, the consensus protocol parameters are optimized for networks characterized by a communication topology described by a class of directed graphs having a directed spanning tree, in order to maximize the convergence rate and avoid oscillations. The advantages of the optimized consensus protocol are enlightened by some simulation results and comparison with a protocol proposed in the related literature. The presented protocol can be applied to coordinate agents such as mobile robots, automated guided vehicles (AGVs) and autonomous vehicles that have to move with the same velocity and a common inter-space gap.      

新发展阶段中国水资源安全保障战略对策

进入新发展阶段，中国水资源安全保障需要以“节水优先、空间均衡、系统治理、两手发力”治水思路为指导，厘清问题、研判趋势、优化对策，支撑新阶段水利高质量发展。本文在全面分析我国水资源安全保障存在的突出问题与面临形势基础上，阐述了新发展阶段中国水资源安全保障的基本思路与战略路径，从保证资源安全、构建国家水网、强化供水保障、建设美丽河湖、改善水环境质量等方面提出了战略对策和需要进一步回答的重大问题，以期为完善新发展阶段中国水资源安全保障战略，全面提高国家水资源安全保障能力提供有力支撑。     

煤化工酸水汽提装置运行存在问题及解决方法

本文简述了酸水汽提工艺的发展概况和技术进展,详细介绍了煤化工酸水汽提装置实际运行中存在的几类主要问题,并提出切实可行的解决措施,具有一定的借鉴意义。     

A discontinuous least-squares finite-element method for second-order elliptic equations

In this paper, a discontinuous least-squares (DLS) finite-element method is introduced. The novelty of this work is twofold, to develop a DLS formulation that works for general polytopal meshes and to provide rigorous error analysis for it. This new method provides accurate approximations for both the primal and the flux variables. We obtain optimal-order error estimates for both the primal and the flux variables. Numerical examples are tested for polynomials up to degree 4 on non-triangular meshes, i.e. on rectangular and hexagonal meshes.     

A novel differential evolution mapping technique for generic combinatorial optimization problems

Differential evolution is primarily designed and used to solve continuous optimization problems. Therefore, it has not been widely considered as applicable for real-world problems that are characterized by permutation-based combinatorial domains. Many algorithms for solving discrete problems using differential evolution have been proposed, some of which have achieved promising results. However, to enhance their performance, they require improvements in many aspects, such as their convergence speeds, computational times and capabilities to solve large discrete problems. In this paper, we present a new mapping method that may be used with differential evolution to solve combinatorial optimization problems. This paper focuses specifically on the mapping component and its effect on the performance of differential evolution. Our method maps continuous variables to discrete ones, while at the same time, it directs the discrete solutions produced towards optimality, by using the best solution in each generation as a guide. To judge its performance, its solutions for instances of well-known discrete problems, namely: 0/1 knapsack, traveling salesman and traveling thief problems, are compared with those obtained by 8 other state-of-the-art mapping techniques. To do this, all mapping techniques are used with the same differential evolution settings. The results demonstrated that our technique significantly outperforms the other mapping methods in terms of the average error from the best-known solution for the traveling salesman problems, and achieves promising results for both the 0/1 knapsack and the traveling thief problems.