Color tunability of intense upconversion emission from Er3+-Yb3+ co-doped SiO2-Ta2O5 glass ceramic planar waveguides

This work reports on the infrared-to-visible CW frequency upconversion from planar waveguides based on Er3+-Yb3+-doped 100-xSiO(2)-xTa(2)O(5) obtained by a sol-gel process and deposited onto a SiO2-Si substrate by dip-coating. Surface morphology and optical parameters of the planar waveguides were analyzed by atomic force microscopy and the m-line technique. The influence of the composition on the electronic properties of the glass-ceramic films was followed by the band gap ranging from 4.35 to 4.51 eV upon modification of the Ta2O5 content. Intense green and red emissions were detected from the upconversion process for all the samples after excitation at 980 nm. The relative intensities of the emission bands around 550 nm and 665 nm, assigned to the H-2(11/2) -> I-4(15/2), S-4(3/2) -> I-4(15/2), and F-4(9/2) -> I-4(15/2) transitions, depended on the tantalum oxide content and the power of the laser source at 980 nm. The upconversion dynamics were investigated as a function of the Ta2O5 content and the number of photons involved in each emission process. Based on the upconversion emission spectra and 1931CIE chromaticity diagram, it is shown that color can be tailored by composition and pump power. The glass ceramic films are attractive materials for application in upconversion lasers and near infrared-to-visible upconverters in solar cells.

Analyzing the Complexity and Reliability of Switch-Frequency-Reconfigurable Antennas Using Graph Models

This paper addresses the functional reliability and the complexity of reconfigurable antennas using graph models. The correlation between complexity and reliability for any given reconfigurable antenna is defined. Two methods are proposed to reduce failures and improve the reliability of reconfigurable antennas. The failures are caused by the reconfiguration technique or by the surrounding environment. These failure reduction methods proposed are tested and examples are given which verify these methods.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

Experimental Investigation of the Hydrodynamic Coefficients of a Remotely Operated Vehicle Using a Planar Motion Mechanism

The determination of hydrodynamic coefficients of full scale underwater vehicles using system identification (SI) is an extremely powerful technique. The procedure is based on experimental runs and on the analysis of on-board sensors and thrusters signals. The technique is cost effective and it has high repeatability; however, for open-frame underwater vehicles, it lacks accuracy due to the sensors' noise and the poor modeling of thruster-hull and thruster-thruster interaction effects. In this work, forced oscillation tests were undertaken with a full scale open-frame underwater vehicle. These conducted tests are unique in the sense that there are not many examples in the literature taking advantage of a PMM installation for testing a prototype and; consequently, allowing the comparison between the experimental results and the ones estimated by parameter identification. The Morison's equation inertia and drag coefficients were estimated with two parameter identification methods, that is, the weighted and the ordinary least-squares procedures. It was verified that the in-line force estimated from Morison's equation agrees well with the measured one except in the region around the motion inversion points. On the other hand, the error analysis showed that the ordinary least-squares provided better accuracy and, therefore, was used to evaluate the ratio between inertia and drag forces for a range of Keulegan-Carpenter and Reynolds numbers. It was concluded that, although both experimental and estimation techniques proved to be powerful tools for evaluation of an open-frame underwater vehicle's hydrodynamic coefficients, the research provided a rich amount of reference data for comparison with reduced models as well as for dynamic motion simulation of ROVs. [DOI: 10.1115/1.4004952]

Maximum Series-Parallel Subgraph

Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G with the maximum number of edges. The algorithm that, given a connected graph G, outputs a spanning tree of G, is a 1/2-approximation. Indeed, if n is the number of vertices in G, any spanning tree in G has n-1 edges and any series-parallel graph on n vertices has at most 2n-3 edges. We present a 7/12 -approximation for this problem and results showing the limits of our approach.

On global linearization of planar involutions

