We give an overview over various techniques forcreative telescoping, starting from the classical algorithms andending withthe most recent approaches based on Hermite reduction.
ISBN:
(纸本)9781509004621
We give an overview over various techniques forcreative telescoping, starting from the classical algorithms andending withthe most recent approaches based on Hermite reduction.
Warfarin which is a vitamin K antagonist is one of the most widely used oral anticoagulants worldwide. Genetic factors affecting warfarin (CYP2C9, CYP4F2 and VKORC1) have been shown in different studies. Apart from ge...
详细信息
ISBN:
(纸本)9781728128276
Warfarin which is a vitamin K antagonist is one of the most widely used oral anticoagulants worldwide. Genetic factors affecting warfarin (CYP2C9, CYP4F2 and VKORC1) have been shown in different studies. Apart from genetic factors, the effects of age, height, weight and bleeding condition also have been proven. the use of prescribed warfarin drug in the wrong doses leads to irreparable disasters for the patients. the amount of warfarin the patients have to take is determined by the INR machine and this takes a lot of time. Since dose estimation takes a long time with conventional methods, use of data mining algorithms has been proposed for prediction of warfarin dose. In this paper, unlike previous studies, it was shown that the amount of warfarin was calculated not by numeric prediction but by classification, and better accuracy rates than previous success accuracy rates were obtained. Using the data obtained from the Turkish patients in the study, the dose range required for daily use of the patient's warfarin drug dose was classified by Bayesian and K-Nearest Neighbor (KNN) algorithms. the result of this study using Bayesian algorithm calculated as %59.01 and using KNN algorithm calculated as %50.52.
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods to prove or disprove convexity of ration...
详细信息
ISBN:
(纸本)9783642152733
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods to prove or disprove convexity of rational functions over a polyhedral domain. Our algorithms reduce convexity questions to real quantifier elimination problems. Our methods are implemented and publicly available in the open source computer algebra system Reduce. Our long term goal is to integrate Reduce as a "workhorse" for symbolic computations into a numerical solver.
the aim of this paper is to discuss a novel application of Grobner bases in the study of Diophantine equations. the idea appeared during some work on the number of solutions of systems of Pell equations, but can be us...
详细信息
the aim of this paper is to discuss a novel application of Grobner bases in the study of Diophantine equations. the idea appeared during some work on the number of solutions of systems of Pell equations, but can be useful in other circumstances as well.
Toom-Cook algorithms are efficient subquadratic polynomial/long integers multiplication methods. In general, only the degree 2 (Karatsuba), 3 and 4 version are used in practice. In this paper we analyse a high (8-way ...
详细信息
Toom-Cook algorithms are efficient subquadratic polynomial/long integers multiplication methods. In general, only the degree 2 (Karatsuba), 3 and 4 version are used in practice. In this paper we analyse a high (8-way - degree 7) version, showing it can be effective for long integers whose digits number lies in a certain range. Comparison with GMP 4.3.0 library shows that the gain for multiplication and squaring can be quite considerable.
In this paper, we extend some complexity results on the secrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
In this paper, we extend some complexity results on the secrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
this paper describes a sort of case study of how ideas from computational logic (specifically, satisfiability modulo theory solving) provide new algorithms in symboliccomputing. In particular, it describes how ideas ...
详细信息
ISBN:
(纸本)9781509057085
this paper describes a sort of case study of how ideas from computational logic (specifically, satisfiability modulo theory solving) provide new algorithms in symboliccomputing. In particular, it describes how ideas from the NLSAT solver led to a new kind of Cylindrical Algebraic Decomposition.
We present and illustrate a method for the generation of the termination conditions for nested loops with abrupt termination statements. the conditions are (first-order) formulae obtained by certain transformations of...
详细信息
暂无评论