Unconventional Charge Density Wave Arising from Electron–Phonon Interaction

We report of a theoretical study on quasi-one dimensional unconventional charge density wave (UCDW) driven by electron–phonon interaction. Within mean field theory, we find that the wavevector dependence of the coupling leads to a momentum dependent single particle gap on the Fermi surface. The presence of small energy single particle excitations around the gap nodes significantly changes the optical conductivity compared to the conventional CDW result. In addition to that, the collective phase excitation arising from fluctuation of the order parameter leads to further qualitative changes of the conductivity and results in an effective mass that is nonmonotonic in temperature.      

Differential Subcellular Distribution of Cytokinins: How Does Membrane Transport Fit into the Big Picture?

Cytokinins are a class of phytohormones, signalling molecules specific to plants. They act as regulators of diverse physiological processes in complex signalling pathways. It is necessary for plants to continuously regulate cytokinin distribution among different organs, tissues, cells, and compartments. Such regulatory mechanisms include cytokinin biosynthesis, metabolic conversions and degradation, as well as cytokinin membrane transport. In our review, we aim to provide a thorough picture of the latter. We begin by summarizing cytokinin structures and physicochemical properties. Then, we revise the elementary thermodynamic and kinetic aspects of cytokinin membrane transport. Next, we review which membrane-bound carrier proteins and protein families recognize cytokinins as their substrates. Namely, we discuss the families of “equilibrative nucleoside transporters” and “purine permeases”, which translocate diverse purine-related compounds, and proteins AtPUP14, AtABCG14, AtAZG1, and AtAZG2, which are specific to cytokinins. We also address long-distance cytokinin transport. Putting all these pieces together, we finally discuss cytokinin distribution as a net result of these processes, diverse in their physicochemical nature but acting together to promote plant fitness.     

An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping

Journal of Scheduling - Rapid growth of demand for remote computational power, along with high energy costs and infrastructure limits, has led to treating power usage as a primary constraint in...     

SONIC: streaming overlapping community detection

A community within a graph can be broadly defined as a set of vertices that exhibit high cohesiveness (relatively high number of edges within the set) and low conductance (relatively low number of edges leaving the set). Community detection is a fundamental graph processing analytic that can be applied to several application domains, including social networks. In this context, communities are often overlapping, as a person can be involved in more than one community (e.g., friends, and family); and evolving, since the structure of the network changes. We address the problem of streaming overlapping community detection, where the goal is to maintain communities in the presence of streaming updates. This way, the communities can be updated more efficiently. To this end, we introduce SONIC—a find-and-merge type of community detection algorithm that can efficiently handle streaming updates. SONIC first detects when graph updates yield significant community changes. Upon the detection, it updates the communities via an incremental merge procedure. The SONIC algorithm incorporates two additional techniques to speed-up the incremental merge; min-hashing and inverted indexes. Results show that SONIC can provide high quality overlapping communities, while handling streaming updates several orders of magnitude faster than the alternatives performing from-scratch computation.     

Modelling and solving grid resource allocation problem with network resources for workflow applications

A problem of allocating resources of a grid to workflow applications is considered. The problem consists, generally, in allocating distributed grid resources to tasks of a workflow in such a way that the resource demands of each task are satisfied. Grid resources are divided into computational resources and network resources. Computational tasks and transmission tasks of a workflow are distinguished. We present a model of the problem, and an algorithm for finding feasible resource allocations. A numerical example is included, showing the importance of the resource allocation phase on a grid. Some conclusions and directions for future research are given.     

Understanding dengue fever dynamics: a study of seasonality in vector-borne disease models

Dengue fever dynamics show seasonality, with the disease transmission being higher during the warmer seasons. In this paper, we analyse seasonally forced epidemic models with and without vector dynamics. We assume small seasonal effects and obtain approximations for the real response of each state variable and also for the corresponding amplitude and phase via decomposition of the sinusoidal forcing into imaginary exponential functions. The analysis begins with the simplest susceptible-infected-susceptible (SIS) model, followed by the simplest model with vector dynamics, susceptible-infected-susceptible for hosts and uninfected-vector (SISUV). Finally, we compare the more complex susceptible-infected-recovered (SIR) and susceptible-infected-recovered for hosts and uninfected-vector (SIRUV) models and conclude that the models give basically the same information when we replace, in the SIR model, the human infectivity by a function of both human and mosquito infectivities.     

Free binary decision diagrams for the computation of EAR n

Free binary decision diagrams (FBDDs) are graph-based data structures representing Boolean functions with the constraint (additional to binary decision diagram) that each variable is tested at most once during the computation. The function EAR_n is the following Boolean function defined for n × n Boolean matrices: EAR_n(M) = 1 iff the matrix M contains two equal adjacent rows. We prove that each FBDD computing EAR_n has size at least and we present a construction of such diagrams of size approximately .     

Kidney injury and cell therapy: Preclinical study

The aim of this study is to show histological and immunofluorescence analysis of renal parenchyma of agoutis affected by gentamicin‐induced renal disease after the infusion of bone marrow mononuclear cells (BMMC) stained with Hoechst®. Nine agouti's males were divided into three groups: Test group (TG): renal disease by gentamicin induced (n = 3), cell therapy group (CTG): renal disease by gentamicin induced and BMMC infusion (n = 3), and control group (CG): nonrenal disease and BMMC infusion (n = 3). TG and CTG were submitted to the protocol of renal disease induction using weekly application of gentamicin sulfate for 4 months. CG and CTG received a 1 × 108 BMMC stained with Hoechst and were euthanized for kidney examination 21 days after BMMC injection and samples were collected for histology and immunofluorescence analysis. Histological analysis demonstrated typical interstitial lesions in kidney similarly to human disease, as tubular necrosis, glomerular destruction, atrophy tubular, fibrotic areas, and collagen deposition. We conclude that histological analysis suggest a positive application of agouti's as a model for a gentamicin inducing of kidney disease, beyond the immunofluorescence analysis suggest a significant migration of BMMC to sites of renal injury in CTG. Microsc. Res. Tech., 2012. © 2011 Wiley Periodicals, Inc.     

Auto-tuning Similarity Search Algorithms on Multi-core Architectures

In recent times, large high-dimensional datasets have become ubiquitous. Video and image repositories, financial, and sensor data are just a few examples of such datasets in practice. Many applications that use such datasets require the retrieval of data items similar to a given query item, or the nearest neighbors (NN or $k$ -NN) of a given item. Another common query is the retrieval of multiple sets of nearest neighbors, i.e., multi $k$ -NN, for different query items on the same data. With commodity multi-core CPUs becoming more and more widespread at lower costs, developing parallel algorithms for these search problems has become increasingly important. While the core nearest neighbor search problem is relatively easy to parallelize, it is challenging to tune it for optimality. This is due to the fact that the various performance-specific algorithmic parameters, or “tuning knobs”, are inter-related and also depend on the data and query workloads. In this paper, we present (1) a detailed study of the various tuning knobs and their contributions on increasing the query throughput for parallelized versions of the two most common classes of high-dimensional multi-NN search algorithms: linear scan and tree traversal, and (2) an offline auto-tuner for setting these knobs by iteratively measuring actual query execution times for a given workload and dataset. We show experimentally that our auto-tuner reaches near-optimal performance and significantly outperforms un-tuned versions of parallel multi-NN algorithms for real video repository data on a variety of multi-core platforms.