Distributed Parallel Computing in Mermera: Mixing Noncoherent Shared Memories

Programmers of parallel processes that communicate through shared globally distributed data structures (DDS) face a difficult choice. Either they must explicitly program DDS management, by partitioning or replicating it over multiple distributed memory modules, or be content with a high latency coherent (sequentially consistent) memory abstraction that hides the DDS' distribution. We present Mermera, a new formalism and system that enable a smooth spectrum of noncoherent shared memory behaviors to coexist between the above two extremes. Our approach allows us to define known noncoherent memories in a new simple way, to identify new memory behaviors, and to characterize generic mixed-behavior computations. The latter are useful for programming using multiple behaviors that complement each others' advantages. On the practical side, we show that the large class of programs that use asynchronous iterative methods (AIM) can run correctly on slow memory, one of the weakest, and hence most efficient and fault-tolerant, noncoherence conditions. An example AIM program to solve linear equations, is developed to illustrate: (1) the need for concurrently mixing memory behaviors, and, (2) the performance gains attainable via noncoherence. Other program classes tolerate weak memory consistency by synchronizing in such a way as to yield executions indistinguishable from coherent ones. AIM computations on noncoherent memory yield noncoherent, yet correct, computations. We report performance data that exemplifies the potential benefits of noncoherence, in terms of raw memory performance, as well as application speed.

Dynamic Programming for Optimal Control of Set-Up Scheduling with Neural Network Modifications

This paper demonstrates an optimal control solution to change of machine set-up scheduling based on dynamic programming average cost per stage value iteration as set forth by Cararnanis et. al. [2] for the 2D case. The difficulty with the optimal approach lies in the explosive computational growth of the resulting solution. A method of reducing the computational complexity is developed using ideas from biology and neural networks. A real time controller is described that uses a linear-log representation of state space with neural networks employed to fit cost surfaces.

Dissipative scheme to approach the boundary of two-qubit entangled mixed states

We discuss the generation of states close to the boundary family of maximally entangled mixed states as defined by the use of concurrence and linear entropy. The coupling of two qubits to a dissipation-affected bosonic mode is able to produce a bipartite state having, for all practical purposes, the entanglement and mixedness properties of one of such boundary states. We thoroughly study the effects that thermal and squeezed characters of the bosonic mode have in such a process and we discuss tolerance to qubit phase-damping mechanisms. The nondemanding nature of the scheme makes it realizable in a matter-light-based physical setup, which we address in some details.

Teleporting bipartite entanglement using maximally entangled mixed channels

The ability to teleport entanglement through maximally entangled mixed states as defined by concurrence and linear entropy is studied. We show how the teleported entanglement depends on the quality of the quantum channel used, as defined through its entanglement and mixedness, as well as the form of the target state to be teleported. We present new results based on the fidelity of the teleported state as well as an experimental setup that is immediately implementable with currently available technology.

Modeling continuous self-report measures of perceived emotion using generalized additive mixed models

Emotion research has long been dominated by the “standard method” of displaying posed or acted static images of facial expressions of emotion. While this method has been useful it is unable to investigate the dynamic nature of emotion expression. Although continuous self-report traces have enabled the measurement of dynamic expressions of emotion, a consensus has not been reached on the correct statistical techniques that permit inferences to be made with such measures. We propose Generalized Additive Models and Generalized Additive Mixed Models as techniques that can account for the dynamic nature of such continuous measures. These models allow us to hold constant shared components of responses that are due to perceived emotion across time, while enabling inference concerning linear differences between groups. The mixed model GAMM approach is preferred as it can account for autocorrelation in time series data and allows emotion decoding participants to be modelled as random effects. To increase confidence in linear differences we assess the methods that address interactions between categorical variables and dynamic changes over time. In addition we provide comments on the use of Generalized Additive Models to assess the effect size of shared perceived emotion and discuss sample sizes. Finally we address additional uses, the inference of feature detection, continuous variable interactions, and measurement of ambiguity.

Proportioning variability in the dispensation of hand-mixed dental cements

