Differentiating origins of outflow tract ventricular arrhythmias: a comparison of three different electrocardiographic algorithms

Our objective is to evaluate the accuracy of three algorithms in differentiating the origins of outflow tract ventricular arrhythmias (OTVAs). This study involved 110 consecutive patients with OTVAs for whom a standard 12-lead surface electrocardiogram (ECG) showed typical left bundle branch block morphology with an inferior axis. All the ECG tracings were retrospectively analyzed using the following three recently published ECG algorithms: 1) the transitional zone (TZ) index, 2) the V2 transition ratio, and 3) V2 R wave duration and R/S wave amplitude indices. Considering all patients, the V2 transition ratio had the highest sensitivity (92.3%), while the R wave duration and R/S wave amplitude indices in V2 had the highest specificity (93.9%). The latter finding had a maximal area under the ROC curve of 0.925. In patients with left ventricular (LV) rotation, the V2 transition ratio had the highest sensitivity (94.1%), while the R wave duration and R/S wave amplitude indices in V2 had the highest specificity (87.5%). The former finding had a maximal area under the ROC curve of 0.892. All three published ECG algorithms are effective in differentiating the origin of OTVAs, while the V2 transition ratio, and the V2 R wave duration and R/S wave amplitude indices are the most sensitive and specific algorithms, respectively. Amongst all of the patients, the V2 R wave duration and R/S wave amplitude algorithm had the maximal area under the ROC curve, but in patients with LV rotation the V2 transition ratio algorithm had the maximum area under the ROC curve.

Randomized controlled trials of serotonin-norepinephrine reuptake inhibitor in treating major depressive disorder in children and adolescents: a meta-analysis of efficacy and acceptability

New generation antidepressant therapies, including serotonin-norepinephrine reuptake inhibitor (SNRIs), were introduced in the late 1980s; however, few comprehensive studies have compared the benefits and risks of various contemporary treatments for major depressive disorder (MDD) in young patients. A comprehensive literature search of PubMed, Cochrane, Embase, Web of Science, and PsycINFO databases was conducted from 1970 to January 2015. Only clinical trials that randomly assigned one SNRI or placebo to patients aged 7 to 18 years who met the diagnostic criteria for major depressive disorder were included. Treatment success, dropout rate, and suicidal ideation/attempt outcomes were measured. Primary efficacy was determined by pooling the risk ratios (RRs) of treatment response and remission. Acceptability was determined by pooling the RRs of dropouts for all reasons and for adverse effects as well as suicide-risk outcomes. Five trials with a total of 973 patients were included. SNRIs were not significantly more effective than placebo for treatment response but were for remission. The comparison of patients taking SNRIs that dropped out for all reasons and those taking placebo did not reach statistical significance. Significantly more patients taking SNRIs dropped out for adverse effects than those taking placebo. No significant difference was found in suicide-related risk outcomes. SNRI therapy does not display a superior efficacy and is not better tolerated compared to placebo in these young patients. However, duloxetine has a potential beneficial effect for depression in young populations, showing a need for further research.

Hardware Accelarated Visual Tracking Algorithms. A Systematic Literature Review

Many industrial applications need object recognition and tracking capabilities. The algorithms developed for those purposes are computationally expensive. Yet ,real time performance, high accuracy and small power consumption are essential measures of the system. When all these requirements are combined, hardware acceleration of these algorithms becomes a feasible solution. The purpose of this study is to analyze the current state of these hardware acceleration solutions, which algorithms have been implemented in hardware and what modifications have been done in order to adapt these algorithms to hardware.

3D Mesh Simplification. A survey of algorithms and CAD model simplification tests

Simplification of highly detailed CAD models is an important step when CAD models are visualized or by other means utilized in augmented reality applications. Without simplification, CAD models may cause severe processing and storage is- sues especially in mobile devices. In addition, simplified models may have other advantages like better visual clarity or improved reliability when used for visual pose tracking. The geometry of CAD models is invariably presented in form of a 3D mesh. In this paper, we survey mesh simplification algorithms in general and focus especially to algorithms that can be used to simplify CAD models. We test some commonly known algorithms with real world CAD data and characterize some new CAD related simplification algorithms that have not been surveyed in previous mesh simplification reviews.

