Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5

We begin by showing how to faithfully encode the Classical ModalDisplay Logic (CMDL) of Wansing into the Calculus of Structures(CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination,we obtain a cut-elimination theorem for all corresponding CoScalculi. We then show how our result leads to a minimal cut-freeCoS calculus for modal logic S5. No other existing CoS calculifor S5 enjoy both these properties simultaneously.     

Influence of dietary iron deficiency on acute metal intoxication

The frequent difficulties encountered in the diagnosis of pediatric sarcomas, caused by the lack of observable differentiation at the light microscopic level, has led to the routine use of immunohistochemistry in pediatric surgical pathology. To a large degree the advent of this staining technique has led to the correct assessment of many perplexing lesions that previously would have been given inconclusive diagnoses. However, with increased usage and testing, it has become apparent that there are few, if any, "magic bullets" in immunohistochemistry for pediatric pathologists. Thus, it behooves diagnosticians to be careful in the usage of this technique, to be aware of possible discrepancies in its results, and to remember the ancillary nature of its application. The following article will review selected markers commonly used in pediatric surgical pathology, from both previous reports and the author's perspective, and will briefly consider several new phenotypic markers which have potential utility with childhood sarcomas.     

A study of the oxidation kinetics of CuFeO2 in the Cu-Fe-O system

The oxidation kinetics of CuFeO₂ in the Cu-Fe-O system have been studied between 500 and 900° C in an atmosphere containing 1 vol% oxygen in a nitrogen stream using thermogravimetric analysis (TGA). It was found that addition of Fe₂O₃ to the CuFeO₂ caused a decrease in the oxidation rate while addition of CuO caused an increase. On increasing the concentration of Fe₂O₃ the activation energy was found to increase from ~ 18 kcal mol^–1 to ~ 45 kcal mol^–1 and the exponent n in Avrami's equationf=1-exp (–kt ⁿ) was also observed to increase, from 1.3 to 2.3. On adding CuO to the CuFeO₂ in the Cu-Fe-O system the activation energy decreased from ~ 18 kcal mol^–1 to ~ 8 kcal mol^–1. The variation in both values indicates changes in the oxidation mechanisms. The microstructural changes associated with oxidation have been studied using optical microscopy. A model has been proposed to explain the results.     

A clustering performance measure based on fuzzy set decomposition

Clustering is primarily used to uncover the true underlying structure of a given data set and, for this purpose, it is desirable to subject the same data to several different clustering algorithms. This paper attempts to put an order on the various partitions of a data set obtained from different clustering algorithms. The goodness of each partition is expressed by means of a performance measure based on a fuzzy set decomposition of the data set under consideration. Several experiments reported in here show that the proposed performance measure puts an order on different partitions of the same data which is consistent with the error rate of a classifier designed on the basis of the obtained cluster labelings.     

Evaluation of projection algorithms

A number of linear and nonlinear mapping algorithms for the projection of patterns from a high-dimensional space to two dimensions are available. These two-dimensional representations allow quick visual observation of a data set. A combination of two popular mapping algorithms-Sammon's mean-square error technique and the triangulation method-is proposed to overcome the limitations in the individual algorithms. Some factors which describe the goodness of a projection are described, and a comparison is made of six of these algorithms by running them on four data sets. The results obtained support the use of the proposed algorithm.     

Optimal quadtrees for image segments

Quadtrees are compact hierarchical representations of images. In this paper, we define the efficiency of quadtrees in representing image segments and derive the relationship between the size of the enclosing rectangle of an image segment and its optimal quadtree. We show that if an image segment has an enclosing rectangle having sides of lengths x and y, such that 2N-1 × max (x, y) ? 2N, then the optimal quadtree may be the one representing an image of size 2N × 2N or 2N+1 × 2N+1. It is shown that in some situations the quadtree corresponding to the larger image has fewer nodes. Also, some necessary conditions are derived to identify segments for which the larger image size results in a quadtree which is no more expensive than the quadtree for the smaller image size.     

2010 CAV award announcement

The 2010 CAV (Computer-Aided Verification) award was awarded to Kenneth L. McMillan of Cadence Research Laboratories for a series of fundamental contributions resulting in significant advances in scalability of model checking tools. The annual award recognizes a specific fundamental contribution or a series of outstanding contributions to the CAV field.     

Minimal pathset and minimal cutsets using search technique

Application of graph theory to reliability analysis was first made in 1970 ^[1]. Over the years, a large number of computer programmes have been developed to determine the spanning trees, the minimal paths and cutsets, which are essential for determining the reliability of the network. In recent years, there has been an interest 2., 4. in developing small desk top calculators for specific purposes, which could be used by the designers of transportation systems, communication systems, etc. In this article the authors present an approach to design a microprocessor based equipment to determine minimal pathset and minimal cutset from the incidence matrix of the graph. The authors have presented a new design approach, based on search technique. The salient feature of the new approach is a novel tracing process in which the desired graph is traced by operating a set of constraints. The new design approach has already been used by the authors to develop a microprocessor based spanning tree generator 2., 3..     

An intrinsic dimensionality estimator from near-neighbor information

The intrinsic dimensionality of a set of patterns is important in determining an appropriate number of features for representing the data and whether a reasonable two- or three-dimensional representation of the data exists. We propose an intuitively appealing, noniterative estimator for intrinsic dimensionality which is based on nearneighbor information. We give plausible arguments supporting the consistency of this estimator. The method works well in identifying the true dimensionality for a variety of artificial data sets and is fairly insensitive to the number of samples and to the algorithmic parameters. Comparisons between this new method and the global eigenvalue approach demonstrate the utility of our estimator.