Seventy-five percent of women offenders confined to prison, jails, or residential treatment programs are custodial parents of minor children at the time of their separation. Little is known, though, about how prosocial networks are used to address the effects of separation from children. Using Bui and Morash's conceptualization of the theory of gendered pathways, the purpose of this phenomenological study was to better understand, from the perspective of incarcerated women, the experience of using prosocial networks to cope with the effects of separation. Data were collected through interviews with 10 mothers from 2 residential treatment programs in Michigan. Interview data were inductively coded, then subjected to a thematic analysis procedure. A key finding of this study was that women experience remorse, embarrassment, helplessness, and a sense of failure with respect to providing adequate care for their children and rely on their mothers or other female family members as the primary prosocial influence. Findings also suggest that Child Protective Services (CPS) is viewed by participants as intrusive and outside the prosocial network, yet significant to family reunification and permanency planning for children. Implications for positive social change include recommendations to criminal justice policymakers and Child Protective Services to consider provisions for supportive services for gender-specific programs that build on the influence of other, prosocial, female family members and promote a clear pathway to permanency planning for families, particularly where minor children are involved.

In spite of a paradigm shift redefining domestic minors trafficked through prostitution as victims instead of criminal offenders, many police officers experience uncertainty in the way they evaluate the nature of domestic minor sex trafficking (DMST) and assess the culpability status of prostituted minors. This problem often results in revictimizing children and hindering their ability to access needed services. The purpose of this multiple case study was to explore police officers' perceptions of minors engaged in prostitution and derive an understanding of the experiences, beliefs, and values that underlie these perceptions. The study also focused on how these factors influence police decision making regarding DMST. Attribution theory provided the framework. Participants included 4 police detectives assigned to a youth sex trafficking unit in a large city in the western region of the United States. Data were derived from individual interviews and significant documents. Coding and category construction were utilized to analyze single cases, and content analysis was used to analyze documents. Through cross-case analysis, data from all cases and sources were examined for common themes and discrepancies. The study's findings indicated all respondents perceived minors involved in prostitution as victims and that police empathy influenced perceptions and police decision making. The results of the study will potentially facilitate positive social change through advancing a deeper awareness of the nature of DMST and informing law enforcement policy and practices.

L’objectif de cette thèse est d’attribuer à chaque sommet x d’un graphe G à n sommets une étiquette L(x) de taille compacte O(log n) bits afin de pouvoir :1. construire, à partir des étiquettes d’un ensemble de sommets en panne X C V (G), une structure de donnée S(X)2. décider, à partir de S(X) et des étiquettes L(u) et L(v), si les sommets u et v sont connectés dans le graphe G n X.Nous proposons une solution à ce problème pour la famille des graphes 3-connexes de genre g (via plusieurs résultats intermédiaires).— Les étiquettes sont de taille O(g log n) bits— Le temps de construction de la structure de donnée S(X) est O(Sort([X]; n)).— Le temps de décision est O(log log n). Ce temps est optimal.Nous étendons ce résultat à la famille des graphes excluant un mineur H fixé. Les étiquettes sont ici de taille O(polylog n) bits. / We aim at assigning each vertex x of a n-vertices graph G a compact O(log n)-bit label L(x) in order to :1. construct, from the labels of the vertices of a forbidden set X C V (G), a datastructure S(X)2. decide, from S(X), L(u) and L(v), whether two vertices u and v are connected in G n X.We give a solution to this problem for the family of 3-connected graphs whith bounded genus.— We obtain O(g log n)-bit labels.— S(X) is computed in O(Sort([X]; n)) time.— Connection between vertices is decided in O(log log n) optimal time.We finally extend this result to H-minor-free graphs. This scheme requires O(polylog n)-bit labels.

