Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2016-12-29T17:50:30Z No. of bitstreams: 1 AlineAmabileViolBarbosa_TESE.pdf: 6434010 bytes, checksum: e3a07408423ecca8798dc99b1a3c1f71 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-01-02T20:15:57Z (GMT) No. of bitstreams: 1 AlineAmabileViolBarbosa_TESE.pdf: 6434010 bytes, checksum: e3a07408423ecca8798dc99b1a3c1f71 (MD5) / Made available in DSpace on 2017-01-02T20:15:57Z (GMT). No. of bitstreams: 1 AlineAmabileViolBarbosa_TESE.pdf: 6434010 bytes, checksum: e3a07408423ecca8798dc99b1a3c1f71 (MD5) Previous issue date: 2015-09-18 / Conselho Nacional de Desenvolvimento Cient?fico e Tecnol?gico (CNPq) / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior (CAPES) / O recente desenvolvimento do poder de processamento computacional vem trazendo para dentro do escopo da f?sica e outras ci?ncia exatas desafios at? ent?o considerados exclusivos de ci?ncias qualitativas. M?todos e conceitos da F?sica t?m contribu?do para avan?os em diversas ?reas, dentre elas neuroci?ncia. Vimos na presente tese de doutorado estudar o comportamento do c?rebro humano em estado alterado de consci?ncia, a partir de mapas funcionais gerados por resson?ncia magn?tica funcional (fMRI, {\it functional Magnetic Ressonance}) usando ferramentas da f?sica estat?stica e da teoria de redes complexas. Analisamos dados de fMRI do c?rebro de sujeitos em estado de repouso em duas condi??es distintas: em estado natural e em estado alterado de consci?ncia pela ingest?o de uma infus?o psicoativa, proveniente da cultura ind?gena amaz?nica, chamada Ayahuasca. Em linhas gerais fomos guiados por duas perguntas. O Ayahuasca causa diferen?as nas redes funcionais do c?rebro? Como quantificar essas diferen?as? Inicialmente constru?mos redes complexas usando os dados de fMRI para mapear informa??es das redes funcionais do c?rebro de cada sujeito em ambas condi??es. A seguir analisamos as propriedades estat?sticas e topol?gicas dessas redes. Comparando as redes geradas a partir dos dados adquiridos antes e depois da ingest?o do Ayahuasca, detectamos duas mudan?as importantes nas propriedades estat?sticas e topol?gicas. Encontramos primeiramente um aumento na entropia de Shannon da distribui??o de grau. Encontramos tamb?m uma segunda mudan?a importante: Uma varia??o na topologia que interfere nas efici?ncias das redes referentes ao estado alterado. Parte das mudan?as nas efici?ncias de rede v?o al?m do que pode ser explicado exclusivamente pelo aumento de entropia. Interpretamos e discutimos esses dois resultados no contexto de neuroci?ncia. Comentamos tamb?m sobre a como a quantifica??o de informa??es das redes funcionais pode ser melhorar nossa compreens?o do funcionamento do c?rebro humano e, consequentemente, contribuir para o desenvolvimento de novas metodologias em diagn?stico e tratamento de dist?rbios psiqui?tricos ainda pouco compreendidos. / An important problem in nonlinear dynamics and statistical physics relates to the quantitative description of the behavior of complex systems. The human brain is one such system. Methods and concepts used in physics have contributed to the development of diverse fields, including neuroscience. In this thesis, we investigate the behavior of the human brain in altered states of consciousness. We study the functional maps of the brain generated by functional magnetic resonance imaging (fMRI), using the tools of statistical physics and the theory of complex networks. We analyze resting state fMRI data of the brains of 9 human subjects under two distinct conditions: under normal waking state and in an altered state of consciousness, induced by ingestion of the psychoactive infusion known as Ayahuasca, of Amazonian indigenous origin. Our study was broadly motivated by two questions: Does Ayahuasca affect the functional brain networks? How can we quantify these effects? We initially constructed complex network models of the brain using the fMRI data, before and after ingestion of Ayahuasca. We next analyzed the statistical and topological properties of these networks. Comparing the networks generated from the data before and after Ayahuasca ingestion, we find some significant changes which we highlight: an increase in the Shannon entropy, a increase in the mean geodesic distance and changes in network efficiencies. The increase in mean distance indicates a global expansion of the brain networks. This suggests a decrease in global integration of brain regions. Moreover, the increase in the entropy of the degree distribution suggests an increase in the range of possibilities of functional patterns. The change in the network efficiencies goes beyond what can be accounted for by the changes in degree distribution. We discuss and present potential interpretations of our results in the context of neuroscience.

