A new algorithmic scheme for computing characteristic sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithmic Scheme for Computing Characteristic Sets

Ritt-Wu’s algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangulari...

متن کامل

Providing A New Characteristic for Overcurrent Relays

This with the integration of distributed generation (DG) to meshed distribution systems, the operating time of the protective system becomes a major concern in order to avoid nuisance DG tripping. This paper proposes a new tripping characteristic for directional overcurrent relays (DOCRs) that can achieve a higher possible reduction of overall relays operating time in meshed distribution networ...

متن کامل

Verified Methods for Computing Pareto Sets: General Algorithmic Analysis

In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set – set of all possible solutions x which cannot be improved in all categories (i.e., for which fj(x′) ≥ fj(x) for all j and fj(x′) > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between,...

متن کامل

Validated Methods for Computing Pareto Sets: General Algorithmic Analysis

In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set – set of all possible solutions x which cannot be improved in all categories (i.e., for which fj(x′) ≥ fj(x) for all j and fj(x′) > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between,...

متن کامل

An Enhanced MSS-based checkpointing Scheme for Mobile Computing Environment

Mobile computing systems are made up of different components among which Mobile Support Stations (MSSs) play a key role. This paper proposes an efficient MSS-based non-blocking coordinated checkpointing scheme for mobile computing environment. In the scheme suggested nearly all aspects of checkpointing and their related overheads are forwarded to the MSSs and as a result the workload of Mobile ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2013

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2012.04.004