Conventional holonomic or nonholonomic constraints are defined as geometric constraints in this paper. If the total energy of a dynamic system can be computed from the initial energy plus the time integral of the energy input rate due to external or internal forces, then the total energy can be artificially treated as a constraint. The violation of the total energy constraint due to numerical e...

‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

hydroforming process in one of the most effective production method, for improving the drawing ratio in sheet metal forming process. this is due to the fact that in hydroforming process, forming takes place using a punch which drives the part forward via a controlled fluid pressure. in this paper, deep drawing hydroforming for circular punch is investigated. different pressure paths are tested ...

nowadays, economic load dispatch between generation units with least cost involved is one of the most important issues in utilizing power systems. in this paper, a new method i.e. water cycle algorithm (wca) which is similar to other intelligent algorithm and is based on swarm, is employed in order to solve the economic load dispatch problem between power plants. wca is used to solve complicate...

Control by eddy current is one of techniques that’s very used in nondestructive evaluation of materials .These processes find an application significant in the determination of the mechanical and metallurgical parameters of materials. The object of this work is to carry out an analysis of the residual stresses in the material created by external solicitations and analysed by eddy currents as a ...

This paper describes a flexible framework and an efficient algorithm for constraint-based spatiotemporal configuration problems. Binary constraints between spatio-temporal objects are first converted to constraint regions, which are then decomposed into hierarchical data structures; based on this constraint decomposition, an improved backtracking algorithm called HBT can compute a solution quit...

Constraint satisfaction problems are an important class of problems in complexity theory. They generalize many combinatorial problems as well as satisfiability problems and provide canonical complete problems for many complexity classes. The computational complexity of all Boolean constraint satisfaction problems was classified by Schaefer [Sch78] and reveals a dichotomic behavior that is conje...

We show that in modified Faddeev-Jackiw formalism, first and second class constraints appear at each level, and the whole constraint structure is in exact correspondence with level by level method of Dirac formalism. e-mail: [email protected] e-mail:[email protected] The standard method for analysis of the constrained systems is known to be the Dirac formalism [1]. Faddeev and Jac...