Search

Your search keyword '"Liotta, Giuseppe"' showing total 240 results
Start Over Author "Liotta, Giuseppe" Publication Year Range Last 10 years Publication Type Academic Journals
240 results on '"Liotta, Giuseppe"'

10. Early identification of frailty: Developing an international delphi consensus on pre-frailty

Author

Sezgin, Duygu, O'Donovan, Mark, Woo, Jean, Bandeen-Roche, Karen, Liotta, Giuseppe, Fairhall, Nicola, Rodríguez-Laso, Angel, Apóstolo, João, Clarnette, Roger, Holland, Carol, Roller-Wirnsberger, Regina, Illario, Maddalena, Mañas, Leocadio Rodríguez, Vollenbroek-Hutten, Miriam, Doğu, Burcu Balam, Balci, Cafer, Pernas, Francisco Orfila, Paul, Constança, Ahern, Emer, Romero-Ortuno, Roman, Molloy, William, Cooney, Maria Therese, O'Shea, Diarmuid, Cooke, John, Lang, Deirdre, Hendry, Anne, Kennelly, Siobhán, Rockwood, Kenneth, Clegg, Andrew, Liew, Aaron, and O'Caoimh, Rónán

Published
2022
Full Text
View/download PDF

19. k-Planar Placement and Packing of Δ-Regular Caterpillars.

Author

Binucci, Carla, Di Giacomo, Emilio, Kaufmann, Michael, Liotta, Giuseppe, and Tappini, Alessandra

Subjects
CATERPILLARS, PLANAR graphs
Abstract

This paper studies a packing problem in the so-called beyond-planar setting, that is when the host graph is "almost-planar" in some sense. Precisely, we consider the case that the host graph is k -planar, i.e., it admits an embedding with at most k crossings per edge, and focus on families of Δ -regular caterpillars, that are caterpillars whose non-leaf vertices have the same degree Δ. We study the dependency of k from the number h of caterpillars that are packed, both in the case that these caterpillars are all isomorphic to one another (in which case the packing is called placement) and when they are not. We give necessary and sufficient conditions for the placement of h Δ -regular caterpillars and sufficient conditions for the packing of a set of Δ 1 -, Δ 2 -, ... , Δ h -regular caterpillars such that the degree Δ i and the degree Δ j of the non-leaf vertices can differ from one caterpillar to another, for 1 ≤ i , j ≤ h , i ≠ j. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

34. Relationship between People's Interest in Medication Adherence, Health Literacy, and Self-Care: An Infodemiological Analysis in the Pre- and Post-COVID-19 Era.

Author

Grandieri, Andrea, Trevisan, Caterina, Gentili, Susanna, Vetrano, Davide Liborio, Liotta, Giuseppe, and Volpato, Stefano

Subjects
HEALTH literacy, PATIENT compliance, PUBLIC opinion, HEALTH self-care, COVID-19 pandemic
Abstract

The prevalence of non-communicable diseases has risen sharply in recent years, particularly among older individuals who require complex drug regimens. Patients are increasingly required to manage their health through medication adherence and self-care, but about 50% of patients struggle to adhere to prescribed treatments. This study explored the relationship between interest in medication adherence, health literacy, and self-care and how it changed during the COVID-19 pandemic. We used Google Trends to measure relative search volumes (RSVs) for these three topics from 2012 to 2022. We found that interest in self-care increased the most over time, followed by health literacy and medication adherence. Direct correlations emerged between RSVs for medication adherence and health literacy (r = 0.674, p < 0.0001), medication adherence and self-care (r = 0.466, p < 0.0001), and health literacy and self-care (r = 0.545, p < 0.0001). After the COVID-19 pandemic outbreak, interest in self-care significantly increased, and Latin countries showed a greater interest in self-care than other geographical areas. This study suggests that people are increasingly interested in managing their health, especially in the context of the recent pandemic, and that infodemiology may provide interesting information about the attitudes of the population toward chronic disease management. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

39. Exploratory Factor Analysis (EFA) of the Short Functional Geriatric Evaluation (SFGE) to Assess the Multidimensionality of Frailty in Community-Dwelling Older Adults.

Author

Liotta, Giuseppe, Lorusso, Grazia, Madaro, Olga, Formosa, Valeria, Gialloreti, Leonardo Emberti, Donnoli, Clara, Riccardi, Fabio, Orlando, Stefano, Scarcella, Paola, Apostolo, Joao, Silva, Rosa, Dantas, Carina, van Staalduinen, Willeke, De Luca, Vincenzo, Illario, Maddalena, Gentili, Susanna, and Palombi, Leonardo

Published
2023
Full Text
View/download PDF

41. Assessment Tools of Biopsychosocial Frailty Dimensions in Community-Dwelling Older Adults: A Narrative Review.

Author

De Luca, Vincenzo, Femminella, Grazia Daniela, Patalano, Roberta, Formosa, Valeria, Lorusso, Grazia, Rivetta, Cristiano, Di Lullo, Federica, Mercurio, Lorenzo, Rea, Teresa, Salvatore, Elena, Korkmaz Yaylagul, Nilufer, Apostolo, Joao, Silva, Rosa Carla, Dantas, Carina, van Staalduinen, Willeke H., Liotta, Giuseppe, Iaccarino, Guido, Triassi, Maria, and Illario, Maddalena

