We study a pursuit-evasion game in which one or more cops try to capture a robber by moving onto the robber’s current location. All players have equal maximum velocities. They can observe each other at all times. We show that three cops can capture the robber in any polygonal environment (which can contain any finite number of holes).

The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against a robber. The robber and the cops are placed on the vertices of the graph; they take turns in moving to adjacent vertices (or staying), cops inside the guarded region, the robber on the remaining vertices (the robber-region). The goal of the robber is to enter the guarded region a...

Coatomer is a cytosolic protein complex that forms the coat of COP I-coated transport vesicles. In our attempt to analyze the physical and functional interactions between its seven subunits (coat proteins, [COPs] alpha-zeta), we engaged in a program to clone and characterize the individual coatomer subunits. We have now cloned, sequenced, and overexpressed bovine alpha-COP, the 135-kD subunit o...

We analyse the Cops and ∞-fast Robber game on the class of interval graphs and prove it to be polynomially decidable on such graphs. This solves an open problem posed in paper “Pursuing a fast robber on a graph” by Fomin et al. [4] The game is known to be already NP-hard on chordal graphs and split-graphs. The game is played by two players, one controlling k cops, the other a robber. The player...

The objective of this study was to define the effects of various cooking and re-heating methods (pan roasting, steaming, oven grilling and micro-waving) on the cholesterol and formation of cholesterol oxidation products in beef loin during storage at 4°C. Raw samples showed lower total cholesterol content than cooked products sampled during storage for 6 d. The following cholesterol oxidation p...

Graph searching problems are described as games played on graphs, between a set of cops and a fugitive. Variants of the game restrict the abilities of the cops and the fugitive and the corresponding search numbers (the least number of cops that have a winning strategy) are related to several well-known parameters in graph theory. We study the case where the fugitive is visible (the cops’ strate...

The effect of irradiation and packaging conditions on the formation of cholesterol oxidation products (COPs) as well as lipid oxidation products was determined in raw turkey leg, beef, and pork loin meat during 7 days of storage. Ground turkey leg, beef, and pork loin muscles were prepared as patties. The patties were individually packaged either in oxygen-permeable or impermeable bags, irradia...

Background: Despite the existence of proven solutions to improve maternal health, innovative approaches are still necessary to support the implementation of programs and policies in real-world settings. To address this challenge, we developed a participatory capacity strengthening model based on Communities of Practice (CoPs) of maternal health frontline personnel and decision-makers involved i...

Extending Rudolph’s works on the convergence analysis of evolutionary computation (EC) for deterministic combinatorial optimization problems (COPs), this brief paper establishes a probability one convergence of some variants of explicit-averaging EC to an optimal solution and the optimal value for solving stochastic COPs.

Configuration checking (CC) has been confirmed to alleviate the cycling problem in local search for combinatorial optimization problems (COPs). When using CC heuristics graph problems, a critical concept is configuration of vertices. All existing variants employ either 1- or 2-level neighborhoods vertex as its configuration. Inspired by idea that with different levels should have contributions ...