Search results for "GiST"

showing 10 items of 3463 documents

Energy consumption model of aerial urban logistic infrastructures

2021

In the last decade, logistic systems based on small aerial vehicles (drones) have become attractive for urban delivery operations as a sustainable alternative to ground vehicles because they are not affected by the congestion of the road network, thus allowing for faster and more reliable services. Aerial logistic systems, however, require a substantially different approach to operations management and need specifically designed supportive infrastructures. While the research on urban aerial delivery mostly focuses on the optimization vehicle operations, the appropriate design of supportive infrastructures is seldom considered. This paper focuses on the energy efficiency of aerial logistic s…

TechnologyControl and OptimizationRenewable Energy Sustainability and the EnvironmentComputer scienceTdistribution systemsEnergy Engineering and Power TechnologySwarm behaviourEnergy consumptionenergy optimizationDecision problemDroneSizingEnergy storageTransport engineeringcity logisticsSettore ING-IND/23 - Chimica Fisica ApplicataSettore ING-IND/17 - Impianti Industriali MeccaniciCity logistics Distribution systems Energy optimization Unmanned Aerial VehiclesElectrical and Electronic EngineeringEngineering (miscellaneous)DimensioningEnergy (miscellaneous)Efficient energy useUnmanned Aerial Vehicles
researchProduct

Robustness of PET Radiomics Features: Impact of Co-Registration with MRI

2021

Radiomics holds great promise in the field of cancer management. However, the clinical application of radiomics has been hampered by uncertainty about the robustness of the features extracted from the images. Previous studies have reported that radiomics features are sensitive to changes in voxel size resampling and interpolation, image perturbation, or slice thickness. This study aims to observe the variability of positron emission tomography (PET) radiomics features under the impact of co-registration with magnetic resonance imaging (MRI) using the difference percentage coefficient, and the Spearman’s correlation coefficient for three groups of images: (i) original PET, (ii) PET after co-…

TechnologyTomografía de emisión de positronesNeoplasias encefálicasCorrelation coefficientImagen por resonancia magnética:Phenomena and Processes::Mathematical Concepts::Probability::Uncertainty [Medical Subject Headings]QH301-705.5Computer scienceQC1-999:Diseases::Neoplasms::Neoplasms by Site::Nervous System Neoplasms::Central Nervous System Neoplasms::Brain Neoplasms [Medical Subject Headings]:Analytical Diagnostic and Therapeutic Techniques and Equipment::Diagnosis::Diagnostic Techniques and Procedures::Diagnostic Imaging::Magnetic Resonance Imaging [Medical Subject Headings]Co registrationFluid-attenuated inversion recovery:Organisms::Eukaryota::Animals::Chordata::Vertebrates::Mammals::Primates::Haplorhini::Catarrhini::Hominidae::Humans [Medical Subject Headings]Magnetic resonance imagingRadiomicsRobustness (computer science):Analytical Diagnostic and Therapeutic Techniques and Equipment::Diagnosis::Diagnostic Techniques and Procedures::Diagnostic Techniques Radioisotope::Radionuclide Imaging::Tomography Emission-Computed::Positron-Emission Tomography [Medical Subject Headings]Resamplingradiomics feature robustness; imaging quantification; [11C]-methionine positron emission tomography; PET/MRI co-registration Appl.medicineGeneral Materials ScienceBiology (General)QD1-999InstrumentationSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniFluid Flow and Transfer Processesmedicine.diagnostic_testbusiness.industryTPhysicsProcess Chemistry and TechnologyRadiomics feature robustnessGeneral EngineeringPET/MRI co-registrationMagnetic resonance imagingPattern recognitionEngineering (General). Civil engineering (General)Imaging quantificationComputer Science ApplicationsChemistry:Chemicals and Drugs::Amino Acids Peptides and Proteins::Amino Acids::Amino Acids Essential::Methionine [Medical Subject Headings]Positron emission tomography[11C]-methionine positron emission tomography:Analytical Diagnostic and Therapeutic Techniques and Equipment::Diagnosis::Prognosis [Medical Subject Headings]Artificial intelligenceTA1-2040businessApplied Sciences
researchProduct

Il caso Sobrino e la Chiesa dei poveri

2009

Recensione a: F. Scalia, La teologia scomoda. Il “caso Sobrino”, la meridiana, Molfetta 2008.

Teologia della liberazione Chiesa poveri magistero
researchProduct

La mascota del magistrado

2010

Es bien conocida la importancia de las tertulias en el siglo XVIII. Sin llegar a la trascendencia de las francesas, también las hubo en España, especialmente en el reinado de Carlos III. Pero en el caso analizado, la tertulia semanal en casa del abogado José Bermúdez tiene un carácter político (presencia de embajadores), cultural (origen de la primera biografía de Cervantes) y de entretenimiento. El presente artículo centra su atención en este último aspecto. (A)

TertuliasMagistradosUNESCO::HISTORIA::Historia por épocas::Historia antiguaNovatoresSociabilidad:HISTORIA::Historia por épocas::Historia antigua [UNESCO]
researchProduct

La scoperta, sistemazione e conservazione della grande Iscrizione di Gortina, nell'isola di Creta (1884-1921): la protezione delle testimonianze e le…

2013

La scoperta e la conservazione della Grande Iscrizione di Gortina a Creta, da parte degli studiosi italiani, fra la fine del XIX sec. e i primi decenni del XX sec., rappresentò un grande riconoscimento scientifico-culturale per la giovane nazione italiana. Nel passato, l’isola di Creta era stata legata alla Repubblica di Venezia e anche questo rapporto favorì l’invio a Creta del giovane epigrafista F. Halbherr, il quale fra notevoli peripezie rinvenne, assieme all’epigrafista tedesco E. Fabricius, la famosa l’iscrizione nell’antica città di Gortina. L’iscrizione, fra le più antiche e complete finora conosciute in tutta Europa, conteneva le norme sulla famiglia, l’eredità e in generale i dir…

