离子色谱法快速检测洗涤日用品中的F-、Cl-、SO42-、P3O105-

介绍用离子色谱法快速同时检测洗涤日用品中的F^-、CI^-、SO4^2-、P3O10^5-。选用DIONEX IONPAC AS11作为了离子分离柱,以电导检测器检测,对离子分离条件进行了研究。F^-、CI^-、SO4^2-和P3O10^5-的检出限分别为0．02、0．01、0．01和0．03mg/L ,加标平均回收率分别为94．5％、96．2％、102．2％和97．4％。     

化学与刑侦

化学原理在侦破工作中应用的重要性日益突出,以化学为基础的侦破技术在近年来得到了迅速发展,成为打击犯罪、维护治安的重要手段。本文介绍了几种重要的分析方法在刑侦工作中的重要应用。     

基于Bayes方法的诊断模型分析

文中证明了在Bayes框架下,当漂移参数7服从有信息先验时,在相当广泛的统计模型中,数据删除模型(CDM)和均值漂移模型(MSOM)的参数估计不相等,几个数值例子验证了相应的结论.     

An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles

The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the workday due to strict time limits on route duration (e.g., when perishable goods are transported). The routes are defined over customers with a revenue, a demand and a time window. Given a fixed-size fleet of vehicles, it might not be possible to serve all customers. Thus, the customers must be chosen based on their associated revenue minus the traveling cost to reach them. We introduce a branch-and-price approach to address this problem where lower bounds are computed by solving the linear programming relaxation of a set packing formulation, using column generation. The pricing subproblems are elementary shortest path problems with resource constraints. Computational results are reported on euclidean problems derived from well-known benchmark instances for the vehicle routing problem with time windows.     

Efficient algorithms for three‐dimensional axial and planar random assignment problems

Beautiful formulas are known for the expected cost of random two‐dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural “Axial” and “Planar” versions, both of which are NP‐hard. For 3‐dimensional Axial random assignment instances of size n, the cost scales as Ω(1/ n), and a main result of the present paper is a linear‐time algorithm that, with high probability, finds a solution of cost O(n^–1+o(1)). For 3‐dimensional Planar assignment, the lower bound is Ω(n), and we give a new efficient matching‐based algorithm that with high probability returns a solution with cost O(n log n). © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 160–196, 2015     

MODELING HARVEST SCHEDULING IN MULTIFUNCTIONAL PLANNING OF FORESTS FOR LONGTERM WATER YIELD OPTIMIZATION

In this study, wood production and hydrologic functions of forests were accommodated within a planning procedure for separate working circles (areas dedicated to certain forest functions) that were delineated according to an Ecosystem‐Based Functional Planning approach. Mixed integer goal programming was used as the optimization technique. The timing and scheduling of a maintenance cutting (partial harvest) was the decision variable in the modeling effort, and an original formulation was developed as a multiobjective planning procedure. Four sample planning strategies were developed and model outputs were evaluated according to these strategies. Spatial characteristics of stands were considered, and used to prohibit the regeneration of adjacent stands during the same time period. Because of the positive relationship between qualified water production and standing timber volume in the forest, the model attempts to maximize qualified water production levels by increasing standing volume stocks in the forest through the delay of regeneration activities.     

Limit circle invariance for two differential systems on time scales

In this paper we consider two linear differential systems on a time scale. Both systems depend linearly on a complex spectral parameter λ. We prove that if all solutions of these two systems are square integrable with respect to a given weight matrix for one value λ₀, then this property is preserved for all complex values λ. This result extends and improves the corresponding continuous time statement, which was derived by Walker (1975) for two non‐hermitian linear Hamiltonian systems, to appropriate differential systems on arbitrary time scales. The result is new even in the purely discrete case, or in the scalar time scale case, as well as when both time scale systems coincide. The latter case also generalizes a limit circle invariance criterion for symplectic systems on time scales, which was recently derived by the authors.     

The double deflating technique for irreducible singular M-matrix algebraic Riccati equations in the critical case

As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective.     

Exploring main obstacles of inflexibility in mathematics teachers’ behaviour in accepting new ideas: the case of equivalence between infinite sets

This article seeks to explore the most important obstacles of inflexibility in mathematics teachers’ behaviour in accepting new ideas, especially, while encountering a new situation. In so doing, the concept of equivalence between infinite sets, which is one of the challenging issues in mathematics teaching and learning, was selected as the subject matter of the study. The participants of the study were 64 high-school mathematics teachers. To collect the data, they were exposed to a challenging new situation involving equivalence between infinite sets. Then they were interviewed regarding the decisions they had made. The analysis of the data revealed that the main obstacles to accepting new ideas by mathematics teachers were preference to well-known procedures and tendency to work with methods with a more general extensive domain of the function. In addition, while the spirit of the article seems to imply that teachers are not flexible, in terms of accepting a new method, the data on teacher choices highlighted the positive results of teacher flexibility.     

基于多种用海功能的海域使用权拍卖机制研究

海域使用权拍卖是对海域资源进行市场化配置的重要方式.基于海域资源的立体性和层次性特征,提出了多种用海功能约束下的海域使用权拍卖机制,设计了综合效用函数,对海域使用权进行经济价值与生态补偿的综合评价,促进海域资源的多层次利用与开发.仿真结果表明:相比较于单一功能的海域使用权拍卖,多属性拍卖能够改善海域使用权拍卖效率,同时拍卖结果也提高了政府对海域使用权拍卖的满意度和最终效用,为我国海域使用权拍卖方式的创新提供了理论基础.