44 resultados para Digital mapping
Resumo:
A new digital polynomial generator using the principle of dual-slope analogue-to-digital conversion is proposed. Techniques for realizing a wide range of integer as well as fractional coefficients to obtain the desired polynomial have been discussed. The suitability of realizing the proposed polynomial generator in integrated circuit form is also indicated.
Resumo:
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
Resumo:
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
Resumo:
A digital correlator has been built which calculates the full correlation function of a statistically stationary random signal.
Resumo:
This paper describes a method for the dynamic digital simulation of HVDC transmission systems. The method employs a novel modular converter representation during both normal and abnormal conditions.
Resumo:
In a recent paper, Srinivasan et al (1980) have described a programmable digital signal averager with facility for programming the sampling period, number of channels and number of sweeps. We have examined this paper in some detail and find that some points need clarification.
Resumo:
In an earlier paper (Part I) we described the construction of Hermite code for multiple grey-level pictures using the concepts of vector spaces over Galois Fields. In this paper a new algebra is worked out for Hermite codes to devise algorithms for various transformations such as translation, reflection, rotation, expansion and replication of the original picture. Also other operations such as concatenation, complementation, superposition, Jordan-sum and selective segmentation are considered. It is shown that the Hermite code of a picture is very powerful and serves as a mathematical signature of the picture. The Hermite code will have extensive applications in picture processing, pattern recognition and artificial intelligence.
Resumo:
This paper describes the application of vector spaces over Galois fields, for obtaining a formal description of a picture in the form of a very compact, non-redundant, unique syntactic code. Two different methods of encoding are described. Both these methods consist in identifying the given picture as a matrix (called picture matrix) over a finite field. In the first method, the eigenvalues and eigenvectors of this matrix are obtained. The eigenvector expansion theorem is then used to reconstruct the original matrix. If several of the eigenvalues happen to be zero this scheme results in a considerable compression. In the second method, the picture matrix is reduced to a primitive diagonal form (Hermite canonical form) by elementary row and column transformations. These sequences of elementary transformations constitute a unique and unambiguous syntactic code-called Hermite code—for reconstructing the picture from the primitive diagonal matrix. A good compression of the picture results, if the rank of the matrix is considerably lower than its order. An important aspect of this code is that it preserves the neighbourhood relations in the picture and the primitive remains invariant under translation, rotation, reflection, enlargement and replication. It is also possible to derive the codes for these transformed pictures from the Hermite code of the original picture by simple algebraic manipulation. This code will find extensive applications in picture compression, storage, retrieval, transmission and in designing pattern recognition and artificial intelligence systems.
Resumo:
A versatile and flexible digital pulse programmer for two-pulse, three-pulse, saturation burst and Carr-Purcell sequences is described. Independently variable controls for pulse widths (0.2 mu s to 100 mu s), delay between pulses (0.2 mu s to 100 s) and for number of pulses (1 to 99) for the saturation burst and for the Carr-Purcell sequence, are brought to the front panel. The programmer can be used for one-shot experiments as well as for repetitive experiments.
Resumo:
A module containing all the functional components required for a digital absolute positioning process of one axis of a machine tool has been designed and constructed. Circuit realization makes use of integrated circuit elements.
Resumo:
Three overlapping assembled epitopes of beta hCG have been mapped using MAb probes and a single step solid phase radioimmunoassay. These epitopes have been shown to be at receptor binding region comprising of the loop region beta Cys93-Cys100. Importance of disulphide bonds in maintaining integrity of these epitopes is assessed. Two MAbs (INN 58 and INN 22) interact with the beta region as well as the alpha C-terminal peptide, while the other MAb INN 24 interacts with only the beta region. Cross-reactivity pattern with beta hCG and hLH as web as the reported crystal structure of hCG substantiates the epitope identification. The results demonstrate utility of MAbs as probes in investigations on three-dimensional structure of gonadatropins.
Resumo:
Identification of epitopes by modification studies has been reported by us recently. The method requires milligram quantities of antigen and since several proteins are not available in large quantities they are not amenable for such an investigation. One such protein is human follicle stimulating hormone (hFSH) whose mapping of epitopes is of importance in reproductive biology. Here we report a method that uses microgram quantities of hFSH to map a beta-specific epitope located at the receptor binding region. This identification has also been validated by the chemical modification method using heterologous antigen ovine follicle stimulating hormone (oFSH).
Resumo:
An epitope scan analysis of the whole sequence of avidin and core streptavidin using polyclonal antibodies to these two antigens reveal the presence of multiple common epitopes in both the proteins. These antigenic determinants consist mostly of either identical or similar residues. The antibody recognition sites in both antigens are shown to be localized to homologous regions.
Resumo:
This paper presents a new numerical integration technique oil arbitrary polygonal domains. The polygonal domain is mapped conformally to the unit disk using Schwarz-Christoffel mapping and a midpoint quadrature rule defined oil this unit disk is used. This method eliminates the need for a two-level isoparametric mapping Usually required. Moreover, the positivity of the Jacobian is guaranteed. Numerical results presented for a few benchmark problems in the context of polygonal finite elements show that the proposed method yields accurate results.