In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

  In this paper imprecise target models has been proposed to investigate the relation between imprecise data envelopment analysis (IDEA) and mini-max reference point formulations. Through these models, the decision makers' preferences are involved in interactive trade-off analysis procedures in multiple objective linear programming with imprecise data. In addition, the gradient projection type...

in this paper imprecise target models has been proposed to investigate the relation between imprecise data envelopment analysis (idea) and mini-max reference point formulations. through these models, the decision makers' preferences are involved in interactive trade-off analysis procedures in multiple objective linear programming with imprecise data. in addition, the gradient projection type me...

a r t i c l e i n f o This paper develops an automated negotiation procedure inclusive of mechanism design and agent design for bilateral multi-issue negotiations under two-sided information uncertainty. The proposed negotiation mechanism comprises a protocol called MUP (Monotonic Utility-granting Protocol) and a matching strategy called WYDIWYG (What You Display Influences What You Get). The p...

Diffusion equation with anisotropic coefficients arise in many environmental topics, heat transfer, groundwater flow and transport problems, petroleum reservoir simulations, hydrodynamic simulations, ... These problems are characterized by a full rank diffusion tensor, that is diagonal only if the reference system is aligned with the principal direction of anisotropy (Bear). Numerical difficult...

In this paper, we present a fast and easy-to-implement locally physics-based Inverse Kinematics(IK) method. Our method builds upon a mass-spring model and relies on force interactions between masses. Joint rotations are computed using the closed-form method with predefined local axis coordinates. Combining these two approaches offers convincing visual quality results obtained with high time per...

As service providers move more applications to their IP/MPLS (Multiple Protocol Label Switching) networks, rapid restoration upon failure becomes more and more crucial. Recently MPLS fast reroute has attracted lots of attention as it was designed to meet the needs of real-time applications, such as voice over IP. MPLS fast reroute achieves rapid restoration by computing and signaling backup lab...

Algebraic attacks is a powerful type of attacks against LFSR-based stream ciphers. Solving large sparse linear equations Ax = b is needed for this attack. The traditional Gaussian elimination is not efficient for such matrix equations because of its cube run time complexity. Quadratic run time algorithms like Lanczos or Wiedemann Methods are the better for such large sparse matrices. We impleme...