Accounting for material scatter in sheet metal forming simulations

Robust design of forming processes is gaining attention throughout the industry. To analyze the robustness of a sheet metal forming process using Finite Element (FE) simulations, an accurate input in terms of parameter variation is required. This paper presents a pragmatic, accurate and economic approach for measuring and modeling one of the main inputs, i.e. material properties and its associated scattering. For the purpose of this research, samples of 41 coils of a forming steel DX54D+Z (EN 10327:2004) from multiple batches have been collected. Fully determining the stochastic material behavior to the required accuracy for precise modeling in FE simulations would involve performing many mechanical experiments. Instead, the present work combines mechanical testing and texture analysis to limit the required effort. Moreover, use is made of the correlations between the material parameters to efficiently model the material property scatter for use in the numerical robustness analysis. The proposed approach is validated by the forming of a series of cup products using the collected material. The observed experimental scatter can be reproduced efficiently using FE simulations, demonstrating the potential of the modeling approach and robustness analysis in general

A Novel Grip Design for High-Accuracy Thermo-Mechanical Tensile Testing of Boron Steel under Hot Stamping Conditions

Achieving uniform temperature within the effective gauge length in thermo-mechanical testing is crucial for obtaining accurate material data under hot stamping conditions. A new grip design for the Gleeble Materials-Simulator has been developed to reduce the long-standing problem of temperature gradient along a test-piece during thermo-mechanical tensile testing. The grip design process comprised two parts. For the first part, the new design concept was analysed with the help of Abaqus coupled Thermal-Electric Finite element simulation through the user defined feedback control subroutine. The second part was Gleeble thermo-mechanical experiments using a dog-bone test-piece with both new and conventional grips. The temperature and strain distributions of the new design were compared with those obtained using the conventional system within the effective gauge length of 40 mm. Temperature difference from centre to edge of effective gauge length (temperature gradient) was reduced by 56% during soaking and reduced by 100% at 700 °C. Consequently, the strain gradient also reduced by 95%, and thus facilitated homogeneous deformation. Finally to correlate the design parameters of the electrical conductor used in the new grip design with the geometry and material of test-piece, an analytical relationship has been derived between the test-piece and electrical conductor

Brief announcement: Malicious security comes for free in consensus with leaders

