نتایج جستجو برای: taxicab geometry

تعداد نتایج: 144726  

2008
Moshe Malkin Thomas Magesacher John M. Cioffi

The high Peak-to-Average-Power ratio (PAR) of Orthogonal Frequency Division Multiplexing (OFDM) transmission systems has become a significant issue in the design of modern multicarrier systems. One of the earliest and most popular techniques is tone reservation [1], where a set of unused tones (or specially reserved-tones) are exploited to generate time-domain signals to reduce the signal peaks...

1996
Michael Braverman Gennady Samorodnitsky

17 Remark 2 We cannot characterize so far all L evy processes for which Theorem 3.2 holds. However, the present argument given for that theorem easily shows that its statement holds when, say, + is equivalent to the tail of a distribution in S(), and 0 is of a smaller order. Then, in particular, lim x!1 P R T 0 jX(t)jdt > x A + () T ~ + (x=T) = T : (3:30) The case when 0 is equivalent to the ta...

Journal: :Eur. J. Comb. 1999
Arkady A. Chernyak

The aim of this paper is to unify interchange theorems and extend them to hypergraphs. To this end sufficient conditions for equality of the l1-distance between equivalence classes and the l1-distance between corresponding order-type functions are provided. The generality of this result is demonstrated by a number of new corollaries concerning the factorization and the switching completeness of...

Journal: :CoRR 2016
Eleonesio Strey Sueli I. Rodrigues Costa

Lattices have been used in several problems in coding theory and cryptography. In this paper we approach q-ary lattices obtained via Constructions D, D′ and D. It is shown connections between Constructions D and D′. Bounds for the minimum l1-distance of lattices ΛD, ΛD′ and ΛD and, under certain conditions, a generator matrix for ΛD′ are presented. In addition, when the chain of codes used is c...

2013
Abla Kammoun

It was shown in a previous work that some blind methods can be made robust to channel order overmodeling by using the l1 or lp quasi-norms. However, no theoretical argument has been provided to support this statement. In this work, we study the robustness of subspace blind based methods using l1 or lp quasi-norms. For the l1 norm, we provide the sufficient and necessary condition that the chann...

1997
Li Qiu Tongwen Chen

For a general multirate SD (sampled-data) system, we characterize explicitly the set of all causal, stabilizing controllers that achieve a certain H 1 norm bound; moreover, we give explicitly a particular controller that further minimizes an entropy function for the SD system. The characterization lays the groundwork for synthesizing multirate control systems with multiple/mixed control speciic...

2005
Charles L. Epstein Jeremy Magland

In the hard pulse approximation, commonly used in nuclear magnetic resonance, one considers potentials for the AKNS system that are sums of δ-functions. The system of differential equations does not, strictly speaking make sense for such potentials. In [8] an analogous discrete forward and inverse problem are analyzed. We review these results and show that pulses obtained using the inverse scat...

2012
Ioannis P. Papikas Ioannis Refanidis

This paper presents a method for fast planning within arbitrary maps, through segmentation of the map into Manhattan-cohesive areas. A Manhattan-cohesive area is a connected part of the map where the optimal distance between any two points in the area is equal to their Manhattan distance. We adopt a four directions Manhattan distance, where diagonal moves are allowed. In the paper we present th...

2013

A normed vector space is a real or complex vector space in which a norm has been defined. Formally, one says that a normed vector space is a pair (V, ∥ · ∥) where V is a vector space over K and ∥ · ∥ is a norm in V , but then one usually uses the usual abuse of language and refers to V as being the normed space. Sometimes (frequently?) one has to consider more than one norm at the same time; th...

2014
Alberto Vega Juan Aguarón Jorge García-Alcaraz José María Moreno-Jiménez

TOPSIS is a multicriteria decision making technique based on the minimization of geometric distances that allows the ordering of compared alternatives in accordance with their distances from the ideal and anti-ideal solutions. The technique, that usually measures distances in the Euclidean norm, implicitly supposes that the contemplated attributes are independent. However, as this rarely occurs...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید