Mathematica is a symbolic programming language that empowers the user to undertake complicated algebraic tasks. One such task is the derivation of maximum likelihood estimators, demonstrably an important topic in statistics at both the research and the expository level. In this paper, a Mathematica package is provided that contains a function entitled SuperLog. This function utilizes pattern-ma...

In this paper, we present an approach for handling attribute values of object classes with fuzzy information and uncertainty in object-oriented database based on theory hedge algebraic. In this approach, semantics be quantified by quantitative semantic mapping of hedge algebraic that still preserving in order semantics may allow manipulation data on the real domain of attribute in relation with...

In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic system, in verifying if the system is well-constrained for every state and if not in finding a state for which the system is bad-constrained. We first show that the problem reduces to the perfect matching free subgraph...

Tom and ApiGen are two complementary tools which simplify the definition and the manipulation of abstract datatypes. Tom is an extension of Java which adds pattern matching facilities independently of the used data-structure. ApiGen is a generator of abstract syntax tree implementations which interacts naturally with Tom. In this paper, we show how Eclipse can be extended to support the develop...

We focus on the problem of computing sampling points in a semi-algebraic set defined by equations and non-strict inequalities. This problem is reduced to computing sampling points in several real algebraic varieties, represent these points by rational parametrizations and decide the sign of some polynomials at the real solutions of these parametrizations. We show how these tasks can be deduced ...

We consider the classic problem of pattern matching with few mismatches in the presence of promiscuously matching wildcard symbols. Given a text t of length n and a pattern p of length m with optional wildcard symbols and a bound k, our algorithm finds all the alignments for which the pattern matches the text with Hamming distance at most k and also returns the location and identity of each mis...

[1] Luo, Z. X., Zhou, X. C., David XianFeng, G. U. (2014). From a projective invariant to some new properties of algebraic hypersurfaces.Science China Mathematics, 57(11), 2273-2284. [2] Fan, B., Wu, F., Hu, Z. (2010). Line matching leveraged by point correspondences. IEEE Conference on Computer Vision & Pattern Recognition (Vol.238, pp.390-397). [3] Fan, B., Wu, F., & Hu, Z. (2012). Robust lin...

Polymorphic variants are a well-known feature of the Objective Caml programming language, and they have turned popular since their introduction. They allow structural equality of algebraic type definitions, and code reuse through their polymorphism. Their typing and compilation have been studied in the past, and there are already detailed published works for both2),4). By their very nature, pol...

This paper presents a matching pursuit technique for computing the simplest normal forms of vector fields. First a simple, explicit recursive formula is derived for general differential equations, which reduces computation to the minimum. Then a matching pursuit technique is introduced and applied to the Takens–Bogdanov dynamical singularity. It is shown that unlike other methods for computing ...

Given a set S of 2n points in R d , a perfect matching of S is a set of n edges such that each point of S is a vertex of exactly one edge. The weight of a perfect matching is the sum of the Euclidean lengths of all edges. Rao and Smith have recently shown that there is a constant r > 1, that only depends on the dimension d, such that a perfect matching whose weight is less than or equal to r ti...