International Telemetering Conference Proceedings / October 21, 2002 / Town & Country Hotel and Conference Center, San Diego, California / As frequency allocation restrictions are tightening, and data rates are increasing, it is becoming necessary to incorporate higher order modulation techniques to make more efficient use of available spectrum. When used with Square Root Raised Cosine filtering, 8-ary Phase Shift Keyed modulation is a spectrally efficient technique that makes better use of today’s RF spectrum in comparison to standard formats. This paper will discuss 8-ary PSK modulation and its spectral efficiency with a SRRC filter, along with comparisons to BPSK, QPSK, and FSK.

Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into subgraph structures whose identification may be useful in determining the chromatic number.

Dans le premier chapitre de la thèse, nous résumons d’abord les définitions des algèbres Hom-Nambu n-aires (resp. Hom-Nambu- Lie) et algèbres Hom-Nambu n-aires multiplicatives (resp. Hom-Nambu-Lie multiplicatives). Ensuite, on donne,quelques exemples d'algèbres Hom-Nambu de dimension finie. Dans la troisième section du chapitre on rappellela classication des algèbres Hom-Nambu-Lie ternaires de dimension 3 correspondant auxhomomorphismes diagonaux donnée par Ataguema, Makhlouf et Silvestrov dans [12]. Laquatrième section est consacrée aux différentes manières de construire des algèbres n-airesde type Hom-Nambu. On rappelle la construction par twist initiée par Yau. Ensuite on la généralise en une construction d'algèbre n-aire de Hom-Nambu à partir d'une algèbre n-aire de Hom-Nambu et d'un morphisme faible. On s'intéresse aussi à des constructions d'arité plus grande ou plus petite et par produit tensoriel. On montre par ailleurs comment obtenir de nouvelles algèbres n-aires de Hom-Nambu en utilisant les éléments du centroide. La cinquième section est consacrée aux notions de dérivations et de représentationspour les algèbres n-aires. On étudie les αk-dérivations, les dérivations centrales et dansle cas général, la théorie des représentations des algèbres Hom-Nambu n-aires. Nousdiscutons en particulier les cas des représentations adjointes et coadjointes. Les résultatsobtenus dans cette section généralisent ceux donnés pour le cas binaire dans [16, 57]. / The aim of this thesis is to study representation theory and cohomology of n-ary Hom-Nambu-Lie algebras, as well as quadratic structures on these algebras. It is organized as follows.• Chapter 1. n-ary Hom-Nambu algebras : in the first section we recall the definitions of n-ary Hom-Nambu algebras and n-ary Hom-Nambu-Lie algebras, introduced by Ataguema, Makhlouf and Silvestrov and provide some key constructions. These algebras correspond to a generalized version by twisting of n-ary Nambu algebras and Nambu-Lie algebras which are called Filippov algebras. We deal in this chapter with a subclass of n-ary Hom-Nambu algebras called multiplicative n-ary Hom-Nambu algebras. In Section 1.2, we recall the list of 3-dimensional ternary Hom-Nambu-Lie algebras of special type corresponding to diagonal homomorphisms. In Section 1.4 we show different construction procedures. We recall the construction procedures by twisting principles and provide some new constructions using for example the centroid. The first twisting principle, introduced for binary case, was extend to n-ary case. The second twisting principle was introduced for binary algebras. We will extend it to n-ary case in the sequel. Also we recall a construction by tensor product of symmetric totally n-ary Hom-associative algebra by an n-ary Hom-Nambu algebra. In Section 1.5, we extend representation theory of Hom-Lie algebras to the n-ary case and discuss the derivations, αk-derivations and central derivations. The last section of chapter 1 is dedicated to ternary q-Virasoro-Witt algebras. We recall constructions of infinite dimensional ternary Hom-Nambu algebras.• Chapter 2. Cohomology of n-ary multiplicative Hom-Nambu algebras : InSection 2.1. We define a central extension. In the second Section we show that for an n-ary Hom-Nambu-Lie algebra N, the space ∧n−1 N carries a structure of Hom-Leibniz algebra and we dene a cohomology which is suitable for the study of one parameter formal deformations of n-ary Hom-Nambu-Lie algebras. In Section 2.4, we extend to n-ary multiplicative Hom-Nambu-Lie algebras the Takhtajan's construction of a cohomology of ternary Nambu-Lie algebras starting from Chevalley-Eilenberg cohomology of binary Lie algebras. The cohomology of multiplicative Hom-Lie algebras. The cohomology complex for Leibniz algebras was defined by Loday and Pirashvili.• Chapter 3. Quadratic n-ary Hom-Nambu algebras : In the first section we introduce a class of Hom-Nambu-Lie algebras which possess an inner product. In Section 3.3, we provide some constructions of Hom-quadratic Hom-Nambu-Lie algebras starting from an ordinary Nambu-Lie algebra and from tensor product of Hom-quadratic commutative Hom-associative algebra and Hom-quadratic Hom-Nambu-Lie algebra. In Section 3.5, we provide a construction of n-ary Hom-Nambu algebra L which is a generalization of the trivial T∗-extension. In Section 3.6, we give a construction of ternary algebra arising from quadratic Lie algebra. In Section 3.7, we construct quadratic n-ary Hom-Nambu algebras involving elements of the centroid of n-ary Nambu algebras.

