L~∞（0，1）上一个WeakL~P（0，1）有关的格半范数

本文引进一个定义在Ｌ~∞（０，１）上格半范数ρｐ与一个熟知的格半范数ρ０关系，证明了在Ｌ~∞（０，１）中的序区间上，ρ０－拓扑与ρｐ－拓扑等价，从而证明了（Ｌ~∞（０，１），ρｐ）′的闭单位球是（Ｌ~∞（０，１），ρｐ）′的某个子集的弱－闭包，本文还证明了（Ｌ~∞（０，１），ρｐ）′可看作ＷｅａｋＬｐ（０，１）对偶空间的奇异部一个理想，而且这奇异部可由（Ｌ~∞（０，１），ρｐ）′与一算子族生成．（ｆ）ａｌｌ（ｌ．＼ｎ，ｏｏ（ｊ．）＝ｈｉｌｌｓｉｌｌ）ｔ￣．，ｉｆｆ￣＊（ｔ）ｒｅｓｐｅｃｔｉｖｅｌｙａｌｌ＇ｌ，Ｌ（ｑ，１）ｉｓｔｈｅｐｒｅｄｌｓｌａｌｏｆｔｙｒｅａｋＬＩ＇，ａｌｌｌｌｈ，ｒｌｌｏｌｌ－－ａｔ（，ｌｌｌｉ（＇ｌｌｌｅａｓｌｌｒｅａｌｇａ（ｌ￣ｓ，ａｒｅｐｒｅｓｅｌｌｔａ＇ｔｉｏｌｌｔｌｌｅｏｒｅｎｌｆｆ，ｒｅｌｅｌｌｌｅｌｌｔｓｉｌｌＳａｃ，ａｌｌ（ｌＳ，，．ｉｓｏｆ）ｔａｉｌｌｅ（ｌ．Ｈｏｗｅｖｅｒ，ｉｌｌ［２］，ｉｔｉｓｓｌｌｄｗｎｔｈａｔｔｉｌｅｒｅｐｒｅｓｅｌｌｔａｔｉｏｌｌｔｉｌｅｓｆ）ｒｅｌｌｌｏｆ）ｔａｉｌｌｅ（ｌｉｌｌ［．５］ｉｓｉｌｌ（ｔｏｒｒｅ（？ｔ．Ｉｎｔｈｉｓｎｏｔｅ，ｗｅｄｅ     

Event-driven,pattern-based methodology for cost-effective development of standardized personal health devices

Experiences applying standards in personal health devices (PHDs) show an inherent trade-off between interoperability and costs (in terms of processing load and development time). Therefore, reducing hardware and software costs as well as time-to-market is crucial for standards adoption. The ISO/IEEE11073 PHD family of standards (also referred to as X73PHD) provides interoperable communication between PHDs and aggregators. Nevertheless, the responsibility of achieving inexpensive implementations of X73PHD in limited resource microcontrollers falls directly on the developer. Hence, the authors previously presented a methodology based on patterns to implement X73-compliant PHDs into devices with low-voltage low-power constraints. That version was based on multitasking, which required additional features and resources. This paper therefore presents an event-driven evolution of the patterns-based methodology for cost-effective development of standardized PHDs. The results of comparing between the two versions showed that the mean values of decrease in memory consumption and cycles of latency are 11.59% and 45.95%, respectively. In addition, several enhancements in terms of cost-effectiveness and development time can be derived from the new version of the methodology. Therefore, the new approach could help in producing cost-effective X73-compliant PHDs, which in turn could foster the adoption of standards.     

天然气年产4万吨甲醇联产年产2.5万吨合成氨代替重油设计

利用现生产重油制氨的1000m~3(V_n)(O_2)/h空分,建设天然气并联换热蒸汽转化串纯氧部分氧化制甲醇和氨两用合成气,成为4万吨/年甲醇联产2.5万吨/年氨的生产单元组合,既节能节气、降低投资和生产消耗及成本,又充分利用现有设备发挥生产能力,同时还可增加产品和产量。     

WSN中基于线性规划的多类别目标覆盖算法

