Базовый алгоритм действия системы поддержки принятия решений

We consider two-player parity games played on transition graphs of higher order pushdown automata. They are ``game-equivalent'' to a kind of model-checking game played on graphs of the infinite hierarchy introduced recently by Caucal. Then in this hierarchy we show how to reduce a game to a graph of lower level. This leads to an effective solution and a construction of the winning strategies

Serum NGAL, BNP, PTH, and albumin do not improve glomerular filtration rate estimating formulas in children.

Glomerular filtration rate (GFR) is difficult to measure, and estimating formulas are notorious for lacking precision. This study aims to assess if the inclusion of additional biomarkers improves the performance of eGFR formulas. A hundred and sixteen children with renal diseases were enrolled. Data for age, weight, height, inulin clearance (iGFR), serum creatinine, cystatin C, neutrophil gelatinase-associated lipocalin (NGAL), parathyroid hormone (PTH), albumin, and brain natriuretic peptide (BNP) were collected. These variables were added to the revised and combined (serum creatinine and cystatin C) Schwartz formulas, and the quadratic and combined quadratic formulas. We calculated the adjusted r-square (r <sup>2</sup> ) in relation to iGFR and tested the improvement in variance explained by means of the likelihood ratio test. The combined Schwartz and the combined quadratic formulas yielded best results with an r <sup>2</sup> of 0.676 and 0.730, respectively. The addition of BNP and PTH to the combined Schwartz and quadratic formulas improved the variance slightly. NGAL and albumin failed to improve the prediction of GFR further. These study results also confirm that the addition of cystatin C improves the performance of estimating GFR formulas, in particular the Schwartz formula.Conclusion: The addition of serum NGAL, BNP, PTH, and albumin to the combined Schwartz and quadratic formulas for estimating GFR did not improve GFR prediction in our population. What is Known: • Estimating glomerular filtration rate (GFR) formulas include serum creatinine and/or cystatin C but lack precision when compared to measured GFR. • The serum concentrations of some biological parameters such as neutrophil gelatinase-associated lipocalin (NGAL), parathyroid hormone (PTH), albumin, and brain natriuretic peptide (BNP) vary with the level of renal function. What is New: • The addition of BNP and PTH to the combined quadratic formula improved its performance only slightly. NGAL and albumin failed to improve the prediction of GFR further

Regular Strategies in Pushdown Reachability Games

International audienceWe show that positional winning strategies in pushdown reachability games can be implemented by deterministic finite state au-tomata of exponential size. Such automata read the stack and control state of a given pushdown configuration and output the set of winning moves playable from that position. This result can originally be attributed to Kupferman, Piterman and Vardi using an approach based on two-way tree automata. We present a more direct approach that builds upon the popular saturation technique. Saturation for analysing pushdown systems has been successfully implemented by Moped and WALi. Thus, our approach has the potential for practical applications to controller-synthesis problems

Modular Strategies for Infinite Games on Recursive Graphs

In this paper, we focus on solving games in recursive game graphs that can model the control flow of sequential programs with recursive procedure calls. The winning condition is given as an ω-regular specification over the observable, and, unlike traditional pushdown games, the strategy is required to be modular: resolution of choices within a component should not depend on the context in which the component is invoked, but only on the history within the current invocation of the component. We first consider the case when the specification is given as a deterministic Büchi automaton. We show the problem to be decidable, and present a solution based on two-way alternating tree automata with time complexity that is polynomial in the number of internal nodes, exponential in the specification and exponential in the number of exits of the components. We show that the problem is EXPTIME-complete in general, and NP-complete for fixed-size specifications. Then, we show that the same complexity bounds apply if the specification is given as a universal co-Büchi automaton. Finally, for specifications given as formulas of linear temporal logic LTL, we obtain a synthesis algorithm that is doubly-exponential in the formula and singly exponential in the number of exits of components

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. These systems may be used to model higher-order programs and are closely related to the Caucal hierarchy of infinite graphs and safe higher-order recursion schemes. We consider the backwards-reachability problem over higher-order Alternating PDSs (APDSs), a generalisation of higher-order PDSs. This builds on and extends previous work on pushdown systems and context-free higher-order processes in a non-trivial manner. In particular, we show that the set of configurations from which a regular set of higher-order APDS configurations is reachable is regular and computable in n-EXPTIME. In fact, the problem is n-EXPTIME-complete. We show that this work has several applications in the verification of higher-order PDSs, such as linear-time model-checking, alternation-free mu-calculus model-checking and the computation of winning regions of reachability games

