3,019 research outputs found
Strain-induced kinetics of intergrain defects as the mechanism of slow dynamics in the nonlinear resonant response of humid sandstone bars
A closed-form description is proposed to explain nonlinear and slow dynamics
effects exhibited by sandstone bars in longitudinal resonance experiments.
Along with the fast subsystem of longitudinal nonlinear displacements we
examine the strain-dependent slow subsystem of broken intergrain and
interlamina cohesive bonds. We show that even the simplest but
phenomenologically correct modelling of their mutual feedback elucidates the
main experimental findings typical for forced longitudinal oscillations of
sandstone bars, namely, (i) hysteretic behavior of a resonance curve on both
its up- and down-slopes, (ii) linear softening of resonant frequency with
increase of driving level, and (iii) gradual recovery (increase) of resonant
frequency at low dynamical strains after the sample was conditioned by high
strains. In order to reproduce the highly nonlinear elastic features of
sandstone grained structure a realistic non-perturbative form of strain
potential energy was adopted. In our theory slow dynamics associated with the
experimentally observed memory of peak strain history is attributed to
strain-induced kinetic changes in concentration of ruptured inter-grain and
inter-lamina cohesive bonds causing a net hysteretic effect on the elastic
Young's modulus. Finally, we explain how enhancement of hysteretic phenomena
originates from an increase in equilibrium concentration of ruptured cohesive
bonds that are due to water saturation.Comment: 5 pages, 3 figure
Toepassing van het concept EPA als verbinding tussen professionele activiteiten en CanMEDS competentie-gebieden: pilotstudie Physician Assistant Urologie
Does Treewidth Help in Modal Satisfiability?
Many tractable algorithms for solving the Constraint Satisfaction Problem
(CSP) have been developed using the notion of the treewidth of some graph
derived from the input CSP instance. In particular, the incidence graph of the
CSP instance is one such graph. We introduce the notion of an incidence graph
for modal logic formulae in a certain normal form. We investigate the
parameterized complexity of modal satisfiability with the modal depth of the
formula and the treewidth of the incidence graph as parameters. For various
combinations of Euclidean, reflexive, symmetric and transitive models, we show
either that modal satisfiability is FPT, or that it is W[1]-hard. In
particular, modal satisfiability in general models is FPT, while it is
W[1]-hard in transitive models. As might be expected, modal satisfiability in
transitive and Euclidean models is FPT.Comment: Full version of the paper appearing in MFCS 2010. Change from v1:
improved section 5 to avoid exponential blow-up in formula siz
Query Repairs
We formalize and study the problem of repairing database queries based on user feedback in the form of a collection of labeled examples. We propose a framework based on the notion of a proximity pre-order, and we investigate and compare query repairs for conjunctive queries (CQs) using different such pre-orders. The proximity pre-orders we consider are based on query containment and on distance metrics for CQs
Early onset and progression of left ventricular remodeling after alcohol septal ablation in hypertrophic obstructive cardiomyopathy
Background - Alcohol septal ablation (ASA) reduces left ventricular outflow tract (LVOT) pressure gradient in patients with hypertrophic obstructive cardiomyopathy (HOCM), which leads to left ventricular remodeling. We sought to describe the early to midterm changes and modulating factors of the remodeling process using cardiac MRI (CMR). Methods and Results - CMR was performed at baseline and 1 and 6 months after ASA in 29 patients with HOCM (age 52±16 years). Contrast-enhanced CMR showed no infarct-related hyperenhancement outside the target septal area. Septal mass decreased from 75±23 g at baseline to 68±22 and 58±19 g (P<0.001) at 1- and 6-month follow-up, respectively. Remote, nonseptal mass decreased from 141±41 to 132±40 and 111±27 g (P<0.001), respectively. Analysis of temporal trends revealed that septal mass reduction was positively associated with contrast-enhanced infarct size and transmural or left-sided septal infarct location at both 1 and 6 months. Remote mass reduction was associated with infarct location at 6 months but not with contrast-enhanced infarct size. By linear regression analysis, percentage remote mass reduction correlated significantly with LVOT gradient reduction at 6-month follow-up (P=0.03). Conclusions - Left ventricular remodeling after ASA occurs early and progresses on midterm follow-up, modulated by CMR infarct size and location. Remote mass reduction is associated with infarct location and correlates with reduction of the LVOT pressure gradient. Thus, myocardial hypertrophy in HOCM is, at least in part, afterload dependent and reversible and is not exclusively caused by the genetic disorder
DNS of vertical plane channel flow with finite-size particles: Voronoi analysis, acceleration statistics and particle-conditioned averaging
We have performed a direct numerical simulation of dilute turbulent
particulate flow in a vertical plane channel, fully resolving the phase
interfaces. The flow conditions are the same as those in the main case of
"Uhlmann, M., Phys. Fluids, vol. 20, 2008, 053305", with the exception of the
computational domain length which has been doubled in the present study. The
statistics of flow and particle motion are not significantly altered by the
elongation of the domain. The large-scale columnar-like structures which had
previously been identified do persist and they are still only marginally
decorrelated in the prolonged domain. Voronoi analysis of the spatial particle
distribution shows that the state of the dispersed phase can be characterized
as slightly more ordered than random tending towards a homogeneous spatial
distribution. It is also found that the p.d.f.'s of Lagrangian particle
accelerations for wall-normal and spanwise directions follow a lognormal
distribution as observed in previous experiments of homogeneous flows. The
streamwise component deviates from this law presenting significant skewness.
Finally, a statistical analysis of the flow in the near field around the
particles reveals that particle wakes present two regions, a near wake where
the velocity deficit decays as 1/x and a far wake with a decay of approximately
1/(x*x).Comment: accepted for publication in Int. J. Multiphase Flo
Investigating the biological properties of carbohydrate derived fulvic acid (CHD-FA) as a potential novel therapy for the management of oral biofilm infections.
Background:
A number of oral diseases, including periodontitis, derive from microbial biofilms and are associated with increased antimicrobial resistance. Despite the widespread use of mouthwashes being used as adjunctive measures to control these biofilms, their prolonged use is not recommended due to various side effects. Therefore, alternative broad-spectrum antimicrobials that minimise these effects are highly sought after. Carbohydrate derived fulvic acid (CHD-FA) is an organic acid which has previously demonstrated to be microbiocidal against Candida albicans biofilms, therefore, the aims of this study were to evaluate the antibacterial activity of CHD-FA against orally derived biofilms and to investigate adjunctive biological effects.<p></p>
Methods:
Minimum inhibitory concentrations were evaluated for CHD-FA and chlorhexidine (CHX) against a range of oral bacteria using standardised microdilution testing for planktonic and sessile. Scanning electron microscopy was also employed to visualise changes in oral biofilms after antimicrobial treatment. Cytotoxicity of these compounds was assessed against oral epithelial cells, and the effect of CHD-FA on host inflammatory markers was assessed by measuring mRNA and protein expression.<p></p>
Results:
CHD-FA was highly active against all of the oral bacteria tested, including Porphyromonas gingivalis, with a sessile minimum inhibitory concentration of 0.5%. This concentration was shown to kill multi-species biofilms by approximately 90%, levels comparable to that of chlorhexidine (CHX). In a mammalian cell culture model, pretreatment of epithelial cells with buffered CHD-FA was shown to significantly down-regulate key inflammatory mediators, including interleukin-8 (IL-8), after stimulation with a multi-species biofilm.<p></p>
Conclusions:
Overall, CHD-FA was shown to possess broad-spectrum antibacterial activity, with a supplementary function of being able to down-regulate inflammation. These properties offer an attractive spectrum of function from a naturally derived compound, which could be used as an alternative topical treatment strategy for oral biofilm diseases. Further studies in vitro and in vivo are required to determine the precise mechanism by which CHD-FA modulates the host immune response.<p></p>
When do homomorphism counts help in query algorithms?
A query algorithm based on homomorphism counts is a procedure for determining
whether a given instance satisfies a property by counting homomorphisms between
the given instance and finitely many predetermined instances. In a left query
algorithm, we count homomorphisms from the predetermined instances to the given
instance, while in a right query algorithm we count homomorphisms from the
given instance to the predetermined instances. Homomorphisms are usually
counted over the semiring N of non-negative integers; it is also meaningful,
however, to count homomorphisms over the Boolean semiring B, in which case the
homomorphism count indicates whether or not a homomorphism exists. We first
characterize the properties that admit a left query algorithm over B by showing
that these are precisely the properties that are both first-order definable and
closed under homomorphic equivalence. After this, we turn attention to a
comparison between left query algorithms over B and left query algorithms over
N. In general, there are properties that admit a left query algorithm over N
but not over B. The main result of this paper asserts that if a property is
closed under homomorphic equivalence, then that property admits a left query
algorithm over B if and only if it admits a left query algorithm over N. In
other words and rather surprisingly, homomorphism counts over N do not help as
regards properties that are closed under homomorphic equivalence. Finally, we
characterize the properties that admit both a left query algorithm over B and a
right query algorithm over B.Comment: 24 page
When Do Homomorphism Counts Help in Query Algorithms?
A query algorithm based on homomorphism counts is a procedure for determining whether a given instance satisfies a property by counting homomorphisms between the given instance and finitely many predetermined instances. In a left query algorithm, we count homomorphisms from the predetermined instances to the given instance, while in a right query algorithm we count homomorphisms from the given instance to the predetermined instances. Homomorphisms are usually counted over the semiring ℕ of non-negative integers; it is also meaningful, however, to count homomorphisms over the Boolean semiring , in which case the homomorphism count indicates whether or not a homomorphism exists. We first characterize the properties that admit a left query algorithm over by showing that these are precisely the properties that are both first-order definable and closed under homomorphic equivalence. After this, we turn attention to a comparison between left query algorithms over and left query algorithms over ℕ. In general, there are properties that admit a left query algorithm over ℕ but not over . The main result of this paper asserts that if a property is closed under homomorphic equivalence, then that property admits a left query algorithm over if and only if it admits a left query algorithm over ℕ. In other words and rather surprisingly, homomorphism counts over ℕ do not help as regards properties that are closed under homomorphic equivalence. Finally, we characterize the properties that admit both a left query algorithm over and a right query algorithm over
- …
