989 resultados para sleep stage


Relevância:

20.00% 20.00%

Publicador:

Resumo:

In order to obtain an overall and systematic understanding of the performance of a two-stage light gas gun (TLGG), a numerical code to simulate the process occurring in a gun shot is advanced based on the quasi-one-dimensional unsteady equations of motion with the real gas effect,;friction and heat transfer taken into account in a characteristic formulation for both driver and propellant gas. Comparisons of projectile velocities and projectile pressures along the barrel with experimental results from JET (Joint European Tons) and with computational data got by the Lagrangian method indicate that this code can provide results with good accuracy over a wide range of gun geometry and loading conditions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Analytic expression of pellet acceleration by constant base pressure with consideration of gas-wall friction, heat transfer and viscous dissipation that important for high speed injection is obtained. The process of compression stage is formulated by a set of governing equations and can be numerically integrated. Excellent confirmation with experiments is obtained and the ways to optimum match the compression stage with the launch stage are suggested.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a scheme to generate clusters submodels with stage ordering from a (symmetric or a nonsymmetric one) multistage stochastic mixed integer optimization model using break stage. We consider a stochastic model in compact representation and MPS format with a known scenario tree. The cluster submodels are built by storing first the 0-1 the variables, stage by stage, and then the continuous ones, also stage by stage. A C++ experimental code has been implemented for reordering the stochastic model as well as the cluster decomposition after the relaxation of the non-anticipativiy constraints until the so-called breakstage. The computational experience shows better performance of the stage ordering in terms of elapsed time in a randomly generated testbed of multistage stochastic mixed integer problems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Eterio Pajares, Raquel Merino y José Miguel Santamaría (eds.)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Larval kelp (Sebastes atrovirens), brown (S. auriculatus), and blackand-yellow (S. chrysomelas) rockfish were reared from known adults, to preflexion stage, nine days after birth for S. chrysomelas, to late postflexion stage for S. atrovirens, and to pelagic juvenile stage for S. auriculatus. Larval S. atrovirens and S. chrysomelas were about 4.6 mm body length (BL) and S. auriculatus about 5.2 mm BL at birth. Both S. atrovirens and S. auriculatus underwent notochord flexion at about 6–9 mm BL. Sebastes atrovirens transform to the pelagic juvenile stage at about 14–16 mm BL and S. auriculatus transformed at ca. 25 mm BL. Early larvae of all three species were characterized by melanistic pigment dorsally on the head, on the gut, on most of the ventral margin of the tail, and in a long series on the dorsal margin of the tail. Larval S. atrovirens and S. auriculatus developed a posterior bar on the tail during the flexion or postflexion stage. In S. atrovirens xanthic pigment resembled the melanistic pattern throughout larval development. Larval S. auriculatus lacked xanthophores except on the head until late preflexion stage, when a pattern much like the melanophore pattern gradually developed. Larval S. chrysomelas had extensive xanthic pigmentation dorsally, but none ventrally, in preflexion stage. All members of the Sebastes subgenus Pteropodus (S. atrovirens, S. auriculatus, S. carnatus, S. caurinus, S. chrysomelas, S. dalli, S. maliger, S. nebulosus, S. rastrelliger) are morphologically similar and all share the basic melanistic pigment pattern described here. Although the three species reared in this study can be distinguished on the basis of xanthic pigmentation, it seems unlikely that it will be possible to reliably identify field-collected larvae to species using traditional morphological and melanistic pigmentation characters. (PDF file contains 36 pages.)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES]Los cambios sociodemográficos y el aumento de la esperanza de vida han dado lugar a un aumento de algunas enfermedades, incluyendo la enfermedad de Alzheimer. La enfermedad de Alzheimer no sólo afecta a la persona que padece dicha enfermedad, sino que también repercute en la familia. Los cuidadores familiares son los que, de manera mayoritaria, se hacen cargo de la atención de estos pacientes con un compromiso de 24 horas, con lo que implica hacer cambios en sus estilos de vida. Los objetivos de este estudio son describir las características socio-demográficas, determinar la sobrecarga de los cuidadores informales y evaluar la calidad de sueño de los cuidadores. Se realizará un estudio transversal que incluirá a 40 cuidadores de enfermos de Alzheimer, seleccionados por un muestreo no probabilístico de selección por cuotas. Los participantes serán los cuidadores informales de pacientes con la enfermedad de Alzheimer que estén en el estadío III o IV de dicha enfermedad. Nuestra variable dependiente será el sueño y como variable independiente la sobrecarga. El estudio se realizará en la asociación de familiares de Alzheimer de Bilbao (A.F.A - Bizkaia), dónde se captará a la muestra de estudio y donde se procederá a aplicar los cuestionarios pertinentes para dicho estudio. Para participar en el estudio es necesario que firmen el consentimiento informado. Los instrumentos que se utilizarán son el cuestionario de Pittsburg que evalúa la calidad de sueño y la escala de carga de Zarit. Para el análisis de datos se utilizará el programa SPSS 15.0. Palabras clave: enfermedad de Alzheimer, cuidadores, cuidadores familiares, demencia, sobrecarga, sueño.