248,008 Hits in 5.2 sec

Distance-Based Sampling of Software Configuration Spaces

Christian Kaltenecker, Alexander Grebhahn, Norbert Siedmung, Jianmei Guo, Sven Apel
2020 Software Engineering  
To demonstrate the merits of distance-based sampling, we compare it to state-of-the-art sampling strategies on 10 real-world configurable software systems.  ...  Based on this observation, we devise a new sampling strategy that is based on a distance metric and a probability distribution to spread the configurations of the sample set across the configuration space  ...  To this end, distance-based sampling relies on a distance metric and assigns each conĄguration a distance value.  ... 
doi:10.18420/se2020_17 dblp:conf/se/KalteneckerGSGA20 fatcat:kksu3awwsrc4locjk42uom6pei

Search-based diverse sampling from real-world software product lines

Yi Xiang, Han Huang, Yuren Zhou, Sizhe Li, Chuan Luo, Qingwei Lin, Miqing Li, Xiaowei Yang
2022 Proceedings of the 44th International Conference on Software Engineering  
of configurations), or achieve diverse sampling but with limited scalability (the handleable configuration space size is limited to 10 13 ).  ...  To understand properties of the space formed by all valid configurations, a feasible way is to select a small and valid sample set.  ...  Deriving a small set of valid configurations that has a good coverage in the behavior space is required in many software engineering tasks.  ... 
doi:10.1145/3510003.3510053 fatcat:hikpecdddza4ngonri4xua56vm

Search-based Diverse Sampling from Real-world Software Product Lines [article]

Yi Xiang, Han Huang, Yuren Zhou, Sizhe Li, Chuan Luo, Qingwei Lin, Miqing Li, Xiaowei Yang
2021 Zenodo  
of configurations), or achieve diverse sampling but with limited scalability (the handleable configuration space size is limited to $10^{13}$).  ...  The distance metric is carefully designed to measure similarities between configurations, and further diversity of a sample set.  ...  In many software engineering tasks, it is important to understand properties of configuration spaces.  ... 
doi:10.5281/zenodo.5751240 fatcat:3vxsdgw27rfndmkwyonf4pzjse

Faster Discovery of Faster System Configurations with Spectral Learning [article]

Vivek Nair, Tim Menzies, Norbert Siegmund, Sven Apel
2017 arXiv   pre-print
WHAT's innovation is the use of the spectrum (eigenvalues) of the distance matrix between the configurations of a configurable software system, to perform dimensionality reduction.  ...  Within that reduced configuration space, many closely associated configurations can be studied by executing only a few sample configurations.  ...  [15] proposed a progressive random sampling approach, which samples the configuration space in steps of the number of features of the software system in question.  ... 
arXiv:1701.08106v1 fatcat:uqceq2rcfnfpfo7xgruck7dbmy

Fault-aware Pareto Frontier Exploration for Dependable System Architectures

Lukas Märtin, Hauke Baller, Anne Koziolek, Ralf H. Reussner
2016 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
We propose a multi-stage approach (1) to sample Paretooptimal configurations for redundant system designs within hostile environments, (2) to check satisfiability of structural constraints and (3) to measure  ...  We use genetic algorithms (NSGA-II) for sampling a wide range of system designs and demonstrate our approach by means of an exemplary fault-tolerant system.  ...  ACKNOWLEDGMENT This work was partially supported by the DFG (German Research Foundation) under the Priority Programme SPP1593: Design For Future Managed Software Evolution.  ... 
dblp:conf/models/MartinBKR16 fatcat:f7lsmd3fibgcfirufsxv5xdrca

Cayley Analysis of Mechanism Configuration Spaces using CayMos: Software Functionalities and Architecture [article]

Menghan Wang, Meera Sitharam
2014 arXiv   pre-print
For a common class of 2D mechanisms called 1-dof tree decomposable linkages, we present a software CayMos which uses new theoretical results to implement efficient algorithmic solutions for: (a) meaningfully  ...  representing and visualizing the connected components in the Euclidean realization space; (b) finding a path of continuous motion between two realizations in the same connected component, with or without  ...  (B) Spinner for specifying the length of the base non-edge and showing the corresponding realizations. (C) Intervals of the Cayley configuration space.  ... 
arXiv:1402.7347v1 fatcat:2kn23h7wvfhj7jvlymfp44snoy

Phylotree – a toolkit for computing experiments with distance-based methods for genome coevolution

Elissaveta Arnaoudova, Jerzy W Jaromczyk, Neil Moore, Christopher L Schardl, Ruriko Yoshida
2010 BMC Bioinformatics  
.; and Yoshida, Ruriko, "Phylotree -a toolkit for computing experiments with distance-based methods for genome coevolution" (2010).  ...  the original alignments; 2) sample trees from the posterior distributions for each of the original and modified alignments using MCMC-based software (MrBayes or BEAST); 3) compute distances among the  ...  tree distributions, for example as an average of the pairwise distances between trees in the samples; and 4) check similarity criteria based on these distances.  ... 
doi:10.1186/1471-2105-11-s4-p6 pmcid:PMC3290089 fatcat:xpvb57brqbfubkvydn33dnfm6i

Finding Faster Configurations using FLASH [article]

