A numerical method for passive scalar and self-advection dynamics, Lagrangian rearrangement, is proposed. This fully Lagrangian advection algorithm introduces no artificial numerical dissipation or interpolation of parcel values. In the zero-viscosity limit, it preserves all of the Casimir invariants associated with parcel rearrangement. In the twodimensional case presented here, these invarian...

Lagrangian theory provides a diverse set of tools for continuous motion analysis. Existing work shows the applicability of Lagrangian method for video analysis in several aspects. In this paper we want to utilize the concept of Lagrangian measures to detect violent scenes. Therefore we propose a local feature based on the SIFT algorithm that incooperates appearance and Lagrangian based motion m...

The subgradient method is used frequently to optimize dual functions in Lagrangian relaxation for separable integer programming problems. In the method, all subproblems must be solved optimally to obtain a subgradient direction. In this paper, the surrogate subgradient method is developed, where a proper direction can be obtained without solving optimally all the subproblems. In fact, only an a...

In this paper Mathematical structure of time-dependent Lagrangian systems and their symmetries are extended and the explicit relation between constants of motion and infinitesimal symmetries of time-dependent Lagrangian systems are considered. Starting point is time-independent Lagrangian systems ,then we extend mathematical concepts of these systems such as equivalent lagrangian systems to th...

In this paper, an optimal stable algorithm is presented for members of a robots swarm moving toward a target. Equations of motion of the swarm are based on Lagrangian energy equations. Regarding of similar research On the design of swarm motion algorithm, an equation of motion considered constraints to guarantee no collision between the members and the members and obstacles along the motion pat...

In this paper, we propose combining augmented Lagrangian optimization with the dual decomposition method to obtain a fast algorithm for approximate MAP (maximum a posteriori) inference on factor graphs. We also show how the proposed algorithm can efficiently handle problems with (possibly global) structural constraints. The experimental results reported testify for the state-of-the-art performa...

The paper deals with the economic dispatch problem for a district heating system. The distribution network is modeled with a number of nodes and arcs, implying that time delays and restrictions in distribution capacity can be considered. A solution algorithm for the corresponding nonlinear optimization problem is proposed. The method is based on Lagrangian relaxation and exploits the relations ...

In this paper we consider the single machine scheduling problem with precedence constraints to minimize the total weighted tardiness of jobs. This problem is known to be strongly NP-hard.A solution methodology based on Lagrangian relaxation is developed to solve it. In this approach, a hybrid backward and forward dynamic programming algorithm is designed for the Lagrangian relaxed problem, whic...

In this paper, we formulate a new problem related to the well-known influence maximization in the context of computational advertising. Our new problem considers allocating marketing channels (e.g., TV, newspaper, and websites) to advertisers from the view point of a match maker, which was not taken into account in previous studies on the influence maximization. The objective of the problem is ...

Arterial spin labeling (ASL) is a noninvasive magnetic resonance imaging (MRI) technique for microvascular blood flow measurement. We used a continuous ASL scheme (CASL) to investigate the hyperemic flow difference between major muscle groups in human extremities. Twenty-four healthy subjects with no evidence of vascular disease were recruited. MRI was conducted on a 3.0 Tesla Siemens Trio whol...