多类别目标覆盖问题是目前无线传感器网络中的研究热点。针对现有目标覆盖算法在时间效率、网络生命周期等方面的不足,将多类别目标覆盖问题建模为基于线性规划的网络生命周期最大化问题,提出一种基于分簇的目标覆盖算法。该算法依据节点的剩余能量和感应能力,在每个簇结构内求解最优覆盖集的基础上得到接近于最优解的全局覆盖集,进而调度节点相应的感应模块去覆盖其感知范围内同属性的目标。实验结果表明,该算法是有效的,在网络生命周期和时间效率等方面均优于CWGC方案,接近于线性规划最优值。     

325MW空冷汽轮机低压缸末级动叶片Z型拉筋凸台及拉筋孔的加工

论述了 3 2 5MW空冷汽轮机低压缸第 6级 (末级 )动叶片上结构新颖、型面构成复杂的Z型拉筋凸台及凸台拉筋孔的加工工艺 ,并结合工厂的实际情况 ,分别对叶片内、背弧拉筋凸台的型线、凸台端面以及拉筋孔的加工进行了详细的分析研究 ,提出了切实可行的加工工艺方案。     

Design of compact two-port dual-band dual-polarized MIMO antenna for CBRS and WLAN sub-6-GHz applications

This communication presents a compact field de-correlation lines integrated dual band with dual-polarized (LP & CP) multiple-input multiple-output (MIMO) antenna for the fifth generation (5G) sub-6-GHz wireless communication systems. Dual working bandwidths, smaller interelement gaps, and superior isolation within the MIMO components are the distinguishing characteristics that give the proposed MIMO system an aspect of novelty. The modeled MIMO antenna has compact configurations of 20 × 21 × 0.8 mm³. The unit cell consists of a microstrip feed line with optimized rectangular slots branches etched from the radiated patch. The MIMO module is generated by the antiparallel replication of a single unit cell. To enhance the isolation, two rectangular slots are incorporated on the patch between the unit elements, which act as field de-correlation lines. The MIMO identity is supported by diversity performance calculations in terms of ECC, DG, and TARC. Simulated and measured counterparts are found in the agreement.     

基于线性规划和遗传–粒子群算法的烧结配料多目标综合优化方法

针对钢铁企业二次配料工艺,本文采用将硫含量折算为可比成本,兼顾节能减排目标和配料成本,建立了二次配料多目标优化模型;提出了一种基于线性规划和遗传–粒子群算法（GA–PSO）的钢铁烧结配料优化方法.首先采用线性规划算法进行求解,若线性规划方法无法求得最优解,则采用GA–PSO算法进行搜索.该方法应用于某钢铁企业360m2生产线的＂配料优化与决策支持系统＂中,实际运行结果表明,该算法在保证烧结矿质量的前提下,能够有效地减少二氧化硫排放,降低配料成本.     

Fast,effective heuristics for the 0–1 multi-dimensional knapsack problem

The objective of the multi-dimensional knapsack problem (MKP) is to find a subset of items with maximum value that satisfies a number of knapsack constraints. Solution methods for MKP, both heuristic and exact, have been researched for several decades. This paper introduces several fast and effective heuristics for MKP that are based on solving the LP relaxation of the problem. Improving procedures are proposed to strengthen the results of these heuristics. Additionally, the heuristics are run with appropriate deterministic or randomly generated constraints imposed on the linear relaxation that allow generating a number of good solutions. All algorithms are tested experimentally on a widely used set of benchmark problem instances to show that they compare favourably with the best-performing heuristics available in the literature.     

线性规划ν-支持向量机的牛顿法

基于线性规划的ν-支持向量机(ν-LPSVM)是在基于二次规划的ν-支持向量机(ν-QPSVM)的基础上提出的。ν-LPSVM和ν-QPSVM模型中的参数ν都可以控制支持向量的数目和误差,但ν-LPSVM的模型更为简单,应用前景更广。讨论了这种新型支持向量机的线性规划问题的最小2-范数解,在此基础上给出了一个快速、有限步终止的牛顿算法。数值实验表明,ν-LPSVM的牛顿算法快速而且有效。