The system identification and control of Hammerstein system using non-uniform rational B-spline neural network and particle swarm optimization

In this paper a new system identification algorithm is introduced for Hammerstein systems based on observational input/output data. The nonlinear static function in the Hammerstein system is modelled using a non-uniform rational B-spline (NURB) neural network. The proposed system identification algorithm for this NURB network based Hammerstein system consists of two successive stages. First the shaping parameters in NURB network are estimated using a particle swarm optimization (PSO) procedure. Then the remaining parameters are estimated by the method of the singular value decomposition (SVD). Numerical examples including a model based controller are utilized to demonstrate the efficacy of the proposed approach. The controller consists of computing the inverse of the nonlinear static function approximated by NURB network, followed by a linear pole assignment controller.

Two new mu-(1,3-azido)-bridged polymers: alternating single and double bridges in a 1D nickel(II) complex and uniform bridge in a 2D copper(II) complex: Syntheses, single-crystal structures and magnetic studies

Two polymeric azido bridged complexes [Ni2L2(N-3)(3)](n)(ClO4). (1) and [Cu(bpdS)(2)(N-3)],(ClO4),(H2O)(2.5n) (2) [L = Schiff base, obtained from the condensation of pyridine-2-aldehyde with N,N,2,2-tetramethyl-1,3-propanediamine; bpds = 4,4'-bipyridyl disulfide] have been synthesized and their crystal structures have been determined. Complex 1, C26H42ClN15Ni2O4, crystallizes in a triclinic system, space group P1 with a 8.089(13), b = 9.392(14), c = 12.267(18) angstrom, a = 107.28(l), b 95.95(1), gamma = 96.92(1)degrees and Z = 2; complex 2, C20H21ClCuN7O6.5S4, crystallizes in an orthorhombic system, space group Pnna with a = 10.839(14), b = 13.208(17), c = 19.75(2) angstrom and Z = 4. The crystal structure of I consists of 1D polymers of nickel(L) units, alternatively connected by single and double bridging mu-(1,3-N-3) ligand with isolated perchlorate anions. Variable temperature magnetic susceptibility data of the complex have been measured and the fitting,of magnetic data was carried out applying the Borris-Almenar formula for such types of alternating one-dimensional S = 1 systems, based on the Hamiltonian H = -J Sigma(S2iS2i-1 + aS(2i)S(2i+1)). The best-fit parameters obtained are J = -106.7 +/- 2 cm(-1); a = 0.82 +/- 0.02; g = 2.21 +/- 0.02. Complex 2 is a 2D network of 4,4 topology with the nodes occupied by the Cu-II ions, and the edges formed by single azide and double bpds connectors. The perchlorate anions are located between pairs of bpds. The magnetic data have been fitted considering the complex as a pseudo-one-dimensional system, with all copper((II)) atoms linked by [mu(1,3-azido) bridging ligands at axial positions (long Cu...N-3 distances) since the coupling through long bpds is almost nil. The best-fit parameters obtained with this model are J = -1.21 +/- 0.2 cm(-1), g 2.14 +/- 0.02. (c) Wiley-VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2005).

Production, hidden action, and the payment system

In this paper, we study a model economy that examines the optimal intraday rate. In Freeman’s (1996) paper, he shows that the efficient allocation can be implemented by adopting a policy in which the intraday rate is zero. We modify the production set and show that such a model economy can account for the non-uniform distribution of settlements within a day. In addition, by modifying both the consumption set and the production set, we show that the central bank may be able to implement the planner’s allocation with a positive intraday interest rate.

Non-uniform data distribution for communication-efficient parallel clustering

Global communicationrequirements andloadimbalanceof someparalleldataminingalgorithms arethe major obstacles to exploitthe computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication costin parallel data mining algorithms and, in particular, in the k-means algorithm for cluster analysis. In the straightforward parallel formulation of the k-means algorithm, data and computation loads are uniformly distributed over the processing nodes. This approach has excellent load balancing characteristics that may suggest it could scale up to large and extreme-scale parallel computing systems. However, at each iteration step the algorithm requires a global reduction operationwhichhinders thescalabilityoftheapproach.Thisworkstudiesadifferentparallelformulation of the algorithm where the requirement of global communication is removed, while maintaining the same deterministic nature ofthe centralised algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real-world distributed applications or can be induced by means ofmulti-dimensional binary searchtrees. The approachcanalso be extended to accommodate an approximation error which allows a further reduction ofthe communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing element