Assortative matching of exporters and importers

This paper uses the opening of the US textile/apparel market for China at the end of the Multifibre Arrangement in 2005 as a natural experiment to provide evidence for positive assortative matching of Mexican exporting firms and US importing firms by their capability. We identify three findings for liberalized products by comparing them to other textile/apparel products: (1) US importers switched their Mexican partners to those making greater preshock exports, whereas Mexican exporters switched their US partners to those making fewer preshock imports; (2) for firms who switched partners, trade volume of the old partners and the new partners are positively correlated; (3) small Mexican exporters stop exporting. We develop a model combining Becker-type matching of final producers and suppliers with the standard Melitz-type model to show that these findings are consistent with positive assortative matching but not with negative assortative matching or purely random matching. The model indicates that the findings are evidence for a new mechanism of gain from trade.

A synthesis method for broad-band antenna impedance matching networks /

Vita.

Array pattern matching /

Printout.

An NP-complete matching problem /

"UILU-ENG 79-1713."

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 electrical admittance of a homogeneous polarized fully electroded circular disc, loss-less and mechanically free : analysis, including Rayleigh correction, data for routine determination of elastic modulus and Piezoelectric coupling, and discussion of limitation of correction, anisotrophy parameters involved, and deductions concerning dimensional standarization /

"ONR Contract No. Nonr-1055(00)."

No admittance : a farce in one act for female characters only.

Mode of access: Internet.

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

Description based on: 1985; title from caption.

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.

Complete modulational-instability gain spectrum of nonlinear quasi-phase-matching gratings

We consider plane waves propagating in quadratic nonlinear slab waveguides with nonlinear quasi-phase-matching gratings. We predict analytically and verify numerically the complete gain spectrum for transverse modulational instability, including hitherto undescribed higher-order gain bands. (C) 2004 Optical Society of America.