Search results for " Regular"

showing 10 items of 197 documents

La misurazione della performance accademica: un'analisi applicata al "costo standard per studente in corso"

2017

The recent introduction of the “standard cost per regular student”, as a criterion adopted by the Italian Ministry of Education to measure public university performance, implies a deep afterthought of those methods underlying the design of performance management and measurement systems in Italian universities. This has also to be extended – through a systemic perspective – to the evaluation of the Third Mission activities influencing the corresponding socio-economic context. With the intent to support a diagnostic activity related to the academic performance, this paper aims at introducing a system of output-outcome indicators – within a consistent framework – oriented to measure the driver…

Settore SECS-P/07 - Economia AziendaleProspettiva bilanciata 'output-outcome'Misurazione performance accademicaUniversitàStandard Unit Cost to Educate a Regular StudentOutput-to-Outcome ManagementPerformance IndicatorsCosto standard per studente in corso
researchProduct

Block Based Deconvolution Algorithm Using Spline Wavelet Packets

2010

This paper presents robust algorithms to deconvolve discrete noised signals and images. The idea behind the algorithms is to solve the convolution equation separately in different frequency bands. This is achieved by using spline wavelet packets. The solutions are derived as linear combinations of the wavelet packets that minimize some parameterized quadratic functionals. Parameters choice, which is performed automatically, determines the trade-off between the solution regularity and the initial data approximation. This technique, which id called Spline Harmonic Analysis, provides a unified computational scheme for the design of orthonormal spline wavelet packets, fast implementation of the…

Statistics and ProbabilityApplied MathematicsSpline waveletCondensed Matter PhysicsDeconvolution · Wavelet packet · Spline · RegularityWavelet packet decompositionSpline (mathematics)Quadratic equationModeling and SimulationOrthonormal basisGeometry and TopologyComputer Vision and Pattern RecognitionDeconvolutionThin plate splineLinear combinationAlgorithmMathematics
researchProduct

The rank of random regular digraphs of constant degree

2018

Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .

Statistics and ProbabilityControl and OptimizationUniform distribution (continuous)General Mathematics0102 computer and information sciencesrandom matrices01 natural sciencesCombinatoricsIntegerFOS: Mathematics60B20 15B52 46B06 05C80Rank (graph theory)Adjacency matrix0101 mathematicsEigenvalues and eigenvectorsMathematicsNumerical AnalysisAlgebra and Number TheoryDegree (graph theory)Applied MathematicsProbability (math.PR)010102 general mathematicsrandom regular graphssingularity probabilityrank010201 computation theory & mathematicsRegular graphRandom matrixMathematics - ProbabilityJournal of Complexity
researchProduct

On 1-Laplacian Elliptic Equations Modeling Magnetic Resonance Image Rician Denoising

2015

Modeling magnitude Magnetic Resonance Images (MRI) rician denoising in a Bayesian or generalized Tikhonov framework using Total Variation (TV) leads naturally to the consideration of nonlinear elliptic equations. These involve the so called $1$-Laplacian operator and special care is needed to properly formulate the problem. The rician statistics of the data are introduced through a singular equation with a reaction term defined in terms of modified first order Bessel functions. An existence theory is provided here together with other qualitative properties of the solutions. Remarkably, each positive global minimum of the associated functional is one of such solutions. Moreover, we directly …

Statistics and ProbabilityFOS: Computer and information sciencesComputer scienceNoise reductionComputer Vision and Pattern Recognition (cs.CV)Bayesian probabilityComputer Science - Computer Vision and Pattern Recognition02 engineering and technology01 natural sciencesTikhonov regularizationsymbols.namesakeMathematics - Analysis of PDEsOperator (computer programming)Rician fading0202 electrical engineering electronic engineering information engineeringFOS: MathematicsApplied mathematicsMathematics - Numerical Analysis0101 mathematicsApplied Mathematics010102 general mathematicsNumerical Analysis (math.NA)Condensed Matter PhysicsNonlinear systemModeling and Simulationsymbols020201 artificial intelligence & image processingGeometry and TopologyComputer Vision and Pattern RecognitionLaplace operatorBessel functionAnalysis of PDEs (math.AP)
researchProduct

Uniform measure density condition and game regularity for tug-of-war games

2018

We show that a uniform measure density condition implies game regularity for all 2 < p < ∞ in a stochastic game called “tug-of-war with noise”. The proof utilizes suitable choices of strategies combined with estimates for the associated stopping times and density estimates for the sum of independent and identically distributed random vectors. peerReviewed

Statistics and ProbabilityIndependent and identically distributed random variablesComputer Science::Computer Science and Game Theorygame regularitydensity estimate for the sum of i.i.d. random vectorsTug of war01 natural sciencesMeasure (mathematics)$p$-regularityMathematics - Analysis of PDEsFOS: MathematicsApplied mathematicspeliteoriastochastic games0101 mathematics91A15 60G50 35J92Mathematicsp-harmonic functionsstokastiset prosessit$p$-harmonic functionsosittaisdifferentiaaliyhtälöthitting probability010102 general mathematicsStochastic gametug-of-war gamesProbability (math.PR)uniform measure density condition010101 applied mathematicsNoiseuniform distribution in a ballMathematics - ProbabilityAnalysis of PDEs (math.AP)
researchProduct

Bayesian analysis of a Gibbs hard-core point pattern model with varying repulsion range

2014

