• Canada
• Other research productsclose
• GB close
• DE close
• CZ close
• JP close

https://viurrspace.ca/bitstream/handle/10613/16537/Feb16-1901.pdf?sequence=2

https://viurrspace.ca/bitstream/handle/10613/22793/May23-1885.pdf?sequence=2&isAllowed=y

https://viurrspace.ca/bitstream/handle/10613/8934/Dec26-1908.pdf?sequence=2

https://viurrspace.ca/bitstream/handle/10613/12338/Mar17-1921.pdf?sequence=2&isAllowed=y

I consider the model of a differentiated duopoly with process R&D when goods are either substitute, complements or independent. I propose a non-cooperative two-stage game with two firms producing differentiated goods. In the first stage, firms decide their technologies and in the second stage, they compete in quantities or prices. I evaluate the social welfare within a framework of Cournot and Bertrand competition models with or without investment in research and development. I prove that the Cournot price can be lower than Bertrand price when the R&D technology is relatively inefficient; thus, Cournot market structure can generate larger consumer's surplus and welfare.

For each site (referred to by its SSSI and GCR names) each major and/or significant cave system is inventoried by way of an annotated outline map and appropriate text. Particular attention is paid to the more important and/or extensive groups of calcite speleothems and also the notable sections of undisturbed clastic sediments where known or identified. For both materials, their present state (as of 2001) is noted, but any monitoring exercise will have to start with a more detailed description for reference purposes. Locations of all significant sediments and deposits are indicated on the outline surveys. The scientific value of many caves lies in their passage morphology, as carved into the solid limestone. With rare exceptions, these features are not fragile and are barely impacted from cavers' visits. The main features are identified in this report, but without any attempt or need to detail most of them with reference to any future monitoring. For each site, the overall geological and geomorphological values are outlined only briefly by way of introduction. The reader is referred to Volume 12 of the Geological Conservation Review (Waltham et al., 1997), which contains fully referenced descriptions and evaluations of the geomorphological evolution of the sites. The results of explorations and research since 1997 are summarised in appropriately greater detail. The only references cited are those that post-date 1997 or are not cited in the GCR volume's extensive bibliography. Within nearly all the sites there are many smaller caves and potholes that add collectively to the scientific value of the site. Except for any with special significance, these are not described in detail but are all listed in Table 1 and described in Barrington and Stanton, (1977) and in Limestones and Caves of Wales (Ford, 1989). In particular, many sites are only of archaeological interest, and these are noted in Table 1, but are not dealt with here, as in many cases the entire cave is of interest. Furthermore, many caves contain small patches of undisturbed sediment and odd stalagmite deposits, whose scientific value is hard to quantify. Commonly, a stalagmite deposit may have little aesthetic value (for example if covered in sediment), but its potential scientific value may not be revealed unless a specific study is undertaken. Only some of the caves included in this report have had proper detailed geomorphological surveys, and even these will not have identified or reported all the significant features.

https://viurrspace.ca/bitstream/handle/10613/14393/Nov07-1918.pdf?sequence=2&isAllowed=y

The goal is to prove a surprising lower bound for resource augmented nonclairvoyant algorithms for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of average response time. Edmonds and Pruhs in SODA09 prove that for every $e > 0$, there is an algorithm $alg_{e}$ that is $(1!+!epsilon)$-speed $O({1 over e2})$-competitive. A problem, however, is that this algorithm $alg_{e}$ depends on $e$. The goal is to prove that every fixed deterministic nonclairvoyant algorithm has a suboptimal speed threshold, namely for every (graceful) algorithm $alg$, there is a threshold $1!+!beta_{alg}$ that is $beta_{alg} > 0$ away from being optimal such that the algorithm is $Omega({1 over e beta_{alg}})$ competitive with speed $(1 !+! beta_{alg}) !+! e$ and is $omega(1)$ competitive with speed $1 !+! beta_{alg}$. I have worked very hard on it and have felt that I was close. The proof technique is to use Brouwer's fixed point theorem to break the cycle of needing to know which input will be given before one can know what the algorithm will do and needing to know what the algorithm will do before one can know which input to give. Every thing I have can be found at

https://viurrspace.ca/bitstream/handle/10613/21807/Jan18-1893.pdf?sequence=2