Pascal triangles are formulated for computing the coefficients of the B-spline series representation of the compactly supported spline-wavelets with minimum support and their derivatives.It is shown that with the al- ...Pascal triangles are formulated for computing the coefficients of the B-spline series representation of the compactly supported spline-wavelets with minimum support and their derivatives.It is shown that with the al- ternating signs removed,all these sequences are totally positive.On the other hand,truncations of the recipro- cal Euler-Frobenius polynomials lead to finite sequences for orthogonal wavelet decompositions.For this pur- pose,sharp estimates are given in terms of the exact reconstruction of these approximate decomposed compo- nents.展开更多
Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Intern...Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.展开更多
基金Research supported by NSF Grant DMS 89-0-01345 and ARO Contract No.DAAL 03-90-G-0091.
文摘Pascal triangles are formulated for computing the coefficients of the B-spline series representation of the compactly supported spline-wavelets with minimum support and their derivatives.It is shown that with the al- ternating signs removed,all these sequences are totally positive.On the other hand,truncations of the recipro- cal Euler-Frobenius polynomials lead to finite sequences for orthogonal wavelet decompositions.For this pur- pose,sharp estimates are given in terms of the exact reconstruction of these approximate decomposed compo- nents.
基金supported by the National Key Research and Development of China under Grant 2018YFC1314903the National Natural Science Foundation of China under Grant 61372124 and Grant 61427801
文摘Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.
