This theory provides a compact formulation of Gauss-Jordan elimination for matrices represented as functions. Its distinctive feature is succinctness. It is not meant for large computations. 1 Gauss-Jordan elimination algorithm theory Gauss-Jordan-Elim-Fun imports Main begin Matrices are functions: type-synonym ′a matrix = nat ⇒ nat ⇒ ′a In order to restrict to finite matrices, a matrix is usua...

Matrix game theory is concerned with how two players make decisions when they are faced with known exact payoffs. The aim of this paper is to develop a simple and an effective linear programming method for solving matrix games in which the payoffs are expressed with intervals. Because the payoffs of the matrix game are intervals, the value of the matrix game is an interval as well. Based on the...

The auxiliary latitudes are essential tools in cartography. This paper summarizes methods for converting between them with an emphasis on providing full double-precision accuracy. includes series expansions the third flattening, where truncation error is precisely measured and estimates of radii convergence given. Also new formulas given computing rectifying authalic minimal roundoff error.

Recent advances in language modeling such as word2vec motivate a number of graph embedding approaches by treating random walk sequences as sentences to encode structural proximity in a graph. However, most of the existing principles of neural graph embedding do not incorporate auxiliary information such as node content flexibly. In this paper we take a matrix factorization perspective of graph ...

An important class of optimization problems in control and signal processing involves the constraint that a Popov function is nonnegative on the unit circle or the imaginary axis. Such a constraint is convex in the coefficients of the Popov function. It can be converted to a finitedimensional linear matrix inequality via the Kalman-Yakubovich-Popov lemma. However, the linear matrix inequality r...

An important class of optimization problems in control and signal processing involves the constraint that a Popov function is nonnegative on the unit circle or the imaginary axis. Such a constraint is convex in the coefficients of the Popov function. It can be converted to a finitedimensional linear matrix inequality via the Kalman-Yakubovich-Popov lemma. However, the linear matrix inequality r...

background: a set of hardware stereotactic radiosurgery is designed and constructed. the scope of this article is to describe how we have designed and developed stereotactic collimation assembly for a 9 mv neptun 10 pc linac. materials and methods: one collimator holder and six collimators were made, with their radiation field diameter between 12.5 mm to 25 mm at isocenter level. beam data, suc...

The deterministic quantum computation with one qubit (DQC1) model is a restricted of computing able to calculate efficiently the normalized trace unitary matrix. In this work we analyse correlations named entanglement, Bell's nonlocality, discord, and coherence generated by DQC1 circuit considering only two qubits (auxiliary control). For standard discord appear. By introducing filter in purify...

background: radiosurgery is a focal brain irradiation technique that delivers, usually in a single session, high dose of ionizing radiation. the presence of lateral electronic disequilibrium and steep dose gradients in small fields demands special attention to the selection of a suitable detector with respect to its size, composition and response. materials and methods : small circular fields w...

This thesis investigates the iterative application of Monte Carlo methods to the problem of parameter estimation for models of maximum entropy, minimum divergence, and maximum likelihood among the class of exponential-family densities. It describes a suite of tools for applying such models to large domains in which exact computation is not practically possible. The first result is a derivation ...