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

Blades manufactured through flank and point milling will likely exhibit geometric variability. Gauging the aerodynamic repercussions of such variability, prior to manufacturing a component, is challenging enough, let alone trying to predict what the amplified impact of any in-service degradation will be. While rules of thumb that govern the tolerance band can be devised based on expected boundary layer characteristics at known regions and levels of degradation, it remains a challenge to translate these insights into quantitative bounds for manufacturing. In this work, we tackle this challenge by leveraging ideas from dimension reduction to construct low-dimensional representations of aerodynamic performance metrics. These low-dimensional models can identify a subspace which contains designs that are invariant in performance -- the inactive subspace. By sampling within this subspace, we design techniques for drafting manufacturing tolerances and for quantifying whether a scanned component should be used or scrapped. We introduce the blade envelope as a computational manufacturing guide for a blade that is also amenable to qualitative visualizations. In this paper, the first of two parts, we discuss its underlying concept and detail its computational methodology, assuming one is interested only in the single objective of ensuring that the loss of all manufactured blades remains constant. To demonstrate the utility of our ideas we devise a series of computational experiments with the Von Karman Institute's LS89 turbine blade.

We propose two-stage and sequential procedures to construct prescribed proportional closeness confidence intervals for the unknown parameter N of a binomial distribution with unknown parameter p, when we reinforce data with an independent sample of a negative-binomial experiment having the same p

In this work, we use a tempering-based adaptive particle filter to infer from a partially observed stochastic rotating shallow water (SRSW) model which has been derived using the Stochastic Advection by Lie Transport (SALT) approach. The methodology we present here validates the applicability of tempering and sample regeneration via a Metropolis-Hastings algorithm to high-dimensional models used in stochastic fluid dynamics. The methodology is first tested on the Lorenz '63 model with both full and partial observations. Then we discuss the efficiency of the particle filter the SALT-SRSW model.

String vibration represents an active field of research in acoustics. Small-amplitude vibration is often assumed, leading to simplified physical models that can be simulated efficiently. However, the inclusion of nonlinear phenomena due to larger string stretchings is necessary to capture important features, and efficient numerical algorithms are currently lacking in this context. Of the available techniques, many lead to schemes which may only be solved iteratively, resulting in high computational cost, and the additional concerns of existence and uniqueness of solutions. Slow and fast waves are present concurrently in the transverse and longitudinal directions of motion, adding further complications concerning numerical dispersion. This work presents a linearly-implicit scheme for the simulation of the geometrically exact nonlinear string model. The scheme conserves a numerical energy, expressed as the sum of quadratic terms only, and including an auxiliary state variable yielding the nonlinear effects. This scheme allows to treat the transverse and longitudinal waves separately, using a mixed finite difference/modal scheme for the two directions of motion, thus allowing to accurately resolve the wave speeds at reference sample rates. Numerical experiments are presented throughout.

Trimming consists of cutting away parts of a geometric domain, without reconstructing a global parametrization (meshing). It is a widely used operation in computer aided design, which generates meshes that are unfitted with the described physical object. This paper develops an adaptive mesh refinement strategy on trimmed geometries in the context of hierarchical B-spline based isogeometric analysis. A residual a posteriori estimator of the energy norm of the numerical approximation error is derived, in the context of Poisson equation. The reliability of the estimator is proven, and the effectivity index is shown to be independent from the number of hierarchical levels and from the way the trimmed boundaries cut the underlying mesh. In particular, it is thus independent from the size of the active part of the trimmed mesh elements. Numerical experiments are performed to validate the presented theory.

A unified construction of div-conforming finite element tensors, including vector div element, symmetric div matrix element, traceless div matrix element, and in general tensors with constraints, is developed in this work. It is based on the geometric decomposition of Lagrange elements into bubble functions on each sub-simplex. Then the tensor at each sub-simplex is decomposed into the tangential and the normal component. The tangential component forms the bubble function space and the normal component characterizes the trace. A deep exploration on boundary degrees of freedom is presented for discovering various finite elements. The developed finite element spaces are div conforming and satisfy the discrete inf-sup condition. An explicit basis of the constraint tensor space is also established.

This paper presents a novel methodology for fast simulation and analysis of transient heat transfer. The proposed methodology is suitable for real-time applications owing to (i) establishing the solution method from the viewpoint of computationally efficient explicit dynamics, (ii) proposing an element-level thermal load computation to eliminate the need for assembling global thermal stiffness, leading to (iii) an explicit formulation of nodal temperature computation to eliminate the need for iterations anywhere in the algorithm, (iv) pre-computing the constant matrices and simulation parameters to facilitate online calculation, and (v) utilising computationally efficient finite elements to efficiently obtain thermal responses in the spatial domain, all of which lead to a significant reduction in computation time for fast run-time simulation. The proposed fast explicit dynamics finite element algorithm (FED-FEM) employs nonlinear thermal material properties, such as temperature-dependent thermal conductivity and specific heat capacity, and nonlinear thermal boundary conditions, such as heat convection and radiation, to account for nonlinear characteristics of transient heat transfer. Simulations and comparison analyses demonstrate that not only can the proposed methodology handle isotropic, orthotropic, anisotropic and temperature-dependent thermal properties but also satisfy the standard patch tests and achieve good agreement with those of the commercial finite element analysis packages for numerical accuracy, for 3-D heat conduction, convection, radiation, and thermal gradient concentration problems. Furthermore, the proposed FED-FEM algorithm is computationally efficient and only consumes a small computation time, capable of achieving real-time computational performance, leading to a novel methodology suitable for real-time simulation and analysis of transient heat transfer.

We propose a new method of estimation in topic models, that is not a variation on the existing simplex finding algorithms, and that estimates the number of topics K from the observed data. We derive new finite sample minimax lower bounds for the estimation of A, as well as new upper bounds for our proposed estimator. We describe the scenarios where our estimator is minimax adaptive. Our finite sample analysis is valid for any number of documents (n), individual document length (N_i), dictionary size (p) and number of topics (K), and both p and K are allowed to increase with n, a situation not handled well by previous analyses. We complement our theoretical results with a detailed simulation study. We illustrate that the new algorithm is faster and more accurate than the current ones, although we start out with a computational and theoretical disadvantage of not knowing the correct number of topics K, while we provide the competing methods with the correct value in our simulations.

In this work, we present a method for tracking and learning the dynamics of all objects in a large scale robot environment. A mobile robot patrols the environment and visits the different locations one by one. Movable objects are discovered by change detection, and tracked throughout the robot deployment. For tracking, we extend the Rao-Blackwellized particle filter of previous work with birth and death processes, enabling the method to handle an arbitrary number of objects. Target births and associations are sampled using Gibbs sampling. The parameters of the system are then learnt using the Expectation Maximization algorithm in an unsupervised fashion. The system therefore enables learning of the dynamics of one particular environment, and of its objects. The algorithm is evaluated on data collected autonomously by a mobile robot in an office environment during a real-world deployment. We show that the algorithm automatically identifies and tracks the moving objects within 3D maps and infers plausible dynamics models, significantly decreasing the modeling bias of our previous work. The proposed method represents an improvement over previous methods for environment dynamics learning as it allows for learning of fine grained processes.