Published
2022
Full Text
View/download PDF

47. Influence Maximization With Visual Analytics.

Author

Arleo, Alessio, Didimo, Walter, Liotta, Giuseppe, Miksch, Silvia, and Montecchiani, Fabrizio

Subjects
VISUAL analytics, ALGORITHMS, ONLINE social networks, SELECTION (Plant breeding), STOCHASTIC processes, SOCIAL networks
Abstract

In social networks, individuals’ decisions are strongly influenced by recommendations from their friends, acquaintances, and favorite renowned personalities. The popularity of online social networking platforms makes them the prime venues to advertise products and promote opinions. The Influence Maximization (IM) problem entails selecting a seed set of users that maximizes the influence spread, i.e., the expected number of users positively influenced by a stochastic diffusion process triggered by the seeds. Engineering and analyzing IM algorithms remains a difficult and demanding task due to the NP-hardness of the problem and the stochastic nature of the diffusion processes. Despite several heuristics being introduced, they often fail in providing enough information on how the network topology affects the diffusion process, precious insights that could help researchers improve their seed set selection. In this paper, we present VAIM, a visual analytics system that supports users in analyzing, evaluating, and comparing information diffusion processes determined by different IM algorithms. Furthermore, VAIM provides useful insights that the analyst can use to modify the seed set of an IM algorithm, so to improve its influence spread. We assess our system by: $(i)$ (i) a qualitative evaluation based on a guided experiment with two domain experts on two different data sets; $(ii)$ (i i) a quantitative estimation of the value of the proposed visualization through the ICE-T methodology by Wall et al. (IEEE TVCG - 2018). The twofold assessment indicates that VAIM effectively supports our target users in the visual analysis of the performance of IM algorithms. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

48. Orthogonal planarity testing of bounded treewidth graphs.

Author

Di Giacomo, Emilio, Liotta, Giuseppe, and Montecchiani, Fabrizio

Subjects
*INTEGERS
Abstract

Given a graph G and an integer b , OrthogonalPlanarity is the problem of testing whether G admits a planar orthogonal drawing with at most b bends. OrthogonalPlanarity is known to be NP -complete. We show that this problem belongs to the XP class when parameterized by treewidth. The proof exploits a fixed-parameter tractable approach that uses two more parameters besides treewidth, namely the natural parameter b and the number of vertices with degree at most two of G. Such approach is based on the new concept of sketched orthogonal representation, which synthetically describes a family of equivalent orthogonal drawings. The approach is general enough to be applicable to other related problems, namely HV-Planarity and FlexDraw. Also, in the special case of series-parallel graphs we obtain that both OrthogonalPlanarity and HV-Planarity can be solved in O (n 3 log ⁡ n) time, which improves on the previous O (n 4) bounds for these two. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

49. Seroprevalence of Brucella Infection in a Cohort of HIV-Positive Malawian Pregnant Women Living in Urban Areas.

Author

Baroncelli, Silvia, Tarantino, Michela, Galluzzo, Clementina Maria, Liotta, Giuseppe, Orlando, Stefano, Sagno, Jean Baptiste, Luhanga, Richard, Andreotti, Mauro, Petrucci, Paola, Amici, Roberta, Marazzi, Maria Cristina, Adone, Rosanna, and Giuliano, Marina

Subjects
PREGNANT women, BRUCELLA, CITIES & towns, SEROPREVALENCE, ROSE bengal, PREGNANCY complications, MISCARRIAGE, VIRAL antibodies
Abstract

Background: The seroprevalence of Brucella infection in sub-Saharan regions is high, and no recent data are available for Malawi, a country in which >60% of the population is involved in agropastoral activity. Aim: To evaluated the seroprevalence of Brucella in a cohort of HIV-positive pregnant women, living in an urban setting in Malawi. Methods: Sera of 201 pregnant women were tested for Brucella IgG. The Rose Bengal Plate Test and Serum Agglutination Tube test were used to determine antibody titer. Results: Five out of 201 (2.48%) women show positivity to Brucella, consistent with a past exposition to the infection. All five women delivered healthy infants, but two of them reported previous abortion/stillbirths, with a higher rate than those of the rest of the cohort (40% vs. 21.5%). Conclusions: This is one of the first reports of exposure of pregnant women to Brucella infection in Malawi, providing evidence of Brucella occurrence in an urban setting. Control programs should be introduced to reduce its impact on animal and human health. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

50. Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.

Author

Binucci, Carla, Didimo, Walter, Kaufmann, Michael, Liotta, Giuseppe, and Montecchiani, Fabrizio

Subjects
HEURISTIC algorithms, TASK analysis, GRAPH algorithms, DIRECTED graphs
Abstract

We study how to place arrow heads in directed graph drawings aiming at minimizing their overlaps and avoiding intersections between arrow heads and edges. The objective is to support users to correctly and quickly recognize edge orientations, i.e. to deduce unambiguously the edge orientations. Our contribution is two‐fold: (i) We present exact and heuristic algorithms for this arrow placement problem, along with an extensive experimental analysis of these techniques; and (ii) we report on a user study aimed to understand the impact of different arrow placement strategies on performing global and local analysis tasks on directed graph layouts. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results