A situation-modulated minimal change account for causal inferences about causal networks

2020 ◽  
Vol 73 (12) ◽  
pp. 2403-2411
Author(s):  
Moyun Wang ◽  
Jinrui Sun

Although causal Bayes networks are applicable to examining causal inferences about different static objects and about a changing object with different states, previous studies investigated the former, but not the latter. We propose a situation-modulated minimal change account for causal inferences. It predicts that dynamic situations are more likely to elicit minimal revisions on causal networks and adherence to the Markov assumption than static situations. Two experiments were conducted to investigate qualitative causal inferences about causal networks with binary and numerical variables, respectively. It was found that qualitative causal inferences were more likely to adhere to the Markov assumption in dynamic situations than in static situations. This finding supports the situation-modulated minimal change account rather than the other alternative accounts. We conclude that dynamic situations are more likely to elicit minimal revisions on causal networks and adherence to the Markov assumption than static situations. This conclusion is beyond the previous predominant view that causal inferences are apt to violate the Markov assumption.

2010 ◽  
Vol 18 (4) ◽  
pp. 506-513 ◽  
Author(s):  
David Collier ◽  
Henry E. Brady ◽  
Jason Seawright

Both qualitative and quantitative research routinely fall short, producing misleading causal inferences. Because these weaknesses are in part different, we are convinced that multimethod strategies are productive. Each approach can provide additional leverage that helps address shortcomings of the other. This position is quite distinct from that of Beck, who believes that the two types of analysis cannot be adjoined. We review examples of adjoining that Beck dismisses, based on what we see as his outdated view of qualitative methods. By contrast, we show that these examples demonstrate how qualitative and quantitative analysis can work together.


Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 515
Author(s):  
Paolo Perinotti

We study the relation of causal influence between input systems of a reversible evolution and its output systems, in the context of operational probabilistic theories. We analyse two different definitions that are borrowed from the literature on quantum theory—where they are equivalent. One is the notion based on signalling, and the other one is the notion used to define the neighbourhood of a cell in a quantum cellular automaton. The latter definition, that we adopt in the general scenario, turns out to be strictly weaker than the former: it is possible for a system to have causal influence on another one without signalling to it. Remarkably, the counterexample comes from classical theory, where the proposed notion of causal influence determines a redefinition of the neighbourhood of a cell in cellular automata. We stress that, according to our definition, it is impossible anyway to have causal influence in the absence of an interaction, e.g. in a Bell-like scenario. We study various conditions for causal influence, and introduce the feature that we call no interaction without disturbance, under which we prove that signalling and causal influence coincide. The proposed definition has interesting consequences on the analysis of causal networks, and leads to a revision of the notion of neighbourhood for classical cellular automata, clarifying a puzzle regarding their quantisation that apparently makes the neighbourhood larger than the original one.


2021 ◽  
Author(s):  
Jandson S. Ribeiro ◽  
Matthias Thimm

Restoring consistency of a knowledge base, known as consolidation, should preserve as much information as possible of the original knowledge base. On the one hand, the field of belief change captures this principle of minimal change via rationality postulates. On the other hand, within the field of inconsistency measurement, culpability measures have been developed to assess how much a formula participates in making a knowledge base inconsistent. We look at culpability measures as a tool to disclose epistemic preference relations and build rational consolidation functions. We introduce tacit culpability measures that consider semantic counterparts between conflicting formulae, and we define a special class of these culpability measures based on a fixed-point characterisation: the stable tacit culpability measures. We show that the stable tacit culpability measures yield rational consolidation functions and that these are also the only culpability measures that yield rational consolidation functions.


1990 ◽  
Vol 18 (01n02) ◽  
pp. 45-50 ◽  
Author(s):  
Kenijiro Kimura ◽  
Shinichiro Nanba ◽  
Akihiro Tojo ◽  
Hiroaki Matsuoka ◽  
Tsuneaki Sugimoto

Sairei-To (Chai-Ling-Tang) was administered to four patients with steroid-dependent relapsing nephrotic syndrome. It was associated with prednisolone and immunosuppressive agents. Histological diagnosis was minimal change in three patients and mild focal glomerulonephritis in one patient. After the start of Sairei-To administration the relapse was markedly suppressed in three patients but not at all in the other. Although we could consider Sairei-To effective for steroid-dependent nephrotic syndrome in the present study, a larger study is necessary to confirm its efficacy.


1995 ◽  
Vol 8 (1) ◽  
pp. 35-41
Author(s):  
Sudharma L Katugampola ◽  
Malcolm A Fernando ◽  
Somaratne Balasuriya

The weights of 4, 792 infants and preschool children maintained at a family clinic in a rural area, over a period of 25 years from 1965 to 1989, were studied retrospectively. The data were analyzed by five-year birth cohorts. The 97th, 50th and 3rd centile curves were computed for the study sample. They were well below those of the National Center for Health Statistics (NCHS). Males were heavier than females for each centile. The secular variation was examined. It was observed that during the first year of life, the weight gain of the first three cohorts was significantly higher than the last two. From 12 to 48 months there was only a minimal change between cohorts. However, after 48 months, the last two cohorts showed an improvement in weight as compared to the other three. The boys in our study were far below the 50th centile for NCHS, fell to the 3rd centile around 20 months, and gradually declined further. The 97th centile for boys was above the 50th NCHS during the first year of life but fell thereafter until 60 months. The use of local standards at rural clinics is recommended for early detection of those at risk of growth retardation.


