Property (RD) for Hecke pairs

As the first step towards developing noncommutative geometry over Hecke C*-algebras, we study property (RD) (Rapid Decay) for Hecke pairs. When the subgroup H in a Hecke pair (G,H) is finite, we show that the Hecke pair (G,H) has (RD) if and only if G has (RD). This provides us with a family of examples of Hecke pairs with property (RD). We also adapt Paul Jolissant's works in 1989 to the setting of Hecke C*-algebras and show that when a Hecke pair (G,H) has property (RD), the algebra of rapidly decreasing functions on the set of double cosets is closed under holomorphic functional calculus of the associated (reduced) Hecke C*-algebra. Hence they have the same K_0-groups.Comment: A short note added explaining other methods to prove that the subalgebra of rapidly decreasing functions is smooth. This is the final version as published. The published version is available at: springer.co

Chronic traumatic encephalopathy in contact sports: A systematic review of all reported pathological cases

© 2015 Maroon et al. Chronic traumatic encephalopathy (CTE) is a neurodegenerative disease associated with head trauma. Although initially believed to affect only boxers, the at-risk population has expanded to encompass a much wider demographic, including American football players, hockey players, wrestlers, and military veterans. This expansion has garnered considerable media attention and public concern for the potential neurodegenerative effects of head trauma. The main aim of this systematic review is to give a complete overview of the common findings and risk factors for CTE as well as the status quo regarding the incidence and prevalence of CTE. This systematic review was performed using PubMed and MEDLINE and includes all neuropathologically confirmed cases of CTE in the medical literature to date, from the first published case in 1954 to August 1, 2013 (n = 153). The demographics, including the primary source of mTBI (mild Traumatic Brain Injury), age and cause of death, ApoE genotype, and history of substance abuse, when listed, were obtained from each case report. The demographics of American football players found to have CTE are also presented separately in order to highlight the most prevalent group of CTE cases reported in recent years. These 153 case reports of CTE represent the largest collection to date. We found that a history of mTBI was the only risk factor consistently associated with CTE. In addition, we found no relationships between CTE and age of death or abnormal ApoE allele. Suicide and the presence of premorbid dementia was not strongly associated with CTE. We conclude that the incidence of CTE remains unknown due to the lack of large, longitudinal studies. Furthermore, the neuropathological and clinical findings related to CTE overlap with many common neurodegenerative diseases. Our review reveals significant limitations of the current CTE case reporting and questions the widespread existence of CTE in contact sports

Analytic curves in algebraic varieties over number fields

We establish algebraicity criteria for formal germs of curves in algebraic varieties over number fields and apply them to derive a rationality criterion for formal germs of functions, which extends the classical rationality theorems of Borel-Dwork and P\'olya-Bertrandias valid over the projective line to arbitrary algebraic curves over a number field. The formulation and the proof of these criteria involve some basic notions in Arakelov geometry, combined with complex and rigid analytic geometry (notably, potential theory over complex and $p$-adic curves). We also discuss geometric analogues, pertaining to the algebraic geometry of projective surfaces, of these arithmetic criteria.Comment: 55 pages. To appear in "Algebra, Arithmetic, and Geometry: In Honor of Y.i. Manin", Y. Tschinkel & Yu. Manin editors, Birkh\"auser, 200

Monitoring Partially Synchronous Distributed Systems using SMT Solvers

In this paper, we discuss the feasibility of monitoring partially synchronous distributed systems to detect latent bugs, i.e., errors caused by concurrency and race conditions among concurrent processes. We present a monitoring framework where we model both system constraints and latent bugs as Satisfiability Modulo Theories (SMT) formulas, and we detect the presence of latent bugs using an SMT solver. We demonstrate the feasibility of our framework using both synthetic applications where latent bugs occur at any time with random probability and an application involving exclusive access to a shared resource with a subtle timing bug. We illustrate how the time required for verification is affected by parameters such as communication frequency, latency, and clock skew. Our results show that our framework can be used for real-life applications, and because our framework uses SMT solvers, the range of appropriate applications will increase as these solvers become more efficient over time.Comment: Technical Report corresponding to the paper accepted at Runtime Verification (RV) 201

Factor Varieties and Symbolic Computation

