VirtualNet: Mapping Distributed Communication on a Single Node

2009 ◽  
Author(s):  
Wangxi Jia ◽  
Xuping Tu ◽  
Hai Jin ◽  
Xiaofei Liao
Keyword(s):  
Single Node ◽  
Distributed Communication

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

scholarly journals Discrete effect on single-node boundary schemes of lattice Bhatnagar–Gross–Krook model for convection-diffusion equations

2019 ◽  
Vol 31 (01) ◽  
pp. 2050017
Author(s):  
Liang Wang ◽  
Xuhui Meng ◽  
Hao-Chi Wu ◽  
Tian-Hu Wang ◽  
Gui Lu
Keyword(s):  
Boundary Condition ◽  
Relaxation Time ◽  
Lattice Boltzmann ◽  
Diffusion Equations ◽  
Bgk Model ◽  
Distance Ratio ◽  
Single Node ◽  
Convection Diffusion ◽  
Velocity Models ◽  
Discrete Effect

The discrete effect on the boundary condition has been a fundamental topic for the lattice Boltzmann method (LBM) in simulating heat and mass transfer problems. In previous works based on the anti-bounce-back (ABB) boundary condition for convection-diffusion equations (CDEs), it is indicated that the discrete effect cannot be commonly removed in the Bhatnagar–Gross–Krook (BGK) model except for a special value of relaxation time. Targeting this point in this paper, we still proceed within the framework of BGK model for two-dimensional CDEs, and analyze the discrete effect on a non-halfway single-node boundary condition which incorporates the effect of the distance ratio. By analyzing an unidirectional diffusion problem with a parabolic distribution, the theoretical derivations with three different discrete velocity models show that the numerical slip is a combined function of the relaxation time and the distance ratio. Different from previous works, we definitely find that the relaxation time can be freely adjusted by the distance ratio in a proper range to eliminate the numerical slip. Some numerical simulations are carried out to validate the theoretical derivations, and the numerical results for the cases of straight and curved boundaries confirm our theoretical analysis. Finally, it should be noted that the present analysis can be extended from the BGK model to other lattice Boltzmann (LB) collision models for CDEs, which can broaden the parameter range of the relaxation time to approach 0.5.

Modified graph-state codes for single-node recovery in quantum distributed storage

2020 ◽  
Vol 102 (6) ◽  
Author(s):  
Priya J. Nadkarni ◽  
Ankur Raina ◽  
Shayan Srinivasa Garani
Keyword(s):  
Distributed Storage ◽  
Graph State ◽  
Single Node

scholarly journals An Active and Passive Reputation Method for Secure Wideband Spectrum Sensing Based on Blockchain

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1346
Author(s):  
Xinyu Xie ◽  
Zhuhua Hu ◽  
Min Chen ◽  
Yaochi Zhao ◽  
Yong Bai
Keyword(s):  
Cognitive Radio ◽  
Spectrum Sensing ◽  
Cognitive Radio Networks ◽  
Cooperative Spectrum Sensing ◽  
Sampling Rate ◽  
Radio Networks ◽  
Single Node ◽  
Decision Algorithm ◽  
Collusion Attacks ◽  
Wideband Spectrum Sensing

Spectrum is a kind of non-reproducible scarce strategic resource. A secure wideband spectrum sensing technology provides the possibility for the next generation of ultra-dense, ultra-large-capacity communications to realize the shared utilization of spectrum resources. However, for the open collaborative sensing in cognitive radio networks, the collusion attacks of malicious users greatly affect the accuracy of the sensing results and the security of the entire network. To address this problem, this paper proposes a weighted fusion decision algorithm by using the blockchain technology. The proposed algorithm divides the single-node reputation into active reputation and passive reputation. Through the proposed token threshold concept, the active reputation is set to increase the malicious cost of the node; the passive reputation of the node is determined according to the historical data and recent performance of the blockchain. The final node weight is obtained by considering both kinds of reputation. The proposed scheme can build a trust-free platform for the cognitive radio collaborative networks. Compared with the traditional equal-gain combination algorithm and the centralized sensing algorithm based on the beta reputation system, the simulation results show that the proposed algorithm can obtain reliable sensing results with a lower number of assistants and sampling rate, and can effectively resist malicious users’ collusion attacks. Therefore, the security and the accuracy of cooperative spectrum sensing can be significantly improved in cognitive radio networks.

scholarly journals Seed Yam Production Using High-Quality Minitubers Derived from Plants Established with Vine Cuttings

Agronomy ◽  
2021 ◽  
Vol 11 (5) ◽  
pp. 978
Author(s):  
Beatrice Aighewi ◽  
Norbert Maroya ◽  
Lava Kumar ◽  
Morufat Balogun ◽  
Daniel Aihebhoria ◽  
...  
Keyword(s):  
Block Design ◽  
Research Station ◽  
International Institute ◽  
Tropical Agriculture ◽  
Single Node ◽  
Cropping Season ◽  
Randomized Complete Block Design ◽  
The World ◽  
Cropping Seasons ◽  
Set Up

