Propuesta de Intervención desde la Psicología Positiva en Adolescentes diagnosticados de Anorexia

La anorexia es un trastorno alimenticio del cual padecen cada vez más jóvenes. La moda que busca la sociedad tiene cada vez más tendencia hacia la delgadez. El objetivo de esta intervención es enseñar a los sujetos de lo que son capaces ellas mismas y así potenciar el mejoramiento de su enfermedad, enfocando todo desde la psicología positiva. En esta intervención se trata con adolecentes entre 12 y 20 años, el rango de edad donde más personas padecen de anorexia. A diferencia de otras intervenciones, en esta no se trata a la persona como un enfermo, si no se intenta fortalecer unos factores, en este caso el optimismo, la resiliencia y la inteligencia emocional que pueden ayudar a la persona a salir de su situación y superar el trastorno. Dicho se va a llevar al cabo en 8 sesiones que incluyen la pre- y post- evaluación de los participantes y dos sesiones por factor.Anorexia is one of the mental- health problem which each time incur more young people. The fashion what society is looking for has more and more tendency to being thinly. The objective of this intervention is to show to the persons what they are able to do by themselves and on this way raise the improvement of their disease, focused on the positive psychology. This intervention works with adolescent between 12 and 20 years, a rank of age where most persons present anorexia. With a difference to other interventions, in this one the person is not treated like a sick person. This intervention is searching for reinforce some factors, on this case optimism, resilience and emotional intelligence which can help the person to came out of their situation and overcome the mental- health problem. The intervention will be done on 8 seasons which will include pre- and post- evaluation of the participant and two seasons for each factor

Composition with Target Constraints

It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO tgd). We consider the question of what happens when target constraints are allowed. Specifically, we consider the question of specifying the composition of standard schema mappings (those specified by st-tgds, target egds, and a weakly acyclic set of target tgds). We show that SO tgds, even with the assistance of arbitrary source constraints and target constraints, cannot specify in general the composition of two standard schema mappings. Therefore, we introduce source-to-target second-order dependencies (st-SO dependencies), which are similar to SO tgds, but allow equations in the conclusion. We show that st-SO dependencies (along with target egds and target tgds) are sufficient to express the composition of every finite sequence of standard schema mappings, and further, every st-SO dependency specifies such a composition. In addition to this expressive power, we show that st-SO dependencies enjoy other desirable properties. In particular, they have a polynomial-time chase that generates a universal solution. This universal solution can be used to find the certain answers to unions of conjunctive queries in polynomial time. It is easy to show that the composition of an arbitrary number of standard schema mappings is equivalent to the composition of only two standard schema mappings. We show that surprisingly, the analogous result holds also for schema mappings specified by just st-tgds (no target constraints). This is proven by showing that every SO tgd is equivalent to an unnested SO tgd (one where there is no nesting of function symbols). Similarly, we prove unnesting results for st-SO dependencies, with the same types of consequences.Comment: This paper is an extended version of: M. Arenas, R. Fagin, and A. Nash. Composition with Target Constraints. In 13th International Conference on Database Theory (ICDT), pages 129-142, 201

Solutions and query rewriting in data exchange

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions – target instances that satisfy the constraints of the data exchange problem. Previous work has identified two classes of desirable solutions: canonical universal solutions, and their cores. Query answering in data exchange amounts to rewriting a query over the target schema to another query that, over a materialized target instance, gives the result that is semantically consistent with the source (specifically, the “certain answers”). Basic questions are then: (1) how do these solutions compare in terms of query rewriting? and (2) how can we determine whether a query is rewritable over a particular solution? Our goal is to answer these questions. Our first main result is that, in terms of rewritability by relational algebra queries, the core is strictly less expressive than the canonical universal solution, which in turn is strictly less expressive than the source. To develop techniques for proving queries nonrewritable, we establish structural properties of solutions; in fact they are derived from the technical machinery developed in the rewritability proofs. Our second result is that both the canonical universal solution and the core preserve the local structure of the data, and that every target quer

Differentiation Theory and the Sociology of Religion and Secularity: Workshop Report

Report of a hybrid Workshop on “Differentiation Theory and the Sociology of Religion and Secularity” on 8 and 9 October 2020 hosted by the Centre for Advanced Studies in the Humanities and Social Sciences (CASHSS) “Multiple Secularities – Beyond the West, Beyond Modernities” at Leipzig University and organised by the CASHSS's directors Christoph Kleine and Monika Wohlrab-Sahr together with Daniel Witte from the University of Bonn

Answering recursive queries using views

We consider the problem of answering datalog queries using materialized views. The ability to answer queries using views is crucial in the context of information integration. Previous work on answering queries using views restricted queries to being conjunctive. We extend this work to general recursive queries: Given a datalog program P and a set of views, is it possible to nd a datalog program that is equivalent toPand only uses views as EDB predicates? In this paper, we show that the problem of whether a datalog program can be rewritten into an equivalent program that only uses views is undecidable. On the other hand, we prove that a datalog program P can be e ectively rewritten into a program that only uses views, that is contained in P, and that contains all programs that only use views and are contained in P. As a consequence, if there exists a program equivalent toPthat only uses views, then our construction is guaranteed to yield a program equivalent toP.