Covering matroid

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to coverings, we propose a new type of matroids called covering matroids and prove them to be an extension of partition matroids. Secondly, since some researchers have successfully applied partition matroids to classical rough sets, we study the relationships between covering matroids and covering-based rough sets which are an extension of classical rough sets. Thirdly, in matroid theory, there are many special matroids, such as transversal matroids, partition matroids, 2-circuit matroid and partition-circuit matroids. The relationships among several special matroids and covering matroids are studied.Comment: 15 page

A theory of human error

Human errors tend to be treated in terms of clinical and anecdotal descriptions, from which remedial measures are difficult to derive. Correction of the sources of human error requires an attempt to reconstruct underlying and contributing causes of error from the circumstantial causes cited in official investigative reports. A comprehensive analytical theory of the cause-effect relationships governing propagation of human error is indispensable to a reconstruction of the underlying and contributing causes. A validated analytical theory of the input-output behavior of human operators involving manual control, communication, supervisory, and monitoring tasks which are relevant to aviation, maritime, automotive, and process control operations is highlighted. This theory of behavior, both appropriate and inappropriate, provides an insightful basis for investigating, classifying, and quantifying the needed cause-effect relationships governing propagation of human error

New moduli spaces of pointed curves and pencils of flat connections

It is well known that formal solutions to the Associativity Equations are the same as cyclic algebras over the homology operad $(H_*(\bar{M}_{0,n+1}))$ of the moduli spaces of $n$--pointed stable curves of genus zero. In this paper we establish a similar relationship between the pencils of formal flat connections (or solutions to the Commutativity Equations) and homology of a new series $\bar{L}_n$ of pointed stable curves of genus zero. Whereas $\bar{M}_{0,n+1}$ parametrizes trees of $\bold{P}^1$'s with pairwise distinct nonsingular marked points, $\bar{L}_n$ parametrizes strings of $\bold{P}^1$'s stabilized by marked points of two types. The union of all $\bar{L}_n$'s forms a semigroup rather than operad, and the role of operadic algebras is taken over by the representations of the appropriately twisted homology algebra of this union.Comment: 37 pages, AMSTex. Several typos corrected, a reference added, subsection 3.2.2 revised, subsection 3.2.4 adde

On morphological hierarchical representations for image processing and spatial data clustering

Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing