”Ska jag jobba med en ny, gud vad jobbigt. Dom kan ju ingenting” : En undersökning om socialisationsprocesser för nyanställda

Denna studie grundar sig i att rekryteringsbehoven inom vård och omsorg i Sverige ökar enligt SKL (2015). Personalbristen leder till en konkurrens om arbetskraft bland organisationer. En lösning på detta problem är kunskap och förståelse för människors socialisation, med fokus i arbetslivet. För att på detta sätt kunna underlätta organisationens hantering för att behålla personal. Utgångspunkten för studien är att det tycks krävas mer forskning kring vilken betydelse chefers stöd och kollegors relationer har på nyanställdas socialisationsprocess. Syftet med denna studie är således att undersöka hur ett företag inom vård och omsorgssektorn arbetar med socialisationsprocessen av nyanställda med fokus på relationer och chefers stöd. Forskning som berör nyanställdas socialisationsprocesser belyser kollegor som ett verktyg för att få tillgång till viktiga resurser exempelvis tyst kunskap. Chefer behöver vara närvarande och ge feedback. Organisationskulturen påverkar som en del av organisationens personlighet. Studien bygger på en abduktiv ansats och kvalitativa intervjuer, då intresset låg på individens tolkning och upplevelse av deras socialisation till företaget. Elva intervjuer har genomförts, fyra ansvariga chefer och sju nyanställda har deltagit i studien. Resultatet från intervjuerna har analyserat utifrån den teoretiska referensramen. I denna studie har vi kommit fram till att chefernas medvetenhet om vad individen går igenom i sin socialisationsprocess påverkar processen och chefernas stöd till de nyanställda. Kollegor är inte bara ett verktyg för nyanställda till viktiga resurser, utan behöver även ta på sig ett stort ansvar för individens introducerade till den sociala miljön på arbetsplatsen. Dock behöver individen vara öppen och aktiv för att få stöd från kollegorna. För att personalen ska dela organisationskulturen behöver de få vara involverade i förändringar och gemensamma mål. Dessa genomsyrar hela verksamheten, vilket underlättar nyanställdas socialisationsprocess. Vid nyanställdas socialisation har HR funktionen en stor del om processen blir lyckad eller inte.

"Vi som sköter oss" : En kvalitativ intervjustudie om främlingsfientlighet och dess orsaker i relation till medierapportering kring invandring och flyktingfrågor

Under flyktingkrisen 2015 hårdnade debatten kring flyktingmigration och de främlingsfientliga rösterna höjdes. Som ett resultat av den mediala uppmärksamheten kring flyktingkrisen anses nu invandrings- och integrationsfrågan vara den överlägset viktigaste samhällsfrågan i Sverige. Forskning kring främlingsfientlighet har i stor utsträckning genomförts ur majoritetsbefolkningens perspektiv, i denna studie ligger fokus istället på personer med utländsk bakgrund och deras erfarenheter av främlingsfientliga attityder. Genom en kvalitativ metod där åtta semistrukturerade intervjuer har genomförts har denna studie undersökt hur personer med utländsk bakgrund upplever främlingsfientlighet och dess orsaker i relation till medierapportering kring invandring och flyktingfrågor. Resultatet har analyserats med hjälp av Intergroup threat theory, Cultivation theory och stereotypisering och visar att främlingsfientlighet existerar mellan majoritets- och minoritetsgrupper men även inom minoritetsgrupper. De upplevelser som identifieras är huvudsakligen vardagliga händelser och dess orsaker grundar sig på samhälleliga problem, kulturskillnader och stereotyper. Enligt respondenterna framställer media personer med utländsk bakgrund och flyktingar övervägande negativt och påverkar därmed attityder och främlingsfientliga åsikter i det svenska samhället. Ett resultat av detta menar respondenterna är att Sverige har blivit mer främlingsfientligt på grund av den mediala rapporteringen kring flyktingkrisen.

Upgrading arc median shortest path problem for an urban transportation network

In this paper, we propose an algorithm for an upgrading arc median shortest path problem for a transportation network. The problem is to identify a set of nondominated paths that minimizes both upgrading cost and overall travel time of the entire network. These two objectives are realistic for transportation network problems, but of a conflicting and noncompensatory nature. In addition, unlike upgrading cost which is the sum of the arc costs on the path, overall travel time of the entire network cannot be expressed as a sum of arc travel times on the path. The proposed solution approach to the problem is based on heuristic labeling and exhaustive search techniques, in criteria space and solution space, respectively. The first approach labels each node in terms of upgrading cost, and deletes cyclic and infeasible paths in criteria space. The latter calculates the overall travel time of the entire network for each feasible path, deletes dominated paths on the basis of the objective vector and identifies a set of Pareto optimal paths in the solution space. The computational study, using two small-scale transportation networks, has demonstrated that the algorithm proposed herein is able to efficiently identify a set of nondominated median shortest paths, based on two conflicting and noncompensatory objectives.

Dirichlet problem at infinity for p-harmonic functions on negatively curved spaces

