Results 261 to 270 of about 3,562,975 (305)
Some of the next articles are maybe not open access.
2007
There are several ways of characterizing nonnegative polynomials that may be interesting for a mathematician. However, not all of them are appropriate for computational purposes, by “computational” understanding primarily optimization methods. Nonnegative polynomials have a basic property extremely useful in optimization: They form a convex set. So, an
openaire +1 more source
There are several ways of characterizing nonnegative polynomials that may be interesting for a mathematician. However, not all of them are appropriate for computational purposes, by “computational” understanding primarily optimization methods. Nonnegative polynomials have a basic property extremely useful in optimization: They form a convex set. So, an
openaire +1 more source
On Matrix Representations of Participation Constraints
2009We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual modelling. Matrix representations, also known as Armstrong relations, have been studied in literature e.g. for functional dependencies and play an important role in example-based design and
Sven Hartmann, Uwe Leck, Sebastian Link
openaire +1 more source
MATRIX PROBLEMS AND INTEGRAL REPRESENTATIONS
Mathematics of the USSR-Izvestiya, 1974Given a linear matrix problem, an order is constructed whose representations are classified by the matrices of this problem. It is shown that problems about representations of partially ordered sets are included in this scheme.
Drozd, Ju. A. +2 more
openaire +2 more sources
The S-Matrix in the Heisenberg Representation
Physical Review, 1950A method is described whereby the S-matrix can be formulated directly in the Heisenberg representation. This has the advantage over the customary formulation in the interaction representation in that the concepts of space-like surfaces and their normals need never be introduced.
Yang, C. N., Feldman, David
openaire +1 more source
Representation of Graphs on a Matrix Layout
Ninth International Conference on Information Visualisation (IV'05), 2006The need to visualize network data becomes increasingly crucial, as it appears in numerous domains like Web visualization, computer network monitoring, or social studies. Graphs and matrices are two well-known techniques to visualize network data.
Benoît Otjacques, Fernand Feltz
openaire +1 more source
Matrix representation in pattern classification
Expert Systems with Applications, 2012Highlights? Texture descriptors are used in standard pattern classification problems. ? Local ternary patterns and local phase quantization permits to handle the correlation among the original features. ? Texture descriptors along with the vector-based descriptors can be combined to improve the performance of support vector machine.
L. Nanni, S. Brahnam, LUMINI, ALESSANDRA
openaire +4 more sources
MATRIX REPRESENTATIONS OF AMPLE SEMIGROUPS
Journal of Algebra and Its Applications, 2013An adequate semigroup S is said to be ample if for any e2 = e, a ∈ S, ae = (ae)†a and ea = a(ea)*. It is well known that inverse semigroups are ample semigroups. The purpose of this paper is to study matrix representations of an ample semigroup. Some properties of ample semigroups are obtained.
Guo, Xiaojiang, Shum, K. P.
openaire +1 more source
Matrix Representation of Thermodynamic Fundamentals
American Journal of Physics, 1957The use of matrices for representing fundamental thermodynamic relations is demonstrated. Maxwell's relations and other thermodynamic derivatives are readily obtained by differentiation of the matrices defined.
openaire +2 more sources
Matrix representation of a w-graph
Journal of the Franklin Institute, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The matrix representation of pharmacokinetic models
Journal of Theoretical Biology, 1979Abstract An equation is developed from the matrix of rate constants which describes the behaviour of linear pharmacokinetic models for any initial condition as a function of time. This general matrix equation is then used to derive analogous expressions for drug distribution after a period of infusion, at the steady state, or during a multiple ...
openaire +2 more sources