Random access-random release relay switching matrix

XY relay switching matrix provides complete random access and random release of 400 points. A mercury-wetted bistable relay with independent set and reset coils is the unique feature associated with each point

Satellite-matrix-switched, time-division-multiple-access network simulator

A versatile experimental Ka-band network simulator has been implemented at the NASA Lewis Research Center to demonstrate and evaluate a satellite-matrix-switched, time-division-multiple-access (SMS-TDMA) network and to evaluate future digital ground terminals and radiofrequency (RF) components. The simulator was implemented by using proof-of-concept RF components developed under NASA contracts and digital ground terminal and link simulation hardware developed at Lewis. This simulator provides many unique capabilities such as satellite range delay and variation simulation and rain fade simulation. All network parameters (e.g., signal-to-noise ratio, satellite range variation rate, burst density, and rain fade) are controlled and monitored by a central computer. The simulator is presently configured as a three-ground-terminal SMS-TDMA network

A Method of Facilitating the Fabrication of Access Openings for Implant-Supported Complete Fixed Dental Prostheses

This report describes a method for fabricating access openings for implant-supported complete fixed dental prostheses (ICFP) by using a dental milling machine and silicone putty matrix. The method can help clinicians achieve the accurate and precise fabrication of access openings for ICFPs without excessive grinding

Privacy in Index Coding: Improved Bounds and Coding Schemes

It was recently observed in [1], that in index coding, learning the coding matrix used by the server can pose privacy concerns: curious clients can extract information about the requests and side information of other clients. One approach to mitigate such concerns is the use of $k$-limited-access schemes [1], that restrict each client to learn only part of the index coding matrix, and in particular, at most $k$ rows. These schemes transform a linear index coding matrix of rank $T$ to an alternate one, such that each client needs to learn at most $k$ of the coding matrix rows to decode its requested message. This paper analyzes $k$-limited-access schemes. First, a worst-case scenario, where the total number of clients $n$ is $2^T-1$ is studied. For this case, a novel construction of the coding matrix is provided and shown to be order-optimal in the number of transmissions. Then, the case of a general $n$ is considered and two different schemes are designed and analytically and numerically assessed in their performance. It is shown that these schemes perform better than the one designed for the case $n=2^T-1$

Tomographic imaging and scanning thermal microscopy: thermal impedance tomography

The application of tomographic imaging techniques developed for medical applications to the data provided by the scanning thermal microscope will give access to true three-dimensional information on the thermal properties of materials on a mm length scale. In principle, the technique involves calculating and inverting a sensitivity matrix for a uniform isotropic material, collecting ordered data at several modulation frequencies, and multiplying the inverse of the matrix with the data vector. In practice, inversion of the matrix in impractical, and a novel iterative technique is used. Examples from both simulated and real data are given

Matrix of Polynomials Model based Polynomial Dictionary Learning Method for Acoustic Impulse Response Modeling

We study the problem of dictionary learning for signals that can be represented as polynomials or polynomial matrices, such as convolutive signals with time delays or acoustic impulse responses. Recently, we developed a method for polynomial dictionary learning based on the fact that a polynomial matrix can be expressed as a polynomial with matrix coefficients, where the coefficient of the polynomial at each time lag is a scalar matrix. However, a polynomial matrix can be also equally represented as a matrix with polynomial elements. In this paper, we develop an alternative method for learning a polynomial dictionary and a sparse representation method for polynomial signal reconstruction based on this model. The proposed methods can be used directly to operate on the polynomial matrix without having to access its coefficients matrices. We demonstrate the performance of the proposed method for acoustic impulse response modeling.Comment: 5 pages, 2 figure