Search results for " Matematica"

showing 10 items of 1345 documents

A laplace type problem for three lattices with non-convex cell

2016

In this paper we consider three lattices with cells represented in Fig. 1, 3 and 5 and we determine the probability that a random segment of constant length intersects a side of lattice. c ⃝2016 All rights reserved.

0209 industrial biotechnologyAlgebra and Number TheoryLaplace transformHigh Energy Physics::Lattice020208 electrical & electronic engineeringMathematical analysisRegular polygon02 engineering and technologyGeometric probabilityRandom setsGeometric probability stochastic geometry random sets random convex sets and integral geometry020901 industrial engineering & automationRandom convex sets and integral geometrySettore MAT/05 - Analisi MatematicaLattice (order)0202 electrical engineering electronic engineering information engineeringStochastic geometrySettore MAT/03 - GeometriaAnalysisMathematics
researchProduct

Game Theoretic Decentralized Feedback Controls in Markov Jump Processes

2017

This paper studies a decentralized routing problem over a network, using the paradigm of mean-field games with large number of players. Building on a state-space extension technique, we turn the problem into an optimal control one for each single player. The main contribution is an explicit expression of the optimal decentralized control which guarantees the convergence both to local and to global equilibrium points. Furthermore, we study the stability of the system also in the presence of a delay which we model using an hysteresis operator. As a result of the hysteresis, we prove existence of multiple equilibrium points and analyze convergence conditions. The stability of the system is ill…

0209 industrial biotechnologyMathematical optimizationDecentralized routing policies; Hysteresis; Inverse control problem; Mean-field games; Optimal control; Control and Optimization; Management Science and Operations Research; Applied MathematicsControl and OptimizationStability (learning theory)02 engineering and technologyManagement Science and Operations ResearchMean-field games01 natural sciencesDecentralized routing policie020901 industrial engineering & automationControl theorySettore MAT/05 - Analisi MatematicaMean-field gameConvergence (routing)0101 mathematicsMean field gamesMathematicsEquilibrium pointSettore SECS-S/06 - Metodi mat. dell'economia e Scienze Attuariali e FinanziarieDecentralized routing policies; Hysteresis; Inverse control problem; Mean-field games; Optimal controlApplied MathematicsHysteresis010102 general mathematics[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Optimal controlOptimal control Mean-field games Inverse control problem Decentralized routing policies HysteresisDecentralised systemOptimal control Mean-field games Inverse control problem Decentralized routing policies HysteresisExpression (mathematics)Optimal controlTheory of computationDecentralized routing policiesHysteresiInverse control problemRouting (electronic design automation)Settore MAT/09 - Ricerca Operativa
researchProduct

Designing Cognitive Cities

2018

