982 resultados para subset sum problems
Resumo:
A software package that efficiently solves a comprehensive range of problems based on coupled complex nonlinear stochastic ODEs and PDEs is outlined. Its input and output syntax is formulated as a subset of XML, thus making a step towards a standard for specifying numerical simulations.
Resumo:
The Alcohol Use Disorders Identification Test (AUDIT) has been used widely and is reported to be superior to conventional questionnaires in detection of current hazardous and harmful alcohol use. We assessed the validity of an Australian modification of the AUDIT (the AusAUDIT), which has been employed widely in Australian and New Zealand early intervention programmes. We used a cross-sectional study of 370 subjects from the follow-up phase of a randomized controlled trial of early intervention to reduce hazardous alcohol consumption. Scores on the AusAUDIT were compared against 12-month ICD-10 diagnoses of harmful alcohol use and dependence, as determined by the Composite International Diagnostic Interview, and against self-report of alcohol consumption exceeding Australian National Health and Medical Research Council (NH&MRC) recommended limits. AusAUDIT had good internal consistency and discriminated significantly between persons meeting criteria for ICD-10 alcohol use disorders, and drinkers who did not. At currently recommended cut-off scores, AusAUDIT detected more than 85% of people meeting criteria for ICD-10 alcohol use disorders, or drinking over NH&MRC recommended limits, but its specificity was limited (29% in men, and 58% in women for drinking over NH&MRC limits). No subset of questions performed as well as the full AusAUDIT in detection of drinking problems, but the alcohol consumption items provided a reasonable screen for drinking over NH&MRC limits. We conclude that AusAUDIT is effective in detecting problematic drinking, but positive cases should be confirmed by clinical assessment. The findings illustrate the need for validation of questionnaire modifications, and the difficulty in increasing test sensitivity without reducing specificity.
Resumo:
The problem of designing spatially cohesive nature reserve systems that meet biodiversity objectives is formulated as a nonlinear integer programming problem. The multiobjective function minimises a combination of boundary length, area and failed representation of the biological attributes we are trying to conserve. The task is to reserve a subset of sites that best meet this objective. We use data on the distribution of habitats in the Northern Territory, Australia, to show how simulated annealing and a greedy heuristic algorithm can be used to generate good solutions to such large reserve design problems, and to compare the effectiveness of these methods.
Resumo:
Background: Patients who play musical instruments (especially wind and stringed instruments) and vocalists are prone to particular types of orofacial problems. Some problems are caused by playing and some are the result of dental treatment. This paper proposes to give an insight into these problems and practical guidance to general practice dentists. Method: Information in this paper is gathered from studies published in dental, music and occupational health journals, and from discussions with career musicians and music teachers. Results: Orthodontic problems, soft tissue trauma, focal dystonia, denture retention, herpes labialis, dry mouth and temporomandibular joint (TMJ) disorders were identified as orofacial problems of career musicians. Options available for prevention and palliative treatment as well as instrument selection are suggested to overcome these problems. Conclusions: Career musicians express reluctance to attend dentists who are not sensitive to their specific needs. General practitioner dentists who understand how the instruments impact on the orofacial structures and are aware of potential problems faced by musicians are able to offer preventive advice and supportive treatment to these patients, especially those in the early stages of their career.
Resumo:
Many of the asexual stage Plasmodium falciparum proteins that are the targets of host protective responses are markedly polymorphic. The full repertoire of diversity is not defined for any antigen. Most studies have focused on the genes encoding merozoite surface proteins 1 and 2 (MSP1, MSP2). We explored the extent of diversity of some of the less studied merozoite surface antigens and analyzed the degree of complexity of malaria field isolates by deriving nucleotide sequences of several antigens. We have determined the genotype of apical membrane antigen 1 (AMA1) in a group of 30 field samples, collected over 29 months, from individuals living in an area of intense malaria transmission in Irian Jaya, identifying 14 different alleles. AMA1 genotyping was combined with previously determined MSP2 typing. AMA1 had the greatest power in distinguishing between isolates but methodological problems, especially when mixed infections are present, suggest it is not an ideal typing target. MSP1, MSP3, and glutamate-rich protein genotypes were also determined from a smaller group of samples, and all results were combined to derive an extended antigenic haplotype. Within this subset of 10 patients, nine different genotypes could be discerned; however, five patients were all infected with the same strain. This strain was present in individuals from two separate villages and was still present 12 months later. This strain was predominant at the first time point but had disappeared at the fourth time point. This significant change in malaria genotypes could be due to strain-specific immunity developing in this population.
Resumo:
We study difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order ordinary differential equations. We formulate conditions which guarantee a priori bounds on first differences of solutions to the discretized problem. We establish existence results for solutions to the discretized boundary value problems subject to nonlinear boundary conditions. We apply our results to show that solutions to the discrete problem converge to solutions of the continuous problem in an aggregate sense. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
We give conditions on f involving pairs of discrete lower and discrete upper solutions which lead to the existence of at least three solutions of the discrete two-point boundary value problem yk+1 - 2yk + yk-1 + f (k, yk, vk) = 0, for k = 1,..., n - 1, y0 = 0 = yn,, where f is continuous and vk = yk - yk-1, for k = 1,..., n. In the special case f (k, t, p) = f (t) greater than or equal to 0, we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and Peterson and are in the spirit of our results for the continuous analogue. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
We study the continuous problem y"=f(x,y,y'), xc[0,1], 0=G((y(0),y(1)),(y'(0), y'(1))), and its discrete approximation (y(k+1)-2y(k)+y(k-1))/h(2) =f(t(k), y(k), v(k)), k = 1,..., n-1, 0 = G((y(0), y(n)), (v(1), v(n))), where f and G = (g(0), g(1)) are continuous and fully nonlinear, h = 1/n, v(k) = (y(k) - y(k-1))/h, for k =1,..., n, and t(k) = kh, for k = 0,...,n. We assume there exist strict lower and strict upper solutions and impose additional conditions on f and G which are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. We show that the discrete approximation also has solutions which approximate solutions of the continuous problem and converge to the solution of the continuous problem when it is unique, as the grid size goes to 0. Homotopy methods can be used to compute the solution of the discrete approximation. Our results were motivated by those of Gaines.
Resumo:
Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
We investigate difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order, ordinary differential equations. We formulate conditions under which all solutions to the discrete problem satisfy certain a priori bounds which axe independent of the step-size. As a result, the nonexistence of spurious solutions are guaranteed. Some existence and convergence theorems for solutions to the discrete problem are also presented. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
Error condition detected We consider discrete two-point boundary value problems of the form D-2 y(k+1) = f (kh, y(k), D y(k)), for k = 1,...,n - 1, (0,0) = G((y(0),y(n));(Dy-1,Dy-n)), where Dy-k = (y(k) - Yk-I)/h and h = 1/n. This arises as a finite difference approximation to y" = f(x,y,y'), x is an element of [0,1], (0,0) = G((y(0),y(1));(y'(0),y'(1))). We assume that f and G = (g(0), g(1)) are continuous and fully nonlinear, that there exist pairs of strict lower and strict upper solutions for the continuous problem, and that f and G satisfy additional assumptions that are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. Under these assumptions we show that there are at least three distinct solutions of the discrete approximation which approximate solutions to the continuous problem as the grid size, h, goes to 0. (C) 2003 Elsevier Science Ltd. All rights reserved.