Effect of the Edge Type and Strain on the Structural, Electronic and Magnetic Properties of the BNRs

We present the effect of edge structures on the edge energy and stress of BN nanoribbons. Ab initio density functional calculations show that the armchair edge is lower in energy than the zigzag edge by 0.43 eV/angstrom. Both types of the edges are under the compressive stress. The zigzag edges are mechanically more stable than the armchair edges. Based on the calculated edge energies, the equilibrium shape of the BN flakes are found to be regular hexagonal, and dominated by the armchair edges. The zigzag ribbons are found to be half-metallic, whereas the armchair ribbons are semiconducting.

Mesh Simplification Based on Edge Collapsing Could Improve Computational Efficiency in Near Infrared Optical Tomographic Imaging

The diffusion equation-based modeling of near infrared light propagation in tissue is achieved by using finite-element mesh for imaging real-tissue types, such as breast and brain. The finite-element mesh size (number of nodes) dictates the parameter space in the optical tomographic imaging. Most commonly used finite-element meshing algorithms do not provide the flexibility of distinct nodal spacing in different regions of imaging domain to take the sensitivity of the problem into consideration. This study aims to present a computationally efficient mesh simplification method that can be used as a preprocessing step to iterative image reconstruction, where the finite-element mesh is simplified by using an edge collapsing algorithm to reduce the parameter space at regions where the sensitivity of the problem is relatively low. It is shown, using simulations and experimental phantom data for simple meshes/domains, that a significant reduction in parameter space could be achieved without compromising on the reconstructed image quality. The maximum errors observed by using the simplified meshes were less than 0.27% in the forward problem and 5% for inverse problem.

Acyclic Edge Coloring of Triangle-Free Planar 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). It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G) ? ? + 2, where ? = ?(G) denotes the maximum degree of the graph. If every induced subgraph H of G satisfies the condition |E(H)| ? 2|V(H)|-1, we say that the graph G satisfies Property A. In this article, we prove that if G satisfies Property A, then a'(G) ? ? + 3. Triangle-free planar graphs satisfy Property A. We infer that a'(G) ? ? + 3, if G is a triangle-free planar graph. Another class of graph which satisfies Property A is 2-fold graphs (union of two forests). (C) 2011 Wiley Periodicals, Inc. J Graph Theory

Adsorption on Edge-Functionalized Bilayer Graphene Nanoribbons: Assessing the Role of Functional Groups in Methane Uptake

A combination of ab initio and classical Monte Carlo simulations is used to investigate the effects of functional groups on methane binding. Using Moller-Plesset (MP2) calculations, we obtain the binding energies for benzene functionalized with NH2, OH, CH3, COOH, and H2PO3 and identify the methane binding sites. In all cases, the preferred binding sites are located above the benzene plane in the vicinity of the benzene carbon atom attached to the functional group. Functional groups enhance methane binding relative to benzene (-6.39 kJ/mol), with the largest enhancement observed for H2PO3 (-8.37 kJ/mol) followed by COOH and CH3 (-7.77 kJ/mol). Adsorption isotherms are obtained for edge-functionalized bilayer graphene nanoribbons using grand canonical Monte Carlo simulations with a five-site methane model. Adsorbed excess and heats of adsorption for pressures up to 40 bar and 298 K are obtained with functional group concentrations ranging from 3.125 to 6.25 mol 96 for graphene edges functionalized with OH, NH2, and COOH. The functional groups are found to act as preferred adsorption sites, and in the case of COOH the local methane density in the vicinity of the functional group is found to exceed that of bare graphene. The largest enhancement of 44.5% in the methane excess adsorbed is observed for COOH-functionalized nanoribbons when compared to H terminated ribbons. The corresponding enhancements for OH- and NH2-functionalized ribbons are 10.5% and 3.7%, respectively. The excess adsorption across functional groups reflects the trends observed in the binding energies from MP2 calculations. Our study reveals that specific site functionalization can have a significant effect on the local adsorption characteristics and can be used as a design strategy to tailor materials with enhanced methane storage capacity.

SURE-FAST BILATERAL FILTERS