In this thesis, we propose and evaluate quasi-optimal algorithms for solving the code-constellation optimization problem in M-ary CDMA system. The M-ary CDMA system is a new CDMA architecture. The more spreading codes used in each user, and the higher bandwidth efficiency can achieve with more bits packed in each symbol. We use a code, which we refer to as ¡§mapping code¡¨, to help form a multidimensional spherical code-constellation. The M codewords of the mapping code correspond one-to-one to the M points on the code-constellation. Thus, the code-constellation optimization problem is a combinatorial optimization problem. We present that an exhaustive search (ES) algorithm would have compute and check all possible subset, and then this problem becomes a NP-hard. Based on the exhaustive search algorithm, we propose symmetric points search (SPS) algorithm to reduce computation complexity, but it is not optimal algorithm. In addition, we propose a quasi-optimal algorithm, namely Manhattan distance search (MDS) algorithm. Numerical results and comparisons are provided to illustrate that the computation complexity of the Manhattan distance search algorithm increases linearly with dimension of code-constellation and its performance is better than others.

In this thesis, 2D Local Discriminant Bases (LDB) algorithm is used to 2D search structure to classify remotely sensed data. 2D Linear Discriminant Analysis (LDA) method is converted into an M-ary classifier by combining majority voting principle and linear distance parameters. The feature extraction algorithm extracts the relevant features by removing the irrelevant ones and/or combining the ones which do not represent supplemental information on their own. The algorithm is implemented on a remotely sensed airborne data set from Tippecanoe County, Indiana to evaluate its performance. The spectral and spatial-frequency features are extracted from the multispectral data and used for classifying vegetative species like corn, soybeans, red clover, wheat and oat in the data set.

Proefschrift Universiteit van Amsterdam. / Met lit. opg. - Met samenvatting in het Engels.

