视频特技切换台的原理与功能

本文较系统、通俗地介绍了模拟视频特技切换台的矩阵输入、混合/效果放大器(M/E)、下游键、系统控制和同步发生器等电路单元,介绍了特技切换台的切换、混合、扫变、键控的基本原理和功能。     

运用模式分类的雷达抗转发式距离欺骗干扰方法

针对雷达转发式欺骗干扰中的距离欺骗，提出了一种基于模式分类来识别目标与干扰的方法。该方法基于干扰和目标能量和起伏特性差异确定提取特征因子，再利用RBF神经网络方法进行分类。仿真结果表明，该方法具有较好的抗距离欺骗干扰性能。     

Morphology of Nylon-6 blends with styrenic polymers

The morphology of blends of styrenic polymers in a matrix of 75% Nylon-6 prepared in a Brabender Plasti-Corder was examined by scanning electron microscopy. Styrene/acrylonitrile copolymers (SAN) form smaller particles as the AN level increases owing to the corresponding decrease in the SAN–polyamide interfacial tension. Various styrenic polymers containing functional groups, maleic anhydride or oxazoline type, that can react with Nylon-6 during melt processing were added to the SAN phase which also led to a decrease in the particle size owing to the graft copolymer formed in situ. The effects of functional group type, amount of functional groups per chain, amount of functional polymer added, and the miscibility of the styrene/maleic anhydride (SMA) and SAN copolymers on the morphology of the styrenic phase in the Nylon-6 matrix are described. © 1992 John Wiley & Sons, Inc.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

Axisymmetric frictionless contact of functionally graded materials

The main interest of this study is a new method to solve the axisymmetric frictionless contact problem of functionally graded materials (FGMs). Based on the fact that an arbitrary curve can be approached by a series of continuous but piecewise linear curves, the FGM is divided into a series of sub-layers with shear modulus varying linearly in each sub-layer and continuous at the sub-interfaces. With this model, the axisymmetric frictionless contact problem of a functionally graded coated half-space is investigated. By using the transfer matrix method and Hankel integral transform technique, the problem is reduced to a Cauchy singular integral equation. The contact pressure, contact region and indentation are calculated for various indenters by solving the equations numerically. An erratum to this article can be found at     

面向对象的设计特征与实现语言

在管理信息系统的开发以及分布式数据库系统的设计中，已开始使用面向对象的技术．本文论述了面向对象的设计特征，介绍了用于面向对象设计的各种实现语言，并着重分析了各种实现语言支特面向对象设计的能力．     

The completely positive and doubly nonnegative completion problems

We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BB^T for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.