Análisis de los efectos de intervenciones públicas en la recuperación de centros urbanos : caso de estudio barrio las Cruces, Bogotá 2002-2014

En el presente estudio de caso se hace un análisis de los principales efectos socio-espaciales y económicos que tuvieron intervenciones públicas dirigidas a recuperar el centro de Bogotá, en el territorio específico del Barrio Las Cruces, durante los años 2002-2014. Para lograrlo, en un primer momento se hace un análisis conceptual de las relaciones existentes entre intervenciones urbanas y los efectos que estas producen en lo urbano y lo local; en un segundo se identifican los antecedentes que sirvieron para intervenir el barrio, y las intervenciones públicas que llevadas a cabo en éste durante el 2002 – 2014; y en un el tercero se analizan los efectos y las relaciones que tuvieron dichas intervenciones sobre las variables social, espacial y económica del barrio durante el periodo estudiado. Con el fin de verificar si la política de rehabilitación con la que se viene interviniendo dicha zona es coherente con las realidades locales.

TLC Colombia y Triángulo del Norte: Las Importaciones en el Proceso de Internacionalización de las PYMES y Oportunidades de Negocio

El proyecto busca mostrar oportunidades para las PYMES (Pequeñas y Medianas Empresas) colombianas de posibles proveedores de materias primas de calidad, resaltando los productos más solicitados y de mejor calidad provenientes de los países que conforman el Triángulo del Norte, aprovechando las preferencias de importación gracias al Tratado de Libre Comercio que existe entre Colombia y el TN. Dentro de este estudio se expondrá el perfil de importación de cada Departamento colombiano de productos provenientes de los países del Triángulo del Norte: El Salvador, Guatemala y Honduras. El trabajo se divide en cuatro partes. En la primera se expondrá el proceso de negociación del TLC entre Colombia y el Triángulo del Norte, la importancia y el potencial de este mercado para la realización de negocios. En la segunda se analizará la evolución de las importaciones de cada Departamento colombiano de productos provenientes de cada país integrante del Triángulo del Norte, con la información extraída de la base de datos WISER TRADE. En esta se muestran de manera detallada los productos importados provenientes del Triángulo del Norte, así como los principales proveedores de estos bienes para cada Departamento. En la tercera se presentan los beneficios de importar artículos procedentes del Triángulo del Norte y un modelo detallado de cómo realizar negocios con ellos, proyecto de importaciones, entidades que ayudan a facilitar el proceso de importaciones y cargos arancelarios. Finalmente, se encuentran las conclusiones y recomendaciones para cualquier agente interesado en importar desde el Triángulo del Norte a Colombia.

CYCLIC CODES THROUGH B[X], B[X; 1/kp Z(0)] and B[X; 1/p(k) Z(0)]: A COMPARISON

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Constructions of codes through the semigroup ring B[X; 1/2(2)Z(0)] and encoding

For any finite commutative ring B with an identity there is a strict inclusion B[X; Z(0)] subset of B[X; Z(0)] subset of B[X; 1/2(2)Z(0)] of commutative semigroup rings. This work is a continuation of Shah et al. (2011) [8], in which we extend the study of Andrade and Palazzo (2005) [7] for cyclic codes through the semigroup ring B[X; 1/2; Z(0)] In this study we developed a construction technique of cyclic codes through a semigroup ring B[X; 1/2(2)Z(0)] instead of a polynomial ring. However in the second phase we independently considered BCH, alternant, Goppa, Srivastava codes through a semigroup ring B[X; 1/2(2)Z(0)]. Hence we improved several results of Shah et al. (2011) [8] and Andrade and Palazzo (2005) [7] in a broader sense. Published by Elsevier Ltd

Encoding through generalized polynomial codes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Fusão da ressonância nuclear magnética e cintilografia mamária no carcinoma de mama localmente avançado. Análise da correlação entre os exames em pacientes submetidos à quimioterapia neoadjuvante

Pós-graduação em Pesquisa e Desenvolvimento (Biotecnologia Médica) - FMB

A note on units of finite local rings in an ascending chain

In this paper we present matrices over unitary finite commutative local rings connected through an ascending chain of containments, whose elements are units of the corresponding rings in the chain such that the McCoy ranks are the largest ones.

Linear codes over finite local rings in a chain

For a positive integer $t$, let \begin{equation*} \begin{array}{ccccccccc} (\mathcal{A}_{0},\mathcal{M}_{0}) & \subseteq & (\mathcal{A}_{1},\mathcal{M}_{1}) & \subseteq & & \subseteq & (\mathcal{A}_{t-1},\mathcal{M}_{t-1}) & \subseteq & (\mathcal{A},\mathcal{M}) \\ \cap & & \cap & & & & \cap & & \cap \\ (\mathcal{R}_{0},\mathcal{M}_{0}^{2}) & & (\mathcal{R}_{1},\mathcal{M}_{1}^{2}) & & & & (\mathcal{R}_{t-1},\mathcal{M}_{t-1}^{2}) & & (\mathcal{R},\mathcal{M}^{2}) \end{array} \end{equation*} be a chain of unitary local commutative rings $(\mathcal{A}_{i},\mathcal{M}_{i})$ with their corresponding Galois ring extensions $(\mathcal{R}_{i},\mathcal{M}_{i}^{2})$, for $i=0,1,\cdots,t$. In this paper, we have given a construction technique of the cyclic, BCH, alternant, Goppa and Srivastava codes over these rings. Though, initially in \cite{AP} it is for local ring $(\mathcal{A},\mathcal{M})$, in this paper, this new approach have given a choice in selection of most suitable code in error corrections and code rate perspectives.

A Note on Linear Codes over Semigroup Rings

In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 1 3Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these constructions we improve the several results of [1]. After this, we present a decoding principle for BCH, alternant and Goppa codes which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r/2, i.e., whose minimum Hamming distance is r + 1.

Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding

Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring . For a = 1, almost all the results contained in [16] stands as a very particular case of this study.

Is a Genome a Codeword of an Error-Correcting Code?

Since a genome is a discrete sequence, the elements of which belong to a set of four letters, the question as to whether or not there is an error-correcting code underlying DNA sequences is unavoidable. The most common approach to answering this question is to propose a methodology to verify the existence of such a code. However, none of the methodologies proposed so far, although quite clever, has achieved that goal. In a recent work, we showed that DNA sequences can be identified as codewords in a class of cyclic error-correcting codes known as Hamming codes. In this paper, we show that a complete intron-exon gene, and even a plasmid genome, can be identified as a Hamming code codeword as well. Although this does not constitute a definitive proof that there is an error-correcting code underlying DNA sequences, it is the first evidence in this direction.

Vertical distribution of relative numbers of the main groups of sound-scattering fishes in the Central Indian Ocean

Findings made in 31 catches with an Isaacs-Kidd midwater trawl in the light (09.00-16.00) and dark (21.00-04.00) periods of a day within a survey area of about 100 sq. miles with approximate center coordinates of 13°S and 78°E have been used to investigate vertical distribution of the main groups of sound-scattering fishes (35 species of the family Myctophidae and 16 species of other families). It has been shown that during daylight hours all fishes sink to depths deeper than 400 m. Data are presented concerning the fish population of night-time sound-scattering layers at depths of 70-150 m and about 400 m and of the daytime ones at depths of about 450 m.