In this paper, we analyze the performance of transmitter identification (TxID) technique for advanced television system committee digital television (ATSC DTV) signals. In the ATSC DTV systems, signals are transmitted through the multiple frequency network (MFN) so that the frequency resource is used inefficiently. The TxID technique is employed to implement the single frequency network (SFN) w...

We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by Van den Nest, Dür, and Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurementbased quantum comp...

This paper presents a patch-based image filtering algorithm for additive noise reduction. Our algorithm is a modification to the block matching 3D algorithm, where an adaptive thresholding was used for the collaborative hardthresholding step. The collaborative Wiener filtering step was also modified by assigning more weights for similar patches. Experimental results show that our algorithm outp...

A double-loop digraph G=G(N ; s1; s2), with gcd(N; s1; s2)=1, has the set of vertices V =ZN and the adjacencies are given by u → u + si (mod N ) i = 1; 2. The diameter of G, denoted by D(N ; s1; s2), is known to be lower bounded by lb(N ) with D(N ) = min 16s1¡s2¡N; gcd(N;s1 ; s2)=1 D(N ; s1; s2)¿ ⌈√ 3N ⌉ − 2 = lb(N ): This lower bound is known to be sharp. For a 0xed N ∈N, some algorithms to 0...

For many least-squares decomposition models efficient algorithms are well known. A more difficult problem arises in decomposition models where each residual is weighted by a nonnegative value. A special case is principal components analysis with missing data. Kiers (1997) discusses an algorithm for minimizing weighted decomposition models by iterative majorization. In this paper, we propose a m...

In this paper a novel distributed algorithm for blind macro-calibration in sensor networks based on consensus is proposed. The algorithm is formulated as a set of gradient-type recursions for estimating parameters of sensor calibration functions, starting from local criteria defined as weighted sums of mean square differences between the outputs of neighboring sensors. It is proved that the alg...

Let G be an unweighted, undirected graph. An additive k-spanner of G is a subgraph H that approximates all distances between pairs of nodes up to an additive error of +k, that is, it satisfies dH(u, v) ≤ dG(u, v) + k for all nodes u, v, where d is the shortest path distance. We give a deterministic algorithm that constructs an additive O(1)-spanner with O ( n4/3 ) edges in O ( n2 ) time. This s...

Random regression models (RRM) have become common for the analysis of longitudinal data or repeated records on individual over time. The goal of this paper was to explore the use of random regression models with orthogonal / Legendre polynomials (RRL) to analyze new repeated measures called clutch size (CS) as a meristic trait for Iranian native fowl. Legendre polynomial functions of increasing...

We design an algorithm for computing the generalized (algebraic circuits with root extracting, cf. P 81], J 81], GSY 93]) additive complexity of any rational function. It is the rst computability result of this sort on the additive complexity of algebraic circuits.

Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a network bargaining game with a balanced solution. A graph with weighted edges is called stable if the maximum weight of an integral matching equals the cost of a ...