113 research outputs found
Correction To: Predictors of Nodal Upstaging in Patients With cT1-3N0 Non-Small Cell Lung Cancer (NSCLC): Results From the Italian VATS Group Registry
No full textIn the original publication, Carlo Curcio was not included in the author list. The correct author list is included in this Correction
Carlo Curcio e l’idea di Europa
No full textThe work of Carlo Curcio “Europe. History of an Idea” (published in 1958 by Vallecchi, publisher of Florence, in two volumes with a total of over a thousand pages) is certainly one of the most significant historical works of the Italian 20th century. In connection with the problems of Europe today, the most interesting part of this book is the section covering the years 1848-1958, namely the last three chapters of the book and the conclusions. More than a historical piece, this section
provides a sociological profile of European culture. The author describes how the European project has failed several times due to partial and totalitarian interpretation of the meaning of Europe: Europe as empire, as a conquest, as enlightened
fundamentalism, as a right, as an economy. Despite these failures, however, the idea of Europe has always survived within European intellectuals who, even amidst misrepresentations and conflicts, have kept alive the sense that we Europeans are strongly linked by a common destiny. “The idea of Europe saves Europe”, wrote Curcio. Only through a reflection on the events of the last two centuries, it is possible to understand the current crisis: it is clear that diversity must not be deleted but must be accepted with tolerance because, writes Curcio, it gives
rise to mutual enrichment. Therefore, the European project should be continued on a wider scale and complexity, more humanistic and ideal, without denying the importance of the economy but avoiding the simple conformism of a flat rationality
Defying chemical equilibrium with light
Get PDFChemical systems capable of exploiting an energy source to function away from thermodynamic equilibrium are a hallmark of the biological world. The design and operation of artificial versions of such systems constitute a stimulating and highly challenging scientific goal with considerable expectations for application in synthetic chemistry, catalysis, materials science, energy conversion, and medical therapy. In this context, supplying energy in the form of photons has several elements of conceptual interest and practical advantage. Here we present the progress of research over the past 5 years on artificial molecular-based systems that can use light energy to operate away from equilibrium – an emerging field that has just begun to express its innovative potential
Una variación del problema de ordenamiento lineal
No full textEl objetivo de esta tesis es desarrollar un algoritmo exacto para una variante del problema de ordenamiento lineal basado en un modelo de programación lineal entera. El problema de ordenamiento lineal es un problema clásico de optimización combinatoria estudiado desde hace más de 50 años. Los diversos escenarios reales que provienen de situaciones surgidas en variados campos de la industria y otros sectores, han dado origen a distintas variaciones de este problema. La gran cantidad de aplicaciones que poseen los problemas de esta familia hacen que los mismos no solo tengan interés teórico, sino también, una gran importancia práctica. La versión del problema abordada en este trabajo consiste en encontrar un orden total de elementos de manera que se minimice la suma de las penalidades entre pares de ellos, donde la penalidad se define como el producto entre la distancia a la que se encuentran los dos elementos y un costo asociado a ellos. Este problema recibe el nombre de Problema de Ordenamiento Lineal con Penalidades POLP. POLP pertenece a la clase de problemas NP-Difícil. Para estos problemas no se conocen algoritmos que encuentren la solución en tiempo polinomial. Como muchos de los problemas de Optimización Combinatoria, POLP puede ser modelado mediante formulaciones de programación lineal entera o entera mixta. Los algoritmos Branch-and-Cut son una de las herramientas más efectivas que se conoce para resolver un modelo de programación lineal entera. Especialmente las implementaciones basadas en combinatoria poliedral han permitido incrementar el tamaño de las instancias resueltas. En el transcurso del trabajo se analizan diversas formulaciones de programación lineal entera que permiten modelar el problema. Luego de seleccionar la más prometedora según ciertos criterios, se realiza un estudio poliedral para determinar características de la cápsula convexa del conjunto de soluciones factibles. En base a estas familias de desigualdades válidas, se desarrolló e implementó un algoritmo Branch-and-Cut para resolver el problema. También se consideraron factores decisivos en la eficiencia de este tipo de algoritmos, como la incorporación de heurísticas iniciales y primales, distintas estrategias de selección de variable de branching, y esquemas de recorrido del árbol de Branch-and-Bound. Finalmente se muestran resultados experimentales sobre instancias de prueba que permiten evaluar la eficiencia del algoritmo desarrollado.Fil: Curcio, Brian Luis. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
Sudden Death Associated with Incarcerated Small Bowel due to Mesodiverticular Band
No full textMeckel’s diverticulum is a congenital anomaly present in about 3% of the population and usually asymptomatic. Rarely, a mesodiverticular band extends from the tip of a Meckel’s diverticulum to the mesentery, thought to be due to lack of involution of the left vitelline artery. The presence of this band creates a closed loop through which loops of bowel can become entrapped. Rare case reports have described incarceration of bowel, and sudden death in children. We present such a case, and discuss this entity.Peer reviewe
L "eccelsa Machina Vaticana": frontespizio e datazione del codice Barb. lat. 4409 di Domenico Castelli
No full textLo studio del frontespizio del codice Barberiniano latino 4409 della Biblioteca Apostolica Vaticana, consente di spiegare le ragioni sottese alla redazione dell’importante corpus di disegni di Domenico Castelli, architetto al servizio di Urbano VIII, attivo nei più importanti cantieri romani della prima metà del seicento.
The study of content and representation techniques, the reconstruction of the original substance of the body and the comparison to other important collections and designs allow us to formulate hypotheses on the dating and the author of the code
Correction to: Predictors of nodal upstaging in patients with cT1-3N0 non-small cell lung cancer (NSCLC): results from the Italian VATS Group Registry (Surgery Today, (2020), 50, 7, (711-718), 10.1007/s00595-019-01939-x)
No full textIn the original publication, Carlo Curcio was not included in the author list. The correct author list is included in this Correction. Also an Appendix listing VATS author group is included in this correction
L'oralité et la sexualité : Moi, Tituba sorcière de Maryse Condé
No full textInternational audienceThis present essay aims to confront the theme of oral tradition and sexuality in the work of Maryse Condé. Moi Tituba sorcière sets herself the objective of going through History to talk about history. Through orality, the author rehabilitates oral traditions. Our intention tends to list the illustrative passages. Secondly, our text touches on sexuality, a tabù for some that Condé knew how to treat well in the novel
Health Hazard Evaluation Report: HETA-93-0739-2364: Curcio Scrap Metal, Cirello Iron and Steel; Saddle Brook, New Jersey
No full textIn response to a request from the New Jersey Department of Health, an investigation was begun into possible exposures to lead (7439921) and polychlorinated biphenyls (PCBs) from contaminated soil at Curcio Scrap Metal and Cirello Iron and Steel (SIC-5093), Saddle Brook, New Jersey. The New Jersey Department of Environmental Protection and the EPA had previously identified high concentrations of contaminants in the soil at the site. Curcio Scrap Metal was involved in nonferrous metal recycling, predominantly aluminum. Much of the work area was located indoors and contact with contaminated soil appeared to be minimal. Cirello Iron and Steel was involved in ferrous metal recycling and was located on the unpaved lot at the same facility. The concentrations of lead found in the blood of workers ranged from 4 to 39.8 micrograms per deciliter (microg/dl). Levels of PCBs ranged from less than one to 65.3 parts per billion (ppb) with a mean of 7.5ppb. No significant differences were found in the blood lead levels or serum PCB levels of workers for each of the two companies. There was an increase in blood lead levels in direct relation to the number of cigarettes smoked on the job. Increased PCB levels were associated with eating lunch in the work area. No correlation was found between the blood lead levels and the PCB levels in the serum. The author concludes that exposure to lead occurred at both sites. Serum PCB concentrations were not higher than those in the general population. The author recommends that continued measurements be taken and that work practices be improved
Problems on vertex distinguishing edge colorings
Get PDFEn el presente trabajo analizamos el problema de suma de coloreo de aristas con vértices adyacentes distinguibles. Un coloreo de aristas con vértices adyacentes distinguibles es una asignación de colores a las aristas de un grafo con las siguientes restricciones: todo par de aristas adyacentes debe tener distinto color, y todo par de vértices adyacentes debe tener diferencia en el conjunto de colores asignados a sus aristas incidentes. El objetivo es minimizar la suma de los colores asignados en un coloreo de aristas que cumpla estas restricciones. Este problema es un caso particular de una gran familia de problemas conocida bajo el nombre de etiquetado de grafos, que resultan una herramienta abstracta muy útil y versátil para modelar situaciones de la vida cotidiana que se quieren formalizar y resolver mediante algoritmos. Algunas variantes del problema de etiquetado de grafos han sido abordadas con éxito con técnicas de programación lineal entera basadas en la caracterización poliedral del conjunto de soluciones factibles. Bajo este enfoque, en esta tesis nos proponemos desarrollar un algoritmo tipo Branch and Cut para resolver el problema. Además, aprovechando el análisis realizado, también hacemos una propuesta algorítmica para resolver el problema que busca minimizar la cantidad de colores utilizados en el coloreo. Adicionalmente, se exploró la opción de utilizar técnicas heurísticas para resolver el problema. Las heurísticas permiten conocer asignaciones de colores factibles del problema pero, en general, no pueden determinar si son óptimas o cuan cerca están de la solución del problema. Desarrollamos tres técnicas distintas para resolver el problema: un algoritmo goloso, un algoritmo de programación por restricciones, y un algoritmo de generación de columnas. Para el desarrollo del algoritmo tipo Branch and Cut, propusimos dos modelos de programación lineal entera que evaluamos empíricamente para elegir el más prometedor, sobre el cual se realizó un estudio poliedral en profundidad. Caracterizamos la dimensión del poliedro asociado y demostramos que tres familias de desigualdades válidas definen facetas. El objetivo de realizar el estudio poliedral es entender mejor el espacio de soluciones del modelo para conseguir formulaciones más ajustadas que mejoren la performance del algoritmo. Las desigualdades estudiadas son incorporadas como cortes al modelo, para las cuales se desarrollaron algoritmos de separación que permiten agregarlas a demanda. Además, se consideraron heurística inicial, preprocesamiento y estrategias particulares de generación del árbol de búsqueda. Los resultados muestran que el algoritmo desarrollado permite resolver instancias que no son posibles de abordar utilizando las herramientas de resolución generales. Haber realizado el estudio poliedral y agregar las facetas como planos de corte resulta ser un factor determinante para afrontar instancias del problema mucho más desafiantes.In this thesis we analyze the adjacent vertex distinguishing sum edge coloring problem. This problem consists in finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not have the same set of colors assigned to the edges incident to each. The goal is to minimize the sum of the colors in an edge coloring that satisfies these constraints. This problem is a special case of a large family of problems known as graph labeling, which are a widely used and very popular set of tools to build abstract models for problems that come up in everyday life. Some variants of graph labeling problem have been successfully addressed with mixed integer linear programming (MIP) techniques based on a polyhedral characterization of the set of feasible solutions. We use this approach to develop a branch and cut algorithm to solve the problem. Furthermore, taking advantage of the analysis, we also propose an algorithm to solve the problem that minimizes the number of colors used for an adjacent vertex distinguishing edge coloring. Additionally, we explored using heuristic techniques to solve the problem. These heuristics allow to obtain feasible coloring assignments for the problem but, in general, can not determine if they are optimal or even how far they are from the solution to the problem. We use three different approaches: a greedy algorithm, a constraint programming model and a column generation algorithm. To develop the branch and cut algorithm we propose two MIP models. We evaluate these models to choose the most promising one and continue with a thorough polyhedral study. We characterized the dimension of the associated polyhedron and proved that three families of valid inequalities result facet-inducing. The aim of the polyhedral study is to understand the set of feasible solutions in the model to obtain a more compact formulation in hope of improving the algorithm's performance. These inequalities are added as cutting planes in the model, we developed exact and heuristic separation algorithms to add them on demand. Moreover, we considered the use of initial heuristics, preprocessing and particular branching strategies. The results show that the algorithm developed allows us to solve instances that were unsolvable using general purpose solvers. Our polyhedral study and the addition of facets as cutting planes proved to be a crucial factor to solve the most challenging instances.Fil: Curcio, Brian Luis. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
- …
