Network structures of Bis-GMA/TEGDMA resins differ in DC, shrinkage-strain, hardness and optical properties as a function of reducing agent

Objectives. To evaluate the influence of different tertiary amines on degree of conversion (DC), shrinkage-strain, shrinkage-strain rate, Knoop microhardness, and color and transmittance stabilities of experimental resins containing BisGMA/TEGDMA (3: 1 wt), 0.25wt% camphorquinone, 1wt% amine (DMAEMA, CEMA, DMPT, DEPT or DABE). Different light-curing protocols were also evaluated. Methods. DC was evaluated with FTIR-ATR and shrinkage-strain with the bonded-disk method. Shrinkage-strain-rate data were obtained from numerical differentiation of shrinkage-strain data with respect to time. Color stability and transmittance were evaluated after different periods of artificial aging, according to ISO 7491: 2000. Results were evaluated with ANOVA, Tukey, and Dunnett`s T3 tests (alpha = 0.05). Results. Studied properties were influenced by amines. DC and shrinkage-strain were maximum at the sequence: CQ < DEPT < DMPT <= CEMA approximate to DABE < DMAEMA. Both DC and shrinkage were also influenced by the curing protocol, with positive correlations between DC and shrinkage-strain and DC and shrinkage-strain rate. Materials generally decreased in L* and increased in b*. The strong exception was the resin containing DMAEMA that did not show dark and yellow shifts. Color varied in the sequence: DMAEMA < DEPT < DMPT < CEMA < DABE. Transmittance varied in the sequence: DEPT approximate to DABE < DABE approximate to DMPT approximate to CEMA < DMPT approximate to CEMA approximate to DMAEMA, being more evident at the wavelength of 400 nm. No correlations between DC and optical properties were observed. Significance. The resin containing DMAEMA showed higher DC, shrinkage-strain, shrinkage-strain rate, and microhardness, in addition to better optical properties. (C) 2011 Academy of Dental Materials. Published by Elsevier Ltd. All rights reserved.

Artificial evolution on network structures : how time and space influence dynamics

Abstract The main objective of this work is to show how the choice of the temporal dimension and of the spatial structure of the population influences an artificial evolutionary process. In the field of Artificial Evolution we can observe a common trend in synchronously evolv¬ing panmictic populations, i.e., populations in which any individual can be recombined with any other individual. Already in the '90s, the works of Spiessens and Manderick, Sarma and De Jong, and Gorges-Schleuter have pointed out that, if a population is struc¬tured according to a mono- or bi-dimensional regular lattice, the evolutionary process shows a different dynamic with respect to the panmictic case. In particular, Sarma and De Jong have studied the selection pressure (i.e., the diffusion of a best individual when the only selection operator is active) induced by a regular bi-dimensional structure of the population, proposing a logistic modeling of the selection pressure curves. This model supposes that the diffusion of a best individual in a population follows an exponential law. We show that such a model is inadequate to describe the process, since the growth speed must be quadratic or sub-quadratic in the case of a bi-dimensional regular lattice. New linear and sub-quadratic models are proposed for modeling the selection pressure curves in, respectively, mono- and bi-dimensional regu¬lar structures. These models are extended to describe the process when asynchronous evolutions are employed. Different dynamics of the populations imply different search strategies of the resulting algorithm, when the evolutionary process is used to solve optimisation problems. A benchmark of both discrete and continuous test problems is used to study the search characteristics of the different topologies and updates of the populations. In the last decade, the pioneering studies of Watts and Strogatz have shown that most real networks, both in the biological and sociological worlds as well as in man-made structures, have mathematical properties that set them apart from regular and random structures. In particular, they introduced the concepts of small-world graphs, and they showed that this new family of structures has interesting computing capabilities. Populations structured according to these new topologies are proposed, and their evolutionary dynamics are studied and modeled. We also propose asynchronous evolutions for these structures, and the resulting evolutionary behaviors are investigated. Many man-made networks have grown, and are still growing incrementally, and explanations have been proposed for their actual shape, such as Albert and Barabasi's preferential attachment growth rule. However, many actual networks seem to have undergone some kind of Darwinian variation and selection. Thus, how these networks might have come to be selected is an interesting yet unanswered question. In the last part of this work, we show how a simple evolutionary algorithm can enable the emrgence o these kinds of structures for two prototypical problems of the automata networks world, the majority classification and the synchronisation problems. Synopsis L'objectif principal de ce travail est de montrer l'influence du choix de la dimension temporelle et de la structure spatiale d'une population sur un processus évolutionnaire artificiel. Dans le domaine de l'Evolution Artificielle on peut observer une tendence à évoluer d'une façon synchrone des populations panmictiques, où chaque individu peut être récombiné avec tout autre individu dans la population. Déjà dans les année '90, Spiessens et Manderick, Sarma et De Jong, et Gorges-Schleuter ont observé que, si une population possède une structure régulière mono- ou bi-dimensionnelle, le processus évolutionnaire montre une dynamique différente de celle d'une population panmictique. En particulier, Sarma et De Jong ont étudié la pression de sélection (c-à-d la diffusion d'un individu optimal quand seul l'opérateur de sélection est actif) induite par une structure régulière bi-dimensionnelle de la population, proposant une modélisation logistique des courbes de pression de sélection. Ce modèle suppose que la diffusion d'un individu optimal suit une loi exponentielle. On montre que ce modèle est inadéquat pour décrire ce phénomène, étant donné que la vitesse de croissance doit obéir à une loi quadratique ou sous-quadratique dans le cas d'une structure régulière bi-dimensionnelle. De nouveaux modèles linéaires et sous-quadratique sont proposés pour des structures mono- et bi-dimensionnelles. Ces modèles sont étendus pour décrire des processus évolutionnaires asynchrones. Différentes dynamiques de la population impliquent strategies différentes de recherche de l'algorithme résultant lorsque le processus évolutionnaire est utilisé pour résoudre des problèmes d'optimisation. Un ensemble de problèmes discrets et continus est utilisé pour étudier les charactéristiques de recherche des différentes topologies et mises à jour des populations. Ces dernières années, les études de Watts et Strogatz ont montré que beaucoup de réseaux, aussi bien dans les mondes biologiques et sociologiques que dans les structures produites par l'homme, ont des propriétés mathématiques qui les séparent à la fois des structures régulières et des structures aléatoires. En particulier, ils ont introduit la notion de graphe sm,all-world et ont montré que cette nouvelle famille de structures possède des intéressantes propriétés dynamiques. Des populations ayant ces nouvelles topologies sont proposés, et leurs dynamiques évolutionnaires sont étudiées et modélisées. Pour des populations ayant ces structures, des méthodes d'évolution asynchrone sont proposées, et la dynamique résultante est étudiée. Beaucoup de réseaux produits par l'homme se sont formés d'une façon incrémentale, et des explications pour leur forme actuelle ont été proposées, comme le preferential attachment de Albert et Barabàsi. Toutefois, beaucoup de réseaux existants doivent être le produit d'un processus de variation et sélection darwiniennes. Ainsi, la façon dont ces structures ont pu être sélectionnées est une question intéressante restée sans réponse. Dans la dernière partie de ce travail, on montre comment un simple processus évolutif artificiel permet à ce type de topologies d'émerger dans le cas de deux problèmes prototypiques des réseaux d'automates, les tâches de densité et de synchronisation.

Network Structures and Modularity among Biofuel Heating System Manufacturers

The aim of this thesis was to study network structures and modularity among biofuel heating system manufacturers in the Finnish bioenergy sector by utilizing the perspectives of numerous Finnish bioenergy specialists. The study is qualitative due to the fact that the research material was gathered with semi-structured theme interviews during May and June 2010. The research methodology used in the thesis combines conceptual and action-oriented approach. Networks, value nets, and modularity were studied from different perspectives. Three network and platform strategies were discovered and a general network structure was formed. Moreover, benefits and disadvantages of networks and modularity among biofuel heating system manufacturers were illustrated. The analysis provides a comprehensive perception of the industry. The results of the research were constructed by implementing existing theories into practice. Also future recommendations for the biofuel heating system manufacturers were given. The results can be considered to be beneficial because the number of previous studies about the subject is relatively small. The reliability of the study is eminent because the number of the interviews was inclusive.

Social Network Analysis and Qualitative Comparative Analysis: Their mutual benefit for the explanation of policy network structures

By switching the level of analysis and aggregating data from the micro-level of individual cases to the macro-level, quantitative data can be analysed within a more case-based approach. This paper presents such an approach in two steps: In a first step, it discusses the combination of Social Network Analysis (SNA) and Qualitative Comparative Analysis (QCA) in a sequential mixed-methods research design. In such a design, quantitative social network data on individual cases and their relations at the micro-level are used to describe the structure of the network that these cases constitute at the macro-level. Different network structures can then be compared by QCA. This strategy allows adding an element of potential causal explanation to SNA, while SNA-indicators allow for a systematic description of the cases to be compared by QCA. Because mixing methods can be a promising, but also a risky endeavour, the methodological part also discusses the possibility that underlying assumptions of both methods could clash. In a second step, the research design presented beforehand is applied to an empirical study of policy network structures in Swiss politics. Through a comparison of 11 policy networks, causal paths that lead to a conflictual or consensual policy network structure are identified and discussed. The analysis reveals that different theoretical factors matter and that multiple conjunctural causation is at work. Based on both the methodological discussion and the empirical application, it appears that a combination of SNA and QCA can represent a helpful methodological design for social science research and a possibility of using quantitative data with a more case-based approach.

Network structures: Working differently and changing expectations

There is a growing need for innovative methods of dealing with complex, social problems. New types of collaborative efforts have emerged as a result of the inability of more traditional bureaucratic hierarchical arrangements such as departmental program, to resolve these problems. Network structures are one such arrangement that Is at the forefront of this movement. Although collaboration through network structures establishes an innovative response to dealing with social issues, there remains an expectation that outcomes and processes are based on traditional ways of working. It is necessary for practitioners and policy makers alike to begin to understand the realities of what can be expected from network structures in order to maximize the benefits of these unique mechanisms.

An investigation into the network structures of eThylene propylene terpolymer elastomers

A series of ethylene propylene terpolymer vulcanizates, prepared by varying termonomer type, cure system, cure time and cure temperature, are characterized by determining the number and type of cross-links present. The termonomers used represent the types currently available in commercial quantities. Characterization is carried out by measuring the C1 constant of the Mooney Rivlin Saunders equation before and after treatment with the chemical probes propane-2-thiol/piperidine and n-hexane thiol/piperidine, thus making it possible to calculate the relative proportions of mono-sulphidic, di-sulphidic and poly- sulphidic cross-links. The cure systems used included both sulphur and peroxide formulations. Specific physical properties are determined for each network and an attempt is made to correlate observed changes in these with variations in network structure. A survey of the economics of each formulation based on a calculated efficiency parameter for each cure system is included. Values of C1 are calculated from compression modulus data after the reliability of the technique when used with ethylene propylene terpolymers had been established. This is carried out by comparing values from both compression and extension stress strain measurements for natural rubber vulcanizates and by assessing the effects of sample dimensions and the degree of swelling. The technique of compression modulus is much more widely applicable than previously thought. The basic structure of an ethylene propylene terpolymer network appears to be independent of the type of cure system used ( sulphur based systems only), the proportions of constituent cross-links being nearly constant.

Network structures and resources for emergency communications

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Mobility and social network effects on extremist opinions

Understanding the emergence of extreme opinions and in what kind of environment they might become less extreme is a central theme in our modern globalized society. A model combining continuous opinions and observed discrete actions (CODA) capable of addressing the important issue of measuring how extreme opinions might be has been recently proposed. In this paper I show extreme opinions to arise in a ubiquitous manner in the CODA model for a multitude of social network structures. Depending on network details reducing extremism seems to be possible. However, a large number of agents with extreme opinions is always observed. A significant decrease in the number of extremists can be observed by allowing agents to change their positions in the network.

Airline competition and network structure

This paper characterizes the equilibria in airline networks and their welfare implications in an unregulated environment. Competing airlines may adopt either fully-connected (FC) or hub-and-spoke (HS) network structures; and passengers exhibiting low brand loyalty to their preferred carrier choose an outside option to travel so that markets are partially served by airlines. In this context, carriers adopt hubbing strategies when costs are sufficiently low, and asymmetric equilibria where one carrier chooses a FC strategy and the other chooses a HS strategy may arise. Quite interestingly, flight frequency can become excessive under HS network configurations.

A Bayesian network approach to the database serch problem in criminal proceedings

Background The 'database search problem', that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method's graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication.

Towards robust network based complex systems : from evolutionary cellular automata to biological models

Abstract Sitting between your past and your future doesn't mean you are in the present. Dakota Skye Complex systems science is an interdisciplinary field grouping under the same umbrella dynamical phenomena from social, natural or mathematical sciences. The emergence of a higher order organization or behavior, transcending that expected of the linear addition of the parts, is a key factor shared by all these systems. Most complex systems can be modeled as networks that represent the interactions amongst the system's components. In addition to the actual nature of the part's interactions, the intrinsic topological structure of underlying network is believed to play a crucial role in the remarkable emergent behaviors exhibited by the systems. Moreover, the topology is also a key a factor to explain the extraordinary flexibility and resilience to perturbations when applied to transmission and diffusion phenomena. In this work, we study the effect of different network structures on the performance and on the fault tolerance of systems in two different contexts. In the first part, we study cellular automata, which are a simple paradigm for distributed computation. Cellular automata are made of basic Boolean computational units, the cells; relying on simple rules and information from- the surrounding cells to perform a global task. The limited visibility of the cells can be modeled as a network, where interactions amongst cells are governed by an underlying structure, usually a regular one. In order to increase the performance of cellular automata, we chose to change its topology. We applied computational principles inspired by Darwinian evolution, called evolutionary algorithms, to alter the system's topological structure starting from either a regular or a random one. The outcome is remarkable, as the resulting topologies find themselves sharing properties of both regular and random network, and display similitudes Watts-Strogtz's small-world network found in social systems. Moreover, the performance and tolerance to probabilistic faults of our small-world like cellular automata surpasses that of regular ones. In the second part, we use the context of biological genetic regulatory networks and, in particular, Kauffman's random Boolean networks model. In some ways, this model is close to cellular automata, although is not expected to perform any task. Instead, it simulates the time-evolution of genetic regulation within living organisms under strict conditions. The original model, though very attractive by it's simplicity, suffered from important shortcomings unveiled by the recent advances in genetics and biology. We propose to use these new discoveries to improve the original model. Firstly, we have used artificial topologies believed to be closer to that of gene regulatory networks. We have also studied actual biological organisms, and used parts of their genetic regulatory networks in our models. Secondly, we have addressed the improbable full synchronicity of the event taking place on. Boolean networks and proposed a more biologically plausible cascading scheme. Finally, we tackled the actual Boolean functions of the model, i.e. the specifics of how genes activate according to the activity of upstream genes, and presented a new update function that takes into account the actual promoting and repressing effects of one gene on another. Our improved models demonstrate the expected, biologically sound, behavior of previous GRN model, yet with superior resistance to perturbations. We believe they are one step closer to the biological reality.

Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.

Modeling a Network of Heat Exchangers

This research work addresses the problem of building a mathematical model for the given system of heat exchangers and to determine the temperatures, pressures and velocities at the intermediate positions. Such model could be used in nding an optimal design for such a superstructure. To limit the size and computing time a reduced network model was used. The method can be generalized to larger network structures. A mathematical model which includes a system of non-linear equations has been built and solved according to the Newton-Raphson algorithm. The results obtained by the proposed mathematical model were compared with the results obtained by the Paterson approximation and Chen's Approximation. Results of this research work in collaboration with a current ongoing research at the department will optimize the valve positions and hence, minimize the pumping cost and maximize the heat transfer of the system of heat exchangers.