Search results for " computational"
showing 10 items of 661 documents
A computational approach for the assessment of executive functions in patients with obsessive-compulsive disorder
2019
Previous studies on obsessive–compulsive disorder (OCD) showed impairments in executive domains, particularly in cognitive inhibition. In this perspective, the use of virtual reality showed huge potential in the assessment of executive functions; however, unfortunately, to date, no study on the assessment of these patients took advantage of the use of virtual environments. One of the main problems faced within assessment protocols is the use of a limited number of variables and tools when tailoring a personalized program. The main aim of this study was to provide a heuristic decision tree for the future development of tailored assessment protocols. To this purpose, we conducted a study that…
GIS Infomobility for Travellers
2016
Geographical Information Systems (GIS) are essential systems to support decisions on territorial and environmental aspects. But they not always have been properly used for this purpose. Only in recent years GIS have been getting better used for the planning, management and control of the territory. The application of GIS to the transport sector has become relevant both for management and decision-making in support of Public Administration (PA) and citizens. GIS are particularly useful for roads and routing graphs management capabilities as well as for searching the most suitable path. The results achieved in this research activity aimed to evaluate different road graphs, proprietary and fre…
Packing colorings of subcubic outerplanar graphs
2018
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…
Force Field for Water over Pt(111): Development, Assessment, and Comparison
2018
Metal/water interfaces are key in many natural and industrial processes, such as corrosion, atmospheric, or environmental chemistry. Even today, the only practical approach to simulate large interfaces between a metal and water is to perform force-field simulations. In this work, we propose a novel force field, GAL17, to describe the interaction of water and a Pt(111) surface. GAL17 builds on three terms: (i) a standard Lennard-Jones potential for the bonding interaction between the surface and water, (ii) a Gaussian term to improve the surface corrugation, and (iii) two terms describing the angular dependence of the interaction energy. The 12 parameters of this force field are fitted again…
A posteriori modelling-discretization error estimate for elliptic problems with L ∞-Coefficients
2017
We consider elliptic problems with complicated, discontinuous diffusion tensor A0. One of the standard approaches to numerically treat such problems is to simplify the coefficient by some approximation, say Aϵ, and to use standard finite elements. In [19] a combined modelling-discretization strategy has been proposed which estimates the discretization and modelling errors by a posteriori estimates of functional type. This strategy allows to balance these two errors in a problem adapted way. However, the estimate of the modelling error was derived under the assumption that the difference A0 - Aϵ becomes small with respect to the L∞-norm. This implies in particular that interfaces/discontinui…
Modeling mass transfer in fracture flows with the time domain-random walk method
2019
The time domain-random walk method was developed further for simulating mass transfer in fracture flows together with matrix diffusion in surrounding porous media. Specifically, a time domain-random walk scheme was developed for numerically approximating solutions of the advection-diffusion equation when the diffusion coefficient exhibits significant spatial variation or even discontinuities. The proposed scheme relies on second-order accurate, central-difference approximations of the advective and diffusive fluxes. The scheme was verified by comparing simulated results against analytical solutions in flow configurations involving a rectangular channel connected on one side with a porous ma…
Varieties of algebras with pseudoinvolution and polynomial growth
2017
Let A be an associative algebra with pseudoinvolution (Formula presented.) over an algebraically closed field of characteristic zero and let (Formula presented.) be its sequence of (Formula presented.) -codimensions. We shall prove that such a sequence is polynomially bounded if and only if the variety generated by A does not contain five explicitly described algebras with pseudoinvolution. As a consequence, we shall classify the varieties of algebras with pseudoinvolution of almost polynomial growth, i.e. varieties of exponential growth such that any proper subvariety has polynomial growth and, along the way, we shall give also the classification of their subvarieties. Finally, we shall de…
Estimates for the differences of positive linear operators and their derivatives
2019
The present paper deals with the estimate of the differences of certain positive linear operators and their derivatives. Oxur approach involves operators defined on bounded intervals, as Bernstein operators, Kantorovich operators, genuine Bernstein-Durrmeyer operators, and Durrmeyer operators with Jacobi weights. The estimates in quantitative form are given in terms of the first modulus of continuity. In order to analyze the theoretical results in the last section, we consider some numerical examples.
Frames and weak frames for unbounded operators
2020
In 2012 G\u{a}vru\c{t}a introduced the notions of $K$-frame and of atomic system for a linear bounded operator $K$ in a Hilbert space $\mathcal{H}$, in order to decompose its range $\mathcal{R}(K)$ with a frame-like expansion. In this article we revisit these concepts for an unbounded and densely defined operator $A:\mathcal{D}(A)\to\mathcal{H}$ in two different ways. In one case we consider a non-Bessel sequence where the coefficient sequence depends continuously on $f\in\mathcal{D}(A)$ with respect to the norm of $\mathcal{H}$. In the other case we consider a Bessel sequence and the coefficient sequence depends continuously on $f\in\mathcal{D}(A)$ with respect to the graph norm of $A$.
A low complexity distributed cluster based algorithm for spatial prediction
2017
Los mapas del entorno radioeléctrico (REM) pueden ser una herramienta esencial para numerosas aplicaciones en las futuras redes inalámbricas 5G. En este trabajo, empleamos un popular método geoestadístico llamado kriging ordinario para estimar el REM de un área cubierta por un eNodeB equipado con múltiples antenas. Los sensores inalámbricos se distribuyen por el área de interés y se organizan clústeres adaptativos de sensores para mejorar la calidad de la estimación del canal. En este trabajo, modificamos el algoritmo de clustering distribuido propuesto en un trabajo anterior para reducir la complejidad de la predicción de kriging. Se realizan simulaciones para detallar la técnica de formac…