Abstract: Time-domain testing of A/D converter in single tone mode amounts to the identification of fundamental and harmonic tones in noise. The variable projection method reduces this problem to frequency estimation by minimising a onedimensional function. In this paper it is shown that the bias due to ignoring the harmonic distortion effect is negligible, and this approximation leads to fast ...

We describe an asynchronous parallel derivative-free algorithm for linearly constrained optimization. Generating set search (GSS) is the basis of our method. At each iteration, a GSS algorithm computes a set of search directions and corresponding trial points and then evaluates the objective function value at each trial point. Asynchronous versions of the algorithm have been developed in the un...

We propose modeling Group Support System (GSS) search tasks with Genetic Algorithms. Using explicit mathematical models for Genetic Algorithms, (GAs), we show how to estimate the underlying GA parameters from an observed GSS solution path. Once these parameters are estimated, they may be related to GSS variables such as group composition and membership, leadership presence, the specific GSS too...

This research proposes a bi-level model for the mixed network design problem (MNDP). The upper level problem involves redesigning the current road links' directions, expanding their capacity, and determining signal settings at intersections to optimize the reserve capacity of the whole system. The lower level problem is the user equilibrium traffic assignment problem. By proving that the optima...

We propose modeling Group Support System (GSS) search tasks with Genetic Algorithms. Using explicit mathematical models for Genetic Algorithms (GAs), we show how to estimate the underlying GA parameters from an observed GSS solution path. Once these parameters are estimated, they may be related to GSS variables such as group composition and membership, leadership presence, the specific GSS tool...

Two fast group subset selection (GSS) algorithms for the linear regression model are proposed in this paper. GSS finds the best combinations of groups up to a specified size minimising the residual sum of squares. This imposes an l0 constraint on the regression coefficients in a group context. It is a combinatorial optimisation problem with NP complexity. To make the exhaustive search very effi...

Since at least the time of the Ancient Greeks, scholars have argued about whether the golden section-a number approximately equal to 0.618-holds the key to the secret of beauty. Empirical investigations of the aesthetic properties of the golden section date back to the very origins of scientific psychology itself, the first duties being conducted by Fechner in the 1860s. In this paper historica...

Luca Callegaro INRIM Istituto Nazionale di Ricerca Metrologica, strada delle Cacce 91,Turin 10135, Italy (Dated: August 17, 2016) Abstract We propose a simple algorithm devoted to locate the “corner” of an L-curve, a function often used to chose the correct regularization parameter for the solution of ill-posed problems. The algorithm involves the Menger curvature of a circumcircle and the gold...