The dodecacode is a nonlinear additive quaternary code of length 12. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance 5. In particular, this latter code is completely re...
详细信息
In recent years, along with the development of technologies for distributed computing such as big data and clouds workflow systems, efficiency of workflow scheduling has become very impotent. Hence sc
In recent years, along with the development of technologies for distributed computing such as big data and clouds workflow systems, efficiency of workflow scheduling has become very impotent. Hence sc
A novel cross-layer joint relay selection and power allocation (CL-JRSPA) scheme over physical layer and data-link layer is proposed for cooperative relaying system in this paper. Our goal is finding the optimal relay...
A novel cross-layer joint relay selection and power allocation (CL-JRSPA) scheme over physical layer and data-link layer is proposed for cooperative relaying system in this paper. Our goal is finding the optimal relay selection and power allocation scheme to maximize system achievable rate when satisfying total transmit power constraint in physical layer and statistical delay quality-of-service (QoS) demand in data-link layer. Using the concept of effective capacity (EC), our goal can be formulated into an optimal joint relay selection and power allocation (JRSPA) problem to maximize the EC when satisfying total transmit power limitation. We first solving optimal power allocation (PA) problem with Lagrange multiplier approach, and then solving optimal relay selection (RS) problem. Simulation results demonstrate that CL-JRSPA scheme gets larger EC than other schemes when satisfying delay QoS demand. In addition, the proposed CL-JRSPA scheme achieves the maximal EC when relay located approximately halfway between source and destination, and EC becomes smaller when the QoS exponent becomes larger.
The aim of this paper is to put forward a novel measurement of uncertain information to dispose of multiple attribute group decision making (MAGDM) based on interval type-2 cross-entropy. Firstly, some basic concepts ...
详细信息
ISBN:
(纸本)9781538629024
The aim of this paper is to put forward a novel measurement of uncertain information to dispose of multiple attribute group decision making (MAGDM) based on interval type-2 cross-entropy. Firstly, some basic concepts and a ranking value formula to calculate the ranking value of interval type-2 fuzzy sets (IT2FSs) is briefly introduced. Meanwhile, a novel measurement based on interval type-2 cross-entropy to measure the uncertainty of the IT2FSs is investigated, the advantage of measurment can be interpreted as it not only considers the uncertainty of the element itself, but also considers the uncertainty caused by other elements. By using the measurement which has proposed, a method was presented to determine attribute weights based on the principle of minimization. Moreover, a decision making procedure based on measurement value is given to select the best alternative(s). Lastly, we apply the proposed decision making procedure based on measurement value to a simple practical example, which can illustrate the practicality and effectiveness.
SUMMARY:A number of alignment-free methods have been proposed for phylogeny reconstruction over the past two decades. But there are some long-standing challenges in these methods, including requirement of huge compute...
SUMMARY:A number of alignment-free methods have been proposed for phylogeny reconstruction over the past two decades. But there are some long-standing challenges in these methods, including requirement of huge computer memory and CPU time, and existence of duplicate computations. In this article, we address these challenges with the idea of compressed vector, fingerprint and scalable memory management. With these ideas we developed the DLTree algorithm for efficient implementation of the dynamical language model and whole genome-based phylogenetic analysis. The DLTree algorithm was compared with other alignment-free tools, demonstrating that it is more efficient and accurate for phylogeny reconstruction.
AVAILABILITY AND IMPLEMENTATION:The DLTree algorithm is freely available at http://***.
CONTACT:yuzuguo@*** or yangjy@***.
SUPPLEMENTARY INFORMATION:Supplementary data are available at Bioinformatics online.
We initially derive an asymptotic expansion and a high accuracy combination formula of the derivatives in the sense of pointwise for the isoparametric bilinear finite volume element scheme by employing the energy-embe...
详细信息
We initially derive an asymptotic expansion and a high accuracy combination formula of the derivatives in the sense of pointwise for the isoparametric bilinear finite volume element scheme by employing the energy-embedded method on some non-uniform grids. Furthermore, we prove that the approximate derivatives are convergent of order two. Numerical examples confirm theoretical results.
Battery consistency is an important factor for battery pack performance. Excellent battery consistency can make battery packs more energy efficient and electric vehicles can have longer mileage and higher safety. Thus...
Battery consistency is an important factor for battery pack performance. Excellent battery consistency can make battery packs more energy efficient and electric vehicles can have longer mileage and higher safety. Thus, in this study a comprehensive intelligent clustering methodology for the design of Li-ion battery pack on the basis of uniformity and equalization criteria of the cell was proposed. Firstly, multiple parameters (capacity, voltage, temperature and resistance) test of single cell performance was performed. Secondly, a clustering method combine with self-organizing map neural network (SOM) was proposed. Furthermore, a validation experiment (pack level) was carried out to verify the accuracy of proposed clustering algorithm. It can be concluded that the battery pack formed from SOM sorting results perform better than the battery pack having random cells combination as well as the pack originally purchased from the manufacturer.
The interaction between electromagnetic field and plasmonic nanostructures leads to both strong linear and nonlinear behaviors. In this paper, a time-domain hydrodynamic model for describing the motion of electrons in...
详细信息
Graphene is an ideal 2D material system bridging electronic and photonic devices. It also breaks the fundamental speed and size limits by electronics and photonics, respectively. Graphene offers multiple functions of ...
详细信息
Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these prope...
Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.
暂无评论