A hybrid human and machine resource curation pipeline for the Neuroscience Information Framework

The breadth of information resources available to researchers on the Internet continues to expand, particularly in light of recently implemented data-sharing policies required by funding agencies. However, the nature of dense, multifaceted neuroscience data and the design of contemporary search engine systems makes efficient, reliable and relevant discovery of such information a significant challenge. This challenge is specifically pertinent for online databases, whose dynamic content is ‘hidden’ from search engines. The Neuroscience Information Framework (NIF; http://www.neuinfo.org) was funded by the NIH Blueprint for Neuroscience Research to address the problem of finding and utilizing neuroscience-relevant resources such as software tools, data sets, experimental animals and antibodies across the Internet. From the outset, NIF sought to provide an accounting of available resources, whereas developing technical solutions to finding, accessing and utilizing them. The curators therefore, are tasked with identifying and registering resources, examining data, writing configuration files to index and display data and keeping the contents current. In the initial phases of the project, all aspects of the registration and curation processes were manual. However, as the number of resources grew, manual curation became impractical. This report describes our experiences and successes with developing automated resource discovery and semiautomated type characterization with text-mining scripts that facilitate curation team efforts to discover, integrate and display new content. We also describe the DISCO framework, a suite of automated web services that significantly reduce manual curation efforts to periodically check for resource updates. Lastly, we discuss DOMEO, a semi-automated annotation tool that improves the discovery and curation of resources that are not necessarily website-based (i.e. reagents, software tools). Although the ultimate goal of automation was to reduce the workload of the curators, it has resulted in valuable analytic by-products that address accessibility, use and citation of resources that can now be shared with resource owners and the larger scientific community

Three-Dimensional Neurophenotyping of Adult Zebrafish Behavior

The use of adult zebrafish (Danio rerio) in neurobehavioral research is rapidly expanding. The present large-scale study applied the newest video-tracking and data-mining technologies to further examine zebrafish anxiety-like phenotypes. Here, we generated temporal and spatial three-dimensional (3D) reconstructions of zebrafish locomotion, globally assessed behavioral profiles evoked by several anxiogenic and anxiolytic manipulations, mapped individual endpoints to 3D reconstructions, and performed cluster analysis to reconfirm behavioral correlates of high- and low-anxiety states. The application of 3D swim path reconstructions consolidates behavioral data (while increasing data density) and provides a novel way to examine and represent zebrafish behavior. It also enables rapid optimization of video tracking settings to improve quantification of automated parameters, and suggests that spatiotemporal organization of zebrafish swimming activity can be affected by various experimental manipulations in a manner predicted by their anxiolytic or anxiogenic nature. Our approach markedly enhances the power of zebrafish behavioral analyses, providing innovative framework for high-throughput 3D phenotyping of adult zebrafish behavior

A Spaetzle-like role for Nerve Growth Factor β in vertebrate immunity to Staphylococcus aureus

Many key components of innate immunity to infection are shared between Drosophila and humans. However, the fly Toll ligand Spaetzle is not thought to have a vertebrate equivalent. We have found that the structurally related cystine-knot protein, nerve growth factor β (NGFβ), plays an unexpected Spaetzle-like role in immunity to Staphylococcus aureus infection in chordates. Deleterious mutations of either human NGFβ or its high-affinity receptor tropomyosin-related kinase receptor A (TRKA) were associated with severe S. aureus infections. NGFβ was released by macrophages in response to S. aureus exoproteins through activation of the NOD-like receptors NLRP3 and NLRC4 and enhanced phagocytosis and superoxide-dependent killing, stimulated proinflammatory cytokine production, and promoted calcium-dependent neutrophil recruitment. TrkA knockdown in zebrafish increased susceptibility to S. aureus infection, confirming an evolutionarily conserved role for NGFβ-TRKA signaling in pathogen-specific host immunity