¿Literatura comparada? Una propuesta metodológica comparativa aplicada a dos cronistas urbanos en Chile y Catalunya

La presente ponencia trabaja en torno a un género moderno de carácter híbrido, en el cual convergen elementos propios de los géneros literarios, pero que se publica originalmente en un medio periodístico, los diarios y revistas: la crónica urbana. Específicamente, pretende aplicar la teoría de los polisistemas, de Itamar Even-Zohar, al estudio comparado de dos cronistas de la primera mitad del siglo XX, que pertenecen a dos contextos de producción distintos: el primero es Joaquín Edwards Bello, escritor chileno, y el segundo es Josep Pla, escritor catalán. Se consideran, siguiendo a Even Zohar, en este estudio, los múltiples factores que influyen en la escritura de sus crónicas, su relación con la institución periodística y la institución literaria de su época y cómo influyen estas relaciones en determinadas características del género que cultivan. Se pretende, finalmente, ofrecer una herramienta teórico-metodológica que permita abordar un estudio comparado que valore este género más allá de su relación con la producción propiamente literaria de los autores, otorgándole una dignidad discursiva que los propios autores, a través de diversas técnicas empleadas en su escritura, reivindican

Trayectorias educativas y laborales de los graduados de Sociología de la Universidad Nacional de La Plata

Fil: Di Bello, Mariana Eva. Universidad Nacional de La Plata. Facultad de Humanidades y Ciencias de la Educación; Argentina.

Utilidad social de conocimientos científicos, grupos de investigación académicos y problemas sociales

El trabajo analiza, desde la perspectiva de los Estudios Sociales de la Ciencia y la Tecnología, el proceso de construcción de significados de utilidad de conocimientos científicos en el marco de interacciones entre actores heterogéneos en el caso de tres grupos de investigación académicos que orientan parte de su tarea hacia la resolución de problemas sociales. Como resultado, se presenta un análisis de las modificaciones que sufren los procesos de producción de conocimiento y organización del trabajo académico una vez que los investigadores ingresan en redes de relaciones con otros actores; las diferentes modalidades de vinculación entre productores y usuarios de conocimientos y los procesos de negociación de alternativas de uso y de definición de "demandas" en escenarios de interacción.

La querella de la lengua en Argentina : ensayo biográfico

Tabla de contenidos: Los precursores: casticistas y románticos (1828-1838). Sarmiento: la polémica con Bello y la reforma ortográfica (1841-1870). La intervención de la Real Academia en América (1870-1880). Academias correspondientes y diccionarios (1889-1892). Contra el purismo: de Lenz a Cuervo (1893-1900). Polémicas en torno a las tesis segregacionistas de Abeille y Cuervo (1900-1903). Del viraje de Unamuno a la tesis de la escisión moral, de Menéndez Pidal (1903-1918). Primeras periodizaciones: Costa Alvarez, Quesada y Rojas (1922-1923). La querella al irrumpir el Instituto de Filología (1923-1927). Fin de un ciclo: apogeo y caída (1927-1928).

Nonparametric Message Passing Methods for Cooperative Localization and Tracking

The objective of this thesis is the development of cooperative localization and tracking algorithms using nonparametric message passing techniques. In contrast to the most well-known techniques, the goal is to estimate the posterior probability density function (PDF) of the position of each sensor. This problem can be solved using Bayesian approach, but it is intractable in general case. Nevertheless, the particle-based approximation (via nonparametric representation), and an appropriate factorization of the joint PDFs (using message passing methods), make Bayesian approach acceptable for inference in sensor networks. The well-known method for this problem, nonparametric belief propagation (NBP), can lead to inaccurate beliefs and possible non-convergence in loopy networks. Therefore, we propose four novel algorithms which alleviate these problems: nonparametric generalized belief propagation (NGBP) based on junction tree (NGBP-JT), NGBP based on pseudo-junction tree (NGBP-PJT), NBP based on spanning trees (NBP-ST), and uniformly-reweighted NBP (URW-NBP). We also extend NBP for cooperative localization in mobile networks. In contrast to the previous methods, we use an optional smoothing, provide a novel communication protocol, and increase the efficiency of the sampling techniques. Moreover, we propose novel algorithms for distributed tracking, in which the goal is to track the passive object which cannot locate itself. In particular, we develop distributed particle filtering (DPF) based on three asynchronous belief consensus (BC) algorithms: standard belief consensus (SBC), broadcast gossip (BG), and belief propagation (BP). Finally, the last part of this thesis includes the experimental analysis of some of the proposed algorithms, in which we found that the results based on real measurements are very similar with the results based on theoretical models.

