A New Irish? Problems of communication in modern Irish media and new speakers.

While the Gaeltacht (Irish speaking) areas of Ireland are geographically isolated from each other and relatively small in area, it is expected that the number of second language Irish speakers throughout the country should ensure the future of the language. Nevertheless, while the official standard grammar has been established for many decades, there is still a tendency in the spoken language to give precedence to regional dialectal variants in schools and the broadcast media which often raises barriers between native speakers themselves and between learners and native speakers.
All pupils in school in the Republic and many in Northern Ireland learn Irish and there has been a great increase in the number of pupils attending immersion Irish language Gaelscoileanna. But concern has been expressed about the phonetic and structural accuracy achieved in schools, all of which contributes to communication breakdown.
This paper discusses how a greater awareness of the link between phoneme and grapheme in Irish and the proposals for the Lárchanúint (Central Dialect) in the 1980s and current discussions on Caighdeán Leathan agus Caighdeán Cúng (Broad and Narrow Standard) would mitigate these concerns.

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information

We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each bad processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt processors at the start, without knowledge of the processors’ private random bits.

A good quorum is a set of O(logn) processors, which contains a majority of good processors. In this paper, we give a synchronous algorithm which uses polylogarithmic time and Õ(vn) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. The collection is balanced in that no processor is in more than O(logn) quorums. This yields the first solution to Byzantine agreement which is both scalable and load-balanced in the full information model.

The technique which involves going from situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits to a situation where all good processors agree on n good quorums can be done in a fully asynchronous model as well, providing an approach for extending the Byzantine agreement result to this model.

Brief announcement: Maintaining large dense subgraphs on dynamic networks

In distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense subgraph, e.g., such a dense subgraph could form a high bandwidth backbone for the network. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs (subgraphs that the member nodes are aware of). The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model in the sense that only messages of O(log n) size are permitted, where n is the number of nodes in the network. Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that approximate both the densest subgraph, i.e., the subgraph of the highest density in the network, and the at-least-k-densest subgraph (for a given parameter k), i.e., the densest subgraph of size at least k. We give a (2 + e)-approximation algorithm for the densest subgraph problem. The at-least-k-densest subgraph is known to be NP-hard for the general case in the centralized setting and the best known algorithm gives a 2-approximation. We present an algorithm that maintains a (3+e)-approximation in our distributed, dynamic setting. Our algorithms run in O(Dlog n) time. © 2012 Authors.

Further refinement of the nature of the communication impairment in Cornelia de Lange syndrome

Purpose – Research into the communication skills of individuals with Cornelia de Lange syndrome (CdLS) is extremely limited. This paper aims to evaluate the nature of these skills and impairments in CdLS using a detailed informant assessment of pre-verbal communication skills.
Design/methodology/approach – The study used the Pre-verbal Communication Schedule to evaluate communication skills in individuals with CdLS (n ¼ 14), aged five to14 years. The group was compared with a contrast group of individuals with Cri du Chat syndrome (CdCS; n ¼ 14) who were matched for age and intellectual ability.
Findings – A significant difference was identified in understanding non-vocal communication (p , 0.005), with the CdLS group showing a greater deficit. These findings indicate the presence of a syndrome-specific deficit in understanding non-verbal communication in individuals with CdLS and suggest that there may be a dissociation between the processing of verbal and non-verbal communication.
Originality/value – The findings indicate that, in many ways, these two syndrome groups are not dissimilar in terms of their communication skills. However, individuals with CdLS show a syndrome-specific deficit in understanding non-vocal communication relative to the CdCS group.

BER Driven Synthesis for Directional Modulation Secured Wireless Communication

Directional modulation (DM) is a recently introduced technique for secure wireless transmission using direct physical layer wave-front manipulation. This paper provides a bit error rate (BER)-based DM array synthesis method. It is shown for the first time that the standard constellation mappings in In-phase and Quadrature (IQ) space to a pre-specified BER can be exactly achieved along a given specified spatial direction. Different receiver capabilities are investigated and different assessment metrics for each case are discussed. The approach is validated for a 1 × 4 element dipole array operating at 1 GHz.

Secure Communication in Cellular Networks: The Benefits of Millimeter Wave Mobile Broadband

This paper proposes millimeter wave (mmWave) mobile broadband for achieving secure communication in downlink cellular network. Analog beamforming with phase shifters is adopted for the mmWave transmission. The secrecy throughput is analyzed based on two different transmission modes, namely delay-tolerant transmission and delay-limited transmission. The impact of large antenna arrays at the mmWave frequencies on the secrecy throughput is examined. Numerical results corroborate our analysis and show that mmWave systems can enable significant secrecy improvement. Moreover, it is indicated that with large antenna arrays, multi-gigabit per second secure link at the mmWave frequencies can be reached in the delay-tolerant transmission mode and the adverse effect of secrecy outage vanishes in the delay-limited transmission mode.

How much do you need: a randomised experiment of whether readers can understand the key messages from summaries of Cochrane Reviews, without reading the full review?

Objective: We explored whether readers can understand key messages without having to read the full review, and if there were differences in understanding between various types of summary.
Design: A randomised experiment of review summaries which compared understanding of a key outcome.
Participants: Members of university staff (n = 36).
Setting: Universities on the island of Ireland.
Method: The Cochrane Review chosen examines the health impacts of the use of electric fans during heat waves. Participants were asked their expectation of the effect these would have on mortality. They were then randomly assigned a summary of the review (i.e. abstract, plain language summary, podcast or podcast transcription) and asked to spend a short time reading/listening to the summary. After this they were again asked about the effects of electric fans on mortality and to indicate if they would want to read the full Review.
Main outcome measure: Correct identification of a key review outcome.
Results: Just over half (53%) of the participants identified its key message on mortality after engaging with their summary. The figures were 33% for the abstract group, 50% for both the plain language and transcript groups and 78% for the podcast group.
Conclusions: The differences between the groups were not statistically significant but suggest that the audio summary might improve knowledge transfer compared to written summaries. These findings should be explored further using a larger sample size and with other reviews.