Memory-based reasoning approach for pattern recognition of binary images

Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.

ChemInform Abstract: Synthesis of Anion-Deficient Layered Perovskites, ACa2Nb3-xMxO10-x (A: Rb, Cs; M: Al, Fe), Exhibiting Ion-Exchange and Intercalation. Evidence for the Formation of Layered Brownmillerites, ACa2Nb2AlO9 (A: Cs, H)

Anion-deficient layered perovskite oxides of the formula, ACa2Nb3-xMxO10-x (A = Rb, Cs; M = Al, Fe) for 0 < x less-than-or-equal-to 1.0, possessing tetragonal structures similar to the parent ACa2Nb3O10, have been synthesized. The interlayer A cations in these materials are readily exchanged with protons in aqueous HNO3 to give the protonated derivatives, HCa2Nb3-xMxO10-x; the latter are solid Bronsted acids intercalating a number of organic amines including aniline (pK(a) = 4.63). The distribution of acid sites in the interlayer region of HCa2Nb2MO9 inferred from n-alkylamine intercalation suggests that oxygen vacancies and Nb/M atoms are disordered in the ACa2Nb2MO9 samples prepared at 1100-1200-degrees-C. Annealing a disordered sample of CsCa2Nb2AlO9 for a long time at lower temperatures tends to order the Nb/Al atoms and oxygen vacancies to produce octahedral (NbO6/2)-tetrahedral (AlO4/2)-octahedral (NbO6/2) layer sequence reminiscent of the brownmillerite structure.

Probabilistic extension to realistic abductive reasoning model

In this paper, we give a method for probabilistic assignment to the Realistic Abductive Reasoning Model, The knowledge is assumed to be represented in the form of causal chaining, namely, hyper-bipartite network. Hyper-bipartite network is the most generalized form of knowledge representation for which, so far, there has been no way of assigning probability to the explanations, First, the inference mechanism using realistic abductive reasoning model is briefly described and then probability is assigned to each of the explanations so as to pick up the explanations in the decreasing order of plausibility.

ChemInform Abstract: Enantioselective Formal Total Synthesis of (-)-Homogynolide-A

ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.

ChemInform Abstract: Simple and Regioselective Reductive Cleavage of Tetrahydropyranyl Ethers to Alcohols

ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.

ChemInform Abstract: Slicing the Perovskite Structure into Layers: Synthesis of Novel Three- Dimensional and Layered Perovskite Oxides, ALaSrNb2M(II)O9 (A: Na, Cs)

ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.

ChemInform Abstract: Sodium Perborate/Acetic Anhydride: A Convenient Reagent for the Conversion of Cyclic Acetals to Esters

A facile oxidative cleavage of cyclic acetals to their respective esters using an inexpensive reagent system, sodium perborate/acetic anhydride is described.

ChemInform Abstract: Synthesis Based on Cyclohexadienes. Part 16. Synthesis of Methyl 2,7-Dimethyltricyclo (5.2.2.01,5)undec-5-ene-6-carboxylates

Synthesis of methyl 2, 7-dimethyltricyclo{5.2.2.0(1,5}undec-5-en-6-carboxylates, the tricyclic skeleton present in (+)-allo-cedrol (1) is described using the Diels-Alder strategy. Thus, Birch reduction of the aromatic acid 8 gives 5, the methyl ester of which is isomerised with DBU to a 1:1 mixture of the dienes 6 and 4. Cycloaddition of this mixture with 2-chloroacrylonitrile followed by hydrolysis yields the ketone 60 having the tricyclo{5.2.2.0(1.5)}undec-5-ene framework. Similar reaction with methyl vinyl ketone affords the regioisomeric adducts 61 and 62.

ChemInform Abstract: Chemical Design of Solid Inorganic Materials

Newer strategies for the synthesis of inorganic solids have made a great impact on present-day materials chemistry. In this article, typical case studies of synthesis involving new methods and soft chemical routes are discussed besides recent results from nebulized spray pyrolysis and synthesis of nanoscale metal and alloy particles.

Executable Analysis using Abstract Interpretation with Circular Linear Progressions

We propose a new abstract domain for static analysis of executable code. Concrete states are abstracted using circular linear progressions (CLPs). CLPs model computations using a finite word length as is seen in any real life processor. The finite abstraction allows handling overflow scenarios in a natural and straight-forward manner. Abstract transfer functions have been defined for a wide range of operations which makes this domain easily applicable for analyzing code for a wide range of ISAs. CLPs combine the scalability of interval domains with the discreteness of linear congruence domains. We also present a novel, lightweight method to track linear equality relations between static objects that is used by the analysis to improve precision. The analysis is efficient, the total space and time overhead being quadratic in the number of static objects being tracked.

WCET Estimation for Executables in the Presence of Data Caches

This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation, which is used for the dual purposes of tracking address computations and cache behavior. A simultaneous numeric and pointer analysis using an abstraction for discrete sets of values computes safe approximations of access addresses which are then used to predict cache behavior using Must Analysis. A heuristic is also proposed which generates likely worst case estimates. It can be used in soft real time systems and also for reasoning about the tightness of the safe estimate. The analysis methods can handle programs with non-affine access patterns, for which conventional Presburger Arithmetic formulations or Cache Miss Equations do not apply. The precision of the estimates is user-controlled and can be traded off against analysis time. Executables are analyzed directly, which, apart from enhancing precision, renders the method language independent.

Abstract Characteristic Function

The characteristic function for a contraction is a classical complete unitary invariant devised by Sz.-Nagy and Foias. Just as a contraction is related to the Szego kernel k(S)(z, w) = ( 1 - z(w)over bar)- 1 for |z|, |w| < 1, by means of (1/k(S))( T, T *) = 0, we consider an arbitrary open connected domain Omega in C(n), a kernel k on Omega so that 1/k is a polynomial and a tuple T = (T(1), T(2), ... , T(n)) of commuting bounded operators on a complex separable Hilbert spaceHsuch that (1/k)( T, T *) >= 0. Under some standard assumptions on k, it turns out that whether a characteristic function can be associated with T or not depends not only on T, but also on the kernel k. We give a necessary and sufficient condition. When this condition is satisfied, a functional model can be constructed. Moreover, the characteristic function then is a complete unitary invariant for a suitable class of tuples T.

Determinant: Old algorithms, new insights (Extended Abstract)

In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial, in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations, and show that they tally with well-known algorithms arrived at independently from considerations in linear algebra.

Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation

We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked to the power of the given abstract lattice. We address pointers in a first-class manner, including when they are used within loops to traverse and update recursive data structures. Finally, we illustrate the comparative precision of our slices over those of previous approaches using representative examples.