839 resultados para J22 - Time Allocation and Labor Supply


Relevância:

100.00% 100.00%

Publicador:

Resumo:

An approach for a unified description of the pion electromagnetic form factor in the space- and time-like regions, within a constituent quark model on the light front is briefly illustrated. Three main ingredients enter our approach: i) the on-shell quark-hadron vertex functions in the valence sector, ii) the dressed photon vertex where a photon decays in a quark-antiquark pair, and iii) the emission and absorption amplitudes of a pion by a quark. © 2005 American Institute of Physics.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The resolution and the linearity of time measurements made with the CMS electromagnetic calorimeter are studied with samples of data from test beam electrons, cosmic rays, and beam-produced muons. The resulting time resolution measured by lead tungstate crystals is better than 100 ps for energy deposits larger than 10 GeV. Crystal-to-crystal synchronization with a precision of 500 ps is performed using muons produced with the first LHC beams in 2008. © 2010 IOP Publishing Ltd and SISSA.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Includes bibliography

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper is concerned with a generalization of the Riemann- Stieltjes integral on time scales for deal with some aspects of discontinuous dynamic equations in which Riemann-Stieltjes integral does not works. © 2011 Academic Publications.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper presents a control method that is effective to reduce the degenerative effects of delay time caused by a treacherous network. In present application a controlled DC motor is part of an inverted pendulum and provides the equilibrium of this system. The control of DC motor is accomplished at the distance through a treacherous network, which causes delay time in the control signal. A predictive technique is used so that it turns the system free of delay. A robust digital sliding mode controller is proposed to control the free-delay system. Due to the random conditions of the network operation, a delay time detection and accommodation strategy is also proposed. A computer simulation is shown to illustrate the design procedures and the effectiveness of the proposed method. © 2011 IEEE.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Although vast areas in tropical regions have weathered soils with low potassium (K) levels, little is known about the effects of K supply on the photosynthetic physiology of trees. This study assessed the effects of K and sodium (Na) supply on the diffusional and biochemical limitations to photosynthesis in Eucalyptus grandis leaves. A field experiment comparing treatments receiving K (+K) or Na (+Na) with a control treatment (C) was set up in a K-deficient soil. The net CO2 assimilation rates were twice as high in +K and 1.6 times higher in +Na than in the C as a result of lower stomatal and mesophyll resistance to CO2 diffusion and higher photosynthetic capacity. The starch content was higher and soluble sugar was lower in +K than in C and +Na, suggesting that K starvation disturbed carbon storage and transport. The specific leaf area, leaf thickness, parenchyma thickness, stomatal size and intercellular air spaces increased in +K and +Na compared to C. Nitrogen and chlorophyll concentrations were also higher in +K and +Na than in C. These results suggest a strong relationship between the K and Na supply to E. grandis trees and the functional and structural limitations to CO2 assimilation rates. © 2013 John Wiley & Sons Ltd.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Includes bibliography

Relevância:

100.00% 100.00%

Publicador:

Resumo:

O objetivo do estudo foi analisar a associação entre qualidade do sono, prática de exercícios físicos no lazer e obesidade entre servidores públicos de uma universidade. A amostra foi composta por 92 adultos de ambos os sexos. Qualidade do sono e atividade física foram coletadas por meio de questionário. O excesso de peso/obesidade foi diagnosticado pelo índice de massa corporal, o qual foi calculado com valores de peso e estatura relatados pelos avaliados. A prevalência de pessoas com sono alterado foi de 53,84%. Houve associação entre obesidade (OR= 7,22 [ORIC95%: 1,65-31,5]) e pior qualidade do sono, bem como, prática de atividade física e melhor qualidade do sono (OR= 0,19 [ORIC95%: 0,04-0,95]), independente de outros fatores de confusão. Concluiu-se que há alta ocorrência de distúrbios do sono, a qual foi associada de maneira independente com a prática de exercícios físicos e a obesidade.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

OBJECTIVE: The aim of this study was to assess the time spent for direct (DBB - direct bracket bonding) and indirect (IBB - indirect bracket bonding) bracket bonding techniques. The time length of laboratorial (IBB) and clinical steps (DBB and IBB) as well as the prevalence of loose bracket after a 24-week follow-up were evaluated. METHODS: Seventeen patients (7 men and 10 women) with a mean age of 21 years, requiring orthodontic treatment were selected for this study. A total of 304 brackets were used (151 DBB and 153 IBB). The same bracket type and bonding material were used in both groups. Data were submitted to statistical analysis by Wilcoxon non-parametric test at 5% level of significance. RESULTS: Considering the total time length, the IBB technique was more time-consuming than the DBB (p < 0.001). However, considering only the clinical phase, the IBB took less time than the DBB (p < 0.001). There was no significant difference (p = 0.910) for the time spent during laboratorial positioning of the brackets and clinical session for IBB in comparison to the clinical procedure for DBB. Additionally, no difference was found as for the prevalence of loose bracket between both groups. CONCLUSION: the IBB can be suggested as a valid clinical procedure since the clinical session was faster and the total time spent for laboratorial positioning of the brackets and clinical procedure was similar to that of DBB. In addition, both approaches resulted in similar frequency of loose bracket.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.