Homology blocks of Plasmodium falciparum var genes and clinically distinct forms of severe malaria in a local population

Abstract Background The primary target of the human immune response to the malaria parasite Plasmodium falciparum, P. falciparum erythrocyte membrane protein 1 (PfEMP1), is encoded by the members of the hyper-diverse var gene family. The parasite exhibits antigenic variation via mutually exclusive expression (switching) of the ~60 var genes within its genome. It is thought that different variants exhibit different host endothelial binding preferences that in turn result in different manifestations of disease. Results Var sequences comprise ancient sequence fragments, termed homology blocks (HBs), that recombine at exceedingly high rates. We use HBs to define distinct var types within a local population. We then reanalyze a dataset that contains clinical and var expression data to investigate whether the HBs allow for a description of sequence diversity corresponding to biological function, such that it improves our ability to predict disease phenotype from parasite genetics. We find that even a generic set of HBs, which are defined for a small number of non-local parasites: capture the majority of local sequence diversity; improve our ability to predict disease severity from parasite genetics; and reveal a previously hypothesized yet previously unobserved parasite genetic basis for two forms of severe disease. We find that the expression rates of some HBs correlate more strongly with severe disease phenotypes than the expression rates of classic var DBLα tag types, and principal components of HB expression rate profiles further improve genotype-phenotype models. More specifically, within the large Kenyan dataset that is the focus of this study, we observe that HB expression differs significantly for severe versus mild disease, and for rosetting versus impaired consciousness associated severe disease. The analysis of a second much smaller dataset from Mali suggests that these HB-phenotype associations are consistent across geographically distant populations, since we find evidence suggesting that the same HB-phenotype associations characterize this population as well. Conclusions The distinction between rosetting versus impaired consciousness associated var genes has not been described previously, and it could have important implications for monitoring, intervention and diagnosis. Moreover, our results have the potential to illuminate the molecular mechanisms underlying the complex spectrum of severe disease phenotypes associated with malaria—an important objective given that only about 1% of P. falciparum infections result in severe disease.http://deepblue.lib.umich.edu/bitstream/2027.42/112650/1/12866_2013_Article_2116.pd

Violencia encubierta y celos en estudiantes mujeres de un Centro de Educación Técnico Productivo, Lima Norte – 2022

La investigación se basó en las féminas que estudian en un Centro de Educación Técnico Productivo que está ubicado en Lima Norte. Tuvo como objetivo determinar la relación entre violencia encubierta y celos hacia las mujeres, desarrollado a través de un diseño descriptivo, correlacional, con una muestra de 287 mujeres que contaron con los criterios de exclusión e inclusión. Se consideró una ficha de tamizaje evaluando si ha pasado por la experiencia de violencia y de ser así, si ha sido por celos. Se utilizaron el Inventario Multidimensional de Celos, y la Escala de Violencia Encubierta (EVE). Los resultados permitieron identificar relación directa y significativa entre los celos y la violencia encubierta ejercida (Rho=.128,p<.05) y recibida (Rho=.404,p<.001), de igual forma se hallaron correlaciones entre las dimensiones de los celos con la violencia encubierta ejercida (entre Rho=.125, a .164, p<.05) y recibida (entre Rho=.338 a .440, p<.001),por otro lado, se destaca que tuvo un nivel medio, tanto para celos (78.7%) y la violencia encubierta ejercida (49.5%), mientras que fue alta para la violencia encubierta sufrida (49.5%). Se concluye que ante el aumento de los celos también se incrementa la violencia encubierta ejercida y sufrida

HST STIS Ultraviolet Spectral Evidence for Outflow in Extreme Narrow-line Seyfert 1 Galaxies: I. Data and Analysis

