Wir untersuchen globale dynamische Phänomene, die sich von dem Zusammenspiel zwischen Netzwerktopologie und Dynamik der einzelnen Elementen ergeben. Im ersten Teil untersuchen wir relativ kleine strukturierte Netzwerke mit überschaubarer Komplexität. Als geeigneter theoretischer Rahmen für erregbare Systeme verwenden wir das Kuramoto und Shinomoto Modell der sinusförmig-gekoppelten "aktiven Rotatoren" und studieren das Kollektivverhalten des Systems in Bezug auf Synchronisation. Wir besprechen die Einschränkungen, die durch die Netzwerktopologie auf dem Fluss im Phasenraum des Systems gestellt werden. Insbesondere interessieren wir uns für die Stabilitätseigenschaften von Fluss-invarianten Polydiagonalen und die Entwicklungen von Attraktoren in den Parameterräume solcher Systeme. Wir untersuchen zweidimensionale hexagonale Gitter mit periodischen Randbedingungen. Wir untersuchen allgemeine Bedingungen auf der Adjazenzmatrix von Netzwerken, die die Watanabe-Strogatz Reduktion ermöglichen, und diskutieren verschiedene Beispiele. Schließlich präsentieren wir eine generische Analyse der Bifurkationen, die auf der Untermannigfaltigkeit des Watanabe-Strogatz reduzierten Systems stattfinden. Im zweiten Teil der Arbeit untersuchen wir das globale dynamische Phänomen selbstanhaltender Aktivität (self-sustained activity / SSA) in neuronalen Netzwerken. Wir betrachten Netzwerke mit hierarchischer und modularer Topologie , umfassend Neuronen von verschiedenen kortikalen elektrophysiologischen Zellklassen. Wir zeigen, dass SSA Zustände mit ähnlich zu den experimentell beobachteten Eigenschaften existieren. Durch Analyse der Dynamik einzelner Neuronen sowie des Phasenraums des gesamten Systems erläutern wir die Rolle der Inhibierung. Darüber hinaus zeigen wir, dass beide Netzwerkarchitektur, in Bezug auf Modularität, sowie Mischung aus verschiedenen Neuronen, in Bezug auf die unterschiedlichen Zellklassen, einen Einfluss auf die Lebensdauer der SSA haben. / In this work we study global dynamical phenomena which emerge as a result of the interplay between network topology and single-node dynamics in systems of excitable elements. We first focus on relatively small structured networks with comprehensible complexity in terms of graph-symmetries. We discuss the constraints posed by the network topology on the dynamical flow in the phase space of the system and on the admissible synchronized states. In particular, we are interested in the stability properties of flow invariant polydiagonals and in the evolutions of attractors in the parameter spaces of such systems. As a suitable theoretical framework describing excitable elements we use the Kuramoto and Shinomoto model of sinusoidally coupled “active rotators”. We investigate plane hexagonal lattices of different size with periodic boundary conditions. We study general conditions posed on the adjacency matrix of the networks, enabling the Watanabe-Strogatz reduction, and discuss different examples. Finally, we present a generic analysis of bifurcations taking place on the submanifold associated with the Watanabe-Strogatz reduced system. In the second part of the work we investigate a global dynamical phenomenon in neuronal networks known as self-sustained activity (SSA). We consider networks of hierarchical and modular topology, comprising neurons of different cortical electrophysiological cell classes. In the investigated neural networks we show that SSA states with spiking characteristics, similar to the ones observed experimentally, can exist. By analyzing the dynamics of single neurons, as well as the phase space of the whole system, we explain the importance of inhibition for sustaining the global oscillatory activity of the network. Furthermore, we show that both network architecture, in terms of modularity level, as well as mixture of excitatory-inhibitory neurons, in terms of different cell classes, have influence on the lifetime of SSA.

