Super-Poincaré covariant quantization of the superstring

Using pure spinors, the superstring is covariantly quantized. For the first time, massless vertex operators are constructed and scattering amplitudes are computed in a manifestly ten-dimensional super-Poincaré covariant manner. Quantizable non-linear sigma model actions are constructed for the superstring in curved backgrounds, including the AdS 5 × S 5 background with Ramond-Ramond flux.

Covariant quantization of the superstring

After reviewing the Green-Schwarz superstring using the approach of Siegel, the superstring is covariantly quantized by constructing a BRST operator from the fermionic constraints and a bosonic pure spinor ghost variable. Physical massless vertex operators are constructed and, for the first time, N-point tree amplitudes are computed in a manifestly ten-dimensional super-Poincaré covariant manner. Quantization can be generalized to curved supergravity backgrounds and the vertex operator for fluctuations around AdS 5 x S 5 is explicitly constructed.

Generalized ladder operators for shape-invariant potentials

A general form for ladder operators is used to construct a method to solve bound-state Schrödinger equations. The characteristics of supersymmetry and shape invariance of the system are the start point of the approach. To show the elegance and the utility of the method we use it to obtain energy spectra and eigenfunctions for the one-dimensional harmonic oscillator and Morse potentials and for the radial harmonic oscillator and Coulomb potentials.

Towards covariant quantization of the supermembrane

By replacing ten-dimensional pure spinors with eleven-dimensional pure spinors, the formalism recently developed for covariantly quantizing the d = 10 superparticle and superstring is extended to the d = 11 superparticle and supermembrane. In this formalism, kappa symmetry is replaced by a BRST-like invariance using the nilpotent operator Q = ∮ λ αdα where dα is the worldvolume variable corresponding to the d = 11 spacetime supersymmetric derivative and λα is an SO(10, 1) pure spinor variable satisfying λΓcλ = 0 for c = 1 to 11. Super-Poincaré covariant unintegrated and integrated supermembrane vertex operators are explicitly constructed which are in the cohomology of Q. After double-dimensional reduction of the eleventh dimension, these vertex operators are related to type-IIA superstring vertex operators where Q = QL + QR is the sum of the left and right-moving type-IIA BRST operators and the eleventh component of the pure spinor constraint, λΓ 11λ = 0, replaces the bL 0 - b R 0 constraint of the closed superstring. A conjecture is made for the computation of M-theory scattering amplitudes using these supermembrane vertex operators. © SISSA/ISAS 2002.

N = 2 superconformal description of superstring in Ramond-Ramond plane wave backgrounds

Using the U(4) formalism developed ten years ago, the worldsheet action for the superstring in Ramond-Ramond plane wave backgrounds is expressed in a manifestly N = (2,2) superconformally invariant manner. This simplifies the construction of consistent Ramond-Ramond plane wave backgrounds and eliminates the problems associated with light-cone interaction point operators. © SISSA/ISAS 2002.

Planning of secondary distribution circuits through evolutionary algorithms

In this work, the planning of secondary distribution circuits is approached as a mixed integer nonlinear programming problem (MINLP). In order to solve this problem, a dedicated evolutionary algorithm (EA) is proposed. This algorithm uses a codification scheme, genetic operators, and control parameters, projected and managed to consider the specific characteristics of the secondary network planning. The codification scheme maps the possible solutions that satisfy the requirements in order to obtain an effective and low-cost projected system-the conductors' adequate dimensioning, load balancing among phases, and the transformer placed at the center of the secondary system loads. An effective algorithm for three-phase power flow is used as an auxiliary methodology of the EA for the calculation of the fitness function proposed for solutions of each topology. Results for two secondary distribution circuits are presented, whereas one presents radial topology and the other a weakly meshed topology. © 2005 IEEE.

A new implementation of Population Based Incremental Learning method for optimization studies in electromagnetics

To enhance the global search ability of Population Based Incremental Learning (PBIL) methods, It Is proposed that multiple probability vectors are to be Included on available PBIL algorithms. As a result, the strategy for updating those probability vectors and the negative learning and mutation operators are redefined as reported. Numerical examples are reported to demonstrate the pros and cons of the newly Implemented algorithm. ©2006 IEEE.

Reconfiguration of distribution systems by a modified genetic algorithm

In this paper a genetic algorithm based reconfiguration method is proposed to minimize the real power losses of distribution systems. The main innovation of this research work is that new types of crossover and mutation operators are proposed, such that the best possible results are obtained, with an acceptable computational effort. The crossover and mutation operators were developed so as to take advantage of the particular characteristics of distribution systems (as the radial topology). Simulation results indicate that the proposed method is very efficient, being able to find excellent configurations, with low computational effort, especially for larger systems. ©2007 IEEE.

Detection of highways in high resolution images using Mathematical Morphology techniques

