Inelastic scattering of tritium-source antineutrinos on electrons of germanium atoms

Processes of the inelastic magnetic and weak scattering of tritium-beta-source antineutrinos on the bound electrons of a germanium atom are considered. The results obtained by calculating the spectra and cross sections are presented for the energy-transfer range between 10 eV and 18 keV.     

1,1‐Organoboration of bis(trimethylstannyl)ethyne with trimethylsilyl‐ and dimethylsilyl‐dialkylboryl‐substituted alkenes: organometallic‐substituted allenes

The reactions of bis(trimethylstannyl)ethyne, Me₃Sn–C?C–SnMe₃ ( 4 ), with trimethylsilyl‐ or dimethylsilyl‐dialkylboryl‐substituted alkenes 1 – 3 afford organometallic‐substituted allenes 5 , 6 and 8 , 9 in high yield. In the case of (E)‐2‐trimethylsilyl‐3‐diethylboryl‐2‐pentene ( 1) , a butadiene derivative 7 could be detected as an intermediate prior to rearrangement into the allene. All reactions were monitored by ²⁹Si and ¹¹⁹Sn NMR, and the products were characterized by an extensive NMR data set (¹H, ¹¹B, ¹³C, ²⁹Si, ¹¹⁹Sn NMR). Copyright © 2003 John Wiley & Sons, Ltd.     

A class of multivariate skew-normal models

The existing model for multivariate skew normal data does not cohere with the joint distribution of a random sample from a univariate skew normal distribution. This incoherence causes awkward interpretation for data analysis in practice, especially in the development of the sampling distribution theory. In this paper, we propose a refined model that is coherent with the joint distribution of the univariate skew normal random sample, for multivariate skew normal data. The proposed model extends and strengthens the multivariate skew model described in Azzalini (1985,Scandinavian Journal of Statistics,12, 171–178). We present a stochastic representation for the newly proposed model, and discuss a bivariate setting, which confirms that the newly proposed model is more plausible than the one given by Azzalini and Dalla Valle (1996,Biometrika,83, 715–726).     

Synchronization in supply chains: implications for design and management

Supply chain management literature calls for coordination between the different members of the chain. Materials should be moved from one supplier to the next according to a just-in-time schedule. In this paper, we show that for many supply chain configurations, complete synchronization will result in some members of the chain being ‘losers’ in terms of cost. We develop an algorithm for optimal synchronization of supply chains and provide some guidelines for incentive alignment along the supply chain. In developing the model, we use the economic delivery and scheduling problem model and analyze supply chains dealing with single and multiple components. For single-component supply chains, we derive a closed-form expression for the optimal synchronized cycle time. For multi-component supply chains, we develop an algorithm for finding the optimal synchronized cycle time. We test the performance of the algorithm and show that it provides optimal solutions for a wide range of problems. We illustrate the models with numerical examples.     

Cesàro means of double Walsh-Fourier series

We investigate approximation properties of Cesàro (C; −α, −β)-means of double Walsh-Fourier series with α, β ∈ (0, 1). As an application, we obtain a sufficient condition for the convergence of the means σ _n,m ^/−α,−β (f; x, y) to f(x,y) in the L ^p -metric, p ∈ [1, ∞]. We also show that this sufficient condition cannot be improved.     

A Branch & Cut algorithm for a four-index assignment problem

In this paper, we examine the orthogonal Latin squares (OLS) problem from an integer programming perspective. The OLS problem has a long history and its significance arises from both theoretical aspects and practical applications. The problem is formulated as a four-index assignment problem whose solutions correspond to OLS. This relationship is exploited by various routines (preliminary variable fixing, branching, etc) of the Branch & Cut algorithm we present. Clique, odd-hole and antiweb inequalities implement the ‘Cut’ component of the algorithm. For each cut type a polynomial-time separation algorithm is implemented. Extensive computational analysis examines multiple aspects concerning the design of our algorithm. The results illustrate clearly the improvement achieved over simple Branch & Bound.     

Parallel discrete event simulation algorithm for manufacturing supply chains

Parallel discrete event simulation (PDES) is concerned with the distributed execution of large-scale system models on multiple processors. It is an enabler in the implementation of the virtual enterprise concept, integrating semi-autonomous models of production cells, factories, or units of a supply chain. The key issue in PDES is to maintain causality relationships between system events, while maximizing parallelism in their execution. Events can be executed conservatively only when it is safe to do so, sacrificing the extent to which potential parallelism of the system can be exploited. Alternatively, they can be processed optimistically without guarantee of correctness, but incurring the overhead of a rollback to an earlier saved state when causality error is detected. The paper proposes a modified optimistic scheme for distributed simulation of constituent models of a supply chain in manufacturing, which exploits the inherent operating characteristics of its domain.     

Estimates for the Poisson kernel and Hardy spaces on compact manifolds

We study Hardy spaces on the boundary of a smooth open subset or Rn and prove that they can be defined either through the intrinsic maximal function or through Poisson integrals, yielding identical spaces. This extends to any smooth open subset of Rn results already known for the unit ball. As an application, a characterization of the weak boundary values of functions that belong to holomorphic Hardy spaces is given, which implies an F. and M. Riesz type theorem.     

Subgame Consistent Cooperative Solutions in Stochastic Differential Games

Subgame consistency is a fundamental element in the solution of cooperative stochastic differential games. In particular, it ensures that: (i) the extension of the solution policy to a later starting time and to any possible state brought about by the prior optimal behavior of the players would remain optimal; (ii) all players do not have incentive to deviate from the initial plan. In this paper, we develop a mechanism for the derivation of the payoff distribution procedures of subgame consistent solutions in stochastic differential games with transferable payoffs. The payoff distribution procedure of the subgame consistent solution can be identified analytically under different optimality principles. Demonstration of the use of the technique for specific optimality principles is shown with an explicitly solvable game. For the first time, analytically tractable solutions of cooperative stochastic differential games with subgame consistency are derived.     

Structure and reflective properties of Al-Cu-Fe quasicrystalline thin film prepared by laser induced arc method

Al-Cu-Fe thin films were prepared by laser induced arc (laser-arc) method from a single source—Al₆₃Cu₂₅Fe₁₂ alloy, which was proved to consist of quasicrystalline phase together with approximant phase. The composition of the deposited films meets the requirement for formation of icosahedral symmetry phase. Quasicrystalline phase was obtained after annealing the amorphous as-deposit film samples. The optical properties of the samples were investigated. Thin film samples of Al, Cu and Fe deposited under the same condition were employed for comparison. The results showed specific reflective properties of Al-Cu-Fe quasicrystal thin film in some wavelength range. The optical conductivity of the films exhibited a negative peak, centered about 440 nm in range of 190 to 800 nm. The Al-Cu-Fe quasicrystal thin films could absorb almost all the ray in the wavelength range from 420nm to 450 nm. The ratio of absorption was greater than 99%.