Let phi: a"e(2) -> a"e(2) be an orientation-preserving C (1) involution such that phi(0) = 0. Let Spc(phi) = {Eigenvalues of D phi(p) | p a a"e(2)}. We prove that if Spc(phi) aS, a"e or Spc(phi) a (c) [1, 1 + epsilon) = a... for some epsilon > 0, then phi is globally C (1) conjugate to the linear involution D phi(0) via the conjugacy h = (I + D phi(0)phi)/2,where I: a"e(2) -> a"e(2) is the identity map. Similarly, we prove that if phi is an orientation-reversing C (1) involution such that phi(0) = 0 and Trace (D phi(0)D phi(p) > - 1 for all p a a"e(2), then phi is globally C (1) conjugate to the linear involution D phi(0) via the conjugacy h. Finally, we show that h may fail to be a global linearization of phi if the above conditions are not fulfilled.

NIR luminescent Er3+/Yb3+ co-doped SiO2-ZrO2 nanostructured planar and channel waveguides: Optical and structural properties

Optical and structural properties of planar and channel waveguides based on sol gel Er3+ and Yb3+ co-doped SiO2-ZrO2 are reported. Microstructured channels with high homogeneous surface profile were written onto the surface of multilayered densified films deposited on SiO2/Si substrates by a femtosecond laser etching technique. The densification of the planar waveguides was evaluated from changes in the refractive index and thickness, with full densification being achieved at 900 degrees C after annealing from 23 up to 500 min, depending on the ZrO2 content Crystal nucleation and growth took place together with densification, thereby producing transparent glass ceramic planar waveguides containing rare earth-doped ZrO2 nanocrystals dispersed in a silica-based glassy host Low roughness and crack-free surface as well as high confinement coefficient were achieved for all the compositions. Enhanced NIR luminescence of the Er3+ ions was observed for the Yb3+- codoped planar waveguides, denoting an efficient energy transfer from the Yb3+ to the Er3+ ion. (C) 2012 Elsevier B.V. All rights reserved.

Experimental analysis of reinforced concrete block masonry spandrels using pre-fabricated planar trussed bars

Masonry spandrels together with shear walls are structural components of a masonry building subjected to lateral loads. Shear walls are the main components of this structural system, even if masonry spandrels are the elements that ensure the connection of shear wall panels and the distribution of stresses through the masonry piers. The use of prefabricated truss type bars in the transversal and longitudinal directions is usually considered a challenge, even if the simplicity of the applications suggested here alleviate some of the possible difficulties. This paper focus on the experimental behavior of masonry spandrels reinforced with prefabricated trusses, considering different possibilities for the arrangement of reinforcement and blocks. Reinforced spandrels with three and two hollow cell concrete blocks and with different reinforcement ratios have been built and tested using a four and three point loading test configuration. Horizontal bed joint reinforcement increased the capacity of deformation as well as the ultimate load, leading to ductile responses. Vertical reinforcement increased the shear strength of the masonry spandrels and its distribution play a central role on the shear behavior. (C) 2011 Elsevier Ltd. All rights reserved.

Classical magnetoresistance of a ballistic electron gas constrained to non-planar topographies in a lattice of antidots under tilted magnetic field

The classical magnetoresistance of a two-dimensional electron gas constrained to non-planar topographies, in antidot lattices, and under the influence of tilted magnetic field in arbitrary direction is numerically studied. (C) 2012 Elsevier B.V. All rights reserved.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Algebraic-graph method for identification of islanding in power system grids

In this paper, a new algebraic-graph method for identification of islanding in power system grids is proposed. The proposed method identifies all the possible cases of islanding, due to the loss of a equipment, by means of a factorization of the bus-branch incidence matrix. The main features of this new method include: (i) simple implementation, (ii) high speed, (iii) real-time adaptability, (iv) identification of all islanding cases and (v) identification of the buses that compose each island in case of island formation. The method was successfully tested on large-scale systems such as the reduced south Brazilian system (45 buses/72 branches) and the south-southeast Brazilian system (810 buses/1340 branches). (C) 2011 Elsevier Ltd. All rights reserved.

Gaussian deconvolution: a useful method for a form-free modeling of scattering data from mono- and multilayered planar systems

A new method for analysis of scattering data from lamellar bilayer systems is presented. The method employs a form-free description of the cross-section structure of the bilayer and the fit is performed directly to the scattering data, introducing also a structure factor when required. The cross-section structure (electron density profile in the case of X-ray scattering) is described by a set of Gaussian functions and the technique is termed Gaussian deconvolution. The coefficients of the Gaussians are optimized using a constrained least-squares routine that induces smoothness of the electron density profile. The optimization is coupled with the point-of-inflection method for determining the optimal weight of the smoothness. With the new approach, it is possible to optimize simultaneously the form factor, structure factor and several other parameters in the model. The applicability of this method is demonstrated by using it in a study of a multilamellar system composed of lecithin bilayers, where the form factor and structure factor are obtained simultaneously, and the obtained results provided new insight into this very well known system.

Focusing surface plasmons on Er3+ ions through gold planar plasmonic lenses

Gold plasmonic lenses consisting of a planar concentric rings-groove with different periods were milled with a focused gallium ion beam on a gold thin film deposited onto an Er3+-doped tellurite glass. The plasmonic lenses were vertically illuminated with an argon ion laser highly focused by means of a 50x objective lens. The focusing mechanism of the plasmonic lenses is explained using a coherent interference model of surface plasmon-polariton (SPP) generation on the circular grating due to the incident field. As a result, phase modulation can be accomplished by the groove gap, similar to a nanoslit array with different widths. This focusing allows a high confinement of SPPs that can excite the Er3+ ions of the glass. The Er3+ luminescence spectra were measured in the far-field (500-750 nm wavelength range), where we could verify the excitation yield via the plasmonic lens on the Er3+ ions. We analyze the influence of the geometrical parameters on the luminescence spectra. The variation of these parameters results in considerable changes of the luminescence spectra.

A graph-theoretical approach in brain functional networks. Possible implications in EEG studies

Abstract Background Recently, it was realized that the functional connectivity networks estimated from actual brain-imaging technologies (MEG, fMRI and EEG) can be analyzed by means of the graph theory, that is a mathematical representation of a network, which is essentially reduced to nodes and connections between them. Methods We used high-resolution EEG technology to enhance the poor spatial information of the EEG activity on the scalp and it gives a measure of the electrical activity on the cortical surface. Afterwards, we used the Directed Transfer Function (DTF) that is a multivariate spectral measure for the estimation of the directional influences between any given pair of channels in a multivariate dataset. Finally, a graph theoretical approach was used to model the brain networks as graphs. These methods were used to analyze the structure of cortical connectivity during the attempt to move a paralyzed limb in a group (N=5) of spinal cord injured patients and during the movement execution in a group (N=5) of healthy subjects. Results Analysis performed on the cortical networks estimated from the group of normal and SCI patients revealed that both groups present few nodes with a high out-degree value (i.e. outgoing links). This property is valid in the networks estimated for all the frequency bands investigated. In particular, cingulate motor areas (CMAs) ROIs act as ‘‘hubs’’ for the outflow of information in both groups, SCI and healthy. Results also suggest that spinal cord injuries affect the functional architecture of the cortical network sub-serving the volition of motor acts mainly in its local feature property. In particular, a higher local efficiency El can be observed in the SCI patients for three frequency bands, theta (3-6 Hz), alpha (7-12 Hz) and beta (13-29 Hz). By taking into account all the possible pathways between different ROI couples, we were able to separate clearly the network properties of the SCI group from the CTRL group. In particular, we report a sort of compensatory mechanism in the SCI patients for the Theta (3-6 Hz) frequency band, indicating a higher level of “activation” Ω within the cortical network during the motor task. The activation index is directly related to diffusion, a type of dynamics that underlies several biological systems including possible spreading of neuronal activation across several cortical regions. Conclusions The present study aims at demonstrating the possible applications of graph theoretical approaches in the analyses of brain functional connectivity from EEG signals. In particular, the methodological aspects of the i) cortical activity from scalp EEG signals, ii) functional connectivity estimations iii) graph theoretical indexes are emphasized in the present paper to show their impact in a real application.