The object of this dissertation is to study globally defined bounded p-harmonic functions on Cartan-Hadamard manifolds and Gromov hyperbolic metric measure spaces. Such functions are constructed by solving the so called Dirichlet problem at infinity. This problem is to find a p-harmonic function on the space that extends continuously to the boundary at inifinity and obtains given boundary values there. The dissertation consists of an overview and three published research articles. In the first article the Dirichlet problem at infinity is considered for more general A-harmonic functions on Cartan-Hadamard manifolds. In the special case of two dimensions the Dirichlet problem at infinity is solved by only assuming that the sectional curvature has a certain upper bound. A sharpness result is proved for this upper bound. In the second article the Dirichlet problem at infinity is solved for p-harmonic functions on Cartan-Hadamard manifolds under the assumption that the sectional curvature is bounded outside a compact set from above and from below by functions that depend on the distance to a fixed point. The curvature bounds allow examples of quadratic decay and examples of exponential growth. In the final article a generalization of the Dirichlet problem at infinity for p-harmonic functions is considered on Gromov hyperbolic metric measure spaces. Existence and uniqueness results are proved and Cartan-Hadamard manifolds are considered as an application.

Hanteringen när medarbetares privata problem inverkar negativt på arbetsplatsen : En studie ur ett ledarskapsperspektiv

Uppsatsens syfte var att undersöka hur ledare hanterar situationer där medarbetares privata problem inverkar negativt på arbetet för både arbetsgivare och övriga medarbetare. För att få svar på det har vi inspirerats av vinjettstudie som utgår från diskussioner av fiktiva fall. Vi har genomfört studien med fyra enskilda semistrukturerade intervjuer och en fokusgruppsintervju där vi först introducerade respondenterna med vinjetterna. Deltagarna till undersökningen valdes ut genom ett subjektivt urval där vi riktade in oss på ledare, angående vilken organisation de tillhörde var av mindre vikt. I teoridelen introducerades teorierna ledarskap, medarbetarskap, individen i gruppen, ekonomi, hälsa, lagar, organisationskultur och föreskrifter samt försäkringskassans roll. Resultatet analyserades sedan mot teorierna och vi kan konstatera att respondenterna generellt menade att det var viktigt att prioritera kommunikation och relationer. Betydelsefullt var att relationerna etablerades innan problemen uppstår eftersom det anses vara svårt att skapa relationer i konfliktfyllda lägen. Tiden har betydelse vid hantering av problem av den orsaken att gränsen för vad som är acceptabelt förflyttas med tidens gång. Beroende på problem varierade graden av toleransnivå hos chefer och övriga medarbetare i vår undersökning. Resultatet visade att gränsen för privatlivets påverkan på arbetslivet går när arbetet blir misskött och när kunder och andra medarbetare påverkas. Utifrån ett genusperspektiv ansåg intervjupersonerna att det saknade betydelse om chefen var en man eller kvinna när det handlade om att hantera problem som uppkom, det ansågs vara personligt.

Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.

An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

Risk of severe hypoglycemia in sulfonylurea-treated patients from diabetes centers in Germany/Austria: how big is the problem? which patients are at risk?

BACKGROUND We investigated the rate of severe hypoglycemic events and confounding factors in patients with type-2-diabetes treated with sulfonylurea (SU) at specialized diabetes centers, documented in the German/Austrian DPV-Wiss-database. METHODS Data from 29,485 SU-treated patients were analyzed (median[IQR] age 70.8[62.2-77.8]yrs, diabetes-duration 8.2[4.3-12.8]yrs). The primary objective was to estimate the event-rate of severe hypoglycemia (requiring external help, causing unconsciousness/coma/convulsion and/or emergency.hospitalization). Secondary objectives included exploration of confounding risk-factors through group-comparison and Poisson-regression. RESULTS Severe hypoglycemic events were reported in 826(2.8%) of all patients during their most recent year of SU-treatment. Of these, n = 531(1.8%) had coma, n = 501(1.7%) were hospitalized at least once. The adjusted event-rate of severe hypoglycemia [95%CI] was 3.9[3.7-4.2] events/100 patient-years (coma: 1.9[1.8-2.1]; hospitalization: 1.6[1.5-1.8]). Adjusted event-rates by diabetes-treatment were 6.7 (SU + insulin), 4.9 (SU + insulin + other OAD), 3.1 (SU + other OAD), and 3.8 (SU only). Patients with ≥1 severe event were older (p < 0.001) and had longer diabetes-duration (p = 0.020) than patients without severe events. Participation in educational diabetes-programs and indirect measures of insulin-resistance (increased BMI, plasma-triglycerides) were associated with fewer events (all p < 0.001). Impaired renal function was common (N = 3,113 eGFR ≤30 mL/min) and associated with an increased rate of severe events (≤30 mL/min: 7.7; 30-60 mL/min: 4.8; >60 mL/min: 3.9). CONCLUSIONS These real-life data showed a rate of severe hypoglycemia of 3.9/100 patient-years in SU-treated patients from specialized diabetes centers. Higher risk was associated with known risk-factors including lack of diabetes-education, older age, and decreased eGFR, but also with lower BMI and lower triglyceride-levels, suggesting that SU-treatment in those patients should be considered with caution. This article is protected by copyright. All rights reserved.