Optimized edge appearance probability for cooperative localization based on tree-reweighted nonparametric belief propagation

Nonparametric belief propagation (NBP) is a well-known particle-based method for distributed inference in wireless networks. NBP has a large number of applications, including cooperative localization. However, in loopy networks NBP suffers from similar problems as standard BP, such as over-confident beliefs and possible nonconvergence. Tree-reweighted NBP (TRW-NBP) can mitigate these problems, but does not easily lead to a distributed implementation due to the non-local nature of the required so-called edge appearance probabilities. In this paper, we propose a variation of TRWNBP, suitable for cooperative localization in wireless networks. Our algorithm uses a fixed edge appearance probability for every edge, and can outperform standard NBP in dense wireless networks.

Experimental results on multicarrier MIMO HF communications

Achieving reliable communication over HF channels is known to be challenging due to the particularly hostile propagation medium. To address this problem, diversity techniques were shown to be promising. In this paper, we demonstrate through experimental results the benefits of different diversity strategies when applied to multi-input-multi-output (MIMO) multicarrier systems. The performance gains of polarisation, space and frequency diversities are quantified using different measurement campaigns

Clima, zonificación y tipicidad del vino en regiones vitivinícolas Iberoamericanas

El texto presenta el Sistema de Clasificación Climática Multicritério Geovitícola. Incluye los conceptos, metodologías y indices climáticos vitícolas, la página web internacional del Sistema CCM y aun bibliografías con diferenciados usos en el ámbito mundial. El Sistema ha sido utilizado para los estudios de los climas de las regiones vitícolas de los países iberoamericanos. En la pagina web del sistema http://www.cnpuv.embrapa.br/tecnologias/c cm/ se puede encontrar la información de referencia del Sistema.

Improved Animal Tracking Algorithm using Distributed Kalman Filter-based Algortihms

Animal tracking has been addressed by different initiatives over the last two decades. Most of them rely on satellite connectivity on every single node and lack of energy-saving strategies. This paper presents several new contributions on the tracking of dynamic heterogeneous asynchronous networks (primary nodes with GPS and secondary nodes with a kinetic generator) motivated by the animal tracking paradigm with random transmissions. A simple approach based on connectivity and coverage intersection is compared with more sophisticated algorithms based on ad-hoc implementations of distributed Kalman-based filters that integrate measurement information using Consensus principles in order to provide enhanced accuracy. Several simulations varying the coverage range, the random behavior of the kinetic generator (modeled as a Poisson Process) and the periodic activation of GPS are included. In addition, this study is enhanced with HW developments and implementations on commercial off-the-shelf equipment which show the feasibility for performing these proposals on real hardware.

Distributed collaborative processing in wireless sensor networks with application to target localization and beamforming