The discovery and preservation of the Great Inscription of Gortyna in Crete by Italian researchers in the late nineteenth century. and the first decades of the twentieth century. was an important cultural and scientific recognition for the young Italian nation. In the past the island of Crete had been tied to the Republic of Venice and this report also favored sending in Crete the young epigraphist F. Halbherr who among considerable vicissitudes came to together to the epigraphist german E. Fabricius the inclusion of the famous ancient city of Gortyna. The inscription among the oldest and most comprehensive so far known throughout Europe the rules contained on the family's legacy in general and the rights and duties of some of the people of the Minoan civilization (480-450 BC). The inscription was carved on blocks organic limestone a restored ancient building which later in Roman times was turned into odeon. The Laws of Gortyn were engraved on the remains of the wall forming the passageway in front of the steps of the odeon. The essay traces the events that led to the discovery and subsequent storage made by Halbherr especially with the help of archaeologist L. Pernier and finally with the help of architect E. Stefani who designed a modern cover on the top of the ambulatory of the segments containing the inscription. This coverage was made to perform during the First World War on the basis of the Italian project from the Greek Government in order to protect the membership from possible war damage but especially from vandalism. The roof brick clay of the Laws of Gortyna still serves its function and ensures the use of the monument bearing witness to the preservation of Italian culture in Greece and more generally in the world. But in Sicily in the remains of the Villa del Casale in Piazza Armerina (Enna) its elegant protection (built in 1957) is representative of a whole period of culture of the Italian restoration is removed and replaced because it has not been able to make a ongoing maintenance is due. A bad example of conservation and management of a UNESCO monument from which arise after the work for the construction of new roofs an equally insulting to the archaeological heritage and scenic Italian and world.Settore ICAR/19 - Restauro
researchProduct

Solving Graph Coloring Problems Using Learning Automata

2008

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. The growing need for more efficient algorithms has led to the development of several GCP solvers. In this paper, we introduce the first GCP solver that is based on Learning Automata (LA). We enhance traditional Random Walk with LA-based learning capability, encoding the GCP as a Boolean satisfiability problem (SAT). Extensive experiments demonstrate that the LA significantly improve the performance of RW, thus laying the foundation for novel LA-based solutions to the GCP.

Theoretical computer scienceLearning automataEncoding (memory)Frequency assignmentCombinatorial optimizationGraph coloringSolverBoolean satisfiability problemMathematicsRegister allocation
researchProduct

Heuristics for the Constrained Incremental Graph Drawing Problem

2019

Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…

Theoretical computer scienceOptimization problemCombinatorial optimizationInformation Systems and ManagementGeneral Computer ScienceComputer science0211 other engineering and technologiesHeuristicMetaheuristic02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringGraph drawing0502 economics and business050210 logistics & transportation021103 operations researchHeuristic05 social sciencesComputer Science (all)SolverGraphVertex (geometry)VisualizationGraph drawingModeling and SimulationCombinatorial optimizationHeuristicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

E-learning approach of the graph coloring problem applied to register allocation in embedded systems

2016

The main aim of this paper consists in developing an effective e-learning tool, focused on evolutionary algorithms, in order to solve the graph coloring problem. Subsidiary, we apply graph coloring for register allocation in embedded systems. From didactic viewpoint, our tool has benefits in the learning process because it helps students to observe the relationship between the graph coloring problem and CPU registers allocation with the help of four developed modules: the genetic algorithm, the graphical viewer, the interference graph for a C program and a web application which collects the simulation results. All these applications are combined by a graphical interface which allows the use…

Theoretical computer sciencebusiness.industryComputer scienceProcessor registerEvolutionary algorithm02 engineering and technology021001 nanoscience & nanotechnologyEmbedded systemGenetic algorithm0202 electrical engineering electronic engineering information engineeringWeb applicationGraph (abstract data type)020201 artificial intelligence & image processingGraph coloring0210 nano-technologybusinessGraphical user interfaceRegister allocation2016 Sixth International Conference on Innovative Computing Technology (INTECH)
researchProduct

Quantum Real - Time Turing Machine

2001

The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum Turing machineDTIMEComputer scienceProbabilistic Turing machine2-EXPTIMESuper-recursive algorithmComputationDescription numberDSPACElaw.inventionsymbols.namesakeTuring machineTuring completenessNon-deterministic Turing machinelawAlgorithm characterizationsQuantumPSPACEQuantum computerFinite-state machineTuring machine examplesNSPACETheoryofComputation_GENERALAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTuring reductionTheory of computationsymbolsUniversal Turing machineTime hierarchy theoremAlternating Turing machineComputer Science::Formal Languages and Automata TheoryRegister machine
researchProduct

Space-Efficient 1.5-Way Quantum Turing Machine

2001

1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i ≥ 0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape , and 1.5QTM can recognize it using constant cells quantity.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceQuantum Turing machineSuper-recursive algorithmComputer scienceProbabilistic Turing machineComputationDescription numberMultitape Turing machineDSPACElaw.inventionTuring machinesymbols.namesakeNon-deterministic Turing machinelawAlgorithm characterizationsPSPACEWolfram's 2-state 3-symbol Turing machineTuring machine examplesNSPACETuring reductionsymbolsUniversal Turing machineTime hierarchy theoremAlternating Turing machineRegister machine
researchProduct