Dissertação (mestrado)—Universidade de Brasília, Faculdade de Arquitetura e Urbanismo, Mestrado em Arquitetura e Urbanismo, 2012. / Submitted by Alaíde Gonçalves dos Santos (alaide@unb.br) on 2013-02-08T11:55:19Z No. of bitstreams: 1 2012_ JaymeWesleydeLima.pdf: 21356638 bytes, checksum: 03cc907b12dbb16c73d15a549d527f26 (MD5) / Approved for entry into archive by Guimaraes Jacqueline(jacqueline.guimaraes@bce.unb.br) on 2013-02-08T12:28:55Z (GMT) No. of bitstreams: 1 2012_ JaymeWesleydeLima.pdf: 21356638 bytes, checksum: 03cc907b12dbb16c73d15a549d527f26 (MD5) / Made available in DSpace on 2013-02-08T12:28:55Z (GMT). No. of bitstreams: 1 2012_ JaymeWesleydeLima.pdf: 21356638 bytes, checksum: 03cc907b12dbb16c73d15a549d527f26 (MD5) / Esta dissertação tem como objetivo discutir formas alternativas de preservação do patrimônio modernista em Brasília, com o foco naqueles edifícios não contemplados pelo tombamento na cidade. Como objeto referência dessas reflexões foi escolhido, pela suas características arquitetônicas e pela sua história, o edifício sede pioneiro do Banco do Brasil em Brasília, o Sede I, projetado pelo arquiteto Ary Garcia Roza. O trabalho primeiramente problematiza os significados do patrimônio histórico e os conceitos de monumento e valores patrimoniais, partindo da formulação teórica de Alois Riegl. A seguir, é analisada a gênese e contexto do edifício Sede I, efetuada a discussão de aspectos do tombamento de Brasília e analisado o entorno urbano do edifício, o Setor Bancário Sul. A trajetória de Ary Garcia Roza e sua identificação com as práticas do modernismo na arquitetura brasileira é seguida pelo histórico do Sede I e a análise do edifício em si, identificando suas características projetuais e seus valores patrimoniais. Na parte final do trabalho, são listados pontos que deverão ser observados para a não descaracterização do sentido histórico e estético do bem; pontos que podem servir de orientação e recomendação aos usuários e gestores do Sede I em suas práticas no edifício.

We generalize the results of Leger and Luks and other researchers about generalized derivations to the cases of ternary Lie algebras and n-BiHom Lie algebras. We investigate the derivations algebras of ternary Lie algebras induced from Lie algebras, we explore the subalgebra of quasi-derivations and give their properties. Moreover, we give a classification of the derivations algebras for low dimensional ternary Lie algebras. For the class of n-BiHom Lie algebras, we study the algebras of generalized derivations and prove that the algebra of quasi-derivations can be embedded in the derivation algebra of a larger n-BiHom Lie algebra.

In this work, we present off-chip communications architectures for line cards to increase the throughput of the currently used memory system. In recent years there is a significant increase in memory bandwidth demand on line cards as a result of higher line rates, an increase in deep packet inspection operations and an unstoppable expansion in lookup tables. As line-rate data and NPU processing power increase, memory access time becomes the main system bottleneck during data store/retrieve operations. The growing demand for memory bandwidth contrasts the notion of indirect interconnect methodologies. Moreover, solutions to the memory bandwidth bottleneck are limited by physical constraints such as area and NPU I/O pins. Therefore, indirect interconnects are replaced with direct, packet-based networks such as mesh, torus or k-ary n-cubes. We investigate multiple k-ary n-cube based interconnects and propose two variations of 2-ary 3-cube interconnect called the 3D-bus and 3D-mesh. All of the k-ary n-cube interconnects include multiple, highly efficient techniques to route, switch, and control packet flows in order to minimize congestion spots and packet loss. We explore the tradeoffs between implementation constraints and performance. We also developed an event-driven, interconnect simulation framework to evaluate the performance of packet-based off-chip k-ary n-cube interconnect architectures for line cards. The simulator uses the state-of-the-art software design techniques to provide the user with a flexible yet robust tool, that can emulate multiple interconnect architectures under non-uniform traffic patterns. Moreover, the simulator offers the user with full control over network parameters, performance enhancing features and simulation time frames that make the platform as identical as possible to the real line card physical and functional properties. By using our network simulator, we reveal the best processor-memory configuration, out of multiple configurations, that achieves optimal performance. Moreover, we explore how network enhancement techniques such as virtual channels and sub-channeling improve network latency and throughput. Our performance results show that k-ary n-cube topologies, and especially our modified version of 2-ary 3-cube interconnect - the 3D-mesh, significantly outperform existing line card interconnects and are able to sustain higher traffic loads. The flow control mechanism proved to extensively reduce hot-spots, load-balance areas of high traffic rate and achieve low transmission failure rate. Moreover, it can scale to adopt more memories and/or processors and as a result to increase the line card's processing power.

No description available.