The origins of federal public enterprises in Canada: an appraisal of two approaches

The Green Party of Canada, as a vital aspect of the Canadian green movement, and its connection to international green organizations can be examined primarily through the examp l es of both the Canadian Greens and the Green party of Ontario , by using original party documents and literature, information gained through Green party meetings and discussions with members, and commentary by Green theorists where app licable. As well, the influence on the Canadian green movement by the German Green Party is out lined , again mainly through party literature, documents and critiques of the party's experiences. This study reveals several existing and potential problems fo r t he Green Party in Canada, and the political fut ure of the Canadian green movement in general. Some, such as the real i ties of the Canadian political system are external to the movement, and may be overcome with adjustments in goals and methods, and a realization of the changing attitude towards environmental issues in a political context . On the other hand, internal party disfunctions in both organization and direction, caused mainly by the indefinite parameters of green ideology, threaten to expl oi t t he al ready problematic aspects evident in t he Green Party . Aside from its somewhat slow beginnings, the Green Party in Canada has developed into a strong grassroots social movement, not however from its political visibility but from the steady growth in the popul ari ty of ecological pol i t ics in Canada . Due to the seeming enormity of the obstacles facing the Greens in their effort 4 to achieve electoral success, it is doubtful that Parliamentary representation will be achieved without a major re-orientation of party organization and methods. UI timately the strength of the Green Party in Canada will be based upon its ability to survive as a significant movement, and its willingness to continue to challenge political thought and practice.

Particle swarm optimization for two-connected networks with bounded rings

The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous solution space, modification of the algorithm was necessary in order to adapt it for such a highly constrained discrete combinatorial optimization problem. Presented are an indirect transcription scheme for applying PSO to such discrete optimization problems and an oscillating mechanism for averting stagnation.

Understanding how a spiritual retreat enhances the search for meaning and fulfillment in a large corporate workplace /

This study explored the concept of a spiritual retreat for frontline employees of a large corporate call centre. During a 1 day retreat, 4 call centre employees were introduced to various meditation and retreat activities. Follovsdng the retreat the participants were asked to incorporate the various meditations and activities into their workplace. The participants kept journals throughout the study in an effort to determine what occurred when these practices were transferred from the retreat setting to the workplace. This study examined how a working spirituality enhances one's sense of fulfillment, defined by certain critical elements: relationship, awareness, ritual, internal commitment, and choice. Although the retreat was a successful means of exploring these elements, the degree to which each employee could benefit from them was determined by the extent of their internal commitment not only to themselves, but also to their jobs.

Multinational drug corporations, intellectual property rights and the Canadian state : a historical and critical analysis

This study critically analyzes the historical role and influence of multinational drug cotpOrations and multinational corporations in general; the u.s. government and the Canadian state in negotiating the global recognition ofIntellectual Property Rights (IPR) under GATT/NAFTA. This process began in 1969 when the Liberal government, in response to high prices for brand-name drugs amended the Patent Act to introduce compulsory licensing by reducing monopoly protection from 20 to seven years. Although the financial position ofthe multinational drug industry was not affected, it campaigned vigorously to change the 1969 legislation. In 1987, the Patent Act was amended to extend protection to 10 years as a condition for free trade talks with the u.s. Nonetheless, the drug industry was not satisfied and accused Canada of providing a bad example to other nations. Therefore, it continued to campaign for global recognition ofIPR laws under GATT. Following the conclusion of the GATTI Trade-Related aspects of Intellectual Property Rights agreement (TRIPS) in 1991, the multinational drug industry and the American government, to the surprise of many, were still not satisfied and sought to implement harsher conditions under NAFTA. The Progressive Conservative government readily agreed without any objections or consideration for the social consequences. As a result, Bill C-91 was introduced. It abandoned compulsory licenses and was made retroactive from December 21, 1991. It is the contention of this thesis that the economic survival of multinational corporations on a global scale depends on the role and functions of the modem state. Similarly, the existence of the state depends on the ideological-political and socioeconomic assistance it gives to multinational corporations on a national and international scale. This dialectical relation of the state and multinational corporations is explored in our theoretical and historical analysis of their role in public policy.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.