Diversity in Teams: Source of Conflict or Source of Creativity? Investigating Hidden Mental Models

The workforce in organizations today is becoming increasingly diverse. Consequently the role of diversity management is heavily discussed with respect to the question how diversity influences the productivity of a group. Empirical studies show that on one hand there is a potential for increasing productivity but on the other hand it might be as well that conflicts arise due to the heterogeneity of the group. Usually according empirical studies are based on interviews, questionnaires and/or observations. These methods imply that answers are highly selective and filtered. In order to make the invisible visible, to have access to mental models of team members the paper will present an empirical study on the self-understanding of groups based on an innovative research method, called “mind-scripting”.

H-NAMe: a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This paper tackles the hiddennode problem in WSNs and proposes H-NAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this paper will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol

Collision-free prioritized medium access in the presence of hidden nodes without relying on out-of-band signaling

Consider the problem of sharing a wireless channel between a set of computer nodes. Hidden nodes exist and there is no base station. Each computer node hosts a set of sporadic message streams where a message stream releases messages with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements staticpriority scheduling. The MAC protocol allows multiple masters and is fully distributed. It neither relies on synchronized clocks nor out-of-band signaling; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. Our protocol has the key feature of not only being prioritized and collision-free but also dealing successfully with hidden nodes. This key feature enables schedulability analysis of sporadic message streams in multihop networks.

Collision-free prioritized medium access control in wireless networks with hidden nodes

We propose a collision-free medium access control (MAC) protocol, which implements static-priority scheduling and works in the presence of hidden nodes. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to sense the channel while transmitting to the channel. Our protocol is collision-free even in the presence of hidden nodes and it achieves this without synchronized clocks or out-of-band busy tones. In addition, the protocol is designed to ensure that many non-interfering nodes can transmit in parallel and it functions for both broadcast and unicast transmissions.

Are there hidden scalars in LHC Higgs results?

The Higgs boson recently discovered at the Large Hadron Collider has shown to have couplings to the remaining particles well within what is predicted by the Standard Model. The search for other new heavy scalar states has so far revealed to be fruitless, imposing constraints on the existence of new scalar particles. However, it is still possible that any existing heavy scalars would preferentially decay to final states involving the light Higgs boson thus evading the current LHC bounds on heavy scalar states. Moreover, decays of the heavy scalars could increase the number of light Higgs bosons being produced. Since the number of light Higgs bosons decaying to Standard Model particles is within the predicted range, this could mean that part of the light Higgs bosons could have their origin in heavy scalar decays. This situation would occur if the light Higgs couplings to Standard Model particles were reduced by a concomitant amount. Using a very simple extension of the SM - the two-Higgs doublet model we show that in fact we could already be observing the effect of the heavy scalar states even if all results related to the Higgs are in excellent agreement with the Standard Model predictions.

Quantitative description of the self-assembly of patchy particles into chains and rings

We numerically study a simple fluid composed of particles having a hard-core repulsion complemented by two patchy attractive sites on the particle poles. An appropriate choice of the patch angular width allows for the formation of ring structures which, at low temperatures and low densities, compete with the growth of linear aggregates. The simplicity of the model makes it possible to compare simulation results and theoretical predictions based on the Wertheim perturbation theory, specialized to the case in which ring formation is allowed. Such a comparison offers a unique framework for establishing the quality of the analytic predictions. We find that the Wertheim theory describes remarkably well the simulation results.

Dynamic programming for a Markov-switching jump–diffusion

We consider an optimal control problem with a deterministic finite horizon and state variable dynamics given by a Markov-switching jump–diffusion stochastic differential equation. Our main results extend the dynamic programming technique to this larger family of stochastic optimal control problems. More specifically, we provide a detailed proof of Bellman’s optimality principle (or dynamic programming principle) and obtain the corresponding Hamilton–Jacobi–Belman equation, which turns out to be a partial integro-differential equation due to the extra terms arising from the Lévy process and the Markov process. As an application of our results, we study a finite horizon consumption– investment problem for a jump–diffusion financial market consisting of one risk-free asset and one risky asset whose coefficients are assumed to depend on the state of a continuous time finite state Markov process. We provide a detailed study of the optimal strategies for this problem, for the economically relevant families of power utilities and logarithmic utilities.

Modelos de previsão de deterioração de pontes existentes: processos de Markov

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Civil

Explosion of smoothness from a point to everywhere for conjugacies between Markov families

For uniformly asymptotically affine (uaa) Markov maps on train tracks, we prove the following type of rigidity result: if a topological conjugacy between them is (uaa) at a point in the train track then the conjugacy is (uaa) everywhere. In particular, our methods apply to the case in which the domains of the Markov maps are Canter sets. We also present similar statements for (uaa:) and C-r Markov families. These results generalize the similar ones of Sullivan and de Faria for C-r expanding circle maps with r > 1 and have useful applications to hyperbolic dynamics on surfaces and laminations.

The hidden value behind capital structure decisions

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics

Electron transfer chains in sulfate reducing bacteria

Dissertação para a obtenção de grau de doutor em Bioquímica pelo Instituto de Tecnologia Química e Biológica. Universidade Nova de Lisboa.

THE U.S. and European M&A cycles: A Markov switching and state space approach

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics

Credit cycle identification: A Markov-switching application

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics

Supercomplexes of Prokaryotic Aerobic Respiratory Chains-Escherichia coli and Bacillus subtilis supramolecular assemblies

Dissertation presented to obtain the Ph.D degree in Biochemistry.

Finding the hidden influencers

This thesis is a first step in the search for the characteristics of funders, and the underlying motivation that drives them to participate in crowdfunding. The purpose of the study is to identify demographics and psychographics that influence a funder’s willingness to financially support a crowdfunding project (WFS). Crowdfunding, crowdsourcing and donation literature are combined to create a conceptual model in which age, gender, altruism and income, together with several control variables, are expected to have an influence on a funder’s WFS. Primary data collection was conducted using a survey, and a dataset of 175 potential crowdfunders was created. The data is analysed using a multiple regression and provided several interesting results. First of all, age and gender have a significant effect on WFS, males and young adults until the age of 30 have a higher intention to give money to crowdfunding projects. Second, altruism is significantly positively related to WFS, meaning that the funders do not just care about the potential rewards they could receive, but also about the benefits that they create for the entrepreneur and the people affected by the crowdfunding project. Third, the moderation effect of income was found to be insignificant in this model. It shows that income does not affect the strength of the relationship between the age, gender and altruism, and WFS. This study provides important theoretical contributions by, to the best of my knowledge, being the first study to quantitatively investigate the characteristics of funders and using the funder as the unit of analysis. Moreover, the study provides important insights for entrepreneurs who wish to target the crowd better in order to attract and retain more funders, thereby increasing the chance of success of their project.