Abstract The proliferation of wireless sensor networks and the variety of envisioned applications associated with them has motivated the development of distributed algorithms for collaborative processing over networked systems. One of the applications that has attracted the attention of the researchers is that of target localization where the nodes of the network try to estimate the position of an unknown target that lies within its coverage area. Particularly challenging is the problem of estimating the target’s position when we use received signal strength indicator (RSSI) due to the nonlinear relationship between the measured signal and the true position of the target. Many of the existing approaches suffer either from high computational complexity (e.g., particle filters) or lack of accuracy. Further, many of the proposed solutions are centralized which make their application to a sensor network questionable. Depending on the application at hand and, from a practical perspective it could be convenient to find a balance between localization accuracy and complexity. Into this direction we approach the maximum likelihood location estimation problem by solving a suboptimal (and more tractable) problem. One of the main advantages of the proposed scheme is that it allows for a decentralized implementation using distributed processing tools (e.g., consensus and convex optimization) and therefore, it is very suitable to be implemented in real sensor networks. If further accuracy is needed an additional refinement step could be performed around the found solution. Under the assumption of independent noise among the nodes such local search can be done in a fully distributed way using a distributed version of the Gauss-Newton method based on consensus. Regardless of the underlying application or function of the sensor network it is al¬ways necessary to have a mechanism for data reporting. While some approaches use a special kind of nodes (called sink nodes) for data harvesting and forwarding to the outside world, there are however some scenarios where such an approach is impractical or even impossible to deploy. Further, such sink nodes become a bottleneck in terms of traffic flow and power consumption. To overcome these issues instead of using sink nodes for data reporting one could use collaborative beamforming techniques to forward directly the generated data to a base station or gateway to the outside world. In a dis-tributed environment like a sensor network nodes cooperate in order to form a virtual antenna array that can exploit the benefits of multi-antenna communications. In col-laborative beamforming nodes synchronize their phases in order to add constructively at the receiver. Some of the inconveniences associated with collaborative beamforming techniques is that there is no control over the radiation pattern since it is treated as a random quantity. This may cause interference to other coexisting systems and fast bat-tery depletion at the nodes. Since energy-efficiency is a major design issue we consider the development of a distributed collaborative beamforming scheme that maximizes the network lifetime while meeting some quality of service (QoS) requirement at the re¬ceiver side. Using local information about battery status and channel conditions we find distributed algorithms that converge to the optimal centralized beamformer. While in the first part we consider only battery depletion due to communications beamforming, we extend the model to account for more realistic scenarios by the introduction of an additional random energy consumption. It is shown how the new problem generalizes the original one and under which conditions it is easily solvable. By formulating the problem under the energy-efficiency perspective the network’s lifetime is significantly improved. Resumen La proliferación de las redes inalámbricas de sensores junto con la gran variedad de posi¬bles aplicaciones relacionadas, han motivado el desarrollo de herramientas y algoritmos necesarios para el procesado cooperativo en sistemas distribuidos. Una de las aplicaciones que suscitado mayor interés entre la comunidad científica es la de localization, donde el conjunto de nodos de la red intenta estimar la posición de un blanco localizado dentro de su área de cobertura. El problema de la localization es especialmente desafiante cuando se usan niveles de energía de la seal recibida (RSSI por sus siglas en inglés) como medida para la localization. El principal inconveniente reside en el hecho que el nivel de señal recibida no sigue una relación lineal con la posición del blanco. Muchas de las soluciones actuales al problema de localization usando RSSI se basan en complejos esquemas centralizados como filtros de partículas, mientas que en otras se basan en esquemas mucho más simples pero con menor precisión. Además, en muchos casos las estrategias son centralizadas lo que resulta poco prácticos para su implementación en redes de sensores. Desde un punto de vista práctico y de implementation, es conveniente, para ciertos escenarios y aplicaciones, el desarrollo de alternativas que ofrezcan un compromiso entre complejidad y precisión. En esta línea, en lugar de abordar directamente el problema de la estimación de la posición del blanco bajo el criterio de máxima verosimilitud, proponemos usar una formulación subóptima del problema más manejable analíticamente y que ofrece la ventaja de permitir en¬contrar la solución al problema de localization de una forma totalmente distribuida, convirtiéndola así en una solución atractiva dentro del contexto de redes inalámbricas de sensores. Para ello, se usan herramientas de procesado distribuido como los algorit¬mos de consenso y de optimización convexa en sistemas distribuidos. Para aplicaciones donde se requiera de un mayor grado de precisión se propone una estrategia que con¬siste en la optimización local de la función de verosimilitud entorno a la estimación inicialmente obtenida. Esta optimización se puede realizar de forma descentralizada usando una versión basada en consenso del método de Gauss-Newton siempre y cuando asumamos independencia de los ruidos de medida en los diferentes nodos. Independientemente de la aplicación subyacente de la red de sensores, es necesario tener un mecanismo que permita recopilar los datos provenientes de la red de sensores. Una forma de hacerlo es mediante el uso de uno o varios nodos especiales, llamados nodos “sumidero”, (sink en inglés) que actúen como centros recolectores de información y que estarán equipados con hardware adicional que les permita la interacción con el exterior de la red. La principal desventaja de esta estrategia es que dichos nodos se convierten en cuellos de botella en cuanto a tráfico y capacidad de cálculo. Como alter¬nativa se pueden usar técnicas cooperativas de conformación de haz (beamforming en inglés) de manera que el conjunto de la red puede verse como un único sistema virtual de múltiples antenas y, por tanto, que exploten los beneficios que ofrecen las comu¬nicaciones con múltiples antenas. Para ello, los distintos nodos de la red sincronizan sus transmisiones de manera que se produce una interferencia constructiva en el recep¬tor. No obstante, las actuales técnicas se basan en resultados promedios y asintóticos, cuando el número de nodos es muy grande. Para una configuración específica se pierde el control sobre el diagrama de radiación causando posibles interferencias sobre sis¬temas coexistentes o gastando más potencia de la requerida. La eficiencia energética es una cuestión capital en las redes inalámbricas de sensores ya que los nodos están equipados con baterías. Es por tanto muy importante preservar la batería evitando cambios innecesarios y el consecuente aumento de costes. Bajo estas consideraciones, se propone un esquema de conformación de haz que maximice el tiempo de vida útil de la red, entendiendo como tal el máximo tiempo que la red puede estar operativa garantizando unos requisitos de calidad de servicio (QoS por sus siglas en inglés) que permitan una decodificación fiable de la señal recibida en la estación base. Se proponen además algoritmos distribuidos que convergen a la solución centralizada. Inicialmente se considera que la única causa de consumo energético se debe a las comunicaciones con la estación base. Este modelo de consumo energético es modificado para tener en cuenta otras formas de consumo de energía derivadas de procesos inherentes al funcionamiento de la red como la adquisición y procesado de datos, las comunicaciones locales entre nodos, etc. Dicho consumo adicional de energía se modela como una variable aleatoria en cada nodo. Se cambia por tanto, a un escenario probabilístico que generaliza el caso determinista y se proporcionan condiciones bajo las cuales el problema se puede resolver de forma eficiente. Se demuestra que el tiempo de vida de la red mejora de forma significativa usando el criterio propuesto de eficiencia energética.