"A distributed queueing Medium Access Control (MAC) protocol is used in Distributed Queue Dual Bus (DQDB) networks. A modified version of the MAC protocol was proposed by R.R. Pillai and U. Mukherji in an attempt to overcome some of the shortcomings of the DQDB MAC protocol. They analyzed the performance of the system for Bernoulli arrivals and for large propagation delays between the nodes. We extend the performance analysis of the modified MAC protocol for a DQDB type of Network. The parameter of interest to us is the bus access delay. This has two components, viz., the request bus access delay and the data bu6 access delay. We use the model at the request point at node and present methods to evaluate the delay experienced in such a model. The model is an n-priority ./D/l queue with D vacations (non-preemptive priority) where n is the number of nodes sending requests on the request bus for transmission on the data bus. The methods presented help to evaluate the request bus access delay when the arrivals at each node are Markovian Arrival Processes (MAPs). The algorithms for evaluating the mean request bus access delay are based on matrix geometric techniques. Thus, one can use the algorithms developed in the literature to solve for the finite buffers case too. This model, for the request bus access delay, holds irrespective of the propagation delay between the nodes. We also evaluate the inter-departure time of class 1 customers and virtual customers in a 2-priority M/G/l system with G vacations (non-preemptive priority). In the case of Poisson arrivals at all the nodes, we would have a 2-priority M/D/l system with D vacations (non-preemptive priority). We thus evaluate the inter-arrival time of the free slots on the data bus as seen by Node 2. Note that this is independent of the number of active nodes in the network We then develop methods to evaluate the mean data bus access delay experienced by the customers at Node 2 in a three-node network with 2 nodes communicating with the third when the propagation delay between the nodes is large. We consider the case of finite Local Queue buffers at the two nodes. Using this assumption we arrive at process of arrivals to the Combined Queue and the process of free slots on the data bus to be Markov Modulated Bernoulli processes. The model at the combined queue at Node 2 then has a Quasi Birth-Death evolution. Thus, this system is solved by using the Ramaswami-Latouche algorithm. The stationary probabilities are then used to evaluate the mean data bus access delay experienced at Node 2. The finite buffer case of this system can be solved by G.Wi Stewart's algorithm. The method in modelling the system and the results are presented in detail for Poisson arrivals. The extension of this to more complex processes is also explained. We encounter in the analysis an explosion of the state-space of the system. We try to counter this by considering approximations to the process of free slots on the data bus. The approximations considered are on the basis of what are known as Idealized Aggregates. The performance of the approximation is also detailed. It works very well under low and moderate load but underestimates the mean delay under heavy load. Thereafter, we discuss the performance of the system with reference to the mean of the access delay and the standard deviation of the access delay under varying traffic at the two nodes. For this part we use simulation results to discuss the performance. The comparison between the performance measures at both the nodes is also done. Then we develop methods/techniques to understand the performance of the system when we have finite propagation delays between the nodes. We concentrate on the 3-node problem and calculate performance bounds based on linear programs. This is illustrated in detail for Bernoulli arrivals for the case of 1 slot propagation delay between the nodes as well as for the case of 2 slots propagation delay. The performance of the bounds obtained is also detailed. The presence of an idling system at the combined queue of Node 2 makes the bounds somewhat loose. Finally, we discuss the performance of the system with reference to the mean access delay and the standard deviation of the access delay under varying load on the system. Again, we rely on simulation studies. Finally, we study the performance of the system as a multiplexer. For this, we re­strict the traffic to Markov Modulated Processes (or those which would satisfy the Gartner-Ellis Theorem requirements). The traffic is characterized by what are known as Envelope Processes - Lower and Upper. The class of processes which satisfy the conditions of the Gartner-Ellis theorem come under the category where both the Envelope Processes exist and the Minimum Envelope Rate and the Maximum Lower Envelope Rate are the same. We use the system evolution equations at the combined queue at any node to develop re­lations between the various input and output processes. First, this is done for a. system of this kind, in isolation. Then, we consider this system as a part of the modified protocol and present relations, among the various input and output processes, which are specific to the modified protocol. The possible use of all of the above to do Admission Control at the entry point to the Asynchronous Transfer Mode (ATM) network is also presented.

