O objetivo principal deste trabalho é apresentar um modelo de análise probabilística do comportamento ao longo do tempo de estruturas de concreto. Para isso, é realizada a análise probabilística em conjunto com análise numérica. A análise numérica é realizada através de um programa computacional, baseado no método dos elementos finitos, que considera o comportamento não-linear e dependente do tempo dos materiais, assim como o processo evolutivo da construção. Para determinar o efeito das incertezas dos parâmetros é realizada uma análise probabilística, utilizando o método de amostragem por hipercubo latino. O modelo apresentado pode ser aplicado para a análise probabilística do comportamento ao longo do tempo das estruturas de concreto em geral. No entanto, foi aplicado na análise das flechas diferidas de lajes pré-moldadas formadas por vigotas com armação treliçada. Com esta análise, pôde-se propor um coeficiente multiplicador das flechas imediatas para a avaliação das flechas diferidas no tempo. O coeficiente multiplicador obtido para as lajes pré-moldadas formadas por vigotas com armação treliçada pode alcançar valores muito superiores ao fator 'alfa'f recomendado pela NBR 6118 (2003) para o caso de vigas de concreto armado. / The goal of this research is to present a probabilistic analysis model of the long-term behavior of concrete structures. For that, the probabilistic analysis is carried out together with numerical analysis. The numerical analysis is carried out using a software based on the finite element method that takes into account the nonlinear and time dependent behavior of the materials, as well as the evolutionary construction process. A probabilistic analysis is carried out in order to determine the effects of the uncertainties of the parameters, using latin hypercube sampling method. The presented model can be applied in the probabilistic analysis of the long-term behavior of concrete structures in general. However, it was applied in the analysis of the long-term deflections of precast slabs made by joist with lattice reinforcement. By this analysis, a multiplier coefficient of immediate deflections to evaluate long-term deflections could be proposed. The multiplier coefficient obtained for precast slabs made by joist with lattice reinforcement can reach values much higher than the factor 'alfa'f recommended by NBR 6118 (2003) for the case of reinforced concrete beams.

This thesis deals with organization of a long-term school trip, which means organization of a sojourn for primary school pupils in surrounding which is beneficial to pupils' health while their education is not interrupted. The theoretical part of this thesis is focused on those law regulations, which have to be followed in the process of organizing a long-term school trip and during the time the event is taking place. Basic concepts dealing with the organization of a long-term school trip are also defined in the theoretical part of this thesis. The practical part of this thesis is based on collecting data through a survey and dialogues with teachers. The aim of the survey and those dialogues is to find out the interest of primary school teachers who teach at schools located in Prague 1 and in Prague 2 in organizing a long- term school trip and to detect their experience which they have acquired by organizing long- school trips. KEYWORDS: organization, long-term school trip, administration, interest, pupil of primary school age, younger school age, sojourn, primary school

The purpose of this study was to assess the level of privacy among the elderly living in long-term nursing and communal facilities. The data was collected through a probability sampling at the Veterans Home of California in Barstow.

