Study of the reaction238U (α, α′f) atE α=480 MeV

The excitation function of the fission probability P _E E _x) for²³⁸U has been measured in the reaction²³⁸U(α, α′ f) at 480 MeV bombarding energy. The reaction mechanism of this reaction is discussed for excitation energies belowB _nf , the threshold for second chance fission, and aboveB _nf up toE _x =37 MeV. In comparing with results from fission induced by photons and by particle transfer reactions the (α, α′f) reaction gives too low values for the fission probabilityP _f at excitation energies well aboveB _nE . The role of the quasi-elastic knock-out process in this reaction is discussed.     

Aberrations theory of a time dependent magnetic field lens

We analyze new forms of aberrations affecting a time dependent magnetic field lens recently proposed. The lens consist of an axially symmetric ellipsoidal solenoid producing a spatially uniform but time pulsating homogeneous field. The dynamics of electrons emitted by some object and injected into this coil shows that this system is capable of focusing a parallel beam or produce images free of geometrical aberrations. The cardinal elements of this lens change periodically in positions and therefore to obtain a stationary image it is necessary to employ a chopped electron beam. Two forms of aberrations originate from the finite duration of the electron pulse and the energy dispersion of the incoming beam (chromatic aberration). Their image degradation effects are quite similar and result from recording different axially displaced images at some fixed stationary plane. We show how, by adjusting the parameters characterizing the magnetic pulse and introducing small apertures that increase the depth of focus, their effects can be reduced or in some cases eliminated. Other forms of instrumental aberrations characteristic of this time dependent magnetic field lens are briefly discussed.     

Magnetic properties of oxygenated carbon nitride films from RF-discharge in an acetylene, nitrogen, and oxygen mixture environments

Properties of oxygenated carbon nitride films have attracted the attention of physics researchers due to their magnetic and physical properties, as well as for their usefulness in the industry. The free radicals were investigated using electron paramagnetic resonance applied in the study of spin concentration due to the different mechanism of preparation of carbon nitride films by RF-discharge with different kinds of plasma. Unpaired spin concentrations, in the order of 10²⁰ per cm³, were measured and their time recombination dependency was important in those films. The films were grown by plasma enhanced chemical vapor deposition using mixtures of hydrocarbons, N₂ and O₂ in different proportions.     

Three New Polyoxygenated Steroids from Two Species of the South China Sea Gorgonian Muricella flexuosa and Menella verrucosa Brundin

Three new polyoxygenated steroids, muricesteroid ( 1 ), and menellsteroids A ( 2 ) and B ( 3 ), were isolated from two species of the South China Sea gorgonian Muricella flexuosa and Menella verrucosa Brundin , respectively. The structures of these new compounds were elucidated on the basis of extensive spectroscopic analysis, chemical methods and comparison with known related compounds.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002     

The plus construction, Postnikov towers and universal central module extensions

Given a connected spaceX, we consider the effect of Quillen’s plus construction on the homotopy groups ofX in terms of its Postnikov decomposition. Specifically, using universal properties of the fibration sequenceAX→X→X ⁺, we explain the contribution of π _n X to π _n X ⁺, π _n+1 X ⁺ and π _n AX, π _n+1 AX explicitly in terms of the low dimensional homology of π _n X regarded as a module over π₁ X. Key ingredients developed here for this purpose are universal II-central fibrations and a theory of universal central extensions of modules, analogous to universal central extensions of perfect groups. Research partially supported by NSERC of Canada.     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.