Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

Wavelet transform based error concealment approach for image denoising

Denoising of images in compressed wavelet domain has potential application in transmission technology such as mobile communication. In this paper, we present a new image denoising scheme based on restoration of bit-planes of wavelet coefficients in compressed domain. It exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each band. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with conventional unrestored scheme, in context of error reduction and has capability to adapt to situations where noise level in the image varies. The applicability of the proposed approach has implications in restoration of images due to noisy channels. This scheme, in addition, to being very flexible, tries to retain all the features, including edges of the image. The proposed scheme is computationally efficient.

Limit Analysis of Slabs with Free Edge

The general method earlier developed by the writers for obtaining valid lower bound solutions to slabs under uniformly distributed load and supported along all edges is extended to the slabs with a free edge. Lower bound solutions with normal moment criterion are presented for six cases of orthotropically reinforced slabs, with one of the short edges being free and the other three edges being any combination of fixed and simply supported conditions. The expressions for moment field and collapse load are given for each slab. The lower bounds have been compared with the corresponding upper bound values obtained from the yield line theory with simple straight yield line modes of failure. They are also compared with Nielsen’s solutions available for two cases with isotropic reinforcement.

Local structure and magneto-transport in Sr2FeMoO6 oxides

Double perovskite oxides Sr2FeMoO6 have attracted a great interest for their peculiar magneto-transport properties, and, ill particular, for the large values of low-field magneto-resistance (MR) which remains elevated even at room temperature, thanks to their high Curie temperature (T-c > 400 K). These properties are strongly influenced by chemical cation disorder, that is by the relative arrangement of Fe and Mo on their sublattices: the regular alternation of Fe and Mo enhances the M R and saturation magnetization. On the contrary the disorder generally depresses the magnetization and worsen the MR response. In this work the X-ray absorption fine structure (XAFS) technique has been employed in order to probe the cation order from a local point of view. XAFS spectra were collected at the Fe and Mo K edges on Sr2FeMoO6 samples with different degree of long-range chemical order. The XAFS results prove that a high degree of short-range cation order is preserved, despite the different long-range order: the Fe-Mo correlations are always preferred over the Fe-Fe and Mo-Mo ones in the perfectly ordered as well as in highly disordered samples.

Multiple contour extraction from graylevel images using an artificial neural network

For active contour modeling (ACM), we propose a novel self-organizing map (SOM)-based approach, called the batch-SOM (BSOM), that attempts to integrate the advantages of SOM- and snake-based ACMs in order to extract the desired contours from images. We employ feature points, in the form of ail edge-map (as obtained from a standard edge-detection operation), to guide the contour (as in the case of SOM-based ACMs) along with the gradient and intensity variations in a local region to ensure that the contour does not "leak" into the object boundary in case of faulty feature points (weak or broken edges). In contrast with the snake-based ACMs, however, we do not use an explicit energy functional (based on gradient or intensity) for controlling the contour movement. We extend the BSOM to handle extraction of contours of multiple objects, by splitting a single contour into as many subcontours as the objects in the image. The BSOM and its extended version are tested on synthetic binary and gray-level images with both single and multiple objects. We also demonstrate the efficacy of the BSOM on images of objects having both convex and nonconvex boundaries. The results demonstrate the superiority of the BSOM over others. Finally, we analyze the limitations of the BSOM.

Analysis of edge delaminations in laminates through combined use of quasi-three-dimensional, eight-noded, two-noded and transition elements

The use of appropriate finite elements in different regions of a stressed solid can be expected to be economical in computing its stress response. This concept is exploited here in studying stresses near free edges in laminated coupons. The well known free edge problem of [0/90], symmetric laminate is considered to illustrate the application of the concept. The laminate is modelled as a combination of three distinct regions. Quasi-three-dimensional eight-noded quadrilateral isoparametric elements (Q3D8) are used at and near the free edge of the laminate and two-noded line elements (Q3D2) are used in the region away from the free edge. A transition element (Q3DT) provides a smooth inter-phase zone between the two regions. Significant reduction in the problem size and hence in the computational time and cost have been achieved at almost no loss of accuracy.

A note on transient photocurrents at semiconductor electrodes

The imprint of the changing surface concentration of minority carriers in photocurrent transients is marginalized in “switch off” transients as compared to “switch on” transients. When the surface level is situated close to either one of the band edges, it is shown that in principle it must be possible to obtain the energy of the surface level from “switch off” transients.The time constants for the “switch on” and “switch off” cases behave differently with potential. While in “switch off”, transient plots, the magnitude of the slope decreases monotonically with increasing band bending potentials; for the “switch on” however, though it decreases and is identical to “switch off” initially, beyond a certain increase in potential the magnitude of the slope shows an increase.