A simulation method to estimate closing forces in car-sealing rubber elements

The door-closing process can reinforce the impression of a solid, rock-proof, car body or of a rather cheap, flimsy vehicle. As there are no real prototypes during rubber profile bidding-out stages, engineers need to carry out non-linear numerical simulations that involve complex phenomena as well as static and dynamic loads for several profile candidates. This paper presents a structured virtual design tool based on FEM, including constitutive laws and incompressibility constraints allowing to predict more realistically the final closing forces and even to estimate sealing overpressure as an additional guarantee of noise insulation. Comparisons with results of physical tests are performed.

X-Ray Diffraction, Calorimetric and Dielectric Relaxation Study of the Amorphous and Smectic States of a Main Chain Liquid Crystalline Polymer

Los polímeros cristales líquidos (LCP) son sistemas complejos que forman mesofases que presentan orden orientacional y polímeros amorfos. Con frecuencia, el estado amorfo isotrópico no puede ser estudiado debido a la rápida formación de mesofases. En este trabajo se ha sintetizado y estudiado un nuevo LCP: poli(trietilenglicol metil p, p '-bibenzoato), PTEMeB. Este polímero presenta una formación de mesofase bastante lenta haciendo posible estudiar de forma independiente tanto los estados amorfo y de cristal líquidos. La estructura y las transiciones de fase del PTEMeB han sido investigados por calorimetría (DSC), con MAXS / WAXS con temperatura variable que emplean radiación de sincrotrón y con difracción de rayos X. Estos estudios han mostrado la existencia de dos transiciones vítreas, relacionadas con las fases amorfa y cristal líquido. Se ha realizado un estudio de relajación dieléctrica en amplios intervalos de temperatura y presión. Se ha encontrado que la transición vítrea dinámica de la fase amorfa es más lenta que la del cristal líquido. El estudio de la relajación ? nos ha permitido seguir la formación isoterma de la mesofase a presión atmosférica. Además, con el estudio el comportamiento dinámico a alta presión se ha encontrado que se produce la formación rápida de la mesofase inducida por cambios bruscos de presión. Liquid crystalline polymers (LCPs) are complex systems that include features of both orientationally ordered mesophases and amorphous polymers. Frequently, the isotropic amorphous state cannot be studied due to the rapid mesophase formation. Here, a new main chain LCP, poly(triethyleneglycol methyl p,p'-bibenzoate), PTEMeB, has been synthesized. It shows a rather slow mesophase formation making possible to study independently both the amorphous and the liquid crystalline states. The structure and phase transitions of PTEMeB have been investigated by calorimetry, variable-temperature MAXS/WAXS employing synchrotron radiation, and X-ray diffraction in oriented fibers. These experiments have pointed out the presence of two glass transitions, related to the amorphous or to the liquid crystal phases. Additionally, the mesophase seems to be a coexistence of orthogonal and tilted smectic phases. A dielectric relaxation study of PTEMeB over broad ranges of temperature and pressure has been performed. The dynamic glass transition turns out to be slower for the amorphous state than for the liquid crystal. Monitoring of the α relaxation has allowed us to follow the isothermal mesophase formation at atmospheric pressure. Additionally, the dynamical behavior at high pressures has pointed out the fast formation of the mesophase induced by sudden pressure changes.