Yam (Dioscorea spp.) is a valuable food security crop in West Africa, where 92% of the world production occurs. The availability of quality seed tubers for increased productivity is a major challenge. In this study, minitubers weighing 1, 3, and 5 g produced from virus-free single-node vine cuttings of two improved yam varieties (Asiedu and Kpamyo) growing in an aeroponics system were assessed for suitability in seed production at a population of 100,000 plants ha−1. A 3 × 2 factorial experiment with randomized complete block design and three replications was set up during the cropping seasons of 2017 to 2019 at the International Institute of Tropical Agriculture Research Station in Kubwa, Abuja, Nigeria. Results showed field establishments of 87%–97.8%. Yields differed with minituber size, variety, and cropping season; the highest was 31.2 t ha−1 in 2019 and the lowest, 10 t ha−1 in 2018 from 5 and 1 g Kpamyo minitubers, respectively. The estimated number of tubers produced per hectare by 1, 3, and 5 g minitubers was 101,296, 112,592, and 130,555, with mean weights per stand of 159.2, 187.3, and 249.4 g, respectively. We recommend using less than 6 g minitubers for seed yam production due to their high multiplication rates.

Factors affecting 14C-sucrose uptake by single-node explants of rose flower stems

1980 ◽  
Vol 50 (3) ◽  
pp. 251-254 ◽  
Author(s):  
GERARD JACOBS ◽  
NAFTALY ZIELIN ◽  
ABRAHAM H. HALEVY
Keyword(s):  
Sucrose Uptake ◽  
Single Node ◽  
Factors Affecting ◽  
Rose Flower

Enhancing network synchronizability by strengthening a single node

2019 ◽  
Vol 99 (4) ◽  
Author(s):  
Huawei Fan ◽  
Yafeng Wang ◽  
Kai Yang ◽  
Xingang Wang
Keyword(s):  
Single Node

scholarly journals BeTrust: A Dynamic Trust Model Based on Bayesian Inference and Tsallis Entropy for Medical Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yan Gao ◽  
Wenfen Liu
Keyword(s):  
Bayesian Inference ◽  
Sensor Networks ◽  
Rapid Development ◽  
Trust Model ◽  
Tsallis Entropy ◽  
Single Node ◽  
Trust Mechanism ◽  
Trust Value ◽  
Medical Sensor Networks ◽  
Definition Of

With the rapid development and application of medical sensor networks, the security has become a big challenge to be resolved. Trust mechanism as a method of “soft security” has been proposed to guarantee the network security. Trust models to compute the trustworthiness of single node and each path are constructed, respectively, in this paper. For the trust relationship between nodes, trust value in every interval is quantified based on Bayesian inference. A node estimates the parameters of prior distribution by using the collected recommendation information and obtains the posterior distribution combined with direct interactions. Further, the weights of trust values are allocated through using the ordered weighted vector twice and overall trust degree is represented. With the associated properties of Tsallis entropy, the definition of path Tsallis entropy is put forward, which can comprehensively measure the uncertainty of each path. Then a method to calculate the credibility of each path is derived. The simulation results show that the proposed models can correctly reflect the dynamic of node behavior, quickly identify the malicious attacks, and effectively avoid such path containing low-trust nodes so as to enhance the robustness.

A Single-Node Classifier Implementation on Chua Oscillator within a Physical Reservoir Computing Framework

2021 ◽  
Vol 31 (11) ◽  
pp. 2150161
Author(s):  
Uladzislau Sychou
Keyword(s):  
Computer Simulation ◽  
Control Parameter ◽  
Chaotic Oscillator ◽  
Reservoir Computing ◽  
Single Node ◽  
Short Pulses ◽  
Chaotic Mode ◽  
Computing Framework ◽  
Chua Oscillator

The study lies in the field of physical reservoir computing and aims to develop a classifier using Fisher Iris dataset for benchmark tasks. Single Chua chaotic oscillator acts as a physical reservoir. The study was performed using computer simulation. The features of Iris flowers are represented as the consequence of short pulses at a constant level of a control parameter, which is fed to the oscillator, changing its dynamics. During the classification of flowers, the oscillator works without being reset, so each pulse on the input changes the phase trajectory and makes it unique for each Iris flower. Finally, the estimation of the symmetry of an attractor makes it possible to connect each species of Iris with the properties of the attractor. The resulting architecture of the classifier includes a single-node externally-driven Chua oscillator with time-delayed input. The classifier shows two mistakes in classifying the dataset with 75 samples working in chaotic mode.

Sign in / Sign up

Export Citation Format

Share Document