We present HST STIS observations of two extreme NLS1s, IRAS 13224-3809 and 1H 0707-495. The spectra are characterized by very blue continua, broad, strongly blueshifted high-ionization lines (including \ion{C}{4} and \ion{N}{5}), and narrow, symmetric intermediate- (including \ion{C}{3}], \ion{Si}{3}], \ion{Al}{3}) and low-ionization (e.g., \ion{Mg}{2}) lines centered at their rest wavelengths. The emission-line profiles suggest that the high-ionization lines are produced in a wind, and the intermediate- and low-ionization lines are produced in low-velocity gas associated with the accretion disk or base of the wind. In this paper, we present the analysis of the spectra from these two objects; in a companion paper we present photoionization analysis and a toy dynamical model for the wind. The highly asymmetric profile of \ion{C}{4} suggests that it is dominated by emission from the wind, so we develop a template for the wind from the \ion{C}{4} line. We model the bright emission lines in the spectra using a combination of this template, and a narrow, symmetric line centered at the rest wavelength. We also analyzed a comparison sample of HST spectra from 14 additional NLS1s, and construct a correlation matrix of emission line and continuum properties. A number of strong correlations were observed, including several involving the asymmetry of the \ion{C}{4} line.Comment: 26 pages, 10 figures, accepted for publication in ApJ with no change

Aplicación de la gestión de riesgos de la guía del PMBOK® quinta edición, al diagnóstico de los factores de riesgo ocupacional para la empresa Salvaire S.A.S, en la ciudad de Villavicencio.

Aplicar los lineamientos de la Guía del PMBOK® quinta edición, al diagnóstico de los factores de riesgo ocupacional para la empresa SALVAIRE S.A.S en la ciudad de Villavicencio.Este informe final, se llevará a cabo con los lineamientos de la Gestión de Riesgos de la guía del PMBOK® quinta edición, seleccionado por ser el adecuado para la empresa SALVAIRE S.A.S al proveer de una serie de pasos a seguir, que comienzan por: La planificación de riesgos, Identificación de riesgos, análisis cualitativo de los riesgos, análisis cuantitativo de los riesgos, planificación de las respuestas a los riesgos y por ultimo monitorear y controlar los riesgos.This final report will be carried out with the guidelines of the Risk Management of the PMBOK® fifth edition guide, selected for being suitable for the company SALVAIRE SAS by providing a series of steps to follow, starting with: Risk analysis, risk identification, qualitative risk analysis, quantitative risk analysis, risk response planning and ultimately monitoring and controlling risks. One of the reasons for this report is to ensure strict fulfillment with what is contemplated in the Risk Management of the PMBOK® Fifth Edition Guide and in particular through the Risk Breakdown Structure tool (EDR), which allows identifying the Risks of all areas of the company under study and in particular directing the management so that the final results are analyzed and from these strategies are generated for the improvement of the processes within the organization , In order to reduce operating costs, which have increased due to the lack of understanding in the execution in the stages of the processes

DeCAF: Decentralizable Continuous Group Key Agreement with Fast Healing

Continuous group key agreement (CGKA) allows a group of users to maintain a continuously updated shared key in an asynchronous setting where parties only come online sporadically and their messages are relayed by an untrusted server. CGKA captures the basic primitive underlying group messaging schemes. Current solutions including TreeKEM (``Message Layer Security\u27\u27 (MLS) IETF draft) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which is concurrent while having extremely low communication complexity (in groups of size $n$ and for $m$ concurrent updates the communication per user is $\log(n)$, i.e., independent of $m$). The main downside of CoCoA is that in groups of size $n$, users might have to do up to $\log(n)$ update requests to the server to ensure their (potentially corrupted) key material has been refreshed. We present a new ``fast healing\u27\u27 concurrent CGKA protocol, named DeCAF, where users will heal after at most $\log(t)$ requests, with $t$ being the number of corrupted users. Our new protocol is particularly interesting to realize decentralized group messaging, where protocol messages (add/remove/update) are being posted on a blockchain rather than sent to a server. In this setting, concurrency is crucial once requests are more frequent than blocks. Our new protocol significantly outperforms (the only alternative with sub-linear communication and PCS) CoCoA in this setting: it heals much faster ($\log(t)$ vs. $\log(n)$ rounds). The communication per round and user is $m\cdot\log(n)$, but in this setting -- where there is no server who can craft specific messages to users depending on their position in the tree -- CoCoA requires the same communication

