Directed shortest paths via approximate cost balancing

We present an O(nm) algorithm for all-pairs shortest paths computations in a directed graph with n nodes, m arcs, and nonnegative integer arc costs. This matches the complexity bound attained by Thorup [31] for the all-pairs problems in undirected graphs. The main insight is that shortest paths problems with approximately balanced directed cost functions can be solved similarly to the undirected case. The algorithm finds an approximately balanced reduced cost function in an O(m √ n log n) preprocessing step. Using these reduced costs, every shortest path query can be solved in O(m) time using an adaptation of Thorup’s component hierarchy method. The balancing result can also be applied to the ℓ∞-matrix balancing problem

Artificial leaf device for hydrogen generation from immobilised C. reinhardtii microalgae

We developed a fully biomimetic leaf-like device for hydrogen production which allows incorporated fabric-immobilised microalgae culture to be simultaneously hydrated with media and harvested from the produced hydrogen in a continuous flow regime without the need to replace the algal culture. Our leaf device produces hydrogen by direct photolysis of water resulting from redirecting the photosynthetic pathways in immobilised microalgae due to the lack of oxygen. In contrast to the many other reports in the literature on batch photobioreactors producing hydrogen from suspension culture of microalgae, we present the first report where this is done in a continuous manner from a fabric-immobilised microalgae culture. The reported artificial leaf device maximises the sunlight energy utilisation per gram of algae and can be upscaled cheaply and easily to cover large areas. We compared the production of hydrogen from both immobilised and suspended cultures of C. reinhardtii microalgae under sulphur, phosphorus and oxygen deprived conditions. The viability and potential of this approach is clearly demonstrated. Even though this is a first prototype, the hydrogen yield of our artificial leaf device is twenty times higher per gram of algae than in previously the reported batch reactors. Such leaf-like devices could potentially be made from flexible plastic sheets and installed on roofs and other sun-exposed surfaces that are inaccessible by photovoltaic cells. The ability to continuously produce inexpensive hydrogen by positioning inexpensive sheets onto any surface could have an enormous importance in the field of biofuels. The proposed new concept can provide a cleaner and very inexpensive way of bio-hydrogen generation by flexible sheet-like devices

Profile-Based Optimal Matchings in the Student-Project Allocation Problem

In the Student/Project Allocation problem (spa) we seek to assign students to individual or group projects offered by lecturers. Students provide a list of projects they find acceptable in order of preference. Each student can be assigned to at most one project and there are constraints on the maximum number of students that can be assigned to each project and lecturer. We seek matchings of students to projects that are optimal with respect to profile, which is a vector whose rth component indicates how many students have their rth-choice project. We present an efficient algorithm for finding agreedy maximum matching in the spa context – this is a maximum matching whose profile is lexicographically maximum. We then show how to adapt this algorithm to find a generous maximum matching – this is a matching whose reverse profile is lexicographically minimum. Our algorithms involve finding optimal flows in networks. We demonstrate how this approach can allow for additional constraints, such as lecturer lower quotas, to be handled flexibly

Ground Versus Unground Grain for Lactating Dairy Cows.

25 p

Dynamic hierarchies in temporal directed networks

The outcome of interactions in many real-world systems can be often explained by a hierarchy between the participants. Discovering hierarchy from a given directed network can be formulated as follows: partition vertices into levels such that, ideally, there are only forward edges, that is, edges from upper levels to lower levels. In practice, the ideal case is impossible, so instead we minimize some penalty function on the backward edges. One practical option for such a penalty is agony, where the penalty depends on the severity of the violation. In this paper we extend the definition of agony to temporal networks. In this setup we are given a directed network with time stamped edges, and we allow the rank assignment to vary over time. We propose 2 strategies for controlling the variation of individual ranks. In our first variant, we penalize the fluctuation of the rankings over time by adding a penalty directly to the optimization function. In our second variant we allow the rank change at most once. We show that the first variant can be solved exactly in polynomial time while the second variant is NP-hard, and in fact inapproximable. However, we develop an iterative method, where we first fix the change point and optimize the ranks, and then fix the ranks and optimize the change points, and reiterate until convergence. We show empirically that the algorithms are reasonably fast in practice, and that the obtained rankings are sensible

