Effect of the Topology and Delayed Interactions in Neuronal Networks Synchronization

As important as the intrinsic properties of an individual nervous cell stands the network of neurons in which it is embedded and by virtue of which it acquires great part of its responsiveness and functionality. In this study we have explored how the topological properties and conduction delays of several classes of neural networks affect the capacity of their constituent cells to establish well-defined temporal relations among firing of their action potentials. This ability of a population of neurons to produce and maintain a millisecond-precise coordinated firing (either evoked by external stimuli or internally generated) is central to neural codes exploiting precise spike timing for the representation and communication of information. Our results, based on extensive simulations of conductance-based type of neurons in an oscillatory regime, indicate that only certain topologies of networks allow for a coordinated firing at a local and long-range scale simultaneously. Besides network architecture, axonal conduction delays are also observed to be another important factor in the generation of coherent spiking. We report that such communication latencies not only set the phase difference between the oscillatory activity of remote neural populations but determine whether the interconnected cells can set in any coherent firing at all. In this context, we have also investigated how the balance between the network synchronizing effects and the dispersive drift caused by inhomogeneities in natural firing frequencies across neurons is resolved. Finally, we show that the observed roles of conduction delays and frequency dispersion are not particular to canonical networks but experimentally measured anatomical networks such as the macaque cortical network can display the same type of behavior

Vascular Liver Disorders, Portal Vein Thrombosis, and Procedural Bleeding in Patients With Liver Disease:2020 Practice Guidance by the American Association for the Study of Liver Diseases

An overview of the current understanding of bleeding and thrombosis in cirrhosis. An evidence-based justification for bleeding risk assessment in patients with cirrhosis prior to invasive procedures, including current concepts in preprocedural testing and laboratory analysis and their role in predicting bleeding complications. An outline of established and recently identified risk factors for venous thrombosis in the portal and hepatic venous systems in both patients with and without cirrhosis along with thrombophilia testing recommendations

Transcription profiling reveals potential mechanisms of dysbiosis in the oral microbiome of rhesus macaques with chronic untreated SIV infection.

A majority of individuals infected with human immunodeficiency virus (HIV) have inadequate access to antiretroviral therapy and ultimately develop debilitating oral infections that often correlate with disease progression. Due to the impracticalities of conducting host-microbe systems-based studies in HIV infected patients, we have evaluated the potential of simian immunodeficiency virus (SIV) infected rhesus macaques to serve as a non-human primate model for oral manifestations of HIV disease. We present the first description of the rhesus macaque oral microbiota and show that a mixture of human commensal bacteria and "macaque versions" of human commensals colonize the tongue dorsum and dental plaque. Our findings indicate that SIV infection results in chronic activation of antiviral and inflammatory responses in the tongue mucosa that may collectively lead to repression of epithelial development and impact the microbiome. In addition, we show that dysbiosis of the lingual microbiome in SIV infection is characterized by outgrowth of Gemella morbillorum that may result from impaired macrophage function. Finally, we provide evidence that the increased capacity of opportunistic pathogens (e.g. E. coli) to colonize the microbiome is associated with reduced production of antimicrobial peptides

New prioritized value iteration for Markov decision processes

