No description available.

Under the current environment of Wireless Senor Networks (WSN), security is always one of the topics that everyone discussed about. Because of the limitations of WSN¡¦s unique resource, this results in the security of WSN needs to especially consider the calculating ability, memory capacity, characteristics of wireless communication, limited battery power supply, etc. Random key pre-distribution (RKP) is the one of the key distribution that is developed for the sake of safe communication of WSN, the characteristic of RKP is that there must have at least one common pre-distributed key in the two independent nodes in order to compose a pair-wise key, so that the safe communication can be carried out. However, if the nodes are distributed in the loose environment, the numbers of neighbors would be lower due to the decrease of average node degree. Then the connectivity of the entire network would decrease because it is not easy for the RKP to establish the pair-wise key. This paper would set the improvement of the entire network¡¦s connectivity under the loose environment as the starting point to extend the RKP-DE that only considers one-hop neighbor information, and reverse the flow path of RKP-DE and propose RKP- DEinverse from the viewpoint of two-hop neighbor information. Then RKP-DE and RKP- DEinverse are merged and become a new method ¡V RKP- DEtwo_hop, so as to try to prove that we can raise the connectivity of the whole network effectively.

abstract: Extremal graph theory results often provide minimum degree conditions which guarantee a copy of one graph exists within another. A perfect $F$-tiling of a graph $G$ is a collection $\mathcal{F}$ of subgraphs of $G$ such that every element of $\mathcal{F}$ is isomorphic to $F$ and such that every vertex in $G$ is in exactly one element of $\mathcal{F}$. Let $C^{3}_{t}$ denote the loose cycle on $t = 2s$ vertices, the $3$-uniform hypergraph obtained by replacing the edges $e = \{u, v\}$ of a graph cycle $C$ on $s$ vertices with edge triples $\{u, x_e, v\}$, where $x_e$ is uniquely assigned to $e$. This dissertation proves for even $t \geq 6$, that any sufficiently large $3$-uniform hypergraph $H$ on $n \in t \mathbb{Z}$ vertices with minimum $1$-degree $\delta^1(H) \geq {n - 1 \choose 2} - {\Bsize \choose 2} + c(t,n) + 1$, where $c(t,n) \in \{0, 1, 3\}$, contains a perfect $C^{3}_{t}$-tiling. The result is tight, generalizing previous results on $C^3_4$ by Han and Zhao. For an edge colored graph $G$, let the minimum color degree $\delta^c(G)$ be the minimum number of distinctly colored edges incident to a vertex. Call $G$ rainbow if every edge has a unique color. For $\ell \geq 5$, this dissertation proves that any sufficiently large edge colored graph $G$ on $n$ vertices with $\delta^c(G) \geq \frac{n + 1}{2}$ contains a rainbow cycle on $\ell$ vertices. The result is tight for odd $\ell$ and extends previous results for $\ell = 3$. In addition, for even $\ell \geq 4$, this dissertation proves that any sufficiently large edge colored graph $G$ on $n$ vertices with $\delta^c(G) \geq \frac{n + c(\ell)}{3}$, where $c(\ell) \in \{5, 7\}$, contains a rainbow cycle on $\ell$ vertices. The result is tight when $6 \nmid \ell$. As a related result, this dissertation proves for all $\ell \geq 4$, that any sufficiently large oriented graph $D$ on $n$ vertices with $\delta^+(D) \geq \frac{n + 1}{3}$ contains a directed cycle on $\ell$ vertices. This partially generalizes a result by Kelly, K\"uhn, and Osthus that uses minimum semidegree rather than minimum out degree. / Dissertation/Thesis / Doctoral Dissertation Mathematics 2019

