Input impedance of a spherical ferrite antenna with a latitudinal current /

"Contract No. AF33(616)-310 RDO No. R-112-110 SR-6f2"

An NP-complete matching problem /

"UILU-ENG 79-1713."

Impedance properties of complementary multiterminal planar structures /

"Contract AF33(616)-6079 Project No. 9-(13-6278) Task 40572. Sponsored by: Wright Air Development Center"

Colour-matching on textiles : a manual intended for the use of dyers, calico printers, and textile colour chemists /

Dyed cloth samples mounted on last 4 plates.

The use of low impedance transmission lines in plasma heating and confinement studies,

"Prepared for the Air Force Ballistic Missile Division, Headquarters Air Research and Development Command, under Contract AF 04(647)-309, Thermonuclear Propulsion Research."

On the utilization of the concept of boundary impedance in vibrations of bars

"Materials Laboratory, Contract no. AF 33(616)-5426, Project no. 7360."

Fiscal year ... advanced technology equipment matching grant report /

Description based on: 1985; title from caption.

Organizational, direct support, and general support maintenance repair parts and special tools list (including depot maintenance repair parts and special tools) for impedance bridge ZM-71A/U (NSN 6625-00-236-1536).

"15 November 1983."

Operator's, organizational, direct support and general support maintenance manual for impedance bridge ZM-71A/U (NSN 6625-00-236-1536).

Includes index.

Manufacturers' abbreviated guide for age-labeling toys : matching toy characteristics to children's ages.

Mode of access: Internet.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.