Sphagnum mosses mediate long-term carbon accumulation in peatlands. Given their functional role as keystone species, it is important to consider their responses to ecological gradients and environmental changes through the production of phenolics. We compared the extent to which Sphagnum phenolic production was dependent on species, microhabitats and season, and how surrounding dwarf shrubs responded to Sphagnum phenolics. We evaluated the phenolic profiles of aqueous extracts of Sphagnum fallax and Sphagnum magellanicum over a 6-month period in two microhabitats (wet lawns versus dry hummocks) in a French peatland. Phenolic profiles of water-soluble extracts were measured by UHPLC-QTOF-MS. Andromeda polifolia mycorrhizal colonization was quantified by assessing the intensity of global root cortex colonization. Phenolic profiles of both Sphagnum mosses were species-, season- and microhabitat- dependant. Sphagnum-derived acids were the phenolics mostly recovered; relative quantities were 2.5-fold higher in S. fallax than in S. magellanicum. Microtopography and vascular plant cover strongly influenced phenolic profiles, especially for minor metabolites present in low abundance. Higher mycorrhizal colonization of A. polifolia was found in lawns as compared to hummocks. Mycorrhizal abundance, in contrast to environmental parameters, was correlated with production of minor phenolics in S. fallax. Our results highlight the close interaction between mycorrhizae such as those colonizing A. polifolia and the release of Sphagnum phenolic metabolites and suggest that Sphagnum-derived acids and minor phenolics play different roles in this interaction. This work provides new insight into the ecological role of Sphagnum phenolics by proposing a strong association with mycorrhizal colonization of shrubs. 相似文献
We propose a novel framework for despeckling ultrasound image sequences while respecting the structural details. More precisely, we use thresholding in an adapted wavelet domain that jointly takes into account for the non-Gaussian statistics of the noise and the differences in spatial and temporal regularities. The spatiotemporal wavelet is obtained via the Kronecker product of two sparsifying wavelet bases acting, respectively, on the spatial and temporal domains. Besides enabling a structured sparse representation of the time–space plan, it also makes it possible to perform a variance stabilization routine on the spatial domain through a Fisz transformation. The proposed method enjoys adaptability, easy tuning and theoretical guaranties. We propose the corresponding algorithm together with results that demonstrate the benefits of the proposed spatiotemporal approach over the successive spatial treatment. Finally, we describe a data-driven extension of the proposed method that is based on temporal pre-filtering. 相似文献
In this paper, a new algorithm is proposed for the two-dimensional non-guillotine non-oriented cutting stock problem. The considered problem consists of cutting small rectangular pieces of predetermined sizes from large but finite rectangular plates. The objective is to generate cutting patterns that minimize the unused area and fulfill customer orders. The proposed algorithm is a combination of a new particle swarm optimization approach with a heuristic criterion inspired from the literature. The algorithm is tested on twenty-two instances divided into two sets. Corresponding results show the algorithm efficiency in optimizing the trim loss that is comprised between 2.6% and 7.8% for all considered instances. 相似文献
Prior algorithms on graph simulation for distributed graphs are not scalable enough as they exhibit heavy message passing. Moreover, they are dependent on the graph partitioning quality that can be a bottleneck due to the natural skew present in real-world data. As a result, their degree of parallelism becomes limited. In this paper, we propose an efficient parallel edge-centric approach for distributed graph pattern matching. We design a novel distributed data structure called ST that allows a fine-grain parallelism, and hence guarantees linear scalability. Based on ST, we develop a parallel graph simulation algorithm called PGSim. Furthermore, we propose PDSim, an edge-centric algorithm that efficiently evaluates dual simulation in parallel. PDSim combines ST and PGSim in a Split-and-Combine approach to accelerate the computation stages. We prove the effectiveness and efficiency of these propositions through theoretical guarantees and extensive experiments on massive graphs. The achieved results confirm that our approach outperforms existing algorithms by more than an order of magnitude.
Now-a-days advances in mobile device technology aim to build complex computational systems providing a maximum level of flexibility, decentralization, simplest form of interactivity, and ease of use. Recently, the launch of the agent-oriented platform JaCaMo and its Android client based platform JaCa-Android have provided an appropriate level of abstraction to build smart mobile client server systems providing these attributes. By using these platforms, we have developed a multi-agent based Smart Mobile Virtual Community Management System (SMVCMS) that makes it possible to provide a decentralized and open management of virtual communities. This paper addresses the design and architecture of our multi-agent server and client application. It elaborates different features of our system; such as how a participant in virtual communities is supported by a Jason agent that encapsulates the logic and the control of the participation in a virtual community (such as publishing posts, notifying members, making recommendations for the user, etc.). It also discusses how the set of CArtAgOartifacts provides the basic functionalities and operations giving access to the functionalities for knowledge exchange in virtual communities, and personal agents onAndroid exploit these artifacts to execute their tasks while achieving their individual and collective goals. We have employed SMVCMS in the context of Smart Cities and found that the system fulfills the desired goals, such as decentralization of community management, personalized automatic management and discovery of communities, autonomy of agents and flexibility so that any agent can create its own community with the maximum level of ease. 相似文献