The problem of solving large Markov decision processes accurately and quickly is challenging. Since the computational effort incurred is considerable, current research focuses on finding superior acceleration techniques. For instance, the convergence properties of current solution methods depend, to a great extent, on the order of backup operations. On one hand, algorithms such as topological sorting are able to find good orderings but their overhead is usually high. On the other hand, shortest path methods, such as Dijkstra's algorithm which is based on priority queues, have been applied successfully to the solution of deterministic shortest-path Markov decision processes. Here, we propose an improved value iteration algorithm based on Dijkstra's algorithm for solving shortest path Markov decision processes. The experimental results on a stochastic shortest-path problem show the feasibility of our approach. © Springer Science+Business Media B.V. 2011.García Hernández, MDG.; Ruiz Pinales, J.; Onaindia De La Rivaherrera, E.; Aviña Cervantes, JG.; Ledesma Orozco, S.; Alvarado Mendez, E.; Reyes Ballesteros, A. (2012). New prioritized value iteration for Markov decision processes. Artificial Intelligence Review. 37(2):157-167. doi:10.1007/s10462-011-9224-zS157167372Agrawal S, Roth D (2002) Learning a sparse representation for object detection. In: Proceedings of the 7th European conference on computer vision. Copenhagen, Denmark, pp 1–15Bellman RE (1954) The theory of dynamic programming. Bull Amer Math Soc 60: 503–516Bellman RE (1957) Dynamic programming. Princeton University Press, New JerseyBertsekas DP (1995) Dynamic programming and optimal control. Athena Scientific, MassachusettsBhuma K, Goldsmith J (2003) Bidirectional LAO* algorithm. In: Proceedings of indian international conferences on artificial intelligence. p 980–992Blackwell D (1965) Discounted dynamic programming. Ann Math Stat 36: 226–235Bonet B, Geffner H (2003a) Faster heuristic search algorithms for planning with uncertainty and full feedback. In: Proceedings of the 18th international joint conference on artificial intelligence. Morgan Kaufmann, Acapulco, México, pp 1233–1238Bonet B, Geffner H (2003b) Labeled RTDP: improving the convergence of real-time dynamic programming. In: Proceedings of the international conference on automated planning and scheduling. Trento, Italy, pp 12–21Bonet B, Geffner H (2006) Learning depth-first search: a unified approach to heuristic search in deterministic and non-deterministic settings and its application to MDP. In: Proceedings of the 16th international conference on automated planning and scheduling. Cumbria, UKBoutilier C, Dean T, Hanks S (1999) Decision-theoretic planning: structural assumptions and computational leverage. J Artif Intell Res 11: 1–94Chang I, Soo H (2007) Simulation-based algorithms for Markov decision processes Communications and control engineering. Springer, LondonDai P, Goldsmith J (2007a) Faster dynamic programming for Markov decision processes. Technical report. Doctoral consortium, department of computer science and engineering. University of WashingtonDai P, Goldsmith J (2007b) Topological value iteration algorithm for Markov decision processes. In: Proceedings of the 20th international joint conference on artificial intelligence. Hyderabad, India, pp 1860–1865Dai P, Hansen EA (2007c) Prioritizing bellman backups without a priority queue. In: Proceedings of the 17th international conference on automated planning and scheduling, association for the advancement of artificial intelligence. Rhode Island, USA, pp 113–119Dibangoye JS, Chaib-draa B, Mouaddib A (2008) A Novel prioritization technique for solving Markov decision processes. In: Proceedings of the 21st international FLAIRS (The Florida Artificial Intelligence Research Society) conference, association for the advancement of artificial intelligence. Florida, USAFerguson D, Stentz A (2004) Focused propagation of MDPs for path planning. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence. pp 310–317Hansen EA, Zilberstein S (2001) LAO: a heuristic search algorithm that finds solutions with loops. Artif Intell 129: 35–62Hinderer K, Waldmann KH (2003) The critical discount factor for finite Markovian decision processes with an absorbing set. Math Methods Oper Res 57: 1–19Li L (2009) A unifying framework for computational reinforcement learning theory. PhD Thesis. The state university of New Jersey, New Brunswick. NJLittman ML, Dean TL, Kaelbling LP (1995) On the complexity of solving Markov decision problems.In: Proceedings of the 11th international conference on uncertainty in artificial intelligence. Montreal, Quebec pp 394–402McMahan HB, Gordon G (2005a) Fast exact planning in Markov decision processes. In: Proceedings of the 15th international conference on automated planning and scheduling. Monterey, CA, USAMcMahan HB, Gordon G (2005b) Generalizing Dijkstra’s algorithm and gaussian elimination for solving MDPs. Technical report, Carnegie Mellon University, PittsburghMeuleau N, Brafman R, Benazera E (2006) Stochastic over-subscription planning using hierarchies of MDPs. In: Proceedings of the 16th international conference on automated planning and scheduling. Cumbria, UK, pp 121–130Moore A, Atkeson C (1993) Prioritized sweeping: reinforcement learning with less data and less real time. Mach Learn 13: 103–130Puterman ML (1994) Markov decision processes. Wiley Editors, New YorkPuterman ML (2005) Markov decision processes. Wiley Inter Science Editors, New YorkRussell S (2005) Artificial intelligence: a modern approach. Making complex decisions (Ch-17), 2nd edn. Pearson Prentice Hill Ed., USAShani G, Brafman R, Shimony S (2008) Prioritizing point-based POMDP solvers. IEEE Trans Syst Man Cybern 38(6): 1592–1605Sniedovich M (2006) Dijkstra’s algorithm revisited: the dynamic programming connexion. Control Cybern 35: 599–620Sniedovich M (2010) Dynamic programming: foundations and principles, 2nd edn. Pure and Applied Mathematics Series, UKTijms HC (2003) A first course in stochastic models. Discrete-time Markov decision processes (Ch-6). Wiley Editors, UKVanderbei RJ (1996) Optimal sailing strategies. Statistics and operations research program, University of Princeton, USA ( http://www.orfe.princeton.edu/~rvdb/sail/sail.html )Vanderbei RJ (2008) Linear programming: foundations and extensions, 3rd edn. Springer, New YorkWingate D, Seppi KD (2005) Prioritization methods for accelerating MDP solvers. J Mach Learn Res 6: 851–88

Low NKp30, NKp46 and NKG2D expression and reduced cytotoxic activity on NK cells in cervical cancer and precursor lesions

<p>Abstract</p> <p>Background</p> <p>Persistent high risk HPV infection can lead to cervical cancer, the second most common malignant tumor in women worldwide. NK cells play a crucial role against tumors and virus-infected cells through a fine balance between activating and inhibitory receptors. Expression of triggering receptors NKp30, NKp44, NKp46 and NKG2D on NK cells correlates with cytolytic activity against tumor cells, but these receptors have not been studied in cervical cancer and precursor lesions. The aim of the present work was to study NKp30, NKp46, NKG2D, NKp80 and 2B4 expression in NK cells from patients with cervical cancer and precursor lesions, in the context of HPV infection.</p> <p>Methods</p> <p>NKp30, NKp46, NKG2D, NKp80 and 2B4 expression was analyzed by flow cytometry on NK cells from 59 patients with cervical cancer and squamous intraepithelial lesions. NK cell cytotoxicity was evaluated in a 4 hour CFSE/7-AAD flow cytometry assay. HPV types were identified by PCR assays.</p> <p>Results</p> <p>We report here for the first time that NK cell-activating receptors NKp30 and NKp46 are significantly down-regulated in cervical cancer and high grade squamous intraepithelial lesion (HGSIL) patients. NCRs down-regulation correlated with low cytolytic activity, HPV-16 infection and clinical stage. NKG2D was also down-regulated in cervical cancer patients.</p> <p>Conclusion</p> <p>Our results suggest that NKp30, NKp46 and NKG2D down-regulation represent an evasion mechanism associated to low NK cell activity, HPV-16 infection and cervical cancer progression.</p

SARS-CoV-2 Catalonia contact tracing program : evaluation of key performance indicators

Background: Guidance on SARS-CoV-2 contact tracing indicators have been recently revised by international public health agencies. The aim of the study is to describe and analyse contact tracing indicators based on Catalonia's (Spain) real data and proposing to update them according to recommendations. Methods: Retrospective cohort analysis including Catalonia's contact tracing dataset from 20 May until 31 December 2020. Descriptive statistics are performed including sociodemographic stratification by age, and differences are assessed over the study period. Results: We analysed 923,072 contacts from 301,522 SARS-CoV-2 cases with identified contacts (67.1% contact tracing coverage). The average number of contacts per case was 4.6 (median 3, range 1-243). A total of 403,377 contacts accepted follow-up through three phone calls over a 14-day quarantine period (84.5% of contacts requiring follow-up). The percentage of new cases declared as contacts 14 days prior to diagnosis evolved from 33.9% in May to 57.9% in November. All indicators significantly improved towards the target over time (p < 0.05 for all four indicators). Conclusions: Catalonia's SARS-CoV-2 contact tracing indicators improved over time despite challenging context. The critical revision of the indicator's framework aims to provide essential information in control policies, new indicators proposed will improve system delay's follow-up. The study provides information on COVID-19 indicators framework experience from country's real data, allowing to improve monitoring tools in 2021-2022. With the SARS-CoV-2 pandemic being so harmful to health systems and globally, is important to analyse and share contact tracing data with the scientific community