Background With the rapid development of Web3D technologies, the online Web3D visualization, particularly for complex models or scenes, has been in a great demand. Owing to the major conflict between the Web3D system ...Background With the rapid development of Web3D technologies, the online Web3D visualization, particularly for complex models or scenes, has been in a great demand. Owing to the major conflict between the Web3D system load and resource consumption in the processing of these huge models, the huge 3D model lightweighting methods for online Web3D visualization are reviewed in this paper. Methods By observing the geometry redundancy introduced by man-made operations in the modeling procedure, several categories of light-weighting related work that aim at reducing the amount of data and resource consumption are elaborated for Web3D visualization. Results By comparing perspectives, the characteristics of each method are summarized, and among the reviewed methods, the geometric redundancy removal that achieves the lightweight goal by detecting and removing the repeated components is an appropriate method for current online Web3D visualization. Meanwhile, the learning algorithm, still in improvement period at present, is our expected future research topic. Conclusions Various aspects should be considered in an efficient lightweight method for online Web3D visualization, such as characteristics of original data, combination or extension of existing methods, scheduling strategy, cache man-agement, and rendering mechanism. Meanwhile, innovation methods, particularly the learning algorithm, are worth exploring.展开更多
By using small function method, the following result is obtained. If f（z） is transcendental meromorphic and that ψ（z） is non-zero meromorphic and that T（r,ψ） = S（r, f）, then（n＋1）T（r,f）≤N^-（r,1/f＇f^n...By using small function method, the following result is obtained. If f（z） is transcendental meromorphic and that ψ（z） is non-zero meromorphic and that T（r,ψ） = S（r, f）, then（n＋1）T（r,f）≤N^-（r,1/f＇f^n-ψ）＋2N^-（r,1/f）＋N^-（r,f）＋S（r,f）.展开更多
The degree pattern of a finite group G associated with its prime graph has been introduced by Moghaddamfar in 2005 and it is proved that the following simple groups are uniquely determined by their order and degree pa...The degree pattern of a finite group G associated with its prime graph has been introduced by Moghaddamfar in 2005 and it is proved that the following simple groups are uniquely determined by their order and degree patterns： All sporadic simple groups, the alternating groups Ap （p ≤ 5 is a twin prime） and some simple groups of the Lie type. In this paper, the authors continue this investigation. In particular, the authors show that the symmetric groups Sp＋3, where p ＋ 2 is a composite number and p ＋ 4 is a prime and 97 〈 p ∈π（1000!）, are 3-fold OD-characterizable. The authors also show that the alternating groups All6 and A134 are OD-characterizable. It is worth mentioning that the latter not only generalizes the results by Hoseini in 2010 but also gives a positive answer to a conjecture by Moghaddamfar in 2009.展开更多
In cellular networks, users communicate with each other through their respective base stations（BSs）.Conventionally, users are assumed to be in different cells. BSs serve as decode-and-forward（DF） relay nodes to us...In cellular networks, users communicate with each other through their respective base stations（BSs）.Conventionally, users are assumed to be in different cells. BSs serve as decode-and-forward（DF） relay nodes to users.In addition to this type of conventional user, we recognize that there are scenarios users who want to communicate with each other are located in the same cell. This gives rise to the scenario of intra-cell communication. In this case, a BS can behave as a two-way relay to achieve information exchange instead of using conventional DF relay.We consider a multi-cell orthogonal frequency division multiple access（OFDMA） network that comprises these two types of users. We are interested in resource allocation between them. Specifically, we jointly optimize subcarrier assignment, subcarrier pairing, and power allocation to maximize the weighted sum rate. We consider the resource allocation problem at BSs when the end users＇ power is fixed. We solve the problem approximately through Lagrange dual decomposition. Simulation results show that the proposed schemes outperform other existing schemes.展开更多
Let H^2(γ) be the Hilbert space over the bidisk D^2 generated by a positive sequence γ={γnm}n,m≥0. In this paper, we prove that the Beurling type theorem holds for the shift operator on H^2(γ) with γ={γnm}n,m≥...Let H^2(γ) be the Hilbert space over the bidisk D^2 generated by a positive sequence γ={γnm}n,m≥0. In this paper, we prove that the Beurling type theorem holds for the shift operator on H^2(γ) with γ={γnm}n,m≥0 satisfying certain series of inequalities. As a corollary, we give several applications to a class of classical analytic reproducing kernel Hilbert spaces over the bidisk D^2.展开更多
文摘Background With the rapid development of Web3D technologies, the online Web3D visualization, particularly for complex models or scenes, has been in a great demand. Owing to the major conflict between the Web3D system load and resource consumption in the processing of these huge models, the huge 3D model lightweighting methods for online Web3D visualization are reviewed in this paper. Methods By observing the geometry redundancy introduced by man-made operations in the modeling procedure, several categories of light-weighting related work that aim at reducing the amount of data and resource consumption are elaborated for Web3D visualization. Results By comparing perspectives, the characteristics of each method are summarized, and among the reviewed methods, the geometric redundancy removal that achieves the lightweight goal by detecting and removing the repeated components is an appropriate method for current online Web3D visualization. Meanwhile, the learning algorithm, still in improvement period at present, is our expected future research topic. Conclusions Various aspects should be considered in an efficient lightweight method for online Web3D visualization, such as characteristics of original data, combination or extension of existing methods, scheduling strategy, cache man-agement, and rendering mechanism. Meanwhile, innovation methods, particularly the learning algorithm, are worth exploring.
基金Supported by the Nature Science foundation of Henan Province(0211050200)
文摘By using small function method, the following result is obtained. If f（z） is transcendental meromorphic and that ψ（z） is non-zero meromorphic and that T（r,ψ） = S（r, f）, then（n＋1）T（r,f）≤N^-（r,1/f＇f^n-ψ）＋2N^-（r,1/f）＋N^-（r,f）＋S（r,f）.
基金the National Natural Science Foundation of China(Nos.11271301,11171364)the National Science Foundation for Distinguished Young Scholars of China(No.11001226)+2 种基金the Fundamental Research Funds for the Central Universities(Nos.XDJK2012D004,XDJK2009C074)the Natural Science Foundation Project of CQ CSTC(Nos.2011jjA00020,2010BB9206)the GraduateInnovation Funds of Science of Southwest University(No.ky2009013)
文摘The degree pattern of a finite group G associated with its prime graph has been introduced by Moghaddamfar in 2005 and it is proved that the following simple groups are uniquely determined by their order and degree patterns： All sporadic simple groups, the alternating groups Ap （p ≤ 5 is a twin prime） and some simple groups of the Lie type. In this paper, the authors continue this investigation. In particular, the authors show that the symmetric groups Sp＋3, where p ＋ 2 is a composite number and p ＋ 4 is a prime and 97 〈 p ∈π（1000!）, are 3-fold OD-characterizable. The authors also show that the alternating groups All6 and A134 are OD-characterizable. It is worth mentioning that the latter not only generalizes the results by Hoseini in 2010 but also gives a positive answer to a conjecture by Moghaddamfar in 2009.
基金Project supported by the Natural Science Foundation of Shandong Province,China（No.ZR2012AQ015）
文摘In cellular networks, users communicate with each other through their respective base stations（BSs）.Conventionally, users are assumed to be in different cells. BSs serve as decode-and-forward（DF） relay nodes to users.In addition to this type of conventional user, we recognize that there are scenarios users who want to communicate with each other are located in the same cell. This gives rise to the scenario of intra-cell communication. In this case, a BS can behave as a two-way relay to achieve information exchange instead of using conventional DF relay.We consider a multi-cell orthogonal frequency division multiple access（OFDMA） network that comprises these two types of users. We are interested in resource allocation between them. Specifically, we jointly optimize subcarrier assignment, subcarrier pairing, and power allocation to maximize the weighted sum rate. We consider the resource allocation problem at BSs when the end users＇ power is fixed. We solve the problem approximately through Lagrange dual decomposition. Simulation results show that the proposed schemes outperform other existing schemes.
基金Supported by NSFC(Grant Nos.11271332 and 11431011)the Fundamental Research Funds for the Central UniversitiesNSFC(Grant No.11501249)
文摘Let H^2(γ) be the Hilbert space over the bidisk D^2 generated by a positive sequence γ={γnm}n,m≥0. In this paper, we prove that the Beurling type theorem holds for the shift operator on H^2(γ) with γ={γnm}n,m≥0 satisfying certain series of inequalities. As a corollary, we give several applications to a class of classical analytic reproducing kernel Hilbert spaces over the bidisk D^2.
