In search of protection : sexual minority women in Canadian refugee determination

Le Canada accepte des demandes d’asile sur la base de l'orientation sexuelle depuis plus de 20 ans. Quoi qu’il en soit, cette recherche permet de douter du fait que les demandes sur la base de l’orientation sexuelle déposées par des femmes soient traitées de façon adéquate. Pour garantir l’accès à la protection des femmes appartenant à des minorités sexuelles, une analyse du risque de persécution fondé sur l'orientation sexuelle doit incorporer des considérations de genre ainsi que divers autres facteurs d’ordre social et culturel. À partir d’une étude de cas de demandes du statut de refugié déposées par des femmes sur la base de l’orientation sexuelle et rejetées par la Commission de l'immigration et du statut de réfugié entre 2010 et 2013, cette recherche identifie des procédés décisionnels problématiques qui font obstacle au droit d’asile de ces femmes. Les résultats de cette étude révèlent qu’une analyse intersectionnelle, laquelle prend acte des formes variées et multiples de l’oppression dans un contexte social donné, est d’importance cruciale pour une évaluation éclairée et non tronquée des risques de persécution pour les minorités sexuelles féminines. À la lumière de ces résultats, ce mémoire propose qu’une analyse intersectionnelle accompagne une nécessaire formation pour les membres de la Commission de l'immigration et du statut de réfugié du Canada sur des questions particulières à des minorités sexuelles.

Retrial Queues with Orbital Search

Queueing system in which arriving customers who find all servers and waiting positions (if any) occupied many retry for service after a period of time are retrial queues or queues with repeated attempts. This study deals with two objectives one is to introduce orbital search in retrial queueing models which allows to minimize the idle time of the server. If the holding costs and cost of using the search of customers will be introduced, the results we obtained can be used for the optimal tuning of the parameters of the search mechanism. The second one is to provide insight of the link between the corresponding retrial queue and the classical queue. At the end we observe that when the search probability Pj = 1 for all j, the model reduces to the classical queue and when Pj = 0 for all j, the model becomes the retrial queue. It discusses the performance evaluation of single-server retrial queue. It was determined by using Poisson process. Then it discuss the structure of the busy period and its analysis interms of Laplace transforms and also provides a direct method of evaluation for the first and second moments of the busy period. Then it discusses the M/ PH/1 retrial queue with disaster to the unit in service and orbital search, and a multi-server retrial queueing model (MAP/M/c) with search of customers from the orbit. MAP is convenient tool to model both renewal and non-renewal arrivals. Finally the present model deals with back and forth movement between classical queue and retrial queue. In this model when orbit size increases, retrial rate also correspondingly increases thereby reducing the idle time of the server between services

Thermal lens spectrum of organic dyes using optical parametric oscillator

The wavelength dependence of thermal lens signal from organic dyes are studied using dual beam thermal lens technique. It is found that the profile of thermal lens spectrum widely differ from the conventional absorption spectrum in the case of rhodamine B unlike in the case of crystal violet. This is explained on the basis of varying contribution of nonradiative relaxations from the excited vibronic levels.

Thermal lens spectrum of organic dyes using optical parametric oscillator

The wavelength dependence of thermal lens signal from organic dyes are studied using dual beam thermal lens technique. It is found that the profile of thermal lens spectrum widely differ from the conventional absorption spectrum in the case of rhodamine B unlike in the case of crystal violet. This is explained on the basis of varying contribution of nonradiative relaxations from the excited vibronic levels.

Dynamics of the logistic map under discrete parametric perturbation

By introducing a periodic perturbation in the control parameter of the logistic map we have investigated the period locking properties of the map. The map then gets locked onto the periodicity of the perturbation for a wide range of values of the parameter and hence can lead to a control of the chaotic regime. This parametrically perturbed map exhibits many other interesting features like the presence of bubble structures, repeated reappearance of periodic cycles beyond the chaotic regime, dependence of the escape parameter on the seed value and also on the initial phase of the perturbation etc.

Fabrication And Parametric Measurements Of N2 Laser Pumped Dye Laser And Its Application To Energy Transfer Studies In Mixed Dyes

Eventhough a large number of schemes have been proposed and develoned for N9 laser ouined dye lasers the relatively low efficiency compelled the scientists to device new methods to improve the system efficiencs. Energy transfer mechanism has been shown to he a convenien tool for the enhancement of efficiency of dye lasers. Th p resent work covers a detailed study of the performance characteristics of a N2 laser pumped dye laser in the con— ventional mode and also, when pumped by the energy transfer mechanism. For .th.e present investigations a dye laser pumped by a'N2 laser (A4200 kw peak power) was fabricated. The grating at grazing incidence was used as the beam expanding device; A t its best performance the system was giving an output peak power of l5 kW for a 5 X lC"3H/l Rh—€ solution in methanol. T he conversion efficiency was 7.5; The output beam was having 3 divergence of 2 mrad and bandwidth o.9 A. Suitable modifications were suggested for obtaining better conversion efficiency and bandwidth.

Development and parametric studies of pulsed nitrogen and d-switched nd:glass lasers and some of their applications

Laser engineering is an area in which developments in the existing design concepts and technology appear at an alarming rate. Now—a-days, emphasis has shifted from innovation to cost reduction and system improvement. To a major extent, these studies are aimed at attaining larger power densities, higher system efficiency and identification of new lasing media and new lasing wavelengths. Todate researchers have put to use all the ditferent Forms of matter as lasing material. Laser action was observed For the first time in a gaseous system - the He-Ne system. This was Followed by a variety of solidstate and gas laser systems. Uarious organic dyes dissolved in suitable solvents were found to lase when pumped optically. Broad band emission characteristics of these dye molecules made wavelength tuning possible using optical devices. Laser action was also observed in certain p-n junctions of semiconductor materials and some of these systems are also tunable. The recent addition to this list was the observation of laser action from certain laser produced plasmas. The purpose of this investigation was to examine the design and Fabrication techniques of pulsed Nitrogen lasers and high power Nd: Glass laserso Attempt was also made to put the systems developed into certain related experiments

Multi-objective assembly job shop scheduling using genetic algorithm and tabu search

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.

Reinforcement Learning by Policy Search

One objective of artificial intelligence is to model the behavior of an intelligent agent interacting with its environment. The environment's transformations can be modeled as a Markov chain, whose state is partially observable to the agent and affected by its actions; such processes are known as partially observable Markov decision processes (POMDPs). While the environment's dynamics are assumed to obey certain rules, the agent does not know them and must learn. In this dissertation we focus on the agent's adaptation as captured by the reinforcement learning framework. This means learning a policy---a mapping of observations into actions---based on feedback from the environment. The learning can be viewed as browsing a set of policies while evaluating them by trial through interaction with the environment. The set of policies is constrained by the architecture of the agent's controller. POMDPs require a controller to have a memory. We investigate controllers with memory, including controllers with external memory, finite state controllers and distributed controllers for multi-agent systems. For these various controllers we work out the details of the algorithms which learn by ascending the gradient of expected cumulative reinforcement. Building on statistical learning theory and experiment design theory, a policy evaluation algorithm is developed for the case of experience re-use. We address the question of sufficient experience for uniform convergence of policy evaluation and obtain sample complexity bounds for various estimators. Finally, we demonstrate the performance of the proposed algorithms on several domains, the most complex of which is simulated adaptive packet routing in a telecommunication network.