Real-time monitoring of critical nodes with minimal number of Phasor Measurement Units

This paper presents a method for placement of Phasor Measurement Units, ensuring the monitoring of vulnerable buses which are obtained based on transient stability analysis of the overall system. Real-time monitoring of phase angles across different nodes, which indicates the proximity to instability, the very purpose will be well defined if the PMUs are placed at buses which are more vulnerable. The issue is to identify the key buses where the PMUs should be placed when the transient stability prediction is taken into account considering various disturbances. Integer Linear Programming technique with equality and inequality constraints is used to find out the optimal placement set with key buses identified from transient stability analysis. Results on IEEE-14 bus system are presented to illustrate the proposed approach.

Measurement of effective permeability of reinforcement mats using sensitivity analysis

A methodology using sensitivity analysis is proposed to measure the effective permeability which includes the interaction of the resin and the reinforcement. Initially, mold-filling experiments were performed at isothermal conditions on the test specimen and the positions of the flow front were tracked with time using a flow visualization method. Following this, mold-filling experiments were simulated using a commercial software to obtain the positions of the flow front with time at the process conditions used for experiments. Several iterations were performed using different trial values of the permeability until the experimentally tracked and simulated positions of the flow front with time were matched. Finally, the value of the permeability thus obtained was validated by comparing the positions obtained by performing the experiments at different process conditions with the positions obtained by simulating the experiments. In this study, woven roving and chopped strand mats of E-class glass fiber and unsaturated polyester resin were used for the experiments. From the results, it was found that the measured permeabilities were consistent with varying process conditions. POLYM. COMPOS., 2012. (c) 2012 Society of Plastics Engineers

Prior image-constrained l(1)-norm-based reconstruction method for effective usage of structural information in diffuse optical tomography

A novel approach that can more effectively use the structural information provided by the traditional imaging modalities in multimodal diffuse optical tomographic imaging is introduced. This approach is based on a prior image-constrained-l(1) minimization scheme and has been motivated by the recent progress in the sparse image reconstruction techniques. It is shown that the proposed framework is more effective in terms of localizing the tumor region and recovering the optical property values both in numerical and gelatin phantom cases compared to the traditional methods that use structural information. (C) 2012 Optical Society of America

Coulomb-hole summations and energies for GW calculations with limited number of empty orbitals: a modified static remainder approach

Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the large number of empty orbitals required to converge the electron self-energy. We propose a scheme to reduce the summation over empty states by the use of a modified static remainder approximation, which is simple to implement and yields accurate self-energies for both bulk and molecular systems requiring a small fraction of the typical number of empty orbitals.

Optimal design of timer-based, distributed selection with unknown number of nodes

The timer-based selection scheme is a popular, simple, and distributed scheme that is used to select the best node from a set of available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal timer mapping that maximizes the average success probability for the practical scenario in which the number of nodes in the system is unknown but only its probability distribution is known. We show that it has a special discrete structure, and present a recursive characterization to determine it. We benchmark its performance with ad hoc approaches proposed in the literature, and show that it delivers significant gains. New insights about the optimality of some ad hoc approaches are also developed.

On the Chern number of I-admissible filtrations of ideals

Let I be an m-primary ideal of a Noetherian local ring (R, m) of positive dimension. The coefficient e(1)(I) of the Hilbert polynomial of an I-admissible filtration I is called the Chern number of I. A formula for the Chern number has been derived involving the Euler characteristic of subcomplexes of a Koszul complex. Specific formulas for the Chern number have been given in local rings of dimension at most two. These have been used to provide new and unified proofs of several results about e(1)(I).

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

Equilibrium and equivariant triangulations of some small covers with minimum number of vertices

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal 4-equivariant triangulations of 2-dimensional small covers. We discuss vertex minimal equilibrium triangulations of RP3#RP3, S-1 x RP2 and a nontrivial S-1 bundle over RP2. We construct some nice equilibrium triangulations of the real projective space RPn with 2(n) + n 1 vertices. The main tool is the theory of small covers.

An estimate of the number of tropical tree species