HF spectrum activity prediction model based on HMM for cognitive radio applications

Although most of the research on Cognitive Radio is focused on communication bands above the HF upper limit (30 MHz), Cognitive Radio principles can also be applied to HF communications to make use of the extremely scarce spectrum more efficiently. In this work we consider legacy users as primary users since these users transmit without resorting to any smart procedure, and our stations using the HFDVL (HF Data+Voice Link) architecture as secondary users. Our goal is to enhance an efficient use of the HF band by detecting the presence of uncoordinated primary users and avoiding collisions with them while transmitting in different HF channels using our broad-band HF transceiver. A model of the primary user activity dynamics in the HF band is developed in this work to make short-term predictions of the sojourn time of a primary user in the band and avoid collisions. It is based on Hidden Markov Models (HMM) which are a powerful tool for modelling stochastic random processes and are trained with real measurements of the 14 MHz band. By using the proposed HMM based model, the prediction model achieves an average 10.3% prediction error rate with one minute-long channel knowledge but it can be reduced when this knowledge is extended: with the previous 8 min knowledge, an average 5.8% prediction error rate is achieved. These results suggest that the resulting activity model for the HF band could actually be used to predict primary users activity and included in a future HF cognitive radio based station.

Distributed static linear Gaussian models using consensus

Algorithms for distributed agreement are a powerful means for formulating distributed versions of existing centralized algorithms. We present a toolkit for this task and show how it can be used systematically to design fully distributed algorithms for static linear Gaussian models, including principal component analysis, factor analysis, and probabilistic principal component analysis. These algorithms do not rely on a fusion center, require only low-volume local (1-hop neighborhood) communications, and are thus efficient, scalable, and robust. We show how they are also guaranteed to asymptotically converge to the same solution as the corresponding existing centralized algorithms. Finally, we illustrate the functioning of our algorithms on two examples, and examine the inherent cost-performance tradeoff.

A fitting algorithm for random modeling the PLC channel

The characteristics of the power-line communication (PLC) channel are difficult to model due to the heterogeneity of the networks and the lack of common wiring practices. To obtain the full variability of the PLC channel, random channel generators are of great importance for the design and testing of communication algorithms. In this respect, we propose a random channel generator that is based on the top-down approach. Basically, we describe the multipath propagation and the coupling effects with an analytical model. We introduce the variability into a restricted set of parameters and, finally, we fit the model to a set of measured channels. The proposed model enables a closed-form description of both the mean path-loss profile and the statistical correlation function of the channel frequency response. As an example of application, we apply the procedure to a set of in-home measured channels in the band 2-100 MHz whose statistics are available in the literature. The measured channels are divided into nine classes according to their channel capacity. We provide the parameters for the random generation of channels for all nine classes, and we show that the results are consistent with the experimental ones. Finally, we merge the classes to capture the entire heterogeneity of in-home PLC channels. In detail, we introduce the class occurrence probability, and we present a random channel generator that targets the ensemble of all nine classes. The statistics of the composite set of channels are also studied, and they are compared to the results of experimental measurement campaigns in the literature.