Temperature and pressure dependence of direct current electrical resistivity in the Na2O-ZnO-B2O3 glass system

Two series of glasses were prepared, xNa2O, yZnO, 100 - x - yB2O3 and 30 - xNa2O, xZnO, 70B2O3 (mol%). The temperature dependence of the direct current resistivity was measured from room temperature to about 700 K and in both series of glasses we observed a simple Arrhenius type of temperature dependence. However, the resistivity of the binary alkali glass increased steeply by as much as two orders of magnitude with the addition of even a small quantity of ZnO and remained virtually unaffected by further addition of ZnO. The resistivity decreases gradually with increasing pressure in Na2O-B2O3 but increases with increasing pressure with the addition of ZnO.

Evidence for two distinct orthorhombic structures associated with different Tc regimes in LnBa2Cu3O7 − δ (Ln = Nd, Eu, Gd and Dy): A study of the dependence of superconductivity on oxygen stoichiometry

Superconductivity in LnBa2Cu3O7 − δ with Ln = Nd, Eu, Gdand Dy has been investigated as a function of δ, closely following the accompanying changes in crystal structure. Orthorhombic GdBa2Cu3O7 − δ and DyBa2Cu3O7 − δ show a Tc of ≈ 90 K up to δ = 0.2 and a lower Tc plateau (40–50 K) in the δ range 02 to 0.4, similar to that found in YBa2Cu3O7 − δ. The orthorhombic structure II in the lower Tc regions is different from the structure I in the 90 K Tc (low δ) region. The unit cell parameters of the orthorhombic I structure in the high Tc region bear the relationship of a a ≠ b not, vert, similar c/3. This relationship is not seen in the low Tc plateau. The low Tc plateau region does not distinctly manifest itself in NdBa2Cu3O7 − δ just as in LaBa2Cu3O7 − δ.

Dust aerosols over India and adjacent continents retrieved using METEOSAT infrared radiance Part II: quantification of wind dependence and estimation of radiative forcing

Long-range transport of continental dust makes these particles a significant constituent even at locations far from their sources. It is important to study the temporal variations in dust loading over desert regions and the role of meteorology, in order to assess its radiative impact. In this paper, infrared radiance (10.5-12.5 mu m), acquired by the METEOSAT-5 satellite (similar to 5-km resolution) during 1999 and 2003 was used to quantify wind dependence of dust aerosols and to estimate the radiative forcing. Our analysis shows that the frequency of occurrence of dust events was higher during 2003 compared to 1999. Since the dust production function depends mainly on the surface wind speed over regions which are dry and without vegetation, the role of surface wind on IDDI was examined in detail. It was found that an increase of IDDI with wind speed was nearly linear and the rate of increase in IDDI with surface wind was higher during 2003 compared to 1999. It was also observed that over the Indian desert, when wind speed was the highest during monsoon months (June to August), the dust production rate was lower because of higher soil moisture (due to monsoon rainfall). Over the Arabian deserts, when the wind speed is the highest during June to August, the dust production rate is also highest, as soil moisture is lowest during this season. Even though nothing can be said precisely on the reason why 2003 had a greater number of dust events, examination of monthly mean soil moisture at source regions indicates that the occurrence of high winds simultaneous with high soil moisture could be the reason for the decreased dust production efficiency in 1999. It appears that the deserts of Northwest India are more efficient dust sources compared to the deserts of Saudi Arabia and Northeast Africa (excluding Sahara). The radiative impact of dust over various source regions is estimated, and the regionally and annually averaged top of the atmosphere dust radiative forcing (short wave, clear-sky and over land) over the entire study region (0-35 degrees N; 30 degrees-100 degrees E) was in the range of -0.9 to +4.5 W m(-2). The corresponding values at the surface were in the range of -10 to -25 W m(-2). Our studies demonstrate that neglecting the diurnal variation of dust can cause errors in the estimation of long wave dust forcing by as much as 50 to 100%, and nighttime retrieval of dust can significantly reduce the uncertainties. A method to retrieve dust aerosols during nighttime is proposed. The regionally and annually averaged long wave dust radiative forcing was +3.4 +/- 1.6 W m(-2).

Studies on electrical switching behavior of As-Te-Tl glasses - effect of local structure on switching type and composition dependence of switching voltages

Bulk As-Te-Tl glasses belonging to the As30Te70-xTlx (4 <= x <= 22) and As40Te60-xTlx (5 <= x <= 20) composition tie lines are studied for their I-V characteristics. Unlike other As-Te-III glasses such as As-Te-Al and As-Te-In, which exhibit threshold behavior, the present samples show memory switching. The composition dependence of switching voltages (V-t) of As-Te-Tl glasses is also different from that of As-Te-Al and As-Te-In glasses, and it is found that V-t decreases with the addition of Tl. Both the type of switching exhibited by As-Te-Tl glasses and the composition dependence of V-t, seems to be intimately connected with the nature of bonding of Tl atoms and the resultant structural network. Furthermore, the temperature and thickness dependence of switching voltages of As-Te-Tl glasses suggest an electro thermal mechanism for switching in these samples.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Direction dependence in supernova data: constraining isotropy

We revise and extend the extreme value statistic, introduced in Gupta et al., to study direction dependence in the high-redshift supernova data, arising either from departures, from the cosmological principle or due to direction-dependent statistical systematics in the data. We introduce a likelihood function that analytically marginalizes over the,Hubble constant and use it to extend our previous statistic. We also introduce a new statistic that is sensitive to direction dependence arising from living off-centre inside a large void as well as from previously mentioned reasons for anisotropy. We show that for large data sets, this statistic has a limiting form that can be computed analytically. We apply our statistics to the gold data sets from Riess et al., as in our previous work. Our revision and extension of the previous statistic show that the effect of marginalizing over the Hubble constant instead of using its best-fitting value on our results is only marginal. However, correction of errors in our previous work reduces the level of non-Gaussianity in the 2004 gold data that were found in our earlier work. The revised results for the 2007 gold data show that the data are consistent with isotropy and Gaussianity. Our second statistic confirms these results.

Experimental investigation of the dependence of barrier height on metal work function for metal---SiO2---p---Si (MIS) Schottky-barrier diodes in the presence of inversion

The dependence of barrier height on the metal work function of metal-SiO2-p-Si Schottky barrier diodes was investigated and nonlinearity was found. This is explained by the theoretical model proposed recently by Chattopadhyay and Daw. The values of interface trap density and fixed charge density of the insulating layer of the diodes were calculated using this model and found to be appreciably different from those estimated by the usual method.

Constructing Reeb Graphs using Cylinder Maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

Khα1,2 hypersatellites of 3d transition metals and their photoexcitation energy dependence

Hollow atoms in which the K shell is empty while the outer shells are populated allow studying a variety of important and unusual properties of atoms. The diagram x-ray emission lines of such atoms, the K-h alpha(1,2) hypersatellites (HSs), were measured for the 3d transition metals, Z=23-30, with a high energy resolution using photoexcitation by monochromatized synchrotron radiation. Good agreement with ab initio relativistic multiconfigurational Dirac-Fock calculations was found. The measured HS intensity variation with the excitation energy yields accurate values for the excitation thresholds, excludes contributions from shake-up processes, and indicates domination near threshold of a nonshake process. The Z variation of the HS shifts from the diagram line K alpha(1,2), the K-h alpha(1)-K-h alpha(2) splitting, and the K-h alpha(1)/K-h alpha(2) intensity ratio, derived from the measurements, are also discussed with a particular emphasis on the QED corrections and Breit interaction.