Total factor productivity growth and convergence in the petroleum industry : empirical analysis testing for convexity

While economic theory acknowledges that some features of technology (e.g., indivisibilities, economies of scale and specialization) can fundamentally violate the traditional convexity assumption, almost all empirical studies accept the convexity property on faith. In this contribution, we apply two alternative flexible production technologies to measure total factor productivity growth and test the significance of the convexity axiom using a nonparametric test of closeness between unknown distributions. Based on unique field level data on the petroleum industry, the empirical results reveal significant differences, indicating that this production technology is most likely non-convex. Furthermore, we also show the impact of convexity on answers to traditional convergence questions in the productivity growth literature.

Conservation law with the flux function discontinuous in the space variable- II - Convex-concave type fluxes and generalized entropy solutions

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.

On the compactness of isometry groups in complex analysis

We prove that the group of continuous isometries for the Kobayashi or Caratheodory metrics of a strongly convex domain in C-n is compact unless the domain is biholomorphic to the ball. A key ingredient, proved using differential geometric ideas, is that a continuous isometry between a strongly convex domain and the ball has to be biholomorphic or anti-biholomorphic. Combining this with a metric version of Pinchuk's rescaling technique gives the main result.

Surface-ray tracing on hybrid surfaces of revolution for UTD mutual coupling analysis

An angle invariance property based on Hertz's principle of particle dynamics is employed to facilitate the surface-ray tracing on nondevelopable hybrid quadric surfaces of revolution (h-QUASOR's). This property, when used in conjunction with a Geodesic Constant Method, yields analytical expressions for all the ray-parameters required in the UTD formulation. Differential geometrical considerations require that some of the ray-parameters (defined heuristically in the UTD for the canonical convex surfaces) be modified before the UTD can be applied to such hybrid surfaces. Mutual coupling results for finite-dimensional slots have been presented as an example on a satellite launch vehicle modeled by general paraboloid of revolution and right circular cylinder.

Curvature based mobility analysis and form closure of smooth planar curves with multiple contacts

This paper presents a simple second-order, curvature based mobility analysis of planar curves in contact. The underlying theory deals with penetration and separation of curves with multiple contacts, based on relative configuration of osculating circles at points of contact for a second-order rotation about each point of the plane. Geometric and analytical treatment of mobility analysis is presented for generic as well as special contact geometries. For objects with a single contact, partitioning of the plane into four types of mobility regions has been shown. Using point based composition operations based on dual-number matrices, analysis has been extended to computationally handle multiple contacts scenario. A novel color coded directed line has been proposed to capture the contact scenario. Multiple contacts mobility is obtained through intersection of the mobility half-spaces. It is derived that mobility region comprises a pair of unbounded or a single bounded convex polygon. The theory has been used for analysis and synthesis of form closure configurations, revolute and prismatic kinematic pairs. (C) 2013 Elsevier Ltd. All rights reserved.

Mixed finite elements for electromagnetic analysis

