Search results for " rando"

showing 10 items of 498 documents

Effects of an Individualized Active Aging Counseling Intervention on Mobility and Physical Activity: Secondary Analyses of a Randomized Controlled Tr…

2020

Objectives: The aim of this study was to report preplanned secondary analyses of the effects of a 12-month individualized active aging counseling intervention on six mobility and physical activity outcomes. Methods: A two-arm, single-blinded randomized controlled trial was conducted among 75- and 80-year-old community-dwelling people. The intervention group (IG, n = 101) received counseling aimed at increasing self-selected, primarily out-of-home activity. The control group (CG, n = 103) received general health information. Data were analyzed with generalized estimating equations. Results: Physical performance improved in the IG more than that in the CG (group by time p = .022), self-repor…

CounselingMaleAgingitsemäärääminenmedicine.medical_specialtymielekkyysfyysinen toimintakykyPhysical activityWalkingPhysical functionmeaningful activitylaw.invention03 medical and health sciencesphysical function0302 clinical medicineRandomized controlled triallawlife-spaceHumansMedicine030212 general & internal medicineMobility LimitationautonomyCounseling InterventionExerciseAgedAged 80 and overCommunity and Home Carebusiness.industryliikuntaneuvontaArticles030229 sport sciencessatunnaistetut vertailukokeet3. Good healthLife spacePersonal Autonomyrandomized controlled trialPhysical therapyFemaleIndependent LivingGeriatrics and Gerontologybusinessautonomy randomized controlled trialGerontologyRCTfyysinen aktiivisuusikääntyneetJournal of Aging and Health
researchProduct

Effects of two essential oil mouthrinses on 4-day supragingival plaque regrowth: A randomized cross-over study

2013

Purpose: To investigate the plaque inhibiting effects of two commercially available mouthrinses containing essential oils (EO). Both products contained the same concentration of EO, but one of them did not contain ethanol. Methods: The study was an observer-masked, randomized, 4 × 4 Latin square cross-over design, balanced for carryover effects, involving 12 participants in a 4-day plaque regrowth model. A 0.12% chlorhexidine (CHX) rinse and a saline solution served as positive and negative controls, respectively. On Day 1, subjects received professional prophylaxis, suspended oral hygiene measures, and commenced rinsing with their allocated rinses. On Day 5, subjects were scored for disclo…

Cross-Over StudiesSettore MED/28 - Malattie OdontostomatologicheGingival DiseasesSettore MED/50 - Scienze Tecniche Mediche ApplicateDental PlaqueMouthwashesOils VolatileHumansessential oils ethanol mouth rinse plaque regrowth randomized trial
researchProduct

Anomalous transport effects on switching currents of graphene-based Josephson junctions

2017

We explore the effect of noise on the ballistic graphene-based small Josephson junctions in the framework of the resistively and capacitively shunted model. We use the non-sinusoidal current-phase relation specific for graphene layers partially covered by superconducting electrodes. The noise induced escapes from the metastable states, when the external bias current is ramped, give the switching current distribution, i.e. the probability distribution of the passages to finite voltage from the superconducting state as a function of the bias current, that is the information more promptly available in the experiments. We consider a noise source that is a mixture of two different types of proce…

DYNAMICSJosephson effectJosephson junctionsGaussianFOS: Physical sciencesgraphemeBioengineering01 natural sciencesNoise (electronics)Settore FIS/03 - Fisica Della Materia010305 fluids & plasmaslaw.inventionsymbols.namesakelawJosephson junction0103 physical sciencesMesoscale and Nanoscale Physics (cond-mat.mes-hall)Graphene; Josephson junctions; Levy processes; Non-thermal noise; Bioengineering; Chemistry (all); Materials Science (all); Mechanics of Materials; Mechanical Engineering; Electrical and Electronic EngineeringMechanics of MaterialGeneral Materials ScienceElectrical and Electronic Engineering010306 general physicsPhysicsSuperconductivityLevy processesCondensed matter physicsCondensed Matter - Mesoscale and Nanoscale PhysicsGrapheneMechanical EngineeringSTABLE RANDOM-VARIABLESChemistry (all)Non-thermal noiseBiasingGeneral ChemistryGraphene; Josephson junctions; Levy processes; Non-thermal noise; STABLE RANDOM-VARIABLES; DYNAMICSLevy processeMechanics of MaterialsPhysics - Data Analysis Statistics and ProbabilitysymbolsProbability distributionMaterials Science (all)GrapheneTransport phenomenaData Analysis Statistics and Probability (physics.data-an)
researchProduct