Self-consolidating concrete (SCC) has wide use for placement in congested reinforced concrete structures in recent years. SCC represents one of the most outstanding advances in concrete technology during the last two decades. In the current work a great deal of cognizance pertaining to mechanical properties of SCC and comparison of fracture characteristics of notched and unnotched beams of plain concrete as well as using acoustic emission to understand the localization of crack patterns at different stages has been done. An artificial neural network (ANN) is proposed to predict the 28day compressive strength of a normal and high strength of SCC and HPC with high volume fly ash. The ANN is trained by the data available in literature on normal volume fly ash because data on SCC with high volume fly ash is not available in sufficient quantity. Fracture characteristics of notched and unnotched beams of plain self consolidating concrete using acoustic emission to understand the localization of crack patterns at different stages has been done. Considering this as a platform, further analysis has been done using moment tensor analysis as a new notion to evaluate fracture characteristics in terms of crack orientation, direction of crack propagation at nano and micro levels. Analysis of B-value (b-value based on energy) is also carried out, and this has introduced to a new idea of carrying out the analysis on the basis of energy which gives a clear picture of results when compared with the analysis carried out using amplitudes. Further a new concept is introduced to analyze crack smaller than micro (could be hepto cracks) in solid materials. Each crack formation corresponds to an AE event and is processed and analyzed for crack orientation, crack volume at hepto and micro levels using moment tensor analysis based on energy. Cracks which are tinier than microcracks (could be hepto), are formed in large numbers at very early stages of loading prior to peak load. The volume of hepto and micro cracks is difficult to measure physically, but could be characterized using AE data in moment tensor analysis based on energy. It is conjectured that the ratio of the volume of hepto to that of micro could reach a critical value which could be an indicator of onset of microcracks after the formation of hepto cracks.

Air-borne ultrasonic transducers are optimised to achieve a maximal sound pressure in a frequency range around 100 kHz. Moreover, the radiation of a high acoustic power is desired, which requires a large transducer area. Within this dissertation the ultrasonic transducers are, therefore, optimised to operate in the resonance mode. Using this operating point the maximal force is fed into the transducer while it is charged with the lowest loss possible. Many applications of air-borne ultrasound need a sufficient bandwidth in addition to a high sound pressure, that s why the swinging mass of the transducer has to be minimised. For these reasons, air-borne capacitive and piezoelectric film transducers take centre stage of these examinations. New network models of the stripe membrane and the pre-stressed stripe plate are derived to optimise these ultrasonic transducers. Besides its mechanical tension and its bending stiffness, the new network model of the pre-stressed and pressure loaded stripe plate takes also the stiffness caused by the shape of the plate into account. The examined transducers achive a maximal piston velocity around 1 m/s. / Ultraschallwandler für Anwendungen in Luft werden zur Bereitstellung eines maximalen Schalldrucks im Frequenzbereich um 100 kHz optimiert. Sie sollen außerdem die Abstrahlung einer großen Schallleistung zulassen, was eine große Wandlerfläche voraussetzt. Deshalb werden in dieser Arbeit die Ultraschallsender für den Resonanzbetrieb optimiert, wo man die maximale Krafteinspeisung bei minimalen Verlusten einstellt. Viele Anwendungen von Ultraschall in Luft benötigen neben einem hohen Schalldruckpegel auch eine ausreichende Bandbreite, wozu die schwingende Masse der Wandler zu minimieren ist. Deshalb stehen kapazitive und piezoelektrische Folienwandler im Resonanzbetrieb im Vordergrund der Untersuchungen. Zur Optimierung dieser Ultraschallsender werden die Netzwerkmodelle der Streifenmembran und der gespannten Streifenplatte abgeleitet. Neben der mechanischen Spannung und der Biegesteifigkeit berücksichtigt das Netzwerkmodell der gespannten und statisch druckbelasteten Streifenplatte die Formversteifung. Die untersuchten Wandler erreichen eine maximale Kolbenschnelle um 1 m/s.