La thèse étudie tout d’abord la relation entre les harmoniques à fentes du rotor (RSHs) et la vitesse du rotor instantanée. Pour suivre directement l'RSH, les exigences du système sont pleinement prises en compte.Dans un deuxième temps, les travaux de thèse ont permis de développer un système sans capteur en fonction de boucle à verrouillage de phase (PLL): La largeur de bande centrale est réglée en ligne sur la base des valeurs de référence, des fréquences d'alimentation et de glissement prévues au convertisseur PWM, la PLL est réglée pour suivre le rotor de la machine à RSH sans la nécessité de toute injection de signal à haute fréquence, ni en rotation, ni de pulsation. Ce système d'estimation de vitesse, qui est approprié pour le contrôleur scalaire, avait été intégré avec le lecteur scalaire, conduisant à un simple calcul peu exigeant, à faible coût de l’entraînement de la machine à induction sans capteur à faible coût. Les résultats expérimentaux montrent que le système est en mesure de suivre la vitesse de la machine dans une plage de vitesse très étendue.Enfin, un système sans capteur amélioré basé sur l'analyse de composant mineur (MCA) neurones est décrit. Selon la théorie de Pisarenko, il a été vérifié que le MC qui se trouve dans le sous-espace de bruit est orthogonale au sous-espace de signal, par conséquent, les fré-quences de signal contenues dans l'entrée peuvent être calculées à partir d'un polynôme formé par la MC. Classiquement, ce qui nécessitera la décomposition propre encombrants, néan-moins, la méthode de neurones proposée dans cette thèse peut récupérer le MC de façon ré-cursive avec moins de calculs et des performances améliorées d'erreur (la solution est sur un total de moins sens carré). En outre, l'estimateur de vitesse est appliquée à l'entraînement scalaire avec vérification expérimentale, l'ensemble du système se comporte bien, et la méthode MCA renforcée par réseaux neuronaux a fourni un bon potentiel dans l'application des harmoniques récupérer. / The thesis first studies the relation between the rotor slot harmonics (RSHs) and the instan-taneous rotor speed. To directly track the RSH, the requirements of the system are fully ad-dressed.Second, the thesis presents a sensorless scheme based on phase-locked loop (PLL): The centre bandwidth is tuned on-line on the basis of the reference values of the supply and slip frequencies provided to the PWM converter, the PLL is tuned to track the machine rotor slot-ting harmonic without the need of any high frequency signal injection, neither rotating nor pulsating. This speed estimation scheme, which is suitable for the scalar controller, had been integrated with the scalar drive, leading to a simple, computationally not demanding, low cost sensorless IM drives. The experiment results show that the system is able to track the machine speed in a very wide speed range.Finally, an improved sensorless scheme based on minor component analysis (MCA) neu-rons is described. According to the Pisarenko’s theory, it has been verified that the MC which lies in the noise subspace is orthogonal to the signal subspace, thus, the signal frequencies contained in the input can be computed from a polynomial formed by the MC. Conventional-ly, this will require the bulky eigen-decomposition, nevertheless, the neural method proposed in this thesis can retrieve the MC recursively with less computation and improved error per-formance (the solution is of total least square meaning). Moreover, the speed estimator is ap-plied to the scalar drive with experimental verification, the overall system is well behaved, and the MCA method enhanced by neural networks has provided a good potential in the ap-plication of harmonics retrieve.

Att integrera individer i samhället är en förutsättning för befolkningens välbefinnande. Stadsdelsförvaltningarnas arbetar med att integrera ensamkommande barn och ungdomar i samhället bör därför uppmärksammas. Forskning kring integration av ensamkommande barn är ännu bristfällig, dock har studier visat att ensamkommande barn löper en större risk att drabbas av psykisk ohälsa än övriga samhällsgrupper. Denna studie undersöker hur medarbetarna i Rinkeby – Kista stadsdelsförvaltning upplever sitt arbete kring integration av ensamkommande barn och ungdomar i samhället. En kvalitativ metod tillämpades i studien där forskningsprocessen och innehållsanalysen genomfördes med hjälp av semistrukturerade intervjuer. Det var totalt fem informanter som deltog från Rinkeby- Kista stadsdelsförvaltning. Studiens resultat visa att det var viktigt som medarbetare att ha förförståelse och kunskaper om olika kulturella bakgrunder för att bemöta olika behov som förekommer bland de ensamkommande barnen och ungdomarna. Samverkan mellan stadsdelsförvaltningen och andra aktörer som psykiatrin (BUP), ungdomsmottagning, arbetsförmedlingen, familjehem etc. upplevdes positiva och ansågs bidra till en framgångsrik integration. Medarbetarna upplevde hinder och möjligheter med integrationen. Hinder som framkom var språksvårigheter, familjeåterföreningar och fördomar. Möjligheterna som ansågs stärka integrationen var goda relationer mellan medarbetarna och de ensamkommande barnen och ungdomarna, trygghet, delaktighet, stöd och gemenskap.

