Relectio de sacramentis in genere habita in Academia salmanticensi anno 1547

Copia digital. Madrid : Ministerio de Cultura. Subdirección General de Coordinación Bibliotecaria, 2007Existe un estado posterior con diferencias en la port., el resto del primer pliego y en el último pliego cuya fol. sería 54, [1] en bl., [1] h.Marcas tip. en port. y al fin en v. de G\b8\sSign. : A-G\p8\

Relectio de poenitentia habita in Academia Salmaticensi. Anno M. D. XL VIII

Copia digital. Madrid : Ministerio de Cultura. Subdirección General de Coordinación Bibliotecaria, 2007Marca tip. en ambas port.Colofón (v. de f. 17 [i.e. 19])Sign.: A\p4\s, B-D\p6\s, E\p8\s, F-I\p6\s ; A-B\p6\s, C\p8\sRelectio de sacramentis in genere habita in Academia salmanticensi anno 1547, segunda secuencia de pag., con port. y sign. propiasTexto a dos col.Error de fol. en la última h. de la segunda secuenci

Relación histórica de la batalla de las Platerías

Copia Digital : Real Academia de Jurisprudencia y Legislación, 2011Tít. y autor tomados del inicio del textoPie de imp. tomado de colofó

Ring-LWE:applications to cryptography and their efficient realization

© Springer International Publishing AG 2016. The persistent progress of quantum computing with algorithms of Shor and Proos and Zalka has put our present RSA and ECC based public key cryptosystems at peril. There is a flurry of activity in cryptographic research community to replace classical cryptography schemes with their post-quantum counterparts. The learning with errors problem introduced by Oded Regev offers a way to design secure cryptography schemes in the post-quantum world. Later for efficiency LWE was adapted for ring polynomials known as Ring-LWE. In this paper we discuss some of these ring-LWE based schemes that have been designed. We have also drawn comparisons of different implementations of those schemes to illustrate their evolution from theoretical proposals to practically feasible schemes

MAL2 and tumor protein D52 (TPD52) are frequently overexpressed in ovarian carcinoma, but differentially associated with histological subtype and patient outcome

