Combinatorial filters have been the subject of increasing interest from the robotics community in recent years. This paper considers automatic reduction of combinatorial filters to a given size, even if that reduction necessitates changes to the filter’s behavior. We introduce an algorithmic problem called improper filter reduction, in which the input is a combinatorial filter F along with an i...

Multiple alignment is a core problem in computational biology that has received much attention over the years, both in the line of heuristics and hardness results. In most expositions of the problem it is referred to as NP-hard and references are given to one of the available hardness results. However, previous to this paper not even the most elementary variation of the problem, multiple alignm...

a three stage production system is considered in this paper. there are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. suppose that a number of products of different kinds are ordered. each product is assembled with a set of several parts. at first the parts are produced in the first stage with parallel machines a...

Urban sprawl is a hot topic of global concern with increasing dramatically and impact on ecological environment. But there is not a mature method to explain the detail of process of urban sprawl and dynamic changes. In this paper, the dynamic changes of urban is studied based on 1980, 1988, 1994, 2000 and 2005 five remote sensing images of Shenzhen. It is distinguished three types including inf...

this paper proposes a bi-objective model for the facility location problem under a congestion system. the idea of the model is motivated by applications of locating servers in bank automated teller machines (atms), communication networks, and so on. this model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

We now return to the one basic design paradigm we skipped in our discussion of approximation algorithms for NP-hard optimization problems, namely divide-and-conquer (DC), and apply it to problems on graphs. The basic idea is as follows: Find a balanced cut of small capacity, i.e., a cut in which both sides contain roughly the same number of vertices and such that few edges cross the cut. Ignore...

Background This study aimed to assess the protective effects of saturejakhuzistanica (SJKH) on sperm quality parameters in the Nonyl phenol (NP) - treated mice. MaterialsAndMethods In present experimental study, 32 young adult male mice (8-12 weeks) were randomly divided into four groups including control and test groups. The control group received corn oil orally, and the test groups were trea...