46 research outputs found

    Breast cancer local recurrence risk in implant-based breast reconstruction with macrotexturized and microtexturized prosthesis: A multicentric retrospective cohort study

    Get PDF
    Background Nowadays, implant-based breast reconstruction is a common technique after mastectomy. The widespread use of implant employment is prompting significant concerns regarding the oncological safety of prostheses and the potential impact of surface texture on the recurrence of local breast cancer. This article examines the oncological outcomes associated with postmastectomy breast reconstructions using micro- and macrotexturized implants, focusing on the incidence and relative risk (RR).Methods A retrospective cohort study was conducted on patients admitted to Multimedica group (IRCCS, San Giovanni Hospital, Milan) and ICH groups (Humanitas Clinical Institute, Milan) between January 2003 and September 2020. Minimum follow-up considered was of 1 year. Patients submitted to either complete or nipple-spearing mastectomy, who underwent breast reconstruction with macrotexturized or microtexturized prosthesis, were included in group A and B, respectively.Results A total of 646 patients met the basic inclusion and exclusion criteria. Group A included 410 (63.5%) patients and group B included 236 (36.5%). Cancer recurrence absolute risk in group A was 5.6 +/- 2.2% and in group B was of 2.1 +/- 1.8%. RR for breast cancer recurrence in group A compared to group B was of 2.65; confidence interval 95% (1.02; 6.87). Statistical analysis identified a higher local recurrence risk in patients reconstructed with macrotexturized prosthesis (p-value 0.036).Conclusion This study detected a higher risk for local breast cancer recurrence associated to macrotexturized breast implants employment. Further investigations are required to verify these outcomes

    Adequação Estratégica das Áreas de Trade Marketing das Empresas de Bens de Consumo Atuando no Brasil

    Get PDF
    A atuação diferenciada nos pontos de venda torna-se cada vez mais relevante para a efetividade das cadeias de suprimentos da indústria de bens de consumo. Como resposta a este desafio surge, nas empresas, a área de trade marketing (TM), cujo objetivo é unificar as estratégias de marketing da indústria e do varejo no que diz respeito à sua efetiva implantação dentro do ponto de venda. O objetivo deste trabalho é identificar quais os atributos que dificultam e quais aqueles que contribuem para que a área de trade marketing esteja adequada à estratégia de negócio das empresas de bens de consumo. O estudo foi realizado por meio de uma pesquisa exploratória descritiva, cujo instrumento de coleta foi um questionário semiestruturado, respondido por 36 executivos de 20 empresas de diferentes segmentos de bens de consumo não duráveis. O resultado obtido com a pesquisa possibilitou a validação da lista de atributos definida a partir do ferramental de análise estratégica Genérico Integrativo (GI) de Macedo-Soares (2001), além da construção de listas adicionais de referência que podem ajudar para uma construção mais coerente e sólida da área de Trade Marketing dentro das organizações do segmento de bens de consumo

    Detection of Bartonella henselae in defibrinated sheep blood used for culture media supplementation

    Get PDF
    Bartonella henselae was detected in defibrinated sheep blood employed in supplementing a selective bacteria culture medium by nested PCR. We recommended that highly sensitive technical tests be run to ensure a sterile culture medium for Bartonella spp. isolation, since infected blood samples used in preparation could lead to false-positive results.43043

    Folkview: a Multi-Agent System Approach to Modeling Folksonomies.

    No full text
    Folksonomies contain semantic information on data, and represent a meaningful mean for identifying similarities among users, resources and tags. Their strong potential is often reduced by the lack in social tagging systems of specialized functionalities for managing and modifying them, and of specific tools for generating customized and dynamic views on them. The aim of this paper is to present Folkview, an innovative way to conceive a folksonomy in terms of a multi-agent system. Each element (tag, user, resource) become an active entity and the folksonomy transforms itself from a traditional passive container of data into a computational agent, provided of a set of procedural and distributed skills. The agents actively collaborate in order to generate dynamic and customized views and supporting users in the updating, managing and modifying her personomy, and the same folksonomy

    Visualizing and Managing Folksonomies

    No full text
    Social tagging represents an innovative and powerful mechanism introduced by social Web: it shifts the task of classifying resources from a reduced set of knowledge engineers to the wide set of Web users. Tags generate folksonomies; in the current popular social tagging systems (such as delicious or Bibsonomy), they are difficult to manage, modify, and visualize in dynamic and personalized ways. The aim of this paper is to describe Folkview, an innovative way to conceive a folksonomy in terms of a multi-agent system. Folkview is able to support specific modular tools for personalizing customized and dynamic visualization features allowing users to simply update, manage and modify a folksonomy

    TOGO: a Contextual Tourist Mobile Guide

    No full text
    In this paper, we present TOGO, a general model and a limited prototype of a contextual tourist mobile guide dedicated TO the city of GOrizia. Our goal is twofold: first, we offer contextual views to the users, and, second, we provide them with a personal workspace in which they can also create new, personalized paths. In order to capture semantic interconnections among data, we use advanced data structures called zz-structures, a graph-centric system of conventions for data and computing, able to simply offer semantic modalities of navigation

    Reducing the complexity of reductions

    No full text
    We build on the recent progress regarding isomorphisms of complete sets that was reported in Agrawal et al. (1998). In that paper, it was shown that all sets that are complete under (non-uniform) AC0 reductions are isomorphic under isomorphisms computable and invertible via (non-uniform) depth-three AC0 circuits. One of the main tools in proving the isomorphism theorem in Agrawal et al. (1998) is a "Gap Theorem", showing that all sets complete under AC0 reductions are in fact already complete under NC0 reductions. The following questions were left open in that paper: ¶1. Does the "gap" between NC0 and AC0 extend further? In particular, is every set complete under polynomial-time reducibility already complete under NC0 reductions? ¶2. Does a uniform version of the isomorphism theorem hold? ¶3. Is depth-three optimal, or are the complete sets isomorphic under isomorphisms computable by depth-two circuits? ¶ We answer all of these questions. In particular, we prove that the Berman-Hartmanis isomorphism conjecture is true for P-uniform AC0 reductions. More precisely, we show that for any class closed under uniform TC0-computable many-one reductions, the following three theorems hold: ¶1. If contains sets that are complete under a notion of reduction at least as strong as Dlogtime-uniform AC0[mod 2] reductions, then there are such sets that are not complete under (even non-uniform) AC0 reductions. ¶2. The sets complete for under P-uniform AC0 reductions are all isomorphic under isomorphisms computable and invertible by P-uniform AC0 circuits of depth-three. ¶3. There are sets complete for under Dlogtime-uniform AC0 reductions that are not isomorphic under any isomorphism computed by (even non-uniform) AC0 circuits of depth two. ¶To prove the second theorem, we show how to derandomize a version of the switching lemma, which may be of independent interest. (We have recently learned that this result is originally due to Ajtai and Wigderson, but it has not been published.

    The future of computational complexity theory: part II

    No full text

    Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table

    No full text
    corecore