Frequently, deep foundations extend through potentially liquefiable soils. When liquefaction occurs in cohesionless soils surrounding a deep foundation, the skin-friction in the liquefied layer is compromised. After cyclical forces suspend and pore pressures dissipate, effective stress rebuilds and the liquefied soil consolidates. When the settlement of the soil exceeds the downward movement of the foundation, downdrag develops. To investigate the loss and redevelopment of skin-friction, strain was measured on an instrumented micropile during a blast-induced liquefaction test in Mirabello, Italy. The soil profile where the micropile was installed consisted of clay to a depth of 6m underlain by a medium to dense sand. The 25cm diameter steel reinforced concrete micropile was bored to a depth of 17m. Pore pressure transducers were placed around the pile at various depths to observe excess pore pressure generation and dissipation. Soil strain was monitored with profilometers in a linear arrangement from the center of the 10m diameter ring of buried explosives out to a 12m radius. Immediately following the blast, liquefaction developed between 6m and 12m below ground. The liquefied layer settled 14cm (~2.4% volumetric strain) while the pile toe settled 1.24cm under elastic displacement. The static neutral plane in the pile occurred at a depth of 12m. From 6m to 12m below ground, the incremental skin-friction was 50% compared to pre-liquefaction measurements. The decrease in residual skin-friction is consistent with measurements observed by Dr. Kyle Rollins from previous full-scale tests in Vancouver, BC, Canada, Christchurch, New Zealand, and Turrel, Arkansas.

Frequently, deep foundations extend through potentially liquefiable soils. When liquefaction occurs in cohesionless soils surrounding a deep foundation, the skin-friction in the liquefied layer is compromised. After cyclical forces suspend and pore pressures dissipate, effective stress rebuilds and the liquefied soil consolidates. When the settlement of the soil exceeds the downward movement of the foundation, downdrag develops. To investigate the loss and redevelopment of skin-friction, strain was measured on an instrumented micropile during a blast-induced liquefaction test in Mirabello, Italy. The soil profile where the micropile was installed consisted of clay to a depth of 6m underlain by a medium to dense sand. The 25cm diameter steel reinforced concrete micropile was bored to a depth of 17m. Pore pressure transducers were placed around the pile at various depths to observe excess pore pressure generation and dissipation. Soil strain was monitored with profilometers in a linear arrangement from the center of the 10m diameter ring of buried explosives out to a 12m radius. Immediately following the blast, liquefaction developed between 6m and 12m below ground. The liquefied layer settled 14cm (~2.4% volumetric strain) while the pile toe settled 1.24cm under elastic displacement. The static neutral plane in the pile occurred at a depth of 12m. From 6m to 12m below ground, the incremental skin-friction was 50% compared to pre-liquefaction measurements. The decrease in residual skin-friction is consistent with measurements observed by Dr. Kyle Rollins from previous full-scale tests in Vancouver, BC, Canada, Christchurch, New Zealand, and Turrel, Arkansas.

