the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in s...
详细信息
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in some families of means. Most of the computations are performed withthe symbolic capabilities of the Maple computer algebra system.
the goal of this research is to perform origami geometric constructions in the 3D space using the symbolic computation capabilities in the computational origami system Eos. In this paper, we explain the formalization ...
详细信息
ISBN:
(纸本)9781538626276
the goal of this research is to perform origami geometric constructions in the 3D space using the symbolic computation capabilities in the computational origami system Eos. In this paper, we explain the formalization of the fold that generates non-flat origamis. We show the example of constructing a non-flat module of an origami polytope.
We present some properties of multisets comparedto sets, regarding the relations and operations between multisets, in an attempt to simplify the analysis of multisets. We introducemixed operations between sets and mul...
详细信息
ISBN:
(纸本)9781509004621
We present some properties of multisets comparedto sets, regarding the relations and operations between multisets, in an attempt to simplify the analysis of multisets. We introducemixed operations between sets and multisets and analyze thedressed epsilon (membership) symbol, which gives additionalinformation to the multiplicity of elements in a multiset.
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a...
详细信息
While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. this is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose.
We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a dist...
详细信息
We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness.
the purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent l...
详细信息
the purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent logics. It was found that the technique reported at the SYNASC 2008 symposium and based on the original notions of admissibility and compatibility can satisfactorily be applied for proving Herbrand theorems for the logics under consideration in the sequent form.
Denote by P n the space of real polynomials p of degree at most n equipped withthe sup norm on the interval I = [−1, 1]. the unit ball B n with respect to the sup norm is a compact convex set. Let EB n denote the ...
详细信息
Denote by P n the space of real polynomials p of degree at most n equipped withthe sup norm on the interval I = [−1, 1]. the unit ball B n with respect to the sup norm is a compact convex set. Let EB n denote the set of the extreme points of B n .
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable ...
详细信息
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable jumping Petri ***, as future work, we discuss some ideas for parallel implementations of the decision procedures for these problems.
the densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach ...
详细信息
the densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. numerical experiments show the effectiveness and potential of the proposed approach.
We report on a symbolic-numeric algorithm for computingthe Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficie...
详细信息
We report on a symbolic-numeric algorithm for computingthe Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with computational geometry algorithms in order to compute efficient and accurate results. Nonetheless the problem we are dealing with is ill-posed, in the sense that tiny perturbations in the coefficients of the defining polynomial cause huge errors in the computed results.
暂无评论