Objectives: The purpose of this investigation was to determine for dispensed multiples (1 through 4) of powder (P) and liquid (L) in hand-mixed dental cement whether: (1) the mean (P/L) ratio (m/m) and (2) the maximum difference in (P/L) ratio is dependent on the number of multiples dispensed. The Null hypotheses were: (a) mean (P/L) ratio is independent of the number of multiples dispensed and (b) maximum difference in (P/L) ratio is independent of the number of multiples dispensed.
Methods: The materials investigated are listed in the Table. The masses of dispensed aliquots of powder and liquid were measured by a single operator (n=10, for multiples 1 through 4) on a 4-place analytical balance. All measurements were made independently and all possible (P/L) ratios calculated for each sample. The effect of multiple dispensations on (P/L) ratios and maximum (P/L) differences was by one-way ANOVA and linear regression, respectively, with the Tukey post-hoc correction for multiple comparisons.MULTIPLE DISPENSEDDISPENSED MU(x1)(x2)(x3)(x4)Zinc phosphateHeraeus12.271(0.691)a13.051(1.269)b13.215(0.824)b13.118(1.149)bFuji IXGC4.209(0.373)a4.085(0.275)b4.095(0.226)b4.095(0.217)bIRMDentsply7.933(0.767)a7.430(0.451)b7.977(0.729)a8.186(0.929)aKetac-Cem3M Espe9.6206(0.613)a9.714(0.523)a9.298(0.314)b9.321(0.292)bMean (SD) powder/liquid ratio (m/m). Superscript letters represent significances (α = 0.05) within each material
Results: Mean (SD) (P/L) ratios are presented in the Table. Null hypothesis (a) is rejected: either (x1) or (x2) dispensation yields a different (P/L) ratio to (x3) or (x4) (p < 0.05). Null hypothesis (b) is rejected: a negative correlation is observed in max (P/L) ratio difference with dispensed multiple for Ketac Cem (p = 0.029).
Conclusion: For hand-mixed dental cements: (1) more consistent (P/L) ratios may be observed with multiple dispensations of powder & liquid; (2) maximum differences in (P/L) ratio may be negatively correlated with dispensation multiple in some materials.

Behavioral modeling optimization and enhancement for high-speed analog mixed-signal I/O interfaces

A integridade do sinal em sistemas digitais interligados de alta velocidade, e avaliada através da simulação de modelos físicos (de nível de transístor) é custosa de ponto vista computacional (por exemplo, em tempo de execução de CPU e armazenamento de memória), e exige a disponibilização de detalhes físicos da estrutura interna do dispositivo. Esse cenário aumenta o interesse pela alternativa de modelação comportamental que descreve as características de operação do equipamento a partir da observação dos sinais eléctrico de entrada/saída (E/S). Os interfaces de E/S em chips de memória, que mais contribuem em carga computacional, desempenham funções complexas e incluem, por isso, um elevado número de pinos. Particularmente, os buffers de saída são obrigados a distorcer os sinais devido à sua dinâmica e não linearidade. Portanto, constituem o ponto crítico nos de circuitos integrados (CI) para a garantia da transmissão confiável em comunicações digitais de alta velocidade. Neste trabalho de doutoramento, os efeitos dinâmicos não-lineares anteriormente negligenciados do buffer de saída são estudados e modulados de forma eficiente para reduzir a complexidade da modelação do tipo caixa-negra paramétrica, melhorando assim o modelo standard IBIS. Isto é conseguido seguindo a abordagem semi-física que combina as características de formulação do modelo caixa-negra, a análise dos sinais eléctricos observados na E/S e propriedades na estrutura física do buffer em condições de operação práticas. Esta abordagem leva a um processo de construção do modelo comportamental fisicamente inspirado que supera os problemas das abordagens anteriores, optimizando os recursos utilizados em diferentes etapas de geração do modelo (ou seja, caracterização, formulação, extracção e implementação) para simular o comportamento dinâmico não-linear do buffer. Em consequência, contributo mais significativo desta tese é o desenvolvimento de um novo modelo comportamental analógico de duas portas adequado à simulação em overclocking que reveste de um particular interesse nas mais recentes usos de interfaces de E/S para memória de elevadas taxas de transmissão. A eficácia e a precisão dos modelos comportamentais desenvolvidos e implementados são qualitativa e quantitativamente avaliados comparando os resultados numéricos de extracção das suas funções e de simulação transitória com o correspondente modelo de referência do estado-da-arte, IBIS.

Integer-valued APARCH processes in the analysis of time series of counts

The Asymmetric Power Arch representation for the volatility was introduced by Ding et al.(1993) in order to account for asymmetric responses in the volatility in the analysis of continuous-valued financial time series like, for instance, the log-return series of foreign exchange rates, stock indices or share prices. As reported by Brannas and Quoreshi (2010), asymmetric responses in volatility are also observed in time series of counts such as the number of intra-day transactions in stocks. In this work, an asymmetric power autoregressive conditional Poisson model is introduced for the analysis of time series of counts exhibiting asymmetric overdispersion. Basic probabilistic and statistical properties are summarized and parameter estimation is discussed. A simulation study is presented to illustrate the proposed model. Finally, an empirical application to a set of data concerning the daily number of stock transactions is also presented to attest for its practical applicability in data analysis.

Individual differences and factors affecting male behaviour in field crickets