The occurrence of spurious solutions is a well-known limitation of the standard nodal finite element method when applied to electromagnetic problems. The two commonly used remedies that are used to address this problem are (i) The addition of a penalty term with the penalty factor based on the local dielectric constant, and which reduces to a Helmholtz form on homogeneous domains (regularized formulation); (ii) A formulation based on a vector and a scalar potential. Both these strategies have some shortcomings. The penalty method does not completely get rid of the spurious modes, and both methods are incapable of predicting singular eigenvalues in non-convex domains. Some non-zero spurious eigenvalues are also predicted by these methods on non-convex domains. In this work, we develop mixed finite element formulations which predict the eigenfrequencies (including their multiplicities) accurately, even for nonconvex domains. The main feature of the proposed mixed finite element formulation is that no ad-hoc terms are added to the formulation as in the penalty formulation, and the improvement is achieved purely by an appropriate choice of finite element spaces for the different variables. We show that the formulation works even for inhomogeneous domains where `double noding' is used to enforce the appropriate continuity requirements at an interface. For two-dimensional problems, the shape of the domain can be arbitrary, while for the three-dimensional ones, with our current formulation, only regular domains (which can be nonconvex) can be modeled. Since eigenfrequencies are modeled accurately, these elements also yield accurate results for driven problems. (C) 2014 Elsevier Ltd. All rights reserved.

Global response sensitivity analysis of uncertain structures

The problem of characterizing global sensitivity indices of structural response when system uncertainties are represented using probabilistic and (or) non-probabilistic modeling frameworks (which include intervals, convex functions, and fuzzy variables) is considered. These indices are characterized in terms of distance measures between a fiducial model in which uncertainties in all the pertinent variables are taken into account and a family of hypothetical models in which uncertainty in one or more selected variables are suppressed. The distance measures considered include various probability distance measures (Hellinger,l(2), and the Kantorovich metrics, and the Kullback-Leibler divergence) and Hausdorff distance measure as applied to intervals and fuzzy variables. Illustrations include studies on an uncertainly parametered building frame carrying uncertain loads. (C) 2015 Elsevier Ltd. All rights reserved.

Contributions to the analysis and segmentation of remote sensing hyperspectral images

142 p.

Generalized power method for sparse principal component analysis

In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed. © 2010 Michel Journée, Yurii Nesterov, Peter Richtárik and Rodolphe Sepulchre.

Quantitative convergence analysis of multi-agent systems

We introduce a characterization of contraction for bounded convex sets. For discrete-time multi-agent systems we provide an explicit upperbound on the rate of convergence to a consensus under the assumptions of contractiveness and (weak) connectedness (across an interval.) Convergence is shown to be exponential when either the system or the function characterizing the contraction is linear. Copyright © 2007 IFAC.

Minimum maneuver time calculation using convex optimization

The problem of calculating the minimum lap or maneuver time of a nonlinear vehicle, which is linearized at each time step, is formulated as a convex optimization problem. The formulation provides an alternative to previously used quasi-steady-state analysis or nonlinear optimization. Key steps are: the use of model predictive control; expressing the minimum time problem as one of maximizing distance traveled along the track centerline; and linearizing the track and vehicle trajectories by expressing them as small displacements from a fixed reference. A consequence of linearizing the vehicle dynamics is that nonoptimal steering control action can be generated, but attention to the constraints and the cost function minimizes the effect. Optimal control actions and vehicle responses for a 90 deg bend are presented and compared to the nonconvex nonlinear programming solution. Copyright © 2013 by ASME.

Computational analysis of liquid crystalline elastomer membranes: Changing Gaussian curvature without stretch energy

Liquid crystalline elastomers (LCEs) can undergo extremely large reversible shape changes when exposed to external stimuli, such as mechanical deformations, heating or illumination. The deformation of LCEs result from a combination of directional reorientation of the nematic director and entropic elasticity. In this paper, we study the energetics of initially flat, thin LCE membranes by stress driven reorientation of the nematic director. The energy functional used in the variational formulation includes contributions depending on the deformation gradient and the second gradient of the deformation. The deformation gradient models the in-plane stretching of the membrane. The second gradient regularises the non-convex membrane energy functional so that infinitely fine in-plane microstructures and infinitely fine out-of-plane membrane wrinkling are penalised. For a specific example, our computational results show that a non-developable surface can be generated from an initially flat sheet at cost of only energy terms resulting from the second gradients. That is, Gaussian curvature can be generated in LCE membranes without the cost of stretch energy in contrast to conventional materials. © 2013 Elsevier Ltd. All rights reserved.

Cancer subtypes recognition and its gene expression profiles analysis based on geometrical learning

The accurate recognition of cancer subtypes is very significant in clinic. Especially, the DNA microarray gene expression technology is applied to diagnosing and recognizing cancer types. This paper proposed a method of that recognized cancer subtypes based on geometrical learning. Firstly, the cancer genes expression profiles data was pretreated and selected feature genes by conventional method; then the expression data of feature genes in the training samples was construed each convex hull in the high-dimensional space using training algorithm of geometrical learning, while the independent test set was tested by the recognition algorithm of geometrical learning. The method was applied to the human acute leukemia gene expression data. The accuracy rate reached to 100%. The experiments have proved its efficiency and feasibility.

On stratifiable locally convex spaces

In the present paper we prove several results on the stratifiability of locally convex spaces. In particular, we show that a free locally convex sum of an arbitrary set of stratifiable LCS is a stratifiable LCS, and that all locally convex F'-spaces whose bounded subsets are metrizable are stratifiable. Moreover, we prove that a strict inductive limit of metrizable LCS is stratifiable and establish the stratifiability of many important general and specific spaces used in functional analysis. We also construct some examples that clarify the relationship between the stratifiability and other properties.