Multilevel election timing - A comparative overview

This article investigates the link between regionalization of the structure of government, regional elections and regionalism on the one hand, and the organization of state-wide political parties in Spain and the UK on the other. It particularly looks at two aspects of the relations between the central and regional levels of party organization: integration of the regional branches in central decision making and autonomy of the regional branches. It argues that the party factors are the most crucial elements explaining party change and that party leaders mediate between environmental changes and party organization. The parties' history and beliefs and the strength of the central leadership condition their ability or willingness to facilitate the emergence of meso-level elites. The institutional and electoral factors are facilitating factors that constitute additional motives for or against internal party decentralization.

Kingship by Descent or Kingship by Election? The Contested Title of James VI and I

Throughout the reign of Elizabeth I, a steady stream of tracts appeared in English print to vindicate the succession of the most prominent contenders, Mary and James Stuart of Scotland. This article offers a comprehensive account of the polemical battle between the supporters and opponents of the Stuarts, and further identifies various theories of English kingship, most notably the theory of corporate kingship, developed by the Stuart polemicists to defend the Scottish succession. James's accession to the English throne in March 1603 marked the protracted end of the debate over the succession. The article concludes by suggesting that, while powerfully renouncing the opposition to his succession, over the course of his attempt to unify his two kingdoms, James and his supporters ultimately departed from the polemic of corporate kingship, for a more assertive language of kingship by natural and divine law.

Interobserver Reliability of Radiologists' Interpretations of Mobile Chest Radiographs for Nursing Home-Acquired Pneumonia

Objectives: To determine the interobserver reliability of radiologists' interpretations of mobile chest radiographs for nursing home-acquired pneumonia. Design: A cross-sectional reliability study. Setting: Nursing homes and an acute care hospital. Participants: Four radiologists reviewed 40 mobile chest radiographs obtained from residents of nursing homes who met a clinical definition of lower respiratory tract infections. Measurements: Radiologists were asked to interpret radiographs with respect to the film quality; presence, pattern, and extent of an infiltrate; and the presence of a pleural effusion or adenopathy. Interrater reliability was evaluated using the intraclass correlation coefficient derived from a 2-way random effects model. Results: On average the radiologists reported that 6 of the 40 films were of very good or excellent quality and 16 of the 40 were of fair or poor quality. When the finding of an infiltrate was dichotomized (0 = no; 1 = possible, probable, or definite) all 4 radiologists agreed on 21 of the 37 chest radiographs. The intraclass correlation coefficient for the presence or absence of infiltrates was 0.54 (95% confidence intervals [CI] 0.38 to 0.69). For the 14 radiographs where infiltrates were observed by all radiologists, intraclass correlation coefficients for the presence of pleural effusions was 0.08 (95% CI -0.10 to 0.41), hilar adenopathy 0.54 (95% CI 0.29 to 0.79), and mediastinal adenopathy 0.49 (95% CI 0.21 to 0.76). Conclusion: In conclusion, the interrater agreement among radiologists for mobile chest radiographs in establishing the presence or absence of an infiltrate can be judged to be "fair." Treatment decisions need to include clinical findings and should not be made based on radiographic findings alone. © 2006 American Medical Directors Association.

A qualitative enquiry into the appropriation of mobile telephony at the bottom of the pyramid

Purpose: The paper aims to analyse Bottom of the Pyramid (BoP) customers’ (e.g. Bangladeshi farmers) use and appropriation of mobile telephony and to critically identify a suitable research strategy for such investigation.

Design/methodology/approach: Concentrated ethnographic immersion was combined with both methodological and investigator triangulation during a four-month period of fieldwork conducted in Bangladeshi villages to obtain more robust findings. Concentrated immersion was required to achieve relatively speedier engagement owing to the difficulty in engaging with respondents on a long-term basis.

Findings: The farmers’ use of mobile telephony went beyond the initial adoption, as they appropriated it through social and institutional support, inventive means and/or changes in their own lifestyle. The paper argues that technology appropriation, being a result of the mutual shaping of technology, human skills and abilities and macro-environmental factors, enables users to achieve desired outcomes which may not always be the ones envisaged by the original designers.

Research limitations/implications: The paper contributes to two major areas: first, it identifies technology appropriation as an important and emerging concept in international marketing research; second, it suggests a concentrated form of ethnographic engagement for studying technology appropriation in a developing country context.

Practical implications: A good understanding of the dynamic interplay between users’ skills and abilities, social contexts and technological artefacts/applications is required in order for businesses to serve BoP customers profitably.

Originality/value: The paper presents a dynamic model of technology appropriation based on findings collected through a pragmatic approach by combining concentrated ethnographic immersion with methodological and investigator triangulation

Making geography mobile: using location aware technology to improve student performance in physical geography

