High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Single-symbol maximum likelihood (ML) decodable distributed orthogonal space-time block codes (DOST- BCs) have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of distributed space-time block codes (DSTBCs) called semi-orthogonal precoded distributed single-symbol decodable space-time block codes (Semi-SSD-PDSTBCs) wherein, the source performs preceding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of semi-SSD- PDSTBCs is proved. It is shown that the DOSTBCs are a special case of semi-SSD-PDSTBCs. A subset of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi- SSD-PDSTBCs is presented when the number of relays K ges 4 and the constructed codes are shown to have higher rates than that of DOSTBCs.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Associations between dehydration, cognitive impairment and frailty in older hospitalized patients: An exploratory study

An exploratory study was undertaken to assess the prevalence of dehydration in older patients (aged ≥60 years) with and without cognitive impairment (CI) admitted to hospital and to examine associations between dehydration, CI and frailty. Forty-four patients participated and dehydration was assessed within 24 hours of admission and at day 4 or at discharge, whichever occurred first (study exit). Patients’ cognitive function and frailty status were assessed using validated instruments. Twenty-seven (61%) patients had CI and 61% were frail. The prevalence of dehydration at admission was 29% (n=12) and 19% (n=6) at study exit and dehydration status did not differ according to either CI status or frailty status. Within the non-CI group, however, significantly more frail than fit patients were dehydrated at admission (p=0.03). These findings indicate that dehydration is common amongst older hospital patients, and that frailty may increase the risk for dehydration in cognitively intact older patients.

Homeowners' Associations in Russia after the 2005 Housing Reform

The thesis examines homeowners associations as a part of the large-scale housing reform, implemented in Russia since 2005. The reform transferred housing management from the public sector to the private sector and to the citizens responsibility. The reform is a continuation to the privatisation of the housing stock that was started in Russia in the beginning of the 1990s, aiming to build a market-oriented housing sector in the country. The reform makes a fundamental change to the Soviet system, in which ownership along with management and maintenance of housing were monopolised by the state. Homeowners are now responsible for the management of the common areas in privatised houses, which is often realised by establishing a homeowners association. Homeowners associations are examined by using the so-called common-pool resource regime approach, with the main question being the ways in which taking care of common property collectively succeeds in practice. The study is based on interview data of St. Petersburg s homeowners associations. Using the common-pool resource theory the study demonstrates why implementation of the housing reform has not succeeded as expected. Certain elements that characterise a successful common-pool resource regime do not fulfill sufficiently in St. Petersburg s homeowners associations. Firstly, free-riding, that is, withdrawal from the association s joint decision-making and not making the housing payments is common, as effective sanctions to prevent it are missing in the legislation. That is, eviction or expelling a non-paying member from the association is not possible. Secondly, ownership of the land plot and common areas of the house, such as basements and attics, are often disputed between the associations and authorities. In the Soviet era, these common areas were public property along with the apartments, but in privatised houses they should, according to the legislation, belong to the associations property. Thirdly, solution of disputes between the associations and authorities and within the associations is difficult, as the court system tends to be bureaucratic and inefficient. In addition to the common-pool resource approach, the study also examines how social capital contributes to the associations effectiveness and democratic governance. The study finds that although homeowners associations have increased cooperation and tightened social relations between neighbours, social capital has not been able to prevent free-riding. The study shows that unlike it is often claimed, the so-called Soviet mentality , that is, residents passiveness and unwillingness to participate, is not the most important obstacle to the reform. Instead, the reform is impeded most of all by imperfect institutional arrangements and local authorities that prevent the associations from working as independent, self-governing associations.

Shrewd alliances: mixed foraging associations between treeshrews,greater racket-tailed drongos and sparrowhawks on Great Nicobar Island, India

