红外耦合光学系统设计

红外目标模拟器由红外目标图像发生器和投影光学系统组成。该红外光学系统是一个要求与2个导引光学系统的光学技术参数相匹配的长焦距、大视场和具有像方远心光路的中红外光学系统。叙述用于红外目标模拟器的红外耦合光学系统的设计原理，提出它与导引光学系统一起可组成放大倍率M=4.5×的红外投影光学系统，并指出IR CRT产生的图像通过红外投影光学系统可成像在导引接收器上。针对给出的红外耦合光学系统的设计特点和技术要求，光学材料选取硅（Si） 锗（Ge） 硅（Si），采用简单的柯克三片式结构完成光学系统设计。设计评价结果表明，该系统的光学性能和成像质量均满足设计指标要求。     

磁性纳米颗粒膜的微磁学模拟

用微磁学方法对磁性纳米颗粒膜的磁特性进行了模拟，采用的模型是由122个磁性纳米颗粒组成的面心立方(fcc)结构体系.结果表明：在该体系中，偶极相互作用对体系的静态磁结构的影响显著，而交换相互作用的影响表现不明显.在此基础上，本文还采用有效媒质理论计算分析了磁性合金颗粒不同体积比时颗粒膜的磁谱和表征电磁参量发生显著变化的逾渗现象和逾渗阈值.并完成了对高磁损耗磁性纳米颗粒膜的材料设计. 关键词： 微磁学 纳米颗粒膜 逾渗阈值 磁导率 材料设计     

低电阻测量设计实验中电位差计指针不稳的解决方法

本文分析了J33Q型电位差计在实验中指针不稳的原因,并提出了解决的办法。     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

超大规模集成电路光学光刻技术的现状与展望

光学光刻是目前超大规模集成电路(VLSI)制备中主要的微米和亚微米的图形加工技术,这一技术将继续保持其主导地位成为90年代VLSI发展的关键。本文综述了近年来光学光刻工艺的发展,主要介绍了G线(436nm)、Ⅰ线(365nm)和准分子激光光刻的现状,并对实现高的光学光刻分辨率所必须解决的透镜设计、套准精度和像场面积等问题作了详细描述。最后展望了发展方向、     

On CCE graphs of doubly partial orders

Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C₄ as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order.     

Current methods for site-directed structure generation

Summary There has been a rapid growth of interest in techniques for site-directed drug design, fuelled by the increasing availability of structural models of proteins of therapeutic importance, and by studies reported in the literature showing that potent chemical leads can be obtained by these techniques. Structure generation programs offer the prospect of discovering highly original lead structures from novel chemical families. Due to the fact that this technique is more-or-less still in its infancy, there are no case studies available that demonstrate the use of structure generation programs for site-directed drug design. Such programs were first proposed in 1986, and became commercially available in early 1992. They have shown their ability to reproduce, or suggest reasonable alternatives for, ligands in well-defined binding sites. This brief review will discuss the recent advances that have been made in the field of site-directed structure generation.     

LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT

We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam.     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

完全二部图Ka,b的迭线图L^m（Ka，b）的谱特征

本证明了当(a，b)不属于{(1，8)，(2，4)，(3，6)，(4，4)，(2s^2-s，2s^2 s))时，L^m(Ka,b)以谱为特征，其中a≤b，s≥2．