Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent levels of abstraction. In this paper we show how a non-restoring integer square root algorithm can be transformed to a very e cient hardware implementation. The top level is a Standard ML function that operates on unbounded integers. The bottom level is a structur...

In this paper, a high gain, low side lobe level Fabry Perot Cavity antenna with feed patch array is proposed. The antenna structure consists of a microstrip antenna array, which is parasitically coupled with an array of square parasitic patches fabricated on a FR4 superstrate. The patches are fabricated at the bottom of superstrate and suspended in air with the help of dielectric rods at 0.5λ0 ...

We study perfect matchings on the contracting square-hexagon lattice, constructed row by either from a of square grid or hexagonal lattice. Given 1×n periodic weights to edges, we consider probabilities dimers proportional product edge weights. show that partition function equals Schur then prove Law Large Numbers (limit shape) and Central Limit Theorem (convergence Gaussian free field) for cor...

In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...

Abstract   Due to restrictions on the choice of relaxation time in single relaxation time (SRT) models, simulation of flows is generally limited base on this method. In this paper, the SRT lattice Boltzmann equation was used to simulate lid driven cavity flow at different Reynolds numbers (100-5000) and three aspect ratios, K=1, 1.5 and 4. The point which is vital in convergence of this scheme ...