Table_1_Effects of home-based interventions using exergames on physical and cognitive functions in community-dwelling older adults: a PRISMA-P-compliant protocol for a systematic review.DOCX

IntroductionPhysical activity and exercise are crucial to counteract physical and cognitive decline in old age. Home-based exergame training can be a solution to overcome physical inactivity. This systematic review aims to provide a comprehensive overview of home-based exergame interventions and evaluate their effectiveness in improving cognitive and physical functions through physical activity enhancement in older adults.Methods and analysisWe are conducting a systematic literature search including studies examining (1) community-dwelling older adults aged 60 years and older without any specific disease, (2) exergame-based exercise programs that take place at least partially in a home setting, and (3) intervention-related physical and/or cognitive outcomes. We will include randomized controlled trials and any other type of pre-post study published in English. There are no restrictions in terms of control group type and publication date. A search string was created and used in PubMed, Web of Science, Embase, Scopus and CINAHL. In addition, a hand search is carried out. This involves checking the references of the included studies and searching Google Scholar for further studies. The included studies will be summarized and, if homogeneity is sufficient, a random-effects meta-analysis will be performed. We will assess the risk of bias using RoB 2.0 and ROBINS-I.ConclusionThe findings of this systematic review will help to define the most suitable exergame programs to counteract cognitive and physical decline in older adults. Additionally, they will inform the development of effective home-based exergame systems and point to future pathways of digital rehabilitation in older adults.RegistrationProspero (ID: CRD42023374234).</p

The Cathodic Breakdown Test to Assess Chromic Acid Anodized Aluminum Alloys Corrosion Protection Performance, in Correlation with Salt Spray (Fog) Testing

Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classical problem of listing cycles, we study how to list chordless cycles. The best known solution to list all the C chordless cycles contained in an undirected graph G\u2009=\u2009(V,E) takes O(|E|2\u2009+\u2009|E| \ub7C) time. In this paper we provide an algorithm taking O\u303 (|E|+|V| c5C) time. We also show how to obtain the same complexity for listing all the P chordless st-paths in G (where C is replaced by P)

Structure and characterization of isopyoverdin from Pseudomonas putida BTP1 and its relation to the biogenetic pathway leading to pyoverdins.

Pyoverdin type siderophores produced by six fluorescent Pseudomonas strains isolated from different rhizospheres were purified and characterized. The purified ferri-pyoverdins were tested for their ability to promote the growth of other strains grown under iron deficiency conditions. Only the one obtained from Pseudomonas putida BTP1 did not act as a growth promoter. The structure of the BTP1 siderophore was elucidated by spectroscopic methods and degradation studies. It turned out that it contains a chromophore which differs from the one typical for pyoverdins insofar as it carries the carboxyl group in 3- rather than in 1-position ((3S)-5-amino-1,2-dihydro-8,9-dihydroxy-3H-pyrimido[1,2a]quinoline-3- carboxylic acid). The amino group of the chromophore is substituted with the 5-carboxyl group of L-glutamic acid and its carboxyl group with the N-terminus of the peptide L-Asp-L-Ala-L-Asp-D-N5-Ac-N5-OH-Orn-L-Ser-L-c-N5-OH-Orn. This isopyoverdin fits into the biogenetic scheme which postulates ferribactins as the precursors of pyoverdins

A new characterization of P6-free graphs.

We study P 6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P 6-free if and only if each connected induced subgraph of G on more than one vertex contains a dominating induced cycle on six vertices or a dominating (not necessarily induced) complete bipartite subgraph. This characterization is minimal in the sense that there exists an infinite family of P 6-free graphs for which a smallest connected dominating subgraph is a (not induced) complete bipartite graph. Our characterization of P 6-free graphs strengthens results of Liu and Zhou, and of Liu, Peng and Zhao. Our proof has the extra advantage of being constructive: we present an algorithm that finds such a dominating subgraph of a connected P 6-free graph in polynomial time. This enables us to solve the Hypergraph 2-Colorability problem in polynomial time for the class of hypergraphs with P 6-free incidence graphs