16 resultados para modello @ppZTL android QR-Code GPS NFC
em University of Queensland eSpace - Australia
Resumo:
The most recent National Health Survey reports that more than 80% of women initiate breastfeeding, while recent studies describe initiation rates of more than 90%. Yet fewer than 50% of women continue to breastfeed for 6 months or longer. This is at odds with National Health and Medical Research Council recommendations that 80% of infants be exclusively breastfed for the first 6 months of life. Women are more likely to initiate and continue to breastfeed if their doctor supports and encourages them to do so. Conversely, women perceive a neutral attitude by doctors toward breastfeeding to be similar to a negative attitude. Therefore, while doctors may not perceive their support or encouragement to be a determining factor in a woman’s breastfeeding decisions, women often place great emphasis on their GP's attitude to breastfeeding and are much more likely to think that information provided by a doctor is important. No previous research in Australia has addressed the issue of how GPs perceive their roles and responsibilities regarding breastfeeding. As part of a larger research project investigating the breastfeeding skills and knowledge of general practice registrars, this article reports the results of qualitative interviews with eight general practice registrars and their views and beliefs about GPs’ responsibilities to breastfeeding women.
Resumo:
The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.
Resumo:
An investigation was undertaken to test the effectiveness of two procedures for recording boundaries and plot positions for scientific studies on farms on Leyte Island, the Philippines. The accuracy of a Garmin 76 Global Positioning System (GPS) unit and a compass and chain was checked under the same conditions. Tree canopies interfered with the ability of the satellite signal to reach the GPS and therefore the GPS survey was less accurate than the compass and chain survey. Where a high degree of accuracy is required, a compass and chain survey remains the most effective method of surveying land underneath tree canopies, providing operator error is minimised. For a large number of surveys and thus large amounts of data, a GPS is more appropriate than a compass and chain survey because data are easily up-loaded into a Geographic Information System (GIS). However, under dense canopies where satellite signals cannot reach the GPS, it may be necessary to revert to a compass survey or a combination of both methods.
Resumo:
OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries, in particular, from explosions. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel for its simplicity and sufficiency for practical engineering design problems. The code uses a finite-volume formulation of the unsteady Euler equations with a second order explicit Runge-Kutta Godonov (MUSCL) scheme. Gradients are calculated using a least-squares method with a minmod limiter. Flux solvers used are AUSM, AUSMDV and EFM. No fluid-structure coupling or chemical reactions are allowed, but gas models can be perfect gas and JWL or JWLB for the explosive products. This report also describes the code’s ‘octree’ mesh adaptive capability and point-inclusion query procedures for the VCE geometry engine. Finally, some space will also be devoted to describing code parallelization using the shared-memory OpenMP paradigm. The user manual to the code is to be found in the companion report 2007/13.
Resumo:
OctVCE is a cartesian cell CFD code produced especially for numerical simulations of shock and blast wave interactions with complex geometries. Virtual Cell Embedding (VCE) was chosen as its cartesian cell kernel as it is simple to code and sufficient for practical engineering design problems. This also makes the code much more ‘user-friendly’ than structured grid approaches as the gridding process is done automatically. The CFD methodology relies on a finite-volume formulation of the unsteady Euler equations and is solved using a standard explicit Godonov (MUSCL) scheme. Both octree-based adaptive mesh refinement and shared-memory parallel processing capability have also been incorporated. For further details on the theory behind the code, see the companion report 2007/12.
Resumo:
Application of geographic information system (GIS) and global positioning system (GPS) technology in the Hlabisa community-based tuberculosis treatment programme documents the increase in accessibility to treatment after the expansion of the service from health facilities to include community workers and volunteers.
Resumo:
Background. The importance of general practice involvement in the care of attention-deficit/hyperactivity disorder (ADHD) is increasing due to the rising numbers of patients who present with the disorder. It has been suggested by consensus bodies that GPs should be identifying and referring patients at the severe end of the ADHD spectrum and managing those with less severe symptoms. However, GPs' views of their role in ADHD care are unknown. Objective. Our aim was to explore the attitudes and practices of Australian GPs towards the diagnosis and management of ADHD. Methods. We conducted a series of focus groups to explore GPs' beliefs regarding the causes of ADHD, their perceived role in ADHD diagnosis and management and their views on the role of behaviour therapies and pharmacotherapies in ADHD management. The subjects were 28 GPs in six focus groups. Results. GPs in this study did not want to be the primary providers of care for patients with ADHD. Participants indicated a preference to refer the patient to medical specialists for diagnosis and treatment of ADHD, and expressed low levels of interest in becoming highly involved in ADHD care. Concerns about overdiagnosis and misdiagnosis of the disorder, diagnostic complexity, time constraints, insufficient education and training about the disorder, and concerns regarding misuse and diversion of stimulant medications were the reasons cited for their lack of willingness. Conclusions. The Australian GPs in this study identify a role for themselves in ADHD care which is largely supportive in nature, and involves close liaison with specialist services.
Resumo:
A survey of hybridization in proper names and commercial signs. CODE-SWITCHING is commonly seen as more typical of the spoken language. But there are some areas of language use, including business names (e.g. restaurants), where foreign proper names, common nouns and sometimes whole phrases are imported into the written language too. These constitute a more stable variety of code-switching than the spontaneous and more unpredictable code-switching in the spoken language.
Resumo:
Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.