Cooling Strategies for Greenhouses in Summer: Control of Fogging by Pulse Width Modulation

The possibilities for improving the control of greenhouse fogging systems, were studied by comparing several combinations of ventilation cooling techniques, shade screening and low-pressure fogging. The study was divided into three parts: experiments, modelling and simulations. In the first part of the paper, ten combinations of five cooling techniques were tested during the summers of 2002 and 2003 in a 132m2 greenhouse with a steel structure and a single-layer methacrylate cover located in Madrid, Spain. An analysis of variance of the climatic parameters was carried out to determine which combinations produced significant differences in inside temperature or relative humidity. Comparing the values for the inside to outside temperature difference, the combination of a shade screen and above-screen fogging achieved a difference in temperature almost the same as that for under-screen fogging, but the relative humidity was significantly lower. In the second part of the study a dynamic model was developed (2002) and validated (2003). The mean absolute error obtained for inside temperature was similar in the fit and the validation and it was less than 1.5 1C in both cases. The model was used to simulate the inside air temperature for a fog system working without shading, and above and under a shade screen. Control algorithms were developed for reducing system water consumption. In the three cases a simple on/off control with a fixed fogging cycle was compared with a pulse width modulation (PWM) strategy, in which the duration of the fogging pulse was increased as a function of inside temperature. The strategies with PWM applied to the fog system were able to reduce water consumption by 8–15% with respect to the strategies with a fixed fogging cycle

Trapping in complex networks

We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $\rho(t)$ of random walkers in the presence of one or multiple traps with concentration $c$. We show using theory and simulations that in ER networks, while for short times $\rho(t) \propto \exp(-Act)$, for longer times $\rho(t)$ exhibits a more complex behavior, with explicit dependence on both the number of traps and the size of the network. In SF networks we reveal the significant impact of the trap's location: $\rho(t)$ is drastically different when a trap is placed on a random node compared to the case of the trap being on the node with the maximum connectivity. For the latter case we find \rho(t)\propto\exp\left[-At/N^\frac{\gamma-2}{\gamma-1}\av{k}\right] for all $\gamma>2$, where $\gamma$ is the exponent of the degree distribution $P(k)\propto k^{-\gamma}$.Comment: Appendix adde

Detection of Composite Communities in Multiplex Biological Networks

The detection of community structure is a widely accepted means of investigating the principles governing biological systems. Recent efforts are exploring ways in which multiple data sources can be integrated to generate a more comprehensive model of cellular interactions, leading to the detection of more biologically relevant communities. In this work, we propose a mathematical programming model to cluster multiplex biological networks, i.e. multiple network slices, each with a different interaction type, to determine a single representative partition of composite communities. Our method, known as SimMod, is evaluated through its application to yeast networks of physical, genetic and co-expression interactions. A comparative analysis involving partitions of the individual networks, partitions of aggregated networks and partitions generated by similar methods from the literature highlights the ability of SimMod to identify functionally enriched modules. It is further shown that SimMod offers enhanced results when compared to existing approaches without the need to train on known cellular interactions

Exact eigenvalue spectrum of a class of fractal scale-free networks

The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties. We study the transition matrix of a family of fractal scale-free networks and analytically determine all the eigenvalues and their degeneracies. We then use these eigenvalues to evaluate the closed-form solution to the eigentime for random walks on the networks under consideration. Through the connection between the spectrum of transition matrix and the number of spanning trees, we corroborate the obtained eigenvalues and their multiplicities.Comment: Definitive version accepted for publication in EPL (Europhysics Letters

Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks

A lot of previous work showed that the sectional mean first-passage time (SMFPT), i.e., the average of mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) averaged over all starting points in scale-free small-world networks exhibits a sublinear or linear dependence on network order $N$ (number of nodes), which indicates that hub nodes are very efficient in receiving information if one looks upon the random walker as an information messenger. Thus far, the efficiency of a hub node sending information on scale-free small-world networks has not been addressed yet. In this paper, we study random walks on the class of Koch networks with scale-free behavior and small-world effect. We derive some basic properties for random walks on the Koch network family, based on which we calculate analytically the partial mean first-passage time (PMFPT) defined as the average of MFPTs from a hub node to all other nodes, excluding the hub itself. The obtained closed-form expression displays that in large networks the PMFPT grows with network order as $N \ln N$, which is larger than the linear scaling of SMFPT to the hub from other nodes. On the other hand, we also address the case with the information sender distributed uniformly among the Koch networks, and derive analytically the entire mean first-passage time (EMFPT), namely, the average of MFPTs between all couples of nodes, the leading scaling of which is identical to that of PMFPT. From the obtained results, we present that although hub nodes are more efficient for receiving information than other nodes, they display a qualitatively similar speed for sending information as non-hub nodes. Moreover, we show that the location of information sender has little effect on the transmission efficiency. The present findings are helpful for better understanding random walks performed on scale-free small-world networks.Comment: Definitive version published in European Physical Journal