Individual differences in male sexual behav~our and the factors influencing calling behaviour were studied in the field crickets Gryllus 2 integer and Q. veletis. In a large (13m) outdoor arena individually numbered adult male ~~ integer started calling at three to five days of age but thereafter the age of individual G. integer males did not affect nightly calling duration. Calling also did not correlate with individual weight. In this study individual male calling was continuously distributed from 0 hrs. per night to 3.5 hrs. per night, on average. A temporal effect on the number of G. integer males calling was observed. The number of males calling through the night was uniform, but a sharp increase in the number calling was observed in the early morning. No difference in calling times was observed between the night and dawn callers. AlsC)' males calling at dawn usually didnotc'all during the preceeding night. Calling and reproductive success in 1979 demonstrated a negative logarithmic relationship while in the 1980(initial) population a negative linear relationship was observed. No relationship was seen in the 1980 high density population. The ratio of non-callers to callers also affected the mating of individuals in the 1979 and1980(initial) densities:-non~callers (males calling .5 hrs. per night, on average, or less) obtained more females when the population contained a high number of callers, this being a negative logarithmic relationship to, No such relationship was observed in the 1980 high density population. Individual displacement varied nightly and was not correlated to amount of calling or reproductive success of individual G. integer males. G. integer males were displa~ed more when in a higher density in the outdoor arena Male G. integer and G. veletis behaviours were also observed in an indoor arena at different densities and, in G. veletis, with respect to female presence. When females were present in the arena, in G. veletis, male calling was reduced. Males of both species called less, on average, when in ~ higher density, than when they were in a lower density. Male displacement of both species increased on average when in a higher density as compared to displacement in a lower density. Aggression was measured by aggressive call-ing and fighting and was studied in regards to density.G. integer demonstrated less aggression in all but one comparison at higher density. No difference was observed in the ratio of aggressive calling to f.ighting comparison in G. integer. G. veletis demonstrated mixed results. No difference in aggression between densities was observed in comparisons. Less.aggression did occur in higher densities when comparisons invol.ved fighting behaviour. Male behaviour represents a competitive strategy against ot~er males, strategy being defined as a genetic (in part) alternative to other strategies. In this sense, the factors of time, density, male-male aggression, and female presence are conditions demonstrated to affect male behaviour in G. integer and G. veletis. Individual male differences and other considerations suggest that alternative male behaviours are represented by at least two conditional strategies. This possibility, and the transient 'or stable nature of genetic polymorphisms in field cricket behaviour are considered.

Mating behaviours of the field cricket (Gryllus integer) at different levels of male density