Longitudinal Changes in Physical Caregiving for Parents of Children with Cerebral Palsy.

Aims: To determine changes in physical caregiving for parents of children with cerebral palsy (CP) over a two-year period based on children’s gross motor function level and age. Methods: 153 parents of children with CP rated their physical caregiving using the Ease of Caregiving for Children three times over two years. Parents and assessors classified children’s gross motor function using the Gross Motor Function Classification System (GMFCS). Physical caregiving was compared at three test times among parents of children grouped by GMFCS level (I, II–III, and IV–V) and age (1.7–5.9 and 6–11 years) using a three-way mixed ANOVA. Results: Among all analyses, a two-way interaction was found between children’s GMFCS level and test time on ease of caregiving, p \u3c 0.01. Change over two-year period was found for parents of children in level I and II–III, p \u3c 0.01, but not parents of children in levels IV–V. At each test time, parents of children in level I reported the greatest ease of caregiving followed by parents of children in levels II–III, and levels IV–V, who reported the lowest ease of caregiving, p \u3c 0.001. Conclusions: Findings support evaluation and monitoring of physical caregiving for parents of children with CP over time

Who Should Regulate Disruptive Technology?

The primary concern of the present paper is the cost of acquiring information by judges and legislators in the process of regulating new technologies. The paper distinguishes between risky and uncertain applications of technology. A risky technology poses an obvious risk, and the problem before the regulator is one of comparing cost and benefit. We argue that the judiciary, which acquires information gratis from litigants, is better suited to the regulation of risky technologies. Uncertain technologies, on the other hand, can be harmful in ways which cannot be foreseen at the time of the technological innovation. Cost and benefit are incalculable; regulation must instead be based on subjective preferences about the degree of uncertainty that society should tolerate. Legislative law-making is designed with a view to aggregating subjective preferences. Accordingly, uncertain technologies should be regulated through statute

Ground Versus Unground Grain for Lactating Dairy Cows.

25 p

Visual-to-auditory sensory substitution alters language asymmetry in both sighted novices and experienced visually impaired users

Visual-to-auditory sensory substitution devices (SSDs) provide improved access to the visual environment for the visually impaired by converting images into auditory information. Research is lacking on the mechanisms involved in processing data that is perceived through one sensory modality, but directly associated with a source in a different sensory modality. This is important because SSDs that use auditory displays could involve binaural presentation requiring both ear canals, or monaural presentation requiring only one – but which ear would be ideal? SSDs may be similar to reading, as an image (printed word) is converted into sound (when read aloud). Reading, and language more generally, are typically lateralised to the left cerebral hemisphere. Yet, unlike symbolic written language, SSDs convert images to sound based on visuospatial properties, with the right cerebral hemisphere potentially having a role in processing such visuospatial data. Here we investigated whether there is a hemispheric bias in the processing of visual-to-auditory sensory substitution information and whether that varies as a function of experience and visual ability. We assessed the lateralization of auditory processing with two tests: a standard dichotic listening test and a novel dichotic listening test created using the auditory information produced by an SSD, The vOICe. Participants were tested either in the lab or online with the same stimuli. We did not find a hemispheric bias in the processing of visual-to-auditory information in visually impaired, experienced vOICe users. Further, we did not find any difference between visually impaired, experienced vOICe users and sighted novices in the hemispheric lateralization of visual-to-auditory information processing. Although standard dichotic listening is lateralised to the left hemisphere, the auditory processing of images in SSDs is bilateral, possibly due to the increased influence of right hemisphere processing. Auditory SSDs might therefore be equally effective with presentation to either ear if a monaural, rather than binaural, presentation were necessary