基于MOF (Cu)@biochar气凝胶的制备及其在缓释氮肥上的应用

以羧甲基纤维素(CMC)、明胶和MOF(Cu)@biochar为原料,采用简单有效的冷冻干燥方法制备了(CMC/Gelatin/MOF(Cu)@biochar)杂化气凝胶,并用傅里叶变换红外光谱(FT-IR)、热重分析(TG)、X射线粉末衍射(XRD)、扫描电镜(SEM)和X射线光电子能谱(XPS)技术对其进行了表征;研究了MOF(Cu)@biochar含量、pH和不同的盐水溶液对杂化气凝胶溶胀行为的影响;以该气凝胶负载氯化铵,制备了一种新型缓释肥料(SRF),并研究了含2%(wt)SRF的沙性土壤的保水能力;SRF在土壤中第30天的累积释放率为79.4%;肥料在土壤中释放符合非Fickian扩散和阳离子交换的协同作用机理。     

超尺寸物品装箱问题及其算法

本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法，我们提出了一个评价效率更高的目标函数，证明了在此目标函数下两步法的渐近最坏比不小于2，并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA，证明了在新目标函数下其渐近最坏比不超过7/4。     

Hybrid abstractions of affine systems

This paper considers the problem of building a set of hybrid abstractions for affine systems in order to compute over approximations of the reachable space. Each abstraction is based on a decomposition of the continuous state space that is defined by hyperplanes generated by linear combinations of two vectors. The choice of these vectors is based on consideration of the dynamics of the system and uses, for example, the left eigenvectors of the matrix that defines these dynamics. We show that the reachability calculus can then be performed on a combination of such abstractions and how its accuracy depends on the choice of hyperplanes that define the decomposition.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

Tomographic reconstruction using heuristic Monte Carlo methods

A tomographic reconstruction method based on Monte Carlo random searching guided by the information contained in the projections of radiographed objects is presented. In order to solve the optimization problem, a multiscale algorithm is proposed to reduce computation. The reconstruction is performed in a coarse-to-fine multigrid scale that initializes each resolution level with the reconstruction of the previous coarser level, which substantially improves the performance. The method was applied to a real case reconstructing the internal structure of a small metallic object with internal components, showing excellent results.     

Hybrid Electrodes Used in Polymer Electro-Optic Modulator with Ultra-Broadband

Hybrid electrode combined coplanar waveguide (CPW) and microstrip lines in ultra-broadband electro-optic modulators. The characteristics of the modulators with hybrid electrode is like that of the modulator with the microstrip lines, in which the microstrip electrode is loaded above only one arm of Mach-Zehnder (M-Z) optical waveguide, besides the problem of microstrip line to coaxial transition and corona polarization in polymer modulators have been best solved at the same time. By using finite element method (FEM), the characteristic parameters such as half-wave voltage, modulation bandwidth characteristic impedance, effective microwave refractive index of polymer modulators with microstrip line and hybrid electrode are analysed and compared in this paper. The results present that velocity match, impendence match and lower microwave propagating loss is easily realized in modulators with hybrid electrode.     

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.     

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms.     

微模塑法制备PMMA/SiO2二氧化硅杂化材料微结构

以摩尔比为 1∶1的甲基丙烯酸甲酯 (MMA)、甲基丙烯酸 (3 三乙氧基硅烷基 )丙酯 (ESMA)单体、0 .2 %(单体总量的质量分数 )的偶氮二异丁腈AIBN引发剂和四氢呋喃 (THF)溶剂 ,及 2 0 % (总质量分数 )的正硅酸乙酯TEOS合成出PMMA/SiO2 有机 无机杂化的杂化溶胶 .将溶胶在洗净的普通光学玻璃基片表面甩膜 .利用软刻蚀中的微模塑法 ,把有机硅弹性印章复制有精细图纹一面轻放在杂化溶胶膜上进行微模塑 ,外加 1N压力于12 0℃下处理 2h使溶胶凝胶化 .印章剥离后在基片表面就形成了PMMA/SiO2 有机 无机杂化材料的微图纹结构 .从微图纹的光学显微镜照片可以看出微模塑方法制备杂化材料复制的图纹精细度高 ,操作简单易行 ,是一类比较理想的微细图纹结构加工的方法 .     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.