The rural land problem, the remedy : a speech delivered by the Right Hon. D. Lloyd George, M.P. at Swindon, on October 18th, 1913.

Mode of access: Internet.

Serious lead poisoning in childhood: Still a problem after a century

Objective: To describe a series of patients with clinically significant lead poisoning. Methodology: A case series of nine patients with lead poisoning who required inpatient management, identified through a Clinical Toxicology Service. Results: Nine children presented with clinically significant lead poisoning. The median serum lead was 2.5 mumol/L (range 1.38-4.83). Eight of the children were exposed to lead-based paint, with seven due to dust from sanded lead paint during house renovations. Serial blood determinations suggested re-exposure in four of the patients, and in one of these patients the re-exposure was from a different source of lead. Eight of the patients required chelation therapy. Conclusions: Serious lead poisoning continues to occur and there appears to be complacency regarding the hazard posed by lead paint in old houses.

Generalized Problem of Sratlikeness for Products of P-Valent Starlike Functions

∗ Partially supported by grant No. 433/94 NSF of the Ministry of Education and Science of the Republic of Bulgaria 1991 Mathematics Subject Classification:30C45

Foraminiferal faunal estimates of paleotemperature: Circumventing the no-analog problem yields cool ice age tropics

The sensitivity of the tropics to climate change, particularly the amplitude of glacial-to-interglacial changes in sea surface temperature (SST), is one of the great controversies in paleoclimatology. Here we reassess faunal estimates of ice age SSTs, focusing on the problem of no-analog planktonic foraminiferal assemblages in the equatorial oceans that confounds both classical transfer function and modern analog methods. A new calibration strategy developed here, which uses past variability of species to define robust faunal assemblages, solves the no-analog problem and reveals ice age cooling of 5° to 6°C in the equatorial current systems of the Atlantic and eastern Pacific Oceans. Classical transfer functions underestimated temperature changes in some areas of the tropical oceans because core-top assemblages misrepresented the ice age faunal assemblages. Our finding is consistent with some geochemical estimates and model predictions of greater ice age cooling in the tropics than was inferred by Climate: Long-Range Investigation, Mapping, and Prediction (CLIMAP) [1981] and thus may help to resolve a long-standing controversy. Our new foraminiferal transfer function suggests that such cooling was limited to the equatorial current systems, however, and supports CLIMAP's inference of stability of the subtropical gyre centers.

Distributed Feature Selection in Large n and Large p Regression Problems

Fitting statistical models is computationally challenging when the sample size or the dimension of the dataset is huge. An attractive approach for down-scaling the problem size is to first partition the dataset into subsets and then fit using distributed algorithms. The dataset can be partitioned either horizontally (in the sample space) or vertically (in the feature space), and the challenge arise in defining an algorithm with low communication, theoretical guarantees and excellent practical performance in general settings. For sample space partitioning, I propose a MEdian Selection Subset AGgregation Estimator ({\em message}) algorithm for solving these issues. The algorithm applies feature selection in parallel for each subset using regularized regression or Bayesian variable selection method, calculates the `median' feature inclusion index, estimates coefficients for the selected features in parallel for each subset, and then averages these estimates. The algorithm is simple, involves very minimal communication, scales efficiently in sample size, and has theoretical guarantees. I provide extensive experiments to show excellent performance in feature selection, estimation, prediction, and computation time relative to usual competitors.

While sample space partitioning is useful in handling datasets with large sample size, feature space partitioning is more effective when the data dimension is high. Existing methods for partitioning features, however, are either vulnerable to high correlations or inefficient in reducing the model dimension. In the thesis, I propose a new embarrassingly parallel framework named {\em DECO} for distributed variable selection and parameter estimation. In {\em DECO}, variables are first partitioned and allocated to m distributed workers. The decorrelated subset data within each worker are then fitted via any algorithm designed for high-dimensional problems. We show that by incorporating the decorrelation step, DECO can achieve consistent variable selection and parameter estimation on each subset with (almost) no assumptions. In addition, the convergence rate is nearly minimax optimal for both sparse and weakly sparse models and does NOT depend on the partition number m. Extensive numerical experiments are provided to illustrate the performance of the new framework.

For datasets with both large sample sizes and high dimensionality, I propose a new "divided-and-conquer" framework {\em DEME} (DECO-message) by leveraging both the {\em DECO} and the {\em message} algorithm. The new framework first partitions the dataset in the sample space into row cubes using {\em message} and then partition the feature space of the cubes using {\em DECO}. This procedure is equivalent to partitioning the original data matrix into multiple small blocks, each with a feasible size that can be stored and fitted in a computer in parallel. The results are then synthezied via the {\em DECO} and {\em message} algorithm in a reverse order to produce the final output. The whole framework is extremely scalable.