Nonresonant edge slot antenna for phased array applications: Theory and experiment

The design and development of nonresonant edge slot antenna for phased array applications has been presented. The radiating element is a slot cut on the narrow wall of rectangular waveguide (edge slot). The admittance characteristics of the edge slot have been rigorously studied using a novel hybrid method. Nonresonant arrays have been fabricated using the present slot characterization data and the earlier published data. The experimentally measured electrical characteristics of the antenna are presented which clearly brings out the accuracy of the present method.

Estimation of elasticity map of soft biological tissue mimicking phantom using laser speckle contrast analysis

Scattering of coherent light from scattering particles causes phase shift to the scattered light. The interference of unscattered and scattered light causes the formation of speckles. When the scattering particles, under the influence of an ultrasound (US) pressure wave, vibrate, the phase shift fluctuates, thereby causing fluctuation in speckle intensity. We use the laser speckle contrast analysis (LSCA) to reconstruct a map of the elastic property (Young's modulus) of soft tissue-mimicking phantom. The displacement of the scatters is inversely related to the Young's modulus of the medium. The elastic properties of soft biological tissues vary, many fold with malignancy. The experimental results show that laser speckle contrast (LSC) is very sensitive to the pathological changes in a soft tissue medium. The experiments are carried out on a phantom with two cylindrical inclusions of sizes 6 mm in diameter, separated by 8 mm between them. Three samples are made. One inclusion has Young's modulus E of 40 kPa. The second inclusion has either a Young's modulus E of 20 kPa, or scattering coefficient of mu'(s), = 3.00 mm(-1) or absorption coefficient of mu(a) = 0.03 mm(-1). The optical absorption (mu(a)), reduced scattering (mu'(s)) coefficient, and the Young's modulus of the background are mu(a) = 0.01 mm(-1), mu'(s) = 1.00 mm(-1) and 12kPa, respectively. The experiments are carried out on all three phantoms. On a phantom with two inclusions of Young's modulus of 20 and 40 kPa, the measured relative speckle image contrasts are 36.55% and 63.72%, respectively. Experiments are repeated on phantoms with inclusions of mu(a) = 0.03 mm-1, E = 40 kPa and mu'(s) = 3.00 mm(-1). The results show that it is possible to detect inclusions with contrasts in optical absorption, optical scattering, and Young's modulus. Studies of the variation of laser speckle contrast with ultrasound driving force for various values of mu(a), mu'(s), and Young's modulus of the tissue mimicking medium are also carried out. (C) 2011 American Institute of Physics. doi:10.1063/1.3592352]

PRUNE and PROBE-two modular web services for protein-protein docking

The protein-protein docking programs typically perform four major tasks: (i) generation of docking poses, (ii) selecting a subset of poses, (iii) their structural refinement and (iv) scoring, ranking for the final assessment of the true quaternary structure. Although the tasks can be integrated or performed in a serial order, they are by nature modular, allowing an opportunity to substitute one algorithm with another. We have implemented two modular web services, (i) PRUNE: to select a subset of docking poses generated during sampling search (http://pallab.serc.iisc.ernet.in/prune) and (ii) PROBE: to refine, score and rank them (http://pallab.serc.iisc.ernet.in/probe). The former uses a new interface area based edge-scoring function to eliminate > 95% of the poses generated during docking search. In contrast to other multi-parameter-based screening functions, this single parameter based elimination reduces the computational time significantly, in addition to increasing the chances of selecting native-like models in the top rank list. The PROBE server performs ranking of pruned poses, after structure refinement and scoring using a regression model for geometric compatibility, and normalized interaction energy. While web-service similar to PROBE is infrequent, no web-service akin to PRUNE has been described before. Both the servers are publicly accessible and free for use.

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

High contrast imaging and thickness determination of graphene with in-column secondary electron microscopy

We report a new method for quantitative estimation of graphene layer thicknesses using high contrast imaging of graphene films on insulating substrates with a scanning electron microscope. By detecting the attenuation of secondary electrons emitted from the substrate with an in-column low-energy electron detector, we have achieved very high thickness-dependent contrast that allows quantitative estimation of thickness up to several graphene layers. The nanometer scale spatial resolution of the electron micrographs also allows a simple structural characterization scheme for graphene, which has been applied to identify faults, wrinkles, voids, and patches of multilayer growth in large-area chemical vapor deposited graphene. We have discussed the factors, such as differential surface charging and electron beam induced current, that affect the contrast of graphene images in detail. (C) 2011 American Institute of Physics. doi:10.1063/1.3608062]

