330,490 research outputs found
Modelli interattivi 3D nei file PDF. Applicazioni in campo archeologico
No full textIl Laboratorio di Archeologia dell’Architettura del Dipartimento di Archeologia dell’Università di Bologna (direttore prof. Andrea Augenti, responsabile operativo prof. Andrea Fiorini) ha sviluppato (con la supervisione del prof. Maurizio Cattani) un metodo per ottenere modelli fotorealistici dello scavo archeologico in formato PDF 3D. Questo formato standard (internazionale), per lo scambio di documenti, consente di condividere i dati tridimensionali con il maggior numero di utenti possibile e senza la necessità di particolari dotazioni software o hardware. Questi modelli, ottenuti con tecniche stereofotogrammetriche rigorose, sono formati da vari livelli informativi (US terrose, materiali di scavo, quadrettatura, quote, ecc.) che l’utente può esaminare (in tutte le viste possibili) o escludere dalla “scena” a seconda delle proprie esigenze conoscitive. Nel contributo si descrivono alcuni casi-studio, con particolare riferimento al villaggio protostorico di Mursia (Pantelleria, TP)
Un cratere corinzio dalla Civita di Tarquinia
No full textStudio di un cratere corinzio con raffigurazione del mito di Melampous recuperato nel corso degli scavi di Pietro Romanelli sulla Civita di Tarquinia negfli anni 1936-1938 e nel 194
Crotti P., Fiorini L., Ferraboli S., Baroncelli R., Sarrocco S., Vannacci G., Gobbi E. (2016) Velvet Complex and Gliotoxin Biosynthesis in Trichoderma afro-harzianum T6776.
No full textStrengthening convex relaxations of 0/1-sets using Boolean formulas
No full textIn convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popular linear programming or semi-definite programming hierarchies. On the other hand, various methods have been designed for obtaining strengthened relaxations for very specific sets S that arise in combinatorial optimization. We propose a new efficient method that interpolates between these two approaches. Our procedure strengthens any convex set containing a set S⊆ { 0 , 1 } n by exploiting certain additional information about S. Namely, the required extra information will be in the form of a Boolean formula φ defining the target set S. The new relaxation is obtained by “feeding” the convex set into the formula φ. We analyze various aspects regarding the strength of our procedure. As one application, interpreting an iterated application of our procedure as a hierarchy, our findings simplify, improve, and extend previous results by Bienstock and Zuckerberg on covering problems
Hospitaller activities in medieval Malta
No full textThe Medieval Period in the Mediterranean World is generaly considered to cover a period of about a thousand years, and is considered to initiate with the end of the Roman era heralded by the division of the Roman Empure into two parts between the sons of Theodosius in AD 395. It ended with the advent of the Renaissance movement of the fifteenth century. This period in Malta was to see the Islands come under the influence of the Byzantine Empire encompassing the period prior to the ninth century; the Arab dominance starting in AD 870 and lasting until their formal expulsion in the mid-13th century; and the Latin phase of the late 13th century to the early 16th century when the islands were ceded to the Order of St. John of Jerusalem. The documentary sources dated to before the 14th century are rather scanty and often limited to ecclesiastical and political matters. A number of extant documents relate to medical matters, particularly with the setting up and management of hospital services and with matters relating to the affairs of hospitaller orders having links to the Maltese Islands.peer-reviewe
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
No full textLet S ⊂ {0; 1}n and R be any polytope contained in [0; 1]n with R ⊂ {0; 1}n = S. We prove that R has bounded Chvátal-Gomory rank (CG-rank) provided that S has bounded notch and bounded gap, where the notch is the minimum integer p such that all p-dimensional faces of the 0'1-cube have a nonempty intersection with S, and the gap is a measure of the size of the facet coefficients of conv1S°. Let H[S] denote the subgraph of the n-cube induced by the vertices not in S. We prove that if H[S] does not contain a subdivision of a large complete graph, then the notch and the gap are bounded. By our main result, this implies that the CG-rank of R is bounded as a function of the treewidth of H[S]. We also prove that if S has notch 3, then the CG-rank of R is always bounded. Both results generalize a recent theorem of Cornuéjols and Lee [Cornuéjols G, Lee D (2016) On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank. Louveaux Q, Skutella M, eds. Proc. 18th Internat. Conf. Integer Programming Combinatorial Optim., IPCO '16 (Springer International, Cham, Switzerland), 300-311], who proved that the CG-rank is bounded by a constant if the treewidth of H[S] is at most 2
Forza in età prepuberale: orientamenti metodologici
No full textBreve review sulla necessità e modalità di allenare la forza nel calcio giobanil
Riatletizzazione dopo lesioni capsulo-legamentose della caviglia
No full textSi descrivono contenuti e metodologie per il recupero post infortunio del calciator
Training su superfici instabili: i supporti
No full textBreve rassegna sulla metodologia di utilizzo dei differenti supporrti instabili nell'allenamento calcistic
Regular Matroids Have Polynomial Extension Complexity
No full textWe prove that the extension complexity of the independence polytope of every regular matroid on n elements is O(n6). Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a O(n2) bound for the special case of (co)graphic matroids. However, the case of a general regular matroid was open, despite recent attempts. We also consider the extension complexity of circuit dominants of regularmatroids, for which we give a O(n2) bound
- …
