Weighted complex networks, especially scale-free networks, which characterize real-life systems better than non-weighted networks, have attracted considerable interest in recent years. Studies on the multifractality o...
详细信息
Weighted complex networks, especially scale-free networks, which characterize real-life systems better than non-weighted networks, have attracted considerable interest in recent years. Studies on the multifractality of weighted complex networks are still to be undertaken. In this paper, inspired by the concepts of Koch networks and Koch island, we propose a new family of weighted Koch networks, and investigate their multifractal behavior and topological properties. We find some key topological properties of the new networks: their vertex cumulative strength has a power-law distribution; there is a power-law relationship between their topological degree and weight strength; the networks have a high weighted clustering coefficient of 0.41004 (which is independent of the scaling factor c ) in the limit of large generation t ; the second smallest eigenvalue μ 2 and the maximum eigenvalue μ n are approximated by quartic polynomials of the scaling factor c for the general Laplacian operator, while μ 2 is approximately a quartic polynomial of c and μ n = 1.5 for the normalized Laplacian operator. Then, we find that weighted koch networks are both fractal and multifractal, their fractal dimension is influenced by the scaling factor c . We also apply these analyses to six real-world networks, and find that the multifractality in three of them are strong.
A non-fragile H controller design approach is studied in this paper for a class of system. The purpose is design a suitable non-fragile controller satisfied that the induced L∞ gain from disturbance signal to output ...
详细信息
DTNs overcome the problems associated with intermittent connectivity, long or variable delay, asymmetric data rates, and high error rates by using store-carry-forward message switching. In DTNs, a node is an entity wi...
详细信息
DTNs overcome the problems associated with intermittent connectivity, long or variable delay, asymmetric data rates, and high error rates by using store-carry-forward message switching. In DTNs, a node is an entity with a bundle layer. A node may be a host, router, or gateway(or some combination)acting as a source, destination, or forwarder of bundles. In addition, the performance of node shows great differences. However,the previous DTN routings show blindly and randomly, which do not measure the performance of node when they forward messages. To deal with this issue, we present the concept of Node Connection Intensity(NCI) and Node Connection Stability(NCS), then propose a routing scheme based on Spray-and-Wait and Connecting-Capability of Node(SW-CCN), which evaluate relay node's forward capability synthetically according to the NCI and the NCS. The SW-CCN routing can allocate message replications dynamically and solve the problem of selecting the relay node blindly. Compared with the classical routing protocols, the simulation results show that the proposed algorithm can significantly enhance delivery rate and improve network performance.
Using a quantum-corrected model, the optical cross section of a strongly coupled metallic nanowire dimer for variable separation widths of the junction between the nanowires is analysed by finite-different time-domain...
详细信息
ISBN:
(纸本)9781509060948
Using a quantum-corrected model, the optical cross section of a strongly coupled metallic nanowire dimer for variable separation widths of the junction between the nanowires is analysed by finite-different time-domain method. Numerical results show the classical electrodynamics fails to describe the coupling across sub-nanometer gaps, owing to non-local screening and the spill-out of electrons, where quantum effects become important. The quantum-corrected model approach models the junction between adjacent nanoparticles by means of a local dielectric response that includes electron tunnelling and tunnelling resistivity at the gap. The quantum-corrected model predicts optical properties in excellent agreement with fully quantum mechanical calculations for small interacting systems, opening a new venue for addressing quantum effects in realistic plasmonic systems.
In order to calculate the lost phase from the intensity information effectively,a new method of phase retrieval which based on cosine grating modulation and transport of intensity equation is proposed
In order to calculate the lost phase from the intensity information effectively,a new method of phase retrieval which based on cosine grating modulation and transport of intensity equation is proposed
A new compact 30 : 1 bandwidth ratio balun and its application to balanced antennas are presented in this paper. To realize the balun-type function, two different types of wideband transition structures are adopted fo...
详细信息
There has been a growing interest in visualization of metagenomic data. The present study focuses on the visualization of metagenomic data using inter-nucleotide distances profile. We first convert the fragment sequen...
详细信息
There has been a growing interest in visualization of metagenomic data. The present study focuses on the visualization of metagenomic data using inter-nucleotide distances profile. We first convert the fragment sequences into inter-nucleotide distances profiles. Then we analyze these profiles by principal component analysis. Finally the principal components are used to obtain the 2-D scattered plot according to their source of species. We name our method as inter-nucleotide distances profiles (INP) method. Our method is evaluated on three benchmark data sets used in previous published papers. Our results demonstrate that the INP method is good, alternative and efficient for visualization of metagenomic data.
This paper studies the problem of how to choose the viewpoint for taking good photographs for architecture. We achieve this by learning from professional photographs of world famous landmarks that are available in the...
详细信息
Large-scale service composition has become an important research topic in Service-Oriented computing(SOC). Quality of Service(Qo S) has been mostly applied to represent nonfunctional properties of web services and...
详细信息
Large-scale service composition has become an important research topic in Service-Oriented computing(SOC). Quality of Service(Qo S) has been mostly applied to represent nonfunctional properties of web services and to differentiate those with the same functionality. Many studies for measuring service composition in terms of Qo S have been completed. Among current popular optimization methods for service composition, the exhaustion method has some disadvantages such as requiring a large number of calculations and poor scalability. Similarly,the traditional evolutionary computation method has defects such as exhibiting slow convergence speed and falling easily into the local optimum. In order to solve these problems, an improved optimization algorithm, WS FOA(Web Service composition based on Fruit Fly Optimization Algorithm) for service composition, was proposed, on the basis of the modeling of service composition and the FOA. Simulated experiments demonstrated that the algorithm is effective, feasible, stable, and possesses good global searching ability.
In the era of big data, data intensive applications have posed new challenges to the field of service composition. How to select the optimal composited service from thousands of functionally equivalent services but di...
详细信息
In the era of big data, data intensive applications have posed new challenges to the field of service composition. How to select the optimal composited service from thousands of functionally equivalent services but different Quality of Service(Qo S) attributes has become a hot research in service computing. As a consequence,in this paper, we propose a novel algorithm MR-IDPSO(Map Reduce based on Improved Discrete Particle Swarm Optimization), which makes use of the improved discrete Particle Swarm Optimization(PSO) with the Map Reduce to solve large-scale dynamic service composition. Experiments show that our algorithm outperforms the parallel genetic algorithm in terms of solution quality and is efficient for large-scale dynamic service composition. In addition,the experimental results also demonstrate that the performance of MR-IDPSO becomes more better with increasing number of candidate services.
暂无评论