Search results for "multiplication"
showing 10 items of 83 documents
Periodic time-domain modulation for the electrically tunable control of optical pulse train envelope and repetition rate multiplication
2012
An electrically tunable system for the control of optical pulse sequences is proposed and demonstrated. It is based on the use of an electrooptic modulator for periodic phase modulation followed by a dispersive device to obtain the temporal Talbot effect. The proposed configuration allows for repetition rate multiplication with different multiplication factors and with the simultaneous control of the pulse train envelope by simply changing the electrical signal driving the modulator. Simulated and experimental results for an input optical pulse train of 10 GHz are shown for different multiplication factors and envelope shapes. © 2006 IEEE.
Selecting between Competitors in Multiplication Tasks: An Explanation of the Errors Produced by Adolescents with Learning Difficulties
1997
Two experiments were conducted in order to determine the nature of the difficulties encountered by learning disabled (LD) adolescents in the resolution of multiplication problems ( a b, where a and b vary between 2 and 9). A response production task (Experiment 1) revealed that the incorrect responses generally belonged to the table of one of the two operands, and that the order of difficulty of the problems was the same for the LDs as for normal children, adolescents, and educated adults as reported in the literature. This result suggests that the difficulties are not solely due to memory problems. Experiment 2 tested the hypothesis that these difficulties were caused by a problem in inhi…
Do distractors interfere with memory for study pairs in associative recognition?
2006
In an associative recognition task, distractors generally consist of a rearrangement of the items composing the study pairs. This makes it possible that processing the distractors generates retroactive interference on memory for the study pairs. In Experiment 1, we explored this possibility in a yes/no recognition test concerning previously learned arbitrary associations between visual symbols and auditory syllables. Rearranged pairs had a deleterious impact on the accuracy and the speed of responses to related correct pairs. This effect did not vary as a function of the number of training blocks, and furthermore, in Experiment 2, the same effect was observed for overlearned small multiplic…
CUDA-enabled Sparse Matrix–Vector Multiplication on GPUs using atomic operations
2013
We propose the Sliced Coordinate Format (SCOO) for Sparse Matrix-Vector Multiplication on GPUs.An associated CUDA implementation which takes advantage of atomic operations is presented.We propose partitioning methods to transform a given sparse matrix into SCOO format.An efficient Dual-GPU implementation which overlaps computation and communication is described.Extensive performance comparisons of SCOO compared to other formats on GPUs and CPUs are provided. Existing formats for Sparse Matrix-Vector Multiplication (SpMV) on the GPU are outperforming their corresponding implementations on multi-core CPUs. In this paper, we present a new format called Sliced COO (SCOO) and an efficient CUDA i…
Weak pseudo-bosons
2020
We show how the notion of {\em pseudo-bosons}, originally introduced as operators acting on some Hilbert space, can be extended to a distributional settings. In doing so, we are able to construct a rather general framework to deal with generalized eigenvectors of the multiplication and of the derivation operators. Connections with the quantum damped harmonic oscillator are also briefly considered.
Steiner Loops of Affine Type
2020
Steiner loops of affine type are associated to arbitrary Steiner triple systems. They behave to elementary abelian 3-groups as arbitrary Steiner Triple Systems behave to affine geometries over GF(3). We investigate algebraic and geometric properties of these loops often in connection to configurations. Steiner loops of affine type, as extensions of normal subloops by factor loops, are studied. We prove that the multiplication group of every Steiner loop of affine type with n elements is contained in the alternating group An and we give conditions for those loops having An as their multiplication groups (and hence for the loops being simple).
Higher order matrix differential equations with singular coefficient matrices
2015
In this article, the class of higher order linear matrix differential equations with constant coefficient matrices and stochastic process terms is studied. The coefficient of the highest order is considered to be singular; thus, rendering the response determination of such systems in a straightforward manner a difficult task. In this regard, the notion of the generalized inverse of a singular matrix is used for determining response statistics. Further, an application relevant to engineering dynamics problems is included.
Geometric deformation measurement and correction applied to dynamic streak camera images
2002
The complete procedure of measuring and correcting geometric deformations encountered with dynamic streak camera images in the picosecond range is presented and discussed. First, we describe the experimental setup derived from the well known spacing calibration grid method. The implemented measurement bench, adapted to time-resolved 1D imaging, notably exhibits a great accuracy and repeatability both in space and time thanks to a three-axis motorized translation stage and programmable delay lines. Second, we examine image restoration by two different analytical transform means (local versus global): results and performances of both are compared. Then we deal with final image reconstruction …
Influence of data input in the evaluation of Stress Intensity Factors from Thermoelastic Stress Analysis
2021
Abstract Thermoelastic Stress Analysis (TSA) is applied to evaluate the Stress Intensity Factor (SIF), T-stress and J-Integral in a Single-Edge-Notched-Tension sample undergoing fatigue cycling. The Williams’ series stress formulation and a least-square fitting (LSF) procedure are used to obtain the SIF and the T-stress. The evaluation is carried out with the aim to investigate the influence of the input data in the system of equations solved with the LSF, and in particular: the number of coefficients used in the Williams’ series and the choice and position of the fitted experimental data points. Three algorithms for the determination of the crack tip position are also evaluated: a coarse g…
Locally convex quasi $C^*$-normed algebras
2012
Abstract If A 0 [ ‖ ⋅ ‖ 0 ] is a C ∗ -normed algebra and τ a locally convex topology on A 0 making its multiplication separately continuous, then A 0 ˜ [ τ ] (completion of A 0 [ τ ] ) is a locally convex quasi ∗-algebra over A 0 , but it is not necessarily a locally convex quasi ∗-algebra over the C ∗ -algebra A 0 ˜ [ ‖ ⋅ ‖ 0 ] (completion of A 0 [ ‖ ⋅ ‖ 0 ] ). In this article, stimulated by physical examples, we introduce the notion of a locally convex quasi C ∗ -normed algebra, aiming at the investigation of A 0 ˜ [ τ ] ; in particular, we study its structure, ∗-representation theory and functional calculus.