An Intelligent Distributed System for Environmental Management

Environmental management is a complex task. The amount and heterogeneity of the data needed for an environmental decision making tool is overwhelming without adequate database systems and innovative methodologies. As far as data management, data interaction and data processing is concerned we here propose the use of a Geographical Information System (GIS) whilst for the decision making we suggest a Multi-Agent System (MAS) architecture. With the adoption of a GIS we hope to provide a complementary coexistence between heterogeneous data sets, a correct data structure, a good storage capacity and a friendly user’s interface. By choosing a distributed architecture such as a Multi-Agent System, where each agent is a semi-autonomous Expert System with the necessary skills to cooperate with the others in order to solve a given task, we hope to ensure a dynamic problem decomposition and to achieve a better performance compared with standard monolithical architectures. Finally, and in view of the partial, imprecise, and ever changing character of information available for decision making, Belief Revision capabilities are added to the system. Our aim is to present and discuss an intelligent environmental management system capable of suggesting the more appropriate land-use actions based on the existing spatial and non-spatial constraints.

Deep structure of the Santos basin-São Paulo plateau system, SE Brazil

The structure and nature of the crust underlying the Santos Basin-São Paulo Plateau System (SSPS), in the SE Brazilian margin, are discussed based on five wide-angle seismic profiles acquired during the Santos Basin (SanBa) experiment in 2011. Velocity models allow us to precisely divide the SSPS in six domains from unthinned continental crust (Domain CC) to normal oceanic crust (Domain OC). A seventh domain (Domain D), a triangular shape region in the SE of the SSPS, is discussed by Klingelhoefer et al. (2014). Beneath the continental shelf, a similar to 100km wide necking zone (Domain N) is imaged where the continental crust thins abruptly from similar to 40km to less than 15km. Toward the ocean, most of the SSPS (Domains A and C) shows velocity ranges, velocity gradients, and a Moho interface characteristic of the thinned continental crust. The central domain (Domain B) has, however, a very heterogeneous structure. While its southwestern part still exhibits extremely thinned (7km) continental crust, its northeastern part depicts a 2-4km thick upper layer (6.0-6.5km/s) overlying an anomalous velocity layer (7.0-7.8km/s) and no evidence of a Moho interface. This structure is interpreted as atypical oceanic crust, exhumed lower crust, or upper continental crust intruded by mafic material, overlying either altered mantle in the first two cases or intruded lower continental crust in the last case. The deep structure and v-shaped segmentation of the SSPS confirm that an initial episode of rifting occurred there obliquely to the general opening direction of the South Atlantic Central Segment.

Performance assessment of a wind energy conversion system using a hierarchical controller structure

This paper deals with a hierarchical structure composed by an event-based supervisor in a higher level and two distinct proportional integral (PI) controllers in a lower level. The controllers are applied to a variable speed wind energy conversion system with doubly-fed induction generator, namely, the fuzzy PI control and the fractional-order PI control. The event-based supervisor analyses the operation state of the wind energy conversion system among four possible operational states: park, start-up, generating or brake and sends the operation state to the controllers in the lower level. In start-up state, the controllers only act on electric torque while pitch angle is equal to zero. In generating state, the controllers must act on the pitch angle of the blades in order to maintain the electric power around the nominal value, thus ensuring that the safety conditions required for integration in the electric grid are met. Comparisons between fuzzy PI and fractional-order PI pitch controllers applied to a wind turbine benchmark model are given and simulation results by Matlab/Simulink are shown. From the results regarding the closed loop point of view, fuzzy PI controller allows a smoother response at the expense of larger number of variations of the pitch angle, implying frequent switches between operational states. On the other hand fractional-order PI controller allows an oscillatory response with less control effort, reducing switches between operational states. (C) 2015 Elsevier Ltd. All rights reserved.

Use of quantitative structure-property relationships to study the solvation process of 18-crown-6

Solution enthalpies of 18-crown-6 have been obtained for a set of 14 protic and aprotic solvents at 298.15 K. The complementary use of Solomonov's methodology and a QSPR-based approach allowed the identification of the most significant solvent descriptors that model the interaction enthalpy contribution of the solution process (Delta H-int(A/S)). Results were compared with data previously obtained for 1,4-dioxane. Although the interaction enthalpies of 18-crown-6 correlate well with those of 1,4-dioxane, the magnitude of the most relevant parameters, pi* and beta, is almost three times higher for 18-crown-6. This is rationalized in terms of the impact of the solute's volume in the solution processes of both compounds. (C) 2015 Elsevier B.V. All rights reserved.

A cellulosic liquid crystal pool for cellulose nanocrystals: structure and molecular dynamics at high shear rates

Cellulose and its derivatives, such as hydroxypropylcellulose (HPC) have been studied for a long time but they are still not well understood particularly in liquid crystalline solutions. These systems can be at the origin of networks with properties similar to liquid crystalline (LC) elastomers. The films produced from LC solutions can be manipulated by the action of moisture allowing for instance the development of a soft motor (Geng et al., 2013) driven by humidity. Cellulose nanocrystals (CNC), which combine cellulose properties with the specific characteristics of nanoscale materials, have been mainly studied for their potential as a reinforcing agent. Suspensions of CNC can also self-order originating a liquid-crystalline chiral nematic phases. Considering the liquid crystalline features that both LC-HPC and CNC can acquire, we prepared LC-HPC/CNC solutions with different CNC contents (1,2 and 5 wt.%). The effect of the CNC into the LC-HPC matrix was determined by coupling rheology and NMR spectroscopy - Rheo-NMR a technique tailored to analyse orientational order in sheared systems. (C) 2015 Elsevier Ltd. All rights reserved.

Influence of the substrate on structure and magnetic properties of Co-N thin films

