1,101 research outputs found
La presenza di un’assenza. Un’esperienza di terapia familiare condotta senza il paziente designato
No full textThe article describes the clinical case of four family member that, despite
a request for a psychotherapy for a schizophrenic son, took part for a long therapeutic
process without him. The author, through the analysis of the family’s interactive and
relational functioning, and through the analysis of the relational meaning of the symptom,
formulates her observations on the therapeutic endeavour. The structural model are
presented as conceptual and clinical frame to lead the system towards a more functional
organization, and to convey new visions of mutual conducts and actions
Anxiety disorders and differentiation of self
No full textIntroduction.– Kerr and Bowen (1988) argued that individuals with
a less differentiated self were more likely to experience anxiety,
function less effectively in stressful situations, and suffer from
physiological and relational psychological symptoms in social situations.
In the recent years, these suggestions have been the focus of
a great empirical research. These studies revealed that well differentiated
individuals enjoy good physical and psychological health
(e.g. Skowron, Stanley & Shapiro, 2009; Lampis, Cataudella, Busonera
& Skowron, 2017) and are less anxious (e.g. Skowron & Dendy,
2004; Peleg & Yitzhak, 2011).
Objectives.– Starting from these premises, the main objective of our
investigation was to compare a normative sample (n = 69, control
group) and two samples of adults seeking therapeutic services for
couple relationship problems (n = 41) and for anxiety and panic
(n = 47), to analyze differences on the levels of differentiation of
self.
Method.– The various components of differentiation of self
(emotional reactivity, emotional cut-off, emotional fusion and Iposition)
and the levels of anxiety were investigated using the
Differentiation of Self Inventory Revised (DSI-R) and the Symptom
Check List Revised (SCL-90-R).
Results.– We found that participants of the clinical sample of adults
seeking therapeutic services for anxiety and panic had significantly
higher scores in the Emotional cut-off scale and significantly lower
scores in the I-position scale.
Conclusion.– The research revealed the importance of differentiation
of self-processes to achieving an understanding of anxiety and
panic disorders in research and clinical practice.
Disclosure of interest.– The authors have not supplied a conflict of
interest statement
Minimum Stable Cut and Treewidth
No full textA stable or locally-optimal cut of a graph is a cut whose weight cannot be increased by changing the side of a single vertex. Equivalently, a cut is stable if all vertices have the (weighted) majority of their neighbors on the other side. Finding a stable cut is a prototypical PLS-complete problem that has been studied in the context of local search and of algorithmic game theory.
In this paper we study Min Stable Cut, the problem of finding a stable cut of minimum weight, which is closely related to the Price of Anarchy of the Max Cut game. Since this problem is NP-hard, we study its complexity on graphs of low treewidth, low degree, or both. We begin by showing that the problem remains weakly NP-hard on severely restricted trees, so bounding treewidth alone cannot make it tractable. We match this hardness with a pseudo-polynomial DP algorithm solving the problem in time (Δ⋅ W)^{O(tw)}n^{O(1)}, where tw is the treewidth, Δ the maximum degree, and W the maximum weight. On the other hand, bounding Δ is also not enough, as the problem is NP-hard for unweighted graphs of bounded degree. We therefore parameterize Min Stable Cut by both tw and Δ and obtain an FPT algorithm running in time 2^{O(Δtw)}(n+log W)^{O(1)}. Our main result for the weighted problem is to provide a reduction showing that both aforementioned algorithms are essentially optimal, even if we replace treewidth by pathwidth: if there exists an algorithm running in (nW)^{o(pw)} or 2^{o(Δpw)}(n+log W)^{O(1)}, then the ETH is false. Complementing this, we show that we can, however, obtain an FPT approximation scheme parameterized by treewidth, if we consider almost-stable solutions, that is, solutions where no single vertex can unilaterally increase the weight of its incident cut edges by more than a factor of (1+ε).
Motivated by these mostly negative results, we consider Unweighted Min Stable Cut. Here our results already imply a much faster exact algorithm running in time Δ^{O(tw)}n^{O(1)}. We show that this is also probably essentially optimal: an algorithm running in n^{o(pw)} would contradict the ETH
Finer Tight Bounds for Coloring on Clique-Width
No full textWe revisit the complexity of the classical k-Coloring problem parameterized by clique-width. This is a very well-studied problem that becomes highly intractable when the number of colors k is large. However, much less is known on its complexity for small, concrete values of k. In this paper, we completely determine the complexity of k-Coloring parameterized by clique-width for any fixed k, under the SETH. Specifically, we show that for all k >= 3,epsilon>0, k-Coloring cannot be solved in time O^*((2^k-2-epsilon)^{cw}), and give an algorithm running in time O^*((2^k-2)^{cw}). Thus, if the SETH is true, 2^k-2 is the "correct" base of the exponent for every k.
Along the way, we also consider the complexity of k-Coloring parameterized by the related parameter modular treewidth (mtw). In this case we show that the "correct" running time, under the SETH, is O^*({k choose floor[k/2]}^{mtw}). If we base our results on a weaker assumption (the ETH), they imply that k-Coloring cannot be solved in time n^{o(cw)}, even on instances with O(log n) colors
Rietveld Refinement of the paraelectric and ferroelectric phases of PbFe0.5Nb0.5O3 by neutron and X-ray diffraction
No full textIl Social Relations Model: un modello di analisi complesso nello studio delle relazioni familiari
No full textFine-Grained Meta-Theorems for Vertex Integrity
No full textVertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter. In this paper we investigate the algorithmic trade-offs involved with this parameter from the point of view of algorithmic meta-theorems for First-Order (FO) and Monadic Second Order (MSO) logic. Our positive results are the following: (i) given a graph G of vertex integrity k and an FO formula ϕ with q quantifiers, deciding if G satisfies ϕ can be done in time 2^O(k²q + q log q) + n^O(1); (ii) for MSO formulas with q quantifiers, the same can be done in time 2^{2^O(k²+kq)} + n^O(1). Both results are obtained using kernelization arguments, which pre-process the input to sizes 2^O(k²)q and 2^O(k²+kq) respectively.
The complexities of our meta-theorems are significantly better than the corresponding meta-theorems for tree-depth, which involve towers of exponentials. However, they are worse than the roughly 2^{O(kq)} and 2^{2^{O(k+q)}} complexities known for corresponding meta-theorems for vertex cover. To explain this deterioration we present two formula constructions which lead to fine-grained complexity lower bounds and establish that the dependence of our meta-theorems on k is best possible. More precisely, we show that it is not possible to decide FO formulas with q quantifiers in time 2^o(k²q), and that there exists a constant-size MSO formula which cannot be decided in time 2^{2^o(k²)}, both under the ETH. Hence, the quadratic blow-up in the dependence on k is unavoidable and vertex integrity has a complexity for FO and MSO logic which is truly intermediate between vertex cover and tree-depth
Variational derivation of thermal slip coefficients on the basis of the Boltzmann equation for hard-sphere molecules and Cercignani-Lampis boundary conditions: Comparison with experimental results
No full textInternational audienceIn the present paper, a variational method is applied to solve the Boltzmann equation based on the true linearized collision operator for hard-sphere molecules and the Cercignani–Lampis boundary conditions. This technique allows us to obtain an explicit relation between the first- and second-order thermal slip coefficients and the tangential momentum and normal energy accommodation coefficients, defined in the frame of the Cercignani–Lampis scattering kernel. Comparing the theoretical results with the experimental data from the work of Yamaguchi et al. [“Mass flow rate measurement of thermal creep flow from transitional to slip flow regime,” J. Fluid Mech. 795, 690 (2016)], a pair of accommodation coefficients has been extracted for each noble gas considered in the experiments. Then, these values have been used to compute, by means of our variational technique, the temperature-driven mass flow rates, and the outputs have been compared with the measurements for helium, neon, and argon. Good agreement has been obtained between the theoretical and the experimental data, within the range of validity of the proposed second-order slip model. For all the gases analyzed, the tangential accommodation coefficient is found to be much larger than the normal energy coefficient. The general trend, according to which, by increasing the molecular weight of the different gases, the values of both accommodation coefficients also increase, is confirmed in this study
Individual Accelerated Lifetime Tests on the Natural Dye - Sensitised Solar Cells to Determine the Impact of Different Degradation Factors and Strategies to Improve Stability
No full textIn this contribution we report on the impact of individual accelerated tests on dye-sensitised solar cells (DSSCs) degradation. Influence of the different physical factors on the tested cells lifetimes has been demonstrated. An international IEC 61646 standard has been used as a reference for the choice of the individual tests and the instruction for their further execution. The results obtained demonstrate that several exercises prescribed in the standard, such as dark thermal and humidity cycles, outdoor exposure or indoor accelerated light soaking tests can be useful in the assessment of the TCO glass-based DSSCs lifetime. The devices under tests have been sensitised with four different natural dyes, obtained from the typical Mediterranean plants. The DSSCs sensitised with Pistacia lentiscus extract demonstrate an interesting behaviour, related to the decline and retrieve of the generated photocurrent. Finally, some strategies to improve the natural dye based DSSCs lifetime have been proposed
In famiglia tutto bene? Adattamento diadico, coesione e conflitto nelle coppie composte da persone gay e lesbiche
No full textInternational research reveals that love relationships in the couples formed by people of the same-sex goes through the same stages of the life cycle of heterosexual couples. Gay and lesbian couples have the same characteristics of stability, durability, satisfaction and approach to conflict than heterosexual couples (Kurdek, 2004). Based on these assumptions, the authors have analysed the way in which people with different sexual orientation, with and without children, perceive their couples relationships. They studied some specific relational processes: dyadic adjustment, cohesion and adaptability, conflict management. The data reveal that gay, lesbian and eterosexual people express similar levels of dyadic adjustment, whereas gay and lesbian people show significantly higher levels of cohesion, adaptability and ability to manage conflict. It finally emerges that gay and lesbian parents show greater cohesion and a greater ability to resolve conflicts than heterosexual parents The results are discussed on the basis of psychosocial wellbeing of gay and lesbian individuals
- …