Surface recombination at semiconductor electrodes: a single level study

The recombination and the faradaic fluxes are shown to be sensitive to the location of a single level recombination center, when it is located near the band edges. As the surface level is shifted deeper into the band gap from either of the band edges, the back emission terms are dominated by electron capture and hole capture terms, and the occupancy of the surface level is no longer determined by its location in the band gap. However, when one of the back emission terms determines the surface state occupancy, it is shown that there exists a simple relation between the value of the surface level and the recombination and the faradaic fluxes respectively. Expressions to this effect are derived and verified in the case of the recombination flux, which characterized by the potential at which it attains its maximum value. For the faradaic flux the results are qualitative.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

A Smooth Finite Element Method Based on Reproducing Kernel DMS-Splines

The element-based piecewise smooth functional approximation in the conventional finite element method (FEM) results in discontinuous first and higher order derivatives across element boundaries Despite the significant advantages of the FEM in modelling complicated geometries, a motivation in developing mesh-free methods has been the ease with which higher order globally smooth shape functions can be derived via the reproduction of polynomials There is thus a case for combining these advantages in a so-called hybrid scheme or a `smooth FEM' that, whilst retaining the popular mesh-based discretization, obtains shape functions with uniform C-p (p >= 1) continuity One such recent attempt, a NURBS based parametric bridging method (Shaw et al 2008b), uses polynomial reproducing, tensor-product non-uniform rational B-splines (NURBS) over a typical FE mesh and relies upon a (possibly piecewise) bijective geometric map between the physical domain and a rectangular (cuboidal) parametric domain The present work aims at a significant extension and improvement of this concept by replacing NURBS with DMS-splines (say, of degree n > 0) that are defined over triangles and provide Cn-1 continuity across the triangle edges This relieves the need for a geometric map that could precipitate ill-conditioning of the discretized equations Delaunay triangulation is used to discretize the physical domain and shape functions are constructed via the polynomial reproduction condition, which quite remarkably relieves the solution of its sensitive dependence on the selected knotsets Derivatives of shape functions are also constructed based on the principle of reproduction of derivatives of polynomials (Shaw and Roy 2008a) Within the present scheme, the triangles also serve as background integration cells in weak formulations thereby overcoming non-conformability issues Numerical examples involving the evaluation of derivatives of targeted functions up to the fourth order and applications of the method to a few boundary value problems of general interest in solid mechanics over (non-simply connected) bounded domains in 2D are presented towards the end of the paper

Five-fold quasiperiodic tilings generated by inflated rhombuses with identical boundaries: possible application to the growth of quasicrystals

In order to generate normal Penrose tilings by inflation/deflation, decisions have to be made regarding the matching of the rhombuses/tilings with their neighbours. We show here that this decision-making problem can be avoided by adopting a deflation/inflation procedure which uses the decorated rhombuses with identical boundaries. The procedure enables both kinds of inflated rhombuses to match in any orientation along their edges. The tilings so generated are quasiperiodic. These structures appear to have a close relationship with the growth mechanism of quasicrystals.

Ultimate Strength of RC Wall Panels with Openings

Test results of 12 reinforced concrete (RC) wall panels with openings are presented. The panels have been subjected to in-plane vertical loads applied at an eccentricity to represent possible accidental eccentricity that occurs in practice due to constructional imperfections. The 12 specimens consist of two identical groups of six panels each. One group of panels is tested in one-way in-plane action (i.e., supported at top and bottom edges against lateral displacement). The second group of panels is tested in two-way in-plane action (i.e., supported on all the four edges against lateral displacement). Openings in the panels represent typical door and window openings. Cracking loads, ultimate loads, crack patterns, and lateral deflections of the panels are studied. Empirical methods have been developed for the prediction of ultimate load. Also, lateral deflections, cracking loads, and ultimate loads of identical loads tested under one-way and two-way action are compared.

Dislocation characterization in crystals of potash alum grown by seeded solution growth under conditions of low supersaturation

An analysis has been carried out of the genesis and character of growth dislocations present in all growth sectors of single crystals of potash alum. The crystals, grown from seeded solutions by the temperature lowering method under conditions of low supersaturation, presented the well-developed forms: {111} dominant, {100} and {110}. Growth dislocations formed predominately during refacetting of the edges and corners of the seed, rounded during preparation and insertion into the supersaturated solution. From here they become refracted into the {111} sectors which proved to be the most defective. Smaller numbers of dislocations form at the {111}, {100} and {110} seed interfaces and propagate in these sectors. In crystals of inferior quality, a number of inclusions were found predominantly in the fast growing {100} sectors which become the source of additional dislocations. Dislocations present in the original seed did not propagate across the interface into the developing crystal. Dislocations of all characters were observed. The principal Burgers vectors were found to be left angle bracket100right-pointing angle bracket, left angle bracket110right-pointing angle bracket and left angle bracket111right-pointing angle bracket.

Armchair or Zigzag? A tool for characterizing graphene edge

Electronic, magnetic, and structural properties of graphene flakes depend sensitively upon the type of edge atoms. We present a simple software tool for determining the type of edge atoms in a honeycomb lattice. The algorithm is based on nearest neighbor counting. Whether an edge atom is of armchair or zigzag type is decided by the unique pattern of its nearest neighbors. Particular attention is paid to the practical aspects of using the tool, as additional features such as extracting out the edges from the lattice could help in analyzing images from transmission microscopy or other experimental probes. Ultimately, the tool in combination with density-functional theory or tight-binding method can also be helpful in correlating the properties of graphene flakes with the different armchair-to-zigzag ratios. Program summary Program title: edgecount Catalogue identifier: AEIA_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEIA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 66685 No. of bytes in distributed program, including test data, etc.: 485 381 Distribution format: tar.gz Programming language: FORTRAN 90/95 Computer: Most UNIX-based platforms Operating system: Linux, Mac OS Classification: 16.1, 7.8 Nature of problem: Detection and classification of edge atoms in a finite patch of honeycomb lattice. Solution method: Build nearest neighbor (NN) list; assign types to edge atoms on the basis of their NN pattern. Running time: Typically similar to second(s) for all examples. (C) 2010 Elsevier B.V. All rights reserved.

Paleoseismological evidence of surface faulting along the northeastern Himalayan front, India: Timing, size, and spatial extent of great earthquakes

The similar to 2500 km long Himalayan arc has experienced three large to great earthquakes of M-w 7.8 to 8.4 during the past century, but none produced surface rupture. Paleoseismic studies have been conducted during the last decade to begin understanding the timing, size, rupture extent, return period, and mechanics of the faulting associated with the occurrence of large surface rupturing earthquakes along the similar to 2500 km long Himalayan Frontal Thrust (HFT) system of India and Nepal. The previous studies have been limited to about nine sites along the western two-thirds of the HFT extending through northwest India and along the southern border of Nepal. We present here the results of paleoseismic investigations at three additional sites further to the northeast along the HFT within the Indian states of West Bengal and Assam. The three sites reside between the meizoseismal areas of the 1934 Bihar-Nepal and 1950 Assam earthquakes. The two westernmost of the sites, near the village of Chalsa and near the Nameri Tiger Preserve, show that offsets during the last surface rupture event were at minimum of about 14 m and 12 m, respectively. Limits on the ages of surface rupture at Chalsa (site A) and Nameri (site B), though broad, allow the possibility that the two sites record the same great historical rupture reported in Nepal around A.D. 1100. The correlation between the two sites is supported by the observation that the large displacements as recorded at Chalsa and Nameri would most likely be associated with rupture lengths of hundreds of kilometers or more and are on the same order as reported for a surface rupture earthquake reported in Nepal around A.D. 1100. Assuming the offsets observed at Chalsa and Nameri occurred synchronously with reported offsets in Nepal, the rupture length of the event would approach 700 to 800 km. The easternmost site is located within Harmutty Tea Estate (site C) at the edges of the 1950 Assam earthquake meizoseismal area. Here the most recent event offset is relatively much smaller (<2.5 m), and radiocarbon dating shows it to have occurred after A.D. 1100 (after about A.D. 1270). The location of the site near the edge of the meizoseismal region of the 1950 Assam earthquake and the relatively lesser offset allows speculation that the displacement records the 1950 M-w 8.4 Assam earthquake. Scatter in radiocarbon ages on detrital charcoal has not resulted in a firm bracket on the timing of events observed in the trenches. Nonetheless, the observations collected here, when taken together, suggest that the largest of thrust earthquakes along the Himalayan arc have rupture lengths and displacements of similar scale to the largest that have occurred historically along the world's subduction zones.