[pt] Ao longo das últimas décadas, mais intensamente, a microscopia de força atômica (AFM) tem sido utilizada em atividades de pesquisa e desenvolvimento, notadamente para a caracterização de materiais. Não obstante os avanços e sofisticações da técnica, a determinação do módulo de elasticidade de materiais poliméricos continua sendo um desafio dada a complexidade de caracterização de materiais complexos, comumente gerando expressivo espalhamento nos resultados de medição. Esta pesquisa de mestrado apresenta mapeamentos da morfologia e medições do módulo de elasticidade de celulose comercial (fibras de bambu e de eucalipto) e lignocelulósico, referenciados a materiais poliméricos sintéticos já caracterizados (considerados como padrão). A microscopia de força atômica (AFM), no modo peak force tapping, alternativamente fundamentada no modelo Derajaguin-Muller-Toporo, DMT (que é o modelo incorporado no software da Bruker, fabricante do equipamento AFM) e no modelo JohnsonKendall-Robert, JKR (proposto neste trabalho, fazendo-se uso de um algoritmo Matlab), foi utilizada como técnica de medição do módulo de elasticidade dos materiais investigados. A partir dos ensaios realizados, foi possível avaliar o método de medição com base em critérios metrológicos e determinar o modelo de cálculo mais apropriado para a caracterização dos materiais investigados. Para os materiais padrão utilizados como referência, e cujos valores do módulo de elasticidade são informados pelos respectivos fornecedores (E igual 2,7 mais ou menos 0,1 GPa, para o poliestireno e E igual 1,8 GPa, para a poliamida), o modelo JKR mostrou-se mais adequado para fundamentar o cálculo do módulo de elasticidade. Enquanto o modelo JKR reproduziu o valor do fabricante com 6,3 porcento, para o caso do poliestireno (E igual 2,540754 mais ou menos 0,056 GPa) e com 12,5 porcento, para o caso da poliamida (E igual 1,680050 mais ou menos 0,041 GPa), o modelo DMT produziu resultados com desvios superiores a 50 porcento do valor de referência considerado como padrão. Fundamentado nesses mesmos modelos DMT e JKR, o trabalho avaliou o módulo de elasticidade de outros materiais, mais especificamente: (i) filme de celulose extraída do eucalipto; (ii) filme de celulose microfobrilada comercial; (iii) filme de celulose microfibrilada, depositada no laboratório pela técnica de ultrassom e (iv) amostras de bambu (Dendrocalamus Giganteus), extraídas da seção externa e interna do colmo d o bambu. Os resultados são discutidos em conformidade ao rigor metrológico dos componentes estocásticos e determinísticos da incerteza associada às medições realizadas, confirmando que a microscopia de força atômica (AFM), no modo peak force tapping se apresenta como técnica promissora para ser utilizada como ferramenta metrológica para a caracterização de materiais poliméricos na escala nanométrica. / [en] Over the past few decades, more intensely, atomic force microscopy (AFM) has been used in research and development activities, notably for the characterization of materials. Despite the advances and sophistications of the technique, the determination of the modulus of elasticity of polymeric materials remains a challenge given the complexity of characterizing complex materials, commonly generating significant spread in the measurement results. This research presents mappings of the morphology and measurements of the elasticity modulus of commercial cellulose (bamboo and eucalyptus fibers) and lignocellulosic, referenced to already characterized synthetic polymeric materials (considered as standard). Atomic force microscopy (AFM), in the peak force tapping mode, alternatively based on the Derajaguin-Muller-Toporo model, DMT (which is the model incorporated by Bruker in its AFM software) and the Johnson-KendallRobert model, JKR (proposed in this work, using a Matlab algorithm), was used as a technique for measuring the elasticity module of the investigated materials. From the tests performed, it was possible to evaluate the measurement method based on metrological criteria and determine the most appropriate calculation model for the characterization of the investigated materials. For the standard materials used as a reference, whose elasticity modulus values are reported by the respective suppliers (E equal 2.7 more or less 0.1 GPa, for polystyrene and E equal 1.8 GPa, for polyamide), the JKR model proved to be most suitable to support the calculation of the modulus of elasticity. While the JKR model reproduced the manufacturer s value with 6.3 percent, for the case of polystyrene (E equal 2.540754 more or less 0.056 GPa) and with 12.5 percent, for the case of polyamide (E equal 1.680050 more or less 0.041 GPa), the DMT model produced results with deviations greater than 50 percent from the reference value taken as standard reference values. Based on these DMT and JKR models, the work evaluated the elasticity module of other materials, more specifically: (i) cellulose film extracted from eucalyptus; (ii) commercial microfiltered cellulose film; (iii) microfibrillated cellulose film, deposited in the laboratory by and ultrasound technique and (iv) samples of bamboo (Dendrocalamus Giganteus), extracted from the external and internal section of the bamboo stem. The results are discussed in accordance with the metrological rigor of the stochastic and deterministic components of the uncertainty associated with the measurements performed, confirming that the atomic force microscopy (AFM), in the peak force tapping mode, presents itself as a promising technique to be used as a metrological tool for the characterization of polymeric materials at the nanoscale.