Made available in DSpace on 2011-05-04T12:36:24Z (GMT). No. of bitstreams: 0 Previous issue date: 2009 / Diversos fatores podem dificultar a caracterização acurada do perfil de umapopulação por amostragem. Se a característica que define a população é de difícil observação seja porque exige testes caros para detecção ou porque é uma característica de comportamento ilegal ou estigmatizado que dificulta a identificação, torna-se praticamente impossível aplicar os métodos clássicos de amostragem, pois não se pode definir uma base de amostragem (sampling frame). Populações desse tipo são conhecidas como populações ocultas, ou escondidas, e alguns exemplos comumente estudados são homens que fazem sexo com homens, trabalhadores do sexo e usuários de drogas. Essa dissertação discute a técnica de amostragem conhecida como Respondent-Driven Sampling (RDS), originalmente proposta por Heckathorn (1997), e que vem sendo amplamente utilizada na estimação de prevalências de doenças transmissíveis em populações ocultas. Esse método pertence à família de amostragens por bola-de-neve, na qual os elementos seguintes da amostra são recrutados a partir da rede de conhecidos dos elementos já presentes na amostra, formando as cadeias de referência. Com este método, além das informações individuais, é possível estudar também as relações entre os indivíduos. O recrutamento por bola de neve não gera uma amostra aleatória, e está sujeito às propriedades das redes sociais das populações em estudo, que deve mudar de lugar para lugar e potencialmente influenciar as medidas de prevalência geradas. As redes sociais são estruturas complexas, e compreender como que a amostragem RDS é influenciada por estas estruturas é um dos objetivos dessa dissertação. Além disso, se o interesse de um estudo epidemiológico é estimar a prevalência de uma doença transmissível, há de se considerar que muitas vezes a própria rede social pode estar correlacionada com as redes de transmissão, gerando potenciais dependências entre o processo de amostragem e a distribuição da variável desfecho. Essa dissertação teve por objetivo avaliar estimativas de prevalência geradas a partir de amostras obtidas com a utilização da metodologia RDS, considerando estruturas populacionais complexas, ou seja, populações com estruturas distintas de ligação entre os indivíduos e de disseminação de doenças. Para isso, foram realizados experimentos de simulação combinando quatro modelos geradores de redes sociais e quatro modelos de distribuição de casos infectados na população. Para cada uma, foram obtidas amostras utilizando RDS e as respectivas prevalências foram estimadas.Com os resultados encontrados, foi possível realizar uma avaliação tanto do RDS como forma de recrutamento, como o modelo proposto por Heckathorn (2002) para a ponderação e estimação de prevalências. Basicamente, três aspectos foram considerados nessa avaliação: 1. o tempo necessário para concluir a amostragem, 2. a precisão das estimativas obtidas, independente da ponderação, e 3. o método deponderação. De forma geral, o método apresentou bons resultados sob esses três aspectos, refletindo a possibilidade de sua utilização, ainda que exigindo cautela. Os achados apresentam-se limitados, pois são escassos os trabalhos que abordem essa metodologia e que permitam estabelecer comparações. Espera-se, no entanto,despertar o interesse para que outros trabalhos nessa linha sejam desenvolvidos. / Several factors may hamper the accurate characterization of a population. If the defining feature of the population is difficult to apply - either because it requires expensive tests for detection or because it is a stigmatized or illegal behavior that hinders the identification, it is virtually impossible to apply traditional methods for sampling, because sampling frame cannot be define. The latter are called “hidden populations”, and some examples are men who have sex with men, sexual workers and drug users. This dissertation focus on Respondent-Driven Sampling (RDS), a sampling method originally proposed by Heckathorn (1997), which has been widely used to estimate the prevalence of infectious diseases in hidden populations. RDS is a snowball sampling method, in which new elements for the sample are recruited from the network of the elements already present in the sample, forming reference chains. With this method, besides individual informations, it is also possible to study the relationships between individuals. Snowball sampling does not generate random samples, and its properties are likely to depend on the properties of the social networks underlying the recruitment process, which may change from place to place and potentially influence the measures of prevalence generated. Social networks are complex structures, and understanding how the different implementations of RDS sampling is influenced by these structures is one of the objectives of this dissertation. Moreover, if the interest of an epidemiological study is to estimate the prevalence of a disease, it is should be considered that very often, social network may be correlated with the transmission networks, generating potential dependencies between the process of sampling and distribution of outcome variable. The aim of this dissertation was to assess the behavior of prevalence estimators using RDS data in scenarios of populations organized in complex structures, i.e. Combinations of social networks structures and spreading patterns. To achieve that, theoretical experiments were performed using simulation models combining four generators of social networks and four models of distribution of infected cases in the population. For each one, samples were obtained using RDS and prevalence, estimated. Findings were used to evaluate RDS as a recruiting process itself, as well as Heckathorn’s (2002) model to estimate prevalences. Three aspects were considered in such analyses: 1. the time elapsed before obtaining the sample; 2. the accuracy of the estimates without taking in consideration the weighting strategies; and 3. the weighting strategy. Overall, RDS performed well in these three areas, showing it is a valid method to assess hidden populations, despite the fact its use should be made with the necessary caution. The interpretation of our findings was constrained by the scarcity of studies using the same methodology, what compromised the comparability of our findings. We hope, however, that our findings may foster the development of additional studies in this field.

