gerbera one of 10 important cut flowers in the world and iran. one of the most problems is low-life after harvest and neck bending. producers want to increase longevity of these flowers with using chemical solutions. with the aim of achieving the best chemical treatments to increase flower vase life gerbera goodtimming, nano silver (5 mg l-1), humic acid (50 mg l-1), gibberellic acid (2.5 mg l-...

In recent years many algorithms have been proposed in the literature for solving the Max-Cut problem. In this paper we report on the application of a new Tabu Search algorithm to large scale Max-cut test problems. Our method provides best known solutions for many well-known test problems of size up to 10,000 variables, although it is designed for the general unconstrained quadratic binary progr...

The article provides an α-cut-based method that solves linear fractional programming problems with fuzzy variables and unrestricted parameters. parameters are considered as asymmetric triangular numbers, which is a generalization of the symmetric case. problem solved by using α-cut numbers wherein α- r-cut applied to objective function constraints, respectively. This reduces into equivalent bio...

introduction: discharge of textile wastewater causes the reduction of sunlight penetration, interferes with the receiving waters ecology and damage the environment. the aim of this study was to determine the removal efficiency of reactive blue 19 dye from aqueous solutions by cuttlefish bone powder. materials & methods: this study was performed experimentally and in laboratory scale. in this re...

We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly normalize in natural deduction modulo R, and that cut elimination holds in the intuitionistic sequent calculus modulo R. We first define a syntactic and a s...

the rings considered in this article are  commutative  with identity which admit at least two  nonzero annihilating ideals. let $r$ be a ring. let $mathbb{a}(r)$ denote the set of all annihilating ideals of $r$ and let $mathbb{a}(r)^{*} = mathbb{a}(r)backslash {(0)}$. the annihilating-ideal graph of $r$, denoted by $mathbb{ag}(r)$  is an undirected simple graph whose vertex set is $mathbb{a}(r)...

We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly normalize in natural deduction modulo R, and that cut elimination holds in the intuitionistic sequent calculus modulo R. We first define a syntactic and a s...

 The rings considered in this article are  commutative  with identity which admit at least two  nonzero annihilating ideals. Let $R$ be a ring. Let $mathbb{A}(R)$ denote the set of all annihilating ideals of $R$ and let $mathbb{A}(R)^{*} = mathbb{A}(R)backslash {(0)}$. The annihilating-ideal graph of $R$, denoted by $mathbb{AG}(R)$  is an undirected simple graph whose vertex set is $mathbb{A}(R...