Le problème de coloration de graphe est un problème NP-complet particulièrement étudié, qui permet de modéliser de problèmes dans des domaines variés. Dans cette thèse, de nouveaux algorithmes exacts basés sur une étude de la structure du graphe sont proposés. Ce travail s'appuie sur l'algorithme « Total solutions Exact graph Coloring » (TexaCol) qui construit toutes les solutions en exploitant l'ensemble des cliques d'un graphe. Deux algorithmes exacts, « Partial best solutions Exact graph Coloring » (PexaCol) et « All best solutions Exact graph Coloring » (AexaCol), sont présentés ici pour construire certaines solutions optimales ou toutes les meilleures solutions. Ces deux algorithmes utilisent la méthode de backtracking, dans laquelle ils ne choisissent que les sous-ensembles de meilleurs solutions pour continuer la coloration. L’analyse de résultat montre que PexaCol et AexaCol sont capables de traiter des graphes plus grands que TexaCol. Mais surtout, AexaCol trouve toutes les meilleures solutions significativement plus vite que TexaCol ainsi que le solveur Gurobi, qui sont utilisés comme référence.La téléphonie mobile est un domaine en plein essor qui peut s'appuyer sur une modélisation à base de graphes. Actuellement, les techniques de type « Device-to-Device » (D2D) prennent une place importante dans les réseaux mobiles. L’allocation de ressource constitue l'un des principaux problèmes en matière de performance. Pour assigner efficacement une ressource radio à une paire D2D dans le système Long-Term Evolution (LTE), un schéma systématique d'allocation de ressources est proposé dans cette thèse. Il est basé sur une clusturisation des liens D2D, et permet de prendre en compte à la fois l'allocation inter-cluster et intra-cluster des ressources. En déterminant les zones d'interférence, le problème d'allocation des ressources inter-cluster est formulé comme un problème de coloration de graphe dynamique. Un algorithme de coloration de graphe dynamique est ainsi proposé, basé sur PexaCol. Cet algorithme peut assigner les ressources radio aux clusters qui sont générés ou supprimés dynamiquement. L’analyse numérique montre que cet algorithme assure une bonne performance en termes d'utilisation des ressources, de temps d’exécution et d'adaptabilité. Concernant le problème d’allocation de ressources inter-cluster, une méthode fondée sur la topologie est proposée, intégrant naturellement l'allocation de puissance et l’allocation de Resource Block (RB). Pour simplifier ce problème d'allocation de ressources, la meilleure topologie est choisie à chaque étape, celle qui permet d'obtenir le meilleur débit en utilisant le moins de RBs. A partir de ce procédé, quatre algorithmes d'optimisation sont proposés: l’algorithme glouton statique, PexaCol statique, PexaCol dynamique et PexaCol dynamique approximatif. L'analyse des résultats montre que pour les petits clusters, les versions statiques et dynamiques de PexaCol permettent d'obtenir un index d’optimisation maximal en choisissant la meilleure topologie locale pour chaque noeud. A l'opposé, les algorithmes "glouton statique" et "PexaCol dynamique approximatif" permettent d'obtenir une solution sous-optimale pour l'optimisation locale avec une complexité moindre. Pour les grands clusters, avec certaine séquence de la coloration, le PexaCol dynamique approximatif est mieux que l’algorithme glouton statique pour l’index d’optimisation pendant un temps d’exécution acceptable. / Graph coloring problem is a famous NP-complete problem, which has extensive applications. In the thesis, new exact graph coloring algorithms are researched from a graph structure point of view. Based on Total solutions Exact graph Coloring algorithm (TexaCol) which is capable of getting all coloring solution subsets for each subgraph, two other exact algorithms, Partial best solutions Exact graph Coloring algorithm (PexaCol) and All best solutions Exact graph Coloring algorithm (AexaCol), are presented to get multiple best solutions. These two algorithms utilize the backtracking method, in which they only choose the best solution subset each step to continue the coloring until partial or all best solutions are obtained. The result analysis shows that PexaCol and AexaCol can deal with larger graphs than TexaCol and especially, AexaCol runs much faster than TexaCol and the solver Gurobi to get all best solutions.Device-to-Device (D2D) is a promising technique for the future mobile networks, such as 5th generation wireless systems (5G), and the resource allocation is one of the most crucial problems for its performance. In order to efficiently allocate radio resource for D2D links in Long-Term Evolution (LTE) system, a systematic resource allocation scheme is proposed based on D2D clusters, including the inter-cluster resource allocation and the intra-cluster resource allocation. With the cluster interference range, the inter-cluster resource allocation problem is formulated as a dynamic graph coloring problem, and a dynamic graph coloring algorithm is designed based on PexaCol. This algorithm is able to allocate radio resource to clusters while they are dynamically generated and deleted. The numerical analysis results show that this algorithm has good performance in resource utilization, runtime and scalability.For the intra-cluster resource allocation problem, a topology-based resource allocation method is designed naturally combining power allocation with Resource Block (RB) allocation. To simplify this associated optimization problem, a local optimal method is proposed, in which the best topology is chosen each step achieving the maximal throughput with the minimum number of assigned RBs. With respect to this method, four algorithms are presented: static greedy, static PexaCol, dynamic PexaCol and dynamic PexaCol approximate. Result analysis shows that for small-scale clusters, static PexaCol and dynamic PexaCol are capable of getting a maximal optimization index by locally choosing the best topology for each node while static greedy and dynamic PexaCol approximate are able to get the suboptimal solution for the local optimization with much lower complexity. For large-scale clusters, giving certain treating sequences, the dynamic PexaCol approximate performs better than static greedy regarding the optimization index within an acceptable runtime.

