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

From the Publisher: 
The accessible presentation of this book gives both a general view of the entire computer vision enterprise and also offers sufficient detail to be able to build useful applications. Users learn techniques that have proven to be useful by first-hand experience and a wide range of mathematical methods. A CD-ROM with every copy of the text contains source code for programming practice, color images, and illustrative movies. Comprehensive and up-to-date, this book includes essential topics that either reflect practical significance or are of theoretical importance. Topics are discussed in substantial and increasing depth. Application surveys describe numerous important application areas such as image based rendering and digital libraries. Many important algorithms broken down and illustrated in pseudo code. Appropriate for use by engineers as a comprehensive reference to the computer vision enterprise.

Computer vision : a modern approach = 计算机视觉 : 一种现代的方法

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

The boundary layer equations for plane, incompressible, and steady flow are 

$$\matrix{ {u{{\partial u} \over {\partial x}} + v{{\partial u} \over {\partial y}} = - {1 \over \varrho }{{\partial p} \over {\partial x}} + v{{{\partial ^2}u} \over {\partial {y^2}}},} \cr {0 = {{\partial p} \over {\partial y}},} \cr {{{\partial u} \over {\partial x}} + {{\partial v} \over {\partial y}} = 0.} \cr }$$

Boundary Layer Theory

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

Coverage control for mobile sensing networks

Non-linear hysteresis is a complicated phenomenon associated with magnetorheological (MR) fluid dampers. A new model for MR dampers is proposed in this paper. For this, computationally-tractable algebraic expressions are suggested here in contrast to the commonly-used Bouc–Wen model, which involves internal dynamics represented by a non-linear differential equation. In addition, the model parameters can be explicitly related to the hysteretic phenomenon. To identify the model parameters, a particle swarm optimization (PSO) algorithm is employed using experimental force–velocity data obtained from various operating conditions. In our algorithm, it is possible to relax the need for a priori knowledge on the parameters and to reduce the algorithmic complexity. Here, the PSO algorithm is enhanced by introducing a termination criterion, based on the statistical hypothesis testing to guarantee a user-specified confidence level in stopping the algorithm. Parameter identification results are included to demonstrate the accuracy of the model and the effectiveness of the identification process.

A novel hysteretic model for magnetorheological fluid dampers and parameter identification using particle swarm optimization

State and input simultaneous estimation for a class of nonlinear systems

This paper presents the design and implementation of a field-programmable gate array (FPGA)-based architecture for the speed control of sensorless permanent-magnet synchronous motor (PMSM) drives For the reduction of computation resources, as well as accuracy improvement in the rotor position estimation, a parallel reduced-order extended Kalman filter (EKF) is proposed in this work Compared with an EKF, the system order is reduced and the iteration process is greatly simplified, resulting in significant savings of resource utility, while maintaining high estimation performance The whole control system includes a current-control-and-coordinate-transformation unit, a proportional-integral (PI) speed controller, and other accessory modules, all implemented in a single FPGA chip A hardware description language is adopted to describe advantageous features of the proposed control system Moreover, the finite-state-machine method is applied with the purpose to reduce logic elements used in the FPGA chip The validity of the approach is verified through simulation based on the Modelsim/Simulink cosimulation method Finally, experimental results are obtained on an FPGA platform with an inverter-fed PMSM to show the feasibility and effectiveness of the proposed system-on-programmable-chip for PMSM drives

FPGA-Based Sensorless PMSM Speed Control Using Reduced-Order Extended Kalman Filters

A non-symmetrical Bouc-Wen model is proposed in this paper for magnetorheological (MR) fluid dampers. The model considers the effect of non-symmetrical hysteresis which has not been taken into account in the original Bouc-Wen model. The model parameters are identified with a Genetic Algorithm (GA) using its flexibility in identification of complex dynamics. The computational efficiency of the proposed GA is improved with the absorption of the selection stage into the crossover and mutation operations. Crossover and mutation are also made adaptive to the fitness values such that their probabilities need not be user-specified. Instead of using a sufficiently number of generations or a pre-determined fitness value, the algorithm termination criterion is formulated on the basis of a statistical hypothesis test, thus enhancing the performance of the parameter identification. Experimental test data of the damper displacement and force are used to verify the proposed approach with satisfactory parameter identification results.

Bouc-Wen model parameter identification for a MR fluid damper using computationally efficient GA.

This paper concerns the design of robust control systems using sliding-mode control that incorporates a fuzzy tuning technique. The control law superposes equivalent control, switching control, and fuzzy control. An equivalent control law is first designed using pole placement. Switching control is then added to guarantee that the state reaches the sliding mode in the presence of parameter and disturbance uncertainties. Fuzzy tuning schemes are employed to improve control performance and to reduce chattering in the sliding mode. The practical application of fuzzy logic is proposed here as a computational-intelligence approach to engineering problems associated with sliding-mode controllers. The proposed method can have a number of industrial applications including the joint control of a hydraulically actuated mini-excavator as presented in this paper. The control hardware is described together with simulated and experimental results. High performance and attenuated chatter are achieved. The results obtained verify the validity of the proposed control approach to dynamic systems characterized by severe uncertainties.

Quang Phuc Ha

Papers

A novel hysteretic model for magnetorheological fluid dampers and parameter identification using particle swarm optimization

State and input simultaneous estimation for a class of nonlinear systems

FPGA-Based Sensorless PMSM Speed Control Using Reduced-Order Extended Kalman Filters

Bouc-Wen model parameter identification for a MR fluid damper using computationally efficient GA.

Fuzzy sliding-mode controllers with applications