There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

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

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

Driven by the visions of Internet of Things and 5G communications, recent years have seen a paradigm shift in mobile computing, from the centralized mobile cloud computing toward mobile edge computing (MEC). The main feature of MEC is to push mobile computing, network control and storage to the network edges (e.g., base stations and access points) so as to enable computation-intensive and latency-critical applications at the resource-limited mobile devices. MEC promises dramatic reduction in latency and mobile energy consumption, tackling the key challenges for materializing 5G vision. The promised gains of MEC have motivated extensive efforts in both academia and industry on developing the technology. A main thrust of MEC research is to seamlessly merge the two disciplines of wireless communications and mobile computing, resulting in a wide-range of new designs ranging from techniques for computation offloading to network architectures. This paper provides a comprehensive survey of the state-of-the-art MEC research with a focus on joint radio-and-computational resource management. We also discuss a set of issues, challenges, and future research directions for MEC research, including MEC system deployment, cache-enabled MEC, mobility management for MEC, green MEC, as well as privacy-aware MEC. Advancements in these directions will facilitate the transformation of MEC from theory to practice. Finally, we introduce recent standardization efforts on MEC as well as some typical MEC application scenarios.

A Survey on Mobile Edge Computing: The Communication Perspective

Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literature which are mainly for systems with homogeneous processors. Although there are a few algorithms in the literature for heterogeneous processors, they usually require significantly high scheduling costs and they may not deliver good quality schedules with lower costs. In this paper, we present two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time, which are called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm. The HEFT algorithm selects the task with the highest upward rank value at each step and assigns the selected task to the processor, which minimizes its earliest finish time with an insertion-based approach. On the other hand, the CPOP algorithm uses the summation of upward and downward rank values for prioritizing tasks. Another difference is in the processor selection phase, which schedules the critical tasks onto the processor that minimizes the total execution time of the critical tasks. In order to provide a robust and unbiased comparison with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithms significantly surpass previous approaches in terms of both quality and cost of schedules, which are mainly presented with schedule length ratio, speedup, frequency of best results, and average scheduling time metrics.

/pdf/performance-effective-and-low-complexity-task-scheduling-for-51tejcgo0m.pdf

Performance-effective and low-complexity task scheduling for heterogeneous computing

This paper addresses the issue of providing QoS services for optical burst switching (OBS) systems. We propose a linear predictive filter (LPF)-based forward resource reservation method to reduce the burst delay at edge routers. An aggressive reservation method is proposed to increase the successful forward reservation probability and to improve the delay reduction performance. We also discuss a QoS strategy that achieves burst delay differentiation for different classes of traffic by extending the FRR scheme. We analyze the latency reduction improvement gained by our FRR scheme, and evaluate the bandwidth cost of the FRR-based QoS strategy. Our scheme yields significant delay reduction for time-critical traffic, while maintaining the bandwidth overhead within limits.

Forward resource reservation for QoS provisioning in OBS systems

In this paper, we present a novel capacity-aware spectrum allocation model for cognitive radio networks. First, we model interference constraints based on the interference temperature model, and let the secondary users (SUs) increase their transmission power until the interference temperature on one of their neighbors exceeds its interference temperature threshold. Then, knowing the SINR and bandwidth of potential links, we calculate the link capacity based on the Shannon formula, and model the co-channel interference between potential links on each channel by using an interference graph. Next, we formulate the spectrum assignment problem in the form of a binary integer linear programming (BILP) to find the optimal feasible set of simultaneously active links among all the potential links in the sense of maximizing the overall network capacity. We also propose a new radix tree based algorithm that, by removing the sparse areas in the search space, leads to a considerable decrease in time complexity of solving the spectrum allocation problem as compared to the BILP algorithm. The simulation results have shown that this proposed model leads to a considerable improvement in overall network capacity as compared to genetic algorithm, and leads to a considerable decrease in time duration needed to find the optimal solution as compared to the BILP algorithm.

Maximizing Network Capacity of Cognitive Radio Networks by Capacity-Aware Spectrum Allocation

Drone-mounted base-stations (DBSs) have attracted much attention because of their mobile, flexible and low-cost networking features. In-band full-duplex (IBFD) is a promising technology to potentially double the spectrum efficiency, and thus equipping DBSs with IBFD to provision services may increase throughput and reduce the number of required DBSs for the same coverage. We propose a dynamic drone-base-station-placement algorithm to solve the 3-D DBS placement problem by incorporating IBFD-enabled DBS communications for both access links and backhaul links of DBSs, which is NP-hard. Simulation results have demonstrated that our proposed algorithm significantly increases the throughput and reduces the data rate block ratio as compared to that of other strategies.

On the Number and 3-D Placement of In-Band Full-Duplex Enabled Drone-Mounted Base-Stations

Popularity of voice over IP (VoIP) applications such as Skype, Google Talk, and MSN Messenger along with emerging deployment of WiMAX networks is making VoIP over WiMAX an attractive market and a driving force for both carriers and equipment suppliers in capturing and spurring the next wave of telecommunications innovation, though challenges remain. Optimization of the VoIP call capacity over WiMAX networks is one such crucial challenge and remains an open research issue. While conventional scheduling methods have not considered the traffic characteristics of VoIP, in this paper, we propose a traffic aware scheduling algorithm for VoIP applications in WiMAX networks. We study the performance of our proposed method and compare it with that of some conventional methods. The tradeoff between delay and bandwidth efficiency is discussed, and it is shown that using our scheduling method enhances the efficiency of VoIP over WiMAX.

VoIP Traffic Scheduling in WiMAX Networks

Recently, machine learning (ML) has been widely adopted for fingerprint-based indoor localization because of its potency in delineating relationships between received signal strength (RSS) information and labels accurately. Existing ML-based indoor localization systems are less robust because they only adopt the output with the highest probability. This affects the final location estimate, hence compromising accuracy due to the severity of RSS fluctuations. Since different ML algorithms (MLAs) yield different performances, it is therefore intuitive to fuse predictions from multiple MLAs to improve the positioning performance in the presence of signal fluctuation. In this article, we propose SmartLoc, a smart wireless indoor localization framework to enhance indoor localization. In the offline phase, multiple MLAs are trained by utilizing an offline database. We further apply probability alignment to guarantee the predicted probabilities of each MLA at the same confidence level. In the online phase, given a testing RSS sample of a user at an unknown location, we extract the labels with probabilities greater than a certain threshold from each MLA to construct the space of candidate labels (SCL). The size of SCL can be adaptively determined by using our proposed dynamic size determination algorithm. Based on the SCL, we propose a probabilistic model to intelligently estimate the user's location by evaluating the label credibility simultaneously. A high label credibility indicates that the frequently occurred label is more likely to be true. Experimental results in a real changing environment verify the superiority of SmartLoc, outperforming the best among comparative methods by 10.8% in 75th percentile accuracy.

Nirwan Ansari

Papers

Forward resource reservation for QoS provisioning in OBS systems

Maximizing Network Capacity of Cognitive Radio Networks by Capacity-Aware Spectrum Allocation

On the Number and 3-D Placement of In-Band Full-Duplex Enabled Drone-Mounted Base-Stations

VoIP Traffic Scheduling in WiMAX Networks

SmartLoc: Smart Wireless Indoor Localization Empowered by Machine Learning