三类构型激光脉冲压缩器光栅拼接误差容限比较

建立了包含拼接光栅的三类典型构型(双程Z型、X型及菱型)激光脉冲压缩器的理论模型. 利用光线追迹法计算压缩器引入的相位变化,结合傅里叶变换的方法仿真分析并比较了各压缩器相应的光栅拼接误差容限. 以远场焦斑峰值能量下降到理想值的0.9倍为限确定了三类压缩器光栅拼接误差容限,明确了不同构型激光脉冲压缩器对拼接误差的敏感程度. 这对脉冲压缩器的选型和设计具有指导意义. 关键词： 光栅拼接 脉冲压缩 误差容限 光线追迹     

只需一个解调器的偏分复用差分相移键控系统实验实现

偏分复用技术是提高系统传输速率的有效方法之一.搭建了被称为双偏振态差分相移键控(Dual-Pol.DPSK)码的新型偏分复用实验系统,它与具有相同的比特波特比的差分正交相移键控(DQPSK)调制方式相比,接收机要简单很多.与传统的偏振分解复用(POLMUX)技术相比,它无需偏振控制或偏振跟踪,只需一个解调器和一个平衡探...     

酸性红黄壤土上大麦遗传改良研究

本文报道了酸性红黄壤土上大麦遗传改良研究结果:(1)采用酸铝营养液培养幼苗的方法鉴定了我国3871份大麦品种的耐酸铝性，得到一级耐性材料315份，占鉴定总数的8.13劣，(2)相关通径分析表明，酸性红黄壤土上大麦单株籽粒产量损失起主要作用的是有效分菜数下降(P = 0. 7324 )、每穗实粒数减少(P = 0 . 5923 )和千粒重降低(P = 0.5877),由此可见，这是在红黄壤土田间条件下选择耐酸铝性大麦的三个主要选择指标;(3)发现大麦耐酸铝性基因遗传方式除单基因遗传方式外，尚有多基因控制的表现数量性状遗传方式;'(4)从对酸铝性表现敏感的大麦品种“早熟3一号”的花药、幼胚等外植体诱导出的愈伤组织，通过离体细胞突变体筛选，得到了“耐性细胞系”.以上结果表明，通过耐酸铝性遗传改良培育出适应酸性红黄壤土种植的大麦新品种是可行的，亦为开发利用红黄壤土地资源补充了另一条有效途径.     

On time versus size for monotone dynamic monopolies in regular topologies

We consider a well-known distributed colouring game played on a simple connected graph: initially, each vertex is coloured black or white; at each round, each vertex simultaneously recolours itself by the colour of the simple (strong) majority of its neighbours. A set of vertices M is said to be a dynamo, if starting the game with only the vertices of M coloured black, the computation eventually reaches an all-black configuration.The importance of this game follows from the fact that it models the spread of faults in point-to-point systems with majority-based voting; in particular, dynamos correspond to those sets of initial failures which will lead the entire system to fail. Investigations on dynamos have been extensive but restricted to establishing tight bounds on the size (i.e., how small a dynamic monopoly might be).In this paper we start to study dynamos systematically with respect to both the size and the time (i.e., how many rounds are needed to reach all-black configuration) in various models and topologies.We derive tight tradeoffs between the size and the time for a number of regular graphs, including rings, complete d-ary trees, tori, wrapped butterflies, cube connected cycles and hypercubes. In addition, we determine optimal size bounds of irreversible dynamos for butterflies and shuffle-exchange using simple majority and for DeBruijn using strong majority rules. Finally, we make some observations concerning irreversible versus reversible monotone models and slow complete computations from minimal dynamos.     

分层立方体网络的容错性分析

通过分层立方网络HCNn (n≥3)的容错性分析,从理论上探讨了分层立方网络基于比较模型的条件诊断度,并证明其条件诊断度为tc(HCNn)=3n?2,大约是传统诊断度(t(HCNn)=n+1)的3倍.     

恒定pH系统中不同大麦品种的耐铝性

本文提出以相对生长率衡量耐铝性，基本上排除了系统所造成的误差.以相对生长率P衡量根的耐铝性，在恒定的pH系统(pH4. 75士0. 1)中3ppm铝胁迫下，经大田鉴定的一级耐性品种B和H表现了不同的相对生长率，品种B的相对生长率达28%，而品种H只有1400,中等敏感品种Z为15%，而敏感品种S可达17%.结果说明:品种H的耐铝性可能是通过升高根际pH，降低铝的解离程度而实现的.而品种B的耐铝性机制与品种H不同，其耐铝性与根际pH值调节基本无关.     

A fuzzy voting scheme for hardware and software fault tolerant systems

Voting algorithms are used to arbitrate between the results of redundant modules in fault-tolerant systems. Inexact majority and weighted average voters have been used in many applications, although both have problems associated with them. Inexact majority voters require an application-specific 'voter threshold’ value to be specified, whereas weighted average voters are unable to produce a benign output when no agreement exists between the voter inputs. Neither voter type is able to cope with uncertainties associated with the voter inputs. This paper introduces a novel voting scheme based on fuzzy set theory. It softens the harsh behaviour of the inexact majority voter in the neighbourhood of the ‘voter threshold’, and handles uncertainty and some multiple error cases in the region defined by the fuzzy input variables. The voter assigns a fuzzy difference value to each pair of voter inputs based on their numerical distance. A set of fuzzy rules then determines a single fuzzy agreeability value for each individual input which describes how well it matches the other inputs. The agreeability of each voter input is then defuzzified to give a weighting value for that input which determines its contribution to the voter output. The weight values are then used in the weighted average algorithm for calculating the voter final output. The voter is experimentally evaluated from the point of view safety and availability, and compared with the inexact majority voter in a Triple Modular Redundant structured framework. The impact of changing some fuzzy variables on the performance of the voter is also investigated. We show that the fuzzy voter gives more correct outputs (higher availability) than the inexact majority voter with small and large errors, less incorrect outputs (higher safety) than the inexact majority voter in the presence of small errors, and less benign outputs than the inexact majority voter. The percentage of the benign outputs of the majority voter that are successfully handled by the fuzzy voter (resulting in correct outputs) is more than the percentage of those that are unsuccessfully resolved by the fuzzy voter (resulting in incorrect outputs). Our results suggest that the fuzzy voter is a viable alternative to a traditional inexact voter in cases where the benefits of a large increase in availability, and a considerable decrease in the number of benign outputs outweighs the cost of a small degradation in the safety performance of the system. The fuzzy voter is also a useful voting algorithm when arbitrating between the responses of dynamic channels of control systems incorporating uncertainties. This is the first reported use of a complete fuzzy voter in the context of fault tolerance.     

用于质子交换膜燃料电池抗CO的Pt-CeO2/C催化剂的制备和表征

采用一步沉淀法,制备了纳米级Pt-CeO2/C电催化剂.透射电镜和X射线衍射表征结果表明,制备的催化剂Pt颗粒均匀分散于碳载体表面,其粒径主要分布于1.5～2.5 nm.将Pt-CeO2/C催化剂制备成质子交换膜燃料电池膜电极,经循环伏安和单电池极化曲线测试发现,Pt-CeO2/C催化剂性能与Pt/C催化剂的相当.一氧...     

A sufficient condition for boundedness of tolerance graphs

Golumbic, Monma, and Trotter showed that every tolerance graph for which no vertex neighborhood is contained in another vertex neighborhood is a bounded tolerance graph. We strengthen this result by weakening the neighborhood condition. In this way, more tolerance graphs can be recognized as bounded. Our argument relies on a variation of the concept of “assertive vertices”.