Edge-preserving smoothing is widely used in image processing and bilateral filtering is one way to achieve it. Bilateral filter is a nonlinear combination of domain and range filters. Implementing the classical bilateral filter is computationally intensive, owing to the nonlinearity of the range filter. In the standard form, the domain and range filters are Gaussian functions and the performance depends on the choice of the filter parameters. Recently, a constant time implementation of the bilateral filter has been proposed based on raisedcosine approximation to the Gaussian to facilitate fast implementation of the bilateral filter. We address the problem of determining the optimal parameters for raised-cosine-based constant time implementation of the bilateral filter. To determine the optimal parameters, we propose the use of Stein's unbiased risk estimator (SURE). The fast bilateral filter accelerates the search for optimal parameters by faster optimization of the SURE cost. Experimental results show that the SURE-optimal raised-cosine-based bilateral filter has nearly the same performance as the SURE-optimal standard Gaussian bilateral filter and the Oracle mean squared error (MSE)-based optimal bilateral filter.

Optimal parameter selection for bilateral filters using Poisson unbiased risk estimate

Bilateral filters perform edge-preserving smoothing and are widely used for image denoising. The denoising performance is sensitive to the choice of the bilateral filter parameters. We propose an optimal parameter selection for bilateral filtering of images corrupted with Poisson noise. We employ the Poisson's Unbiased Risk Estimate (PURE), which is an unbiased estimate of the Mean Squared Error (MSE). It does not require a priori knowledge of the ground truth and is useful in practical scenarios where there is no access to the original image. Experimental results show that quality of denoising obtained with PURE-optimal bilateral filters is almost indistinguishable with that of the Oracle-MSE-optimal bilateral filters.

Design and analysis of novel compression fracture specimen with constant form factor: Edge cracked semicircular disk (ECSD)

Inspired by the Brazilian disk geometry we examine the utility of an edge cracked semicircular disk (ECSD) specimen for rapid assessment of fracture toughness of brittle materials using compressive loading. It is desirable to optimize the geometry towards a constant form factor F for evaluating K-I. In this investigation photoelastic and finite element results for K-I evaluation highlight the effect of loading modeled using a Hertzian. A Hertzian loading subtending 4 degrees at the center leads to a surprisingly constant form factor of 1.36. This special case is further analyzed by applying uniform pressure over a chord for facilitating testing.

BILATERAL EDGE DETECTORS

We propose to employ bilateral filters to solve the problem of edge detection. The proposed methodology presents an efficient and noise robust method for detecting edges. Classical bilateral filters smooth images without distorting edges. In this paper, we modify the bilateral filter to perform edge detection, which is the opposite of bilateral smoothing. The Gaussian domain kernel of the bilateral filter is replaced with an edge detection mask, and Gaussian range kernel is replaced with an inverted Gaussian kernel. The modified range kernel serves to emphasize dissimilar regions. The resulting approach effectively adapts the detection mask according as the pixel intensity differences. The results of the proposed algorithm are compared with those of standard edge detection masks. Comparisons of the bilateral edge detector with Canny edge detection algorithm, both after non-maximal suppression, are also provided. The results of our technique are observed to be better and noise-robust than those offered by methods employing masks alone, and are also comparable to the results from Canny edge detector, outperforming it in certain cases.

A Harmonic Suppression Scheme for Open-End Winding Split-Phase IM Drive Using Capacitive Filters for the Full Speed Range

Voltage source inverter (VSI)-fed six-phase induction motor (IM) drives have high 6n +/- 1, n = odd-order harmonic currents. This is because these currents, driven by the corresponding harmonic voltages in the inverter output, are limited only by the stator leakage impedance, as these harmonics are absent in the back electromotive force of the motor. To suppress the harmonic currents, either bulky inductive harmonic filters or complex pulsewidth modulation (PWM) techniques have to be used. This paper proposes a harmonic elimination scheme using switched capacitor filters for a VSI-fed split-phase IM drive. Two 3-phase inverters fed from capacitors are used on the open-end side of the motor to suppress 6n +/- 1, n = odd-order harmonics. A PWM scheme that can suppress the harmonics as well as balance the capacitor voltage is also proposed. The capacitor fed inverters are switched so that the fundamental voltage is not affected, and the fundamental power is always drawn from the main inverters. The proposed scheme is verified with a detailed experimental study. The effectiveness of the scheme is demonstrated by comparing the results with those obtained by disabling the capacitor fed inverters.

Kinetically stabilized C-60-toluene solvate nanostructures with a discrete absorption edge enabling supramolecular topotactic molecular exchange

