13 resultados para Tríades
em University of Queensland eSpace - Australia
Resumo:
Let T be a partial latin square and L be a latin square with T subset of L. We say that T is a latin trade if there exists a partial latin square T' with T' boolean AND T = theta such that (LT) U T' is a latin square. A k-homogeneous latin trade is one which intersects each row, each column and each entry either 0 or k times. In this paper, we construct 3-homogeneous latin trades from hexagonal packings of the plane with circles. We show that 3-homogeneous latin trades of size 3 m exist for each m >= 3. This paper discusses existence results for latin trades and provides a glueing construction which is subsequently used to construct all latin trades of finite order greater than three. Crown Copyright (c) 2005 Published by Elsevier B.V. All rights reserved.
Resumo:
The maximum possible volume of a simple, non-Steiner (v, 3, 2) trade was determined for all v by Xhosrovshahi and Torabi (Ars Combinatoria 51 (1999), 211-223), except that in the-case v equivalent to 5 (mod 6), v >= 23, they were only able to provide an upper, bound on the volume. In this paper we construct trades with volume equal to that bound for all v equivalent to 5 (mod 6), thus completing the problem.
Resumo:
A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A d-homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either 0 or d times. In this paper we give a construction for minimal d-homogeneous latin trades of size dm, for every integer d >= 3, and m >= 1.75d(2) + 3. We also improve this bound for small values of d. Our proof relies on the construction of cyclic sequences whose adjacent sums are distinct. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
Queensland Trades and Labor Council float with banner during the Labor Day procession, May 1965, Brisbane Australia.
Resumo:
This paper examines execution costs and the impact of trade size for stock index futures using price-volume transaction data from the London International Financial Futures and Options Exchange. Consistent with Subrahmanyam [Rev. Financ. Stud. 4 (1991) 11] we find that effective half spreads in the stock index futures market are small compared to stock markets, and that trades in stock index futures have only a small permanent price impact. This result is important as it helps to better understand the success of equity index products such as index futures and Exchange Traded Funds. We also find that there is no asymmetry in the post-trade price reaction between purchases and sales for stock index futures across various trade sizes. This result is consistent with the conjecture in Chan and Lakonishok [J. Financ. Econ. 33 (1993) 173] that the asymmetry surrounding block trades in stock markets is due to the high cost of short selling and the general reluctance of traders to short sell on stock markets. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
Previously the process of finding critical sets in Latin squares has been inside cumbersome by the complexity and number of Latin trades that, must be constructed. In this paper we develop a theory of Latin trades that yields more transparent constructions. We use these Latin trades to find a new class of critical sets for Latin squares which are a product of the Latin square of order 2 with a. back circulant Latin square of odd order.
Resumo:
Dynamic spectrum management (DSM) comprises a new set of techniques for multiuser power allocation and/or detection in digital subscriber line (DSL) networks. At the Alcatel Research and Innovation Labs, we have recently developed a DSM test bed, which allows the performance of DSM algorithms to be evaluated in practice. With this test bed, we have evaluated the performance of a DSM level-1 algorithm known as iterative water-filling in an ADSL scenario. This paper describes the results of, on the one hand, the performance gains achieved with iterative water-filling, and, on the other hand, the nonstationary noise robustness of DSM-enabled ADSL modems. It will be shown that DSM trades off nonstationary noise robustness for performance improvements. A new bit swap procedure is then introduced to increase the noise robustness when applying DSM.