Loosely coupled workgroups are common in the real world, and workers in these groups are autonomous and weakly interdependent. They have patterns of work and collaboration that distinguish them from other types of groups, and groupware systems that are designed to support loose coupling must address these differences. However, they have not been studied in detail in Computer-Supported Cooperative Work (CSCW), and the design process for these groups is currently underspecified. This forces designers to start from scratch each time they develop a system for loosely coupled groups, and they must approach new work settings with little information about how work practices are organized. <br><br> In this dissertation, I present a design framework to improve the groupware design process for loosely coupled workgroups. The framework has three main parts that add a new layer of support to each of the three stages in the general groupware design process: data collection about the target work setting, analysis of the data, and system design based on the analysis results. The framework was developed to provide designers with support during each of these stages so that they can consider important characteristics of loosely coupled work practice while carrying out design for the target group. The design framework is based on information from CSCW and organizational research, and on real-world design experiences with one type of loosely coupled workgrouphome care treatment teams. <br><br> The framework was evaluated using observations, interviews, and field trials that were carried out with multidisciplinary home care treatment teams in Saskatoon Health Region. A series of field observations and interviews were carried out with team members from each of the home care disciplines. The framework was then used to develop Mohoc, a groupware system that supports work in home care. Two field trials were carried out where the system was used by teams to support their daily activities. Results were analyzed to determine how well each part of the design framework performed in the design process. The results suggest that the framework was able to fill its role in specializing the general CSCW design process for loosely coupled groups by adding consideration for work and collaboration patterns that are seen in loosely coupled settings. However, further research is needed to determine whether these findings generalize to other loosely coupled workgroups.

The reality of cities is that, no matter how designed, controlled, or planned they are, people will do as they like. They will find ways to live and move through them that suit their purposes, even if this means going against a ‘designed’ system. In the case of South Africa during apartheid, this movement was obstructed by institutionalised segregation and State oppression. Apartheid, which means ‘apart’ and ‘hood’ in Afrikaans, was an attempt to inscribe a power structure into the spatial framework of a territory, based on notions of capitalism, race, and hygiene. As a mechanism of social control, it relied heavily on concepts of space and power to achieve the white ideal of racial segregation. Although the spaces of apartheid may be seen as fixed and concrete, internal contradictions contested their authority. While apartheid legislated, controlled, and monitored the movement of all South Africans, the actions of many of its citizens created counter mechanisms which diminished its effect. Despite the official days of apartheid now being over, the question remains: how do people create and maintain public life in the face of an administrative system of control? The spaces created by the everyday actions of those living under apartheid - the stories, music, dance, and protests that were part of the country’s culture of subversion and resistance - were, for years, the site of public life in South Africa.

Loosely coupled workgroups are common in the real world, and workers in these groups are autonomous and weakly interdependent. They have patterns of work and collaboration that distinguish them from other types of groups, and groupware systems that are designed to support loose coupling must address these differences. However, they have not been studied in detail in Computer-Supported Cooperative Work (CSCW), and the design process for these groups is currently underspecified. This forces designers to start from scratch each time they develop a system for loosely coupled groups, and they must approach new work settings with little information about how work practices are organized. <br><br> In this dissertation, I present a design framework to improve the groupware design process for loosely coupled workgroups. The framework has three main parts that add a new layer of support to each of the three stages in the general groupware design process: data collection about the target work setting, analysis of the data, and system design based on the analysis results. The framework was developed to provide designers with support during each of these stages so that they can consider important characteristics of loosely coupled work practice while carrying out design for the target group. The design framework is based on information from CSCW and organizational research, and on real-world design experiences with one type of loosely coupled workgrouphome care treatment teams. <br><br> The framework was evaluated using observations, interviews, and field trials that were carried out with multidisciplinary home care treatment teams in Saskatoon Health Region. A series of field observations and interviews were carried out with team members from each of the home care disciplines. The framework was then used to develop Mohoc, a groupware system that supports work in home care. Two field trials were carried out where the system was used by teams to support their daily activities. Results were analyzed to determine how well each part of the design framework performed in the design process. The results suggest that the framework was able to fill its role in specializing the general CSCW design process for loosely coupled groups by adding consideration for work and collaboration patterns that are seen in loosely coupled settings. However, further research is needed to determine whether these findings generalize to other loosely coupled workgroups.

