933 resultados para Weak focus of third order


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Bibliography: v.1, p. 381-398; v.2, p. 445-466.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Originally issued 1978.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Thesis (Master's)--University of Washington, 2016-06

Relevância:

100.00% 100.00%

Publicador:

Resumo:

For a parameter, we consider the modified relaxed energy of the liquid crystal system. Each minimizer of the modified relaxed energy is a weak solution to the liquid crystal equilibrium system. We prove the partial regularity of minimizers of the modified relaxed energy. We also prove the existence of infinitely many weak solutions for the special boundary value x.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Sticky ovitraps (patent pending) were used to sample female Aedes aegypti (L.) weekly in a focus of dengue activity in Cairns, Queensland, Australia. In February 2003, transmission of dengue virus serotype 2 began in the suburb of Parramatta Park, peaking in mid-March 2003. This suburb features many older, unscreened houses with high populations of Ae. aegypti. Highest densities (2-3.5 females per trap per week) were obtained during peak dengue transmission (January and February) before mosquito control was initiated. Beginning in late March, female Ae. aegypti collected in sticky ovitraps were tested for dengue viral RNA by using a TaqMan reverse transcription-polymerase chain reaction assay. Dengue viral RNA was detected in six pools of Ae. aegypti collected in late March. The highest minimum infection rate was 116/1000 mosquitoes. After the initiation of larval control (containers treated with S-methoprene or lambda-cyhalothrin) and adult control (interior harborage sites sprayed with lambda-cyhalothrin) in early March, trap collections dropped to

Relevância:

100.00% 100.00%

Publicador:

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we extend the refinement calculus for logic programs to include higher-order programming capabilities in specifications and programs, such as procedures as terms and lambda abstraction. We use a higher-order type and term system to describe programs, and provide a semantics for the higher-order language and refinement. The calculus is illustrated by refinement examples.