Ying Wang

Bio: Ying Wang is an academic researcher from Beijing University of Posts and Telecommunications. The author has contributed to research in topics: Resource allocation & Relay. The author has an hindex of 23, co-authored 295 publications receiving 2542 citations. Previous affiliations of Ying Wang include Peking University & University of Macau.

A vision from the future: beyond 3G TDD

Abstract: This article introduces the visions and developments of Beyond 3G mobile communications in the China TDD Special Work Group. System structure, radio transmission design, radio resource management, and demonstration system implementation are covered. In system structure, the concept of group cell and the architecture of distributed antennas are introduced. The radio link transmission design presented in this article includes the radio frame structure, multiple access scheme, and promising key techniques. Link-level simulations prove the advantages of the design. The radio resource management strategies are introduced to optimize the system performance. The B3G TDD demonstration system being built by the TDD Special Work Group is also shown finally.

A Data-Driven Architecture for Personalized QoE Management in 5G Wireless Networks

Abstract: With the emergence of a variety of new wireless network types, business types, and QoS in a more autonomic, diverse, and interactive manner, it is envisioned that a new era of personalized services has arrived, which emphasizes users' requirements and service experiences. As a result, users' QoE will become one of the key features in 5G/future networks. In this article, we first review the state of the art of QoE research from several perspectives, including definition, influencing factors, assessment methods, QoE models, and control methods. Then a data-driven architecture for enhancing personalized QoE is proposed for 5G networks. Under this architecture, we specifically propose a two-step QoE modeling approach to capture the strength of the relationship between users and services. Thereafter, the preferences of a user is introduced to model the user's subjectivity toward a specific service. With the comprehension of users' preferences, radio resources can be distributed more precisely. Simulation results show that overall QoE can be enhanced by 20 percent, while 96 percent of users have an improved QoE, which validates the efficiency of the proposed architecture.

A novel design for content delivery over software defined mobile social networks

Abstract: With the rapid development of mobile communication technologies, various kinds of content can be delivered among mobile users for content sharing Due to the complexity of networks and particular features of mobile behaviors, to manage networks efficiently, SDMSNs are advocated where the control plane and data plane can work separately but cooperatively In this article we outline how to deliver mobile content over SDMSNs We first design the flow table based on the social features including social tie, mobility, and community Then a novel social switch is introduced to deliver content among mobile users by using the proposed social degree and social stay time In addition, the process of content delivery is presented according to different scenarios, and extensive experiments are given to prove the efficiency of this approach

Wireless Network Virtualization With SDN and C-RAN for 5G Networks: Requirements, Opportunities, and Challenges

Abstract: Wireless network virtualization (WNV) has drawn attention from the researchers ranging from academia to industry as one of the significant technologies in the cellular network communication. It is considered as a pioneer to achieve effective resource utilization with decreased operating expenses and capital expenses by decoupling the networks functionalities of coexisting virtual networks. It facilitates fast deployment of new services and novel technologies. WNV paradigm is in the early stages, and there is a large room for the research community to develop new architectures, systems, and applications. The availability of software-defined networking (SDN) and cloud/centralized radio access network (C-RAN) steers up the hope for the WNV realization. This paper surveys WNV along with the recent developments in SDN and C-RAN technologies. Based on these technologies and WNV concepts, we identify the requirements and opportunities of future cellular networks. We then propose a general architectural framework for the WNV based on SDN. In-depth discussion of challenges and research issues as well as promising approaches for future networks communication improvements are also proposed. Finally, we give several promising candidates of future network services for residential customers and business customers.

Resource Allocation for Intelligent Reflecting Surface Aided Vehicular Communications

Abstract: This article studies the resource allocation for intelligent reflecting surface aided vehicular communications based on slowly varying large-scale fading channel information. To meet different quality-of-service (QoS) requirements of vehicular communications, we aim to maximize the sum vehicle-to-infrastructure (V2I) link capacity while guaranteeing the minimum signal-to-interference-plus-noise ratio (SINR) of vehicle-to-vehicle (V2V) links. More specifically, the power allocation, IRS reflection coefficients and spectrum allocation are jointly optimized. To tackle the formulated mixed integer non-convex problem, we divide it into two stages, which yields an alternating optimization algorithm. Simulation results demonstrate the effectiveness of the proposed algorithm and the IRS can significantly improve the quality of vehicular communications in terms of the sum V2I capacity.

Table Of Integrals Series And Products

Abstract: Thank you very much for downloading table of integrals series and products. Maybe you have knowledge that, people have look hundreds times for their chosen books like this table of integrals series and products, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their laptop. table of integrals series and products is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the table of integrals series and products is universally compatible with any devices to read.

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

Abstract: Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index

Convergence of probability measures

Abstract: The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an