Unsteady micropolar fluid flow in a thin domain with Tresca fluid–solid interface law

We consider a micropolar fluid flow in a two-dimensional domain. We assume that the velocity field satisfies a non-linear slip boundary condition of friction type on a part of the boundary while the micro-rotation field satisfies non-homogeneous Dirichlet boundary conditions. We prove the existence and uniqueness of a solution. Then motivated by lubrication problems we assume that the thickness and the roughness of the domain are of order $0<\epsilon <<1$ and we study the asymptotic behaviour of the flow as $\epsilon$ tends to zero. By using the two-scale convergence technique we derive the limit problem which is totally decoupled for the limit velocity and pressure $(v^0,p^0)$ on one hand and the limit micro-rotation $Z^0$ on the other hand. Moreover we prove that $v^0$, $p^0$ and $Z^0$ are uniquely determined via auxiliary well-posed problems.     

Quasi gradient-based inversion-free iterative algorithm for solving a class of the nonlinear matrix equations

Inspired by the gradient-based and inversion-free iterations, a new quasi gradient-based inversion-free iterative algorithm is proposed for solving the nonlinear matrix equation $X+A^{\mathrm{T}}{X}^{?n}A=I$. The convergence proof of the suggested algorithm is given. Several matrix norm inequalities are established to depict the convergence properties of this algorithm. Three numerical examples are given to illustrate the effectiveness of the suggested algorithms.     

Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication

In a distributed computing environment, the schedule by which tasks are assigned to processors is critical to minimizing the overall run-time of the application. However, the problem of discovering the schedule that gives the minimum finish time is NP-Complete. This paper addresses static scheduling of a directed a-cyclic task graph (DAG) on a heterogeneous, bounded set of distributed processors to minimize the makespan. By combining several innovative techniques, including insertion-based scheduling and multiple task duplication, we present a new heuristic, known as Heterogeneous N-predecessor Decisive Path (HNDP), for scheduling directed a-cyclic weighted task graphs (DAGs) on a set of heterogeneous processors. We compare the performance of HNDP, under a range of varying input conditions, with two of the best existing heterogeneous heuristics namely HEFT and STDS. The results presented in this paper show that HNDP outperforms the two heuristics in terms of finish time and the number of processors employed over a wide range of parameters. The complexity of HNPD is $O(v^{2.}p)$ vs. $O(v^{2.}p)$ of HEFT and $O(v^2)$ of STDS where $v$ is the number of nodes in the DAG.     

Effect of Porosity on free and forced vibration characteristics of the GPL reinforcement composite nanostructures

This article investigates the influence of porosity on free and forced vibration characteristics of a nanoshell reinforced by graphene platelets (GPL). The material properties of piece-wise graphene-reinforced composites (GPLRCs) are assumed to be graded in the thickness direction of a cylindrical nanoshell and estimated using a nanomechanical model. In addition, because of imperfection of the current structure, three kinds of porosity distributions are considered. The nanostructure is modeled using modified strain gradient theory (MSGT) which is a size-dependent theory with three length scale parameters. The novelty of the current study is to consider the effects of porosity, GPLRC and MSGT on dynamic and static behaviors of the nanostructure. Considering three length scale parameters ( $l_0=5h$, $l_1=3h$, $l_2=5h$ ) in MSGT leads to a better agreement with MD simulation in comparison by other theories. Finally, effects of different factors on static and dynamic behaviors of the porous nanostructure are examined in detail.     

An efficient NFEM for optimal control problems governed by a bilinear state equation

In this paper, a nonconforming finite element method (NFEM) is proposed for the constrained optimal control problems (OCPs) governed by a bilinear state equation. The state and adjoint state are approximated by the nonconforming $E{Q}_1^{rot}$ element, and the control is approximated by the orthogonal projection through the state and adjoint state. Some superclose and superconvergence properties are obtained by full use of the distinguish characters of this $E{Q}_1^{rot}$ element, such as the interpolation operator equals the Ritz projection, and the consistency error is one order higher than its interpolation error in the broken energy norm. Finally, some numerical results are provided to verify the theoretical analysis.     

Exact and approximate construction of offset polygons

The Minkowski sum of two sets $A,B\in {\mathbb{R}}^2$, denoted $A\oplus B$, is defined as $\{a+b\mid a\in A,b\in B\}$. We describe an efficient and robust implementation of the construction of the Minkowski sum of a polygon in ${\mathbb{R}}^2$ with a disc, an operation known as offsetting the polygon. Our software package includes a procedure for computing the exact offset of a straight-edge polygon, based on the arrangement of conic arcs computed using exact algebraic number-types. We also present a conservative approximation algorithm for offset computation that uses only rational arithmetic and decreases the running times by an order of magnitude in some cases, while having a guarantee on the quality of the result. The package will be included in the next public release of the Computational Geometry Algorithms Library, Cgal Version 3.3. It also integrates well with other Cgal packages; in particular, it is possible to perform regularized Boolean set-operations on the polygons the offset procedures generate.     

Invariant and dual subtraction games resolving the Duchêne–Rigo conjecture

We prove a recent conjecture of Duchêne and Rigo, stating that every complementary pair of homogeneous Beatty sequences represents the solution to an invariant impartial game. Here invariance means that each available move in a game can be played anywhere inside the game board. In fact, we establish such a result for a wider class of pairs of complementary sequences, and in the process generalize the notion of a subtraction game. Given a pair of complementary sequences $\left(a_n\right)$ and $\left(b_n\right)$ of positive integers, we define a game $G$ by setting $\left\{\{a_n,b_n\}\right\}$ as invariant moves. We then introduce the invariant game $G^{?}$, whose moves are all non-zero $P$-positions of $G$. Provided the set of non-zero $P$-positions of $G^{?}$ equals $\left\{\{a_n,b_n\}\right\}$, this is the desired invariant game. We give sufficient conditions on the initial pair of sequences for this ‘duality’ to hold.     

Note on nonparametric spectral analysis of wideband spectrum with missing data via sample-and-hold interpolation and deconvolution

In [1] a procedure for bias-free estimation of the autocorrelation function is introduced for equidistantly sampled data with randomly occurring samples being invalid. The method incorporates sample-and-hold interpolation of the missing data points. The occurring dynamic error of the primary estimate of the correlation function is treated by a deconvolution procedure with two parameters $c_0$ and $c_1$ with $c_0+2c_1=1$, which are the on-diagonal and the aside-diagonal parameters of a specific correction matrix (at all lag times except zero). The parameters $c_0$ and $c_1$ were obtained as a function of the probability α of a sample to be valid by numerical simulation. However, explicit expressions for the parameters $c_0(\alpha )=1-\frac{2}{\alpha }+\frac{2}{{\alpha }^2}$ and $c_1(\alpha )=\frac{1}{\alpha }-\frac{1}{{\alpha }^2}$ can be derived, which might improve the usability of the deconvolution procedure in [1].