Buscar recursos académicos

There are two main activities in Component-Based Development: component development, where we build libraries for general use, and component integration, where we assemble an application from existing components. In this...

"Relation algebras are algebras arising from the study of binary relations. They form a part of the eld of algebraic logic, and have applications in proof theory, modal logic, and computer science. An interesting problem...

A method for accurate and efficient local density functional calculations (LDF) on molecules is described and presented with results. The method, Dmol for short, uses fast convergent three-dimensional numerical integrati...

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topol...

Even though the result recently referred to as the "Frisch-Waugh-Lovell theorem" (FWL theorem, henceforth) has been around for a long time, it is relatively recently that it has been widely used by econometricians as a p...

An exactly solvable quantum many-fermion system with an arbitrarily strong two-body interaction is studied and some exact thermodynamic functions (in the thermodynamic limit) are derived within the framework of the stati...

Professor Arnold Kaufmann did propose at least two types of indexes for estimating fuzziness in finite standard fuzzy sets. First one has an analogue formulation to that stated by Claude Shannon for measuring uncertainty...

Previous article Next article An Algorithm for Least-Squares Estimation of Nonlinear ParametersDonald W. MarquardtDonald W. Marquardthttps://doi.org/10.1137/0111030PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport Ci...

This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due ...

A basic problem in computer vision is to understand the structure of a real world scene given several images of it. Techniques for solving this problem are taken from projective geometry and photogrammetry. Here, the aut...

The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. This paper analyzes a particle's trajectory as it moves in disc...