Mixed-species foraging associations may form to enhance feeding success or to avoid predators. We report the costs and consequences of an unusual foraging association between an endemic foliage gleaning tupaid (Nicobar treeshrew Tupaia nicobarica) and two species of birds; one an insectivorous commensal (greater racket-tailed drongo Dicrurus paradiseus) and the other a diurnal raptor and potential predator (Accipiter sp.). In an alliance driven, and perhaps engineered, by drongos, these species formed cohesive groups with predictable relationships. Treeshrew breeding pairs were found more frequently than solitary individuals with sparrowhawks and were more likely to tolerate sparrowhawks in the presence of drongos. Treeshrews maintained greater distances from sparrowhawks than drongos, and permitted the raptors to come closer when drongos were present. Treeshrew foraging rates declined in the presence of drongos; however, the latter may provide them predator avoidance benefits. The choice of the raptor to join the association is intriguing; particular environmental resource states may drive the evolution of such behavioural strategies. Although foraging benefits seem to be the primary driver of this association, predator avoidance also influences interactions, suggesting that strategies driving the formation of flocks may be complex and context dependent with varying benefits for different actors.

Associations between personality traits and sleep quality and quantity in young adults

This thesis examines the associations between personality traits and sleep quantity and quality in young adults. Additionally the possible effects of birth status on these associations are examined. The data used in this thesis is part of a birth cohort study (Helsinki Study of Very Low Birth Weight Adults). The personality traits are based on the five-factor model of personality. The sleep quantity and quality are based on actigraphy assessments. Four hypothesis were made about the personality and sleep associations: (1) neuroticism is related to a lesser quality of sleep, (2) there will be more significant associations between personality traits and sleep quality than between personality traits and sleep quantity, (3) the Very Low Birth Weight (VLBW) as well as, (4) the Small for Gestational Age (SGA) status will affect the associations. Linear regressions were used to study the associations between personality traits and sleep quality and quantity. Whenever an association was significant, it was tested whether this association was moderated first, by the VLBW and second, by the SGA status of the participant. The results were mostly in line with previous research especially demonstrating the negative association between neuroticism and the quality of sleep and suggesting that vulnerability to stress decreases sleep quality. Also it was found that agreeableness and conscientiousness were associated with better sleep quality and extraversion was associated with lower sleep quantity. In addition SGA status moderated the personality and sleep associations. It is proposed that there are two factors behind the interaction. First, prenatally developing mechanisms have an effect on the development of sleep as well as personality. Second, differences in the postnatal environment, for instance the parenting practices, can account for this finding. Future research could focus especially on what kind of prenatal disturbances SGA infants have in the development of mechanisms related to sleep and personality. Also focusing on the differences in parental interaction might shed more light on the results.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).

A modified least squares algorithm to treat associations in liquid alloys

The associated model for binary systems has been modified to include volume effects and excess entropy arising from preferential interactions between the associate and the free atoms or between the free atoms. Equations for thermodynamic mixing functions have been derived. An optimization procedure using a modified conjugate gradient method has been used to evaluate the enthalpy and entropy interaction energies, the free energy of dissociation of the complex, its temperature dependance and the size of the associate. An expression for the concentration—concentration structure factor [Scc (0)] has been deduced from the modified associated solution model. The analysis has been applied to the thermodynamic mixing functions of liquid Ga-Te alloys at 1120 K, believed to contain Ga2Te3 associates. It is observed that the modified associated solution model incorporating volume effects and terms for the temperature dependance of interaction energies, describes the thermodynamic properties of Ga-Te system satisfactorily.

Cooperative Replies to Unbelievable Assertions

We propose a dialogue protocol for situations in which an agent makes to another agent an assertion that the other agent finds impossible to believe. In this interaction, unbelievable assertions are rejected using explanations formed by logical interpolation and new assertions are being made such that all previous rebuttals are taken into account.

Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems

A common and practical paradigm in cooperative communications is the use of a dynamically selected 'best' relay to decode and forward information from a source to a destination. Such a system consists of two core phases: a relay selection phase, in which the system expends resources to select the best relay, and a data transmission phase, in which it uses the selected relay to forward data to the destination. In this paper, we study and optimize the trade-off between the selection and data transmission phase durations. We derive closed-form expressions for the overall throughput of a non-adaptive system that includes the selection phase overhead, and then optimize the selection and data transmission phase durations. Corresponding results are also derived for an adaptive system in which the relays can vary their transmission rates. Our results show that the optimal selection phase overhead can be significant even for fast selection algorithms. Furthermore, the optimal selection phase duration depends on the number of relays and whether adaptation is used.