sampling scheme
Recently Published Documents


TOTAL DOCUMENTS

682
(FIVE YEARS 134)

H-INDEX

35
(FIVE YEARS 4)

Author(s):  
Mehvish Hyder ◽  
Tahir Mahmood ◽  
Muhammad Moeen Butt ◽  
Syed Muhammad Muslim Raza ◽  
Nasir Abbas

2021 ◽  
Vol 17 (2) ◽  
pp. 75-90
Author(s):  
B. Prashanth ◽  
K. Nagendra Naik ◽  
R. Salestina M

Abstract With this article in mind, we have found some results using eigenvalues of graph with sign. It is intriguing to note that these results help us to find the determinant of Normalized Laplacian matrix of signed graph and their coe cients of characteristic polynomial using the number of vertices. Also we found bounds for the lowest value of eigenvalue.


2021 ◽  
Vol 13 (21) ◽  
pp. 4432
Author(s):  
Wentao Duan ◽  
Jiandong Liu ◽  
Qingyun Yan ◽  
Haibing Ruan ◽  
Shuanggen Jin

The Moon-based Earth radiation observatory (MERO) is a new platform, which is expected to advance current Earth radiation budget (ERB) research with better observations. For the instrument design of a MERO system, ascertaining the spatial resolution and sampling scheme is important. However, current knowledge about this is still limited. Here we proposed a simulation method for the MERO-measured Earth top of atmosphere (TOA) outgoing shortwave radiation (OSR) and outgoing longwave radiation (OLR) fluxes and constructed the “true” Earth TOA OSR and OLR fluxes based on the Clouds and Earth’s Radiant Energy System (CERES) data. Then we used them to reveal the effects of spatial resolution and temporal scheme (sampling interval and the temporal sampling sequence) on the measurement error of a MERO. Our results indicate that the spatial sampling error in the unit of percentage reduces linearly as the spatial resolution varies from 1000 km to 100 km; the rate is 2.5%/100 km for the Earth TOA OSR flux, which is higher than that (1%/100 km) of the TOA OLR flux. Besides, this rate becomes larger when the spatial resolution is finer than 40 km. It is also demonstrated that a sampling temporal sequence of starting time of 64 min with a sampling interval of 90 min is the optimal sampling scheme that results in the least temporal sampling error for the MERO system with a 40 km spatial resolution, note that this conclusion depends on the temporal resolution and quality of the data used to construct the “true” Earth TOA OSR and OLR fluxes. The proposed method and derived results in this study could facilitate the ascertainment of the optimal spatial resolution and sampling scheme of a MERO system under certain manufacturing budget and measurement error limit.


2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Roman Hornung

AbstractThe diversity forest algorithm is an alternative candidate node split sampling scheme that makes innovative complex split procedures in random forests possible. While conventional univariable, binary splitting suffices for obtaining strong predictive performance, new complex split procedures can help tackling practically important issues. For example, interactions between features can be exploited effectively by bivariable splitting. With diversity forests, each split is selected from a candidate split set that is sampled in the following way: for $$l = 1, \dots , {nsplits}$$ l = 1 , ⋯ , nsplits : (1) sample one split problem; (2) sample a single or few splits from the split problem sampled in (1) and add this or these splits to the candidate split set. The split problems are specifically structured collections of splits that depend on the respective split procedure considered. This sampling scheme makes innovative complex split procedures computationally tangible while avoiding overfitting. Important general properties of the diversity forest algorithm are evaluated empirically using univariable, binary splitting. Based on 220 data sets with binary outcomes, diversity forests are compared with conventional random forests and random forests using extremely randomized trees. It is seen that the split sampling scheme of diversity forests does not impair the predictive performance of random forests and that the performance is quite robust with regard to the specified nsplits value. The recently developed interaction forests are the first diversity forest method that uses a complex split procedure. Interaction forests allow modeling and detecting interactions between features effectively. Further potential complex split procedures are discussed as an outlook.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Zu-Min Wang ◽  
Ji-Yu Tian ◽  
Jing Qin ◽  
Hui Fang ◽  
Li-Ming Chen

Network intrusion detection remains one of the major challenges in cybersecurity. In recent years, many machine-learning-based methods have been designed to capture the dynamic and complex intrusion patterns to improve the performance of intrusion detection systems. However, two issues, including imbalanced training data and new unknown attacks, still hinder the development of a reliable network intrusion detection system. In this paper, we propose a novel few-shot learning-based Siamese capsule network to tackle the scarcity of abnormal network traffic training data and enhance the detection of unknown attacks. In specific, the well-designed deep learning network excels at capturing dynamic relationships across traffic features. In addition, an unsupervised subtype sampling scheme is seamlessly integrated with the Siamese network to improve the detection of network intrusion attacks under the circumstance of imbalanced training data. Experimental results have demonstrated that the metric learning framework is more suitable to extract subtle and distinctive features to identify both known and unknown attacks after the sampling scheme compared to other supervised learning methods. Compared to the state-of-the-art methods, our proposed method achieves superior performance to effectively detect both types of attacks.


2021 ◽  
Vol 11 (3) ◽  
Author(s):  
Stefano De Nicola

The numerical simulation of dynamical phenomena in interacting quantum systems is a notoriously hard problem. Although a number of promising numerical methods exist, they often have limited applicability due to the growth of entanglement or the presence of the so-called sign problem. In this work, we develop an importance sampling scheme for the simulation of quantum spin dynamics, building on a recent approach mapping quantum spin systems to classical stochastic processes. The importance sampling scheme is based on identifying the classical trajectory that yields the largest contribution to a given quantum observable. An exact transformation is then carried out to preferentially sample trajectories that are close to the dominant one. We demonstrate that this approach is capable of reducing the temporal growth of fluctuations in the stochastic quantities, thus extending the range of accessible times and system sizes compared to direct sampling. We discuss advantages and limitations of the proposed approach, outlining directions for further developments.


Sign in / Sign up

Export Citation Format

Share Document