In this paper a new modification algorithm has been proposed to improve the transient response of the conventional second order CP-PLL system. The performances of the proposed system have been examined by solving the system equations numerically. Some analytical results are incorporated to confirm the performance enhancement of the conventional system by this proposed modified algorithm. Theore...

Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like E&LOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms....

Supporting students’ self-regulated learning (SRL) is an important topic in the learning sciences. Two critical processes involved in SRL are selfassessment and study choice. Intelligent tutoring systems (ITSs) have been shown to be effective in supporting students’ domain-level learning through guided problem-solving practice, but it is an open question how they can support SRL processes effec...

The PostLie algebra is an enriched structure of the Lie algebra that has recently arisen from operadic study. It is closely related to pre-Lie algebra, Rota-Baxter algebra, dendriform trialgebra, modified classical Yang-Baxter equations and integrable systems. This paper gives a complete classification of PostLie algebra structures on the Lie algebra sl(2,C) up to isomorphism. The classificatio...

In this work, an inverse finite element formulation was modified for considering material anisotropy in obtaining blank shape and forming severity of deep drawn orthotropic parts. In this procedure, geometry of final part and thickness of initial blank sheet were known. After applying ideal forming formulations between material points of initial blank and final shape, an equation system was obt...

We give a complete picture regarding the behavior of positive solutions of the following important difference equation: xn = 1+ ∑ k i=1αixn−pi / ∑m j=1βjxn−qj , n∈N0, where αi, i∈ {1, . . . ,k}, and βj , j ∈ {1, . . . ,m}, are positive numbers such that ∑ k i=1αi = ∑m j=1βj = 1, and pi, i ∈ {1, . . . ,k}, and qj , j ∈ {1, . . . ,m}, are natural numbers such that p1 < p2 < ··· < pk and q1 < q2 <...

We describe the implementation strategies of an intelligent algebra tutor, the “Equation Guru” (EG), which is designed to help students learn the concepts of equation solving with one unknown. EG provides a highly interactive and entertaining learning environment through the use of Microsoft Agents. It consists of two main parts. The first is the “Tutorial” part where students guided through th...

Solving a generalized Pell’s equation of the form , basically involves two steps. The first step is to find out the primitive solutions for the same, and the second step is to solve related Pell’s equation ; and combine the two solutions. Therefore it is evident that the number of independent primitive solutions determines the number of independent solution sets. In our work, we have tried to r...

We present a finite volume discretization of the nonlinear elliptic problems. The discretization results in a nonlinear algebraic system of equations. A Newton-Krylov algorithm is also presented for solving the system of nonlinear algebraic equations. Numerically solving nonlinear partial differential equations consists of discretizing the nonlinear partial differential equation and then solvin...

Basic narrowing is a restricted form of narrowing which constrains narrowing steps to a set of unblocked (or basic) positions. In this work, we study the modularity of termination of basic narrowing in hierarchical combinations of TRSs, which provides new algorithmic criteria to prove termination of basic narrowing. Basic narrowing has a number of important applications including equational uni...