Title from first page of PDF document. Includes bibliographical references (p. 20-21).

Thesis (M.Sc.)--Memorial University of Newfoundland, 2004. / Includes bibliographical references.

Synaptic plasticity is thought to be integral to learning and memory. The two most common forms of plasticity are long-term potentiation (LTP) and long-term depression (LTD), both of which can be supported either by presynaptic changes in transmitter release probability (Pr), or by postsynaptic changes in AMPA receptor number. It is generally thought that the induction of LTP and LTD at Schaffer-collateral synapses in the hippocampus depends on the activation of NMDA receptors (GluN). Recent studies, however, have demonstrated that both increases and decreases in Pr can be induced under blockade of postsynaptic GluN receptors, suggesting that the activation of postsynaptic GluN receptors by glutamate is only a strict requirement for postsynaptic plasticity. In this thesis, I therefore re-examined the role of glutamate in presynaptic plasticity. I used single synapse imaging along with electrophysiological and pharmacological techniques to independently manipulate and monitor the levels of glutamatergic signalling during synaptic activity. I discovered that glutamate is inhibitory and unnecessary for the induction of LTP at the presynaptic locus. My findings support a novel model of presynaptic plasticity in which the net activity-dependent changes in Pr at an active presynaptic terminal is jointly determined by two opposing processes that can be simultaneously active: 1) postsynaptic depolarization, which, via the activation of L-type voltage-gated Ca²⁺ channels, increases Pr by driving the synthesis and release of nitric oxide from neuronal dendrites and 2) glutamate release, which through the activation of presynaptic GluN receptors, decreases Pr. Computationally, this model suggests that plasticity functions to reduce prediction-errors that arise during synaptic activity, and, thereby offers a biologically plausible mechanism by which neuronal networks may optimize learning at the level of single synapses.

