No / Findings from surveys of qualified social work practitioners and students indicate a need for social work education and practice to focus attention both on the importance of religious and spiritual beliefs in the lives of many service users and on the potential usefulness of religious and spiritual interventions. In this British study, undertaken in 2003 and 2004, students were less likely than their qualified colleagues to consider religious or spiritually sensitive interventions as appropriate. Attitudes varied little between those students who held religious beliefs and those who did not, but Muslim students and qualified social workers were more likely to view these types of interventions as appropriate. The authors conclude that there is a clear need for all social work practitioners and educators to give greater priority to exploring the potential significance of religious and spiritual beliefs in their training, in their professional practice and in the lives and perspectives of service users and colleagues. Social workers need to be able to respond appropriately to the needs of all service users, including those for whom religious and spiritual beliefs are crucial. `Culturally competent¿ practice depends, amongst other things, on an understanding and appreciation of the impact of faith and belief.

In various business and military settings, there is an expectation of on-demand delivery of supplies and services. Typically, several delivery vehicles (also called servers) carry these supplies. Requests arrive one at a time and when a request arrives, a server is assigned to this request at a cost that is proportional to the distance between the server and the request. Bad assignments will not only lead to larger costs but will also create bottlenecks by increasing delivery time. There is, therefore, a need to design decision-making algorithms that produce cost-effective assignments of servers to requests in real-time. In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to be immediately and irrevocably matched to a free server. The total cost of matching all the requests to servers, also known as the online matching is the sum of the cost of all the edges in the matching. There are many well-studied models for request generation. We study the problem in the adversarial model where an adversary who knows the decisions made by the algorithm generates a request sequence to maximize ratio of the cost of the online matching and the minimum-cost matching (also called the competitive ratio). An algorithm is a-competitive if the cost of online matching is at most 'a' times the minimum cost. A recently discovered robust and deterministic online algorithm (we refer to this as the robust matching or the RM-Algorithm) was shown to have optimal competitive ratios in the adversarial model and a relatively weaker random arrival model. We extend the analysis of the RM-Algorithm in the adversarial model and show that the competitive ratio of the algorithm is sensitive to the input, i.e., for "nice" input metric spaces or "nice" server placements, the performance guarantees of the RM-Algorithm is significantly better. In fact, we show that the performance is almost optimal for any fixed metric space and server locations. / Master of Science / In various business and military settings, there is an expectation of on-demand delivery of supplies and services. Typically, several delivery vehicles (also called servers) carry these supplies. Requests arrive one at a time and when a request arrives, a server is assigned to this request at a cost that is proportional to the distance between the server and the request. Bad assignments will not only lead to larger costs but will also create bottlenecks by increasing delivery time. There is, therefore, a need to design decision-making algorithms that produce cost-effective assignments of servers to requests in real-time. In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to be immediately and irrevocably matched to a free server. The total cost of matching all the requests to servers, also known as the online matching is the sum of the cost of all the edges in the matching. There are many well-studied models for request generation. We study the problem in the adversarial model where an adversary who knows the decisions made by the algorithm generates a request sequence to maximize ratio of the cost of the online matching and the minimum-cost matching (also called the competitive ratio). An algorithm is α-competitive if the cost of online matching is at most α times the minimum cost. A recently discovered robust and deterministic online algorithm (we refer to this as the robust matching or the RM-Algorithm) was shown to have optimal competitive ratios in the adversarial model and a relatively weaker random arrival model. We extend the analysis of the RM-Algorithm in the adversarial model and show that the competitive ratio of the algorithm is sensitive to the input, i.e., for “nice” input metric spaces or “nice” server placements, the performance guarantees of the RM-Algorithm is significantly better. In fact, we show that the performance is almost optimal for any fixed metric space and server locations.

Yes / Employees’ participation in professional international business (IB) communication has important consequences for knowledge transfer and processing, a crucial function for multinational enterprises (MNEs). Research suggests that participation is shaped by language, but prior research has focused on firm-internal language dynamics, meaning that less is known about the influence of external context. We help redress this balance by drawing on the sociolinguistic concept of “language ideologies”. Language ideologies, or shared sets of beliefs about language(s) amongst social groups, are societal-level phenomena that employees bring with them to work. As such, they are part of the external social, political and historical context of IB activities. Our analysis of 82 interviews in three countries indicates that some language ideologies block participation and create friction, while others support participation. Implications for the conceptual understanding of language in IB and the management of internationally active firms are discussed. / - Add New Charity (Rest of World) Funder -

The loop tack test measures the tack (instant grip) of an adhesive. An analytical model of this test seems to be lacking and is the subject of this research. The strip is investigated using several mathematical formulations, and the solutions are obtained numerically. The loop is created from a flexible elastic strip that is bent into a teardrop shape, with its ends clamped together. The strip is tested in a cycle, in which the loop is first pushed onto the surface, compressing the adhesive. Then the loop is pulled up, and gradually debonds from the substrate. The loop is assumed to be nonlinearly elastic and inextensible. The mechanics of the loop tack test are studied in order to determine the impact of various factors on adhesive performance. These factors include the stiffness of the backing, the stiffness and thickness of the adhesive, the elongation of the adhesive before debonding, and the contact time. The relationship between the applied force and the vertical deflection of the loop's ends is determined, as well as that between the applied force and the contact length. Also, the maximum "pull - off" force needed to remove the substrate from the loop is obtained from the results. Shapes of the loop during the cycle are found. This research will increase understanding of the behavior of the adhesive and backing during the loop tack test. With the computer model that has been developed, any set of parameters and conditions can be analyzed, and improvements can be made in the test procedure. / Master of Science

A DS-CDMA system with QPSK modulation and a RAKE receiver is modeled and simulated. A mathematical description of the DS-CDMA system is provided on uplink and downlink. For a multipath channel environment, modeling techniques for AWGN and Rayleigh fading are illustrated. Comparisons are made concerning the performance of CDMA systems with hybrid data rates. The thesis proposes a technique for hybrid channel coding for ARQ (Automatic-Repeat-reQuest) protocol and FEC (Forward Error Correction) scheme that can reduce the error rate significantly. Each of ARQ protocol and FEC scheme gives rise to long latency and significant complexity, respectively, for obtaining the required QoS (Quality of Service). This thesis shows using theoretical analysis and computer simulations that synergistic effects are possible by using both an ARQ protocol and a FEC scheme. / Master of Science

No / Abstract: Internet of Things (IoT) aims to enable the interconnection of a large number of smart devices (things) using a combination of networks and computing technologies. But an influx of interconnected things makes a greater demand on the underlying communication networks and affects the quality of service (QoS). This paper investigates into the QoS of delay sensitive things and the corresponding traffic they generate over the network. Things such as security alarms, cameras, etc, generate delay sensitive information that must be communicated in a real time. Such things have heterogeneous features with limited buffer capacity, storage and processing power. Thus the most commonly used Best Effort service model cannot be an attractive mechanism to treat delay sensitive traffic. This paper proposes a cost-effective analytical model for a finite capacity queueing system with pre-emptive resume service priority and push-out buffer management scheme. Based on the analytical model various simulation results are generated in order to analyse the mean queue length and the blocking probability of high and low priority traffic for system with various capacities.

A segment of transpiring wall is installed near a row of unshaped film holes. The effects on the aerodynamic performance and cooling downstream of the row of cylindrical holes in the presence of transpiration is studied numerically. The changes in behavior of the film due to relative positioning of the injection sources and blowing ratios are predicted to understand the sensitivity of cooling and aerodynamic losses on the relative positioning of the two sources and each blowing ratio. The results indicate that a coupling of the two sources allows a more efficient use of coolant by generating a more uniform initial film resulting in improved component durability through reduction of hot- streaks. With careful optimization the discrete holes can be placed farther apart laterally operating at a lower blowing ratio with a transpiration segment making the large deficits in cooling effectiveness mid-pitch less severe, overall minimizing coolant usage. Addition of transpiration increases the aerodynamic losses associated with injection. This effect can be arguably small compared to corresponding thermal benefits seen by coupling the two. Comparisons of linear superposition predictions of the two independent sources with the corresponding coupled scenario indicate the two films positively influence one another and outperform predictions. The interaction between the two films is dependent upon the relative placement of the transpiration; all relative placements have an overall beneficial effect on the cooling seen by the protected wall. An increase in area-averaged film cooling effectiveness of 300% is seen along with only a 50% increase in loss coefficient by injecting an additional 10% coolant. In this study the downstream placement of transpiration is found to perform best of the three geometries tested while considering cooling, aerodynamic losses, local uniformity and manufacturing feasibility. With further study and optimization this technique can potentially provide more effective thermal protection at a lower cost of aerodynamic losses and spent coolant. A method of measuring the local temperature of a porous wall is also discussed. Measurements are taken with temperature sensitive paint applied in thin coats to the wall. This technique was validated on a 40PPI, 7% relative density aluminum porous coupon. Measurements of discharge coefficients as well as downstream effectiveness data are included to verify the flow through the porous wall was unaltered by applying the paint. A maximum deviation in film-cooling effectiveness of 9% between the two cases with the majority of data falling within 4% was found, very similar to the experimental uncertainty of the rig. This excellent agreement between the repeated tests showed that by applying thermal paint to a wall of such porosity does not significantly affect the flow exiting the wall and hence the measurement technique can readily be applied to transpiration cooling studies at this scale. Methods of filtering the temperature sensitive paint on the porous wall are presented.

No / Sheila Payne and colleagues examine the differences and similarities in end-of-life care provided in different countries which, while broadly based on the same models, varies according to resources, cultural attitudes and public health policies This article introduces palliative care and palliative care nursing. It goes on to consider models of palliative care delivery and provide a more detailed account of the three elements of palliative care nursing–working directly with patients and families, working with other health and social care professionals to network and co-ordinate services, and working at an organisational level to plan, develop and manage service provision in local, regional and national settings. It concludes by detailing the challenges for palliative care nursing and outlines a possible way ahead.

Processos de decisão markovianos sensíveis a risco (Risk Sensitive Markov Decision Process - RS-MDP) permitem modelar atitudes de aversão e propensão ao risco no processo de tomada de decisão usando um fator de risco para representar a atitude ao risco. Para esse modelo, existem operadores que são baseados em funções de transformação linear por partes que incluem fator de risco e fator de desconto. Nesta dissertação são formulados dois algoritmos de Iteração de Valor Sensível a Risco baseados em um desses operadores, esses algoritmos são chamados de Iteração de Valor Sensível a Risco Síncrono (Risk Sensitive Value Iteration - RSVI) e Iteração de Valor Sensível a Risco Assíncrono (Asynchronous Risk Sensitive Value Iteration- A-RSVI). Também são propostas duas heurísticas que podem ser utilizadas para inicializar os valores dos algoritmos de forma a torná-los mais eficentes. Os resultados dos experimentos no domínio de Travessia do Rio em dois cenários de recompensas distintos mostram que: (i) o custo de processamento de políticas extremas a risco, tanto de aversão quanto de propensão, é elevado; (ii) um desconto elevado aumenta o tempo de convergência do algoritmo e reforça a sensibilidade ao risco adotada; (iii) políticas com valores para o fator de risco intermediários possuem custo computacional baixo e já possuem certa sensibilidade ao risco dependendo do fator de desconto utilizado; e (iv) o algoritmo A-RSVI com a heurística baseada no fator de risco pode reduzir o tempo para o algoritmo convergir, especialmente para valores extremos do fator de risco / Risk Sensitive Markov Decision Process (RS-MDP) allows modeling risk-averse and risk-prone attitudes in decision-making process using a risk factor to represent the risk-attitude. For this model, there are operators that are based on a piecewise linear transformation function that includes a risk factor and a discount factor. In this dissertation we formulate two Risk Sensitive Value Iteration algorithms based on one of these operators, these algorithms are called Synchronous Risk Sensitive Value Iteration (RSVI) and Asynchronous Risk Sensitive Value Iteration (A-RSVI). We also propose two heuristics that can be used to initialize the value of the RSVI or A-RSVI algorithms in order to make them more efficient. The results of experiments with the River domain in two distinct rewards scenarios show that: (i) the processing cost in extreme risk policies, for both risk-averse and risk-prone, is high; (ii) a high discount value increases the convergence time and reinforces the chosen risk attitude; (iii) policies with intermediate risk factor values have a low computational cost and show a certain sensitivity to risk based on the discount factor; and (iv) the A-RSVI algorithm with the heuristic based on the risk factor can decrease the convergence time of the algorithm, especially when we need a solution for extreme values of the risk factor

Processos de decisão markovianos sensíveis a risco (Risk Sensitive Markov Decision Process - RS-MDP) permitem modelar atitudes de aversão e propensão ao risco no processo de tomada de decisão usando um fator de risco para representar a atitude ao risco. Para esse modelo, existem operadores que são baseados em funções de transformação linear por partes que incluem fator de risco e fator de desconto. Nesta dissertação são formulados dois algoritmos de Iteração de Valor Sensível a Risco baseados em um desses operadores, esses algoritmos são chamados de Iteração de Valor Sensível a Risco Síncrono (Risk Sensitive Value Iteration - RSVI) e Iteração de Valor Sensível a Risco Assíncrono (Asynchronous Risk Sensitive Value Iteration- A-RSVI). Também são propostas duas heurísticas que podem ser utilizadas para inicializar os valores dos algoritmos de forma a torná-los mais eficentes. Os resultados dos experimentos no domínio de Travessia do Rio em dois cenários de recompensas distintos mostram que: (i) o custo de processamento de políticas extremas a risco, tanto de aversão quanto de propensão, é elevado; (ii) um desconto elevado aumenta o tempo de convergência do algoritmo e reforça a sensibilidade ao risco adotada; (iii) políticas com valores para o fator de risco intermediários possuem custo computacional baixo e já possuem certa sensibilidade ao risco dependendo do fator de desconto utilizado; e (iv) o algoritmo A-RSVI com a heurística baseada no fator de risco pode reduzir o tempo para o algoritmo convergir, especialmente para valores extremos do fator de risco / Risk Sensitive Markov Decision Process (RS-MDP) allows modeling risk-averse and risk-prone attitudes in decision-making process using a risk factor to represent the risk-attitude. For this model, there are operators that are based on a piecewise linear transformation function that includes a risk factor and a discount factor. In this dissertation we formulate two Risk Sensitive Value Iteration algorithms based on one of these operators, these algorithms are called Synchronous Risk Sensitive Value Iteration (RSVI) and Asynchronous Risk Sensitive Value Iteration (A-RSVI). We also propose two heuristics that can be used to initialize the value of the RSVI or A-RSVI algorithms in order to make them more efficient. The results of experiments with the River domain in two distinct rewards scenarios show that: (i) the processing cost in extreme risk policies, for both risk-averse and risk-prone, is high; (ii) a high discount value increases the convergence time and reinforces the chosen risk attitude; (iii) policies with intermediate risk factor values have a low computational cost and show a certain sensitivity to risk based on the discount factor; and (iv) the A-RSVI algorithm with the heuristic based on the risk factor can decrease the convergence time of the algorithm, especially when we need a solution for extreme values of the risk factor