Elastic scattering and the proton form factor

We use the QCD pomeron model proposed by Landshoff and Nachtmann to compute the differential and the total cross-sections for pp scattering in order to discuss a QCD-based approach to the proton form factor. This model is quite dependent on the experimental electromagnetic form factor, and it is not totally clear why this form factor gives good results even at moderate transferred momentum. We exchange the electromagnetic form factor by the asymptotic QCD proton form factor determined by Brodsky and Lepage (BL) plus a prescription for its low energy behavior dictated by the existence of a dynamically generated gluon mass. We fit the data with this QCD inspired form factor and a value for the dynamical gluon mass consistent with the ones determined in the literature. Our results also provide a determination of the proton wave function at the origin, which appears in the BL form factor.

On a regular convex solver potential for an elastic-damage constitutive model: a theoretical analysis

This work is related with the proposition of a so-called regular or convex solver potential to be used in numerical simulations involving a certain class of constitutive elastic-damage models. All the mathematical aspects involved are based on convex analysis, which is employed aiming a consistent variational formulation of the potential and its conjugate one. It is shown that the constitutive relations for the class of damage models here considered can be derived from the solver potentials by means of sub-differentials sets. The optimality conditions of the resulting minimisation problem represent in particular a linear complementarity problem. Finally, a simple example is present in order to illustrate the possible integration errors that can be generated when finite step analysis is performed. (C) 2003 Elsevier Ltd. All rights reserved.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Measurement of the differential cross section d sigma/dt in elastic p(p)over-bar scattering at root s=1.96 TeV

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Towards an intelligent graphical interface for linear programming modelling

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

Design of microirrigation systems in sloping lands using linear programming

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.

Dynamic programming approach for road centerline extraction from digital images

This paper presents a dynamic programming approach for semi-automated road extraction from medium-and high-resolution images. This method is a modified version of a pre-existing dynamic programming method for road extraction from low-resolution images. The basic assumption of this pre-existing method is that roads manifest as lines in low-resolution images (pixel footprint> 2 m) and as such can be modeled and extracted as linear features. On the other hand, roads manifest as ribbon features in medium- and high-resolution images (pixel footprint ≤ 2 m) and, as a result, the focus of road extraction becomes the road centerlines. The original method can not accurately extract road centerlines from medium- and high- resolution images. In view of this, we propose a modification of the merit function of the original approach, which is carried out by a constraint function embedding road edge properties. Experimental results demonstrated the modified algorithm's potential in extracting road centerlines from medium- and high-resolution images.

Remarks on orthotropic elastic models applied to wood

Wood is generally considered an anisotropic material. In terms of engineering elastic models, wood is usually treated as an orthotropic material. This paper presents an analysis of two principal anisotropic elastic models that are usually applied to wood. The first one, the linear orthotropic model, where the material axes L (Longitudinal), R(radial) and T(tangential) are coincident with the Cartesian axes (x, y, z), is more accepted as wood elastic model. The other one, the cylindrical orthotropic model is more adequate of the growth caracteristics of wood but more mathematically complex to be adopted in practical terms. Specifically due to its importance in wood elastic parameters, this paper deals with the fiber orientation influence in these models through adequate transformation of coordinates. As a final result, some examples of the linear model, which show the variation of elastic moduli, i.e., Young's modulus and shear modulus, with fiber orientation are presented.

Uprighting impacted mandibular second molars with orthodontic elastic separating rings.

A 16-year-old girl presented with complaints of recurrent spontaneous pain in the mandibular second molar region. Treatment favored use of a simple uprighting technique involving orthodontic elastic separating rings.

Morphology of collagen fibers and elastic system fibers in actinic cheilitis

Background: Actinic cheilitis (AC) is a premalignant condition intimately related to exposure of the lips to sun rays. Aim: The objective of this study was to evaluate the elastic and collagen fibers in the lamina propria of AC. The degree of epithelial atypia was correlated with the quantity of elastic and collagen fibers. Materials and Methods: Fifty-one cases were investigated. One slide was stained with hematoxylin-eosin for the evaluation of atypia, the second was stained with Weigert′s resorcin-fuchsin for the assessment of elastic fibers, and the third slide was stained with Mallory′s trichrome for the analysis of collagen fibers. Results: Ordinal logistic regression analysis revealed a significant correlation between the presence of atypia and collagen fibers (P<0.05). Conclusions: It was concluded that there seems to be a reduction in the quantity of collagen fibers in cases of moderate and severe atypia. No correlation was observed between the degradation of elastic system fibers and the grade of dysplasia.