[ES] La constante necesidad de un mayor rendimiento para cumplir con la gran demanda de potencia de cómputo de las nuevas aplicaciones, (ej. sistemas de conducción autónoma), obliga a la industria a apostar por la tecnología basada en Sistemas en Chip con Procesadores Multinúcleo (MPSoCs) en sus sistemas embebidos de seguridad-crítica. Los sistemas MPSoCs generalmente incluyen una red en el chip (NoC) para interconectar los núcleos de procesamiento entre ellos, con la memoria y con el resto de recursos compartidos. Desafortunadamente, el uso de las NoCs dificulta alcanzar la predecibilidad en el tiempo, ya que pueden aparecer conflictos en muchos puntos y de forma distribuida a nivel de red. Para afrontar este problema, en esta tesis se propone un nuevo paradigma de diseño para NoCs de tiempo real donde los conflictos en la red son eliminados por diseño. Este nuevo paradigma parte del Grafo de Dependencia de Canales (CDG) para evitar los conflictos de red de forma determinista. Nuestra solución es capaz de inyectar mensajes de forma natural usando un periodo TDM igual al límite teórico óptimo sin la necesidad de usar un proceso offline exigente computacionalmente. La red se ha integrado en un sistema multinúcleo basado en tiles y adaptado a su jerarquía de memoria. Como segunda contribución principal, proponemos un nuevo planificador dinámico y distribuido capaz de alcanzar un rendimiento pico muy cercanos a las NoC basadas en un diseño wormhole sin comprometer sus garantías de tiempo real. El planificador se basa en nuestro diseño de red para explotar sus propiedades clave. Los resultados de nuestra NoC muestran que nuestro diseño garantiza la predecibilidad en el tiempo evitando interferencias en la red entre múltiples aplicaciones ejecutándose concurrentemente. La red siempre garantiza el rendimiento y también mejora el rendimiento respecto al de las redes wormhole en una red 4 x 4 en un factor de 3,7x cuando se inyecta trafico para generar interferencias. En una red 8 x 8 las diferencias son incluso mayores. Además, la red obtiene un ahorro de área total del 10,79% frente a una implementación básica de una red wormhole. El planificador propuesto alcanza una mejora de rendimiento de 6,9x y 14,4x frente la versión básica de la red DCFNoC para redes en forma de malla de 16 y 64 nodos, respectivamente. Cuando lo comparamos frente a un conmutador estándar wormhole se preserva un rendimiento de red del 95% al mismo tiempo que preserva la estricta predecibilidad en el tiempo. Este logro abre la puerta a nuevos diseños de NoCs de alto rendimiento con predecibilidad en el tiempo. Como contribución final, construimos una taxonomía de NoCs basadas en TDM con propiedades de tiempo real. Con esta taxonomía realizamos un análisis exhaustivo para estudiar y comparar desde tiempos de respuesta, a implementaciones con bajo coste, pasando por soluciones de compromiso para diseños de NoCs de tiempo real. Como resultado, obtenemos nuevos diseños de NoCs basadas en TDM. / [CA] La constant necessitat d'un major rendiment per a complir amb la gran demanda de potència de còmput de les noves aplicacions, (ex. sistemes de conducció autònoma), obliga la indústria a apostar per la tecnologia basada en Sistemes en Xip amb Processadors Multinucli (MPSoCs) en els seus sistemes embeguts de seguretat-crítica. Els sistemes MPSoCs generalment inclouen una xarxa en el xip (NoC) per a interconnectar els nuclis de processament entre ells, amb la memòria i amb la resta de recursos compartits. Desafortunadament, l'ús de les NoCs dificulta aconseguir la predictibilitat en el temps, ja que poden aparéixer conflictes en molts punts i de forma distribuïda a nivell de xarxa. Per a afrontar aquest problema, en aquesta tesi es proposa un nou paradigma de disseny per a NoCs de temps real on els conflictes en la xarxa són eliminats per disseny. Aquest nou paradigma parteix del Graf de Dependència de Canals (CDG) per a evitar els conflictes de xarxa de manera determinista. La nostra solució és capaç d'injectar missatges de mra natural fent ús d'un període TDM igual al límit teòric òptim sense la necessitat de fer ús d'un procés offline exigent computacionalment. La xarxa s'ha integrat en un sistema multinucli basat en tiles i adaptat a la seua jerarquia de memòria. Com a segona contribució principal, proposem un nou planificador dinàmic i distribuït capaç d'aconseguir un rendiment pic molt pròxims a les NoC basades en un disseny wormhole sense comprometre les seues garanties de temps real. El planificador es basa en el nostre disseny de xarxa per a explotar les seues propietats clau. Els resultats de la nostra NoC mostren que el nostre disseny garanteix la predictibilitat en el temps evitant interferències en la xarxa entre múltiples aplicacions executant-se concurrentment. La xarxa sempre garanteix el rendiment i també millora el rendiment respecte al de les xarxes wormhole en una xarxa 4 x 4 en un factor de 3,7x quan s'injecta trafic per a generar interferències. En una xarxa 8 x 8 les diferències són fins i tot majors. A més, la xarxa obté un estalvi d'àrea total del 10,79% front una implementació bàsica d'una xarxa wormhole. El planificador proposat aconsegueix una millora de rendiment de 6,9x i 14,4x front la versió bàsica de la xarxa DCFNoC per a xarxes en forma de malla de 16 i 64 nodes, respectivament. Quan ho comparem amb un commutador estàndard wormhole es preserva un rendiment de xarxa del 95% al mateix temps que preserva la estricta predictibilitat en el temps. Aquest assoliment obri la porta a nous dissenys de NoCs d'alt rendiment amb predictibilitat en el temps. Com a contribució final, construïm una taxonomia de NoCs basades en TDM amb propietats de temps real. Amb aquesta taxonomia realitzem una anàlisi exhaustiu per a estudiar i comparar des de temps de resposta, a implementacions amb baix cost, passant per solucions de compromís per a dissenys de NoCs de temps real. Com a resultat, obtenim nous dissenys de NoCs basades en TDM. / [EN] The ever need for higher performance to cope with the high computational power demands of new applications (e.g autonomous driving systems), forces industry to support technology based on multi-processors system on chip (MPSoCs) in their safety-critical embedded systems. MPSoCs usually include a network-on-chip (NoC) to interconnect the cores between them and, with memory and the rest of shared resources. Unfortunately, the inclusion of NoCs difficults achieving time predictability as network-level conflicts may occur in many points in a distributed manner. To overcome this problem, this thesis proposes a new time-predictable NoC design paradigm where conflicts within the network are eliminated by design. This new paradigm builds on top of the Channel Dependency Graph (CDG) in order to deterministically avoid network conflicts. Our solution is able to naturally inject messages using a TDM period equal to the optimal theoretical bound without the need of using a computationally demanding offline process. The network is integrated in a tile-based manycore system and adapted to its memory hierarchy. As a second main contribution, we propose a novel distributed dynamic scheduler that is able to achieve peak performance close to a wormhole-based NoC design without compromising its real-time guarantees. The scheduler builds on top of our NoC design to exploit its key properties. The results of our NoC show that our design guarantees time predictability avoiding network interference among multiple running applications. The network always guarantees performance and also improves wormhole performance in a 4 x 4 setting by a factor of 3.7x when interference traffic is injected. For a 8 x 8 network differences are even larger. In addition, the network obtains a total area saving of 10.79% over a standard wormhole implementation. The proposed scheduler achieves an overall throughput improvement of 6.9x and 14.4x over a baseline conflict-free NoC for 16 and 64-node meshes, respectively. When compared against a standard wormhole router 95% of its network throughput is preserved while strict timing predictability is kept. This achievement opens the door to new high performance time predictable NoC designs. As a final contribution, we build a taxonomy of TDM-based NoCs with real-time properties. With this taxonomy we perform a comprehensive analysis to study and compare from response time specific, to low resource implementation cost, through trade-off solutions for real-time NoCs designs. As a result, we derive new TDM-based NoC designs. / Picornell Sanjuan, T. (2021). Conflict-Free Networks on Chip for Real Time Systems [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/177347