Three hundred ninety one (391) spring wheat introductions from Asian, Middle Eastern and Mediteranean areas were screened for resistance to races C17, C20, C25, C49, C53 and C57 of Puccinia qraminis tritici; races 1, 5, 9, 15 and bulks 1, 4 and l0 of Puccinia recondita; races T2, T10, T13 and T39 of Ustilago tritici and to 6 isolates of Drechslera tritici-repentis prevalent in western Canada. Of the 34 introductions resistant to P. graminis tritici, 15 were genetically studied using F2 segregation data derived from the progeny of the crosses involving resistant introductions, their corresponding near isogenic lines and stem rust universal suscepts. Eleven of these were found to carry single Sr genes for resistance, notably, Sr30, Sr13 and Sr15. Of the 70 introductions resistant to P. recondita, 28 were studied and 9 were found to carry known Lr genes for resistance, notably Lr10 and the genes present in RL6057 and RL6061. Twenty two introductions are believed to carry either 1 or 2 unidentified dominant, recessive, partially dominant and/or complementary genes for resistance to either stem or leaf rust. Five introductions were immune and 6 highly resistant to the 4 races of U. tritici. Sixty-nine introductions were resistant to D. tritici-repentis . These were arbitrarily classified into 10 'phenotypic classes' according to their reactions to the 6 isolates used.

Three hundred ninety one (391) spring wheat introductions from Asian, Middle Eastern and Mediteranean areas were screened for resistance to races C17, C20, C25, C49, C53 and C57 of Puccinia qraminis tritici; races 1, 5, 9, 15 and bulks 1, 4 and l0 of Puccinia recondita; races T2, T10, T13 and T39 of Ustilago tritici and to 6 isolates of Drechslera tritici-repentis prevalent in western Canada. Of the 34 introductions resistant to P. graminis tritici, 15 were genetically studied using F2 segregation data derived from the progeny of the crosses involving resistant introductions, their corresponding near isogenic lines and stem rust universal suscepts. Eleven of these were found to carry single Sr genes for resistance, notably, Sr30, Sr13 and Sr15. Of the 70 introductions resistant to P. recondita, 28 were studied and 9 were found to carry known Lr genes for resistance, notably Lr10 and the genes present in RL6057 and RL6061. Twenty two introductions are believed to carry either 1 or 2 unidentified dominant, recessive, partially dominant and/or complementary genes for resistance to either stem or leaf rust. Five introductions were immune and 6 highly resistant to the 4 races of U. tritici. Sixty-nine introductions were resistant to D. tritici-repentis . These were arbitrarily classified into 10 'phenotypic classes' according to their reactions to the 6 isolates used.

The reality of cities is that, no matter how designed, controlled, or planned they are, people will do as they like. They will find ways to live and move through them that suit their purposes, even if this means going against a ‘designed’ system. In the case of South Africa during apartheid, this movement was obstructed by institutionalised segregation and State oppression. Apartheid, which means ‘apart’ and ‘hood’ in Afrikaans, was an attempt to inscribe a power structure into the spatial framework of a territory, based on notions of capitalism, race, and hygiene. As a mechanism of social control, it relied heavily on concepts of space and power to achieve the white ideal of racial segregation. Although the spaces of apartheid may be seen as fixed and concrete, internal contradictions contested their authority. While apartheid legislated, controlled, and monitored the movement of all South Africans, the actions of many of its citizens created counter mechanisms which diminished its effect. Despite the official days of apartheid now being over, the question remains: how do people create and maintain public life in the face of an administrative system of control? The spaces created by the everyday actions of those living under apartheid - the stories, music, dance, and protests that were part of the country’s culture of subversion and resistance - were, for years, the site of public life in South Africa.

The objective of this research is to evaluate the influence of the factors identified by the Johnson, Kendall and Robert’s theory that affect the strength of the detachment force necessary to remove a particle of contaminant from a surface, and the roughness of the surface in which the contaminant is present, on predicting the efficiency of removal of loose contamination. Two methods were used to reach this objective: the first method consisted of quantifying the contamination by weight and the second method of quantifying the contamination by counting alpha and gamma particles. As a result, it was determined that for particles of 5 μm, the interaction between contaminant-wipe and contaminant-surface were significant. However, for particles between 37-149 μm, the contaminant-surface interaction was the only significant interaction affecting the amount of contamination removed. The results obtained were already used at a contaminated site, confirming the prediction of contamination removed