نتایج جستجو برای: inclusion exclusion principle
تعداد نتایج: 350920 فیلتر نتایج به سال:
pro mente OÖ is one of the biggest organisations offering psycho-social care and treatment. It is a crucial part of the differentiated system of social psychiatric services in Austria. First, the article describes the organization pro mente OÖ, its history and services. Then, a selection of framework conditions of social psychiatric supply is presented. In this respect some existing strengths a...
Considerations based on the known relation between di erent characteristic classes for singular hypersufaces suggest that a form of the `inclusionexclusion' principle may hold for Segre classes. We formulate and prove such a principle for a notion closely related to Segre classes. This is used to provide a simple computation of the classes introduced in [Alu], in certain special (but representa...
Individuals engage in social interactions generally expecting inclusion (Kerr and Levine, 2008; Wesselmann et al., 2010, 2013). This expectation seems reasonable, given individuals’ basic need to establish and maintain social connections to sustain physical and psychological well-being (Baumeister and Leary, 1995). However, individuals often experience social exclusion; situations broadly invol...
Inclusion-exclusion is an effective method for computing the volume of a union of measurable sets. We extend it to multiple coverings, proving short inclusion-exclusion formulas for the subset of R covered by at least k balls in a finite set. We implement two of the formulas in dimension n = 3 and report on results obtained with our software.
Set multi-covering is a generalization of the set covering problem where each element may need to be covered more than once and thus some subset in the given family of subsets may be picked several times for minimizing the number of sets to satisfy the coverage requirement. In this paper, we propose a family of exact algorithms for the set multi-covering problem based on the inclusionexclusion ...
Applying an elaborate and novel experimental paradigmwe collected non-verbal responses to social inclusion and exclusion. A judgement experiment revealed that it was possible to determine whether a person was included or excluded, based solely on non-verbal, behavioral cues, especially if the person was male. A detailed coding using the ECSI scale suggests that included speakers displayed more ...
We present a deterministic algorithm producing the number of k-colourings of a graph on n vertices in time 2nnO(1). We also show that the chromatic number can be found by a polynomial space algorithm running in time O(2.2461). Finally, we present a family of polynomial space approximation algorithms that find a number between χ(G) and (1 + )χ(G) in time O(1.2209 + 2.2461 − ).
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید