Complexities for jumps and sweeps

The recently introduced model of one-way jumping finite automata skips over letters for which it does not have defined transitions instead of halting and rejecting as classical machines do. It is known that as an acceptor it is strictly more powerful than classical finite automata. The extra power comes from the ability of temporarily jumping over parts of the input. Here we define classes of machines and their accepted languages when this resource is bounded asymptotically, similar to computational complexity classes. We initiate the study of the gap between the resulting constant and linear jumping complexity classes. We conjecture that there is no intermediate jumping complexity but show that for a restriction of the model where the length of the jumped-over factors is limited, machines with logarithmic jumping complexity exist. We also introduce a measure called sweep complexity in order to get closer to a characterization of the regular language class in terms of one-way jumping machines with limited resources.</div

Additional file 2 of Health financing challenges in Southeast Asian countries for universal health coverage: a systematic review

Additional file 2: Appendix 2. Evidence Summary Table

Additional file 1 of Health financing challenges in Southeast Asian countries for universal health coverage: a systematic review

Additional file 1: Appendix 1. Search strategies used in various databases

Personnels civils extérieurs (2e volume) : employés et agents de maîtrise, volume mis à jour à la date du 2 mai 1938

Contient une table des matièresAvec mode text

PRISMA 2009 checklist -Supplemental material for Stroke care in Africa: A systematic review of the literature

<p>Supplemental material, PRISMA 2009 checklist for Stroke care in Africa: A systematic review of the literature by Gerard Urimubenshi, Dominique A Cadilhac, Jeanne N Kagwiza, Olivia Wu and Peter Langhorne in International Journal of Stroke</p

Additional file 1: of Implementing a complex rehabilitation intervention in a stroke trial: a qualitative process evaluation of AVERT

Appendix 1 Supporting quotations. (DOCX 46 kb

MetaBayesDTA: codeless Bayesian meta-analysis of test accuracy, with or without a gold standard.

BackgroundThe statistical models developed for meta-analysis of diagnostic test accuracy studies require specialised knowledge to implement. This is especially true since recent guidelines, such as those in Version 2 of the Cochrane Handbook of Systematic Reviews of Diagnostic Test Accuracy, advocate more sophisticated methods than previously. This paper describes a web-based application - MetaBayesDTA - that makes many advanced analysis methods in this area more accessible.ResultsWe created the app using R, the Shiny package and Stan. It allows for a broad array of analyses based on the bivariate model including extensions for subgroup analysis, meta-regression and comparative test accuracy evaluation. It also conducts analyses not assuming a perfect reference standard, including allowing for the use of different reference tests.ConclusionsDue to its user-friendliness and broad array of features, MetaBayesDTA should appeal to researchers with varying levels of expertise. We anticipate that the application will encourage higher levels of uptake of more advanced methods, which ultimately should improve the quality of test accuracy reviews

Additional file 4: Table S2. of Pharmacological regimens for eradication of Helicobacter pylori: an overview of systematic reviews and network meta-analysis

Quality assessment of included studies based on revised AMSTAR checklist. (DOCX 17 kb

Additional file 2: of Comparison of the caries-protective effect of fluoride varnish with treatment as usual in nursery school attendees receiving preventive oral health support through the Childsmile oral health improvement programme — the Protecting Teeth@3 Study: a randomised controlled trial

CHU9D questionnaire – Nursery version. (DOCX 79 kb

Performance Matrix—HBV screening models.

<p>Performance Matrix—HBV screening models.</p