Anomalous Temperature dependence of Fermi-edge Singularity in Modulation-doped AlGaAs/InGaAs/GaAs hetero-structures

The temperature and power dependence of Fermi-edge singularity (FES) in high-density two-dimensional electron gas, specific to pseudomorphic AlxGa1-xAs/InyGa1-yAs/GaAs heterostructures is studied by photoluminescence (PL). In all these structures, there are two prominent transitions E11 and E21 considered to be the result of electron-hole recombination from first and second electron sub-bands with that of first heavy-hole sub-band. FES is observed approximately 5 -10 meV below the E21 transition. At 4.2 K, FES appears as a lower energy shoulder to the E21 transition. The PL intensity of all the three transitions E11, FES and E21 grows linearly with excitation power. However, we observe anomalous behavior of FES with temperature. While PL intensity of E11 and E21 decrease with increasing temperature, FES transition becomes stronger initially and then quenches-off slowly (till 40K). Though it appears as a distinct peak at about 20 K, its maximum is around 7 - 13 K.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Alloying induced degradation of the absorption edge of InAsxSb1-x

InAsxSb1−x alloys show a strong bowing in the energy gap, the energy gap of the alloy can be less than the gap of the two parent compounds. The authors demonstrate that a consequence of this alloying is a systematic degradation in the sharpness of the absorption edge. The alloy disorder induced band-tail (Urbach tail) characteristics are quantitatively studied for InAs0.05Sb0.95.

Microscopic study of the 2/5 fractional quantum Hall edge

This paper reports on our study of the edge of the 2/5 fractional quantum Hall state, which is more complicated than the edge of the 1/3 state because of the presence of edge sectors corresponding to different partitions of composite fermions in the lowest two Lambda levels. The addition of an electron at the edge is a nonperturbative process and it is not a priori obvious in what manner the added electron distributes itself over these sectors. We show, from a microscopic calculation, that when an electron is added at the edge of the ground state in the [N(1), N(2)] sector, where N(1) and N(2) are the numbers of composite fermions in the lowest two Lambda levels, the resulting state lies in either [N(1) + 1, N(2)] or [N(1), N(2) + 1] sectors; adding an electron at the edge is thus equivalent to adding a composite fermion at the edge. The coupling to other sectors of the form [N(1) + 1 + k, N(2) - k], k integer, is negligible in the asymptotically low-energy limit. This study also allows a detailed comparison with the two-boson model of the 2/5 edge. We compute the spectral weights and find that while the individual spectral weights are complicated and nonuniversal, their sum is consistent with an effective two-boson description of the 2/5 edge.

Acyclic edge coloring of 2-degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). A graph is called 2-degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2-degenerate graphs properly contains seriesparallel graphs, outerplanar graphs, non - regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G)<=Delta + 2, where Delta = Delta(G) denotes the maximum degree of the graph. We prove the conjecture for 2-degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2-degenerate graph with maximum degree ?, then a'(G)<=Delta + 1. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 68:1-27, 2011

XPS and x-ray absorption-edge studies of the surface and bulk valence states of cerium in ceco2

XPS and LIII X-ray absorption edge studies regarding the valence state of cerium have been carried out on the intermetallic compounds CeCo2, which becomes superconducting at low temperatures. It is observed from XPS that the surface shows both Ce3+ and Ce4+ valence states, while the X-ray absorption edge studies reveal only Ce4+ in the bulk. Thus valence fluctuation and superconductivity do not coexist in the bulk of this compound.