Changes in the lifestyle and feeding habits that could improve the planet and human health: the reproductive case

There is a link between food systems, environment, and human health. According to the Food and Agriculture Organization of the United Nations-FAO, food production from animal and plant origin, using unsustainable agricultural practices with the excessive use of fertilizers, pesticides, fungicides, and herbicides have adverse effects on the environment and could contaminate water sources and even the soil.1 Also, the production of food from animal origin is one of those responsible for the emission of greenhouse gases, fresh water expenditure, and soil loss. Therefore, with the current food consumption and unsustainable human practices, the future of humanity will be uncertain

A crowdsourcing-based system for monitoring em radiation exposure in Chile

Indexación: Scopus.Public concern about the possible effects on health due to electromagnetic (EM) radiation exposure has led to the definition of regulations worldwide. In Chile, the so-called "Ley de Antenas" provides a regulatory framework that establishes limits and special conditions in this regard. Although the official record of measurements is available in a public information portal, this approach is not scalable and intuitive enough for all interested users. This paper propose a participatory measurement system to extend the monitored areas based on the concern of citizens themselves. © 2018 CEUR-WS. All rights reserved.http://ceur-ws.org/Vol-2178/SSN2018_paper_7.pd

A finite-time consensus algorithm with simple structure for fixed networks

In this paper, a continuous-time consensus algorithm with guaranteed finite-time convergence is proposed. Using homogeneity theory, finite-time consensus is proved for fixed topologies. The proposed algorithm is computationally simpler than other reported finite-time consensus algorithms, which is an important feature in scenarios of energy efficient nodes with limited computing resources such as sensor networks. Additionally, the proposed approach is compared on simulations with existing consensus algorithms, namely, the standard asymptotic consensus algorithm and the finite-time and fixed-time convergent algorithms, showing, in cycle graph topology, better robustness features on the convergence with respect to the network growth with less control effort. Indeed, the convergence time of other previously proposed consensus algorithms grows faster as the network grows than the one herein proposed whereas the control effort of the proposed algorithm is lower

Thermal-aware real-time scheduling using timed continuous Petri Nets

We present a thermal-aware, hard real-time (HRT) global scheduler for a multiprocessor system designed upon three novel techinques. First, we present a modeling methodology based on Timed Continuous Petri nets (TCPN) that yields a complete state variable model, including job arrivals, CPU usage, power, and thermal behavior. The model is accurate and avoids the calibration stage of RC thermal models. Second, based on this model, a linear programming problem (LPP) determines the existence of a feasible HRT thermal-aware schedule. Last, a sliding-mode controller and an online discretization algorithm implement the global HRT scheduler, which is capable of managing thermal constraints, context switching, migrations, and disturbances

On the least upper bound for the settling time of a class of fixed-time stable systems

This paper deals with the convergence time analysis of a class of fixed-time stable systems with the aim to provide a new non-conservative upper bound for its settling time. Our contribution is threefold. First, we revisit a well-known class of fixed-time stable systems showing the conservatism of the classical upper estimate of the settling time. Second, we provide the smallest constant that uniformly upper bounds the settling time of any trajectory of the system under consideration. Then, introducing a slight modification of the previous class of fixed-time systems, we propose a new predefined-time convergent algorithm where the least upper bound of the settling time is set a priori as a parameter of the system. This calculation is a valuable contribution toward online differentiators, observers, and controllers in applications with real-time constraints