Prevalência de tuberculose em transplantados renais: revisão sistemática e meta-análise

INTRODUÇÃO: A prevalência de tuberculose entre transplantados renais (TB-TXR) é maior do que na população geral. Assim, objetivamos realizar uma revisão sistemática e meta-análise da prevalência de TB-TXR. MÉTODOS: Após buscas eletrônicas e revisão de referências, estimou-se a prevalência agrupada de TB-TXR e realizou-se meta-regressão. Como referência para comparações, utilizou-se a prevalência de TB na população geral (0,18%; 95% IC = 0,16-0,20). RESULTADOS: Foram triados 253 estudos e 41 incluídos. A prevalência agrupada de TB-TXR foi 2,51% (95% IC = 2,17-2,85). Na meta-regressão, amostra > 2501 e alta prevalência de TB na população geral (p < 0,05) permaneceram associadas com a prevalência de TB-TXR. CONCLUSÃO: A prevalência agrupada de TB-TXR encontrada foi 14 vezes maior do que a prevalência de TB na população geral e, dessa forma, destacamos a necessidade de que o planejamento de medidas de prevenção e controle da TB específicas para este grupo de indivíduos seja pauta nas discussões do setor saúde.

Polimorfismo nulo dos genes GSTM1 e GSTT1 na suscetibilidade do câncer renal: evidências baseadas em meta-análise

ResumoIntroduçãoO câncer renal é uma doença oncourológica complexa e multifatorial.Objetivo:Realizar uma meta-análise para investigar a associação do polimorfismo nulo dos genes GSTM1 e GSTT1 no contexto do câncer renal.Método:Estudos em seres humanos, do tipo caso-controle, publicados no período de 1999 a 2013, que investigavam a associação do polimorfismo nulo dos genes GSTM1 e GSTT1 no câncer renal, foram agrupados para a confecção da presente meta-análise.Resultados:Foram selecionados 10 artigos sobre o tema proposto. Não foram encontradas associações entre o polimorfismo nulo dos genes GSTM1 (OR = 1,015; IC95% = 0,897-1,147) e GSTT1 (OR = 1,081; IC95% = 0,791- 1,479) e o câncer renal.Conclusões:Conclui-se que os polimorfismos nulos de GSTM1 e GSTT1 não estão associados ao risco do desenvolvimento de câncer renal, pois apresentam papel limitado, se é que existe alguma contribuição efetiva, no desenvolvimento dos tumores renais.

Chronic macro-economic and financial imbalances in the world economy: a meta-economic view

Global finance, combining offshore banking and universal banks to drive a broader globalization process, has transformed the modus operandi of the world economy. This requires a new "meta-economic" framework in which short-term portfolio-investment flows are treated as the dominant phenomenon they have become. Organized by global finance, these layered bi-directional flows between center and periphery manage a tension between financial concentration and monetary fragmentation. The resulting imbalances express the asymmetries built into that tension and render the exchange rate a more strategic policy variable than ever.

Efficient Algorithms for Coastal Geographic Problems

The increasing performance of computers has made it possible to solve algorithmically problems for which manual and possibly inaccurate methods have been previously used. Nevertheless, one must still pay attention to the performance of an algorithm if huge datasets are used or if the problem iscomputationally difficult. Two geographic problems are studied in the articles included in this thesis. In the first problem the goal is to determine distances from points, called study points, to shorelines in predefined directions. Together with other in-formation, mainly related to wind, these distances can be used to estimate wave exposure at different areas. In the second problem the input consists of a set of sites where water quality observations have been made and of the results of the measurements at the different sites. The goal is to select a subset of the observational sites in such a manner that water quality is still measured in a sufficient accuracy when monitoring at the other sites is stopped to reduce economic cost. Most of the thesis concentrates on the first problem, known as the fetch length problem. The main challenge is that the two-dimensional map is represented as a set of polygons with millions of vertices in total and the distances may also be computed for millions of study points in several directions. Efficient algorithms are developed for the problem, one of them approximate and the others exact except for rounding errors. The solutions also differ in that three of them are targeted for serial operation or for a small number of CPU cores whereas one, together with its further developments, is suitable also for parallel machines such as GPUs.