Air-borne ultrasonic transducers are optimised to achieve a maximal sound pressure in a frequency range around 100 kHz. Moreover, the radiation of a high acoustic power is desired, which requires a large transducer area. Within this dissertation the ultrasonic transducers are, therefore, optimised to operate in the resonance mode. Using this operating point the maximal force is fed into the transducer while it is charged with the lowest loss possible. Many applications of air-borne ultrasound need a sufficient bandwidth in addition to a high sound pressure, that s why the swinging mass of the transducer has to be minimised. For these reasons, air-borne capacitive and piezoelectric film transducers take centre stage of these examinations. New network models of the stripe membrane and the pre-stressed stripe plate are derived to optimise these ultrasonic transducers. Besides its mechanical tension and its bending stiffness, the new network model of the pre-stressed and pressure loaded stripe plate takes also the stiffness caused by the shape of the plate into account. The examined transducers achive a maximal piston velocity around 1 m/s. / Ultraschallwandler für Anwendungen in Luft werden zur Bereitstellung eines maximalen Schalldrucks im Frequenzbereich um 100 kHz optimiert. Sie sollen außerdem die Abstrahlung einer großen Schallleistung zulassen, was eine große Wandlerfläche voraussetzt. Deshalb werden in dieser Arbeit die Ultraschallsender für den Resonanzbetrieb optimiert, wo man die maximale Krafteinspeisung bei minimalen Verlusten einstellt. Viele Anwendungen von Ultraschall in Luft benötigen neben einem hohen Schalldruckpegel auch eine ausreichende Bandbreite, wozu die schwingende Masse der Wandler zu minimieren ist. Deshalb stehen kapazitive und piezoelektrische Folienwandler im Resonanzbetrieb im Vordergrund der Untersuchungen. Zur Optimierung dieser Ultraschallsender werden die Netzwerkmodelle der Streifenmembran und der gespannten Streifenplatte abgeleitet. Neben der mechanischen Spannung und der Biegesteifigkeit berücksichtigt das Netzwerkmodell der gespannten und statisch druckbelasteten Streifenplatte die Formversteifung. Die untersuchten Wandler erreichen eine maximale Kolbenschnelle um 1 m/s.

No / A review is carried out on the characterisation and algorithmic implementation of an extended product-form approximation, based on the principle of maximum entropy (ME), for a wide class of arbitrary finite capacity open queueing network models (QNMs) with service and space priorities. A single server finite capacity GE/GE/1/N queue with R (R>1) distinct priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed batches and generalised exponential (GE) service times is analysed via entropy maximisation, subject to suitable GE-type queueing theoretic constraints, under preemptive resume (PR) and head-of-line (HOL) scheduling rules combined with complete buffer sharing (CBS) and partial buffer sharing (PBS) management schemes stipulating a sequence of buffer thresholds {N=(N1,¿,NR),0<Ni¿Ni¿1,i=2,¿,R}. The GE/GE/1/N queue is utilised, in conjunction with GE-type first two moment flow approximation formulae, as a cost-effective building block towards the establishment of a generic ME queue-by-queue decomposition algorithm for arbitrary open QNMs with space and service priorities under repetitive service blocking with random destination (RS-RD). Typical numerical results are included to illustrate the credibility of the ME algorithm against simulation for various network topologies and define experimentally pessimistic GE-type performance bounds. Remarks on the extensions of the ME algorithm to other types of blocking mechanisms, such as repetitive service blocking with fixed destination (RS-FD) and blocking-after-service (BAS), are included.