The following text intends to give an introduction into some of the basic ideas which determined the conception of this book. Thus, the first part of this article introduces the terms “City”, “Smart City” and “Cognitive City”. The second part gives an overview of design theories and approaches such as Action Design Research and Ontological Design (a concept in-the-making), in order to deduce from a theoretical point of view some of the principles that needs to be taken into account when designing the Cognitive City. The third part highlights some concrete techniques that can be usefully applied to the problem of citizen communication for Cognitive Cities (namely Metaheuristics, Fuzzy Sets a…

0209 industrial biotechnologyPoint (typography)Settore INF/01 - InformaticaComputer scienceManagement scienceFuzzy setCognitionComputational intelligence02 engineering and technologySettore MAT/01 - Logica MatematicaFuzzy logic020901 industrial engineering & automationSmart CitiesOrder (exchange)Smart city0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingMetaheuristic
researchProduct

Graph-theoretical derivation of brain structural connectivity

2020

Brain connectivity at the single neuron level can provide fundamental insights into how information is integrated and propagated within and between brain regions. However, it is almost impossible to adequately study this problem experimentally and, despite intense efforts in the field, no mathematical description has been obtained so far. Here, we present a mathematical framework based on a graph-theoretical approach that, starting from experimental data obtained from a few small subsets of neurons, can quantitatively explain and predict the corresponding full network properties. This model also changes the paradigm with which large-scale model networks can be built, from using probabilisti…

0209 industrial biotechnologyTheoretical computer scienceComputer scienceNeuronal network02 engineering and technologyMECHANISMSCENTRALITY020901 industrial engineering & automationSettore MAT/05 - Analisi MatematicaNeuronal networksConnectome0202 electrical engineering electronic engineering information engineeringINDEXComputer Science::DatabasesRandom graphsSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - InformaticaQuantitative Biology::Neurons and CognitionApplied MathematicsProbabilistic logicExperimental data020206 networking & telecommunicationsComputational MathematicsSYNCHRONIZATIONSIMULATIONGraph (abstract data type)Applied Mathematics and Computation
researchProduct

Best proximity point theorems for proximal cyclic contractions

2017

The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.

021103 operations researchProximal cyclic contractionApplied Mathematics010102 general mathematicsMathematical analysisBest proximity point0211 other engineering and technologies02 engineering and technologyFunction (mathematics)Fixed pointTopology01 natural sciencesComplete metric spaceCyclic contractionSettore MAT/05 - Analisi MatematicaModeling and SimulationPoint (geometry)Global minimizationGeometry and Topology0101 mathematicsApproximate solutionMathematics
researchProduct

"The human use of human beings": Interdisciplinarity, transdisciplinarity and all that in biophysics and beyond.

2017

Abstract Biophysics, just by looking at its name, indicates an interdisciplinary scientific activity, although the notion of interdisciplinarity, as such, seems to be not widely or specifically discussed by biophysicists. The same seems to have happened as well in the early stages of the development of cybernetics, notably in Norbert Wiener's writings. This situation seems to contrast with what has happened in subsequent developments of cybernetics ideas, notably in general system theory and cognitive sciences. After a few general reflections on the notion of interdisciplinarity, its sophisticated variants and the path leading to the birth of cognitive science, we shall refer to Wiener's th…

0301 basic medicine030103 biophysicsSettore INF/01 - InformaticaChemistryOrganic ChemistryInterdisciplinarityBiophysicsSettore MAT/01 - Logica MatematicaHistory 20th CenturyBiochemistry03 medical and health sciencesBiophysicHuman useTransdisciplinarityWienerBiophysicsCyberneticsHumansCyberneticSocial responsibilityCyberneticsScientific activityHumanInterdisciplinarityBiophysical chemistry
researchProduct

Two simple criteria to estimate an objective's performance when imaging in non design tissue clearing solutions

2019

Tissue clearing techniques are undergoing a renaissance motivated by the need to image fluorescent neurons, and other cells, deep in the sample without physical sectioning. Optical transparency is achieved by equilibrating tissues with high refractive index (RI) solutions. When the microscope objective is not perfectly matched to the RI of the cleared sample, aberrations are introduced. We present two simple-to-calculate numerical criteria predicting: (i) the degradation in image quality (brightness and resolution) from optimal conditions of any clearing solution/objective combination; (ii) which objective, among several available, achieves the highest resolution in a given medium. We deriv…

0301 basic medicineBrightnessMicroscopeDeconvolution; Fluorescence; Microscopy; Neuron; Serial optical sectioning; Spherical aberration; Tissue clearingComputer scienceImage qualitySample (material)DeconvolutionFluorescencelaw.invention03 medical and health sciences0302 clinical medicineSimple (abstract algebra)lawSerial optical sectioningMicroscopyFluorescence microscopeMicroscopistSpherical aberrationColoring AgentsSettore MAT/07 - Fisica MatematicaNeuronsMicroscopyTissue clearingGeneral NeuroscienceMicroscopy Tissue clearing Fluorescence Neuron Spherical aberration Serial optical sectioning DeconvolutionNeuronFluorescenceRefractometrySpherical aberration030104 developmental biologyMicroscopy FluorescenceDeconvolutionAlgorithm030217 neurology & neurosurgeryTissue clearing
researchProduct

On the structural connectivity of large-scale models of brain networks at cellular level

2021

AbstractThe brain’s structural connectivity plays a fundamental role in determining how neuron networks generate, process, and transfer information within and between brain regions. The underlying mechanisms are extremely difficult to study experimentally and, in many cases, large-scale model networks are of great help. However, the implementation of these models relies on experimental findings that are often sparse and limited. Their predicting power ultimately depends on how closely a model’s connectivity represents the real system. Here we argue that the data-driven probabilistic rules, widely used to build neuronal network models, may not be appropriate to represent the dynamics of the …

0301 basic medicineProcess (engineering)Computer scienceScienceModels NeurologicalCellular levelMachine learningcomputer.software_genreArticle03 medical and health sciencesComputational biophysics0302 clinical medicineSettore MAT/05 - Analisi MatematicamedicineBiological neural networkHumansSettore MAT/07 - Fisica MatematicaOn the structural connectivity of large-scale models of brain networks at cellular levelSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniNeuronsMultidisciplinaryNetwork modelsSettore INF/01 - Informaticabusiness.industryQRProbabilistic logicBrain030104 developmental biologymedicine.anatomical_structureMathematical framework Neuron networks Large‑scale model Data‑driven probabilistic rules Modeling cellular-level brain networksMedicineNeuronArtificial intelligencebusinessScale modelcomputer030217 neurology & neurosurgeryScientific Reports
researchProduct

Compound conditionals as random quantities and Boolean algebras

2022

Conditionals play a key role in different areas of logic and probabilistic reasoning, and they have been studied and formalised from different angles. In this paper we focus on the de Finetti's notion of conditional as a three-valued object, with betting-based semantics, and its related approach as random quantity as mainly developed by two of the authors. Compound conditionals have been studied in the literature, but not in full generality. In this paper we provide a natural procedure to explicitly attach conditional random quantities to arbitrary compound conditionals that also allows us to compute their previsions. By studying the properties of these random quantities, we show that, in f…

03B48Settore MAT/06 - Probabilita' E Statistica MatematicaFOS: MathematicsMathematics - LogicLogic (math.LO)Compound conditionals Conditional Boolean algebra conjunction and disjunction canonical extension
researchProduct

On the Almost Everywhere Convergence of Multiple Fourier-Haar Series

2019

The paper deals with the question of convergence of multiple Fourier-Haar series with partial sums taken over homothetic copies of a given convex bounded set $$W\subset\mathbb{R}_+^n$$ containing the intersection of some neighborhood of the origin with $$\mathbb{R}_+^n$$ . It is proved that for this type sets W with symmetric structure it is guaranteed almost everywhere convergence of Fourier-Haar series of any function from the class L(ln+L)n−1.

40A05Control and OptimizationBounded set (topological vector space)Type (model theory)01 natural sciencesmultiple Fourier-Haar seriesHomothetic transformationCombinatoricssymbols.namesakeSettore MAT/05 - Analisi Matematica0103 physical sciences42C10Almost everywhere0101 mathematicsMathematicsSeries (mathematics)Applied Mathematics010102 general mathematicsRegular polygonAlmost everywhere convergenceFunction (mathematics)Fourier transformsymbols010307 mathematical physicslacunar serieAnalysisJournal of Contemporary Mathematical Analysis (Armenian Academy of Sciences)
researchProduct