Submitted by Automação e Estatística (sst@bczm.ufrn.br) on 2018-04-11T20:06:38Z No. of bitstreams: 1 BrunoJacomeCavalcanti_TESE.pdf: 5397909 bytes, checksum: 5a245eec570a69adf8ca5d791aaddf70 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2018-04-16T20:46:19Z (GMT) No. of bitstreams: 1 BrunoJacomeCavalcanti_TESE.pdf: 5397909 bytes, checksum: 5a245eec570a69adf8ca5d791aaddf70 (MD5) / Made available in DSpace on 2018-04-16T20:46:19Z (GMT). No. of bitstreams: 1 BrunoJacomeCavalcanti_TESE.pdf: 5397909 bytes, checksum: 5a245eec570a69adf8ca5d791aaddf70 (MD5) Previous issue date: 2017-10-20 / A perfeita funcionalidade dos sistemas de comunicações de 3ª. e 4ª. gerações requerem, entre outras coisas, do conhecimento dos valores numéricos da predição das perdas de propagação dos sinais propagantes nos ambientes urbano, suburbano e rural. Portanto, o estudo das condições de propagação em um ambiente qualquer sempre será uma preocupação dos engenheiros projetistas. A análise e desenvolvimento de modelos robustos de predição de perdas de propagação em redes de comunicações Long Term Evolution (LTE) e Long Term Evolution Advanced (LTE-A) usando técnicas de Inteligência Artificial são realizadas neste trabalho. Os procedimentos metodológicos empregados foram aplicados no melhoramento da predição dos modelos de perda de propagação empíricos SUI, ECC-33, Ericsson 9999, TR 36.942 e o modelo do Espaço Livre, aplicados em redes LTE e LTE-A nas frequências de 800 MHz, 1800 MHz e 2600 MHz, para ambientes suburbanos em cidades de porte médio do nordeste do Brasil. Assim, nesta tese propõem-se dois modelos de Redes Neurais Artificiais (RNA): (i) o modelo de rede neural com entradas baseadas em erro (RNBE), utilizando como principal alimentador da rede o erro entre dados medidos e simulados, e, (ii) o modelo de rede neural com entradas baseadas no terreno (RNBT). O desempenho desses modelos foram comparados com os modelos de propagação considerados no trabalho e também as versões otimizadas utilizando Algoritmos Genéticos (AG) e o Método dos Mínimos Quadrados (LMS). Também foram realizadas comparações com valores medidos, obtidos a partir de uma campanha de medição realizada na cidade de Natal, Estado do Rio Grande do Norte. Os resultados finais obtidos através de simulações e medições apresentaram boas concordâncias métricas, com destaque para a performance do modelo RNBE. A principal contribuição dessa tese é que, ao utilizar essas técnicas que fazem uso de maneira mais eficiente dos modelos de propagação empíricos, pode-se estimar sinais propagantes realistas, evitando erros no planejamento e implementações de redes sem fio LTE e LTE-A em áreas suburbanas. / The perfect functionality of the 3rd and 4th generation of wireless systems requires, among other parameters, knowledge of the numerical values of the prediction of loss of propagation of propagation signals in urban, suburban and rural environments. Therefore, the study of propagation conditions in any environment will always be a concern of design engineers. The analysis and development of robust propagation loss prediction models in Long Term Evolution (LTE) and Long Term Evolution Advanced (LTE-A) communications networks using Artificial Intelligence techniques is performed in this work. The methodologies used were applied to improve the prediction of loss of empirical propagation SUI, ECC-33, Ericsson 9999, TR 36.942 models and the Free Space model applied in LTE and LTE-A networks in the frequencies of 800 MHz, 1800 MHz and 2600 MHz, for suburban environments in mid-sized cities in northeastern Brazil. Thus, in these thesis two models of Artificial Neural Networks (RNA) are proposed: (i) the neural network model with inputs based on error (RNBE) using as main feeder of the network the error between measured and simulated data, and (ii) the neural network model with land-based inputs (RNBT). The performance of these models was compared with the models of propagation considered in the work and also the versions optimized using Genetic Algorithms (AG) and the Least Square Method (LMS). Comparisons were also made with measured values, obtained from a measurement campaign carried out in the city of Natal, state of Rio Grande do Norte. The final results obtained through simulations and measurements presented good metric concordances, with emphasis on the performance of the RNBE model. Thus, the main contribution of this thesis is that, by using these techniques that make more efficient use of empirical propagation models, we can estimate realistic propagation signals, avoiding errors in the planning and implementations of LTE and LTE- A wireless networks in suburban areas.

Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-08-27T11:17:25Z No. of bitstreams: 2 Dissertação - Dalton Foltran de Souza - 2018.pdf: 3869661 bytes, checksum: 5fa93e5e35c983cbefa148826a07a3ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-08-27T11:20:32Z (GMT) No. of bitstreams: 2 Dissertação - Dalton Foltran de Souza - 2018.pdf: 3869661 bytes, checksum: 5fa93e5e35c983cbefa148826a07a3ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-08-27T11:20:32Z (GMT). No. of bitstreams: 2 Dissertação - Dalton Foltran de Souza - 2018.pdf: 3869661 bytes, checksum: 5fa93e5e35c983cbefa148826a07a3ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-07-04 / With the development of the next generation of mobile communications systems for 5G, several technologies are being studied aiming to reach the new requirements in new application scenarios. Among them, is the use of new modulations with higher spectral efficiency in substitution of OFDM, such as F-OFDM and UFMC, and also the scheduling algorithms which are in charge of sharing resources between users. In this work, we evaluated the application of F-OFDM and UFMC, 5G modulations candidates, on downlink LTE compared with OFDM and evaluated the schedulers Round Robin, QoS Guaranteed and PSO dealing with additional resources provided by the tested modulations. For that, we compared performance considering parameters like fairness, latency, throughput and spectral efficiency. The results showed that the downlink LTE improved performance in all evaluated parameters with UFMC modulation. In fact, there were a performance improvement in all schedulers evaluated. For example, PSO based scheduler improved latency and throughput while QoS Guaranteed reached the lowest loss, as the highest fairness were reached by QoS Guaranteed and Round Robin. Also, we propose a scheduling algorithm that takes into account the queue size in the user buffer and channel quality to maximize throughput and fairness in the LTE downlink network. The metrics evaluated were transmission efficiency, throughput, fairness, delay and losses. The proposed algorithm achieved better results for all evaluated metrics. / Com o desenvolvimento da próxima geração dos sistemas de comunicação móvel sem fio (5G) diversas tecnologias estão sendo estudadas com o objetivo de se atender aos novos requisitos de desempenho em diferentes cenários de aplicação. Dentre elas, está a utilização de modulações com maior eficiência espectral em substituição à OFDM, como F-OFDM e UFMC, como também os algoritmos de escalonamento que são responsáveis pelo compartilhamento dos recursos aos usuários. Neste trabalho, avaliamos a aplicação no downlink LTE das modulações F-OFDM e UFMC, candidatas ao 5G, comparadas a OFDM e avaliamos os escalonadores Round Robin, QoS Garantido e PSO ao lidar com recursos adicionais disponíveis proporcionados pelas modulações estudadas. Para tal, realizamos a análise de parâmetros de desempenho de tráfego, tais como vazão, índice de justiça, perda de dados e retardo médio. Os resultados mostraram que o enlace de descida do LTE apresentou melhor desempenho para todos os parâmetros analisados com a modulação UFMC. De fato, foram obtidas melhorias de desempenho para todos escalonadores avaliados. Como exemplo, o escalonador baseado em PSO apresentou melhorias no retardo e vazão, enquanto o escalonador QoS Garantido obteve menor taxa de perda de dados, sendo que índices de justiça mais elevados foram obtidos para os escalonadores QoS Garantido e Round Robin. Ainda, propusemos um escalonador que considera o tamanho da fila no buffer e a qualidade de canal visando maximizar a vazão e o índice de justiça no downlink da rede LTE. As métricas avaliadas foram eficiência de transmissão, vazão, índice de justiça, retardo e perda de dados. O algoritmo proposto alcançou melhores resultados em todas as métricas avaliadas em relação aos outros algoritmos considerados.