Background: The four-transmembrane MAL2 protein is frequently overexpressed in breast carcinoma, and MAL2 overexpression is associated with gain of the corresponding locus at chromosome 8q24.12. Independent expression microarray studies predict MAL2 overexpression in ovarian carcinoma, but these had remained unconfirmed. MAL2 binds tumor protein D52 (TPD52), which is frequently overexpressed in ovarian carcinoma, but the clinical significance of MAL2 and TPD52 overexpression was unknown. Methods: Immunohistochemical analyses of MAL2 and TPD52 expression were performed using tissue microarray sections including benign, borderline and malignant epithelial ovarian tumours. Inmmunohistochemical staining intensity and distribution was assessed both visually and digitally. Results: MAL2 and TPD52 were significantly overexpressed in high-grade serous carcinomas compared with serous borderline tumours. MAL2 expression was highest in serous carcinomas relative to other histological subtypes, whereas TPD52 expression was highest in clear cell carcinomas. MAL2 expression was not related to patient survival, however high-level TPD52 staining was significantly associated with improved overall survival in patients with stage III serous ovarian carcinoma (log-rank test, p < 0.001; n = 124) and was an independent predictor of survival in the overall carcinoma cohort (hazard ratio (HR), 0.498; 95% confidence interval (CI), 0.34-0.728; p < 0.001; n = 221), and in serous carcinomas (HR, 0.440; 95% CI, 0.294-0.658; p < 0.001; n = 182). Conclusions: MAL2 is frequently overexpressed in ovarian carcinoma, and TPD52 overexpression is a favourable independent prognostic marker of potential value in the management of ovarian carcinoma patients.11 page(s

Isochronous Gaussian Sampling: From Inception to Implementation

Gaussian sampling over the integers is a crucial tool in lattice-based cryptography, but has proven over the recent years to be surprisingly challenging to perform in a generic, efficient and provable secure manner. In this work, we present a modular framework for generating discrete Gaussians with arbitrary center and standard deviation. Our framework is extremely simple, and it is precisely this simplicity that allowed us to make it easy to implement, provably secure, portable, efficient, and provably resistant against timing attacks. Our sampler is a good candidate for any trapdoor sampling and it is actually the one that has been recently implemented in the Falcon signature scheme. Our second contribution aims at systematizing the detection of implementation errors in Gaussian samplers. We provide a statistical testing suite for discrete Gaussians called SAGA (Statistically Acceptable GAussian). In a nutshell, our two contributions take a step towards trustable and robust Gaussian sampling real-world implementations

New Code-Based Privacy-Preserving Cryptographic Constructions

Code-based cryptography has a long history but did suffer from periods of slow development. The field has recently attracted a lot of attention as one of the major branches of post-quantum cryptography. However, its subfield of privacy-preserving cryptographic constructions is still rather underdeveloped, e.g., important building blocks such as zero-knowledge range proofs and set membership proofs, and even proofs of knowledge of a hash preimage, have not been known under code-based assumptions. Moreover, almost no substantial technical development has been introduced in the last several years. This work introduces several new code-based privacy-preserving cryptographic constructions that considerably advance the state-of-the-art in code-based cryptography. Specifically, we present $3$ major contributions, each of which potentially yields various other applications. Our first contribution is a code-based statistically hiding and computationally binding commitment scheme with companion zero-knowledge (ZK) argument of knowledge of a valid opening that can be easily extended to prove that the committed bits satisfy other relations. Our second contribution is the first code-based zero-knowledge range argument for committed values, with communication cost logarithmic in the size of the range. A special feature of our range argument is that, while previous works on range proofs/arguments (in all branches of cryptography) only address ranges of non-negative integers, our protocol can handle signed fractional numbers, and hence, can potentially find a larger scope of applications. Our third contribution is the first code-based Merkle-tree accumulator supported by ZK argument of membership, which has been known to enable various interesting applications. In particular, it allows us to obtain the first code-based ring signatures and group signatures with logarithmic signature sizes

Heat Shock Proteins and Amateur Chaperones in Amyloid-Beta Accumulation and Clearance in Alzheimer’s Disease

The pathologic lesions of Alzheimer’s disease (AD) are characterized by accumulation of protein aggregates consisting of intracellular or extracellular misfolded proteins. The amyloid-β (Aβ) protein accumulates extracellularly in senile plaques and cerebral amyloid angiopathy, whereas the hyperphosphorylated tau protein accumulates intracellularly as neurofibrillary tangles. “Professional chaperones”, such as the heat shock protein family, have a function in the prevention of protein misfolding and subsequent aggregation. “Amateur” chaperones, such as apolipoproteins and heparan sulfate proteoglycans, bind amyloidogenic proteins and may affect their aggregation process. Professional and amateur chaperones not only colocalize with the pathological lesions of AD, but may also be involved in conformational changes of Aβ, and in the clearance of Aβ from the brain via phagocytosis or active transport across the blood–brain barrier. Thus, both professional and amateur chaperones may be involved in the aggregation, accumulation, persistence, and clearance of Aβ and tau and in other Aβ-associated reactions such as inflammation associated with AD lesions, and may, therefore, serve as potential targets for therapeutic intervention

Fluid challenges in intensive care: the FENICE study A global inception cohort study

Fluid challenges (FCs) are one of the most commonly used therapies in critically ill patients and represent the cornerstone of hemodynamic management in intensive care units. There are clear benefits and harms from fluid therapy. Limited data on the indication, type, amount and rate of an FC in critically ill patients exist in the literature. The primary aim was to evaluate how physicians conduct FCs in terms of type, volume, and rate of given fluid; the secondary aim was to evaluate variables used to trigger an FC and to compare the proportion of patients receiving further fluid administration based on the response to the FC.This was an observational study conducted in ICUs around the world. Each participating unit entered a maximum of 20 patients with one FC.2213 patients were enrolled and analyzed in the study. The median [interquartile range] amount of fluid given during an FC was 500 ml (500-1000). The median time was 24 min (40-60 min), and the median rate of FC was 1000 [500-1333] ml/h. The main indication for FC was hypotension in 1211 (59 %, CI 57-61 %). In 43 % (CI 41-45 %) of the cases no hemodynamic variable was used. Static markers of preload were used in 785 of 2213 cases (36 %, CI 34-37 %). Dynamic indices of preload responsiveness were used in 483 of 2213 cases (22 %, CI 20-24 %). No safety variable for the FC was used in 72 % (CI 70-74 %) of the cases. There was no statistically significant difference in the proportion of patients who received further fluids after the FC between those with a positive, with an uncertain or with a negatively judged response.The current practice and evaluation of FC in critically ill patients are highly variable. Prediction of fluid responsiveness is not used routinely, safety limits are rarely used, and information from previous failed FCs is not always taken into account