⎯The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature convergence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This cro...

* Correspondence author. Abstract The fuzzy multi-attribute decision making problems are investigated, in which the attribute values are given as intervalvalued intuitionistic fuzzy numbers and the attribute weight information is incomplete. Some operational laws of interval-valued intuitionistic fuzzy numbers, score function and accuracy function of interval-valued intuitionistic fuzzy numbers...

The concentrations of toxic effluents released into freshwater aquatic environments are increasing day by day and affect the aquatic biota. The present study outlined the evaluation of physicochemical parameters such as water temperature, pH, dissolved oxygen (DO), biological oxygen demand (BOD), chemical oxygen demand (COD), phosphates (PO42--P), nitrates (NO3--N), electrical conductivity (EC)...

This paper presents the block arithmetic coding for image compression (BACIC) algorithm: a new method for lossless bilevel image compression which can replace JBIG, the current standard for bilevel image compression. BACIC uses the block arithmetic coder (BAC): a simple, efficient, easy-to-implement, variable-to-fixed arithmetic coder, to encode images. BACIC models its probability estimates ad...

For a graph G = (V,E) and a binary labeling f : V (G) → Z2, let vf (i) = |f−1(i)|. The labling f is said to be friendly if |vf (1)−vf (0)| ≤ 1. Any vertex labeling f : V (G) → Z2 induces an edge labeling f∗ : E(G) → Z2 defined by f∗(xy) = |f(x)− f(y)|. Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| : f is a friendly verte...

Isolated invariant sets and their associated Conley indices are valuable tools for studying dynamical systems and their global invariant structures. Through their design, they aim to capture invariant behavior which is robust under small perturbations, and this in turn makes them amenable to a computational treatment. Over the years, a number of algorithms have been proposed to find index pairs...

Efficient implementation of DSP applications are critical for embedded systems. However, current applications written in C, make extensive use of pointer arithmetic making compiler analysis and optimisation difficult. This paper presents a method for conversion of a restricted class of pointer-based memory accesses typically found in DSP codes into array accesses with explicit index functions. ...

In this paper, Symmetric Trapezoidal Intuitionistic Fuzzy Numbers (STIFNs) have been introduced and their desirable properties are also studied. A new type of intuitionistic fuzzy arithmetic operations for STIFN have been proposed based on ( , )   -cuts. A numerical example is considered to elaborate the proposed arithmetic operations. These operations find applications in solving linear prog...

We shall denote the set of all regularly varying functions by R. We shall also denote by L the set of slowly slowly varying (or slowly oscillating) functions, namely those functions in R for which the index ρ = 0. It is easy to show that if h ∈ R, then there exists L ∈ L such that h(x) = xL(x), with ρ being the index of h. Slowly varying functions arise naturally in many branches of number theo...

One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...