in this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. tractability and dierentiability index are introduced based on the-smoothing property of a volterra integral operator and index reduction procedure, respectively. using the notion of index, we give sucient conditions for the...

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

This paper proposes a discrete particle swarm optimization (DPSO) for the solution of the shortest path problem (SPP). The proposed DPSO termed as DPSO_SPP adopts a new solution representation which incorporates a search decomposition procedure and random selection of priority value. The purpose of this representation is to reduce the searching space of the particles, leading to a better soluti...

We extend the iterated transformation theory (ITT ) fractal image coding algorithm proposed by A. Jacquin [1] to generate a pyramid image representation. An ITT coded image is modeled as the solution of a second kind functional equation. This representation is iterated to form an ITT chain of functional equations which can serve as the framework for a multiscale signal decomposition. This forma...

Optimization algorithms are adaptive when they sample problem solutions based on knowledge of the overall search space gathered from past sampling. Recently, competent adaptive optimization algorithms have been developed that achieve this adaptability via probabilistic modeling of the search space. However, their effectiveness requires the existence of a compact problem decomposition in terms o...

Creative solution for a problem depends on its proper representation. For a systematic search for a new representation we introduced Semiotic Introspection Principle (SIP). The resulting representations are compared with other attempts to find a solution, borrowed from the paper on creativity published by McCarthy and related to his “Tough Nut Problem”. It is also shown in our paper how to obta...

Geometric crossover is a representation-independent generalisation of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work, we have applied geometric crossover to simple permutations. In ...