Search results for "sfi"

showing 10 items of 221 documents

Quantitative structural analysis of trabecular alveolar bone in the mandible by multidetector computed tomography: Differences according to tooth pre…

2019

Background and objective: There is a lack of quantitative measures of the quality of alveolar trabecular bone, an important factor in implantology. This study aimed to develop a method of objectively assessing the quality of trabecular bone by means of image processing and structural analysis of multidetector computed tomography images and to establish differences between tooth types and tooth presence/absence. Materials and methods: We analyzed 20 patients who underwent multidetector computed tomography to evaluate mandibular bone and tooth positioning. Image analysis included automatic segmentation of the mandible, obtainment of sections perpendicular to the dental arch, and structural an…

Trabecular boneMolarmedicine.medical_treatmentMandible030218 nuclear medicine & medical imaging03 medical and health sciences0302 clinical medicinestomatognathic systemHounsfield scaleMultidetector computed tomographymedicineQuantitative analysisDental implantDental alveolusGeneral Environmental ScienceOrthodonticsTooth presencebusiness.industryMultidetector CTDental implantsMandible030206 dentistrystomatognathic diseasesDental archmedicine.anatomical_structureGeneral Earth and Planetary SciencesbusinessRadiología (English Edition)
researchProduct

On the satisfiability problem for fragments of two-variable logic with one transitive relation

2019