Cooperative relay communication is a promising means of wireless communication in which cooperation is used to create a virtual transmit array between the source and the destination, thereby providing spatial diversity for combating the fading channel. In this thesis we develop cooperative communication protocols namely the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The code construction is based on Cyclic Division Algebras. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.

This thesis consists of two parts addressing two different problems in fading channels. The first part deals with asynchronous cooperative relay communication. The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In this work we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding Diversity-Multiplexing Tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound on DMT for all multiplexing gains and for number of relays N ≥ 2. The distributed space-time codes for all the protocols considered are based on Cyclic Division Algebras (CDA). The second part of the work addresses the DMT analysis of diversity embedded codes for MIMO channels. Diversity embedded codes are high rate codes that are designed so that they have a high diversity code embedded within them. This allows a form of opportunistic communication depending on the channel conditions. The high diversity code ensures that at least a part of the information is received reliably, whereas the embedded high rate code allows additional information to be transferred if the channel is good. This can be thought of coding the data into two streams: high priority and low priority streams so that the high priority stream gets a better reliability than the lower priority stream. We show that superposition based diversity embedded codes in conjunction with naive single stream decoding is sub-optimal in terms of the DM tradeoff. We then construct explicit diversity embedded codes by the superposition of approximately universal space-time codes from CDAs. The relationship between broadcast channels and the diversity embedded setting is then utilized to provide some achievable Diversity Gain Region (DGR) for MIMO broadcast Channels.