The reproductive behaviour of the field cricket, Gryllus integer, was systematically observed in indoor arenas to determine the extent of female Choice and male-male competition at different sex ratios representing two male densities (12:6 and 6:6). The costs and benefits to males and females in those two densities were analyzed according to the theory of the evolution o£ leks. Observations were conducted during the dark hours when most calling occurred since hourly rates of courtship song and mating did not fluctuate significantly over a 24 h period. Female mating rates were not significantly different between densities, therefore males at high densities were not advantaged because of increased female tendencies to mate when social stimulation was increased. Mean rates of acoustical signalling (calling and courtin"g) did not differ significantly between densities. Mean rates of fighting by males at the high density were significantly greater than those of males at the low density. Mating benefits associated with callin~courting and fighting were measured. Mating rates did not vary with rates of calling at either density. Calling was not a prerequisite to mating. Courtship song preceded all matings. There was a significant power fit between male mating and courting rates, and male mating and fighting rates at the low, but not at the high, density. Density differences in the benefits associated with increased courting and fighting may relate, in part, to greater economic defensibility and monopoly of females due to reduced male competition at the low density. Dominant males may be preferentially chosen by females or better able to monopolize mating opportunities than subordinate males. Three criteria were used to determine whether dominant males were preferentially chosen by females. The number of matings by males who won fights (within 30 min of mating) was significantly greater than the number of matings by males who were defeated in such fights. Mating rates did not vary significantly with rates of winning at either density. There was a significant power fit between male mating rates and the percentage of fights a male won (irrespective of his fighting-frequency) at the low density. The mean duration a male guarded the female after mating did not vary significantly between densities. There was a significant linear relationship between the duration a spermatophore was retained and the duration a male guarded the female after mating. Courtship song apparently stimulated spermatophore removal. Male guarding involved inter-male aggression and reduced courtship attempts by other males. Males at the high density received no apparent reproductive benefits associated with increased social stimulation. Conclusive evidence for preferential choice of males by females, using the criteria examined here, is lacking. Males at the lower density had fewer competitors and could monopolize females more effectively.

Méthode de génération de colonnes pour les problèmes de conception de réseaux avec coûts d’ajout de capacité

Les problèmes de conception de réseaux ont reçu un intérêt particulier et ont été largement étudiés de par leurs nombreuses applications dans différents domaines, tels que les transports et les télécommunications. Nous nous intéressons dans ce mémoire au problème de conception de réseaux avec coûts d’ajout de capacité. Il s’agit d’installer un ensemble d’équipements sur un réseau en vue de satisfaire la demande, tout en respectant les contraintes de capacité, chaque arc pouvant admettre plusieurs équipements. L’objectif est de minimiser les coûts variables de transport des produits et les coûts fixes d’installation ou d’augmentation de capacité des équipements. La méthode que nous envisageons pour résoudre ce problème est basée sur les techniques utilisées en programmation linéaire en nombres entiers, notamment celles de génération de colonnes et de coupes. Ces méthodes sont introduites dans un algorithme général de branch-and-bound basé sur la relaxation linéaire. Nous avons testé notre méthode sur quatre groupes d’instances de tailles différentes, et nous l’avons comparée à CPLEX, qui constitue un des meilleurs solveurs permettant de résoudre des problèmes d’optimisation, ainsi qu’à une méthode existante dans la littérature combinant des méthodes exactes et heuristiques. Notre méthode a été plus performante que ces deux méthodes, notamment pour les instances de très grandes tailles.

Evolving Distributed Algorithms with Genetic Programming

Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile and wireless networks, for instance, have to organize themselves autonomously and must be able to react to changes in the environment and to failing nodes alike. Researching new approaches for the design of distributed algorithms may lead to methods with which these requirements can be met efficiently. In this thesis, one such method is developed, tested, and discussed in respect of its practical utility. Our new design approach for distributed algorithms is based on Genetic Programming, a member of the family of evolutionary algorithms. Evolutionary algorithms are metaheuristic optimization methods which copy principles from natural evolution. They use a population of solution candidates which they try to refine step by step in order to attain optimal values for predefined objective functions. The synthesis of an algorithm with our approach starts with an analysis step in which the wanted global behavior of the distributed system is specified. From this specification, objective functions are derived which steer a Genetic Programming process where the solution candidates are distributed programs. The objective functions rate how close these programs approximate the goal behavior in multiple randomized network simulations. The evolutionary process step by step selects the most promising solution candidates and modifies and combines them with mutation and crossover operators. This way, a description of the global behavior of a distributed system is translated automatically to programs which, if executed locally on the nodes of the system, exhibit this behavior. In our work, we test six different ways for representing distributed programs, comprising adaptations and extensions of well-known Genetic Programming methods (SGP, eSGP, and LGP), one bio-inspired approach (Fraglets), and two new program representations called Rule-based Genetic Programming (RBGP, eRBGP) designed by us. We breed programs in these representations for three well-known example problems in distributed systems: election algorithms, the distributed mutual exclusion at a critical section, and the distributed computation of the greatest common divisor of a set of numbers. Synthesizing distributed programs the evolutionary way does not necessarily lead to the envisaged results. In a detailed analysis, we discuss the problematic features which make this form of Genetic Programming particularly hard. The two Rule-based Genetic Programming approaches have been developed especially in order to mitigate these difficulties. In our experiments, at least one of them (eRBGP) turned out to be a very efficient approach and in most cases, was superior to the other representations.

Convex linear combination processes for compositions

Aitchison and Bacon-Shone (1999) considered convex linear combinations of compositions. In other words, they investigated compositions of compositions, where the mixing composition follows a logistic Normal distribution (or a perturbation process) and the compositions being mixed follow a logistic Normal distribution. In this paper, I investigate the extension to situations where the mixing composition varies with a number of dimensions. Examples would be where the mixing proportions vary with time or distance or a combination of the two. Practical situations include a river where the mixing proportions vary along the river, or across a lake and possibly with a time trend. This is illustrated with a dataset similar to that used in the Aitchison and Bacon-Shone paper, which looked at how pollution in a loch depended on the pollution in the three rivers that feed the loch. Here, I explicitly model the variation in the linear combination across the loch, assuming that the mean of the logistic Normal distribution depends on the river flows and relative distance from the source origins

A mixed H2/H∞-based semiactive control for vibration mitigation in flexible structures

In this paper, we address this problem through the design of a semiactive controller based on the mixed H2/H∞ control theory. The vibrations caused by the seismic motions are mitigated by a semiactive damper installed in the bottom of the structure. It is meant by semiactive damper, a device that absorbs but cannot inject energy into the system. Sufficient conditions for the design of a desired control are given in terms of linear matrix inequalities (LMIs). A controller that guarantees asymptotic stability and a mixed H2/H∞ performance is then developed. An algorithm is proposed to handle the semiactive nature of the actuator. The performance of the controller is experimentally evaluated in a real-time hybrid testing facility that consists of a physical specimen (a small-scale magnetorheological damper) and a numerical model (a large-scale three-story building)