993 resultados para 2005-12-BS
Resumo:
The equivalence of two ways for the calculation of overlap integrals, i.e. the Sharp Rosenstock generating function method and the Doktorov coherent state method, has been proved. On the basis of the generating function of the overlap integrals, a new closed form expression for the Franck - Condon integrals for overlap multidimensional harmonic oscillators has been exactly derived. In addition, some useful analytical expressions for the calculations of the multimode Franck - Condon factors have been given.
Resumo:
One asymmetric transformation reaction Of L-proline (L-Pro) to D-proline was studied by a home-made capillary array electrophoresis (CAE) for the first time. The aldehyde catalysts and the organic acid solvents for the asymmetric transformation reaction were rapidly screened and the enantiomeric excess values of the asymmetric product Of L-Pro were directly obtained from the electrophoretogram of CAE.
Resumo:
Ao longo desses 25 anos, a Embrapa Acre, estrategicamente, efetuou mudanças nos rumos da pesquisa e desenvolvimento no Estado, procurando adequar-se às realidades das políticas vigentes e às tendências econômicas, sociais e ambientais locais e nacionais. Hoje, a imagem da Embrapa Acre é reconhecida pela qualidade técnica do seu trabalho e do seu comprometimento com o desenvolvimento sustentável da Amazônia. A dedicação de funcionários e a valiosa contribuição de parceiros das esferas públicas e privadas resultaram em informações e soluções tecnológicas para aumento da produtividade, melhoria da qualidade de vida e satisfação de clientes, usuá rios e beneficiários de nossos produtos, serviços e tecnologias. Nesta publicação, procuramos sintetizar todo o esforço desta caminhada, cujos resultados permitem contemplar a missão deste Centro de Pesquisa que é "viabilizar soluções tecnológicas para o desenvolvimento sustentável do agronegócio da Amazônia, com foco no Estado do Acre, por meio da geração, adaptação e transferência de conhecimentos e tecnologias, em benefício da sociedade."
Demandas tecnológicas para o sistema produtivo de borracha extrativa (Hevea spp.) no estado do Acre.
Resumo:
Este trabalho é parte do resultado do "Projeto Plataforma Tecnológica para o setor extrativista do estado do Acre".
Resumo:
Hughes, R. G., ''Possession is nine tenths of the law': Britain and the boundaries of Eastern Europe since 1945', Diplomacy and Statecraft, (2005) 16(4) pp.723-747 RAE2008
Resumo:
Wood, Ian; Geissert, M.; Heck, H.; Hieber, M., (2005) 'The Ornstein-Uhlenbeck semigroup in exterior domains', Archiv der Mathematik 86 pp.554-562 RAE2008
Resumo:
P.M. Hastie and W. Haresign (2006). A role for LH in the regulation of expression of mRNAs encoding components of the insulin-like growth factor (IGF) system in the ovine corpus luteum. Animal Reproduction Science, 96(1-2), 196-209. Sponsorship: DEFRA RAE2008
Resumo:
12 hojas : ilustraciones, fotografías a color.
Resumo:
18 hojas : ilustraciones.
Resumo:
10 hojas : ilustraciones.
Resumo:
The therapeutic effects of playing music are being recognized increasingly in the field of rehabilitation medicine. People with physical disabilities, however, often do not have the motor dexterity needed to play an instrument. We developed a camera-based human-computer interface called "Music Maker" to provide such people with a means to make music by performing therapeutic exercises. Music Maker uses computer vision techniques to convert the movements of a patient's body part, for example, a finger, hand, or foot, into musical and visual feedback using the open software platform EyesWeb. It can be adjusted to a patient's particular therapeutic needs and provides quantitative tools for monitoring the recovery process and assessing therapeutic outcomes. We tested the potential of Music Maker as a rehabilitation tool with six subjects who responded to or created music in various movement exercises. In these proof-of-concept experiments, Music Maker has performed reliably and shown its promise as a therapeutic device.
Resumo:
We present a type inference algorithm, in the style of compositional analysis, for the language TRAFFIC—a specification language for flow composition applications proposed in [2]—and prove that this algorithm is correct: the typings it infers are principal typings, and the typings agree with syntax-directed type checking on closed flow specifications. This algorithm is capable of verifying partial flow specifications, which is a significant improvement over syntax-directed type checking algorithm presented in [3]. We also show that this algorithm runs efficiently, i.e., in low-degree polynomial time.
Resumo:
When analysing the behavior of complex networked systems, it is often the case that some components within that network are only known to the extent that they belong to one of a set of possible "implementations" – e.g., versions of a specific protocol, class of schedulers, etc. In this report we augment the specification language considered in BUCSTR-2004-021, BUCS-TR-2005-014, BUCS-TR-2005-015, and BUCS-TR-2005-033, to include a non-deterministic multiple-choice let-binding, which allows us to consider compositions of networking subsystems that allow for looser component specifications.
Resumo:
We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed System E which augments intersection types with expansion variables. The inferred typing for M is obtained by setting up a unification problem involving both type variables and expansion variables, which we solve with a confluent rewrite system. The inference procedure is compositional in the sense that typings for different program components can be inferred in any order, and without knowledge of the definition of other program components. Using expansion variables lets us achieve a compositional inference procedure easily. Termination of the procedure is generally undecidable. The procedure terminates and returns a typing if the input M is normalizing according to call-by-name (resp., call-by-value). The inferred typing is exact in the sense that the exact call-by-name (resp., call-by-value) behaviour of M can be obtained by a (polynomial) transformation of the typing. The inferred typing is also principal in the sense that any other typing that translates the call-by-name (resp., call-by-value) evaluation of M can be obtained from the inferred typing for M using a substitution-based transformation.