Simulation model for shapiro time delay and light deflection experiments

The time delay experiment proposed by I.I. Shapiro in 1964 and conducted in the seventies was the most precise experiment of general relativity until that time. Further experimentation has improved the accuracy level of both the time delay and the light deflection experiments. A simulation model is proposed that involves only a simple mass and time transformation factor involving velocity of light. The light deflection and the time delay experiments are numerically simulated using this model that does not use the general relativistic equations. The computed values presented in this paper compare well with recent levels of accuracy of their respective experimental results.     

Dependence of Magnetic Properties on Composition of Nanocrystalline Fe–M–B–Cu (M: Zr,Nb, Mo,Ti, Ta) Alloys

The specialized rf-Mössbauer technique is used to elucidate the magnetic properties of NANOPERM-type nanocrystalline alloys. The influence of alloy composition on the soft magnetic properties is studied for the Fe₈₀M₇B₁₂Cu₁ (M: Ti, Ta, Nb, Mo, Zr) alloys. The rf-Mössbauer experiments allowed us to distinguish magnetically soft nanoclusters from magnetically harder microcrystalline phases. The measurements performed as a function of the rf field intensity allowed the determination of the distribution of anisotropy fields related to the size distribution of bcc nanoclusters. Smaller anisotropy fields in the nanocrystalline phase were found in Nb-, Zr-, and Mo-containing alloys as compared with the alloys which contain Ti and Ta. The Mössbauer measurements were supplemented by X-ray diffraction determination of the size of nanocrystalline grains.     

A sequential sorting network analogous to the batcher merge

We present a network of delay log₂N, whose comparators have only log₂N different lengths with maximum length N/2. This network is log-sequential in that it will sort N data items when they are passed through it log₂Ntimes. The design, which is related to the Batcher odd-even merge, is distinctly different from the first known example of a log-delay log-sequential network, due to Dowd, Perl, Rudolf, and Saks. It is quite probably the best possible sorting network.     

The two basic linear time Planarity algorithms: Are they the same?

We compare the two most widely known planarity testing algorithms, the one due to Hoperoft and Tarjan, and the other to Lempel. Even, and Cederbaum. These two algorithms are generally viewed as very different approaches to the problems of planarity testing and graph embedding. In this paper, however, by utilizing previously unnoticed freedoms of choice in the order in which the operations of the Hoperoft-Tarjan algorithm can be performed, we create a variation of this algorithm which, in terms of the order in which vertices are processed, is indistinguishable on all planar graph inputs from the Lempel -Even-Cederbaum algorithm. This allows one to create hybridized algorithms which, when interpreted as embedding algorithms, combine all of the features of both procedures.     

High-resolution infrared spectra of water vapor ν2 band of H2O

The ν₂ band of H₂¹⁸O occurring in the region 5–7.5 μ was recorded with a high-resolution vacuum infrared spectrograph and an analysis was presented of the rotational structure observed; comparison of the ground state (000) energy levels determined from the ν₂ band with those derived earlier by Fraley, Rao, and Jones from the ν₁ and ν₂ bands at 2.7 μ was of assistance in this analysis. Values for the energy levels of the first excited state (010) were evaluated.     

Menus of kuratowski subgraphs

Motivated by heuristic embedding algorithms, this paper is concerned with the organization of potentially large lists of Kuratowski subgraphs of an arbitrary nonpianar graph. A graphical structure called a "nearly Hamiltonian" graph is defined. It is shown that lists of Kuralowski subgraphs can be lexicographically organized in such structures. It is shown that any nonpianar graph contains such structures and at least one such structure with a nonempty list of Kuratowski subgraphs can be located in linear time in ihe edges of the graph.