It has been historically assumed that most of the uncertainty associated with the aerosol indirect effect on climate can be attributed to the unpredictability of updrafts. We assess the sensitivity of cloud droplet number density to realistic variations in aerosol chemical properties and to variable updraft velocities using a 1-dimensional cloud parcel model. The results suggest that aerosol chemical variability may be as important to the aerosol indirect effect as the effect of unresolved cloud dynamics, especially in polluted environments. We next used a continuous flow streamwise thermal gradient Cloud Condesnation Nuclei counter (CCNc) to study the water-uptake properties of the ambient aerosol, by exposing an aerosol sample to a controlled water vapor supersaturation and counting the resulting number of droplets. The heat transfer properties and droplet growth within the CCNc were first modeled and experimentally characterized. We describe results from the MIRAGE field campaign at a ground-based site during March, 2006. Size-resolved CCN activation spectra and hygroscopic growth factor distributions of the ambient aerosol in Mexico City were obtained, and an analytical technique was developed to quantify a probability distribution of solute volume fractions for the CCN, as well as the aerosol mixing-state. The CCN were shown to be much less CCN active than ammonium sulfate, with water uptake properties more consistent with low molecular weight organic compounds. We also describe results from the GoMACCS field study, an airborne field campaign in Houston, Texas during August-September, 2006. GoMACCS tested our ability to predict CCN for highly polluted conditions with limited chemical information. Assuming the particles were composed purely of ammonium sulfate, CCN closure was obtained with a 10% overprediction bias on average for CCN concentrations ranging from less than 100 cm-3 to over 10,000 cm-3, but with on average 50% variability. Assuming measured concentrations of organics to be internally mixed and insoluble tended to reduce the overprediction bias for less polluted conditions, but led to underprediction bias in the most polluted conditions. Comparing the two campaigns, it is clear that the chemistry of the particles plays an important role in our ability to predict CCN concentrations.

The goal of this thesis is to describe the methods of visualization of the terrain relief, ranging from historical ways to current means, which employ software devices. It´s also to gather all available charts for the selected locality and perform an analysis of development of visualization of the terrain relief, which will be based on the collected data. Another goal was to compare the accuracy of the height scripts with the help of designed longitudinal profiles from obtained height script plans, the derived. State map in the scope of 1: 5000 and various map sources. Last at not least to explain the process of creation of the digital terrain model in ArcGIS software ? program.

