Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

On one generalization of a DiPerna and Majda theorem

The weak limits of sequences {f(u^ν)}_ν∈? where u^ν's are vector‐valued µ‐measurable functions defined on a compact set Ω and f is (possibly) discontinuous are investigated. As shown by the author (J. Conv. Anal. (to appear)), they are described in terms of integral formulae involving parametrized measures independent of f, similarly as in the classical theorem by Young and its generalization due to DiPerna and Majda. In the present paper we describe the supports of the involved parametrized measures. Copyright © 2006 John Wiley & Sons, Ltd.     

On c‐Bhaskar Rao designs with block size 4

Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λ_min=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λ_min≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

A MODEL OF TROPICAL MARINE RESERVE‐FISHERY LINKAGES

ABSTRACT. The excessive and unsustainable exploitation of our marine resources has led to the promotion of marine reserves as a fisheries management tool. Marine reserves, areas in which fishing is restricted or prohibited, can offer opportunities for the recovery of exploited stock and fishery enhancement. In this paper we examine the contribution of fully protected tropical marine reserves to fishery enhancement by modeling marine reserve‐fishery linkages. The consequences of reserve establishment on the long‐run equilibrium fish biomass and fishery catch levels are evaluated. In contrast to earlier models this study highlights the roles of both adult (and juvenile) fish migration and larval dispersal between the reserve and fishing grounds by employing a spawner‐recruit model. Uniform larval dispersal, uniform larval retention and complete larval retention combined with zero, moderate and high fish migration scenarios are analyzed in turn. The numerical simulations are based on Mombasa Marine National Park, Kenya, a fully protected coral reef marine reserve comprising approximately 30% of former fishing grounds. Simulation results suggest that the establishment of a fully protected marine reserve will always lead to an increase in total fish biomass. If the fishery is moderately to heavily exploited, total fishery catch will be greater with the reserve in all scenarios of fish and larval movement. If the fishery faces low levels of exploitation, catches can be optimized without a reserve but with controlled fishing effort. With high fish migration from the reserve, catches are optimized with the reserve. The optimal area of the marine reserve depends on the exploitation rate in the neighboring fishing grounds. For example, if exploitation is maintained at 40%, the ‘optimal’ reserve size would be 10%. If the rate increases to 50%, then the reserve needs to be 30% of the management area in order to maximize catches. However, even in lower exploitation fisheries (below 40%), a small reserve (up to 20%) provides significantly higher gains in fish biomass than losses in catch. Marine reserves are a valuable fisheries management tool. To achieve maximum fishery benefits they should be complemented by fishing effort controls.     

On isomorphic factorizations of circulant graphs

We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006     

Projective geometry and special relativity

Some concepts of real and complex projective geometry are applied to the fundamental physical notions that relate to Minkowski space and the Lorentz group. In particular, it is shown that the transition from an infinite speed of propagation for light waves to a finite one entails the replacement of a hyperplane at infinity with a light cone and the replacement of an affine hyperplane – or rest space – with a proper time hyperboloid. The transition from the metric theory of electromagnetism to the pre‐metric theory is discussed in the context of complex projective geometry, and ultimately, it is proposed that the geometrical issues are more general than electromagnetism, namely, they pertain to the transition from point mechanics to wave mechanics.     

Numerical solution of the three‐dimensional parabolic equation with an integral condition

Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040     

离子交换富集-导数火焰原子吸收法测定自来水中Cu,Fe和Zn

本文研究了用 2 0 1× 7阳离子交换树脂对自来水中的微量元素进行交换富集 ,采用微量脉冲进样 导数火焰原子吸收法测定富集后溶液中的Cu ,Fe和Zn ,该方法灵敏度分别为 0 2 9,0 5 9和 0 0 6 μg·L- 1 ,精密度分别为 4 2 8% ,1 95 %和 2 2 8% ,检测限分别为 1 2 8,5 85和 0 6 8μg·L- 1 ,回收率分别为 91 13% ,10 1 34%和99 84 % ,本方法大大减少了需样量 ,简便快速 ,灵敏度高。