We consider consensus protocols in the model that is most commonly considered for use in state machine replication, as initiated by Dwork-Lynch-Stockmeyer, then by Castro-Liskov in 1999 with "PBFT."Such protocols guarantee, assuming n players out of which t < n/3 are maliciously corrupted, that the honest players output the same valid value within a finite number of messages, after the (unknown) point in time where both: the network becomes synchronous, and a designated player (the leader) is honest. The state of the art (Hotstuff, PODC'19), achieves linear communication complexity, but at the cost of additional latency, due to one more round-trip with the leader. Furthermore, it relies on constant-size threshold signatures schemes (TSS), for which all prior-known constructions require a costly interactive (or trusted) setup. We remove all of these limitations. The communication bottleneck of PBFT lies in the subprotocol, denoted as "view change,"in which the leader forwards 2t+1 signed messages to each player. Then, each player checks that these 2t+1 messages satisfy some predicate, which we denote "non-supermajority''. We replace this with a responsive subprotocol, with linear communication complexity, that enables players to check this predicate. Its construction is elementary, since it requires only black box use of any TSS. In the full version of our paper \citemalicious2 we achieve three things. Firstly, we further optimize this subprotocol from succinct arguments of many signed messages, which we instantiate from Attema-Cramer-Rambaud \cite[2021-3-9 version]ACR20. As an introduction to these methods, we discuss here the simplest case, which is the construction in \citeACR20 of the first logarithmic-sized TSS with transparent setup. Second, we also address another complexity challenge pointed in Hotstuff, namely, that protocols with fast termination in favorable runs, have so far quadratic complexity, due to an even more complex view change. Third, we enable halting in finite time with (amortized) linear complexity, which was an unsolved question so far when external validity is required

Communicating Maritime Spatial Planning: The MSP Challenge approach

The MSP Challenge uses game technology and role-play to support communication and learning for Marine/Maritime Spatial Planning. Since 2011, a role-playing game, a board game and a digital interactive simulation platform have been developed. The MSP Challenge editions have been used in workshops, conferences, education, as well as for real life stakeholder engagement. The authors give an overview of the development of the MSP Challenge and reflect on the value of the approach as an engaging and ‘fun’ tool for building mutual understanding and communicating MSP

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/ pkZ

We study information-theoretic multiparty computation (MPC) protocols over rings Z/ pkZ that have good asymptotic communication complexity for a large number of players. An important ingredient for such protocols is arithmetic secret sharing, i.e., linear secret-sharing schemes with multiplicative properties. The standard way to obtain these over fields is with a family of linear codes C, such that C, C⊥ and C2 are asymptotically good (strongly multiplicative). For our purposes here it suffices if the square code C2 is not the whole space, i.e., has codimension at least 1 (multiplicative). Our approach is to lift such a family of codes defined over a finite field F to a Galois ring, which is a local ring that has F as its residue field and that contains Z/ pkZ as a subring, and thus enables arithmetic that is compatible with both structures. Although arbitrary lifts preserve the distance and dual distance of a code, as we demonstrate with a counterexample, the multiplicative property is not preserved. We work around this issue by showing a dedicated lift that preserves self-orthogonality (as well as distance and dual distance), for p≥ 3. Self-orthogonal codes are multiplicative, therefore we can use existing results of asymptotically good self-dual codes over fields to obtain arithmetic secret sharing over Galois rings. For p= 2 we obtain multiplicativity by using existing techniques of secret-sharing using both C and C⊥, incurring a constant overhead. As a result, we obtain asymptotically good arithmetic secret-sharing schemes over Galois rings. With these schemes in hand, we extend existing field-based MPC protocols to obtain MPC over Z/ pkZ, in the setting of a submaximal adversary corrupting less than a fraction 1 / 2 - ε of the players, where ε&gt; 0 is arbitrarily small. We consider 3 different corruption models. For passive and active security with abort, our protocols communicate O(n) bits per multiplication. For full security with guaranteed output delivery we use a preprocessing model and get O(n) bits per multiplication in the online phase and O(nlog n) bits per multiplication in the offline phase. Thus, we obtain true linear bit complexities, without the common assumption that the ring size depends on the number of players

New approach to privacy-preserving clinical decision support systems for HIV treatment

Background HIV treatment prescription is a complex process. Clinical decision support systems (CDSS) are a category of health information technologies that can assist clinicians to choose optimal treatments based on clinical trials and expert knowledge. The usability of some CDSSs for HIV treatment would be significantly improved by using the knowledge obtained by treating other patients. This knowledge, however, is mainly contained in patient records, whose usage is restricted due to privacy and confidentiality constraints. Methods A treatment effectiveness measure, containing valuable information for HIV treatment prescription, was defined and a method to extract this measure from patient records was developed. This method uses an advanced cryptographic technology, known as secure Multiparty Computation (henceforth referred to as MPC), to preserve the privacy of the patient records and the confidentiality of the clinicians' decisions. Findings Our solution enables to compute an effectiveness measure of an HIV treatment, the average time-to-treatment-failure, while preserving privacy. Experimental results show that our solution, although at proof-of-concept stage, has good efficiency and provides a result to a query within 24 min for a dataset of realistic size. Interpretation This paper presents a novel and efficient approach HIV clinical decision support systems, that harnesses the potential and insights acquired from treatment data, while preserving the privacy of patient records and the confidentiality of clinician decisions.Number theory, Algebra and Geometr

Characterization of Loading Responses and Failure Loci of a Boron Steel Spot Weld

Boron steel, classed as an ultra high-strength steel (UHSS), has been utilized in anti-intrusion systems in automobiles, providing high strength and weight-saving potential through gage reduction. UHSS spot welds exhibit unique hardness distributions, with a hard nugget and outlying base material, but with a soft heat-affected zone in-between these regions. This soft zone reduces the strength of the weld and makes it susceptible to failure. Due to the interaction of various weld zones that occurs during loading, there is a need to characterize the loading response of the weld for accurate failure predictions. The loading response of certain weld zones, as well as failure loci, was obtained through physical simulation of the welding process. The results showed a significant difference in mechanical behavior through the weld length. An important result is that instrumented indentation was shown to be a valid, quantitative method for verifying the accuracy with which weld microstructure has been recreated with regard to the target weld microstructure

New approach to privacy-preserving clinical decision support systems for HIV treatment

Background: HIV treatment prescription is a complex process. Clinical decision support systems (CDSS) are a category of health information technologies that can assist clinicians to choose optimal treatments based on clinical trials and expert knowledge. The usability of some CDSSs for HIV treatment would be significantly improved by using the knowledge obtained by treating other patients. This knowledge, however, is mainly contained in patient records, whose usage is restricted due to privacy and confidentiality constraints. Methods: A treatment effectiveness measure, containing valuable information for HIV treatment prescription, was defined and a method to extract this measure from patient records was developed. This method uses an advanced cryptographic technology, known as secure Multiparty Computation (henceforth referred to as MPC), to preserve the privacy of the patient records and the confidentiality of the clinicians’ decisions. Findings: Our solution enables to compute an effectiveness measure of an HIV treatment, the average time-to-treatment-failure, while preserving privacy. Experimental results show that our solution, although at proof-of-concept stage, has good efficiency and provides a result to a query within 24 min for a dataset of realistic size. Interpretation: This paper presents a novel and efficient approach HIV clinical decision support systems, that harnesses the potential and insights acquired from treatment data, while preserving the privacy of patient records and the confidentiality of clinician decisions