968 resultados para Trade Act of 2002
Resumo:
Mode of access: Internet.
Resumo:
"An act ... for consolidating, and bringing into one act, the several laws relating to slaves, and for giving them further protection and security": p. 245-278.
Resumo:
Appendix (A194 p., bound at end of pt. 1) has title: An evaluation of the mandatory petroleum allocation program, January 15-February 28, 1974; staff report to the Federal Trade Commission, March 15, 1974.
Resumo:
"February 26, 1991"--Pts. 2 and 3.
Resumo:
Printed for the use of the Committee on the Merchant Marine and Fisheries.
Resumo:
"February 1999."
Resumo:
[pt. 1.] January 29, May 13 and 15, 1953. 165 p.--pt. 2. October 8 and 9, 1953 - Minneapolis, Minn., October 13 and 14, 1953 - Galveston, Tex. pp. 167-545.
Resumo:
"January 2002 (Revised)."
Resumo:
"January 2002 (Revised)."
Resumo:
"January 2002 (revised)."
Resumo:
"January 2002 (Revised)."
Resumo:
"January 2002 (Revised)."
Resumo:
The Steiner trade spectrum of a simple graph G is the set of all integers t for which there is a simple graph H whose edges can be partitioned into t copies of G in two entirely different ways. The Steiner trade spectra of complete partite graphs were determined in all but a few cases in a recent paper by Billington and Hoffman (Discrete Math. 250 (2002) 23). In this paper we resolve the remaining cases. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
A K-4 - e trade consists of two disjoint decompositions of some simple graph H into copies of K-4 - e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K-4 - e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K-4 - e trade of volume s and foundation v.
Resumo:
The IEEE 802.15.4 protocol proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks (LR-WPAN) including wireless sensor networks (WSNs). It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When in beaconenabled mode, the protocol can provide timeliness guarantees by using its Guaranteed Time Slot (GTS) mechanism. However, power-efficiency and timeliness guarantees are often two antagonistic requirements in wireless sensor networks. The purpose of this paper is to analyze and propose a methodology for setting the relevant parameters of IEEE 802.15.4-compliant WSNs that takes into account a proper trade-off between power-efficiency and delay bound guarantees. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters, using Network Calculus formalism. We then evaluate the delay bound guaranteed by a GTS allocation and express it as a function of the duty cycle. Based on the relation between the delay requirement and the duty cycle, we propose a power-efficient superframe selection method that simultaneously reduces power consumption and enables meeting the delay requirements of real-time flows allocating GTSs. The results of this work may pave the way for a powerefficient management of the GTS mechanism in an IEEE 802.15.4 cluster.