Construction of space-filling designs using WSP algorithm for high dimensional spaces

Juan, Santiago; Claeys‐Bruno, Magalie; Sergent, Michelle

doi:10.1016/j.chemolab.2011.06.003

Cited by 54 publications

(24 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to providing a general confidence concerning the performances of the tested implementation, it mitigates the bias in the parameters' selection by the experimenter. We use the WSP algorithm [46] to broadly sample the space of parameters with a reasonable amount of experiments. Unless otherwise specified, we run the experiments with 130 different combinations of parameters.…”

Section: ) Experimental Designmentioning

confidence: 99%

QUIC-FEC: Bringing the benefits of forward erasure correction to QUIC

Michel

Coninck

Bonaventure

2019

2019 IFIP Networking Conference (IFIP Networking)

View full text Add to dashboard Cite

Originally implemented by Google, QUIC gathers a growing interest by providing, on top of UDP, the same service as the classical TCP/TLS/HTTP/2 stack. The IETF will finalise the QUIC specification in 2019.A key feature of QUIC is that almost all its packets, including most of its headers, are fully encrypted. This prevents eavesdropping and interferences caused by middleboxes. Thanks to this feature and its clean design, QUIC is easier to extend than TCP. In this paper, we revisit the reliable transmission mechanisms that are included in QUIC. More specifically, we design, implement and evaluate Forward Erasure Correction (FEC) extensions to QUIC. These extensions are mainly intended for high-delays and lossy communications such as In-Flight Communications. Our design includes a generic FEC frame and our implementation supports the XOR, Reed-Solomon and Convolutional RLC errorcorrecting codes. We also conservatively avoid hindering the lossbased congestion signal by distinguishing the packets that have been received from the packets that have been recovered by the FEC. We evaluate its performance by applying an experimental design covering a wide range of delay and packet loss conditions with reproducible experiments. These confirm that our modular design allows the protocol to adapt to the network conditions. For long data transfers or when the loss rate and delay are small, the FEC overhead negatively impacts the download completion time. However, with high packet loss rates and long delays or smaller files, FEC allows drastically reducing the download completion time by avoiding costly retransmission timeouts. These results show that there is a need to use FEC adaptively to the network conditions.

show abstract

Section: ) Experimental Designmentioning

confidence: 99%

QUIC-FEC: Bringing the benefits of forward erasure correction to QUIC

Michel

Coninck

Bonaventure

2019

2019 IFIP Networking Conference (IFIP Networking)

View full text Add to dashboard Cite

show abstract

“…The parameters of these curves, kr 0 o , S or , n c and n w , were randomly sampled and selected using the algorithm by Wootton, Sergent, Phan-Tan-Luu [79] to ensure a good initial covering of the space. The geometrical domain is discretized on a regular grid of 290×890 blocks.…”

Section: Experimental Protocolmentioning

confidence: 99%

Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-Aware Matchings

Soler

Martín

Darche

et al. 2019

2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)

View full text Add to dashboard Cite

Figure 1: Overview of the ranking framework. An ensemble of viscous fingering simulation runs S 1 , S 2 , S 3 is launched, and the persistence diagram of newly available time-steps can be computed in-situ (left). Only persistence diagrams for which there is a matching ground truth image (center, top) are computed. Diagrams of every simulation are compared with the diagrams of the ground truth (center, bottom) at matching time-steps. This comparison, based on a metric W 2 combining the notions of persistence and geometry, outputs a distance measurement, which can be integrated over time to form the metric d W 2. This produces a final ranking (right) which characterizes the quality of simulations, allowing experts to select and explore best performing runs automatically. ABSTRACTThis application paper presents a novel framework based on topological data analysis for the automatic evaluation and ranking of viscous finger simulation runs in an ensemble with respect to a reference acquisition. Individual fingers in a given time-step are associated with critical point pairs in the distance field to the injection point, forming persistence diagrams. Different metrics, based on optimal transport, for comparing time-varying persistence diagrams in this specific applicative case are introduced. We evaluate the relevance of the rankings obtained with these metrics, both qualitatively thanks to a lightweight web visual interface, and quantitatively by studying the deviation from a reference ranking suggested by experts. Extensive experiments show the quantitative superiority of our approach compared to traditional alternatives. Our web interface allows experts to conveniently explore the produced rankings. We show a complete viscous fingering case study demonstrating the utility of our approach in the context of porous media fluid flow, where our framework can be used to automatically discard physically-irrelevant simulation runs from the ensemble and rank the most plausible ones. We document an in-situ implementation to lighten I/O and performance constraints arising in the context of parametric studies.2. Metrics: new topological metrics for comparing time-varying viscous fingers are introduced, based on the Wasserstein matching of persistence diagrams, specifically tuned for the viscous fingering phenomenon and integrated over time.3. Case study: a complete case study of a viscous fingering simulation ensemble is documented, along with a proof-ofconcept in-situ implementation of our approach. 4. Evaluation: the metrics and ranking framework are qualitatively evaluated with feedback from domain experts. The quantitative performance of our approach is also analyzed and its superiority over traditional alternatives is demonstrated.

show abstract

“…More details can be found in Damblin, Couplet, and Iooss (2013). Another space filling design generated with the WSP (Wooton, Sergent, Phan-Tan-Luu) algorithm is available (Santiago, Claeys-Bruno, and Sergent 2012 Lastly, Franco, Vasseur, Corre, and Sergent (2009) proposes classifying space filling designs using the mean and the standard deviation of the minimal spanning tree (MST). This criterion has also been implemented.…”

Section: Dicedesign Packagementioning

confidence: 99%

DiceDesignandDiceEval: TwoRPackages for Design and Analysis of Computer Experiments

Dupuy¹,

Helbert²,

Franco³

2015

J. Stat. Soft.

112

View full text Add to dashboard Cite

This paper introduces two R packages available on the Comprehensive R Archive network. The main application concerns the study of computer code output. Package DiceDesign is dedicated to numerical design of experiments, from the construction to the study of the design properties. Package DiceEval deals with the fit, the validation and the comparison of metamodels.After a brief presentation of the context, we focus on the architecture of these two packages. A two-dimensional test function will be a running example to illustrate the main functionalities of these packages and an industrial case study in five dimensions will also be detailed.

show abstract

Construction of space-filling designs using WSP algorithm for high dimensional spaces

Cited by 54 publications

References 20 publications

QUIC-FEC: Bringing the benefits of forward erasure correction to QUIC

QUIC-FEC: Bringing the benefits of forward erasure correction to QUIC

Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-Aware Matchings

DiceDesignandDiceEval: TwoRPackages for Design and Analysis of Computer Experiments

Contact Info

Product

Resources

About