亚洲男人的天堂2018av,欧美草比,久久久久久免费视频精选,国色天香在线看免费,久久久久亚洲av成人片仓井空

We propose some extensions to semi-parametric models based on Bayesian additive regression trees (BART). In the semi-parametric BART paradigm, the response variable is approximated by a linear predictor and a BART model, where the linear component is responsible for estimating the main effects and BART accounts for non-specified interactions and non-linearities. Previous semi-parametric models based on BART have assumed that the set of covariates in the linear predictor and the BART model are mutually exclusive in an attempt to avoid poor coverage properties and reduce bias in the estimates of the parameters in the linear predictor. The main novelty in our approach lies in the way we change the tree-generation moves in BART to deal with this bias and resolve non-identifiability issues between the parametric and non-parametric components, even when they have covariates in common. This allows us to model complex interactions involving the covariates of primary interest, both among themselves and with those in the BART component. Our novel method is developed with a view to analysing data from an international education assessment, where certain predictors of students' achievements in mathematics are of particular interpretational interest. Through additional simulation studies and another application to a well-known benchmark dataset, we also show competitive performance when compared to regression models, alternative formulations of semi-parametric BART, and other tree-based methods. The implementation of the proposed method is available at \url{//github.com/ebprado/CSP-BART}.

We derive bounds on the moduli of eigenvalues of certain special type of rational matrices, using the following techniques/methods: (1) an upper bound is obtained using the Bauer-Fike theorem on an associated block matrix of the given rational matrix, (2) a lower bound is obtained by associating a real rational function, along with Rouch$\text{\'e}$'s theorem for the rational matrix and (3) an upper bound is also obtained using a numerical radius inequality for a block matrix for the rational matrix. These bounds are compared when the coefficients are unitary matrices. Numerical examples are given to illustrate the results obtained.

Image Edge detection (ED) is a base task in computer vision. While the performance of the ED algorithm has been improved greatly by introducing CNN-based models, current models still suffer from unsatisfactory precision rates especially when only a low error toleration distance is allowed. Therefore, model architecture for more precise predictions still needs an investigation. On the other hand, the unavoidable noise training data provided by humans would lead to unsatisfactory model predictions even when inputs are edge maps themselves, which also needs improvement. In this paper, more precise ED models are presented with cascaded skipping density blocks (CSDB). Our models obtain state-of-the-art(SOTA) predictions in several datasets, especially in average precision rate (AP), which is confirmed by extensive experiments. Moreover, our models do not include down-sample operations, demonstrating those widely believed operations are not necessary. Also, a novel modification on data augmentation for training is employed, which allows noiseless data to be employed in model training and thus improves the performance of models predicting on edge maps themselves.

In this paper, a third-order time adaptive algorithm with less computation, low complexity is provided for shale reservoir model based on coupled fluid flow with porous media flow. The algorithm combines the three-step linear time filters method for simple post-processing and the second-order backward differential formula (BDF2), is third-order accurate and provides, at no extra computational complexity. At the same time, the time filter method can also be used to damp non-physical oscillations inherent in the BDF2 method, ensuring stability. We proves the variable time stepsize second-order backward differential formula plus time filter (BDF2-TF) algorithm's stability and the convergence properties of the fluid velocity u and hydraulic head $\phi$ in the $L^2$ norm with an order of $O(k_{n+1}^3 + h^3)$. In the experiments, the adaptive algorithm automatically adjusts the time step in response to the varying characteristics of different models, ensuring that errors are maintained within acceptable limits. This algorithm addresses the issue that high-order algorithms may select inappropriate time steps, resulting in instability or reduced precision of the numerical solution, thereby enhancing calculation accuracy and efficiency. We perform three-dimensional numerical experiments to verify the BDF2-TF algorithm's effectiveness, stability, and third-order convergence. Simultaneously, a simplified model is employed to simulate the process of shale oil extraction from reservoirs, further demonstrating the algorithm's practical applicability.

The aim of this paper is to present three construction methods for quasi-copulas based on recent developments: a representation of multivariate quasi-copulas by means of infima and suprema of copulas, an extension of a classical result on shuffles of min to the setting of quasi-copulas, and a construction method for quasi-copulas obeying a given signed mass pattern on a patch.

Graph cuts are among the most prominent tools for clustering and classification analysis. While intensively studied from geometric and algorithmic perspectives, graph cut-based statistical inference still remains elusive to a certain extent. Distributional limits are fundamental in understanding and designing such statistical procedures on randomly sampled data. We provide explicit limiting distributions for balanced graph cuts in general on a fixed but arbitrary discretization. In particular, we show that Minimum Cut, Ratio Cut and Normalized Cut behave asymptotically as the minimum of Gaussians as sample size increases. Interestingly, our results reveal a dichotomy for Cheeger Cut: The limiting distribution of the optimal objective value is the minimum of Gaussians only when the optimal partition yields two sets of unequal volumes, while otherwise the limiting distribution is the minimum of a random mixture of Gaussians. Further, we show the bootstrap consistency for all types of graph cuts by utilizing the directional differentiability of cut functionals. We validate these theoretical findings by Monte Carlo experiments, and examine differences between the cuts and the dependency on the underlying distribution. Additionally, we expand our theoretical findings to the Xist algorithm, a computational surrogate of graph cuts recently proposed in Suchan, Li and Munk (arXiv, 2023), thus demonstrating the practical applicability of our findings e.g. in statistical tests.

Rational approximation has proven to be a powerful method for solving two-dimensional (2D) fluid problems. At small Reynolds numbers, 2D Stokes flows can be represented by two analytic functions, known as Goursat functions. Xue, Waters and Trefethen [SIAM J. Sci. Comput., 46 (2024), pp. A1214-A1234] recently introduced the LARS algorithm (Lightning-AAA Rational Stokes) for computing 2D Stokes flows in general domains by approximating the Goursat functions using rational functions. In this paper, we introduce a new algorithm for computing 2D Stokes flows in periodic channels using trigonometric rational functions, with poles placed via the AAA-LS algorithm [Costa and Trefethen, European Congr. Math., 2023] in a conformal map of the domain boundary. We apply the algorithm to Poiseuille and Couette problems between various periodic channel geometries, where solutions are computed to at least 6-digit accuracy in less than 1 second. The applicability of the algorithm is highlighted in the computation of the dynamics of fluid particles in unsteady Couette flows.

This paper considers the numerical solution of Timoshenko beam network models, comprised of Timoshenko beam equations on each edge of the network, which are coupled at the nodes of the network using rigid joint conditions. Through hybridization, we can equivalently reformulate the problem as a symmetric positive definite system of linear equations posed on the network nodes. This is possible since the nodes, where the beam equations are coupled, are zero-dimensional objects. To discretize the beam network model, we propose a hybridizable discontinuous Galerkin method that can achieve arbitrary orders of convergence under mesh refinement without increasing the size of the global system matrix. As a preconditioner for the typically very poorly conditioned global system matrix, we employ a two-level overlapping additive Schwarz method. We prove uniform convergence of the corresponding preconditioned conjugate gradient method under appropriate connectivity assumptions on the network. Numerical experiments support the theoretical findings of this work.

Temporal imaging of biological epithelial structures yields shape data at discrete time points, leading to a natural question: how can we reconstruct the most likely path of growth patterns consistent with these discrete observations? We present a physically plausible framework to solve this inverse problem by creating a framework that generalises quasiconformal maps to quasiconformal flows. By allowing for the spatio-temporal variation of the shear and dilatation fields during the growth process, subject to regulatory mechanisms, we are led to a type of generalised Ricci flow. When guided by observational data associated with surface shape as a function of time, this leads to a constrained optimization problem. Deploying our data-driven algorithmic approach to the shape of insect wings, leaves and even sculpted faces, we show how optimal quasiconformal flows allow us to characterise the morphogenesis of a range of surfaces.

This paper develops a novel Bayesian approach for nonlinear regression with symmetric matrix predictors, often used to encode connectivity of different nodes. Unlike methods that vectorize matrices as predictors that result in a large number of model parameters and unstable estimation, we propose a Bayesian multi-index regression method, resulting in a projection-pursuit-type estimator that leverages the structure of matrix-valued predictors. We establish the model identifiability conditions and impose a sparsity-inducing prior on the projection directions for sparse sampling to prevent overfitting and enhance interpretability of the parameter estimates. Posterior inference is conducted through Bayesian backfitting. The performance of the proposed method is evaluated through simulation studies and a case study investigating the relationship between brain connectivity features and cognitive scores.