Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 8,123 papers for “Transpose”

Transpose

NC DOCKS at Western Carolina University, Roberson, Renee M. · NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro) · 2015

My thesis study explores a variety of themes voicing several binary oppositions, creating abstractforms transposed from industrial or craft-based materials. These themes include relationshipsbetween conventionally “masculine” and “feminine” roles; work versus home; dependenceversus independence; and freedom and constraint. These themes are investigated through anexploration of materiality (metal, glass and fibers) process (welding, weaving, embroidery, glassblowing)and arrangement.

Cited by 0

Transpose

NC DOCKS at North Carolina Central University, Renee M. Roberson · NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro) · 2015

My thesis study explores a variety of themes voicing several binary oppositions, creating abstractforms transposed from industrial or craft-based materials. These themes include relationshipsbetween conventionally “masculine” and “feminine” roles; work versus home; dependenceversus independence; and freedom and constraint. These themes are investigated through anexploration of materiality (metal, glass and fibers) process (welding, weaving, embroidery, glassblowing)and arrangement.

Cited by 0

TransPose

Xinyu Yi, Yuxiao Zhou, Feng Xu · ACM Transactions on Graphics · 2021

Motion capture is facing some new possibilities brought by the inertial sensing technologies which do not suffer from occlusion or wide-range recordings as vision-based solutions do. However, as the recorded signals are sparse and quite noisy, online performance and global translation estimation turn out to be two key difficulties. In this paper, we present TransPose, a DNN-based approach to perform full motion capture (with both global translations and body poses) from only 6 Inertial Measurement Units (IMUs) at over 90 fps. For body pose estimation, we propose a multi-stage network that estimates leaf-to-full joint positions as intermediate results. This design makes the pose estimation much easier, and thus achieves both better accuracy and lower computation cost. For global translation estimation, we propose a supporting-foot-based method and an RNN-based method to robustly solve for the global translations with a confidence-based fusion technique. Quantitative and qualitative comparisons show that our method outperforms the state-of-the-art learning- and optimization-based methods with a large margin in both accuracy and efficiency. As a purely inertial sensor-based approach, our method is not limited by environmental settings (e.g., fixed cameras), making the capture free from common difficulties such as wide-range motion space and strong occlusion.

Cited by 164

Mirror Flip Transpose

Schreiber, Michael · Acervo Digital da Universidade Estadual Paulista (Universidade Estadual Paulista) · 2011

Transform the given grid of colors at the top into the target grid at the bottom. Combine the three available operations: mirror, reverse and transpose

Cited by 0

(·)H Hermitian transpose

Zhijie Chen, Athanassios Manikas · 2015

Abstract—In this paper a novel approach is proposed for estimating the direction-of-departure (DOD) in a frequency-selective multipath channel, where both the transmitter (Tx) and receiver (Rx) employ an antenna array. In particular, the proposed approach exploits the cooperation between the Tx and Rx beamformers, such that the Tx beamformer rotates its mainlobe in a synchronized manner that is known to the Rx. This operation allows the DODs of the multiple paths to be estimated at the Rx by making a set of power measurements. The performance of the proposed approach is investigated using computer simulation studies. NOTATIONS

Cited by 0

Parallel Matrix Transpose . . .

Jaeyoung Choi, Jack J. Dongarra, David W. Walker · 1993

This paper describes parallel matrix transpose algorithms on distributed memory concurrent processors. We assume that the matrix is distributed over a P \\Theta Q processor template with a block scattered data distribution. P , Q, and the block size can be arbitrary, so the algorithms have wide applicability. The communication schemes of the algorithms are determined by the greatest common divisor (GCD) of P and Q. If P and Q are relatively prime, the matrix transpose algorithm involves complete exchange communication. If P and Q are not relatively prime, processors are divided into GCD groups and the communication operations are overlapped for different groups of processors. Processors transpose GCD wrapped diagonal blocks simultaneously, and the matrix can be transposed with LCM=GCD steps, where LCM is the least common multiple of P and Q. The algorithms make use of non-blocking, point-to-point communication between processors. The use of nonblocking communication allows a processor ...

