减水剂类型对赤泥—矿渣基地聚物注浆材料性能的影响及机理研究

针对赤泥等固体废弃物对环境危害性大且利用率低等问题,以碱激发赤泥-矿渣基地聚物注浆材料为 研究对象,研究了不同掺量的聚羧酸(PA)减水剂、醛酮缩合物(AKC)减水剂和萘系(N)减水剂对材料凝结时间、流动 性及强度等的影响,并通过 XRD、傅里叶红外光谱及 SEM 等设备对减水剂的作用机理进行研究。 结果表明:减水剂增 强了材料的流动性但降低了材料的剪切应力;N 和 PA 减水剂能缩短材料的凝结时间,但 AKC 减水剂会延长材料的凝 结时间;N 和 AKC 减水剂能提高材料的强度,但 PA 减水剂会降低材料的强度;N 减水剂对材料的综合性能提升效果 更加明显,其最优掺量为 0. 7%;减水剂对赤泥-矿渣基地聚物性能提升的作用机理主要是促进地聚合物凝胶的形成。 研究成果为拓展赤泥在工程上的使用途径和效率提供了理论指导。     

中国废钢资源发展战略研究

 为提高中国钢铁工业的废钢比,推动钢铁工业的绿色发展,分析了中国废钢资源的概况、废钢行业技术发展现状和钢铁工业废钢利用的现状,并对中国未来废钢资源量进行预测。在此基础上,针对中国废钢资源的发展提出了3条战略判断和6条政策建议。     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

Teaching and Learning Electrochemistry

Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Epos – an instrument for the assessment of the ethical position in software development

Digital technology becomes more powerful, intelligent, pervasive and ubiquitous. Ethical aspects of this development have not yet drawn the appropriate attention of researchers and engineers. This paper presents an instrument that aims at measuring the individual ethical position with regard to the design and development of computer software. The development of the Epos tool was based on two data collections. The data of the first survey (n₁ = 147 participants) were used to select items and to determine the factorial structure of the questionnaire. Results show that the Epos instrument reliably assesses peoples’ ethical opinion with respect to five central components: (1) regulation, (2) data privacy, (3) domain specific knowledge, (4) societal responsibility and (5) company responsibility. In the second survey, we determined the stability of the instruments factor structure by assessing a sample of n₂?=?196 participants. A confirmatory factor analysis (CFA) supported the initial factor structure. Next steps and further implications are discussed regarding the final version of the questionnaire.     

A globally convergent BFGS method for pseudo-monotone variational inequality problems

In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm.