Orthogonal Resolutions and Latin Squares

Resolutions which are orthogonal to at least one other resolution (RORs) and sets of m mutually orthogonal resolutions (m-MORs) of 2-(v, k, λ) designs are considered. A dependence of the number of nonisomorphic RORs and m-MORs of multiple designs on the number of inequivalent sets of v/k − 1 mutually orthogonal latin squares (MOLS) of size m is obtained. ACM Computing Classification System (1998): G.2.1.

Wireless Network Coding for MIMO Two-Way Relaying

The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward protocol which employs two phases: Multiple Access phase and Broadcast phase. It is shown that for MIMO two-way relaying, the minimum distance of the effective constellation at the relay becomes zero when all the rows of the channel fade coefficient matrix belong to a finite number of vector subspaces referred to as the singular fade subspaces. The singular fade subspaces can be classified into two kinds based on whether their harmful effects can be removed or not: (i) the removable and (ii) the non-removable singular fade subspaces. It is shown that network coding maps obtained by the completion of appropriate partially filled Latin Rectangles can remove the harmful effects of all the removable singular fade subspaces. For 2(lambda)-PSK signal set, the removable and non-removable singular fade subspaces are characterized and, it is shown that the number of non-removable singular fade subspaces is a small fraction of the total number of singular fade subspaces and this fraction tends to zero as the constellation size tends to infinity. The Latin Rectangles for the case when the end nodes use different number of antennas are shown to be obtainable from the Latin Squares for the case when they use the same number of antennas. Also, the network coding maps which remove all the removable singular singular fade subspaces are shown to be obtainable from a small set of Latin Squares. The removal of all the singular fade subspaces by properly choosing the network coding map, provides a gain of 5.5 dB over the conventional Exclusive-OR network coding, in a Rayleigh fading scenario with 2 antennas at the end nodes and one antenna at the relay node, for 4-PSK signal set.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Wireless network-coded accumulate-compute and forward two-way relaying

The design of modulation schemes for the physical layer network-coded two way wireless relaying scenario is considered. It was observed by Koike-Akino et al. for the two way relaying scenario, that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA Phase and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an Accumulate-Compute and Forward protocol which employs two phases: Multiple Access (MA) phase consisting of two channel uses with independent messages in each channel use, and Broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-PSK constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin Square with side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin Squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps. Having obtained all the Latin Squares, the set of all possible channel realizations is quantized, depending on which one of the Latin Squares obtained optimizes the performance. The quantization thus obtained, is shown to be the same as the one obtained in [7] for the 2-stage bidirectional relaying.

Wireless Network-Coded Accumulate-Compute-and-Forward Two-Way Relaying

For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.

SAT和DSOLS问题的研究

约束可满足性问题（Constraint Satisfaction Problem,CSP）是在人工智能领域被广泛研究的一类问题。对CSP问题的研究有两种重要的思路：一种思路是用统一的模型来表示CSP，然后用针对这个统一模型的通用工具进行求解；另外一种思路是针对不同的CSP问题开发专门工具，设计不同的算法和数据结构来求解。 本文研究了两个CSP问题：SAT(SATisfiability problem)和DSOLS(DoublySelf-Orthogonal Latin Squares)。CSP可以方便的转换为SAT来求解，因此对SAT的研究对很多问题具有重大意义。本文介绍了当前流行的SAT solver的一些技术，也提出一种新的搜索空间裁剪策略Local Lemma。DSOLS是一种具有特定性质的拉丁方，本文对它的研究不仅仅因为它的应用意义。更重要的是它作为一个特定的CSP问题，可以用来比较通用工具和专门工具的优劣。本文尝试了把DSOLS转化为SAT求解，也试过用一般CSP的思路来求解，最后提出了一种针对性的高效算法并开发了一个专门工具DSOLver，用这个工具证明了一个开放问题：DSOLS(10)不存在。

The effect of incremental replacement of wheat with soya hulls in diets for Jersey cows on lactational performance, diet digestibility and feeding behaviour

Eight Jersey cows were used in two balanced 4 x 4 Latin Squares to investigate the effects of replacement of dietary starch with non-forage fibre on productivity, diet digestibility and feeding behaviour. Total-mixed rations consisted of maize silage, grass silage and a soyabean meal-based concentrate mixture, each at 250g/kg DM, with the remaining 250g consisting of cracked wheat/soya hulls (SH) in the ratios of 250:0, 167:83; 83:167 and 0:250 g, respectively, for treatments SH0, SH83, SH167 and SH250. Starch concentrations were 302, 248, 193 and 140g/kg DM, and NDF concentrations were 316, 355, 394 and 434g/kg DM, for treatments SHO, SH83, SH167 and SH250, respectively. Total eating time increased (p < 0.05) as SH inclusion increased, but total rumination time was unaffected. Digestibility of DM, organic matter and starch declined (p < 0.01) as SH inclusion increased, whilst digestibility of NDF and ADF increased (p < 0.01). Dry-matter intake tended to decline with increasing SH, whilst bodyweight, milk yield and fat and lactose concentrations were unaffected by treatment. Milk protein concentration decreased (p < 0.01) as SH level increased. Feed conversion efficiency improved (p < 0.05) as SH inclusion rose, but it was not possible to determine whether this was due to the increased fibre levels alone, or the favourable effect on rumen fermentation of decreasing starch levels. (c) 2006 Elsevier B.V. All rights reserved.

Statistical isomorphism of three-level factional factorial designs

From a statistician's standpoint, the interesting kind of isomorphism for fractional factorial designs depends on the statistical application. Combinatorially isomorphic fractional factorial designs may have different statistical properties when factors are quantitative. This idea is illustrated by using Latin squares of order 3 to obtain fractions of the 3(3) factorial. design in 18 runs.

Effects of 3-nitrooxypropanol on methane emission,digestion, and energy and nitrogen balance of lactating dairy cows

The objective was to measure effects of 3-nitrooxypropanol (3NP) on methane production of lactating dairy cows and any associated changes in digestion and energy and nitrogen metabolism. Six Holstein-Friesian dairy cows in mid-lactation were fed twice daily a total mixed ration with maize silage as the primary forage source. Cows received 1 of 3 treatments using an experimental design based on two 3 × 3 Latin squares with 5-wk periods. Treatments were a control placebo or 500 or 2,500 mg/d of 3NP delivered directly into the rumen, via the rumen fistula, in equal doses before each feeding. Measurements of methane production and energy and nitrogen balance were obtained during wk 5 of each period using respiration calorimeters and digestion trials. Measurements of rumen pH (48 h) and postprandial volatile fatty acid and ammonia concentrations were made at the end of wk 4. Daily methane production was reduced by 3NP, but the effects were not dose dependent (reductions of 6.6 and 9.8% for 500 and 2,500 mg/d, respectively). Dosing 3NP had a transitory inhibitory effect on methane production, which may have been due to the product leaving the rumen in liquid outflow or through absorption or metabolism. Changes in rumen concentrations of volatile fatty acids indicated that the pattern of rumen fermentation was affected by both doses of the product, with a decrease in acetate:propionate ratio observed, but that acetate production was inhibited by the higher dose. Dry matter, organic matter, acid detergent fiber, N, and energy digestibility were reduced at the higher dose of the product. The decrease in digestible energy supply was not completely countered by the decrease in methane excretion such that metabolizable energy supply, metabolizable energy concentration of the diet, and net energy balance (milk plus tissue energy) were reduced by the highest dose of 3NP. Similarly, the decrease in nitrogen digestibility at the higher dose of the product was associated with a decrease in body nitrogen balance that was not observed for the lower dose. Milk yield and milk fat concentration and fatty acid composition were not affected but milk protein concentration was greater for the higher dose of 3NP. Twice-daily rumen dosing of 3NP reduced methane production by lactating dairy cows, but the dose of 2,500 mg/d reduced rumen acetate concentration, diet digestibility, and energy supply. Further research is warranted to determine the optimal dose and delivery method of the product. Key words: 3-nitrooxypropanol, methane, digestion, rumen, dairy cow

Aplicação do modelo all-or-none em condições de aquisição de associação aos pares

O presente estudo teve por objetivo submeter a nova verificação experimental o modelo "all-or-none" de aprendizagem de pares-associados, em que as associações estímulo resposta são formadas inteiramente em uma única tentativa. Justifica o presente trabalho a necessidade de estudos na área da teoria da aprendizagem, a fim de fornecer subsídios para uma tecnologia educacional. A hipótese testada foi a de que a probabilidade de uma associação se efetuar é constante para qualquer número de treinos anteriores. Foram testados 100 sujeitos de classe de alfabetização, divididos em 5 grupos, com 5 níveis de reforçamentos e 5 grupos de itens. Foi usado um esquema de quadrados latinos, combinando três fatores em cinco níveis cada um: 1 - número de reforçamentos, 2 - grupo de itens e 3 - grupo de sujeitos. A análise dos resultados levou à aceitação da hipótese de que a aprendizagem é, em essência, all-or-none.