A microspectroscopic study of the electronic homogeneity of ordered and disordered Sr2FeMoO6

Disordered Sr₂FeMoO₆ shows a drastic reduction in saturation magnetization compared to highly ordered samples, moreover magnetization as a function of the temperature for different disordered samples shows qualitatively different behaviours. We investigate the origin of such diversity by performing spatially resolved photoemission spectroscopy on various disordered samples. Our results establish that e_xtensive electronic inhomogeneity, arising most probably from an underlying chemical inhomogeneity in disordered samples, is responsible for the observed magnetic inhomogeneity. It is further pointed out that these inhomogeneities are connected with composition fluctuations of the type Sr₂Fe_1+x Mo_1-x O₆ with Fe-rich (x > 0) and Mo-rich (x < 0) regions. Dedicated to Prof J Gopalakrishnan on his 62nd birthday.     

Statistical Analysis of the Effect of Mineral Admixtures on the Strength of the Interfacial Transition Zone

Microscopic evidence indicates that the thickness of the interfacial transition zone (ITZ) between the aggregate and the cement paste is modified when mineral admixtures partially replace portland cement. Unfortunately, there is limited information on the significance of these microscopic modifications to the mechanical properties of the ITZ. This research reports experimental results on the shear and tensile strength of the ITZ as affected by the addition of the following mineral admixtures: silica fume, fly ash, and natural pozzolan. Statistical analysis was used to identify the significant parameters affecting the tensile and shear strength of the ITZ. Experimental results indicate that not only does the incorporation of silica fume and fly ash increase the strength of the ITZ, these mineral admixtures have a greater influence on the strength increase of the ITZ than in the strength increase of the cement paste.     

Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

Ihara zeta functions of digraphs

After defining and exploring some of the properties of Ihara zeta functions of digraphs, we improve upon Kotani and Sunada’s bounds on the poles of Ihara zeta functions of undirected graphs by considering digraphs whose adjacency matrices are directed edge matrices.     

Stress monitoring in a Guinness 10-day scuba dive

Nowadays, there is high demand for sensitive gas sensors both for human and environmental monitoring. This paper deals with a high-resolution (0.2 ppb) laser-based photoacoustic spectroscopic system realized at ENEA Frascati, Italy, applied for monitoring stress in scuba divers during sustained immersion by analyzing breath samples. Blood tests and psychometric tests for scuba divers were performed at Catholic University in Rome. Results will be reported and discussed.     

Electro-absorption and refraction in Fabry-Perot quantum well modulators: a general discussion

Fabry-Perot resonators have long been advocated to improve the limited contrast ratio of multiple quantum well optical modulators used in photonic switches based on self electrooptic effect devices (SEEDs) and in other array based optical interconnection schemes. Using data on field dependent GaAs/AlGaAs quantum well absorption and refraction, we have modelled the reflectivity, modulation depth and contrast ratio of resonant modulators. Our results are generally valid for any quantum well modulator and demonstrate 23the important role played by electro-refraction even in regions of strong absorption. Resonators give large contrast ratios but there are trade-offs in the maximum reflectivity change achievable with Fabry-Perot resonators compared to simple modulators. The model gives the optimum number of quantum wells and reflectivity values required to make a resonator at any wavelength for a given quantum well structure. Understanding the limits of Fabry-Perot quantum well modulator performance is important for their application in symmetric self electrooptic effectiveness for photonic switching where modulation and detection properties are both used and for optical interconnection systems.     

Synchronization through system interconnections

An interconnection strategy with built-in adaptive controllersis presented which achieves synchronization of scalar linearsystems: the closed-loop network forces all outputs to followthe same signal asymptotically while maintaining the open-loopcharacteristics. In the design of the output feedback controllers,no knowledge of system parameters is assumed, but each systemmust have the same poles and be high-gain-stable. The proofof the main theorem relies critically on derived systems-theoreticresults and the special system topology as a network of interconnectedsystems. The topology is explained by first solving the simplerproblem of signal synchronization.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007