Solving constrained optimization problems (COPs) has been gathering attention from many researchers. In this paper, we defined the best fitness value among feasible solutions in current population as gbest. Then, we converted the original COPs to multi-objective optimization problems (MOPs) with one constraint. The constraint set the function value f(x) should be less than or equal to gbest; th...

In recent years, the constrained optimization problems have become a hot topic among the interest of scholars. In this paper, a new improved artificial immune algorithm is proposed and then used for solving constrained optimizations problems (COPs). This algorithm will treat these COPs as multi-objective optimization problems, and it is based on the concept of Pareto optimization to solve COPs....

Vertex pursuit games are widely studied by both graph theorists and computer scientists. Cops and Robbers is a vertex pursuit game played on a graph, where some set of agents (or Cops) attempts to capture a robber. The cop number is the minimum number of cops needed to win. While cop number of a graph has been studied for over 25 years, it is not well understood, and has few connections with ex...

In the classical game of Cops and Robbers on graphs, the capture time is defined by the least number of moves needed to catch all robbers with the smallest amount of cops that suffice. While the case of one cop and one robber is well understood, it is an open question how long it takes for multiple cops to catch multiple robbers. We show that capturing ` ∈ O (n) robbers can take Ω (` · n) time,...

Let G be a finite connected graph. Two players, called cop C and robber R, play a game on G according to the following rules. First C then R occupy some vertex of G. After that they move alternately along edges of G. The cop C wins if he succeeds in putting himself on top of the robber R, otherwise R wins. We review an algorithmic characterization and structural description due to Nowakowski an...

We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By investigati...

Many products of lipid oxidation have been associated with human diseases. These include F2-isoprostanes (F2-IsoPs), hydroxyeicosatetraenoic acid products (HETEs), and cholesterol oxidation products (COPs). Here we present measurements of F2-IsoPs, HETEs, COPs, and arachidonate in single plasma samples of patients with acute (dengue fever and ischemic stroke) and chronic (Parkinson's) diseases,...

Certified Occupational Physician System (COPS) of Japan Society for Occupational Health has been in existence for 21 years, since 1992. UOEH has supported this system as a secretary general. In this report, we review the 2012 revision of COPS. With the new title of Certified Associate Occupational Physician (CAOP), this revision was established to produce well-educated and experienced occupatio...

One disadvantage of amino acid-based chiral selectors for micellar electrokinetic chromatography (MEKC) is that either they have very low solubility or are insoluble at acidic pHs. In order to increase solubilities at lower pHs, we have synthesized a highly water-soluble achiral surfactant and copolymerized it with an amino acid-based chiral surfactant. These two surfactants were polymerized ei...

Abstract. In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most C p|V (G)|. In a separate ...