Linear transceiver designs are investigated for distributed two-way relaying networks,which aim at minimising the WeightedMean Square Error(WMSE) of data detections.The forwarding matrices at relays andequalization ma...Linear transceiver designs are investigated for distributed two-way relaying networks,which aim at minimising the WeightedMean Square Error(WMSE) of data detections.The forwarding matrices at relays andequalization matrices at destinations are jointly optimised.To overcome the challenginglimitations introduced by individual powerconstraints,a Semi-Definite Relaxation(SDR)called element-wise relaxation is proposed,which can transform the original optimizationproblem into a standard convex optimizationproblem.In this research,two-way relaying isunderstood from a pure signal processing perspective which can potentially simplify thetheoretical analysis.Finally,simulation resultsare used for assessing the performance advantage of the proposed algorithm.展开更多
Efficiency and scalability are still the bottleneck for secure multi-party computation geometry (SMCG). In this work a secure planar convex hull (SPCH) protocol for large-scaled point sets in semi-honest model has...Efficiency and scalability are still the bottleneck for secure multi-party computation geometry (SMCG). In this work a secure planar convex hull (SPCH) protocol for large-scaled point sets in semi-honest model has been proposed efficiently to solve the above problems. Firstly, a novel priva- cy-preserving point-inclusion (PPPI) protocol is designed based on the classic homomorphic encryp- tion and secure cross product protocol, and it is demonstrated that the complexity of PPPI protocol is independent of the vertex size of the input convex hull. And then on the basis of the novel PPPI pro- tocol, an effective SPCH protocol is presented. Analysis shows that this SPCH protocol has a good performance for large-scaled point sets compared with previous solutions. Moreover, analysis finds that the complexity of our SPCH protocol relies on the size of the points on the outermost layer of the input point sets only.展开更多
Property AUB is the notion in metric geometry which has applications in higher index problems.In this paper,the permanence property of property AUB of metric spaces under large scale decompositions of finite depth is ...Property AUB is the notion in metric geometry which has applications in higher index problems.In this paper,the permanence property of property AUB of metric spaces under large scale decompositions of finite depth is proved.展开更多
In this study,an explicit adaptive traffic allocation scheme for Machine-to-Machine(M2M)service is proposed to achieve optimum distribution in heterogeneous networks.Based on the characteristics of M2M services,the pr...In this study,an explicit adaptive traffic allocation scheme for Machine-to-Machine(M2M)service is proposed to achieve optimum distribution in heterogeneous networks.Based on the characteristics of M2M services,the presented scheme is formulated as a convex optimization problem that maximises the utility of the M2M service,and then determines how to allocate the total rate among the multiple access networks.The analysis and numerical simulations indicate that the proposed scheme makes a significant improvement in performance compared with the traditional schemes.展开更多
For a continuous domain D, some characterization that the convex powerdomain CD is adomain hull of Max(CD) is given in terms of compact subsets of D. And in this case, it isproved that the set of the maximal points Ma...For a continuous domain D, some characterization that the convex powerdomain CD is adomain hull of Max(CD) is given in terms of compact subsets of D. And in this case, it isproved that the set of the maximal points Max(CD) of CD with the relative Scott topology ishomeomorphic to the set of all Scott compact subsets of Max(D) with the topology induced bythe Hausdorff metric derived from a metric on Max(D) when Max(D) is metrizable.展开更多
Let E be a real Banach space and K be a nonempty closed convex and bounded subset of E. Let Ti : K→ K, i=1, 2,... ,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε^(i)n} and as...Let E be a real Banach space and K be a nonempty closed convex and bounded subset of E. Let Ti : K→ K, i=1, 2,... ,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε^(i)n} and asymptotically pseudocontractive mappings with sequences {κ^(i)n}, where {κ^(i)n} and {ε^(i)n}, i = 1, 2,... ,N, satisfy certain mild conditions. Let a sequence {xn} be generated from x1 ∈ K by zn:= (1-μn)xn+μnT^nnxn, xn+1 := λnθnx1+ [1 - λn(1 + θn)]xn + λnT^nnzn for all integer n ≥ 1, where Tn = Tn(mod N), and {λn}, {θn} and {μn} are three real sequences in [0, 1] satisfying appropriate conditions. Then ||xn- Tixn||→ 0 as n→∞ for each l ∈ {1, 2,..., N}. The results presented in this paper generalize and improve the corresponding results of Chidume and Zegeye, Reinermann, Rhoades and Schu.展开更多
This paper introduces some new generalizations of the concept of (~, p)-invexity for non- differentiable locally Lipschitz functions using the tools of Clarke subdifferential. These functions are used to derive the ...This paper introduces some new generalizations of the concept of (~, p)-invexity for non- differentiable locally Lipschitz functions using the tools of Clarke subdifferential. These functions are used to derive the necessary and sufficient optimality conditions for a class of nonsmooth semi-infinite minmax programming problems, where set of restrictions are indexed in a compact set. Utilizing the sufficient optimality conditions, the authors formulate three types of dual models and establish weak and strong duality results. The results of the paper extend and unify naturally some earlier results from the literature.展开更多
基金supported in part by EricssonNational Science and Technology Major Project under Grant No.2010ZX03003-003-03+2 种基金Sino-Swedish IMT-Advanced and Beyond Cooperative Program under Grant No.2008DFA11780National Natural Science Foundation of China under Grant No.61101130the Excellent Young Scholar Research Funding of Beijing Institute of Technology under Grant No.2013CX04038
文摘Linear transceiver designs are investigated for distributed two-way relaying networks,which aim at minimising the WeightedMean Square Error(WMSE) of data detections.The forwarding matrices at relays andequalization matrices at destinations are jointly optimised.To overcome the challenginglimitations introduced by individual powerconstraints,a Semi-Definite Relaxation(SDR)called element-wise relaxation is proposed,which can transform the original optimizationproblem into a standard convex optimizationproblem.In this research,two-way relaying isunderstood from a pure signal processing perspective which can potentially simplify thetheoretical analysis.Finally,simulation resultsare used for assessing the performance advantage of the proposed algorithm.
基金Supported by the Young Scientists Program of CUEB(No.2014XJQ016,00791462722337)National Natural Science Foundation of China(No.61302087)+1 种基金Young Scientific Research Starting Foundation of CUEBImprove Scientific Research Foundation of Beijing Education
文摘Efficiency and scalability are still the bottleneck for secure multi-party computation geometry (SMCG). In this work a secure planar convex hull (SPCH) protocol for large-scaled point sets in semi-honest model has been proposed efficiently to solve the above problems. Firstly, a novel priva- cy-preserving point-inclusion (PPPI) protocol is designed based on the classic homomorphic encryp- tion and secure cross product protocol, and it is demonstrated that the complexity of PPPI protocol is independent of the vertex size of the input convex hull. And then on the basis of the novel PPPI pro- tocol, an effective SPCH protocol is presented. Analysis shows that this SPCH protocol has a good performance for large-scaled point sets compared with previous solutions. Moreover, analysis finds that the complexity of our SPCH protocol relies on the size of the points on the outermost layer of the input point sets only.
基金National Natural Science Foundations of China(No.10901033,No.10971023)Shanghai Pujiang Project,China(No.08PJ1400600)+1 种基金Shanghai Shuguang Project,China(No.07SG38)the Fundamental Research Funds for the Central Universities of China
文摘Property AUB is the notion in metric geometry which has applications in higher index problems.In this paper,the permanence property of property AUB of metric spaces under large scale decompositions of finite depth is proved.
基金supported by the National Natural Science Foundation of Chinaunder Grant No.60971125the National Science and Technology Major Project of the Ministry of Science and Technology of Chinaunder Grant No.2012ZX03005-010the China Scholarship Council
文摘In this study,an explicit adaptive traffic allocation scheme for Machine-to-Machine(M2M)service is proposed to achieve optimum distribution in heterogeneous networks.Based on the characteristics of M2M services,the presented scheme is formulated as a convex optimization problem that maximises the utility of the M2M service,and then determines how to allocate the total rate among the multiple access networks.The analysis and numerical simulations indicate that the proposed scheme makes a significant improvement in performance compared with the traditional schemes.
基金Project supported by the National Natural Science Foundation of Chian(No.19831040),the Doctoral Programme Foundation of the Ministry of Education of China(No.2000061019)and the 973 Project by the Science Commission of China.
文摘For a continuous domain D, some characterization that the convex powerdomain CD is adomain hull of Max(CD) is given in terms of compact subsets of D. And in this case, it isproved that the set of the maximal points Max(CD) of CD with the relative Scott topology ishomeomorphic to the set of all Scott compact subsets of Max(D) with the topology induced bythe Hausdorff metric derived from a metric on Max(D) when Max(D) is metrizable.
基金Foundation item: the National Natural Science Foundation of China (No. 10771141) the Natural Science Foundation of Zhejiang Province (Y605191) the Natural Science Foundation of Heilongjiang Province (No. A0211) and the Scientific Research Foundation from Zhejiang Province Education Committee (No. 20051897).
文摘Let E be a real Banach space and K be a nonempty closed convex and bounded subset of E. Let Ti : K→ K, i=1, 2,... ,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε^(i)n} and asymptotically pseudocontractive mappings with sequences {κ^(i)n}, where {κ^(i)n} and {ε^(i)n}, i = 1, 2,... ,N, satisfy certain mild conditions. Let a sequence {xn} be generated from x1 ∈ K by zn:= (1-μn)xn+μnT^nnxn, xn+1 := λnθnx1+ [1 - λn(1 + θn)]xn + λnT^nnzn for all integer n ≥ 1, where Tn = Tn(mod N), and {λn}, {θn} and {μn} are three real sequences in [0, 1] satisfying appropriate conditions. Then ||xn- Tixn||→ 0 as n→∞ for each l ∈ {1, 2,..., N}. The results presented in this paper generalize and improve the corresponding results of Chidume and Zegeye, Reinermann, Rhoades and Schu.
基金supported by the National Board of Higher Mathematics(NBHM)Department of Atomic Energy,India,under Grant No.2/40(12)/2014/R&D-II/10054
文摘This paper introduces some new generalizations of the concept of (~, p)-invexity for non- differentiable locally Lipschitz functions using the tools of Clarke subdifferential. These functions are used to derive the necessary and sufficient optimality conditions for a class of nonsmooth semi-infinite minmax programming problems, where set of restrictions are indexed in a compact set. Utilizing the sufficient optimality conditions, the authors formulate three types of dual models and establish weak and strong duality results. The results of the paper extend and unify naturally some earlier results from the literature.