O objetivo principal deste trabalho é apresentar um modelo de análise probabilística do comportamento ao longo do tempo de estruturas de concreto. Para isso, é realizada a análise probabilística em conjunto com análise numérica. A análise numérica é realizada através de um programa computacional, baseado no método dos elementos finitos, que considera o comportamento não-linear e dependente do tempo dos materiais, assim como o processo evolutivo da construção. Para determinar o efeito das incertezas dos parâmetros é realizada uma análise probabilística, utilizando o método de amostragem por hipercubo latino. O modelo apresentado pode ser aplicado para a análise probabilística do comportamento ao longo do tempo das estruturas de concreto em geral. No entanto, foi aplicado na análise das flechas diferidas de lajes pré-moldadas formadas por vigotas com armação treliçada. Com esta análise, pôde-se propor um coeficiente multiplicador das flechas imediatas para a avaliação das flechas diferidas no tempo. O coeficiente multiplicador obtido para as lajes pré-moldadas formadas por vigotas com armação treliçada pode alcançar valores muito superiores ao fator 'alfa'f recomendado pela NBR 6118 (2003) para o caso de vigas de concreto armado. / The goal of this research is to present a probabilistic analysis model of the long-term behavior of concrete structures. For that, the probabilistic analysis is carried out together with numerical analysis. The numerical analysis is carried out using a software based on the finite element method that takes into account the nonlinear and time dependent behavior of the materials, as well as the evolutionary construction process. A probabilistic analysis is carried out in order to determine the effects of the uncertainties of the parameters, using latin hypercube sampling method. The presented model can be applied in the probabilistic analysis of the long-term behavior of concrete structures in general. However, it was applied in the analysis of the long-term deflections of precast slabs made by joist with lattice reinforcement. By this analysis, a multiplier coefficient of immediate deflections to evaluate long-term deflections could be proposed. The multiplier coefficient obtained for precast slabs made by joist with lattice reinforcement can reach values much higher than the factor 'alfa'f recommended by NBR 6118 (2003) for the case of reinforced concrete beams.