Tous les problèmes définissables en \emph{logique monadique du second ordre } peuvent être résolus en temps polynomial dans les classes de graphes qui ont une \emph{largeur de clique} bornée. La largeur de clique est un paramètre de graphe défini de manière algébrique, c'est-à-dire, à partir d'opérations de composition de graphes. La \emph{largeur de rang}, définie de manière combinatoire, est une notion équivalente à la largeur de clique des graphes non orientés. Nous donnons une caractérisation algébrique de la largeur de rang et nous montrons qu'elle est linéairement bornée par la largeur arborescente. Nous proposons également une notion de largeur de rang pour les graphes orientés et une relation de \emph{vertex-minor} pour les graphes orientés. Nous montrons que les graphes orientés qui ont une largeur de rang bornée sont caractérisés par une liste finie de graphes orientés à exclure.<br>Beaucoup de classes de graphes n'ont pas une largeur de rang bornée, par exemple, les graphes planaires. Nous nous intéressons aux systèmes d'étiquetage dans ces classes de graphes. Un système d'étiquetage pour une propriété $P$ dans un graphe $G$, consiste à assigner une étiquette, aussi petite que possible, à chaque sommet de telle sorte que l'on puisse vérifier si $G$ satisfait $P$ en n'utilisant que les étiquettes des sommets. Nous montrons que si $P$ est une propriété définissable en \emph{logique du premier ordre} alors, certaines classes de graphes de \emph{largeur de clique localement bornée} admettent un système d'étiquetage pour $P$ avec des étiquettes de taille logarithmique. Parmi ces classes on peut citer les classes de graphes de degré borné, les graphes planaires et plus généralement les classes de graphes qui excluent un apex comme mineur et, les graphes d'intervalle unitaire.<br>Si $x$ et $y$ sont deux sommets, $X$ un ensemble de sommets et $F$ un ensemble d'arêtes, nous notons $Conn(x,y,X,F)$ la propriété qui vérifie dans un graphe donné si $x$ et $y$ sont connectés par un chemin, qui ne passe par aucun sommet de $X$ ni aucune arête de $F$. Cette propriété n'est pas définissable en logique du premier ordre. Nous montrons qu'elle admet un système d'étiquetage avec des étiquettes de taille logarithmique dans les graphes planaires. Nous montrons enfin que $Conn(x,y,X,\emptyset)$ admet également un système d'étiquetage avec des étiquettes de taille logarithmique dans des classes de graphes qui sont définies comme des \emph{combinaisons} de graphes qui ont une petite largeur de clique et telle que le graphe d'intersection de ces derniers est planaire et est de degré borné.

<p>This paper outlines the current situation of Internet usage and attitudes towards the Internet among ordinary people in Arusha, Tanzania, and examines the views of ordinary citizens on the effects of the arrival of Internet and the possible digital divide.</p><p>Using qualitative interviews with equal groups of ordinary Internet users and ordinary non- Internet users in Arusha, the authors found varying levels of awareness about Internet services and facilities and their availability. There was also a widespread concern about immoral western influences communicated by the Internet and how it may affect the domestic culture. It was clearly shown that Internet usage and the possibility to utilize the information found is dependent on education levels and the economic situation of the users, two closely related factors. To get additional views on the subject interviews were also carried out with representatives for Radio and TV stations as well as newspapers located in Arusha, institutions for higher education in the ICT field, Internet providers, and Arusha Municipal Council. To examine the actual Internet usage we extracted random samples of visited websites in several of the Internet cafés, which most of the Arushans use to access the Internet.</p><p>It was found that government action is necessary that the in order to bridge the digital divide, but as a result of systematic censorship of media government efforts meet a profound distrust among people, neither does the government consider this to be any of their responsibilities.</p>

A generalized software capability has been developed for the pin-wise loading optimization of light water reactor (LWR) fuel lattices with the enhanced flexibility of control variables that characterize heterogeneous or blended target pins loaded with non-standard compositions, such as minor actinides (MAs). Furthermore, this study has developed the software coupling to evaluate the performance of optimized lattices outside their reflective boundary conditions and within the realistic three-dimensional core-wide environment of a LWR. The illustration of the methodologies and software tools developed helps provide a deeper understanding of the behavior of optimized lattices within a full core environment. The practical applications include the evaluation of the recycling (destruction) of “undesirable” minor actinides from spent nuclear fuel such as Am-241 in a thermal reactor environment, as well as the timely study of planting Np-237 (blended NpO2 + UO2) targets in the guide tubes of typical commercial pressurized water reactor (PWR) bundles for the production of Pu-238, a highly “desirable” radioisotope used as a heat source in radioisotope thermoelectric generators (RTGs). Both of these applications creatively stretch the potential utility of existing commercial nuclear reactors into areas historically reserved to research or hypothetical next-generation facilities. In an optimization sense, control variables include the loadings and placements of materials; U-235, burnable absorbers, and MAs (Am-241 or Np-237), while the objective functions are either the destruction (minimization) of Am-241 or the production (maximization) of Pu-238. The constraints include the standard reactivity and thermal operational margins of a commercial nuclear reactor. Aspects of the optimization, lattice-to-core coupling, and tools herein developed were tested in a concurrent study (Galloway, 2010) in which heterogeneous lattices developed by this study were coupled to three-dimensional boiling water reactor (BWR) core simulations and showed incineration rates of Am-241 targets of around 90%. This study focused primarily upon PWR demonstrations, whereby a benchmarked reference equilibrium core was used as a test bed for MA-spiked lattices and was shown to satisfy standard PWR reactivity and thermal operational margins while exhibiting consistently high destruction rates of Am-241 and Np to Pu conversion rates of approximately 30% for the production of Pu-238.

