摘要：The design of telecommunication network with capacity constraints of links, routers and ports of routers is considered in this paper. Specially, we limit each demand flow traversed through a pre-specified maximal number of links (called hops) under node failure scenarios in IP layer network. Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when any relay node of the network fails. We propose a reliable mixed-integer programming (MIP) model with multi-scenario constraints to optimally design a minimum-cost survivable IP network that continues to support a good communication under any node failure scenario. Then we transform the MIP model into many single scenario models, that is, simplified MIPs, nonlinear programming (NLP) models and MIP models under Benders decomposition Then we transform the MIP model into many single scenario models, that is, simplified MIPs, nonlinear programming (NLP) models and MIP models under Benders decomposition. Three heuristic methods are proposed to solve these models including branch-and-bound algorithm, global algorithm for NLP, and heuristic algorithm based on benders decomposition. We mainly study the application of Benders decomposition method, where dual model and bounding procedures are given for each MIP model under Benders decomposition at each scenario. The results of our computational experiments validate the effectiveness of the proposed models and algorithms.

摘要：Word embedding, which refers to low-dimensional dense vector representations of natural words, has demon- strated its power in many natural language processing tasks. However, it may suffer from the inaccurate and incomplete information contained in the free text corpus as training data. To tackle this challenge, there have been quite a few studies that leverage knowledge graphs as an additional information source to improve the quality of word embedding. Although these studies have achieved certain success, they have neglected some important facts about knowledge graphs： 1） many relationships in knowledge graphs are many-to-one, one-to-many or even many-to-many, rather than simply one-to-one; 2） most head entities and tail entities in knowledge graphs come from very different semantic spaces. To address these issues, in this paper, we propose a new algorithm named ProjectNet. ProjectNet models the relationships between head and tail entities after transforming them with different low-rank projection matrices. The low-rank projection can allow non one- to-one relationships between entities, while different projection matrices for head and tail entities allow them to originate in different semantic spaces. The experimental results demonstrate that ProjectNet yields more accurate word embedding than previous studies, and thus leads to clear improvements in various natural language processing tasks.

摘要：Advertisement （ad） selection plays an important role in sponsored search, since it is an upstream component and will heavily influence the effectiveness of the subsequent auction mechanism. However, most existing ad selection methods regard ad selection as a relatively independent module, and only consider the literal or semantic matching between queries and keywords during the ad selection process. In this paper, we argue that this approach is not globally optimal. Our proposal is to formulate ad selection as such an optimization problem that the selected ads can work together with downstream components （e.g., the auction mechanism） to achieve the maximization of user clicks, advertiser social welfare, and search engine revenue （we call the combination of these objective functions as the marketplace objective for ease of reference）. To this end, we 1） extract a bunch of features to represent each pair of query and keyword, and 2） train a machine learning model that maps the features to a binary variable indicating whether the keyword is selected or not, by maximizing the aforementioned marketplace objective. This formalization seems quite natural; however, it is technically difficult because the marketplace objective is non-convex, discontinuous, and indifferentiable regarding the model parameter due to the ranking and second-price rules in the auction mechanism. To tackle the challenge, we propose a probabilistic approximation of the marketplace objective, which is smooth and can be effectively optimized by conventional optimization techniques. We test the ad selection model learned with our proposed method using the sponsored search log from a commercial search engine. The experimental results show that our method can significantly outperform several ad selection algorithms on all the metrics under investigation.

摘要：The collected spectrum of the fiber Bragg grating(FBG) and the loss of the detected optical power are discussed with respect to the 3-dB bandwidth of a Fabry-Perot(F-P) type tunable optical filter(TOF),*** the optimized parameters of the TOF are obtained *** is demonstrated that the relationship between the transmission wave-length of the TOF and its drive voltage is nonlinear.A new method to compensate the nonlinearity of the TOF is *** linear sweeping of the transmission wavelength of the TOF is achieved through modifying the drive voltage using interpolation *** is observed that the average error and the maximum error of the transmission wavelength are reduced sharply under linear *** dynamic strain sensing is realized by use of a reference FBG and moving averaging algorithm in this system.

摘要：Antibody-directed enzyme prodrug therapy（ADEPT） is a new strategy for the treatment of cancer that has arisen in recent twenty years, the main merits of which are that it can improve the selectivity of anticancer drugs and reduce the side effects in remote tissue. In the present study, two prodrugs-glycosylated aromatic nitrogen mustard derivatives were synthesized. Glucose and lactose were converted into glycosyl donors-trichloroacetimidate; the obtained glycosyl donors were glycosylated with p-nitrophenol （ glycosyl donors） to form β-glucosyl p-nitrobenzene and β-lactosyl p-nitrobenzene that were protected by acetyl in a stereoselective manner; the two products were reduced by zinc dust and then treated with ethylene oxide, afforded two glycosylated nitrogen mustard derivatives that were protected by acetyl; the last step was to deacetylate and then afforded the two target compounds that could be used as prodrugs of ADEPT for further Anti-tumor research.

摘要：随着地震勘探要求和技术的不断提高,散射波地震勘探方法逐渐引起人们的重视,尤其在构造复杂地区的高精度勘探中,散射波理论具有广泛的应用前景.本文在讨论了现阶段几种散射波数值模拟方法的利弊后,设计了一种基于微扰论的FK域积分法,在散射场的二次震源和空间能量衰减处理两方面做了改进,其计算精度和效率均得到了提高.此外,采用该算法针对散射波动力学进行了正演模拟试算,从扰动介质空间分布和扰动量两个角度定量地分析了散射波振幅动力学方面的特征.在此基础上得到了五个经验常数,并给出了对应的计算公式和物理意义,通过这五个常数可以划分散射波不同形态的动力学特征.

摘要：分析非常规突发事件影响下的交通组织特性,基于元胞传输模型(CTM)设计了疏散目标函数和疏散特性约束,构造了非常规突发事件影响下限定时间的区域路网疏散能力评估与交通组织设计模型.针对不同层次的需求.模型可以整理为完整模型和简化模型两种形式.在求解计算方面具有不同的特征.设计了算例(其中包含路网结构和非常规突发事件场景),应用完整模型和简化模型分别对算例进行了路网疏散能力评估和交通组织方案设计,评估结论一致,获取的交通组织方案可行且各具特征.模型将为疏散预案的设计提供理论支持.

摘要：扼要介绍了哈尔滨制药六厂变电所扩建改造工程的概况,阐述了本工程上部结构体系选择与设计、基础型式选择与设计、施工方案与施工验算等方面的内容.可供建造同类工程时参考.

摘要：结合动漫桥吊杆横梁设计的特点及安装施工中遇到的技术难题,介绍在吊杆横梁吊装过程中、空中姿态调整及预应力张拉、安装π板等关键工序所采取的技术措施及解决技术难题的相应对策,对类似结构的安全施工提供参考及借鉴。

摘要：为提高防空有控炮弹的弹道性能,以一对鸭舵控制的防空弹道修正弹为对象,阐述了系统工作原理与鸭舵控制方式,在全指令控制信号及弹体稳态飞行条件下,研究了由鸭舵偏转产生的弹道法向修正速度,给出了精度较好的估算公式。由此提出一个以鸭舵气动外形参数为设计变量的弹道修正能力综合优化设计模型,并进行了数值仿真。仿真结果表明,采用该模型对鸭舵气动外形参数进行综合优化设计,能够有效提高鸭式布局防空炮弹的弹道控制能力,为该类有控炮弹的鸭舵气动外形参数设计提供了参考。