Search results for "Linear Algebra."
showing 10 items of 552 documents
Some Effects of Individual Learning on the Evolution of Sensors
2001
In this paper, we present an abstract model of sensor evolution, where sensor development is only determined by artificial evolution and the adaptation of agent reactions is accomplished by individual learning. With the environment cast into a MDP framework, sensors can be conceived as a map from environmental states to agent observations and Reinforcement Learning algorithms can be utilised. On the basis of a simple gridworld scenario, we present some results of the interaction between individual learning and evolution of sensors.
A Formal Model for Developing of the self-Diagosing and Self-Repairing 8-Bits Microprocessor, and Its Investigation Using Simulation
1986
Abstract The complete model of functional diagnostics is theoretically described. It specifies the conditions, which must be satisfied if the system to be self-diagnosable. The general principles of constructing self-diagnosable systems are enumerated. The model enables the realization of self-renewal, too. The model has been developed on the basis of the works by Preparata, Metze, Chien (1967) and Hakimi, Amin (1974) . The model contains a method of diagnostics completely separeted from the physical structure of the system. Recent results (Gruber, 1978; Swiatek, 1982) indicate that it is only necessary to know the set of transformations realized by the circuit. The model has been applied t…
Aplicación del Estimador de Parámetros de Segmentación por Media-desplazada (EPSM) a las imágenes de satélite de muy alta resolución espacial: Tetuán…
2015
<p>La segmentación de imágenes constituye un paso crucial en el Análisis de Imágenes Basado en Objetos (AIBO). Combinando distintos valores de los parámetros de entrada de los algoritmos de segmentación se obtienen diferentes resultados. En general, los parámetros óptimos seleccionados se determinan mediante interpretación visual; por lo tanto, la definición de las combinaciones óptimas es una tarea considerablemente difícil. En la presente investigación, se propone una herramienta analítica que denominamos Estimador de Parámetros de Segmentación por Media-desplazada (EPSM) aplicada a la selección automatizada de los valores de los parámetros de segmentación en las imágenes de satélit…
On Information Processing in the Cat’s Visual Cortex
1986
We assume that the visual system serves for orientation in space, recognition of objects and the interpretation of scenes and scene sequences. This task breaks up into a series of partially interdependent subproblems which are solved by some 13–15 usually retinotopically organized areas. So far it has not been possible to correlate functions and areas unequivocally. One reason for this could be the inadequacy of the questions posed as a basis for experiments. However, we think it more likely that correlating a function with an area is, as a rule, inadmissible since the degree of the coupling in the whole system does not permit a simple divsion. Rather the type and degree of coupling determi…
The pricing capability lifecycle of digital innovations
2021
The pricing capability provides a basis for firms’ competitive advantage. However, to date, the literature has not investigated how this capability forms, develops, and matures. In this study, we define the pricing capability as a dynamic capability consisting of three operational building blocks (tools and data, human and relational resources, and processes, routines, and mechanisms) as well as two dynamic capability building blocks (alertness and responsiveness, and value-based strategic thinking). Furthermore, we propose the pricing capability lifecycle of digital innovations that incorporates insights of the dynamic capabilities view (DCV). Based on a longitudinal multi-case study of fi…
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
2012
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the application of BW to very large matrices used in the linear algebra step of the number field sieve (NFS) for integer factorization. In this paper, we derive an efficient CUDA implementation of this operation by using a newly designed hybrid sparse matrix format. This leads to speedups between 4 and 8 on a single graphics processing unit (GPU) for a number of tested NFS matrices compared with an optimized multicore implementation. We further present…
CCSDT calculations of molecular equilibrium geometries
1997
Abstract CCSDT equilibrium geometries of CO, CH2, F2, HF, H2O and N2 have been calculated using the correlation-consistent cc-pVXZ basis sets. Similar calculations have been performed for SCF, CCSD and CCSD(T). In general, bond lengths decrease when improving the basis set and increase when improving the N-electron treatment. CCSD(T) provides an excellent approximation to CCSDT for bond lengths as the largest difference between CCSDT and CCSD(T) is 0.06 pm. At the CCSDT/cc-pVQZ level, basis set deficiencies, neglect of higher-order excitations, and incomplete treatment of core-correlation all give rise to errors of a few tenths of a pm, but to a large extent, these errors cancel. The CCSDT/…
Student use of resources in Calculus and Linear Algebra
2018
International audience; In this study we have investigated the resources used by first year engineering students in a technical university in the Netherlands, for their learning of Calculus and Linear Algebra. Using a case study approach we have focused on how the resources and their use (a) differed from upper secondary school as compared to university, and (b) differed between the two university courses. The results indicate that, in terms of (a) students built on secondary school experiences and emulated these into their university courses, where some subsequently experienced difficulties. In terms of (b), we argue that the course organization and the alignment of curriculum materials wi…
A continuous decomposition of the Menger curve into pseudo-arcs
2000
It is proved that the Menger universal curve M admits a continuous decomposition into pseudo-arcs with the quotient space homeomorphic to M. Wilson proved [8] Anderson's announcement [1] saying that for any Peano continuum X the Menger universal curve M admits a continuous decomposition into homeomorphic copies of M such that the quotient space is homeomorphic to X. Anderson also announced (unpublished) that the plane admits a continuous decomposition into pseudo-arcs. This result was proved by Lewis and Walsh [4]. In a previous paper [6] the author has proved that each locally planar Peano continuum with no local separating point admits a continuous decomposition into pseudo-arcs. Applying…
Generalized Many-Body Expanded Full Configuration Interaction Theory
2019
Facilitated by a rigorous partitioning of a molecular system's orbital basis into two fundamental subspaces - a reference and an expansion space, both with orbitals of unspecified occupancy - we generalize our recently introduced many-body expanded full configuration interaction (MBE-FCI) method to allow for electron-rich model and molecular systems dominated by both weak and strong correlation to be addressed. By employing minimal or even empty reference spaces, we show through calculations on the one-dimensional Hubbard model with up to 46 lattice sites, the chromium dimer, and the benzene molecule how near-exact results may be obtained in a entirely unbiased manner for chemical and physi…