7 resultados para moving windows

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Wet impregnation of pre-synthesized surfactant-stabilized aqueous rhodium (0) colloidal suspension on silica was employed in order to prepare supported Rh-0 nanoparticles of well-defined composition, morphology and size. A magnetic core-shell support of silica (Fe(3)O4@SiO2) was used to increase the handling properties of the obtained nanoheterogeneous catalyst. The nanocomposite catalyst Fe3O4@SiO2-Rh-0 NPs was highly active in the solventless hydrogenation of model olefins and aromatic substrates under mild conditions with turnover frequencies up to 143,000 h(-1). The catalyst was characterized by various transmission electron microscopy techniques showing well-dispersed rhodium nanoparticles (similar to 3 nm) mainly located at the periphery of the silica coating. The heterogeneous magnetite-supported nanocatalyst was investigated in the hydrogenation of cyclohexene and compared to the previous surfactant-stabilized aqueous Rh-0 colloidal suspension and various silica-supported Rh-0 nanoparticles. Finally, the composite catalyst could be reused in several runs after magnetic separation. (C) 2011 Elsevier B. V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Experimental results of flow around a circular cylinder with moving surface boundary-layer control (MSBC) are presented. Two small rotating cylinders strategically located inject momentum in the boundary layer of the cylinder, which delays the separation of the boundary layer. As a consequence, the wake becomes narrower and the fluctuating transverse velocity is reduced, resulting in a recirculation free region that prevents the vortex formation. The control parameter is the ratio between the tangential velocity of the moving surface and the flow velocity (U-c/U). The main advantage of the MSBC is the possibility of combining the suppression of vortex-induced vibration (VIV) and drag reduction. The experimental tests are preformed at a circulating water channel facility and the circular cylinders are mounted on a low-damping air bearing base with one degree-of-freedom in the transverse direction of the channel flow. The mass ratio is 1.8. The Reynolds number ranges from 1600 to 7500, the reduced velocity varies up to 17, and the control parameter interval is U-c/U = 5-10. A significant decreasing in the maximum amplitude of oscillation for the cylinder with MSBC is observed. Drag measurements are obtained for statically mounted cylinders with and without MSBC. The use of the flow control results in a mean drag reduction at U-c/U = 5 of almost 60% compared to the plain cylinder. PIV velocity fields of the wake of static cylinders are measured at Re = 3000. The results show that the wake is highly organized and narrower compared to the one observed in cylinders without control. The calculation of the total variance of the fluctuating transverse velocity in the wake region allows the introduction of an active closed-loop control. The experimental results are in good agreement with the numerical simulation studies conducted by other researchers for cylinders with MSBC. (C) 2012 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The present work propounds an inverse method to estimate the heat sources in the transient two-dimensional heat conduction problem in a rectangular domain with convective bounders. The non homogeneous partial differential equation (PDE) is solved using the Integral Transform Method. The test function for the heat generation term is obtained by the chip geometry and thermomechanical cutting. Then the heat generation term is estimated by the conjugated gradient method (CGM) with adjoint problem for parameter estimation. The experimental trials were organized to perform six different conditions to provide heat sources of different intensities. This method was compared with others in the literature and advantages are discussed. (C) 2012 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Context. Convergent point (CP) search methods are important tools for studying the kinematic properties of open clusters and young associations whose members share the same spatial motion. Aims. We present a new CP search strategy based on proper motion data. We test the new algorithm on synthetic data and compare it with previous versions of the CP search method. As an illustration and validation of the new method we also present an application to the Hyades open cluster and a comparison with independent results. Methods. The new algorithm rests on the idea of representing the stellar proper motions by great circles over the celestial sphere and visualizing their intersections as the CP of the moving group. The new strategy combines a maximum-likelihood analysis for simultaneously determining the CP and selecting the most likely group members and a minimization procedure that returns a refined CP position and its uncertainties. The method allows one to correct for internal motions within the group and takes into account that the stars in the group lie at different distances. Results. Based on Monte Carlo simulations, we find that the new CP search method in many cases returns a more precise solution than its previous versions. The new method is able to find and eliminate more field stars in the sample and is not biased towards distant stars. The CP solution for the Hyades open cluster is in excellent agreement with previous determinations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can performmultiple routes per day, all starting and ending at a single depot, and it is assigned to a single driverwhose totalwork hours are limited.Acolumn generation algorithmis proposed.The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performingmultiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.