Anti-Alienism in New Zealand during the Great War: The von Zedlitz Affair, 1915

This article examines the role played by the New Zealand popular press in fostering anti-German sentiment during the Great War. In particular, it focuses on the case of George von Zedlitz, a Wellington academic, who for 12 months after the war's declaration, evaded government legislation intended to dismiss all enemy aliens from their posts, and intern those regarded as a danger to home security. Weekly journals led the campaign against the professor and fed the public's growing interest in the case. The affair sparked considerable public and private debate to the extent that by August 1915 the New Zealand Government was pressured into introducing the Alien Enemy Teachers' Act, which led to von Zedlitz being dismissed from his position.     

Information exchange with collision detection on multiple channels

Information exchange is a fundamental communication primitive in radio networks. We study this problem in multi-channel single-hop networks. In particular, given \(k\) pieces of information, initially stored in \(k\) nodes respectively, the task is to broadcast these information pieces to the entire network via a set of \(\mathcal {F}\) channels. We develop efficient distributed algorithms for this task for the scenario where both the identities and the number \(k\) of the initial information holders are unknown to the participating nodes. Assuming nodes with collision detection, we present an efficient randomized algorithm for unrestricted information exchange, where multiple information items can be combined into a single message. The algorithm disseminates all the information items within \(O(\frac{k}{\mathcal {F}}+\mathcal {F}\log ^2n)\) timeslots with high probability. To the best of our knowledge, this is the first algorithm that breaks the \(\varOmega (k)\) lower bound for unrestricted information exchange if only a single channel is available. This result establishes the superiority of multiple channels for the task of unrestricted information exchange. Moreover, for restricted information exchange, where each message can carry only one information item, we devise a randomized algorithm that completes the task in \(O(k+\frac{\log ^2n}{\mathcal {F}}+\log n)\) timeslots. When \(k\) is large, both algorithms are asymptotically optimal, as they can reach the trivial lower bounds of \(\varOmega (\frac{k}{\mathcal {F}})\) and \(\varOmega (k)\) for unrestricted and restricted information exchange, respectively.     

Constrained pairwise and center-star sequences alignment problems

This paper considers the minimax regret vertex 2-sink location problem in a dynamic path network with positive edge lengths and uniform edge capacity. Let \(P\) be an undirected path graph of \(n\) vertices, and the weight (initial supply) of every vertex is known as an interval. The problem is to find two vertices \(x\) and \(y\) as two sinks on the path such that all the weights can evacuate to \(x\) and \(y\) with minimum regret of evacuation time in case of an emergency for any possible weight distribution. We present an \(O(n^3\log n)\) time algorithm.     

Distributed wireless link scheduling in the SINR model

We present an approximation algorithm for wireless link scheduling under the physical SINR interference model. In the link scheduling problem, it is given a set of \(n\) links in a metric space, each of which is a sender–receiver pair, and the objective is to schedule the links using the minimum amount of time. We focus on a variant of this fundamental problem where the power is fixed, i.e., the power assignment of links is given as part of the input. Specifically, we consider an important category of power assignments called length-monotone sublinear power assignment, which includes the widely studied uniform, mean and linear power assignments. We present a distributed algorithm that can schedule all links in \(O(\log \varDelta (I_{max}+\log ^3n))\) rounds with high probability, where \(\varDelta \) is the ratio between the longest link and the shortest link and \(I_{max}\) is the maximum nearly-equilength class affectance of the link set. It is shown that the proposed algorithm is \(O(\log \varDelta )\) approximate to the optimal schedule in dense networks with \(I_{max}\in \varOmega (\log ^3n)\). To the best of our knowledge, our algorithm is the first distributed one whose approximation ratio is independent of the network size \(n\). Our result also shows that the \(\varOmega (\log n)\) lower bound (Halldórsson and Mitra in: ICALP, 2011) on the approximation ratio does not hold for link sets with \(\log \varDelta \in o(\log n)\).     

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing

In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional space, any two dimensions i and j define a space P _ij . When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items, and 90^°-rotation on any plane P _ij is allowed. The objective is to minimize the total number of bins used for packing all these items in the sequence. In the 1-space bounded variant, there is only one active bin for packing the current item. If the active bin does not have enough space to pack the item, it must be closed and a new active bin is opened. For d-dimensional bin packing, an online algorithm with competitive ratio 4 ^d is given. Moreover, we consider d-dimensional hypercube packing, and give a 2 ^d+1-competitive algorithm. These two results are the first study on 1-space bounded multi dimensional bin packing and hypercube packing.     

The Relation between Accounting Conservatism and Corporate Social Performance: An Empirical Investigation

Accounting conservatism and corporate social responsibility have received much attention in the recent literature. The current study draws upon Watts, who recognizes that one role of conservatism is to reduce the likelihood of excess wealth transfers to its stakeholder groups and Post et al., who assert that a key aspect of positive corporate social performance is the (equitable) distribution of corporate wealth. Accordingly, this study empirically investigates and finds a positive relation between conservatism and strong social performance.     

Use and misuse of levels of analysis in leadership research: An illustrative review of leader–member exchange

Prior reviews have focused on if leadership literature pays homage to levels of analysis; our purpose is to take stock of how well and in what ways levels issues are implemented in theory and hypotheses formulation, construct conceptualization, measurement, and data analysis. To illustrate these notions, we provide an in-depth review of 163 multi-level empirical leader–member exchange (LMX) and vertical dyad linkage (VDL) studies published between 1972 and 2012. Our findings indicate that the volume of multi-level studies in LMX has drastically increased recently and the majority of these studies cast theory and hypotheses at the same level. With regard to alignment of levels of theory/hypotheses with measurement and with data analyses, however, roughly one out of two published studies suffers from misalignment of levels. Most of this misalignment occurs in studies where the dyad level of analysis, a key component of LMX, is an explicit or implicit focus. We conclude with a discussion of the implications for the LMX literature, and present recommendations to guide multi-level leadership research.     

Analyzing propensity matched zero-inflated count outcomes in observational studies

Determining the effectiveness of different treatments from observational data, which are characterized by imbalance between groups due to lack of randomization, is challenging. Propensity matching is often used to rectify imbalances among prognostic variables. However, there are no guidelines on how appropriately to analyze group matched data when the outcome is a zero-inflated count. In addition, there is debate over whether to account for correlation of responses induced by matching and/or whether to adjust for variables used in generating the propensity score in the final analysis. The aim of this research is to compare covariate unadjusted and adjusted zero-inflated Poisson models that do and do not account for the correlation. A simulation study is conducted, demonstrating that it is necessary to adjust for potential residual confounding, but that accounting for correlation is less important. The methods are applied to a biomedical research data set.