This paper seeks to apply a routine for highways detection through the mathematical morphology tools in high resolution image. The Mathematical Morphology theory consists of describing structures geometric presents quantitatively in the image (targets or features). This explains the use of the Mathematical Morphology in this work. As high resolution images will be used, the largest difficulty in the highways detection process is the presence of trees and automobiles in the borders tracks. Like this, for the obtaining of good results through the use of morphologic tools was necessary to choose the structuring element appropriately to be used in the functions. Through the appropriate choice of the morphologic operators and structuring elements it was possible to detect the highways tracks. The linear feature detection using mathematical morphology techniques, can contribute in cartographic applications, as cartographic products updating.

An investigation into the loss of the Brazilian space programme's launch vehicle VLS-1 V03

There has been a rapid increase in the complexity and integration of many safety-critical systems. In consequence, it is becoming increasingly difficult to identify the causes of incidents and accidents back through the complex interactions that lead to an adverse event. At the same time, there is a growing appreciation of the need to consider a broad range of contextual factors in the aftermath of any mishap. A number of regulators, operators and research teams have responded to these developments by proposing novel techniques to support the analysis of complex, safety-critical incidents. It is important to illustrate these different approaches by applying them to a number of common case studies. The following pages, therefore, show how STAMP and AcciMap might support the Serviço Público Federal investigation into the explosion and fire of the Brazilian launch vehicle VLS-1 VO3. © 2006 Elsevier Ltd. All rights reserved.

Digital versus conventional radiography for determination of primary incisor length

Aim: This in vitro study evaluated the accuracy of primary incisor lengths determined by digital and conventional radiography compared to the actual tooth length. Methods: Twenty extracted primary maxillary incisors were mounted in acrylic blocks. Tooth length was estimated by using a straight-line measurement provided by the distance measurement tool of a digital dental imaging system (Computed Dental Radiography, Schick Technologies Inc.) and conventional E-speed film radiographs by using a digital caliper. Two operators familiar with both radiographic methods performed the estimates. The estimated tooth lengths were compared to the actual tooth lengths measured with the digital caliper. Data were statistically analyzed by Dahlberg's equation, paired t test, Pearson's correlation coefficient and ANOVA at 5% significance level. Results: There were no statistically significant differences (p = 0.85) between tooth length estimated on digital and conventional radiographs. Admitting as clinically acceptable a 0.5-mm discrepancy between the actual tooth lengths and the radiographically estimated lengths, 60% of the radiographic measurements were considered as accurate. When the acceptable difference range was 1.0 mm, the accuracy of the radiographic measurements increased to 100%. Conclusions: Digital and conventional radiography provided similar tooth length measurements and were equivalent to the actual tooth lengths.

Morphological routine proposal to extraction of highways in digital images of high resolution

This research proposes to apply techniques of Mathematics Morphology to extract highways in digital images of high resolution, targeting the upgrade of cartographic products. Remote Sensing data and Mathematical Morphological techniques were integrated in the process of extraction. Mathematical Morphology's objective is to improve and extract the relevant information of the visual image. In order to test the proposed approach some morphological operators related to preprocess, were applied to the original images. Routines were implemented in the MATLAB environment. Results indicated good performances by the implemented operators. The integration of the technologies aimed to implement the semiautomatic extraction of highways with the purpose to use them in processes of cartographic updating.

Context-sensitive analysis of obfuscated x86 executables

A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in 'calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart. Copyright © 2010 ACM.

Wavelets in a problem of signal processing

In this work a new method is proposed for noise reduction in speech signals in the wavelet domain. The method for signal processing makes use of a transfer function, obtained as a polynomial combination of three processings, denominated operators. The proposed method has the objective of overcoming the deficiencies of the thresholding methods and the effective processing of speech corrupted by real noises. Using the method, two speech signals are processed, contaminated by white noise and colored noises. To verify the quality of the processed signals, two evaluation measures are used: signal to noise ratio (SNR) and perceptual evaluation of speech quality (PESQ).

The influence of subpixel measurement on digital camera calibration

The aim of this work is to evaluate the influence of point measurements in images, with subpixel accuracy, and its contribution in the calibration of digital cameras. Also, the effect of subpixel measurements in 3D coordinates of check points in the object space will be evaluated. With this purpose, an algorithm that allows subpixel accuracy was implemented for semi-automatic determination of points of interest, based on Fõrstner operator. Experiments were accomplished with a block of images acquired with the multispectral camera DuncanTech MS3100-CIR. The influence of subpixel measurements in the adjustment by Least Square Method (LSM) was evaluated by the comparison of estimated standard deviation of parameters in both situations, with manual measurement (pixel accuracy) and with subpixel estimation. Additionally, the influence of subpixel measurements in the 3D reconstruction was also analyzed. Based on the obtained results, i.e., on the quantification of the standard deviation reduction in the Inner Orientation Parameters (IOP) and also in the relative error of the 3D reconstruction, it was shown that measurements with subpixel accuracy are relevant for some tasks in Photogrammetry, mainly for those in which the metric quality is of great relevance, as Camera Calibration.