Cited by 0

Sparse matrix transpose unit

Pyrrhos Stathis, D. Cheresiz, S. Vassiliadis et al. · 2004

Summary form only given. A large number of scientific applications involve the operation on, and manipulation of sparse matrices. Irregular structure of these matrices, however, causes hardware that otherwise behaves efficient on regular data to severely suffer in performance when handling sparse matrices. In order to tackle this problem, a scheme consisting of a novel hierarchical sparse matrix (HiSM) storage format and an associated architectural concept have been presented. We propose, describe, and evaluate a hardware mechanism to facilitate transposition of a sparse matrix stored in the HiSM format. The proposed hardware is meant to be embedded in a vector processor as a functional unit. The main part of the unit consists of an s /spl times/ s word in-processor memory, where s is the vector processor's section size. We determine suitable parameters for the proposed mechanism and study the performance of HiSM-based transposition using the matrices from the D-SAB benchmark suite. We show that the HiSM-based transposition executed on a vector processor equipped with the proposed unit exhibits speedups of up to 32.0 times with respect to the transposition based on the most widely used compressed row storage format and executed on a standard vector processor. When considering average speedup, depending on the properties of matrices being transposed, such as the size and the organization of nonzero elements, a speedup by a factor between 15.5 and 20 has been observed.

Cited by 6

Optical transpose interconnection system

Gary Marsden, Philippe Marchand, Phil Harvey et al. · Optical Society of America Annual Meeting · 1992

The optical transpose interconnection system (OTIS) is an optical interconnection scheme that provides transpose transformations on 2-D indexed 2-D arrays of transmitters and detectors. These transformations are required in shuffle-tree graph 1 (STG) architectures. The STG supports various matrix computations, such as matrix transpose, vector outer-product, and matrix-vector multiplications. These computations are useful for signal processing, artificial intelligence, relational databases, artificial neural systems, and crossbar interconnections. The OTIS optical system can also be used to implement <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="eq1" display="inline"> <mml:mrow> <mml:msqrt> <mml:mtext>N</mml:mtext> </mml:msqrt> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> -shuffle 2 multistage interconnection networks (MINs) which have the advantage that only a constant number of optical stages is required for routing or sorting applications. The OTIS optical system is bi-directional. This can prove useful for backpropagation neural networks and MINs. In this case, it allows blocking information inside the MIN to be accessed by a data packet sender. We will present the design and experimental demonstration of the OTIS optical system. We will also present the necessary electronics that connect the transmitter and detector subarrays allowing efficient optoelectronic implementations of shuffle-tree graphs and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="eq2" display="inline"> <mml:mrow> <mml:msqrt> <mml:mtext>N</mml:mtext> </mml:msqrt> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> -shuffle architectures.

Cited by 0

Asynchronous transpose-matrix architectures

J. Tierno, Prabhakar Kudva · 1997

The matrix transposition operation is a necessary step in several image/video compression and decompression algorithms, in particular the discrete cosine transform (DCT) and its inverse (IDCT), and some distributed arithmetic applications. These algorithms have to be performed at high data-rates, and with a minimum of power dissipation for portable applications. The authors describe how the clocked solution is usually implemented, and present two new asynchronous architectures that perform matrix transposition. These architectures, one based on two phase signaling, one based on four phase signaling, have better characteristics than the clocked solution in terms of latency and power, at no cost in area or throughput. They discuss the characteristics of these three architectures and evaluate the relative advantages of each one.

Cited by 1

Optical transpose interconnection system

Philippe Marchand, Gary Marsden, Sadik C. Esener · 1993

Optical interconnections have been shown to have advantages over electrical interconnections in terms of speed, energy and density for global links.

Cited by 0