Hidden Markov random field model and Broyden–Fletcher–Goldfarb–Shanno algorithm for brain image segmentation

2018

International audience; Many routine medical examinations produce images of patients suffering from various pathologies. With the huge number of medical images, the manual analysis and interpretation became a tedious task. Thus, automatic image segmentation became essential for diagnosis assistance. Segmentation consists in dividing the image into homogeneous and significant regions. We focus on hidden Markov random fields referred to as HMRF to model the problem of segmentation. This modelisation leads to a classical function minimisation problem. Broyden-Fletcher-Goldfarb-Shanno algorithm referred to as BFGS is one of the most powerful methods to solve unconstrained optimisation problem. …

Dice coefficient criterionComputer scienceBrain image segmentation02 engineering and technologyMR-images[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Theoretical Computer Science03 medical and health sciences0302 clinical medicineArtificial Intelligence0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]SegmentationBrain magnetic resonance imagingHidden Markov modelRandom fieldbusiness.industryBroyden-Fletcher-Goldfarb-Shanno algorithmPattern recognitionImage segmentationhidden Markov random fieldMinimization3. Good healthHomogeneousBroyden–Fletcher–Goldfarb–Shanno algorithm020201 artificial intelligence & image processingAutomatic segmentationArtificial intelligenceHidden Markov random fieldbusiness030217 neurology & neurosurgerySoftwareJournal of Experimental & Theoretical Artificial Intelligence
researchProduct

Generalized Wiener Process and Kolmogorov's Equation for Diffusion induced by Non-Gaussian Noise Source

2005

We show that the increments of generalized Wiener process, useful to describe non-Gaussian white noise sources, have the properties of infinitely divisible random processes. Using functional approach and the new correlation formula for non-Gaussian white noise we derive directly from Langevin equation, with such a random source, the Kolmogorov's equation for Markovian non-Gaussian process. From this equation we obtain the Fokker-Planck equation for nonlinear system driven by white Gaussian noise, the Kolmogorov-Feller equation for discontinuous Markovian processes, and the fractional Fokker-Planck equation for anomalous diffusion. The stationary probability distributions for some simple cas…

Diffusion equationStatistical Mechanics (cond-mat.stat-mech)General MathematicsMathematical analysisGeneral Physics and AstronomyFOS: Physical sciencesOrnstein–Uhlenbeck processCondensed Matter - Soft Condensed MatterGaussian random fieldLangevin equationsymbols.namesakeStochastic differential equationAdditive white Gaussian noiseGaussian noisesymbolsProcess and Kolmogorov'sSoft Condensed Matter (cond-mat.soft)Fokker–Planck equationCondensed Matter - Statistical MechanicsMathematics
researchProduct

Branch and bound for the cutwidth minimization problem

2013

The cutwidth minimization problem consists of finding a linear arrangement of the vertices of a graph where the maximum number of cuts between the edges of the graph and a line separating consecutive vertices is minimized. We first review previous approaches for special classes of graphs, followed by lower bounds and then a linear integer formulation for the general problem. We then propose a branch-and-bound algorithm based on different lower bounds on the cutwidth of partial solutions. Additionally, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic to obtain good initial solutions. The combination of the branch-and-bound and GRASP methods results in optimal solu…

Discrete mathematicsGeneral Computer ScienceBranch and boundGeneral problemMinimization problemGRASPCPU timeManagement Science and Operations ResearchUpper and lower boundsCombinatoricsModeling and SimulationInteger programmingGreedy randomized adaptive search procedureMathematicsComputers & Operations Research
researchProduct

On a representation theorem for finitely exchangeable random vectors

2016

