The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...

Branching variable selection can greatly affect the effectiveness and efficiency of a branchand-bound algorithm. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We propose an approach which is empowered by exploiting the information contained in a family of fathomed subproblems, collected beforehand from ...

abstract this paper presents a multiobjective power control algorithm that updates the transmitted power based on local information. the proposed algorithm is expanded by using multiobjective optimization schemes. the objectives to be optimized in this paper are determined so as to reduce the sinr fluctuations as well as maintaining the sinr to an acceptable level with minimizing an average tra...

Content-based image retrieval (CBIR) has been an active research topic in the last decade. In this paper we proposed an image retrieval method using global and local features. Firstly, for local features extraction, SURF algorithm produces a set of interest points for each image and a set of 64-dimensional descriptors for each interest points and then to use Bag of Visual Words model, a cluster...

Branching is an important component of the branch-and-cut algorithm for solving mixed integer linear programs. Most solvers branch by imposing a disjunction of the form“xi ≤ k ∨ xi ≥ k + 1” for some integer k and some integer-constrained variable xi. A generalization of this branching scheme is to branch by imposing a more general disjunction of the form “πx ≤ π0 ∨ πx ≥ π0 + 1.” In this paper, ...

Consider a countable collection (t) of particles located on a countable group, performing a critical branching random walk where the branching rate of a particle is given by a random medium uctuating both in space and time. Here we study the case where the time{space random medium (t) (called catalyst) is also a critical branching random walk evolving autonomously while the local branching rate...