This paper introduces a refined evaluation function, called Φ, for the Minimum Linear Arrangement problem (MinLA). Compared with the classical evaluation function (LA), Φ integrates additional information contained in an arrangement to distinguish arrangements with the same LA value. The main characteristics of Φ are analyzed and its practical usefulness is assessed within both a Steepest Desce...

In the title compound, [Ag(C(16)H(10.5)NO(2))(2)], the Ag(I) cation (site symmetry 2) is coordinated by two N atoms in a near-linear AgN(2) arrangement. Two carboxyl-ate O atoms from two additional 2-phenyl-quinoline-4-carboxyl-ate ligands form long Ag-O bonds [2.6585 (17) Å], resulting in a distorted square-planar arrangement. The bridging ligands result in infinite corrugated sheets propagati...

We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axisaligned squares in R while preserving its structure. We found a counterexample to the conjecture of J. Klawitter, M. Nöllenburg and T. Ueckerdt whether all arrangements without crossing and side-piercing can be squared. Our counterexample also works in a more general case when we only need to p...

The vanishing ideal I of a subspace arrangement V 1 ∪ V 2 ∪ · · · ∪ V m ⊆ V is an intersection I 1 ∩ I 2 ∩ · · · ∩ I m of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of the product ideal J = I 1 I 2 · · · I m without any assumptions on the subspace arrangement. It turns out that the Hilbert s...

The channel estimation techniques for OFDM systems based on pilot arrangement are investigated. The channel estimation based on comb type pilot arrangement is studied through different algorithms for both estimating channel at pilot frequencies and interpolating the channel. The estimation of channel at pilot frequencies is based on LS and LMS while the channel interpolation is done using linea...

There are many researches about the methods to generate free viewpoint image in linear camera arrangement, but it is rare in circular camera arrangement. In this paper, we propose a novel method to generate free viewpoint image for FTV in circular camera arrangement. This method is based on the Ray-Space method, which is one of the Image Based Rendering (IBR) techniques. We can generate arbitra...

We produce a one-parameter family of hyperplane arrangements that are counterexamples to the conjecture of Saito that the complexified complement of a free arrangement is K(π , 1) . These arrangements are the restriction of a one-parameter family of arrangements that arose in the study of tilings of certain centrally symmetric octagons. This other family is discussed as well. I. Definitions and...

In this paper we present a slightly modified definition of snap rounding, and provide two efficient algorithms that perform this rounding. The first algorithm takes n line segments as input and generates the set of snapped segments in O(|I| + Σc is(c) log n + |I∗ m|), where |I| is the complexity of the unrounded arrangement I, is(c) is the number of segments that have an intersection or endpoin...