This thesis synthezises theories from intermedia studies, semiotics, Gestalt psychology, cognitive linguistics, cognitive psychology, cognitive poetics, reader response criticism, narratology and possible worlds-theories adjusted to literary studies. The aim is to provide a transdisciplinary explanatory model of the transaction between text and reader during the reading process resulting in the reader experiencing a mental, virtual world. Departing from Mitchells statement that all media are mixed media, this thesis points to Peirce’s tricotomies of different types of signs and to the relation between representamen (sign), object and interpretant, which states that the interpretant can be developed into a more complex sign, for example from a symbolic to an iconic sign. This is explained in cognitive science by the fact that our perceptions are multimodal. We can easily connect sounds and symbolic signs to images. Our brain is highly active in finding structures and patterns, matching them with structures already stored in memory. Cognitive semantics holds that such structures and schematic mental images form the basis for our understanding of concepts. In cognitive linguistics Lakoff and Johnsons theories of conceptual metaphors show that our bodily experiences are fundamental in thought and language, and that abstract thought is concretized by a metaphorical system grounded in our bodily, spatial experiences. Cognitive science has shown that we build situation models based on what the text describes. These mental models are simultaneously influenced by the reader’s personal world knowledge and earlier experiences. Reader response-theorists emphasize the number of gaps that a text leaves to the reader to fill in, using scripts. Eye tracking research reveals that people use mental imaging both when they are re-describing a previously seen picture and when their re-description is based purely on verbal information about a picture. Mental spaces are small conceptual packets constructed as we think and talk. A story is built up by a large number of such spaces and the viewpoint and focus changes constantly. There are numerous possible combinations and relations of mental spaces. For the reader it is important to separate them as well as to connect them. Mental spaces can also be blended. In their integration network model Fauconnier and Turner describe four types of blending, where the structures of the input spaces are blended in different ways. A similar act of separation and fusion is needed dealing with different diegetic levels and focalizations, the question of who tells and who sees in the text. Ryan uses possible worlds-theories from modal logic to describe fictional worlds as both possible and parallel worlds. While fictional worlds are comparable to possible worlds if seen as mental constructions created within our actual world, they must also be treated as parallel worlds, with their own actual, reference world from which their own logic stems. As readers we must recenter ourselves into this fictional world to be able to deal with states of affairs that are logically impossible in our own actual world. The principle of minimal departure states that during our recentering, we only make the adjustments necessary due to explicit statements in the text.

One of the major applications of wireless sensor networks is to sense accurate and reliable data from the physical environment with or without a priori knowledge of data statistics. To extract accurate data from the physical environment, we investigate spatial data correlation among sensor nodes to develop data accuracy models. We propose three data accuracy models namely Estimated Data Accuracy (EDA) model, Cluster based Data Accuracy (CDA) model and Distributed Cluster based Data Accuracy (DCDA) model with a priori knowledge of data statistics. Due to the deployment of high density of sensor nodes, observed data are highly correlated among sensor nodes which form distributed clusters in space. We describe two clustering algorithms called Deterministic Distributed Clustering (DDC) algorithm and Spatial Data Correlation based Distributed Clustering (SDCDC) algorithm implemented under CDA model and DCDA model respectively. Moreover, due to data correlation in the network, it has redundancy in data collected by sensor nodes. Hence, it is not necessary for all sensor nodes to transmit their highly correlated data to the central node (sink node or cluster head node). Even an optimal set of sensor nodes are capable of measuring accurate data and transmitting the accurate, precise data to the central node. This reduces data redundancy, energy consumption and data transmission cost to increase the lifetime of sensor networks. Finally, we propose a fourth accuracy model called Adaptive Data Accuracy (ADA) model that doesn't require any a priori knowledge of data statistics. ADA model can sense continuous data stream at regular time intervals to estimate accurate data from the environment and select an optimal set of sensor nodes for data transmission to the network. Data transmission can be further reduced for these optimal sensor nodes by transmitting a subset of sensor data using a methodology called Spatio-Temporal Data Prediction (STDP) model under data reduction strategies. Furthermore, we implement data accuracy model when the network is under a threat of malicious attack.