Bridging constructions in Tsezic languages

This paper treats bridging constructions in the Tsezic languages (Bezhta, Hunzib, Khwarshi, Hinuq, and Tsez) of the Nakh-Daghestanian language family. We describe the syntactic and semantic properties of bridging constructions based on corpus data from all five Tsezic languages. Bridging constructions are defined as bipartite constructions that consist of a finite reference clause, which is followed by a non-main adverbial clause that functions as the bridging clause. The adverbial clause contains a variety of temporal converbs with general perfective converbs being more common than other types of temporal converbs. Reference and bridging clauses are both a target for additions, omissions, modifications and substitutions. Bridging constructions are primarily found in traditional oral narratives such as fairy tales where they index the genre and function as stylistic devices to express parallelism. Within the narratives they are often used to indicate episode changes and can be accompanied by switches of subject referents or locations

A comparative study of a direct discretization and an operator-splitting solver for population balance systems

A direct discretization approach and an operator-splitting scheme are applied for the numerical simulation of a population balance system which models the synthesis of urea with a uni-variate population. The problem is formulated in axisymmetric form and the setup is chosen such that a steady state is reached. Both solvers are assessed with respect to the accuracy of the results, where experimental data are used for comparison, and the efficiency of the simulations. Depending on the goal of simulations, to track the evolution of the process accurately or to reach the steady state fast, recommendations for the choice of the solver are given

A fully adaptive interpolated stochastic sampling method for random PDEs

A numerical method for the fully adaptive sampling and interpolation of PDE with random data is presented. It is based on the idea that the solution of the PDE with stochastic data can be represented as conditional expectation of a functional of a corresponding stochastic differential equation (SDE). The physical domain is decomposed subject to a non-uniform grid and a classical Euler scheme is employed to approximately solve the SDE at grid vertices. Interpolation with a conforming finite element basis is employed to reconstruct a global solution of the problem. An a posteriori error estimator is introduced which provides a measure of the different error contributions. This facilitates the formulation of an adaptive algorithm to control the overall error by either reducing the stochastic error by locally evaluating more samples, or the approximation error by locally refining the underlying mesh. Numerical examples illustrate the performance of the presented novel method

Adaptive SDE based interpolation for random PDEs

A numerical method for the fully adaptive sampling and interpolation of PDE with random data is presented. It is based on the idea that the solution of the PDE with stochastic data can be represented as conditional expectation of a functional of a corresponding stochastic differential equation (SDE). The physical domain is decomposed subject to a non-uniform grid and a classical Euler scheme is employed to approximately solve the SDE at grid vertices. Interpolation with a conforming finite element basis is employed to reconstruct a global solution of the problem. An a posteriori error estimator is introduced which provides a measure of the different error contributions. This facilitates the formulation of an adaptive algorithm to control the overall error by either reducing the stochastic error by locally evaluating more samples, or the approximation error by locally refining the underlying mesh. Numerical examples illustrate the performance of the presented novel method

SDE based regression for random PDEs

A simulation based method for the numerical solution of PDE with random coefficients is presented. By the Feynman-Kac formula, the solution can be represented as conditional expectation of a functional of a corresponding stochastic differential equation driven by independent noise. A time discretization of the SDE for a set of points in the domain and a subsequent Monte Carlo regression lead to an approximation of the global solution of the random PDE. We provide an initial error and complexity analysis of the proposed method along with numerical examples illustrating its behaviour

ParMooN - a modernized program package based on mapped finite elements

{\sc ParMooN} is a program package for the numerical solution of elliptic and parabolic partial differential equations. It inherits the distinct features of its predecessor {\sc MooNMD} \cite{JM04}: strict decoupling of geometry and finite element spaces, implementation of mapped finite elements as their definition can be found in textbooks, and a geometric multigrid preconditioner with the option to use different finite element spaces on different levels of the multigrid hierarchy. After having presented some thoughts about in-house research codes, this paper focuses on aspects of the parallelization for a distributed memory environment, which is the main novelty of {\sc ParMooN}. Numerical studies, performed on compute servers, assess the efficiency of the parallelized geometric multigrid preconditioner in comparison with some parallel solvers that are available in the library {\sc PETSc}. The results of these studies give a first indication whether the cumbersome implementation of the parallelized geometric multigrid method was worthwhile or not.Comment: partly supported by European Union (EU), Horizon 2020, Marie Sk{\l}odowska-Curie Innovative Training Networks (ITN-EID), MIMESIS, grant number 67571

Side effects and treatment initiation barriers of sodium-glucose cotransporter 2 inhibitors in heart failure: a systematic review and meta-analysis

Aims Physicians are sometimes reluctant to initiate guideline-directed therapy in patients with heart failure and reduced ejection fraction (HFrEF) due to concerns of adverse events. We explored the risk of hypotension, volume depletion, and acute kidney injury (AKI) on sodium–glucose cotransporter 2 (SGLT2) inhibitors in HFrEF populations. Methods and results We determined summary risk ratios (RRs) by conducting a meta-analysis on reported aforementioned adverse events on SGLT2 inhibitors from randomized controlled trials. We explored robustness of meta-analyses by computing fragility and/or reverse fragility index (FI or RFI) and its corresponding fragility quotient (FQ or RFQ) for each outcome. A total of 10 050 patients with HFrEF entered the final meta-analysis. Hypotension was reported in 4.5% (219/4836) on SGLT2 inhibitors and in 4.1% (202/4846) on placebo (RR 1.09, 95% confidence interval [CI] 0.91–1.31, p = 0.36). An RFI of 21 and RFQ of 0.002 suggest robust findings for hypotension. Volume depletion occurred in 9.4% (473/5019) on SGLT2 inhibitors and in 8.7% (438/5031) on placebo (RR 1.07, 95% CI 0.95–1.21, p = 0.25), respectively. RFI of 19 and RFQ of 0.001 suggest moderately robust findings for volume depletion. AKI was reported in fewer patients (1.9% [95/4888]) on SGLT2 inhibitors than on placebo (2.8% [140/4899]) providing lower incidence of AKI (RR 0.69, 95% CI 0.51–0.93, p = 0.02). FI of 14 and RFQ of 0.001 suggest moderately robust findings for AKI. Conclusion Sodium–glucose cotransporter 2 inhibitor therapy is not associated with a clinically relevant risk of hypotension and volume depletion. Its use reduces the risk of AKI. This analysis supports current guideline recommendations on early use of SGLT2 inhibitors

Bridging constructions

Many descriptive grammars report the use of a linguistic pattern at the interface between discourse and syntax which is known generally as tail-head linkage. This volume takes an unprecedented look at this type of linkage across languages and shows that there exist three distinct variants, all subsumed under the hypernym bridging constructions. The chapters highlight the defining features of these constructions in the grammar and their functional properties in discourse. The volume reveals that: Bridging constructions consist of two clauses: a reference clause and a bridging clause. Across languages, bridging clauses can be subordinated clauses, reduced main clauses, or main clauses with continuation prosody. Bridging constructions have three variants: recapitulative linkage, summary linkage and mixed linkage. They differ in the formal makeup of the bridging clause. In discourse, the functions that bridging constructions fulfil depend on the text genres in which they appear and their position in the text. If a language uses more than one type of bridging construction, then each type has a distinct discourse function. Bridging constructions can be optional and purely stylistic or mandatory and serve a grammatical purpose. Although the difference between bridging constructions and clause repetition can be subtle, they maintain their own distinctive characteristics