With the increased availability of new technologies, geography educators are revisiting their pedagogical approaches to teaching and calling for opportunities to share local and international practices which will enhance the learning experience and improve students’ performance. This paper reports on the use of handheld mobile devices, fitted with GPS, by secondary (high) school pupils in geography. Two location-aware activities were completed over one academic year (one per semester) and pre-test and post-test scores for both topics revealed a statistically significant increase in pupils’ performance as measured by the standard national assessments. A learner centred educational approach was adopted with the first mobile learning activity being created by the teacher as an exemplar of effective mobile learning design. Pupils built on their experiences of using mobile learning when they were required to created their own location aware learning task for peer use. An analysis of the qualitative data from the pupils’ journals, group diaries and focus group interviews revealed the five pillars of learner centred education are addressed when using location aware technologies and the use of handheld mobile devices offered greater flexibility and autonomy to the pupils thus altering the level of power and control away from the teacher. Due to the relatively small number of participants in the study, the results are more informative than generalisable however in light of the growing interest in geo-spatial technologies in geography education, this paper offers encouragement and insight into the use of location aware technology in a compulsory school context

Retrodirective Terminal Antenna for Satellite and Terrestrial Mobile Communications

The potential for implementation of retrodirective arrays as antenna terminals for future integrated satellite and terrestrial mobile communications is discussed in this paper. Particularly, in the context of the Inmarsat L-band system we address the issues related to array antenna element capacity to produce high-quality circular polarized radiation pattern over large angles of arrival. We also discuss circuitry reduction methodologies and their effect on retrodirected beam characteristics. The possibility of circular polarization modulation of the re-transmit signal is also discussed.

An exploration of seniors’ motivation to use mobile brain-exercise software

This article reports on the development of an iPhone-based brain-exercise tool for seniors involving a series of focus groups (FGs) and field trials (FTs). Four FGs with 34 participants were conducted aimed at understanding the underlying motivational and de-motivational factors influencing seniors’ engagement with mobile brain-exercise software. As part of the FGs, participants had approximately 40 minutes hands-on experience with commercially available brain-exercise software. A content analysis was conducted on the data resulting in a ranking of 19 motivational factors, of which the top three were challenge, usefulness and familiarity and 15 de-motivational factors, of which the top-three were usability issues, poor communication and games that were too fast. Findings were used to inform the design of three prototype brain-exercise games for the iPhone contained within one overall application, named Brain jog. Subsequently, two FTs were conducted using Brain jog to investigate the part that time exposure has to play in shaping the factors influencing engagement. New factors arose with respect to the initial FGs including the motivational factor feedback and the de-motivational factor boring. The results of this research provide valuable guidelines for the design and evaluation of mobile brain-exercise software for seniors.

Investigation of the M2/G2/1/ ∞, N Queue with Restricted Admission of Priority Customers and its Application to HSDPA Mobile Systems

This paper investigates a queuing system for QoS optimization of multimedia traffic consisting of aggregated streams with diverse QoS requirements transmitted to a mobile terminal over a common downlink shared channel. The queuing system, proposed for buffer management of aggregated single-user traffic in the base station of High-Speed Downlink Packet Access (HSDPA), allows for optimum loss/delay/jitter performance for end-user multimedia traffic with delay-tolerant non-real-time streams and partially loss tolerant real-time streams. In the queuing system, the real-time stream has non-preemptive priority in service but the number of the packets in the system is restricted by a constant. The non-real-time stream has no service priority but is allowed unlimited access to the system. Both types of packets arrive in the stationary Poisson flow. Service times follow general distribution depending on the packet type. Stability condition for the model is derived. Queue length distribution for both types of customers is calculated at arbitrary epochs and service completion epochs. Loss probability for priority packets is computed. Waiting time distribution in terms of Laplace-Stieltjes transform is obtained for both types of packets. Mean waiting time and jitter are computed. Numerical examples presented demonstrate the effectiveness of the queuing system for QoS optimization of buffered end-user multimedia traffic with aggregated real-time and non-real-time streams.

CoWiSMoN: A Framework for Cognitive Wireless Sensor Mobile Network System for Emergency Rescue Management

One of the crucial aspects of disaster management of emergency situations is the early assessment of needs and damages. In most disaster situations, higher fatality and increased casualty results from lack of access to timely available emergency services rather than the initial disaster itself. This is usually caused by lack of access to the affected area in order to properly assess the situation for relevant and urgent measures. Cognitive wireless sensor networks provide an opportunity to overcome this situation especially through interconnection via mobile systems. This paper presents a cognitive wireless sensor mobile networks-based framework (CoWiSMoN), designed to offer real-time emergency services to victims and rescue personnel in event of disasters. Critical issues underlying the implementation of such a system are discussed and analyzed.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.