The use of explicit algorithms and episodic context to teach subtraction to students with learning problems in mathematics /

This research attempted to address the question of the role of explicit algorithms and episodic contexts in the acquisition of computational procedures for regrouping in subtraction. Three groups of students having difficulty learning to subtract with regrouping were taught procedures for doing so through either an explicit algorithm, an episodic content or an examples approach. It was hypothesized that the use of an explicit algorithm represented in a flow chart format would facilitate the acquisition and retention of specific procedural steps relative to the other two conditions. On the other hand, the use of paragraph stories to create episodic content was expected to facilitate the retrieval of algorithms, particularly in a mixed presentation format. The subjects were tested on similar, near, and far transfer questions over a four-day period. Near and far transfer algorithms were also introduced on Day Two. The results suggested that both explicit and episodic context facilitate performance on questions requiring subtraction with regrouping. However, the differential effects of these two approaches on near and far transfer questions were not as easy to identify. Explicit algorithms may facilitate the acquisition of specific procedural steps while at the same time inhibiting the application of such steps to transfer questions. Similarly, the value of episodic context in cuing the retrieval of an algorithm may be limited by the ability of a subject to identify and classify a new question as an exemplar of a particular episodically deflned problem type or category. The implications of these findings in relation to the procedures employed in the teaching of Mathematics to students with learning problems are discussed in detail.

Social physique anxiety across physical activity settings : a meta-analytical review

The purpose of this meta-analytic investigation was to review the empirical evidence specific to the effect of physical activity context on social physique anxiety (SP A). English language studies were located from computer and manual literature searches. A total of 146 initial studies were coded. Studies included in the meta-analysis presented at least one empirical effect for SPA between physical activity participants (i.e., athletes or exercisers) and non-physical activity participants. The final sample included thirteen studies, yielding 14 effect sizes, with a total sample size of 2846. Studies were coded for mean SPA between physical activity participants and non-physical activity participants. Moderator variables related to demographic and study characteristics were also coded. Using Hunter and Schmidt's (2004) protocol, statistical artifacts were corrected. Results indicate that, practically speaking, those who were physically active reported lower levels of SPA than the comparison group (dcorr = -.12; SDeorr.-=-;22). Consideration of the magnitude of the ES, the SDeorr, and confidence interval suggests that this effect is not statistically significant. While most moderator analyses reiterated this trend, some differences were worth noting. Previous research has identified SPA to be especially salient for females compared to males, however, in the current investigation, the magnitude of the ES' s comparing physical activity participants to the comparison group was similar (deorr = -.24 for females and deorr = -.23 for males). Also, the type of physical activity was investigated, and results showed that athletes reported lower levels of SP A than the comparison group (deorr = -.19, SDeorr = .08), whereas exercisers reported higher levels of SPA than the comparison group (deorr = .13, SDeorr = .22). Results demonstrate support for the dispositional nature of SP A. Consideration of practical significance suggests that those who are involved in physical activity may experience slightly lower levels of SPA than those not reporting physical activity participation. Results potentially offer support for the bi-directionality of the relationship between physical activity and SP A; however, a causality may not be inferred. More information about the type of physical activity (i.e., frequency/nature of exercise behaviour, sport classificationllevel of athletes) may help clarify the role of physical activity contexts on SPA.

Perceptions of intergroup bias : the roles of social projection and meta-stereotypes

