The purpose of this study was to determine the total resistance and investigate flow around a full-scale kayak. Utilizing Computational Fluid Dynamics(CFD), it deter-mined how presence rudder affects kayak hydrodynamic performance. To an-alyse flow, computational fluid dynamics based on RANS-VOF solver em-ployed. volume approach k-ω turbulence model were used in two-phase steady simulations hul...

An important objective of health monitoring systems for tall buildings is to diagnose the state of the building and to evaluate its possible damage. In this paper, we use our prototype to evaluate our data-mining approach for the fault monitoring. The offset cancellation and high-pass filtering techniques are combined effectively to solve common problems in numerical integration of acceleration...

We extend the Shepard-Bernoulli operators introduced in [1] to the bivariate case. These new interpolation operators are realized by using local support basis functions introduced in [2] instead of classical Shepard basis functions and the bivariate three point extension [3] of the generalized Taylor polynomial introduced by F. Costabile in [4]. The new operators do not require either the use o...

We study a standard method of regularization by projections of the linear inverse problem Y = Af + ǫ, where ǫ is a white Gaussian noise, and A is a known compact operator with singular values converging to zero with polynomial decay. The unknown function f is recovered by a projection method using the singular value decomposition of A. The bandwidth choice of this projection regularization is g...

We consider the question of finding deep cuts from a model with two rows of the type PI = {(x, s) ∈ Z×R+ : x = f + Rs}. To do that, we show how to reduce the complexity of setting up the polar of conv(PI) from a quadratic number of integer hull computations to a linear number of integer hull computations. Furthermore, we present an algorithm that avoids computing all integer hulls. A polynomial...

Given a monomial k[x1, . . . , xn]-module M in the Laurent polynomial ring k[x ±1 1 , . . . , x ±1 n ], the hull complex is defined to be the set of bounded faces of the convex hull of the points {t | x ∈ M} for sufficiently large t. Bayer and Sturmfels [2] conjectured that the faces of this polyhedron are of bounded complexity in the sense that every such face is affinely isomorphic to a subpo...

For any n×n matrix A , we use the joint higher rank numerical range, Λk(A, . . . ,Am) , to define the higher rank numerical hull of A . We characterize the higher rank numerical hulls of Hermitian matrices. Also, the higher rank numerical hulls of unitary matrices are studied. Mathematics subject classification (2010): 15A60,81P68.

In this paper, we consider symmetric binary programs that contain set packing, partitioning, or covering (ppc) inequalities. To handle symmetries as well as ppc-constraints simultaneously, we introduce constrained symresacks which are the convex hull of all binary points that are lexicographically not smaller than their image w.r.t. a coordinate permutation and which fulfill some ppc-constraint...

In this paper, we develop two piecewise polynomial methods for the numerical evaluation of Cauchy Principal Value integrals of oscillatory kind. The two piecewisepolynomial quadratures are compact, easy to implement, and are numerically stable. Two numerical examples are presented to illustrate the two rules developed, The convergence of the two schemes is proved and some error bounds obtai...

Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some n...