Results 171 to 180 of about 2,634,425 (215)
Some of the next articles are maybe not open access.
FURTHER REDUCTION OF NORMAL FORMS AND UNIQUE NORMAL FORMS OF SMOOTH MAPS
International Journal of Bifurcation and Chaos, 2008Further reduction for classical normal forms of smooth maps is considered in this paper. Firstly, based on the idea of computation of simplest normal forms for vector fields [Yu & Yuan, 2003], we compute the transformed map of a given smooth map under a near identity formal transformation, and give a recursive formula for the homogeneous terms of ...
Duo Wang, Min Zheng, Jianping Peng
openaire +1 more source
Journal of Knot Theory and Its Ramifications, 2008
We present a seemingly new normal form for braids, where every braid is expressed using a word in a regular language on some simple alphabet of elementary braids. This normal form stems from analysing the geometric action of braid groups on curves in a punctured disk.
openaire +2 more sources
We present a seemingly new normal form for braids, where every braid is expressed using a word in a regular language on some simple alphabet of elementary braids. This normal form stems from analysing the geometric action of braid groups on curves in a punctured disk.
openaire +2 more sources
29th Annual IEEE/NASA Software Engineering Workshop, 2006
Because of their strong economic impact, complexity and maintainability are among the most widely used terms in software engineering. But, they are also among the most weakly understood. A multitude of software metrics attempts to analyze complexity and a proliferation of different definitions of maintainability can be found in text books and corporate
openaire +1 more source
Because of their strong economic impact, complexity and maintainability are among the most widely used terms in software engineering. But, they are also among the most weakly understood. A multitude of software metrics attempts to analyze complexity and a proliferation of different definitions of maintainability can be found in text books and corporate
openaire +1 more source
Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A normal form for XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '02, 2002This article takes a first step towards the design and normalization theory for XML documents. We show that, like relational databases, XML documents may contain redundant information, and may be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among paths in the document.
Marcelo Arenas, Leonid Libkin
openaire +1 more source
Normal Forms for Partitions and Relations
1999Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard tree-like presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, but an exhaustive comparison between them is dificult ...
BRUNI, ROBERTO +2 more
openaire +2 more sources
Proceedings of the Steklov Institute of Mathematics
Consider the vector field \[ \dot x = \Lambda x + f(x), \ \ x \in \mathbb{C}^n, \tag{1} \] where \(\Lambda\) is a constant diagonal matrix with \(n\) different eigenvalues \(\lambda_1, \ldots, \lambda_n\), and \(f\) is a formal vector power series over \(\mathbb{C}\) or a holomorphic vector function \(\mathbb{C}^n \to \mathbb{C}^n\).
openaire +1 more source
Consider the vector field \[ \dot x = \Lambda x + f(x), \ \ x \in \mathbb{C}^n, \tag{1} \] where \(\Lambda\) is a constant diagonal matrix with \(n\) different eigenvalues \(\lambda_1, \ldots, \lambda_n\), and \(f\) is a formal vector power series over \(\mathbb{C}\) or a holomorphic vector function \(\mathbb{C}^n \to \mathbb{C}^n\).
openaire +1 more source
1988
Normal forms for non-flat tables (non-first normal form relations) are introduced. They aim to eliminate data redundancy. Further nice properties for querying and updating are guarantied; especially the ordinary transitivity rule for functional dependencies holds. Functional dependencies for structured tables with some inference rules are discussed.
openaire +1 more source
Normal forms for non-flat tables (non-first normal form relations) are introduced. They aim to eliminate data redundancy. Further nice properties for querying and updating are guarantied; especially the ordinary transitivity rule for functional dependencies holds. Functional dependencies for structured tables with some inference rules are discussed.
openaire +1 more source
Mathematics and Computers in Simulation, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2000
Abstract We continue to study the Hamiltonian equation (5.1) near an invariant manifold T 2n = Ф0(R × T n which possesses the properties 1-5 as in Section 5.1.
openaire +1 more source
Abstract We continue to study the Hamiltonian equation (5.1) near an invariant manifold T 2n = Ф0(R × T n which possesses the properties 1-5 as in Section 5.1.
openaire +1 more source