检索结果-南通市图书馆

Neighborhood-following algorithms for linear programming

在线全文

学校读者我要写书评

暂无评论

science china Mathematics 2004年第6期47卷 812-820页

作者： Al WenbaoSchool of science, beijing university of posts and telecommunications, beijing 100876, china 1. School of science Beijing University of Posts and Telecommunications 100876 Beijing China

In this paper, we present neighborhood-following algorithms for linear programming. When the neighborhood is a wide neighborhood, our algorithms are wide neighborhood primal-dual interior point algorithms. If the neighborhood degenerates into the central path, our algorithms also degenerate into path-following algorithms. We prove that our algorithms maintain the O9√nL) -iteration complexity still, while the classical wide neighborhood primal-dual interior point algorithms have only the O(nL-iteration complexity. We also proved that the algorithms are quadratic convergence if the optimal vertex is nondegenerate. Finally, we show some computational results of our algorithms.

关键词： linear programming primal-dual interior point methods wide neighborhood methods quadratic convergence

STABILITY OF GENERALIZED JACKSON NETWORKS WITH INFINITE SUPPLY OF WORK

在线全文

学校读者我要写书评

暂无评论

Journal of Systems science & Complexity 2008年第2期21卷 283-295页

作者： Yongjiang GUO School of science Beijing University of Posts and Telecommunications Beijing 100876 China

A general Jackson network （GJN） with infinite supply of work is considered. By fluid limit model, the author finds that the Markov process describing the dynamics of the GJN with infinite supply of work is positive Harris recurrent if the corresponding fluid model is stable. Furthermore, the author proves that the fluid model is stable if the usual traffic condition holds.

关键词： Fluid limit model general Jackson network (GJN) infinite supply positive Harris recurrent stability.

TWO-AGENT PARETO OPTIMAL COOPERATIVE INVESTMENT IN INCOMPLETE MARKET:AN EQUIVALENT CHARACTERIZATION

在线全文

学校读者我要写书评

暂无评论

Journal of Systems science & Complexity 2011年第4期24卷 701-710页

作者： Qing ZHOU School of science Beijing University of Posts and Telecommunications Beijing 100876 China.

This paper studies the following cooperative investment game with two agents. At the start of the game, both the agents＇ capital are collected. The total capital are then invested according to a certain trading strategy. At a certain time To one agent quits the cooperation and they divide the wealth among themselves. During the remaining period [To, T], the other agent invests his/her capital following a possibly different trading strategy. By stochastic optimization method combined with the theory of Backward Stochastic Differential Equations （BSDEs, for short）, we give an equivalent characterization of the Pareto optimal cooperative strategies.

关键词： Backward stochastic differential equation cooperative investment incomplete market,Pareto optimum stochastic utility.

SVM-based loss differentiation algorithm for wired-cum-wireless networks

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2009年第4期16卷 104-111页

作者： DENG Qian-hua ,CAI An-ni School of Telecommunication Engineering,beijing university of posts and telecommunications,beijing 100876,china [a]School of Telecommunication Engineering beijing university of posts and telecommunications beijing 100876 china

In a hybrid wired-cum-wireless network environment, packet loss may happen because of congestion or wireless link errors. Therefore, differentiating the cause is important for helping transport protocols take actions to control congestion only when the loss is caused by congestion. In this article, an end-to-end loss differentiation mechanism is proposed to improve the transmission performance of transmission control protocol （TCP）-friendly rate control （TFRC） protocol. Its key design is the introduction of the outstanding machine learning algorithm - the support vector machine （SVM） into the network domain to perform multi-metric joint loss differentiation. The SVM is characterized by using end-to-end indicators for input, such as the relative one-way trip time and the inter-arrival time of packets fore-and-aft the loss, while requiring no support from intermediate network apparatus. Simulations are carried out to evaluate the loss differentiation algorithm with various network configurations, such as with different competing flows, wireless loss rate and queue size. The results show that the proposed classifier is effective under most scenarios, and that its performance is superior to the ZigZag, mBiaz and spike （ZBS） scheme.

关键词： machine learning SVM TCP-friendly rate control (TFRC) congestion control

Robust multiuser MIMO scheduling algorithms with imperfect CSI

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第4期55卷 815-826页

作者： MAO JunLing 1,3,GAO JinChun 1,3,LIU YuanAn 1,3,XIE Gang 2,3 & ZHANG Jian 1,3 1 School of Electronic Engineering,beijing university of posts and telecommunications,beijing 100876,china 2 School of Information and Communication Engineering,beijing university of posts and telecommunications,beijing 100876,china 3 Key Lab of Universal Wireless Communications,Ministry of Education,beijing university of posts and telecommunications,beijing 100876,china 1. School of Electronic Engineering Beijing University of Posts and Telecommunications Beijing 100876 China3. Key Lab of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing 100876 China2. School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing 100876 China

Robust multiuser multiple-input-multiple-output (MIMO) scheduling algorithms are proposed in this *** imperfect channel state information (CSI),traditional scheduling algorithms for the multiuser MIMO system based on the zero forcing precoding scheme will lose some performance due to the multi-user interference (MUI).In order to improve the system average throughput,we study the robust multiuser MIMO scheduling problem with imperfect *** the average capacity formula,we derive a robust factor which can transform the robust multiuser MIMO scheduling problem into the traditional one,thus most existing non-robust scheduling algorithms can be robust if this factor is *** results show that compared with the traditional algorithms,the proposed robust algorithms can improve the system average throughput significantly under the CSI error environment.

关键词： multiuser MIMO (MU-MIMO) scheduling robust imperfect CSI

On the construction of multi-output Boolean functions with optimal algebraic immunity

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第7期55卷 1617-1623页

作者： ZHANG Jie 1,2 ,SONG ShouChao 1 ,DU Jiao 2,3 & WEN QiaoYan 2 1 School of science,beijing university of posts and telecommunications,beijing 100876,china 2 State Key Laboratory of Networking and Switching Technology,beijing university of posts and telecommunications,beijing 100876,china 3 Department of Mathematics,Xinxiang university,Xinxiang 453003,china 1. School of science Beijing University of Posts and Telecommunications Beijing 100876 China2. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China3. Department of Mathematics Xinxiang University Xinxiang 453003 China

In this paper,we show a construction of multi-output Boolean functions with optimal algebraic ***,the relationship between the algebraic immunity of a multi-output Boolean function and those of its component functions is *** show that all the component functions,together with their nonzero linear combination,of the multi-output Boolean functions achieved by this construction have optimal algebraic immunity simultaneously.

关键词： algebraic immunity Boolean functions algebraic attacks annihilators

Generalized quantum state sharing of the arbitrary two particles state

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2010年第11期53卷 2064-2068页

作者： WANG Chuan 1,2,ZHANG Yong 1,2 & JIN GuangSheng 1,2 1 School of science,beijing university of posts and telecommunications,beijing 100876,china 2 Key Laboratory of Optical Communication and Lightwave Technologies,beijing university of posts and telecommunications,beijing 100876,china 1. School of science Beijing University of Posts and Telecommunications Beijing 100876 China2. Key Laboratory of Optical Communication and Lightwave Technologies Beijing University of Posts and Telecommunications Beijing 100876 China

This paper has proposed a generalized quantum state sharing protocol of an arbitrary two-particle state using non-maximally GHZ states and generalized Bell state *** sender Alice performs two-particle generalized Bell state measurements on her two particles in the state sharing process and the controller takes measurements on his particles and transfers the quantum information to the receiver with entanglement swapping by the cooperation of the other *** is found that the use of nonmaximally entangled state in quantum state sharing has enabled the secure sharing of the quantum state.

关键词： quantum state sharing quantum entanglement arbitrary two particles state

Search recommendation model based on user search behavior and gradual forgetting collaborative filtering strategy

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2010年第3期17卷 110-117页

作者： LIU Chuan-chang State Key Laboratory of Networking and Switching Technology, beijing university of posts and telecommunications, beijing 100876, china [a] State Key Laboratory of Networking Switching Technology Beijing University of Posts telecommunications Beijing 100876 China

The existing search engines are lack of the consideration of personalization and display the same search results for different users despite their differences in interesting and purpose. By analyzing user＇s dynamic search behavior, the paper introduces a new method of using a keyword query graph to express user＇s dynamic search behavior, and uses Bayesian network to construct the prior probability of keyword selection and the migration probability between keywords for each user. To reflect the dynamic changes of the user＇s preference, the paper introduces non-lineal gradual forgetting collaborative filtering strategy into the personalized search recommendation model. By calculating the similarity between each two users, the model can do the recommendation based on neighbors and be used to construct the personalized search engine.

关键词： search recommendation model search behavior expression keyword query graph gradual forgetting collaborative filtering

Novel limited feedback scheme under the MIMO broadcast system

在线全文

学校读者我要写书评

暂无评论

The Journal of china Universities of posts and telecommunications 2009年第6期16卷 11-16页

作者： CHENG Tie-zheng,YUAN Chao-wei School of Information and Communication Engineering,beijing university of posts and telecommunications,beijing 100876,china [a] School of Information and Communication Engineering beijing university of posts and telecommunications beijing 100876 china

By deducing the distribution of the normalized channel covariance matrix,a novel limited feedback scheme is proposed under multiple users（MU） multiple-input multiple-output（MIMO） broadcast channel（BC） *** proposed scheme has advantages in three ***,it has no constraints on the number of users or ***,each user＇s feedback bits are independent of the number of receiving ***,the proposed scheme avoids the storage of large-size codebook on the *** results show that the performance of the proposed scheme is close to the perfect channel state information（CSI） case and it just needs a small number of feedback bits.

关键词： MIMO broadcast channel limited feedback normalized channel covariance