No abstract

No abstract

The problem of the refractory nature of gold bearing arsenide ores is described. The basic principle, characteristics and application of pretreatment technique of arsenic-bearing gold ores are presented in this paper. Several different classes of process options for pretreating refractory ores are considered. These options include: roasting oxidation; wet chemical treatment; bacterial peroxidation; and other pretreatments such as: eliminating arsenic in vacuum, volatile smelting, segregation of roasting, electrochemical oxidation. Its development tendency in the future is also looked ahead.KEY WORDS: arsenic-bearing gold ore; pretreatment process; refractory gold ore.

No abstract

No abstract

In this article, a distributed nonmodel based generalized Nash equilibrium (GNE) seeking algorithm is proposed for a class of constrained noncooperative games with unknown cost functions. In the game, the strategy of each agent is restricted by both the coupled equality constraint and local inequality constraints. By virtue of the exact penalty method, an auxiliary cost function is constructed with the cost function and the local constraints. The main feature of the proposed algorithm depends on the capability to estimate the gradient information of auxiliary cost functions with only the values of costs. This is obtained by the extremum seeking control (ESC). To deal with the coupled constraints, only the Lagrange multiplier is transmitted among agents with some prior information about the coupled constraints. Moreover, a diminishing dither signal is introduced in the seeking algorithm to remove undesirable steady-state oscillations occurred in the classical ESC. As a result, the nonlocal convergence of the designed seeking algorithm to the GNE of the game is obtained by the singular perturbation theory, averaging analysis and Lyapunov stability theory. Numerical examples are given to verify the effectiveness of our proposed method.

No abstract

In this paper, we explore aggregative games over networks of multi-integrator agents with coupled constraints. To reach the general Nash equilibrium of an aggregative game, a distributed strategy-updating rule is proposed by a combination of the coordination of Lagrange multipliers and the estimation of the aggregator. Each player has only access to partial-decision information and communicates with his neighbors in a weight-balanced digraph which characterizes players' preferences as to the values of information received from neighbors. We first consider networks of double-integrator agents and then focus on multi-integrator agents. The effectiveness of the proposed strategy-updating rules is demonstrated by analyzing the convergence of corresponding dynamical systems via the Lyapunov stability theory, singular perturbation theory and passive theory. Numerical examples are given to illustrate our results.