Abstract We study the satisfiability problem for two-variable first-order logic over structures with one transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential quantifiers are guarded by transitive atoms. As this fragment enjoys neither the finite model property nor the tree model property, to show decidability we introduce a novel model construction technique based on the infinite Ramsey theorem. We also point out why the technique is not sufficient to obtain decidability for the full two-variable logic with one transitive relation; hence, contrary to our previous claim, [FO$^2$ with one transitive relation is deci…

Transitive relationLogic010102 general mathematics0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsVariable (computer science)Arts and Humanities (miscellaneous)010201 computation theory & mathematicsHardware and Architecture0101 mathematicsBoolean satisfiability problemSoftwareMathematicsJournal of Logic and Computation
researchProduct

OUTCOME DI SVILUPPO A BREVE TERMINE IN SOGGETTI SOTTOPOSTI A TRATTAMENTO IPOTERMICO

2015

Trattamento ipotermico, asfissia

Trattamento ipotermico asfissia
researchProduct

La madera del retablo y sus maestros. Talla y soporte en los retablos medievales valencianos

2010

El artículo analiza el papel desarrollado por los carpinteros, mazoneros, tallistas, imagineros, escultores, entalladores y arquitectos en la confección de retablos en madera en el reino de Valencia en época medieval. Artistas de distintas especialidades técnicas aplicaban sus conocimientos de dibujo y diseño en la talla precisa, delicada y exquisita de soportes lignarios. En estrecha relación con los pintores, dichos maestros introdujeron las novedades técnicas que aprendían en sus oficios, en una evolución creciente de enriquecimiento estilístico y apropiación de experiencias profesionales, que se tradujo en una creciente complejidad, y riqueza formal e iconográfica. Una aproximación a la…

UNESCO::CIENCIAS DE LAS ARTES Y LAS LETRAS:CIENCIAS DE LAS ARTES Y LAS LETRAS [UNESCO]0211-5808 9678 Archivo de arte valenciano 277874 2010 91 3629148 La madera del retablo y sus maestros. Talla y soporte en los retablos medievales valencianos Serra DesfilisMatilde 13 37AmadeoMiquel JuanArt gòtic
researchProduct

COLASANTI, Maurizio: La musica è sfinita

2021

UNESCO::CIENCIAS DE LAS ARTES Y LAS LETRASterritorios para el arte 590908 2021 7 8182100 COLASANTI [revista de investigación musical]Maurizio: La musica è sfinita CarusoLa musica è sfinita Caruso [Maurizio]Giusy 673 678:CIENCIAS DE LAS ARTES Y LAS LETRAS [UNESCO]2386-8260 13268 Itamarrevista de investigación musical: territorios para el arte 590908 2021 7 8182100 COLASANTI
researchProduct

XV Conferenza nazionale della Società Italiana degli Urbanisti: l’urbanistica che cambia

2012

Nel contesto odierno, in cui la velocità e la complessità delle trasformazioni in atto stanno mettendo a dura prova i sistemi economici, i meccanismi politici, le strutture sociali, soprattutto a livello urbano, non si può prescindere dall'interrogarsi sui possibili scenari che si prospettano nell'immediato futuro. La comunità scientifica è dunque sollecitata a trovare nuove risposte e nuove impostazioni metodologiche per affrontare le problematiche attuali. Parola d’ordine: “riorganizzazione”, come ha affermato il prof. Alessandro Balducci durante il discorso d’apertura della XV Conferenza della SIU (10-11 maggio 2012) a Pescara.

URBANISTICA CAMBIAMENTO SFIDESettore ICAR/21 - Urbanistica
researchProduct

Two-variable First-Order Logic with Counting in Forests

2018

We consider an extension of two-variable, first-order logic with counting quantifiers and arbitrarily many unary and binary predicates, in which one distinguished predicate is interpreted as the mother-daughter relation in an unranked forest. We show that both the finite satisfiability and the general satisfiability problems for the extended logic are decidable in NExpTime. We also show that the decision procedure for finite satisfiability can be extended to the logic where two distinguished predicates are interpreted as the mother-daughter relations in two independent forests.

Variable (computer science)general satisfiabilityfinite satisfiabilitylogic and computational complexitydecision proceduresArithmetictwo-variable logic with counting quantifiersunranked trees/forestsMathematicsFirst-order logicEPiC Series in Computing
researchProduct

L'orthodoxie marxiste de la SFIO : à propos d'une fausse évidence (1905-1914)

2011

International audience; Travailler sur la réception de Marx dans la SFIO de 1905 à 1914 impose d’emblée larencontre avec la question de l’orthodoxie marxiste. Elle nourrit un procès paradoxal,entre recherche historique et politique de 1965 à 1981, années pendant lesquelles lesinterprétations les plus divergentes partagent l’évidence d’une orthodoxie marxistepermettant la discussion de la synthèse jaurésienne. Nous nous proposons de revenir brièvement sur ce procès qui trame encore les lectures contemporaines, avant d’explorer l’une des pistes proposées par le développement de l’histoire de l’édition. Il s’agit moins d’une histoire des idées, d’une histoire des intellectuels, auxquelles la q…

[ SHS.HIST ] Humanities and Social Sciences/HistoryInternationale[SHS.HIST] Humanities and Social Sciences/HistoryorthodoxiemarxismerévisionnismeSFIO[SHS.HIST]Humanities and Social Sciences/History
researchProduct

Les majoritaires de guerre dans l’après-coup d’un regard

2017

National audience; La mémoire du majoritaire de guerre, et la potentielle construction de cette figure en objet historique tient au fait communiste. Le majoritaire de guerre, parce qu’il incarne le procès en trahison des élites socialistes, se survit. S’il n’est pas de positivité à cette figure et l’expérience qu’elle porte, elle est borne et conditions de possibilité d’une analyse de la naissance du mouvement communiste en France.

[ SHS.HIST ] Humanities and Social Sciences/History[SHS.HIST] Humanities and Social Sciences/HistoryParti communiste français[SHS.HIST]Humanities and Social Sciences/HistorySection française de la SFIO
researchProduct

Some Computational Aspects of DISTANCE-SAT

2007

In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones …

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]Theoretical computer scienceComputational complexity theory0102 computer and information sciences02 engineering and technologyComputer Science::Computational Complexity01 natural sciences[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]#SATArtificial IntelligenceComputer Science::Logic in Computer ScienceDPLL algorithm0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDecision problemFunction problemSatisfiabilityPropositional formulaTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processingBoolean satisfiability problemAlgorithmSoftware
researchProduct