A random vector $X=(X_1,\ldots,X_n)$ with the $X_i$ taking values in an arbitrary measurable space $(S, \mathscr{S})$ is exchangeable if its law is the same as that of $(X_{\sigma(1)}, \ldots, X_{\sigma(n)})$ for any permutation $\sigma$. We give an alternative and shorter proof of the representation result (Jaynes \cite{Jay86} and Kerns and Sz\'ekely \cite{KS06}) stating that the law of $X$ is a mixture of product probability measures with respect to a signed mixing measure. The result is "finitistic" in nature meaning that it is a matter of linear algebra for finite $S$. The passing from finite $S$ to an arbitrary one may pose some measure-theoretic difficulties which are avoided by our p…

Discrete mathematicsRepresentation theoremMultivariate random variableApplied MathematicsSigned measureProbability (math.PR)010102 general mathematicsSpace (mathematics)01 natural sciencesMeasure (mathematics)60G09 (Primary) 60G55 62E99 (Secondary)010104 statistics & probabilityHomogeneous polynomialFOS: Mathematics0101 mathematicsMathematics - ProbabilityAnalysisMixing (physics)MathematicsProbability measureJournal of Mathematical Analysis and Applications
researchProduct

Conjunction and Disjunction Among Conditional Events

2017

We generalize, in the setting of coherence, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. Given a prevision assessment on the conjunction of two conditional events, we study the set of coherent extensions for the probabilities of the two conditional events. Then, we introduce by a progressive procedure the notions of conjunction and disjunction for n conditional events. Moreover, by defining the negation of conjunction and of disjunction, we show that De Morgan’s Laws still hold. We also show that the associative and commutative properties are satisfied. Finally, we examine in detail the conjunction for a family \(\mathcal F\) of t…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaComputer scienceConditional events · Conditional random quantities · Con- junction · Disjunction · Negation · Quasi conjunction · Coherent previ- sion assessments · Coherent extensions · De Morgan’s Laws02 engineering and technologyCoherence (philosophical gambling strategy)Settore MAT/01 - Logica Matematica01 natural sciencesDe Morgan's lawsConjunction (grammar)Set (abstract data type)010104 statistics & probabilitysymbols.namesakeNegation0202 electrical engineering electronic engineering information engineeringsymbols020201 artificial intelligence & image processing0101 mathematicsAlgorithmCommutative propertyAssociative propertyEvent (probability theory)
researchProduct

Probabilistic entailment and iterated conditionals

2020

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval $[0,1]$. We examine the iterated conditional $(B|K)|(A|H)$, by showing that $A|H$ p-entails $B|K$ if and only if $(B|K)|(A|H) = 1$. Then, we show that a p-consistent family $\mathcal{F}=\{E_1|H_1,E_2|H_2\}$ p-entails a conditional event $E_3|H_3$ if and only if $E_3|H_3=1$, or $(E_3|H_3)|QC(\mathcal{S})=1$ for some nonempty subset $\mathcal{S}$ of $\mathcal{F}$, where $QC(\mathcal{S})$ is the quasi conjunction of the conditional events in $\mathcal{S}$. Then, we examine the inference rules $A…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaIterated functionInterval (graph theory)Settore MAT/01 - Logica MatematicaCoherence Conditional random quantities p-entailment Inference rules.MathematicsStrict conditional
researchProduct

Conditional Random Quantities and Compounds of Conditionals

2013

In this paper we consider finite conditional random quantities and conditional previsions assessments in the setting of coherence. We use a suitable representation for conditional random quantities; in particular the indicator of a conditional event $E|H$ is looked at as a three-valued quantity with values 1, or 0, or $p$, where $p$ is the probability of $E|H$. We introduce a notion of iterated conditional random quantity of the form $(X|H)|K$ defined as a suitable conditional random quantity, which coincides with $X|HK$ when $H \subseteq K$. Based on a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of cohere…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaLogicImport–Export principleProbability (math.PR)Probabilistic logicConjunctionOf the formSettore M-FIL/02 - Logica E Filosofia Della ScienzaCoherence (philosophical gambling strategy)Conditional random quantitieConjunction (grammar)Lower/upper prevision boundsHistory and Philosophy of ScienceNegationIterated functionIterated conditioningFOS: MathematicsConditional eventRepresentation (mathematics)CoherenceDisjunctionMathematics - ProbabilityMathematicsEvent (probability theory)
researchProduct