Role of fractal dimension in random walks on scale-free networks

Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free networks has been rarely addressed, despite the fact that such networks are ubiquitous in real-life world. In this paper, we study the trapping problem on two families of networks. The first is deterministic, often called $(x,y)$-flowers; the other is random, which is a combination of $(1,3)$-flower and $(2,4)$-flower and thus called hybrid networks. The two network families display rich behavior as observed in various real systems, as well as some unique topological properties not shared by other networks. We derive analytically the average trapping time for random walks on both the $(x,y)$-flowers and the hybrid networks with an immobile trap positioned at an initial node, i.e., a hub node with the highest degree in the networks. Based on these analytical formulae, we show how the average trapping time scales with the network size. Comparing the obtained results, we further uncover that fractal dimension plays a decisive role in the behavior of average trapping time on fractal scale-free networks, i.e., the average trapping time decreases with an increasing fractal dimension.Comment: Definitive version published in European Physical Journal

Treponema denticola chymotrypsin-like proteinase may contribute to orodigestive carcinogenesis through immunomodulation

Background: Periodontal pathogens have been linked to oral and gastrointestinal (orodigestive) carcinogenesis. However, the exact mechanisms remain unknown. Treponema denticola (Td) is associated with severe periodontitis, a chronic inflammatory disease leading to tooth loss. The anaerobic spirochete Td is an invasive bacteria due to its major virulence factor chymotrypsin-like proteinase. Here we aimed to investigate the presence of Td chymotrypsin-like proteinase (Td-CTLP) in major orodigestive tumours and to elucidate potential mechanisms for Td to contribute to carcinogenesis. Methods: The presence of Td-CTLP within orodigestive tumour tissues was examined using immunohistochemistry. Oral, tonsillar, and oesophageal squamous cell carcinomas, alongside gastric, pancreatic, and colon adenocarcinomas were stained with a Td-CTLP-specific antibody. Gingival tissue from periodontitis patients served as positive controls. SDS-PAGE and immunoblot were used to analyse the immumodulatory activity of Td-CTLP in vitro. Results: Td-CTLP was present in majority of orodigestive tumour samples. Td-CTLP was found to convert pro MMP-8 and -9 into their active forms. In addition, Td-CTLP was able to degrade the proteinase inhibitors TIMP-1, TIMP-2, and alpha-1-antichymotrypsin, as well as complement C1q. Conclusions: Because of its presence within tumours and regulatory activity on proteins critical for the regulation of tumour microenvironment and inflammation, the Td-CTLP may contribute to orodigestive carcinogenesis.Peer reviewe

Mean first-passage time for random walks on undirected networks

In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of an associated matrix similar to the transition matrix. We then apply the formula to derive a lower bound for the MFPT to arrive at a given node with the starting point chosen from the stationary distribution over the set of nodes. We show that for a correlated scale-free network of size $N$ with a degree distribution $P(d)\sim d^{-\gamma}$, the scaling of the lower bound is $N^{1-1/\gamma}$. Also, we provide a simple derivation for an eigentime identity. Our work leads to a comprehensive understanding of recent results about random walks on complex networks, especially on scale-free networks.Comment: 7 pages, no figures; definitive version published in European Physical Journal

Vineyard microclimate and yield under different plastic covers.

The use of plastic cover in vineyards minimizes effects of adverse weather conditions. The northwest of São Paulo State is one of the largest grape producing regions in Brazil; however, few studies investigate the effects of different plastic covers on vineyards in this region. This study compared the effect of black shading screen (BSS) and braided polypropylene film (BPF) on BRS Morena vineyard microclimate, grown on an overhead trellis system in the northwestern São Paulo. The experiments were carried out during three growing seasons (2012 ? 2014). BSS allowed superior incoming solar radiation (SR) transmissivity, resulting in higher net radiation (Rn), and higher ratio between photosynthetically active (PAR) and SR. No differences were observed between the average air temperatures (T) and relative humidity (RH) of covered environments (BPF and BSS) and outside condition (automatic weather station ? AWS), due to high air circulation, despite wind speed (WS) reduction caused by plastic covers. BPF provided better conditions for vineyard growth with higher fruit yield than vineyard under BSS regarding the number of shoots with bunches per plant, bunch and stem weights, longitudinal diameter of berries, quantity of fertile buds per shoot, and yield per shoot and per plant. BPF covers also influenced leaf size and growth speed of plants in vineyards. Keywords Black shading screen . Braided polypropylene film . BRS Morena . Leaf wetness duration . Yiel

Angiogenesis extent and macrophage density increase simultaneously with pathological progression in B-cell non-Hodgkin's lymphomas

Node biopsies of 30 benign lymphadenopathies and 71 B-cell non-Hodgkin's lymphomas (B-NHLs) were investigated for microvessel and macrophage counts using immunohistochemistry and morphometric analysis. Both counts were significantly higher in B-NHL. Moreover, when these were grouped into low-grade and high-grade lymphomas, according to the Kiel classification and Working Formulation (WF), statistically significant higher counts were found in the high-grade tumours. Immunohistochemistry and electron microscopy revealed a close spatial association between microvessels and macrophages. Overall, the results suggest that, in analogy to what has already been shown in solid tumours, angiogenesis occurring in B-NHLs increases with tumour progression, and that macrophages promote the induction of angiogenesis via the release of their angiogenic factors. © 1999 Cancer Research Campaig