Optimality of partial adiabatic search and its circuit model

In this paper, we first uncover a fact that a partial adiabatic quantum search with \(O(\sqrt{N/M})\) time complexity is in fact optimal, in which \(N\) is the total number of elements in an unstructured database, and \(M\) ( \(M\ge 1\) ) of them are the marked ones(one) \((N\gg M)\) . We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm.     

导热油循环加热冷却工艺

介绍了一套投资少、传热效果好，控温准确的双闭路循环供热、供冷装置。该装置通过实施，运行平稳、安全可靠。     

Flexible protocol for quantum private query based on B92 protocol

Jakobi et al. for the first time proposed a novel and practical quantum private query (QPQ) protocol based on SARG04 (Scarani et al. in Phys Rev Lett 92:057901, 2004) quantum key distribution protocol (Jakobi et al. in Phys Rev A 83:022301, 2011). Gao et al. generalized Jakobi et al’s protocol and proposed a flexible QPQ protocol (Gao et al. in Opt Exp 20(16):17411–17420, 2012). When $\theta <\pi /4$ , Gao et al’s protocol exhibits better database security than Jakobi et al’s protocol, but has a higher probability with which Bob can correctly guess the address of Alice’s query. In this paper, we propose a flexible B92-based QPQ protocol. Although SARG04 protocol is a modification of B92 protocol and can be seen as a generalization of B92 protocol, our protocol shows different advantages from Gao et al’s protocol. It can simultaneously obtain better database security and a lower probability with which Bob can correctly guess the address of Alice’s query when $\theta <\pi /4$ . By introducing entanglement, the proposed QPQ protocol is robust against channel-loss attack, which also implies lower classical communication complexity. Similar to Gao et al’s protocol, it is flexible, practical, and robust against quantum memory attack.     

Robust optimization of foam-filled thin-walled structure based on sequential Kriging metamodel

Deterministic optimization has been successfully applied to a range of design problems involving foam-filled thin-walled structures, and to some extent gained significant confidence for the applications of such structures in automotive, aerospace, transportation and defense industries. However, the conventional deterministic design could become less meaningful or even unacceptable when considering the perturbations of design variables and noises of system parameters. To overcome this drawback, a robust design methodology is presented in this paper to address the effects of parametric uncertainties of foam-filled thin-walled structure on design optimization, in which different sigma criteria are adopted to measure the variations. The Kriging modeling technique is used to construct the corresponding surrogate models of mean and standard deviation for different crashworthiness criteria. A sequential sampling approach is introduced to improve the fitness accuracy of these surrogate models. Finally, a gradient-based sequential quadratic program (SQP) method is employed from 20 different initial points to obtain a quasi-global robust optimum solution. The optimal solutions were verified by using the Monte Carlo simulation. The results show that the presented robust optimization method is fairly effective and efficient, the crashworthiness and robustness of the foam-filled thin-walled structure can be improved significantly.     

Toward inference attacks for k-anonymity

Current research still cannot effectively prevent an inference attacker from inferring privacy information for k-anonymous data sets. To solve the issue, we must first study all kinds of aggressive reasoning behaviors and process for the attacker thoroughly. Our work focuses on describing comprehensively the inference attack and analyzing their privacy disclosures for k-anonymous data sets. In this paper, we build up a privacy inference graph based on attack graph theory, which is an extension of attack graph. The privacy inference graph describes comprehensively the inference attack in k-anonymous databases by considering attacker background knowledge and external factors. In the privacy inference graph, we introduce a concept of valid inference path to analyze the privacy disclosures in face of inference attack. According to both above, we design an algorithm to compute the n-valid inference paths. These paths can deduce some privacy information resulting in privacy disclosure. Moreover, we study the optimal privacy strategies to resist inference attack by key attribute sets and valid inference paths in the attack graph. An approximate algorithm is designed to obtain the approximate optimal privacy strategy set. At last, we prove the correctness in theory and analyze the performance of the approximate algorithm and their time complexity.     

回归正交设计在PEK-C增韧酚醛树脂研究中的应用

采用计算机辅助回归正交设计的方法对酚酞型聚醚酮(PEK-C)增韧酚醛树脂进行研究，通过回归正交设计，对共混体系的组分配比和成型工艺参数进行优化，预测出最佳配比和工艺参数，并通过试验得到验证。     

超临界烯烃聚合

论述了超临界流体对烯烃聚合的影响，总结了超临界聚合技术的研究与应用。认为：在单体临界点以上进行的超临界聚合技术的研究开发已比较成熟；而新近开发的超临界流体介质中的烯烃取合技术更为重要，可以充分发挥超临界技术的优点，提高聚合产率，并能制备性能特殊的取合物。特别是采用超临界CO2为介质的聚合过程，为实现烯烃聚合的绿色生产奠定了基础。     

氨氮废水降解技术进展

介绍了氨氮废水的主要来源，论述了氨氮废水降解的各种技术及其工艺过程，重点论述了生物处理技术及工艺、物理化学处理技术及工艺以及它们在工业中的应用和特点，并探讨了氨氮废水降解机制，综述了目前国内外研究进展状况。     

耐候性PP的研制

以聚烯烃弹性体（POE）为增韧材料、DICPK为结晶成核剂、BsSO4为无机填充剂，研制了耐候改性PP专用料。结果表明，当POE用量为5份、DICPK用量为0．3份、BaSO4用量为30份时，所得专用料能够满足耐候改性PP专用料的性能要求。     

聚乳酸-聚氨酯微球的合成及其形态的研究

以低相对分子质量生物可降解D，L-聚乳酸(D，L-PLA)二醇和六亚甲基二异氰酸酯(HDI)为原料、1，4-丁二醇(BD)为扩链剂及聚乙烯基吡咯烷酮(PVP)为悬浮剂，通过悬浮聚合法初步合成了一种新型聚氨酯微球(PUMS)。用扫描电子显微镜(SEM)考察了BD的含量对微球表面形态的影响，通过激光粒度分析仪讨论了搅拌速率和PVP浓度对微球粒径及其分布的影响，用傅立叶变换红外光谱(FTIR)粒度分析仪对微球的化学结构进行了表征。结果表明，合成的微球的平均粒径随搅拌速率和PVP浓度的增加而减少，粒径分布变宽；当搅拌速率为400r／min，PVP质量分数为1．5％时。微球的平均粒径约47μm，粒径分布最窄。约在10～90μm；微球表面有孔，但随着BD含量的增加，微球表面变得相对粗糙，孔数减少，孔径减小，直至孔消失。