Lattice vibrations and specific heat of zinc blende

The dispersion relations, frequency distribution function and specific heat of zinc blende have been calculated using Houston's method on (1) A short range force (S. R.) model of the type employed in diamond by Smith and (2) A long range model assuming an effective charge Ze on the ions. Since the elastic constant data on ZnS are not in agreement with one another the following values were used in these calculations: {Mathematical expression}. As compared to the results on the S. R. model, the Coulomb force causes 1. A splitting of the optical branches at (000) and a larger dispersion of these branches; 2. A rise in the acoustic frequency branches the effect being predominant in a transverse acoustic branch along [110]; 3. A bridging of the gap of forbidden frequencies in the S. R. model; 4. A reduction of the moments of the frequency distribution function and 5. A flattening of the Θ- T curve. By plotting (Θ/Θ0) vs. T., the experimental data of Martin and Clusius and Harteck are found to be in perfect coincidence with the curve for the short range model. The values of the elastic constants deduced from the ratio Θ0 (Theor)/Θ0 (Expt) agree with those of Prince and Wooster. This is surprising as several lines of evidence indicate that the bond in zinc blende is partly covalent and partly ionic. The conclusion is inescapable that the effective charge in ZnS is a function of the wave vector {Mathematical expression}.

Bilateral smoothing of gradient vector field and application to image segmentation

Medical image segmentation finds application in computer-aided diagnosis, computer-guided surgery, measuring tissue volumes, locating tumors, and pathologies. One approach to segmentation is to use active contours or snakes. Active contours start from an initialization (often manually specified) and are guided by image-dependent forces to the object boundary. Snakes may also be guided by gradient vector fields associated with an image. The first main result in this direction is that of Xu and Prince, who proposed the notion of gradient vector flow (GVF), which is computed iteratively. We propose a new formalism to compute the vector flow based on the notion of bilateral filtering of the gradient field associated with the edge map - we refer to it as the bilateral vector flow (BVF). The range kernel definition that we employ is different from the one employed in the standard Gaussian bilateral filter. The advantage of the BVF formalism is that smooth gradient vector flow fields with enhanced edge information can be computed noniteratively. The quality of image segmentation turned out to be on par with that obtained using the GVF and in some cases better than the GVF.

On piercing (pseudo)lines and boxes

We say a family of geometric objects C has (l;k)-property if every subfamily C0C of cardinality at most lisk- piercable. In this paper we investigate the existence of g(k;d)such that if any family of objects C in Rd has the (g(k;d);k)-property, then C is k-piercable. Danzer and Gr̈ unbaum showed that g(k;d)is infinite for fami-lies of boxes and translates of centrally symmetric convex hexagons. In this paper we show that any family of pseudo-lines(lines) with (k2+k+ 1;k)-property is k-piercable and extend this result to certain families of objects with discrete intersections. This is the first positive result for arbitrary k for a general family of objects. We also pose a relaxed ver-sion of the above question and show that any family of boxes in Rd with (k2d;k)-property is 2dk- piercable.

Hardness results for computing optimal locally Gabriel graphs

Delaunay and Gabriel graphs are widely studied geo-metric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Lo-cally Gabriel Graphs (LGGs) have been proposed. We propose another generalization of LGGs called Gener-alized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily in-cluded or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge max-imum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G= (V, E) is a valid LGG.

Electronic structure origin of conductivity and oxygen reduction activity changes in low-level Cr-substituted (La, Sr)MnO3

The electronic structure of the (La0.8Sr0.2)(0.98)Mn1-xCrxO3 model series (x = 0, 0.05, or 0.1) was measured using soft X-ray synchrotron radiation at room and elevated temperature. O K-edge near-edge X-ray absorption fine structure (NEXAFS) spectra showed that low-level chromium substitution of (La, Sr)MnO3 resulted in lowered hybridisation between O 2p orbitals and M 3d and M 4sp valance orbitals. Mn L-3-edge resonant photoemission spectroscopy measurements indicated lowered Mn 3d-O 2p hybridisation with chromium substitution. Deconvolution of O K-edge NEXAFS spectra took into account the effects of exchange and crystal field splitting and included a novel approach whereby the pre-peak region was described using the nominally filled t(2g) up arrow state. 10% chromium substitution resulted in a 0.17 eV lowering in the energy of the t(2g) up arrow state, which appears to provide an explanation for the 0.15 eV rise in activation energy for the oxygen reduction reaction, while decreased overlap between hybrid O 2p-Mn 3d states was in qualitative agreement with lowered electronic conductivity. An orbital-level understanding of the thermodynamically predicted solid oxide fuel cell cathode poisoning mechanism involving low-level chromium substitution on the B-site of (La, Sr)MnO3 is presented. (C) 2015 AIP Publishing LLC.