Inverse-Sybil Attacks in Automated Contact Tracing

Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices. We propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks

Blinding efficacy and adverse events following repeated transcranial alternating current, direct current, and random noise stimulation.

As transcranial electrical stimulation (tES) protocols advance, assumptions underlying the technique need to be retested to ensure they still hold. Whilst the safety of stimulation has been demonstrated mainly for a small number of sessions, and small sample size, adverse events (AEs) following multiple sessions remain largely untested. Similarly, whilst blinding procedures are typically assumed to be effective, the effect of multiple stimulation sessions on the efficacy of blinding procedures also remains under question. This is especially relevant in multisite projects where small unintentional variations in protocol could lead to inter-site difference. We report AE and blinding data from 1,019 participants who received up to 11 semi-consecutive sessions of active or sham transcranial alternating current stimulation (tACS), direct current stimulation (tDCS), and random noise stimulation (tRNS), at 4 sites in the UK and US. We found that AEs were often best predicted by factors other than tES, such as testing site or session number. Results from the blinding analysis suggested that blinding was less effective for tDCS and tACS than tRNS. The occurrence of AEs did not appear to be linked to tES despite the use of smaller electrodes or repeated delivery. However, blinding efficacy was impacted in tES conditions with higher cutaneous sensation, highlighting a need for alternative stimulation blinding protocols. This may be increasingly necessary in studies wishing to deliver stimulation with higher intensities

CoCoA: Concurrent Continuous Group Key Agreement

Messaging platforms like Signal are widely deployed and provide strong security in an asynchronous setting. It is a challenging problem to construct a protocol with similar security guarantees that can \emph{efficiently} scale to large groups. A major bottleneck are the frequent key rotations users need to perform to achieve post compromise forward security. In current proposals -- most notably in TreeKEM (which is part of the IETF\u27s Messaging Layer Security (MLS) protocol draft) -- for users in a group of size $n$ to rotate their keys, they must each craft a message of size $\log(n)$ to be broadcast to the group using an (untrusted) delivery server. In larger groups, having users sequentially rotate their keys requires too much bandwidth (or takes too long), so variants allowing any $T \leq n$ users to simultaneously rotate their keys in just $2$ communication rounds have been suggested (e.g. Propose and Commit by MLS). Unfortunately, $2$-round concurrent updates are either damaging or expensive (or both); i.e. they either result in future operations being more costly (e.g. via blanking\u27\u27 or tainting\u27\u27) or are costly themselves requiring $\Omega(T)$ communication for each user [Bienstock et al., TCC\u2720]. In this paper we propose CoCoA; a scheme that allows for $T$ concurrent updates that are neither damaging nor costly. That is, they add no cost to future operations yet they only require $\Omega(\log^2(n))$ communication per user. To circumvent the [Bienstock et al.] lower bound, CoCoA increases the number of rounds needed to complete all updates from $2$ up to (at most) $\log(n)$; though typically fewer rounds are needed. The key insight of the protocol is the following: in the (non-concurrent version of) TreeKEM, a delivery server which gets $T$ concurrent update requests will approve one and reject the remaining $T-1$. In contrast, our server attempts to apply all of them. If more than one user requests to rotate the same key during a round, the server arbitrarily picks a winner. Surprisingly, we prove that regardless of how the server chooses the winners, all previously compromised users will recover after at most $\log(n)$ such update rounds. To keep the communication complexity low, CoCoA is a server-aided CGKA. That is, the delivery server no longer blindly forwards packets, but instead actively computes individualized packets tailored to each user. As the server is untrusted, this change requires us to develop new mechanisms ensuring robustness of the protocol