Nanosized fullerene solvates have attracted widespread research attention due to recent interesting discoveries. A particular type of solvate is limited to a fixed number of solvents and designing new solvates within the same family is a fundamental challenge. Here we demonstrate that the hexagonal closed packed (HCP) phase of C-60 solvates, formed with m-xylene, can also be stabilized using toluene. Contrary to the notion on their instability, these can be stabilized from minutes up to months by tuning the occupancy of solvent molecules. Due to high stability, we could record their absorption edge, and measure excitonic life-time, which has not been reported for any C-60 solvate. Despite being solid, absorbance spectrum of the solvates is similar in appearance to that of C-60 in solution. A new absorption band appears at 673 nm. The fluorescence lifetime at 760 nm is similar to 1.2 ns, suggesting an excited state unaffected by solvent-C-60 interaction. Finally, we utilized the unstable set of HCP solvates to exchange with a second solvent by a topotactic exchange mechanism, which rendered near permanent stability to the otherwise few minutes stable solvates. This is also the first example of topotactic exchange in supramolecular crystal, which is widely known in ionic solids. (C) 2014 Elsevier Ltd. All rights reserved.

Majorana edge modes in the Kitaev model

We study the Majorana modes, both equilibrium and Floquet, which can appear at the edges of the Kitaev model on the honeycomb lattice. We first present the analytical solutions known for the equilibrium Majorana edge modes for both zigzag and armchair edges of a semi-infinite Kitaev model and chart the parameter regimes in which they appear. We then examine how edge modes can be generated if the Kitaev coupling on the bonds perpendicular to the edge is varied periodically in time as periodic delta-function kicks. We derive a general condition for the appearance and disappearance of the Floquet edge modes as a function of the drive frequency for a generic d-dimensional integrable system. We confirm this general condition for the Kitaev model with a finite width by mapping it to a one-dimensional model. Our numerical and analytical study of this problem shows that Floquet Majorana modes can appear on some edges in the kicked system even when the corresponding equilibrium Hamiltonian has no Majorana mode solutions on those edges. We support our analytical studies by numerics for a finite sized system which show that periodic kicks can generate modes at the edges and the corners of the lattice.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

Rainbow matchings in strongly edge-colored graphs

A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G). Wang (2011) asked whether there exists a function f such that a properly edge-colored graph G with at least f (delta(G)) vertices is guaranteed to contain a rainbow matching of size delta(G). This was answered in the affirmative later: the best currently known function Lo and Tan (2014) is f(k) = 4k - 4, for k >= 4 and f (k) = 4k - 3, for k <= 3. Afterwards, the research was focused on finding lower bounds for the size of maximum rainbow matchings in properly edge-colored graphs with fewer than 4 delta(G) - 4 vertices. Strong edge-coloring of a graph G is a restriction of proper edge-coloring where every color class is required to be an induced matching, instead of just being a matching. In this paper, we give lower bounds for the size of a maximum rainbow matching in a strongly edge-colored graph Gin terms of delta(G). We show that for a strongly edge-colored graph G, if |V(G)| >= 2 |3 delta(G)/4|, then G has a rainbow matching of size |3 delta(G)/4|, and if |V(G)| < 2 |3 delta(G)/4|, then G has a rainbow matching of size |V(G)|/2] In addition, we prove that if G is a strongly edge-colored graph that is triangle-free, then it contains a rainbow matching of size at least delta(G). (C) 2015 Elsevier B.V. All rights reserved.

Edge states, spin transport, and impurity-induced local density of states in spin-orbit coupled graphene

We study graphene, which has both spin-orbit coupling (SOC), taken to be of the Kane-Mele form, and a Zeeman field induced due to proximity to a ferromagnetic material. We show that a zigzag interface of graphene having SOC with its pristine counterpart hosts robust chiral edge modes in spite of the gapless nature of the pristine graphene; such modes do not occur for armchair interfaces. Next we study the change in the local density of states (LDOS) due to the presence of an impurity in graphene with SOC and Zeeman field, and demonstrate that the Fourier transform of the LDOS close to the Dirac points can act as a measure of the strength of the spin-orbit coupling; in addition, for a specific distribution of impurity atoms, the LDOS is controlled by a destructive interference effect of graphene electrons which is a direct consequence of their Dirac nature. Finally, we study transport across junctions, which separates spin-orbit coupled graphene with Kane-Mele and Rashba terms from pristine graphene both in the presence and absence of a Zeeman field. We demonstrate that such junctions are generally spin active, namely, they can rotate the spin so that an incident electron that is spin polarized along some direction has a finite probability of being transmitted with the opposite spin. This leads to a finite, electrically controllable, spin current in such graphene junctions. We discuss possible experiments that can probe our theoretical predictions.