Let $R$ be a commutative Noetherian ring, $fa$ anideal of $R$ and $mathcal{D}(R)$ denote the derived category of$R$-modules. For any homologically bounded complex $X$, we conjecture that$sup {bf L}Lambda^{fa}(X)leq$ mag$_RX$. We prove thisin several cases. This generalize the main result of Hatamkhani and Divaani-Aazar cite{HD} for complexes.

Let (R,m) be a local ring, I a proper ideal of R and M a finitely generated R-module of dimension d. We discuss the local homology modules of H I (M). When M is Cohen-Macaulay, it is proved that H d m(M) is co-CohenMacaulay of N.dimension d and H x d (H m(M)) = M̂ where x = (x1, . . . , xd) is a system of parameters for M . 2000 Mathematics Subject Classification: 13C14, 13D45

In this work, we extend the existing local fractional Sumudu decomposition method to solve the nonlinear local fractional partial differential equations. Then, we apply this new algorithm to resolve the nonlinear local fractional gas dynamics equation and nonlinear local fractional Klein-Gordon equation, so we get the desired non-differentiable exact solutions. The steps to solve the examples a...

In this paper we describe the advantadges and disadvantages of local search and exact methods of solving NP-hard problems and see why combining the two approaches is highly desirable. We review some of the papers existent in the literature that create new algorithms from such combinations. In this paper we focus on local search approaches that are strengthened by the use of exact algorithms.

Restricted path consistency (RPC) is a strong local consistency for binary constraints that was proposed 20 years ago and was identified as a promising alternative to arc consistency (AC) in an early experimental study of local consistencies for binary constraints. However, and in contrast to other strong local consistencies such as SAC and maxRPC, it has been neglected since then. In this pape...

Following the 2008/9 financial crisis, China instituted a 4 trillion RMB stimulus package that was spent mostly on infrastructure, with a particular impact at local level. The goal was to sustain economic growth and preserve social stability. We use the Asian Barometer surveys from shortly before and after the stimulus to examine its impact on public trust in government, and find a reversal of ...

Genetic algorithms are efficient global optimizers, but they are weak in performing fine-grained local searches. In this paper, the local search capability of genetic algorithm is improved by hybridizing real coded genetic algorithm with 'uniform random' local search to form a hybrid real coded genetic algorithm termed 'RCGAu'. The incorporated local technique is applied to all newly created of...

For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. These are known as conflicting variables. We propose a new definition for measuring the conflict of a variable in a model and apply it to the set variables of models expressed in existential second-order logic extended with counti...

This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built...