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

Probably Safe or Live

This paper presents a formal characterisation of safety and liveness properties \`a la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is established that any (probabilistic tree) property is equivalent to a conjunction of a safety and liveness property. A simple algorithm is provided to obtain such property decomposition for flat probabilistic CTL (PCTL). A safe fragment of PCTL is identified that provides a sound and complete characterisation of safety properties. For liveness properties, we provide two PCTL fragments, a sound and a complete one. We show that safety properties only have finite counterexamples, whereas liveness properties have none. We compare our characterisation for qualitative properties with the one for branching time properties by Manolios and Trefler, and present sound and complete PCTL fragments for characterising the notions of strong safety and absolute liveness coined by Sistla

Optimization Of Detergent-Mediated Reconstitution Of Influenza A M2 Protein Into Proteoliposomes

We report the optimization of detergent-mediated reconstitution of an integral membrane-bound protein, full-length influenza M2 protein, by direct insertion into detergent-saturated liposomes. Detergent-mediated reconstitution is an important method for preparing proteoliposomes for studying membrane proteins, and must be optimized for each combination of protein and membrane constituents used. The purpose of the reconstitution was to prepare samples for site-directed spin-labeling electron paramagnetic resonance (SDSL-EPR) studies. Our goals in optimizing the protocol were to minimize the amount of detergent used, reduce overall proteoliposome preparation time, and confirm the removal of all detergent. The liposomes were comprised of (1-palmitoyl-2-oleyl-sn-glycero-phosphocholine (POPC) and 1-palmitoyl-2-oleyl-sn-glycero-3-[phospho-rac-(1-glycerol)] (POPG), and the detergent octylglucoside (OG) was used for reconstitution. Rigorous physical characterization was applied to optimize each step of the reconstitution process. We used dynamic light scattering (DLS) to determine the amount of OG needed to saturate the preformed liposomes. During detergent removal by absorption with Bio-Beads, we quantified the detergent concentration by means of a colorimetric assay, thereby determining the number of Bio-Bead additions needed to remove all detergent from the final proteoliposomes. We found that the overnight Bio-Bead incubation used in previously published protocols can be omitted, reducing the time needed for reconstitution. We also monitored the size distribution of the proteoliposomes with DLS, confirming that the size distribution remains essentially constant throughout the reconstitution process

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

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms

In this paper, we investigate the approximate consensus problem in highly dynamic networks in which topology may change continually and unpredictably. We prove that in both synchronous and partially synchronous systems, approximate consensus is solvable if and only if the communication graph in each round has a rooted spanning tree, i.e., there is a coordinator at each time. The striking point in this result is that the coordinator is not required to be unique and can change arbitrarily from round to round. Interestingly, the class of averaging algorithms, which are memoryless and require no process identifiers, entirely captures the solvability issue of approximate consensus in that the problem is solvable if and only if it can be solved using any averaging algorithm. Concerning the time complexity of averaging algorithms, we show that approximate consensus can be achieved with precision of $\varepsilon$ in a coordinated network model in $O(n^{n+1} \log\frac{1}{\varepsilon})$ synchronous rounds, and in $O(\Delta n^{n\Delta+1} \log\frac{1}{\varepsilon})$ rounds when the maximum round delay for a message to be delivered is $\Delta$. While in general, an upper bound on the time complexity of averaging algorithms has to be exponential, we investigate various network models in which this exponential bound in the number of nodes reduces to a polynomial bound. We apply our results to networked systems with a fixed topology and classical benign fault models, and deduce both known and new results for approximate consensus in these systems. In particular, we show that for solving approximate consensus, a complete network can tolerate up to 2n-3 arbitrarily located link faults at every round, in contrast with the impossibility result established by Santoro and Widmayer (STACS '89) showing that exact consensus is not solvable with n-1 link faults per round originating from the same node

Iterative Approximate Consensus in the presence of Byzantine Link Failures

This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free. Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain only a small amount of memory across iterations [22, 21, 23, 12]. However, to the best of our knowledge, we are the first to consider approximate consensus in the presence of Byzan- tine links. We extend our past work that provided exact characterization of graphs in which the iterative approximate consensus problem in the presence of Byzantine node failures is solvable [22, 21]. In particular, we prove a tight necessary and sufficient condition on the underlying com- munication graph for the existence of iterative approximate consensus algorithms under transient Byzantine link model. The condition answers (part of) the open problem stated in [16].Comment: arXiv admin note: text overlap with arXiv:1202.609