A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. There is a well-known method, which we call the K-construction, for building a 1-factorization of Kn;n from a 1-factorization of Knþ1. The 1-factorization of Kn;n can be written as a latin square of order n. The K-construction has been used, among other things, to make perfect 1-factorizations, su...

Equivalent fields are frequently used for central axis depth-dose calculations of rectangular and irregular shaped photon beam. Since most of the proposed models to calculate the equivalent square field, are dosimetry-based, a simple physical-based method to calculate the equivalent square field size was used as the basis of this study. The table of the sides of the equivalent square for rectan...

An unknown m by n matrix X0 is to be estimated from noisy measurements Y = X0 + Z, where the noise matrix Z has i.i.d Gaussian entries. A popular matrix denoising scheme solves the nuclear norm penalization problem minX‖Y − X‖F /2 + λ‖X‖∗, where ‖X‖∗ denotes the nuclear norm (sum of singular values). This is the analog, for matrices, of `1 penalization in the vector case. It has been empiricall...

A compact cross, circular and square shaped slotted microstrip patch antennas are designed for circularly polarized (CP) radiation. The designed antenna is fabricated on RO4003C substrate and measured using Agilent network analyzer. The simulated return loss of this proposed antenna is less than -16dB at 920MHz with a bandwidth of 3MHz which is most suitable for RFID application. The circular p...

We construct a Lipschitz-free space that is locally almost square but not weakly square; this the first example of such Banach space. also prove result, which indicates geodesic metric spaces are potential characterization for spaces. Lastly, we can have symmetric strong diameter 2 property.

We give closed-form formulas for the fundamental classes of degeneracy loci associated with vector bundle maps given locally by (not necessary square) matrices which are symmetric (resp. skew-symmetric) w.r.t. the main diagonal. Our description uses essentially Schur Q-polynomials of a bundle and is based on a push-forward formula for these polynomials in a Grassmann bundle, established in [P4]...

We present efficient implement at ions of the balanceand-truncate model reduction technique for large-scale systems. The key observation that distinguishes our approach is that Krylov subspace methods (Arnoldi and Lanczos) directly yield approximate low-rank square roots1 of the system Gramians; the balancing transformation can be then constructed from these square roots, obviating the need for...

Time-delayed systems are known to exhibit symmetric square waves oscillating with a period close to twice the delay. Here, we show that strongly asymmetric square waves of a period close to one delay are possible. The plateau lengths can be tuned by changing a control parameter. The problem is investigated experimentally and numerically using a simple bandpass optoelectronic delay oscillator mo...

Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select implementations (nS-Root) based on a non-restoring-remainder square root algorithm. The nSRoot uses a parallel array of carry-save adders (CSAs). For a square root bit calculation, a CSA is used once. This means that the c...

In a previous article [20], we derived the alternating-sign matrix (ASM) theorem from the Izergin determinant [12, 17] for a partition function for square ice with domain wall boundary. Here we show that the same argument enumerates three other symmetry classes of alternating-sign matrices: VSASMs (vertically symmetric ASMs), even HTSASMs (half-turn-symmetric ASMs), and even QTSASMs (quartertur...