An investigation into the self-propagating high temperature synthesis (SHS) of superconducting ceramics by thermal methods

The SHS route is based on the well-known thermite reaction, in which a strongly exothermic reaction can sustain itself and propagate in the form of a combustion wave until the reactants have been completely consumed. The successful application of the method to the synthesis of superconducting ceramics of stoichiometry RBa₂Cu₃O_y (R=Y, Er, Yb) is reported. The 123 phase was obtained when pellets of R₂O₃, BaO₂ and Cu metal in the correct proportions were dropped into a heater held at 800°C in an oxygen atmosphere and left there for only 10 minutes. Thermal methods (DSC and DTA) are excellent techniques with which to investigate the dependence of the reaction on heating rate, atmosphere and starting composition.     

铝粉度对自蔓延高温合成AlB2-Al2O3复合粉体的影响

以金属Al粉和B2O3粉为原料,采用自蔓延高温合成法(SHS)制备AlB2-Al2O3复合粉体.采用X射线衍射仪、扫描电镜和能谱仪分析手段,对所制得的复合粉体进行了表征.研究了Al粉粒度(100目、300目和600目)对自蔓延高温合成方法制备AlB2-Al2O3复合粉体的燃烧学、相组成及微观结构的影响.结果表明:铝粉粒度越小,燃烧温度越高、燃烧波速度越快,复合粉体中AlB2相含量增加,实验测得600目铝粉反应的燃烧温度为2060K,燃烧波速度为2.08 mm/s.复合粉体以AlB2和Al2O3为主晶相,显微结构为数量较少、粒径约5μm的AlB2粉弥散分布于粒径约2 μm的Al2O3和Al的混合粉中.     

基于NOLF双稳效应对经DSF压缩后的超短光脉冲进行消基座

基于非线性FP腔（NOLF）双稳效应，提出一种利用掺铒光纤放大器（EDFA）及NOLF对经DSF压缩后的超短光脉冲进行消基座的方案.利用耦合模方程，分析了NOLF的消基座特性.结果表明，通过合理选择NOLF的反射率、入射脉冲的中心频率与NOLF的共振频率的失谐量及EDFA的增益，可使脉冲的基座能量比减小一半. 关键词： 超短光脉冲 消基座 非线性FP腔 光学双稳 掺铒光纤放大器     

Optimal media planning for multi-products in segmented market

Promotion is an essential stage of any product life cycle. All firms either concerned with single or multiple products promote their products. Advertising is the most dominated form of promotion for most of the products. Our research focuses on firms which produces a multiple range of products and advertise them using available media options. The budget constraint forms the major restriction. The existing research in media allocation of multiple products ignores the market segmentation and formulates the media plan assuming all segments alike. In this paper we formulate a media planning problem for allocating the available budget in multiple media that are found suitable for the advertising of multiple products considering marketing segmentation aspect of advertising. The objective is to maximize the total reach in all the segments. Goal programming technique is used to solve the problem. A case study is presented to show the real life application of the model.     

Explicit constructions of separating hash families from algebraic curves over finite fields

Let X be a set of order n and Y be a set of order m. An (n,m,{w ₁, w ₂})-separating hash family is a set of N functions from X to Y such that for any with , |X ₁| = w ₁ and |X ₂| = w ₂, there exists an element such that . In this paper, we provide explicit constructions of separating hash families using algebraic curves over finite fields. In particular, applying the Garcia–Stichtenoth curves, we obtain an infinite class of explicitly constructed (n,m,{w ₁,w ₂})–separating hash families with for fixed m, w ₁, and w ₂. Similar results for strong separating hash families are also obtained. As consequences of our main results, we present explicit constructions of infinite classes of frameproof codes, secure frameproof codes and identifiable parent property codes with length where n is the size of the codes. In fact, all the above explicit constructions of hash families and codes provide the best asymptotic behavior achieving the bound , which substantially improve the results in [ 8, 15, 17] give an answer to the fifth open problem presented in [11].     

小型轻便式流速仪检定系统设计

为满足FP系列流速仪的计量检定需求,提出了一种小型便携式流速仪检定系统的设计方案。根据匀速运动时间等约束条件确定了环形水槽的几何参数。采用FPGA和上位机作为数据处理和控制核心,实现了对伺服电机转速的精确控制。设计了光电编码器和无线摄像机与上位机之间的通信方式,实现了检定装置标准流速值和被检仪器示值的数据读取。对测试数据的处理方法和测控软件的结构框架进行了分析。同时,对实验装置的测量误差进行了分析。结果表明,标准流速值的扩展不确定度为1.28×10-3m/s,检定装置符合量值传递要求,可作为FP系列流速仪计量检定的标准装置。     

A Variant of Multi-task n-vehicle Exploration Problem: Maximizing Every Processor’s Average Profit

We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor’s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.     

Some Groups of Finite Homological Type

For each n≥ 0 we construct a torsion-free group that satisfies K.S. Brown’s FHT condition and is F _n (and hence FP _n ), but is not FP _n+1.I. J. Leary was partially supported by NSF grant DMS-0505471.M. Saadetoğlu was supported by the British Council and by the Ohio State Mathematical Research Institute