Underlying intergroup perceptions include processes of social projection (perceiving personal traitslbeliefs in others, see Krueger 1998) and meta-stereotyping (thinking about other groups' perceptions of one's own group, see Vorauer et aI., 1998). Two studies were conducted to investigate social projection and meta-stereotypes in the domain of White-Black racial relations. Study 1, a correlational study, examined the social projection of prejudice and 'prejudiced' meta-stereotypes among Whites. Results revealed that (a) Whites socially projected their intergroup attitudes onto other Whites (and Blacks) [i.e., Whites higher in prejudice against Blacks believed a large percentage of Whites (Blacks) are prejudiced against Blacks (Whites), whereas Whites low in prejudice believed a smaller percentage of Whites (Blacks) are prejudiced]; (b) Whites held the meta:..stereotype that their group (Whites) is viewed by Blacks to be prejudiced; and (c) prejudiced meta-stereotypes may be formed through the social projection of intergroup attitudes (result of path-model tests). Further, several correlates of social projection and meta-stereotypes were identified, including the finding that feeling negatively stereotyped by an outgroup predicted outgroup avoidance through heightened intergroup anxiety. Study 2 replicated and extended these findings, investigating the social projection of ingroup favouritism and meta- and other-stereotypes about ingroup favouritism. These processes were examined experimentally using an anticipated intergroup contact paradigm. The goal was to understand the experimental conditions under which people would display the strongest social projection of intergroup attitudes, and when experimentally induced meta-stereotypes (vs. other-stereotypes; beliefs about the group 11 preferences of one's outgroup) would be most damaging to intergroup contact. White participants were randomly assigned to one of six conditions and received (alleged) feedback from a previously completed computer-based test. Depending on condition, this information suggested that: (a) the participant favoured Whites over Blacks; (b) previous White participants favoured Whites over Blacks; (c) the participant's Black partner favoured Blacks over Whites; (d) previous Black participants favoured Blacks over Whites; (e) the participant's Black partner viewed the participant to favour Whites over Blacks; or (£) Black participants previously participating viewed Whites to favour Whites over Blacks. In a defensive reaction, Whites exhibited enhanced social projection of personal intergroup attitudes onto their ingroup under experimental manipulations characterized by self-concept threat (i.e., when the computer revealed that the participant favoured the ingroup or was viewed to favour the ingroup). Manipulated meta- and otherstereotype information that introduced intergroup contact threat, on the other hand, each exerted a strong negative impact on intergroup contact expectations (e.g., anxiety). Personal meta-stereotype manipulations (i.e., when the participant was informed that her/ his partner thinks s/he favours the ingroup) exerted an especially negative impact on intergroup behaviour, evidenced by increased avoidance of the upcoming interracial interaction. In contrast, personal self-stereotype manipulations (i.e., computer revealed that one favoured the ingroup) ironically improved upcoming intergroup contact expectations and intentions, likely due to an attempt to reduce the discomfort of holding negative intergroup attitudes. Implications and directions for future research are considered.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

The practical application of a meta-analysis of deinstitutionalization : adaptive behaviour outcomes and the piloting of a transitional questionnaire for adults with intellectual disabilities

This investigation examined the effects of de institutionalization on the adaptive behaviour and adjustment of adults with intellectual disabilities (ID). In study 1, a meta-analysis was conducted with 23 studies on deinstitutionalization adaptive behaviour outcomes. Deinstitutionalization was associated with modest improvements in adaptive behaviour however outcomes varied across adaptive behaviour domains and other substantive variables. Clinical and service implications of these results were explicated. Noting the trends from the meta-analysis, study 2 used this information in refining and piloting an Agency Transition Survey used to evaluate community transitions for persons with ID. Information derived from the survey was found to be valuable and adequate for the effective evaluation of transitional success. Potential applications of the survey and meta-analysis results were illustrated.

Decoding algorithms using side-effect machines

Bioinformatics applies computers to problems in molecular biology. Previous research has not addressed edit metric decoders. Decoders for quaternary edit metric codes are finding use in bioinformatics problems with applications to DNA. By using side effect machines we hope to be able to provide efficient decoding algorithms for this open problem. Two ideas for decoding algorithms are presented and examined. Both decoders use Side Effect Machines(SEMs) which are generalizations of finite state automata. Single Classifier Machines(SCMs) use a single side effect machine to classify all words within a code. Locking Side Effect Machines(LSEMs) use multiple side effect machines to create a tree structure of subclassification. The goal is to examine these techniques and provide new decoders for existing codes. Presented are ideas for best practices for the creation of these two types of new edit metric decoders.