Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems

On the importance of sluggish state memory for learning long term dependency

The vanishing gradients problem inherent in Simple Recurrent Networks (SRN) trained with back-propagation, has led to a significant shift towards the use of Long Short-term Memory (LSTM) and Echo State Networks (ESN), which overcome this problem through either second order error-carousel schemes or different learning algorithms respectively. This paper re-opens the case for SRN-based approaches, by considering a variant, the Multi-recurrent Network (MRN). We show that memory units embedded within its architecture can ameliorate against the vanishing gradient problem, by providing variable sensitivity to recent and more historic information through layer- and self-recurrent links with varied weights, to form a so-called sluggish state-based memory. We demonstrate that an MRN, optimised with noise injection, is able to learn the long term dependency within a complex grammar induction task, significantly outperforming the SRN, NARX and ESN. Analysis of the internal representations of the networks, reveals that sluggish state-based representations of the MRN are best able to latch on to critical temporal dependencies spanning variable time delays, to maintain distinct and stable representations of all underlying grammar states. Surprisingly, the ESN was unable to fully learn the dependency problem, suggesting the major shift towards this class of models may be premature

Cardiorespiratory fitness is associated with physical literacy in a large sample of Canadian children aged 8 to 12 years

Background The associations between cardiorespiratory fitness (CRF) and physical literacy in children are largely unknown. The aim of this study was to assess the relationships between CRF, measured using the 20-m shuttle run test (20mSRT), and components of physical literacy among Canadian children aged 8–12 years. Methods A total of 9393 (49.9% girls) children, with a mean (SD) age of 10.1 (±1.2) years, from a cross-sectional surveillance study were included for this analysis. The SRT was evaluated using a standardized 15 m or 20 m protocol. All 15 m SRTs were converted to 20mSRT values using a standardized formula. The four domains of physical literacy (Physical Competence, Daily Behaviour, Motivation and Confidence, and Knowledge and Understanding) were measured using the Canadian Assessment of Physical Literacy. Tertiles were identified for 20mSRT laps, representing low, medium, and high CRF for each age and gender group. Cohen’s d was used to calculate the effect size between the low and high CRF groups. Results CRF was strongly and favourably associated with all components of physical literacy among school-aged Canadian children. The effect size between low and high CRF tertile groups was large for the Physical Competence domain (Cohen’s d range: 1.11–1.94) across age and gender groups, followed by moderate to large effect sizes for Motivation and Confidence (Cohen’s d range: 0.54–1.18), small to moderate effect sizes for Daily Behaviour (Cohen’s d range: 0.25–0.81), and marginal to moderate effect sizes for Knowledge and Understanding (Cohen’s d range: 0.08–0.70). Conclusions This study identified strong favourable associations between CRF and physical literacy and its constituent components in children aged 8–12 years. Future research should investigate the sensitivity and specificity of the 20mSRT in screening those with low physical literacy levels

Models and algorithms for energy-efficient scheduling with immediate start of jobs

We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. Such a condition is typical for modern Cloud computing systems with abundant resources. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost of running. We demonstrate that the basic scheduling model to minimize the aggregated cost function with n jobs is solvable in O(nlogn) time in the single-machine case and in O(n²m) time in the case of m parallel machines. We also address additional features, e.g., the cost of job rejection or the cost of initiating a machine. In the case of a single machine, we present algorithms for minimizing one of the cost functions subject to an upper bound on the value of the other, as well as for finding a Pareto-optimal solution

Recurrent governance challenges in the implementation and alignment of flood risk management strategies: a review

In Europe increasing flood risks challenge societies to diversify their Flood Risk Management Strategies (FRMSs). Such a diversification implies that actors not only focus on flood defence, but also and simultaneously on flood risk prevention, mitigation, preparation and recovery. There is much literature on the implementation of specific strategies and measures as well as on flood risk governance more generally. What is lacking, though, is a clear overview of the complex set of governance challenges which may result from a diversification and alignment of FRM strategies. This paper aims to address this knowledge gap. It elaborates on potential processes and mechanisms for coordinating the activities and capacities of actors that are involved on different levels and in different sectors of flood risk governance, both concerning the implementation of individual strategies and the coordination of the overall set of strategies. It identifies eight overall coordination mechanisms that have proven to be useful in this respect

A genetic algorithm for the one-dimensional cutting stock problem with setups

This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and also practical instances from a chemical-fiber company. The computational results show that the method is efficient and obtains positive results when compared to other methods from the literature. © 2014 Brazilian Operations Research Society

Integration of P2Y receptor-activated signal transduction pathways in G protein-dependent signalling networks

The role of nucleotides in intracellular energy provision and nucleic acid synthesis has been known for a long time. In the past decade, evidence has been presented that, in addition to these functions, nucleotides are also autocrine and paracrine messenger molecules that initiate and regulate a large number of biological processes. The actions of extracellular nucleotides are mediated by ionotropic P2X and metabotropic P2Y receptors, while hydrolysis by ecto-enzymes modulates the initial signal. An increasing number of studies have been performed to obtain information on the signal transduction pathways activated by nucleotide receptors. The development of specific and stable purinergic receptor agonists and antagonists with therapeutical potential largely contributed to the identification of receptors responsible for nucleotide-activated pathways. This article reviews the signal transduction pathways activated by P2Y receptors, the involved second messenger systems, GTPases and protein kinases, as well as recent findings concerning P2Y receptor signalling in C6 glioma cells. Besides vertical signal transduction, lateral cross-talks with pathways activated by other G protein-coupled receptors and growth factor receptors are discussed