The high species richness of tropical forests has long been recognized, yet there remains substantial uncertainty regarding the actual number of tropical tree species. Using a pantropical tree inventory database from closed canopy forests, consisting of 657,630 trees belonging to 11,371 species, we use a fitted value of Fisher's alpha and an approximate pantropical stem total to estimate the minimum number of tropical forest tree species to fall between similar to 40,000 and similar to 53,000, i.e., at the high end of previous estimates. Contrary to common assumption, the Indo-Pacific region was found to be as species-rich as the Neotropics, with both regions having a minimum of similar to 19,000-25,000 tree species. Continental Africa is relatively depauperate with a minimum of similar to 4,500-6,000 tree species. Very few species are shared among the African, American, and the Indo-Pacific regions. We provide a methodological framework for estimating species richness in trees that may help refine species richness estimates of tree-dependent taxa.

Effective Degradation of Aqueous Nitrobenzene Using the SrFeO3-delta Photocatalyst under UV Illumination and Its Kinetics and Mechanistic Studies

In this article, the SrFeO3-delta photocatalyst was synthesized by a solution combustion method and applied for the photocatalytic degradation of aqueous nitrobenzene in the presence and absence of H2O2. The SrFeO3-delta photocatalyst was characterized by XRD, FT-IR, FE-SEM, TEM, TG-DTG, XPS, and UV visible spectroscopy. The band gap energy of SrFeO3-delta was found to be 3.75 eV which lies in the UV region. The XPS results indicate that the oxidation state of Sr and Fe in SrFeO3-delta was 2+ and 3+, respectively, and the surface atomic ratio of Sr and Fe is 0.995. The photocatalytic activity reveals that the degradation of nitrobenzene over the SrFeO3-delta catalyst itself (UV/SFO) is superior compared to SrFeO3-delta in the presence of H2O2 (UV/SFO/H2O2) with a degradation efficiency of 99-96%. The degradation of nitrobenzene obeys first-order kinetics in both UV/SFO and UV/SFO/H2O2 processes. The decrease in degradation efficiency with UV/SFO/H2O2 was attributed due to the formation of strontium carbonate on the photocatalyst surface.

Improved recognition of aged Kannada documents by effective segmentation of merged characters

In optical character recognition of very old books, the recognition accuracy drops mainly due to the merging or breaking of characters. In this paper, we propose the first algorithm to segment merged Kannada characters by using a hypothesis to select the positions to be cut. This method searches for the best possible positions to segment, by taking into account the support vector machine classifier's recognition score and the validity of the aspect ratio (width to height ratio) of the segments between every pair of cut positions. The hypothesis to select the cut position is based on the fact that a concave surface exists above and below the touching portion. These concave surfaces are noted down by tracing the valleys in the top contour of the image and similarly doing it for the image rotated upside-down. The cut positions are then derived as closely matching valleys of the original and the rotated images. Our proposed segmentation algorithm works well for different font styles, shapes and sizes better than the existing vertical projection profile based segmentation. The proposed algorithm has been tested on 1125 different word images, each containing multiple merged characters, from an old Kannada book and 89.6% correct segmentation is achieved and the character recognition accuracy of merged words is 91.2%. A few points of merge are still missed due to the absence of a matched valley due to the specific shapes of the particular characters meeting at the merges.

Analysis of Wave-Induced Effective Stresses of Seabed

波浪作用下海床的稳定性分析是海洋工程地质评价的重要内容。海床的稳定性可通过计算分析其随时间变化的有效应力场来评估。建议了一个周期载荷作用下土体的本构模型,并用于计算波浪作用下海床的应力与变形。采用Biot固结理论和有限单元法,分析了海床的动态应力场与孔隙水压力场。波浪作用下两种渗透系数时有效应力的动态变化过程结果对比,反映了渗透消散作用对海床有效应力变化的影响。

Transposon mutagenesis in a hyper-invasive clinical isolate of Campylobacter jejuni reveals a number of genes with potential roles in invasion.

Transposon mutagenesis has been applied to a hyper-invasive clinical isolate of Campylobacter jejuni, 01/51. A random transposon mutant library was screened in an in vitro assay of invasion and 26 mutants with a significant reduction in invasion were identified. Given that the invasion potential of C. jejuni is relatively poor compared to other enteric pathogens, the use of a hyper-invasive strain was advantageous as it greatly facilitated the identification of mutants with reduced invasion. The location of the transposon insertion in 23 of these mutants has been determined; all but three of the insertions are in genes also present in the genome-sequenced strain NCTC 11168. Eight of the mutants contain transposon insertions in one region of the genome (approximately 14 kb), which when compared with the genome of NCTC 11168 overlaps with one of the previously reported plasticity regions and is likely to be involved in genomic variation between strains. Further characterization of one of the mutants within this region has identified a gene that might be involved in adhesion to host cells.