discrete domain
Recently Published Documents


TOTAL DOCUMENTS

93
(FIVE YEARS 23)

H-INDEX

14
(FIVE YEARS 2)

Author(s):  
Smita Vasant Tempe

Abstract: The goal of this study is to find a "genuine" two-dimensional transform that can capture the fundamental geometrical structure that is important in visual information. The discontinuous character of the data is the most difficult aspect of analysing geometry in photographs. Unlike previous approaches, such as curvelets, which generate a transform in the continuous domain and then discretize for sampled data, we begin with a discrete-domain construction and then investigate its convergence to a continuous-domain expansion. We use nonseparable filter banks to create a discrete-domain multiresolution and multidirection expansion, similar to how wavelets are produced from filter banks. As a result of this construction, a flexible multiresolution, local, and directed picture expansion employing contour segments is obtained, and it is therefore useful.


Author(s):  
Yong-Feng Ge ◽  
Jinli Cao ◽  
Hua Wang ◽  
Zhenxiang Chen ◽  
Yanchun Zhang

AbstractBy breaking sensitive associations between attributes, database fragmentation can protect the privacy of outsourced data storage. Database fragmentation algorithms need prior knowledge of sensitive associations in the tackled database and set it as the optimization objective. Thus, the effectiveness of these algorithms is limited by prior knowledge. Inspired by the anonymity degree measurement in anonymity techniques such as k-anonymity, an anonymity-driven database fragmentation problem is defined in this paper. For this problem, a set-based adaptive distributed differential evolution (S-ADDE) algorithm is proposed. S-ADDE adopts an island model to maintain population diversity. Two set-based operators, i.e., set-based mutation and set-based crossover, are designed in which the continuous domain in the traditional differential evolution is transferred to the discrete domain in the anonymity-driven database fragmentation problem. Moreover, in the set-based mutation operator, each individual’s mutation strategy is adaptively selected according to the performance. The experimental results demonstrate that the proposed S-ADDE is significantly better than the compared approaches. The effectiveness of the proposed operators is verified.


Author(s):  
Johan Olav Helland ◽  
Espen Jettestuen ◽  
Helmer André Friis

2021 ◽  
Author(s):  
Johan Olav Helland ◽  
Espen Jettestuen ◽  
Helmer André Friis

2021 ◽  
Vol 44 ◽  
Author(s):  
Ian Cross

Abstract Both papers – to different degrees – underplay the interactive dimensions of music, and both would have benefited from integrating the concept of attachment into their treatments of social bonding. I further suggest that their treatment of music as a discrete domain of human experience and behaviour weakens their arguments concerning its functions in human evolution.


2020 ◽  
Vol 4 (1) ◽  
pp. 108-126
Author(s):  
Teo Asplund ◽  
Cris L. Luengo Hendriks ◽  
Matthew J. Thurley ◽  
Robin Strand

AbstractThis paper proposes a way of better approximating continuous, two-dimensional morphology in the discrete domain, by allowing for irregularly sampled input and output signals. We generalize previous work to allow for a greater variety of structuring elements, both flat and non-flat. Experimentally we show improved results over regular, discrete morphology with respect to the approximation of continuous morphology. It is also worth noting that the number of output samples can often be reduced without sacrificing the quality of the approximation, since the morphological operators usually generate output signals with many plateaus, which, intuitively do not need a large number of samples to be correctly represented. Finally, the paper presents some results showing adaptive morphology on irregularly sampled signals.


Energies ◽  
2020 ◽  
Vol 13 (15) ◽  
pp. 3810
Author(s):  
Cleonor C. das Neves ◽  
Walter B. Junior ◽  
Renan L. P. de Medeiros ◽  
Florindo A. C. Ayres Junior ◽  
Iury V. Bessa ◽  
...  

This paper presents a novel direct form to design a digital robust control using RST structure (i.e., name given because of the R, S and T polynomials computed) based on convex optimization such as Chebyshev sphere; this approach was applied to a DC-DC Buck converter. This methodology takes into account parametric uncertainties and a Chebyshev sphere constraint in order to ensure robust performance and stability of the system in the discrete domain. For this purpose, a mathematical model for the DC-DC Buck converter is presented when considering uncertainties in electrical variables, such as load resistance, inductance, capacitance, and source voltage variation, also to obtain the discrete model of the system by using the bilinear transformation. The proposed methodology is compared with two other approaches designed in a discrete domain: the classical pole placement and the robust methodology based on the Kharitonov theorem. Wide-ranging experiments are performed in order to evaluate the behavior of the control methodologies when the system is subject to parametric variations of the load resistance and voltage setpoint variation. The results show that the proposed methodology outperforms the other approaches in 90% of the tests and ensures robust stability and robust performance when the system is subjected to a parametric uncertainties family.


Sign in / Sign up

Export Citation Format

Share Document