A Bayesian solution is suggested for the modelling of spatial point patterns with inhomogeneous hard-core radius using Gaussian processes in the regularization. The key observation is that a straightforward use of the finite Gibbs hard-core process likelihood together with a log-Gaussian random field prior does not work without penalisation towards high local packing density. Instead, a nearest neighbour Gibbs process likelihood is used. This approach to hard-core inhomogeneity is an alternative to the transformation inhomogeneous hard-core modelling. The computations are based on recent Markovian approximation results for Gaussian fields. As an application, data on the nest locations of Sa…

Statistics and ProbabilityMathematical optimizationGaussianBayesian probabilityBayesian analysisMarkov processRegularization (mathematics)symbols.namesakeGaussian process regularisationPERFECT SIMULATIONRange (statistics)Statistical physicsGaussian processMathematicsta113ta112Random fieldApplied MathematicsInhomogeneousSand Martin's nestsTRANSFORMATIONHard-core point processComputational MathematicsTransformation (function)Computational Theory and MathematicssymbolsINFERENCECOMPUTATIONAL STATISTICS AND DATA ANALYSIS
researchProduct

Nonlinear Nonhomogeneous Elliptic Problems

2019

We consider nonlinear elliptic equations driven by a nonhomogeneous differential operator plus an indefinite potential. The boundary condition is either Dirichlet or Robin (including as a special case the Neumann problem). First we present the corresponding regularity theory (up to the boundary). Then we develop the nonlinear maximum principle and present some important nonlinear strong comparison principles. Subsequently we see how these results together with variational methods, truncation and perturbation techniques, and Morse theory (critical groups) can be used to analyze different classes of elliptic equations. Special attention is given to (p, 2)-equations (these are equations driven…

Strong comparison principles(p 2)-equationsMultiplicity theoremsNodal solutionsDifferential operatorDirichlet distributionNonlinear systemsymbols.namesakeMaximum principleSettore MAT/05 - Analisi MatematicaNeumann boundary conditionsymbolsApplied mathematicsBoundary value problemNonlinear maximum principleLaplace operatorNonlinear regularityMorse theoryMathematics
researchProduct

Existence, nonexistence and uniqueness of positive solutions for nonlinear eigenvalue problems

2017

We study the existence of positive solutions for perturbations of the classical eigenvalue problem for the Dirichlet $p-$Laplacian. We consider three cases. In the first the perturbation is $(p-1)-$sublinear near $+\infty$, while in the second the perturbation is $(p-1)-$superlinear near $+\infty$ and in the third we do not require asymptotic condition at $+\infty$. Using variational methods together with truncation and comparison techniques, we show that for $\lambda\in (0, \widehat{\lambda}_1)$ -$\lambda>0$ is the parameter and $\widehat{\lambda}_1$ being the principal eigenvalue of $\left(-\Delta_p, W^{1, p}_0(\Omega)\right)$ -we have positive solutions, while for $\lambda\geq \widehat{\…

Sublinear functionMonotonic functionLambda01 natural sciencesOmegaDirichlet distributionsymbols.namesakeFirst eigenvalueP-LaplacianUniqueness0101 mathematicsEigenvalues and eigenvectorsMathematical physicsNonlinear regularityPhysicsApplied Mathematics010102 general mathematicsMathematical analysisVariational methodAnalysiFirst eigenvalue; Generalized picone's identity; Nonlinear maximum principle; Nonlinear regularity; P-Laplacian; Variational methods; Analysis; Applied MathematicsGeneral Medicine010101 applied mathematicsp-LaplaciansymbolsNonlinear maximum principleGeneralized picone's identityAnalysis
researchProduct

Il ruolo del white paper sulle offerte al pubblico di cripto-attività alla luce della proposta MiCA

2022

La proposta MiCA, nel regolare il white paper sulle offerte di crypto-assets, sembra tenere in considerazione i benefici e i limiti dei sistemi di voluntary e di mandatory disclosure, non optando integralmente né per il primo, né per il secondo. In quest’ottica, se può condividersi l’approccio regolamentare diretto a graduare, a seconda della tipologia di token offerto, sia il contenuto che l’assoggettamento del documento a mera notifica o ad approvazione ex ante da parte dell’Autorità competente, dubbi sorgono in ordine all’indistinta allocazione dell’onere della prova in capo all’oblato, nei casi di violazione della disciplina del relativo white paper.

The MiCa proposal in the regular white paper on crypto-assets offerings seems to take into account the benefits and limitations of voluntary and mandatory disclosure systems not opting for either the former or the latter in full. On one hand one can agree with the regulatory approach aimed at adapting the content of the white paper to the type of token offered and at making the white paper either subject to mere notification or to the approval by the competent Authority depending on the asset offered. On the other hand doubts arise on the indistinct allocation of the burden of proof to the user in case of infringement of the relevant white paper framework.Settore IUS/04 - Diritto Commerciale
researchProduct

On the impact of forgetting on learning machines

1995

People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…

Theoretical computer scienceActive learning (machine learning)Computer scienceSemi-supervised learningMutual recursionArtificial IntelligenceInstance-based learningHierarchyForgettingKolmogorov complexitybusiness.industryLearnabilityAlgorithmic learning theoryOnline machine learningInductive reasoningPumping lemma for regular languagesTerm (time)Computational learning theoryHardware and ArchitectureControl and Systems EngineeringArtificial intelligenceSequence learningbusinessSoftwareCognitive psychologyInformation SystemsJournal of the ACM
researchProduct