Cubic cobalt nitride films were grown onto different single crystalline substrates Al2O3 (0 0 0 1) and (1 1 View the MathML source 0), MgO (1 0 0) and (1 1 0) and TiO2 (1 0 0) and (1 1 0). The films display low atomic densities compared with the bulk material, are ferromagnetic and have metallic electrical conductivity. X-ray diffraction and X-ray absorption fine structure confirm the cubic structure of the films and with RBS results indicate that samples are not homogeneous at the microscopic scale, coexisting Co4+xN nitride with nitrogen rich regions. The magnetization of the films decreases with increase of the nitrogen content, variation that is shown to be due to the decrease of the cobalt density, and not to a decrease of the magnetic moment per cobalt ion. The films are crystalline with a nitrogen deficient stoichiometry and epitaxial with orientation determined by the substrate.

Upper crustal structure of Madeira Island revealed from ambient noise tomography

We present the first image of the Madeira upper crustal structure, using ambient seismic noise tomography. 16 months of ambient noise, recorded in a dense network of 26 seismometers deployed across Madeira, allowed reconstructing Rayleigh wave Green's functions between receivers. Dispersion analysis was performed in the short period band from 1.0 to 4.0 s. Group velocity measurements were regionalized to obtain 20 tomographic images, with a lateral resolution of 2.0 km in central Madeira. Afterwards, the dispersion curves, extracted from each cell of the 2D group velocity maps, were inverted as a function of depth to obtain a 3D shear wave velocity model of the upper crust, from the surface to a depth of 2.0 km. The obtained 3D velocity model reveals features throughout the island that correlates well with surface geology and island evolution. (C) 2015 Elsevier B.V. All rights reserved.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.

CPMD-mindful task assignment for NPS-F

The multiprocessor scheduling scheme NPS-F for sporadic tasks has a high utilisation bound and an overall number of preemptions bounded at design time. NPS-F binpacks tasks offline to as many servers as needed. At runtime, the scheduler ensures that each server is mapped to at most one of the m processors, at any instant. When scheduled, servers use EDF to select which of their tasks to run. Yet, unlike the overall number of preemptions, the migrations per se are not tightly bounded. Moreover, we cannot know a priori which task a server will be currently executing at the instant when it migrates. This uncertainty complicates the estimation of cache-related preemption and migration costs (CPMD), potentially resulting in their overestimation. Therefore, to simplify the CPMD estimation, we propose an amended bin-packing scheme for NPS-F allowing us (i) to identify at design time, which task migrates at which instant and (ii) bound a priori the number of migrating tasks, while preserving the utilisation bound of NPS-F.

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.

Upper crustal structure of Madeira Island revealed from ambient noise tomography

We present the first image of the Madeira upper crustal structure, using ambient seismic noise tomography. 16 months of ambient noise, recorded in a dense network of 26 seismometers deployed across Madeira, allowed reconstructing Rayleigh wave Green's functions between receivers. Dispersion analysis was performed in the short period band from 1.0 to 4.0 s. Group velocity measurements were regionalized to obtain 20 tomographic images, with a lateral resolution of 2.0 km in central Madeira. Afterwards, the dispersion curves, extracted from each cell of the 2D group velocity maps, were inverted as a function of depth to obtain a 3D shear wave velocity model of the upper crust, from the surface to a depth of 2.0 km. The obtained 3D velocity model reveals features throughout the island that correlates well with surface geology and island evolution. (C) 2015 Elsevier B.V. All rights reserved.

GLODS: Global and Local Optimization using Direct Search

Locating and identifying points as global minimizers is, in general, a hard and time-consuming task. Difficulties increase in the impossibility of using the derivatives of the functions defining the problem. In this work, we propose a new class of methods suited for global derivative-free constrained optimization. Using direct search of directional type, the algorithm alternates between a search step, where potentially good regions are located, and a poll step where the previously located promising regions are explored. This exploitation is made through the launching of several instances of directional direct searches, one in each of the regions of interest. Differently from a simple multistart strategy, direct searches will merge when sufficiently close. The goal is to end with as many direct searches as the number of local minimizers, which would easily allow locating the global extreme value. We describe the algorithmic structure considered, present the corresponding convergence analysis and report numerical results, showing that the proposed method is competitive with currently commonly used global derivative-free optimization solvers.

Evolution of Drug Resistance: Insight on TEM -Lactamases Structure and Activity and Beta-Lactam Antibiotics

Extended-spectrum β-lactamases (ESBLs) prevalence was studied in the north of Portugal, among 193 clinical isolates belonging to citizens in a district in the boundaries between this country and Spain from a total of 7529 clinical strains. In the present study we recovered some members of Enterobacteriaceae family, producing ESBL enzymes, including Escherichia coli (67.9%), Klebsiella pneumoniae (30.6%), Klebsiella oxytoca (0.5%), Enterobacter aerogenes (0.5%), and Citrobacter freundii (0.5%). β-lactamases genes blaTEM, blaSHV, and blaCTX-M were screened by polymerase chain reaction (PCR) and sequencing approaches. TEM enzymes were among the most prevalent types (40.9%) followed by CTX-M (37.3%) and SHV (23.3%). Among our sample of 193 ESBL-producing strains 99.0% were resistant to the fourth-generation cephalosporin cefepime. Of the 193 isolates 81.3% presented transferable plasmids harboring genes. Clonal studies were performed by PCR for the enterobacterial repetitive intragenic consensus (ERIC) sequences. This study reports a high diversity of genetic patterns. Ten clusters were found for E. coli isolates and five clusters for K. pneumoniae strains by means of ERIC analysis. In conclusion, in this country, the most prevalent type is still the TEM-type, but CTX-M is growing rapidly.