Το αντικείµενο αυτής της διδακτορικής διατριβής είναι η σχεδίαση και η ανάλυση νέων αλγορίθµων υπολογισµού των κατανοµών ισχύος και πληροφορίας σε πολυκαναλικά συστήµατα τεχνολογίας ψηφιακών συνδροµητικών γραµµών DSL. Η αρχή λειτουργίας των πολυκαναλικών συστηµάτων βασίζεται στη διαίρεση του συνολικού φάσµατος σε επιµέρους υποκανάλια χαµηλού ρυθµού µετάδοσης, τα οποία µεταφέρουν τη συνολική πληροφορία µέσω ειδικών τεχνικών διαµόρφωσης. Ο υπολογισµός των κατανοµών της ισχύος εκποµπής και της πληροφορίας στα υποκανάλια του συστήµατος βασίζεται σε αλγορίθµους που είναι γνωστοί µε τον όρο αλγόριθµοι bit-loading. Η πλειοψηφία των αλγορίθµων bit-loading που χρησιµοποιούνται σήµερα είναι αλγόριθµοι ενός χρήστη, δηλαδή εκτελούνται στο δέκτη της γραµµής ενδιαφέροντος, χωρίς να λαµβάνουν υπόψη τα χαρακτηριστικά των πηγών θορύβου (π.χ. παρεµβολή διαφωνίας από γειτονικά συστήµατα στην ίδια δέσµη), παρά µόνο το αποτέλεσµα αυτών (µείωση του λόγου σήµατος-προς- θόρυβο). Για τα πολυκαναλικά συστήµατα ορίζονται δύο βασικές κατηγορίες προβληµάτων bitloading: το πρόβληµα µεγιστοποίησης του ρυθµού µετάδοσης για δεδοµένη ισχύ εκποµπής και το πρόβληµα ελαχιστοποίησης της συνολικής ισχύος για δεδοµένο ρυθµό µετάδοσης. Σε κάθε περίπτωση ένα σύνολο από περιορισµούς (π.χ. µέγιστη ισχύς ανά υποκανάλι, ακέραιες τιµές στην κατανοµή της πληροφορίας) ορίζουν τη βέλτιστη λύση, η οποία ικανοποιεί όλες τις συνθήκες. Οι αλγόριθµοι που έχουν προταθεί βασίζονται σε µεθόδους τύπου greedy bit-filling, οι οποίες υπολογίζουν τη βέλτιστη λύση µε ακέραιες τιµές στην κατανοµή πληροφορίας, και σε µεθόδους τύπου water-filling, οι οποίες οδηγούν σε λύση µε πραγµατικές τιµές στην κατανοµή πληροφορίας, οπότε η τελική “ηµι-βέλτιστη” λύση προκύπτει µε κατάλληλη διακριτοποίηση. Η ραγδαία εξάπλωση των συνδέσεων DSL, καθώς και η ανάγκη για παροχή υψηλότερων ρυθµών µετάδοσης έχει οδηγήσει την επιστηµονική και βιοµηχανική κοινότητα στη διερεύνηση µεθόδων για τη διαχείριση ολόκληρου του φάσµατος µιας δέσµης αγωγών µε στόχο τη βελτιστοποίηση της απόδοσης του συνολικού δικτύου. Ο σηµαντικότερος παράγοντας που περιορίζει τον προσφερόµενο ρυθµό µετάδοσης στα συστήµατα DSL είναι ο θόρυβος διαφωνίας µεταξύ γειτονικών συστηµάτων που λειτουργούν στην ίδια δέσµη. Στα πλαίσια αυτά ανήκει και η σχεδίαση κεντρικών αλγορίθµων bit-loading πολλών χρηστών, µε στόχο τον υπολογισµό των βέλτιστων κατανοµών όλων των συνδέσεων της δέσµης, ώστε να ελαχιστοποιούνται οι συνολικές παρεµβολές διαφωνίας. Σε αντίθεση µε τους αλγορίθµους ενός χρήστη, η διατύπωση του προβλήµατος bit-loading της δέσµης απαιτεί τη γνώση των συναρτήσεων διαφωνίας, ώστε να ορισθεί η αλληλεπίδραση µεταξύ των σηµάτων στις επιµέρους γραµµές. Οι αλγόριθµοι bit-loading πολλών χρηστών που έχουν παρουσιαστεί µέχρι σήµερα βασίζονται στις αρχές λειτουργίας των µεθόδων ενός χρηστή και θεωρούν ότι οι συναρτήσεις διαφωνίας είναι γνωστές. Για τον υπολογισµό των τελευταίων οι τεχνικές που συναντώνται στη βιβλιογραφία δεν εκτελούνται στις διατάξεις µετάδοσης, αλλά βασίζονται στη συλλογή και επεξεργασία σηµάτων σε εξωτερικά συστήµατα. Στα πλαίσια της διδακτορικής διατριβής έγινε ανάλυση των πολυκαναλικών συστηµάτων δέσµης ψηφιακών συνδροµητικών γραµµών (τεχνολογίας ADSL) και προτάθηκαν νέοι αλγόριθµοι bit-loading ενός χρήστη και πολλών χρηστών. Ειδικότερα, παρουσιάζονται λύσεις που αφορούν τα παρακάτω θέµατα: 􀂃 Ανάπτυξη νέου ταχύ αλγόριθµου bit-loading ενός χρήστη. Ο νέος αλγόριθµος επιλύει το πρόβληµα ελαχιστοποίησης της συνολικής ισχύος εκποµπής για δεδοµένο ρυθµό µετάδοσης και ανήκει στην κατηγορία των βέλτιστων αλγορίθµων. 􀂃 ∆ιερεύνηση της απόδοσης συστηµάτων δέσµης συνδροµητικών γραµµών, ως προς την εκµετάλλευση της συνολικής χωρητικότητας της δέσµης, όταν εφαρµόζεται αυτόνοµη διαχείριση του φάσµατος σε κάθε σύνδεση µέσω αλγορίθµων bit-loading ενός χρήστη. 􀂃 Ανάπτυξη νέου κεντρικού αλγόριθµου bit-loading πολλών χρηστών. Ο νέος αλγόριθµος αντιµετωπίζει το πρόβληµα της ανισοκατανοµής των ρυθµών µετάδοσης µεταξύ των συνδέσεων µιας δέσµης, εξ αιτίας της µη κεντρικής διαχείρισης του φάσµατος. 􀂃 Ανάπτυξη νέας µεθόδου για την αναγνώριση των συναρτήσεων διαφωνίας µεταξύ των αγωγών µιας δέσµης συνδροµητικών γραµµών. Η νέα µέθοδος εκτελείται στις διατάξεις µετάδοσης και βασίζεται σε κυκλώµατα επεξεργασίας πραγµατικού χρόνου. Οι νέοι αλγόριθµοι που προτείνονται αποτελούν πρωτότυπες λύσεις στην περιοχή των ψηφιακών επικοινωνιών για πολυκαναλικά συστήµατα µετάδοσης και βασίζονται σε µεθόδους, οι οποίες παρουσιάζουν συγκριτικά πλεονεκτήµατα µε άλλες υφιστάµενες λύσεις. Ειδικότερα: 􀂃 Ο νέος αλγόριθµος bit-loading ενός χρήστη υπολογίζει τη βέλτιστη λύση µε όλους τους περιορισµούς του συστήµατος επικοινωνίας, σε αντίθεση µε άλλους αλγορίθµους που υποστηρίζουν µόνο µέρος των περιορισµών. Επιπλέον, εµφανίζει µικρή πολυπλοκότητα και µεγάλη ταχύτητα εκτέλεσης συγκριτικά µε άλλες µεθόδους. 􀂃 Η διερεύνηση των συστηµάτων δέσµης, ως προς τη µεγιστοποίηση των ρυθµών µετάδοσης όταν δεν εφαρµόζεται κεντρική διαχείριση του φάσµατος, αναδεικνύει το πρόβληµα της ανισοκατανοµής της συνολικής χωρητικότητας στις επιµέρους συνδέσεις. 􀂃 Ο νέος κεντρικός αλγόριθµος bit-loading πολλών χρηστών αντιµετωπίζει το πρόβληµα της µη δίκαιης κατανοµής των ρυθµών µετάδοσης και ταυτόχρονα εξασφαλίζει ένα ελάχιστο περιθώριο µείωσης του λόγου σήµατος-προς-θόρυβο σε κάθε σύνδεση. 􀂃 Η νέα µέθοδος αναγνώρισης των συναρτήσεων διαφωνίας εκτελείται στις συσκευές µετάδοσης σε πραγµατικό χρόνο σε αντίθεση µε άλλες µεθόδους, οι οποίες εκτελούνται σε εξωτερικά συστήµατα µετρήσεων, και βασίζεται σε µια νέα µέθοδο εκτίµησης και αναγνώρισης των σηµάτων παρεµβολής. / The objective of this dissertation is the development of new algorithms for the calculation of the power and rate distributions in multicarrier systems with application in the Asymmetric Digital Subscriber Line (ADSL) technology. In multicarrier systems the spectrum is divided into narrowband subchannels and the total data-load is transmitted by modulating a set of independent subcarriers. The allocation of the total rate and power into the subchannels is based on bit-loading algorithms. The bit-loading algorithms used in multicarrier modems are mainly single-user algorithms: they do not take into account the decisions of the neighboring lines in the binder. In multicarrier systems two bit-loading problems are of main interest: rate-maximization subject to a total power constraint and margin-maximization subject to a given data rate. In both cases, a number of system constraints (e.g. power spectral density mask, integer bit values) determine the unique optimum solution. The bit-loading algorithms presented in the literature are based either on greedy methods, which provide the optimum discrete bit-allocation, or on water-filling methods, which in general provide non-integer bit-allocation. In this case, a final sub-optimum solution is provided using bit rounding. The rapid growth of the DSL users as well as the increasing demand for higher speed services has led the research and industry community in the investigation of methods for dynamic spectrum control of the modems operating in the same binder. In DSL systems, crosstalk interference induced by adjacent lines is one of the largest noise impairments that reduce the performance of services supported by the same binder. Therefore dynamic management incorporates methods for modem coordination and multi-user bit-loading in order to calculate the rate and power allocations of all activated lines, so that the total interference is reduced for a common global-binder benefit. In contrast to the single-user case, the formulation of the multi-user bit-loading problem requires the knowledge of the crosstalk transfer functions between the lines of the binder. The multi-user bitloading algorithms presented in the literature assume that the crosstalk transfer functions are known. In addition, the methods presented for crosstalk identification in DSL systems are based on data collection and processing in third-party systems. In this dissertation, the multicarrier system of an ADSL binder is studied and new single-user and multi-user bit-loading algorithms are developed. In particular, this dissertation presents solutions in the following problems: .. Development of a new computationally efficient single-user bit-loading algorithm. The proposed algorithm provides the optimum discrete solution to the margin-maximization problem. .. Investigation of the capacity and rate-region performance of ADSL binder systems when no overall spectrum control and no modem coordination are used (each modem performs single-user bit-loading). .. Development of a new multi-user bit-loading algorithm. The proposed algorithm resolves the problem of the non-uniform distribution of the achievable data rates experienced for a region of target-rate values, as a result of the no modem-coordination strategy. .. Development of a new crosstalk identification method for DSL binder systems. The proposed method is executed in the operating modems and is based on real time signal processing. This dissertation presents new algorithms which provide advantages compared to other solutions in the multicarrier DSL technology. In particular: .. The new single-user bit-loading algorithm provides the optimum discrete solution under the complete set of system constraints, in contrast to other solutions that consider only a subset of constraints. Moreover, the new algorithm is of low computational complexity compared with other methods. .. The investigation of the rate-region performance of ADSL binder systems under no overall spectrum control reports the problem of the non-uniform distribution of the achievable data rates. This “unfairness” is experienced as a result of the no modemcoordination strategy. .. The new multi-user bit-loading algorithm resolves the problem of the non-uniform distribution of the achievable data rates and guarantees a minimum SNR margin for each activated link in the binder. .. The new crosstalk identification method is based on a new technique for estimating the interference signals and is executed in the operating modems using real-time signal processing, in contrast to other methods which are executed in third-party systems.