Search results for "Multiplication"

Fast Approximated Discriminative Common Vectors Using Rank-One SVD Updates

2013

An efficient incremental approach to the discriminative common vector (DCV) method for dimensionality reduction and classification is presented. The proposal consists of a rank-one update along with an adaptive restriction on the rank of the null space which leads to an approximate but convenient solution. The algorithm can be implemented very efficiently in terms of matrix operations and space complexity, which enables its use in large-scale dynamic application domains. Deep comparative experimentation using publicly available high dimensional image datasets has been carried out in order to properly assess the proposed algorithm against several recent incremental formulations.

A recurrence-free variant of strassen’s algorithm on hypercube

1995

In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algorithm is suitable to run on parallel environments. Two computational schemes have been worked out exploiting different parallel approaches on hypercube architecture. A comparative analysis is reported. The experiments have been carried out on an nCUBE-2 supercomputer, housed at CNUCE in Pisa, supporting the Express parallel operating system. © 1995, Taylor & Francis Group, LLC. All rights reserved.

Development of a module of stacks of air-breathing microbial fuel cells to light-up a strip of LEDs

2018

Abstract This work focuses on scaling-up of the microbial fuel cells technology according to the principle of miniaturization and multiplication. Seven stacks of 16 mini-MFCs (electrodic area of 0.866 cm2) were built up leading to a big module of 112 MFCs. The electrical connection among the MFCs in the stacks and among the stacks into the modules was optimized in order to implement this technology. Results show that 1 MFC generates 1.22 mW while the optimization of the electric connection in order to achieve the maximum power results in 6.62 mW compared to the theoretical 182 mW, indicating the existence of large energy losses in the system. However, to light a LED there is not a threshold…

On the staking of miniaturized air-breathing microbial fuel cells

2018

Abstract This work focuses on the scale-up of the MFCs by miniaturization and multiplication strategy. Performances of five stacks containing 1, 2, 5, 8 and 16 MFCs were compared. Each stack was evaluated under individual, parallel and series electrical connection as well as for cascade or individual hydraulic connection. Cascade feeding mode with a tank per stack favours the COD removal when the number of MFCs in the stack increases. However, despite operating without COD limitations, the energy production was disadvantaged. By changing the feeding system of a tank per stack into an individual tank per MFC, the performance of the whole stack enhances considerably. Stacking in series can in…

Multiplication of Crataegus monogyna by in vitro culture of nodal segments

2009

Experimental Study of Six Different Implementations of Parallel Matrix Multiplication on Heterogeneous Computational Clusters of Multicore Processors

2010

Two strategies of distribution of computations can be used to implement parallel solvers for dense linear algebra problems for Heterogeneous Computational Clusters of Multicore Processors (HCoMs). These strategies are called Heterogeneous Process Distribution Strategy (HPS) and Heterogeneous Data Distribution Strategy (HDS). They are not novel and have been researched thoroughly. However, the advent of multicores necessitates enhancements to them. In this paper, we present these enhancements. Our study is based on experiments using six applications to perform Parallel Matrix-matrix Multiplication (PMM) on an HCoM employing the two distribution strategies.

Multi-label classification using boolean matrix decomposition

2012

This paper introduces a new multi-label classifier based on Boolean matrix decomposition. Boolean matrix decomposition is used to extract, from the full label matrix, latent labels representing useful Boolean combinations of the original labels. Base level models predict latent labels, which are subsequently transformed into the actual labels by Boolean matrix multiplication with the second matrix from the decomposition. The new method is tested on six publicly available datasets with varying numbers of labels. The experimental evaluation shows that the new method works particularly well on datasets with a large number of labels and strong dependencies among them.

Response determination of linear dynamical systems with singular matrices: A polynomial matrix theory approach

2017

Abstract An approach is developed based on polynomial matrix theory for formulating the equations of motion and for determining the response of multi-degree-of-freedom (MDOF) linear dynamical systems with singular matrices and subject to linear constraints. This system modeling may appear for reasons such as utilizing redundant DOFs, and can be advantageous from a computational cost perspective, especially for complex (multi-body) systems. The herein developed approach can be construed as an alternative to the recently proposed methodology by Udwadia and coworkers, and has the significant advantage that it circumvents the use of pseudoinverses in determining the system response. In fact, ba…

Multipactor Mitigation in Coaxial Lines by Means of Permanent Magnets

2014

The main aim of this paper is the analysis of the feasibility of employing permanent magnets for the multipactor mitigation in a coaxial waveguide. First, the study of a coaxial line immersed in a uniform axial magnetic field shows that multipactor can be suppressed at any RF if the external magnetic field is strong enough. Both theoretical simulations and experimental tests validate this statement. Next, multipactor breakdown of a coaxial line immersed in a hollow cylindrical permanent magnet is analyzed. Numerical simulations show that multipactor can be suppressed in a certain RF range. The performed experimental test campaign demonstrates the capability of the magnet to avoid the multip…

Quasi *-Algebras of Operators in Rigged Hilbert Spaces

2002

In this chapter, we will study families of operators acting on a rigged Hilbert space, with a particular interest in their partial algebraic structure. In Section 10.1 the notion of rigged Hilbert space D[t] ↪ H ↪ D × [t ×] is introduced and some examples are presented. In Section 10.2, we consider the space.L(D, D ×) of all continuous linear maps from D[t] into D × [t ×] and look for conditions under which (L(D, D ×), L +(D)) is a (topological) quasi *-algebra. Moreover the general problem of introducing in L(D, D ×) a partial multiplication is considered. In Section 10.3 representations of abstract quasi *-algebras into quasi*-algebras of operators are studied and the GNS-construction is …