Abstract We present multiple factor analysis for contingency tables (MFACT) and its implementation in the FactoMineR package. This method, through an option of the MFA function, allows us to deal with multiple contingency or frequency tables, in addition to the categorical and quantitative multiple tables already considered in previous versions of the package. Thanks to this revised function, e...

In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...

The two experiments reported examine the role of temporal contiguity on judgments of contingency in a human analogue of the Pavlovian task. The data show that the effect of the actual delay on contingency judgment depends on the observer's expectation regarding the delay. For a fixed contingency between the cue and the outcome, ratings of the contingency are higher when the actual delay is cong...

The traditional control procedures for Pavlovian conditioning are examined and each is found wanting. Some procedures introduce nonassociative factors not present in the experimental procedure while others transform the excitatory, experimental CS-US contingency into an inhibitory contingency. An alternative control procedure is suggested in which there is no contingency whatsoever between CS a...

A framework is proposed for the investigation of planning systems that must deal with bounded uncertainty. A deenition of this new class of contingency planners is given. A general, complete contingency planning algorithm is described. The algorithm is suitable to many incomplete information games as well as planning situations where the initial state is only partially known. A rich domain is i...

There is clear value, in both industrial and government settings, derived from performing statistical analyses that, in effect, integrate data in multiple, distributed databases. However, the barriers to actually integrating the data can be substantial or even insurmountable. Corporations may be unwilling to share proprietary databases such as chemical databases held by pharmaceutical manufactu...

Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing spaces. Unfortunately, existing distributed proof protocols offer only limited support for protecting the confidentiality of sensitive facts, which limits their utility in many practical scenarios. In this paper, we prop...

Many applications of autonomous agents require groups to work in tight coordination. To be dependable, these groups must plan, carry out and adapt their activities in a way that is robust to failure and uncertainty. Previous work has produced contingent plan execution systems that provide robustness during their plan extraction phase, by choosing between functionally redundant methods, and duri...

We believe that lifelikeness is important to make it possible for a communication robot to interact naturally with people. In this research we investigate the relationship between contingency and complexity in a lifelike robot. We have developed a robot control system to experimentally control contingency and complexity in interaction by combining a humanoid robot with a motion-capturing system...

Steady state contingency analysis aims at the assessment of the risk certain contingencies may pose to an electrical network. This is a particularly important task of network operators, especially as network stability issues become of prime importance in the current era of electricity deregulation. The article focuses on the analysis of experimental data that are produced through operating poin...