Vivek Nair, Zhe Yu, Tim Menzies, Norbert Siegmund, Sven Apel
2018 arXiv   pre-print
FLASH scales up to software systems that defeat the prior state of the art model-based methods in this area.  ...  To assist engineers in finding the (near) optimal configuration, this paper introduces FLASH, a sequential model-based method, which sequentially explores the configuration space by reflecting on the configurations  ...  Hence, it is useful to seek better configurations. • Understanding the configuration space of software systems with large configuration spaces is challenging [3] . • Exploring more than just a handful  ... 
arXiv:1801.02175v2 fatcat:mzzk5ay6gjeqpn3izwgxvh6j54

Scalable Sampling and Prioritization for Product-Line Testing

Mustafa Al-Hajjaji
2015 Software Engineering  
We plan to use evolutionary testing approaches with different inputs to fitness functions to explore the configuration space of feature models.  ...  Exhaustively testing every product of a software product line (SPL) is a difficult task due to the combinatorial explosion of the number of products.  ...  To answer RQ3, we plan to employ EA to search the possible configuration space of feature models.  ... 
dblp:conf/se/Al-Hajjaji15 fatcat:wizkzdnbxjf2vllbhru4hihhd4

K-NN FOREST: a software for the non-parametric prediction and mapping of environmental variables by the k-Nearest Neighbors algorithm

Gherardo Chirici, Piermaria Corona, Marco Marchetti, Alessandro Mastronardi, Fabio Maselli, Lorenzo Bottai, Davide Travaglini
2012 European Journal of Remote Sensing  
One of the most widely adopted approaches is based on the non-parametric k-Nearest Neighbors (k-NN) algorithm.  ...  variable acquired in the field by sampling units through the use of remotely sensed data or other ancillary variables.  ...  On the basis of this optimization phase, the user has to decide the best configuration of k-NN in terms of feature space variables to be used, type of feature space distance, k value, inclusion of an ancillary  ... 
doi:10.5721/eujrs20124536 fatcat:zvlbyqz4dfharf4smql2dyulai

ArrayD: a general purpose software for microarray design

Anu Sharma, Gyan Prakash Srivastava, Vineet K Sharma, Srinivasan Ramachandran
2004 BMC Bioinformatics  
A critical aspect of microarray production is the design aimed at space optimization while maximizing the number of gene probes and their replicates to be spotted.  ...  The choice of a design solution to be used will be governed by the spotting chemistry to be used and the accuracy of the robot. ArrayD is a software for standard cartesian robots.  ...  We thank Dipayan Dasgupta for his help in compilation of the software and Mamta Khandelwal for her help in uploading the software on the web site. We thank the assistance of Technosol.  ... 
doi:10.1186/1471-2105-5-142 pmid:15461789 pmcid:PMC524372 fatcat:w37erocclfhcdcxish3lmdzxoy

Advances in Geometric Morphometrics

Philipp Mitteroecker, Philipp Gunz
2009 Evolutionary biology  
Thus, notions of distance (similarity) between shapes or of the length and direction of developmental and evolutionary trajectories can be meaningfully assessed in this space.  ...  Geometric morphometrics is the statistical analysis of form based on Cartesian landmark coordinates.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided  ... 
doi:10.1007/s11692-009-9055-x fatcat:2bjd6sfrizdhxhmsuwutau44ta

Evaluation of Imaging Performance for Sub-Y-type Interferometric Synthetic Aperture Radiometer

Ho-Jin Lee, Hyuk Park, Sung-Hyun Kim, Yong-Hoon Kim
2005 PIERS Online  
It has been reported that Y-type array configuration with equally spaced antennas is optimal in terms of a narrow 3dB beamwidth and wide synthesized field-of-view (FOV).  ...  The angular resolution of sub-Y-type array was compared with that of Y-type array with the same number of antennas.  ...  Acknowledgement This work was supported by the Brain Korea 21 Project and the Korean Science and Engineering Foundation(KOSEF) through the Advanced Environmental Monitoring Research Center at Gwangju Institute of  ... 
doi:10.2529/piers050125094700 fatcat:ptvuowmglrbvro4h6r6aofegie

Finding near-optimal configurations in product lines by random sampling

Jeho Oh, Don Batory, Margaret Myers, Norbert Siegmund
2017 Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017  
CCS CONCEPTS • Software and its engineering → Software configuration management and version control systems; Search-based software engineering; KEYWORDS software product lines, searching configuration  ...  Instead, we randomly sample and recursively search a configuration space directly to find nearoptimal configurations without constructing a prediction model.  ...  Instead, we use BDDs to count the number of valid configurations in a configuration space, thereby enabling true random sampling of the space.  ... 
doi:10.1145/3106237.3106273 dblp:conf/sigsoft/OhBMS17 fatcat:ub4hdj73ffbild3qenr5us7vpi

Similarity-based prioritization in software product-line testing

Mustafa Al-Hajjaji, Thomas Thüm, Jens Meinicke, Malte Lochau, Gunter Saake
2014 Proceedings of the 18th International Software Product Line Conference on - SPLC '14  
Exhaustively testing every product of a software product line (SPL) is a difficult task due to the combinatorial explosion of the number of products.  ...  We implemented similarity-based prioritization in FeatureIDE and evaluated it by comparing its outcome to the default outcome of three sampling algorithms as well as to random orders.  ...  Furthermore, we are going to execute real test cases against our approach or generate real defects into the source code of existing SPLs using techniques from mutation testing.  ... 
doi:10.1145/2648511.2648532 dblp:conf/splc/Al-HajjajiTMLS14 fatcat:osborlvqmraxhbp6xjkqj2fz2y
« Previous Showing results 1 — 15 out of 248,008 results