Fail-safe and safe-to-fail adaptation: decision-making for urban flooding under climate change
- Award ID(s):
- 1635490
- PAR ID:
- 10200592
- Date Published:
- Journal Name:
- Climatic Change
- Volume:
- 145
- Issue:
- 3-4
- ISSN:
- 0165-0009
- Page Range / eLocation ID:
- 397 to 412
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
This study presents a comprehensive design methodology for a magnetorheological-based damper device for a three-dimensional building isolation. The device acts as a suspension system itself by combining the liquid stiffness and controllable magnetorheological damping features in one unit. The bi-linear liquid stiffness feature enhances resistance to global rocking/overturning of the structural system by increasing the stiffness in the rebound mode compared to the compression mode. In the field, the system is combined with the conventional elastomeric bearings widely employed to mitigate the lateral seismic motions. During a seismic event, the system is subjected to dynamic vertical shaking and large lateral forces. The theoretical and simulation modeling to overcome this major challenge and achieve other system requirements are presented. In addition, a comprehensive optimization program is developed to achieve all design requirements. The modeling procedure is verified with experimental results. Also, the effectiveness of Displacement/Velocity-based control for a single degree-of-freedom system subjected to sinusoidal loading is evaluated.more » « less
-
It is impossible to deterministically solve wait-free consensus in an asynchronous system. The classic proof uses a valency argument, which constructs an infinite execution by repeatedly extending a finite execution. We introduce extension-based proofs, a class of impossibility proofs that are modelled as an interaction between a prover and a protocol and that include valency arguments. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We show that this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.more » « less
An official website of the United States government