2005 ◽  
Vol 2 (3) ◽  
pp. 195-201 ◽  
Author(s):  
J Manfredi ◽  
HM Clayton ◽  
D Rosenstein

AbstractThe objective was to describe and compare the positions of different types of bits within the horse's oral cavity. Eight horses were fitted with a bridle and six bits [jointed snaffle ( JS), Boucher, KK Ultra, Myler snaffle (MylerS), Myler ported barrel (MylerPB), Myler correctional-ported barrel (MylerCPB)]. Lateral radiographs and custom software were used to measure the position and orientation of the bits relative to the horse's palate and second premolar teeth without rein tension and with 25±5 N bilateral rein tension. The results showed differences in the position of the bits within the horse's oral cavity and in their movements in response to rein tension. Without rein tension, single-jointed bits were further from the premolar teeth ( JS 32.2±10.6 mm; Boucher 33.9±10.8 mm) than the Myler bits (MylerS 20.2±9.7 mm; MylerPB 12.8±6.7 mm; MylerCPB 14.6±4.3 mm). Single-jointed bits moved closer to the premolars when tension was applied to the reins (JS 20.8±6.3 mm; Boucher 19.7±6.8 mm). The cannons of the Boucher were more elevated than those of the other bits. The cannon angulation decreased significantly from 38.7±13.7 deg. to 21.6±6.9 deg. for JS and from 43.1±10.1 deg. to 27.8±10.1 deg. for the Boucher when tension was applied to the reins. The Myler bits showed minimal change in position in response to the application of rein tension.


2018 ◽  
Vol 26 (1) ◽  
pp. 28-41
Author(s):  
T Dicky Hastjarjo

In a psychological experiment the manipulation of independent variable is deliberatelyintroduced to observe its effects on the dependent variable. The cause-effect relationshipthen is infered. This article explained briefly two models of causal inferences. One modeldeveloped by Donald Campbell are more focused on design elements in ruling out threats tovalidity. On the other hand, Rubin’s model of causal inference emphasized in mathematicalprecision of the causal effects. The comparison of the two different but complementarymodels involves both randomized experiment and observational study.


Author(s):  
Martin Steinebach ◽  
Sebastian Lutz ◽  
Huajian Liu

Within a forensic examination of a computer for illegal image content, robust hashing can be used to detect images even after they have been altered. Here the perceptible properties of an image are used to create the hash values.Whether an image has the same content is determined by a distance function. Cryptographic hash functions, on the other hand, create a unique bit-sensitive value. With these, no similarity measurement is possible, since only with exact agreement a picture is found. A minimal change in the image results in a completely different cryptographic hash value. However, the robust hashes have an big disadvantage: hash values can reveal something about the structure of the picture. This results in a data protection leak. The advantage of a cryptographic hash function is in turn that its values do not allow any conclusions about the structure of an image. The aim of this work is to develop a procedure for which combines the advantages of both hashing functions.


PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0245546
Author(s):  
Talita Greyling ◽  
Stephanie Rossouw ◽  
Tamanna Adhikari

Amidst the rapid global spread of Covid-19, many governments enforced country-wide lockdowns, with likely severe well-being consequences. In this regard, South Africa is an extreme case suffering from low levels of well-being, but at the same time enforcing very strict lockdown regulations. In this study, we analyse the causal effect of a lockdown and consequently, the determinants of happiness during the aforementioned. A difference-in-difference approach is used to make causal inferences on the lockdown effect on happiness, and an OLS estimation investigates the determinants of happiness after lockdown. The results show that the lockdown had a significant and negative impact on happiness. In analysing the determinants of happiness after lockdown, we found that stay-at-home orders have positively impacted happiness during this period. On the other hand, other lockdown regulations such as a ban on alcohol sales, a fear of becoming unemployed and a greater reliance on social media have negative effects, culminating in a net loss in happiness. Interestingly, Covid-19, proxied by new deaths per day, had an inverted U-shape relationship with happiness. Seemingly people were, at the onset of Covid-19 positive and optimistic about the low fatality rates and the high recovery rates. However, as the pandemic progressed, they became more concerned, and this relationship changed and became negative, with peoples' happiness decreasing as the number of new deaths increased.


2019 ◽  
Vol 11 (05) ◽  
pp. 1950060
Author(s):  
Jose Torres-Jimenez ◽  
Idelfonso Izquierdo-Marquez

This work introduces an algorithm that generates all combinations of size [Formula: see text] ([Formula: see text]) of the set [Formula: see text] satisfying the strong minimal change property (SMCP) and requires [Formula: see text] memory space. The algorithm was implemented both iteratively and recursively; the iterative version has the advantage of processing the current combination in only one place of the algorithm, and the recursive version has the advantage of performing few operations to generate the next combination. The recursive version is similar to the algorithm of Eades and McKay because both algorithms have two functions that recursively call each other to generate the combinations; however, in the algorithm of Eades and McKay the depth of the recursion is [Formula: see text], while in our algorithm is [Formula: see text]. Performance comparison against three algorithms having the SMCP show that the recursive version of our algorithm performs better than the other algorithms when [Formula: see text] is large.


Sign in / Sign up

Export Citation Format

Share Document