In Figure 1(d), we compare the performance of noise reduction by using Algorithm NSP-AMFM and Algorithm NSP [7].
Sample text:```In this study, we generalized previous results regarding the quasi-Gaussian shape and the scalar property using the SBF model [13,21,52].```
Sample intent: result
Sample text:```Our results on working memory performance are similar to those of earlier studies (e.g. Archbold et al., 2009; Cosentino et al., 2008; Naegele et al., 2006) in showing impaired working memory in the OSA group.```
Sample intent: result



Sample text:```Discrepancies analogous to those between our results and those of simulations have, indeed, recently been observed in the case of the binary perceptron [18], the pspin interaction spin glass [19], and in the case of fluctuating manifolds in random media [20], where dynamically frozen phases were observed in regions of parameter space in which static approaches yielded ergodic phases.```
Sample intent: result



Sample text:```NP3L [10] is consistently outperformed by our methods, while for UPnP [8] our NPnLupC outperforms it in the noisy cases.```
Sample intent: background



Sample text:```…between output and input, CNF achieves almost 10% relative improvement over CRF. CNF also outperforms other methods including SVMpro (Hua and Sun, 2001), SVMpsi (Kim and Park, 2003), YASSPP (Karypis, 2006), PSIPRED (Jones, 1999), SPINE (Dor and Zhou, 2007) and TreeCRFpsi (Dietterich et al., 2004).```
Sample intent: background



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result
Sample text:```The above estimator generalizes the estimator in Sriperumbudur et al., 2017 to conditional densities.```
Sample intent: method



Sample text:```This seems to be the main drawback of the current implementation in comparison to the method of Black Jepson (“refined” in Table 1).```
Sample intent: result



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result



Sample text:```For seeking the optimal value of Wh of the sub-problems which corresponds to the h-th level, we can solve the problem by the smoothing proximal gradient (SPG) method [6] fortunately.```
Sample intent: background



Sample text:```Following past work, we show that such basis models can be learned from 2D annotations using techniques adapted from nonrigid structure from motion (SFM) [20, 19].```
Sample intent: method



Sample text:```In this study, the proposed method is based on atrial activity extraction using an echo state network (ESN) re­ cently introduced as a unified solution to the problem of QRST cancellation in the presence of substantial variation in beat morphology and/or occasional ectopic beats [7].```
Sample intent: background



Sample text:```13 indicates the comparison of the results of the mesh simplification method [2] after applying different mesh enhancement techniques.```
Sample intent: background



Sample text:```Discrepancies analogous to those between our results and those of simulations have, indeed, recently been observed in the case of the binary perceptron [18], the pspin interaction spin glass [19], and in the case of fluctuating manifolds in random media [20], where dynamically frozen phases were observed in regions of parameter space in which static approaches yielded ergodic phases.```
Sample intent: result



Sample text:```…between output and input, CNF achieves almost 10% relative improvement over CRF. CNF also outperforms other methods including SVMpro (Hua and Sun, 2001), SVMpsi (Kim and Park, 2003), YASSPP (Karypis, 2006), PSIPRED (Jones, 1999), SPINE (Dor and Zhou, 2007) and TreeCRFpsi (Dietterich et al., 2004).```
Sample intent: background



Sample text:```NP3L [10] is consistently outperformed by our methods, while for UPnP [8] our NPnLupC outperforms it in the noisy cases.```
Sample intent: background