<p>Den här uppsatsen är skriven inom ramen för ämnet <em>Krigsvetenskap</em> under författarens studier på <em>Yrkesofficersprogrammet</em> 2006-2009 till arméteknisk officer. I <em>Ammunitions- och minröjning i modern konflikt</em> ges läsaren genom deskriptiv metod en exposé över ammunitions- och minröjningens grunder, historia och nutid. Uppsatsens generella syften är att avhandla problematik som svenska ammunitions- och minröjare i sitt yrkesutövande idag kan ställas inför. Och hur delar av den tekniska organisationen och teknisk utrustning för detektion, lokalisering och klassificering av minor, Explosive remnants of war (ERW), Improvised explosive device (IED) och försåt kan bidra till att lösa denna problematik. Författaren genomför utifrån sina intervjuer och litteraturstudier prediktioner av den kommande utvecklingen på området. Prediktionerna innefattar bland annat tydligare teknisk stödorganisation och multisensorplattformar för detektion, lokalisering och klassificering av minor, ERW och IED. I texten redovisas viss forskning från Totalförsvarets forskningsinstitut (FOI) och visst arbete vid Försvarets materielverk (FMV), Totalförsvarets ammunitions- och minröjningscentrum (SWEDEC).</p> / <p>This essay is written in the course of <em>War science</em> during the author’s studies to become an Officer in the technical corps, in the Swedish armed forces. Due to the descriptive method in <em>Explosive Ordnance Disposal and demining in modern conflict </em>the reader gets an exposé of the basics, history, and present time features for the Swedish EOD- and Demining personnel. The main purpose with this essay is to discuss the problems that Swedish Explosive ordnance clearance (EOC) personnel might encounter in their current daily service. The opportunities for parts of the supporting technical corps and the technical equipment for detecting, locating and classifying mines, Explosive remnants of war (ERW), Improvised explosive device (IED) and booby-traps to be at hand in the process of solving these problems are also discussed. From interviews and literature studies the author conducts predictions of the development in the subject area. The predictions contains amongst others a more understandable supporting technical corps and multi-sensing-platforms for detecting, locating and classifying mines, ERW, IED and booby-traps. Some of the research that the Swedish defence research agency (FOI), the Swedish Defence Material Administration (FMV) and the Swedish EOD- and Demining Centre (SWEDEC) have produced is presented in the essay.</p>

Studies of ribosomal reading frame maintenance are often based on frameshift mutation suppression experiments. In this thesis, suppression of a frameshift mutation in Salmonella enterica serovar Typhimurium by a tRNA and a ribosomal protein are described. The +1 frameshift mutation hisC3072 (that contains an extra G in a run of Gs) is corrected by mutations in the argU gene coding for the minor tRNAArgmnm5UCU. The altered tRNAArgmnm5UCU has a decreased stability and reduced aminoacylation due to changed secondary and/or tertiary structure. Protein sequencing revealed that during the translation of the GAA-AGA frameshifting site the altered tRNAArgmnm5UCU reads the AGA codon inefficiently. This induces a ribosomal pause, allowing the tRNAGlumnm5s2UUC residing in the ribosomal P-site to slip forward one nucleotide. The same frameshift mutation (hisC3072) was also suppressed by defects in the large ribosomal subunit protein L9. Single base substitutions, truncations, and absence of this protein induced ribosome slippage. Mutated ribosome could shift to the overlapping codon in the +1 frame, or bypass to a codon further downstream in the +1 frame. The signal for stimulation of slippage and function of L9 needs to be investigated. During the search for suppressors of the hisD3749 frameshift mutation, a spontaneous mutant was isolated in the iscU gene that contained greatly decreased levels of the thiolated tRNA modifications ms2io6A and s2C. The iscU gene belongs to the iscR-iscSUA-hscBA-fdx operon coding for proteins involved in the assembly of [Fe-S] clusters. As has been shown earlier, IscS influences the synthesis of all thiolated nucleosides in tRNA by mobilizing sulfur from cysteine. In this thesis, it is demonstrated that IscU, HscA, and Fdx proteins are required for the synthesis of the tRNA modifications ms2io6A and s2C but are dispensable for the synthesis of s4U and (c)mnm5s2U. Based on these results it is proposed that two distinct pathways exist in the formation of thiolated nucleosides in tRNA: one is an [Fe-S] cluster-dependent pathway for the synthesis of ms2io6A and s2C and the other is an [Fe-S] cluster-independent pathway for the synthesis of s4U and (c)mnm5s2U. MiaB is a [Fe-S] protein required for the introduction of sulfur in ms2io6A. TtcA is proposed to be involved in the synthesis of s2C. This protein contains a CXXC conserved motif essential for cytidine thiolation that, together with an additional CXXC motif in the C-terminus may serve as an [Fe-S] cluster ligation site.