53 resultados para Geodesic convexity


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Odontologia - FOA

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Educação Matemática - IGCE

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Agronomia (Irrigação e Drenagem) - FCA

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Several countries have been passed by change processes in their fundamental geodesic structure with the focus on the adoption of geocentric reference systems. In Brazil, the adoption of the SIRGAS2000 evolves the coexistence of two realizations from the COrrego Alegre system, two realizations from the SAD69 system and one realization from the SIRGAS2000 system. To make use of products in the old reference systems, methods of coordinate transformation between the existent reference frames are necessary. So, in this paper one solution for the transformation between coordinates from different reference frames, based on Thin-Plate Splines (TPS), that allows the estimation of parameters from one linear transformation and also one non-linear model is presented. The TPS model was developed to work with tridimensional coordinates and in this paper the results and analysis are performed with simulated data and also with data from the official Brazilian Geodetic System (SGB). In the check points from SAD69 stations (realization of 1996 - SAD69/96), the values of RMSE obtained were of 78,2 mm in latitude and 67,5 mm in longitude, before the transformation to the SIRGAS2000. In the comparison between the TPS model and ProGriD (Brazilian software provided by IBGE), the statistical indicators were reduced in 97%, by using the TPS model. Based in the obtained results from real dataset, the TPS model appears to be promising, since it allows improving the quality of transformation process with simultaneous distortion modeling.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper a novel Branch and Bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Techniques of image combination, with extraction of objects to set a final scene, are very used in applications from photos montages to cinematographic productions. These techniques are called digital matting. With them is possible to decrease the cost of productions, because it is not necessary for the actor to be filmed in the location where the final scene occurs. This feature also favors its use in programs made to digital television, which demands a high quality image. Many digital matting algorithms use markings done on the images, to demarcate what is the foreground, the background and the uncertainty areas. This marking is called trimap, which is a triple map containing these three informations. The trimap is done, typically, from manual markings. In this project, methods were created that can be used in digital matting algorithms, with restriction of time and without human interaction, that is, the creation of an algorithm that generates the trimap automatically. This last one can be generated from the difference between a color of an arbitrary background and the foreground, or by using a depth map. It was also created a matting method, based on the Geodesic Matting (BAI; SAPIRO, 2009), which has an inferior processing time then the original one. Aiming to improve the performance of the applications that generates the trimap and of the algorithms that generates the alphamap (map that associates a value to the transparency of each pixel of the image), allowing its use in applications with time restrictions, it was used the CUDA architecture. Taking advantage, this way, of the computational power and the features of the GPGPU, which is massively parallel

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This research was developed with the goal of creating a Digital Terrain Model(DTM),through a topo-bathymetric data gathering that allows the monitoring of the fluvial dynamics of part of Guaratinguetá’s creek, where preliminary evaluations identified, in a short period of time, intense changes on its riverbed. Modern topography technics and tools were used for the data gathering, such as the use of geodesic GPS and Total Station. The DTM was primal for the project e execution of the desilting works of the researched part of the creek, being used to estimate the amount of soil to be moved. The comparison between the digital terrain models generated before and after the desilting has showed the efficiency and aplicability of this technique in the monitoring of the fluvial dynamics changes of Guaratinguetá’s creek

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This article deals with a vector optimization problem with cone constraints in a Banach space setting. By making use of a real-valued Lagrangian and the concept of generalized subconvex-like functions, weakly efficient solutions are characterized through saddle point type conditions. The results, jointly with the notion of generalized Hessian (introduced in [Cominetti, R., Correa, R.: A generalized second-order derivative in nonsmooth optimization. SIAM J. Control Optim. 28, 789–809 (1990)]), are applied to achieve second order necessary and sufficient optimality conditions (without requiring twice differentiability for the objective and constraining functions) for the particular case when the functionals involved are defined on a general Banach space into finite dimensional ones.