We propose an algebraization of classical and non-classical logics, based on factor varieties and decomposition operators. In particular, we provide a new method for determining whether a propositional formula is a tautology or a contradiction. This method can be autom-atized by defining a term rewriting system that enjoys confluence and strong normalization. This also suggests an original notion of logical gate and circuit, where propositional variables becomes logical gates and logical operations are implemented by substitution. Concerning formulas with quantifiers, we present a simple algorithm based on factor varieties for reducing first-order classical logic to equational logic. We achieve a completeness result for first-order classical logic without requiring any additional structure

Hospital treatment -is it affordable? A structured cost analysis of vaginal deliveries and planned caesarean sections

<p>Abstract</p> <p>Introduction</p> <p>The analysis of cost effectiveness in hospitals is as difficult as treating the patients properly. We are yet not able to answer the simple question of what costs are caused by a certain diagnosis and its treatment during an average hospital stay.</p> <p>Methods</p> <p>To answer some issues of the global problem of cost effectiveness during hospitalisation, we analysed the costs and the cost structure of a normal obstetrical hospital stay during an uncomplicated vaginal delivery and a planned caesarean section. Cost data was collected and summarized from the patients file, the hospital's computer system gathering all cost centres, known material expenses and expenses of non obstetrical medical services.</p> <p>Results</p> <p>For vaginal deliveries/planned caesareans we can calculate with a surplus of about 83 €/1432 €. About 45% of the summarized costs are calculated on a reliable database.</p> <p>Discussion</p> <p>The introduction of the DRG based clearing system in Germany has aggravated the discussion on cost effectiveness. Our meticulous work-up of expenses excluded personal precautionary costs and personnel costs of documentation because no tools are described to depict such costs. If we would add these costs to the known expenses of our study, we strongly suspect that hospital treatment of vaginal deliveries or planned caesarean sections is not cost effective.</p

Stability conditions and positivity of invariants of fibrations

We study three methods that prove the positivity of a natural numerical invariant associated to $1-$parameter families of polarized varieties. All these methods involve different stability conditions. In dimension 2 we prove that there is a natural connection between them, related to a yet another stability condition, the linear stability. Finally we make some speculations and prove new results in higher dimension.Comment: Final version, to appear in the Springer volume dedicated to Klaus Hulek on the occasion of his 60-th birthda

FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE scheme

A symmetric searchable encryption (SSE) scheme allows a client (data owner) to search on encrypted data outsourced to an untrusted cloud server. The search may either be a single keyword search or a complex query search like conjunctive or Boolean keyword search. Information leakage is quite high for dynamic SSE, where data might be updated. It has been proven that to avoid this information leakage an SSE scheme with dynamic data must be forward private. A dynamic SSE scheme is said to be forward private, if adding a keyword-document pair does not reveal any information about the previous search result with that keyword. In SSE setting, the data owner has very low computation and storage power. In this setting, though some schemes achieve forward privacy with honest-but-curious cloud, it becomes difficult to achieve forward privacy when the server is malicious, meaning that it can alter the data. Verifiable dynamic SSE requires the server to give a proof of the result of the search query. The data owner can verify this proof efficiently. In this paper, we have proposed a generic publicly verifiable dynamic SSE (DSSE) scheme that makes any forward private DSSE scheme verifiable without losing forward privacy. The proposed scheme does not require any extra storage at owner-side and requires minimal computational cost as well for the owner. Moreover, we have compared our scheme with the existing results and show that our scheme is practical.Comment: 17 pages, Published in ProvSec 201

Scalable and accurate causality tracking for eventually consistent stores

Lecture Notes in Computer Science 8460, 2014In cloud computing environments, data storage systems often rely on optimistic replication to provide good performance and availability even in the presence of failures or network partitions. In this scenario, it is important to be able to accurately and efficiently identify updates executed concurrently. Current approaches to causality tracking in optimistic replication have problems with concurrent updates: they either (1) do not scale, as they require replicas to maintain information that grows linearly with the number of writes or unique clients; (2) lose information about causality, either by removing entries from client-id based version vectors or using server-id based version vectors, which cause false conflicts. We propose a new logical clock mechanism and a logical clock framework that together support a traditional key-value store API, while capturing causality in an accurate and scalable way, avoiding false conflicts. It maintains concise information per data replica, only linear on the number of replica servers, and allows data replicas to be compared and merged linear with the number of replica servers and versions.(undefined