Development of an apparatus for obtaining molecular beams in the energy range from 2 to 200 eV

The formation and detection of molecular beams obtained by charge exchange from a low-energy ion source is discussed. Dispersion in energy of the ion source was measured and problems concerning detection of neutral beams were studied. Various methods were used, specifically secondary electron emissivity of a metallic surface and ionization of a gas target with a low ionization voltage. The intensities of neutral beams as low as 10 eV are measured by a tubular electron multiplier and a lock-in amplifier

Magnetic recording stability of taenite-containing meteorites

Abstract Sub‐μm taenite and tetrataenite grains observed in a number of (stony‐)iron meteorite groups are promising sources of paleomagnetic records in meteorites. While slowly‐cooled meteorites form tetrataenite—an extremely good recorder—, fast‐cooled meteorites may contain fine‐grained taenite, which was considered unsuitable for paleomagnetic studies. In this work, however, we show that nm‐sized taenite grains are stable over billion‐year timescales, indicating that taenite‐bearing meteorites are reliable sources of paleomagnetic information. We find a range of sizes for which taenite forms stable single‐domain structures, which coincides with the grain sizes observed in the cloudy zone of most fast cooled IVA meteorites. These meteorites, therefore, can provide reliable paleomagnetic information recorded as a stable crystallization remanent magnetization as taenite grains grown. Vortex states observed in larger (>50 nm) grain sizes are also highly stable, indicating that coarse‐grained taenite observed in meteoritic microstructures can also provide reliable records of paleomagnetic fields

Reliable paleomagnetic records from single-vortex iron particles

Dusty olivine containing Fe-rich kamacite grains in chondrules can faithfully record the early solar magnetic fields. To retrieve paleointensity estimates, most experimental protocols are based on the dominance of uniformly magnetized single-domain (SD) particles. However, direct observation shows that most particles adopt a non-uniform magnetic structure. This inconsistency potentially represents a major impediment in reliably reconstructing ancient magnetic fields. Here we present a micromagnetic based model, the State Group Algorithm, that enables efficient simulations of thermoremanence acquisition in magnetic particles with single-vortex (SV) domain states. Our results show that these particles can acquire a thermoremanence that is linear proportional to the external field up to μ. They also have cooling rate effects that are generally weaker than those of SD particles. Notably, a small subset of SV particles can exhibit negative cooling rate effects, leading to underestimates in paleointensity. We conclude that SV particles are reliable paleomagnetic recorders

Nuclear Interactions of 400 GeV Protons in Emulsion

We report on 400 GeV proton-emulsion nucleus reactions and compare the results to hadron-nucleus reactions at smaller energies. In particular we present results on the emission of fast target protons (essentially grey track particles) and on their correlation with the number of collisions inside the nucleus, ν, with the number of charged evaporated particles (essentially black track particles) and with the number of pions produced (essentially shower particles). We observe that the main features of the 200¿400 GeV data are very similar. However, we find that the mean shower-particle multiplicity at 400 GeV is essentially higher than expected from the simple independent particle model prediction 〈ns〉 = 〈nch〉[1 + 0.5(〈ν〉 − 1)]. The shower particle multiplicities do not seem to follow a target mass dependence of the form 〈ns〉 = 〈nch〉 Aα with α = 0.14 or α = 0.19 as has been suggested in the literature. The pseudo-rapidity distribution shows limiting target and projectile fragmentation. The shower-particle multiplicity in the ¿central region¿ increases linearity with 〈ν〉 but faster than 0.5〈ν〉 times the corresponding multiplicity in pp reactions

Synthesis, characterization and antibacterial activity studies of new 2‑pyrral‑L‑amino acid Schif base palladium (II) complexes.

Three new 2-pyrral amino acid Schif base palladium (II) complexes were synthesized, characterized and their activity against six bacterial species was investigated. The ligands: Potassium 2-pyrrolidine-L-methioninate (L1), Potassium 2-pyrrolidine-L-histidinate (L2) and Potassium 2-pyrrolidine-L-tryptophanate (L3) were synthesized and reacted with dichloro(1,5- cyclooctadiene)palladium(II) to form new palladium (II) complexes C1, C2 and C3, respectively. 1 NMR, FTIR, UV–Vis,elemental analysis and conductivity measurements were used to characterize the products. The antibacterial activities of the compounds were evaluated against Gram-positive Staphylococcus aureus (S. aureus, ATCC 25923), methicillin-resistant Staphylococcus aureus (MRSA, ATCC 33591), Staphylococcus epidermidis (S. epidermidis, ATCC 12228) and Streptococcus pyogenes (S. pyogenes, ATCC 19615) and, gram-negative Pseudomonas aeruginosa (P. aeruginosa, ATCC 27853) and Klebsiella pneumoniae (K. pneumoniae, ATCC 13883) using the agar well difusion assay and microtitre plate serial dilution method. The palladium complexes were active against the selected bacteria with the imidazole ring containing complex C2 and indole heterocyclic ring containing complex C3 showing the highest activity

Propositional Tree Automata

In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a sufficient completeness checker for specifications with rewriting modulo an equational theory. Propositional tree automata recognize regular equational tree languages. However, unlike regular equational tree automata, the class of propositional tree automata is closed under Boolean operations. This extra expressiveness does not affect the decidability of the membership problem. This paper also analyzes in detail the emptiness problem for propositional tree automata with associative theories. Though undecidable in general, we present a semi-algorithm for checking emptiness based on machine learning that we have found useful in practice