116 research outputs found

    A convex optimization approach for automated water and energy end use disaggregation

    Get PDF
    A detailed knowledge of water consumption at an end-use level is an essential requirement to design and evaluate the efficiency of water saving policies. In the last years, this has led to the development of automated tools to disaggregate high resolution water consumption data at the household level into end use categories. In this work, a new disaggregation algorithm is presented. The proposed algorithm is based on the assumption that the disaggregated signals to be identified are piecewise constant over the time and it exploits the information on the time-of-day probability in which a specific water use event might occur. The disaggregation problem is formulated as a convex optimization problem, whose solution can be efficiently computed through numerical solvers. Specifically, the disaggregation problem is treated as a least-square error minimization problem, with an additional (convex) penalty term aiming at enforcing the disaggregate signals to be piece-wise constant over the time. The proposed disaggregation algorithm has been initially tested against household electricity data available in the literature. The obtained results look promising and similar results are expected to be obtained for water data

    Benefits and challenges of using smart meters for advancing residential water demand modeling and management: a review

    Get PDF
    Over the last two decades, water smart metering programs have been launched in a number of medium to large cities worldwide to nearly continuously monitor water consumption at the single household level. The availability of data at such very high spatial and temporal resolution advanced the ability in characterizing, modeling, and, ultimately, designing user-oriented residential water demand management strategies. Research to date has been focusing on one or more of these aspects but with limited integration between the specialized methodologies developed so far. This manuscript is the first comprehensive review of the literature in this quickly evolving water research domain. The paper contributes a general framework for the classification of residential water demand modeling studies, which allows revising consolidated approaches, describing emerging trends, and identifying potential future developments. In particular, the future challenges posed by growing population demands, constrained sources of water supply and climate change impacts are expected to require more and more integrated procedures for effectively supporting residential water demand modeling and management in several countries across the world

    Análise de mecanismos com restrições redundantes através da aplicação da teoria de matroides

    Get PDF
    Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Mecânica, Florianópolis, 2015.O estudo de mecanismo é uma das áreas mais importantes no projeto de máquinas e os seus problemas podem ser divididos em dois grupos: análise de mecanismos e síntese de mecanismos. O foco desta tese é a análise da topologia de mecanismos, em termos de graus de liberdade e restrições, através da teoria de helicoides e da teoria de matroides. Na tese é elaborada uma modelagem geral dos graus de liberdade e das restrições de um mecanismo, utilizando a representação por helicoides e a adaptação das leis de Kirchhoff proposta por Davies para cadeias cinemáticas. Baseada nesta modelagem, é desenvolvida uma nova metodologia de análise de mecanismos para a eliminação automática das restrições redundantes. Ao mesmo tempo, a teoria de matroides é utilizada na análise dos mecanismos. A tese introduz novos resultados na teoria de mecanismos. Primeiramente, é analisada a escolha dos conjuntos de atuadores válidos para um mecanismo. Dois novos algoritmos são propostos para a enumeração de todos os possíveis conjuntos válidos de atuadores e a para a escolha ótima de um conjunto válido de atuadores com base nas especificações do mecanismo. Posteriormente, são analisados os possíveis mecanismos auto alinhantes derivados de um mecanismo com restrições redundantes. Dois novos algoritmos são propostos para enumeração de todos os possíveis mecanismos auto alinhantes obtidos retirando as restrições redundantes de um dado mecanismo e para escolha ótima de um mecanismo auto alinhante, com base nas suas especificações. Os algoritmos foram implementados no software Sage e apresentam complexidade polinomial. Exemplos de aplicação são apresentados e os resultados validados frente à literatura. Duas contribuições adicionais são também introduzidas: a definição de um invariante cinemático que relaciona a mobilidade com o número de restrições redundantes de um mecanismos e um contraexemplo para a metodologia de análise das restrições redundantes proposta por Reshetov.Abstract : The study of mechanisms is one of the most important areas on which machine design relies. Research in mechanism can be roughly divided into two main problems: mechanism analysis and mechanism synthesis. This thesis focuses on topology analysis of mechanism, by means of screw theory representation of mechanisms. Freedoms and constraints in mechanisms are thus described applying the Kirchhoff's laws adaptation to multibody systems proposed by Davies. Based on this modelling, overconstraint in mechanisms is analysed in terms of free motions and constraints. Two main contributions are proposed along this work, based on matroid theory and linear algebra modelling. First, the actuation schemes of a mechanism are investigated. Two algorithms are proposed for enumerating all valid actuation schemes of an overconstrained mechanism and for selecting an optimal actuation scheme, based on a set of criteria. Second, the self-aligning mechanisms kinematically equivalent to an overconstraint mechanism are investigated. Two new algorithms for enumerating all self-aligning kinematically equivalent mechanisms to an overconstrained one and for selecting an optimal self-aligning topology, based on a set of criteria, are proposed. All algorithms have been implemented in Sage software and run in polynomial time. Examples of applications are presented, and the results obtained validated with literature cases. Moreover, two further contributions are proposed: the definition of an invariant kinematic chain relating mobility and degree of constraint and a counterexample for the methodology proposed by Reshetov

    Modelling residential water consumers’ behaviors by feature selection and feature weighting

    Get PDF
    Identifying the most relevant determinants of water consuming or saving behaviors at the household level is key to building mathematical models that predict urban water demand variability in space and time and to explore the effects of different Water Demand Management Strategies for the residential sector. This work contributes a novel approach based on feature selection and feature weighting to model the single-user consumption behavior at the household level. A two-step procedure consisting of the extraction of the most relevant determinants of users’ consumption and the identification of a predictive model of water consumers’ profile is proposed and tested on a real case study. Results show the effectiveness of the proposed method in capturing the influence of candidate determinants on residential water consumption, as well as in attaining sufficiently accurate predictions of users’ consumption profiles, which constitutes essential information to support residential water demand management

    The induced saturation problem for posets

    Get PDF
    For a fixed poset PP, a family F\mathcal F of subsets of [n][n] is induced PP-saturated if F\mathcal F does not contain an induced copy of PP, but for every subset SS of [n][n] such that S∉F S\not \in \mathcal F, then PP is an induced subposet of F{S}\mathcal F \cup \{S\}. The size of the smallest such family F\mathcal F is denoted by sat(n,P)\text{sat}^* (n,P). Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset PP, either sat(n,P)=O(1)\text{sat}^* (n,P)=O(1) or sat(n,P)log2n\text{sat}^* (n,P)\geq \log _2 n. In this paper we improve this general result showing that either sat(n,P)=O(1)\text{sat}^* (n,P)=O(1) or sat(n,P)2n2\text{sat}^* (n,P) \geq 2 \sqrt{n-2}. Our proof makes use of a Tur\'an-type result for digraphs. Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset \Diamond we have sat(n,)=Θ(n)\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n}); so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os states that given any poset PP, either sat(n,P)=O(1)\text{sat}^* (n,P)=O(1) or sat(n,P)n+1\text{sat}^*(n,P)\geq n+1. We prove that this latter conjecture is true for a certain class of posets PP.Comment: 12 page

    Failed Switching off in the MIBI-Parathyroid Scintigraphy in a Dialyzed Patient with Secondary Hyperparathyroidism Responsive to Cinacalcet Therapy

    Get PDF
    The aims of your case report is to show the predictivity of 99mTc-sestamibi (MIBI) scintigraphy and doppler ultrasound imaging on secondary hyperparathyroidism (SHPT) in a patient responsive to calcimimetic treatment. Moreover, it has been reported that calcimimetic has great potential in reducing the volume of the parathyroid gland. On the other hand, the MIBI scintigraphy is considered a crucial diagnostic procedure to monitor the response to therapy in terms of turnover and cellular metabolism; whereas, ultrasound to monitor the volume variation in response to treatment. It is described the case of a 73-year-old man on hemodialysis from 1995 for ESRD. Within 2 years the patient gradually developed SHPT with progressively increased iPTH up to 1,000 ρg/ml. The ultrasound, highlighted the presence of two parathyroid hyperplasia, confirmed by scintigraphy, showing focal increase uptake of sestamibi in the same anatomical areas. As a result of the patient's refusal to perform a parathyroidectomy, cinacalcet, was administered (65 mg overage daily dose). After a year of treatment, there was a striking decrease of iPTH (from 1300 to 57 ρg/ml, −95%); but, on the contrary to expectations, this positive metabolic outcome, was not followed by parathyroid changes in ultrasound and scintigraphic findings

    ESA ESRIN'S VALUE FOR ITALY

    Get PDF
    The report presents an overview of the evolution of ESA's ESRIN stablishment. The programs and activities carried out by ESRIN are then analyzed, with particular attention to the Earth Observation and VEGA programs. We then moved on to assessing the economic and strategic impact of ESRIN for Italy. In particular, an estimate was made of the direct and indirect economic impact and of the scientific value developed by ESRIN on the Italian territory

    An optimisation-based energy disaggregation algorithm for low frequency smart meter data

    Get PDF
    An algorithm for the non-intrusive disaggregation of energy consumption into its end-uses, also known as non-intrusive appliance load monitoring (NIALM), is presented. The algorithm solves an optimisation problem where the objective is to minimise the error between the total energy consumption and the sum of the individual contributions of each appliance. The algorithm assumes that a fraction of the loads present in the household is known (e.g. washing machine, dishwasher, etc.), but it also considers unknown loads, treating them as a single load. The performance of the algorithm is then compared to that obtained by two state of the art disaggregation approaches implemented in the publicly available NILMTK framework. The first one is based on Combinatorial Optimization, the second one on a Factorial Hidden Markov Model. The results show that the proposed algorithm performs satisfactorily and it even outperforms the other algorithms from some perspectives
    corecore