A Director Looks At Information Management

Some few years ago, when I was in high school, I had a rather frustrating experience. We had just finished reading Hamlet and were given a test on the play

Shear bearing capacity of RC slabs without shear reinforcement: Design codes comparison

For reinforced concrete structures, as beams, slabs or walls, failure under bending is well known and its description and design is relatively internationally agreed. However for the shear failure phenomenon, there is not yet a common agreement at the international level, no consensus is reached on the subject at this time. Many parameters are involved in the shear resistance mechanism and many phenomena coexist. The shear force transfer mechanisms are sometimes complex and difficult to discern. By analyzing the different shear design codes, some shear parameters are taken into account and ignored by others, which makes that a shear effect may be omitted. In addition, different ways are adopted to take into account the different shear parameters. The main purpose of this study is to help the engineering by presenting a comparative study of all the main analytical models for the determination of shear capacity: The EN 1992–1–1:2005 standard (EC2) (CEN, 2005), French National Annex (FD P 18–717, 2013), ACI 318–14 (ACI Committee 318, 2014), fib Model Code 2010 (Fib Model Code 2010, 2012) using level of approximation LoA I and LoA II and (CSA Committee A23.3, 2004) both Modified Compression Field Theory (MCFT) based models, and finally the Critical Shear Crack Theory (CSCT) which is the basis of the Swiss standard SIA 262 (SIA 262, 2003) are all examined. The results obtained are discussed regarding their agreement with eighteen shear experimental results on thick slabs (30 cm, 35 cm, and 40 cm) and thin slabs (10 cm) without shear reinforcement

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

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

On Charge-3 Cyclic Monopoles

We determine the spectral curve of charge 3 BPS su(2) monopoles with C_3 cyclic symmetry. The symmetry means that the genus 4 spectral curve covers a (Toda) spectral curve of genus 2. A well adapted homology basis is presented enabling the theta functions and monopole data of the genus 4 curve to be given in terms of genus 2 data. The Richelot correspondence, a generalization of the arithmetic mean, is used to solve for this genus 2 curve. Results of other approaches are compared.Comment: 34 pages, 16 figures. Revision: Abstract added and a few small change

Geodesic equations and algebro-geometric methods

For an investigation of the physical properties of gravitational fields the observation of massive test particles and light is very useful. The characteristic features of a given space-time may be decoded by studying the complete set of all possible geodesic motions. Such a thorough analysis can be accomplished most effectively by using analytical methods to solve the geodesic equation. In this contribution, the use of elliptic functions and their generalizations for solving the geodesic equation in a wide range of well known space-times, which are part of the general Pleba\'nski-Demia\'nski family of solutions, will be presented. In addition, the definition and calculation of observable effects like the perihelion shift will be presented and further applications of the presented methods will be outlined.Comment: 8 pages, no figures; based on presentation at the conference "Relativity and Gravitation: 100 Years after Einstein in Prague," Prague, 2012. Relativity and Gravitation, volume 157 of Springer Proceedings in Physics, p 91. Springer International Publishing, 201

Emergency Care Handover (ECHO study) across care boundaries : the need for joint decision making and consideration of psychosocial history

Background: Inadequate handover in emergency care is a threat to patient safety. Handover across care boundaries poses particular problems due to different professional, organisational and cultural backgrounds. While there have been many suggestions for standardisation of handover content, relatively little is known about the verbal behaviours that shape handover conversations. This paper explores both what is communicated (content) and how this is communicated (verbal behaviours) during different types of handover conversations across care boundaries in emergency care. Methods: Three types of interorganisational (ambulance service to emergency department (ED) in ‘resuscitation’ and ‘majors’ areas) and interdepartmental handover conversations (referrals to acute medicine) were audio recorded in three National Health Service EDs. Handover conversations were segmented into utterances. Frequency counts for content and language forms were derived for each type of handover using Discourse Analysis. Verbal behaviours were identified using Conversation Analysis. Results: 203 handover conversations were analysed. Handover conversations involving ambulance services were predominantly descriptive (60%–65% of utterances), unidirectional and focused on patient presentation (75%–80%). Referrals entailed more collaborative talk focused on the decision to admit and immediate care needs. Across all types of handover, only 1.5%–5% of handover conversation content related to the patient's social and psychological needs. Conclusions: Handover may entail both descriptive talk aimed at information transfer and collaborative talk aimed at joint decision-making. Standardisation of handover needs to accommodate collaborative aspects and should incorporate communication of information relevant to the patient's social and psychological needs to establish appropriate care arrangements at the earliest opportunity

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