96 resultados para Binary matrices


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Software simulation models are computer programs that need to be verified and debugged like any other software. In previous work, a method for error isolation in simulation models has been proposed. The method relies on a set of feature matrices that can be used to determine which part of the model implementation is responsible for deviations in the output of the model. Currrently these feature matrices have to be generated by hand from the model implementation, which is a tedious and error-prone task. In this paper, a method based on mutation analysis, as well as prototype tool support for the verification of the manually generated feature matrices is presented. The application of the method and tool to a model for wastewater treatment shows that the feature matrices can be verified effectively using a minimal number of mutants.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

These notes follow on from the material that you studied in CSSE1000 Introduction to Computer Systems. There you studied details of logic gates, binary numbers and instruction set architectures using the Atmel AVR microcontroller family as an example. In your present course (METR2800 Team Project I), you need to get on to designing and building an application which will include such a microcontroller. These notes focus on programming an AVR microcontroller in C and provide a number of example programs to illustrate the use of some of the AVR peripheral devices.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The A(n-1)((1)) trigonometric vertex model with generic non-diagonal boundaries is studied. The double-row transfer matrix of the model is diagonalized by algebraic Bethe ansatz method in terms of the intertwiner and the corresponding face-vertex relation. The eigenvalues and the corresponding Bethe ansatz equations are obtained.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Many images consist of two or more 'phases', where a phase is a collection of homogeneous zones. For example, the phases may represent the presence of different sulphides in an ore sample. Frequently, these phases exhibit very little structure, though all connected components of a given phase may be similar in some sense. As a consequence, random set models are commonly used to model such images. The Boolean model and models derived from the Boolean model are often chosen. An alternative approach to modelling such images is to use the excursion sets of random fields to model each phase. In this paper, the properties of excursion sets will be firstly discussed in terms of modelling binary images. Ways of extending these models to multi-phase images will then be explored. A desirable feature of any model is to be able to fit it to data reasonably well. Different methods for fitting random set models based on excursion sets will be presented and some of the difficulties with these methods will be discussed.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This is the second in a series of articles whose ultimate goal is the evaluation of the matrix elements (MEs) of the U(2n) generators in a multishell spin-orbit basis. This extends the existing unitary group approach to spin-dependent configuration interaction (CI) and many-body perturbation theory calculations on molecules to systems where there is a natural partitioning of the electronic orbital space. As a necessary preliminary to obtaining the U(2n) generator MEs in a multishell spin-orbit basis, we must obtain a complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The zero-shift coefficients were obtained in the first article of the series. in this article, we evaluate the nonzero shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. We then demonstrate that the one-shell versions of these coefficients may be obtained by taking the Gelfand-Tsetlin limit of the two-shell formulas. These coefficients,together with the zero-shift types, then enable us to write down formulas for the U(2n) generator matrix elements in a two-shell spin-orbit basis. Ultimately, the results of the series may be used to determine the many-electron density matrices for a partitioned system. (C) 1998 John Wiley & Sons, Inc.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Using Reshetikhin's construction for multiparametric quantum algebras we obtain the associated multiparametric quantum spin chains. We show that under certain restrictions these models can be mapped to quantum spin chains with twisted boundary conditions, We illustrate how this general formalism applier; to construct multiparametric versions of the supersymmetric t-J and Li models.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A class of integrable boundary terms for the eight-state supersymmetric U model are presented by solving the graded reflection equations. The boundary model is solved by using the coordinate Bethe ansatz method and the Bethe ansatz equations are obtained. (C) 1998 Elsevier Science B.V.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A general graded reflection equation algebra is proposed and the corresponding boundary quantum inverse scattering method is formulated. The formalism is applicable to all boundary lattice systems where an invertible R-matrix exists. As an application, the integrable open-boundary conditions for the q-deformed supersymmetric U model of strongly correlated electrons are investigated. The diagonal boundary K-matrices are found and a class of integrable boundary terms are determined. The boundary system is solved by means of the coordinate space Bethe ansatz technique and the Bethe ansatz equations are derived. As a sideline, it is shown that all R-matrices associated with a quantum affine superalgebra enjoy the crossing-unitarity property. (C) 1998 Elsevier Science B.V.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The integrable open-boundary conditions for the model of three coupled one-dimensional XY spin chains are considered in the framework of the quantum inverse scattering method. The diagonal boundary K-matrices are found and a class of integrable boundary terms is determined. The boundary model Hamiltonian is solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are derived. (C) 1998 Elsevier Science B.V.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We clarify the extra signs appearing in the graded quantum Yang-Baxter reflection equations, when they are written in a matrix form. We find the boundary K-matrix for the Perk-Schultz six-vertex model, thus give a general solution to the graded reflection equation associated with it.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

New classes of integrable boundary conditions for the q-deformed (or two-parameter) supersymmetric U model are presented. The boundary systems are solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are derived. (C) 1998 Elsevier Science B.V.