The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ where the game is played with perfect information, the different sides moving alternately. The cops capture the robber when one of them occupies the same vertex as the robber at any time in the game. A copwin graph is one in which one cop can always capture the robber. A graph is cop-win edge-critical with respect to ...

Although many researchers and practitioners have discussed different aspects of outsourcing in the past, there have been only a handful of papers that grapple these complex issues from a broad perspective. The main purpose of this study is to lay an integrative groundwork for the understanding of outsourcing, including its key research areas, its evolution, its theoretical models, and its futur...

The present research is conducted to show that organizations can use wiki to attract customers' purchase intention inside the e-commerce context. Considering the relation between wiki and ecommerce for CRM, this research tries to explore the characteristics such as perceived risk, customer experience, knowledge sharing culture, trust and knowledge sharing in wiki tool impact on purchase intenti...

Through biological flume experiments, we studied the effect of shear velocity and attachment period on the percent detachment of Pecten maximus post-larvae of different sizes reared on two experimental diets. The first diet, (Pavlova lutheri, Isochrysis galbana, Chaetoceros calcitrans), which served as a reference diet (PTC), is commonly used in bivalve hatcheries; the second is the PTC diet wi...

This note presents the Seabreath wave energy converter, basically a multi-chamber floating oscillating water column device, and the lumped model used to size its chambers, the ducts and the turbine. The model is based on extensive testing carried out in the wave flume of the University of Padova using fixed and floating models with a dummy power take off and indirect measurement of the produced...

Let G be a finite connected graph of order at least two. Two players (a cop and a robber) are allowed to play a game on G according to the following rule: The cop chooses a vertex to stay then the robber chooses a vertex afterwards. After that they move alternately along edges of G, where the robber may opt to stay put when his turn to move comes. The cop wins if he succeeds in putting himself ...