Improved transformation algorithms for generalized Galois NLFSRs

2021 ◽  
Author(s):  
Ge Yao ◽  
Udaya Parampalli
Keyword(s):  
Transformation Algorithms

Operational interpretations of an extension of Fω with control operators

1996 ◽  
Vol 6 (3) ◽  
pp. 393-418 ◽  
Author(s):  
Robert Harper ◽  
Mark Lillibridge
Keyword(s):  
Operational Semantics ◽  
Current Control ◽  
Computation Step ◽  
Evaluation Strategies ◽  
Transformation Algorithms ◽  
System F ◽  
Control Operators

AbstractWe study the operational semantics of an extension of Girard's System Fω with two control operators: an abort operation that abandons the current control context, and a callcc operation that captures the current control context. Two classes of operational semantics are considered, each with a call-by-value and a call-by-name variant, differing in their treatment of polymorphic abstraction and instantiation. Under the standard semantics, polymorphic abstractions are values and polymorphic instantiation is a significant computation step; under the ML-like semantics evaluation proceeds beneath polymorphic abstractions and polymorphic instantiation is computationally insignificant. Compositional, type-preserving continuation-passing style (cps) transformation algorithms are given for the standard semantics, resulting in terms on which all four evaluation strategies coincide. This has as a corollary the soundness and termination of well-typed programs under the standard evaluation strategies. In contrast, such results are obtained for the call-by-value ML-like strategy only for a restricted sub-language in which constructor abstractions are limited to values. The ML-like call-by-name semantics is indistinguishable from the standard call-by-name semantics when attention is limited to complete programs.

scholarly journals Features of excitation reconstruction in flat multielement phased antenna array face using dynamic directional patterns

2017 ◽  
pp. 32-39
Author(s):  
S. E. Gavrilova ◽  
A. N. Gribanov ◽  
G. F. Moseychuk ◽  
A. I. Sinani
Keyword(s):  
Antenna Arrays ◽  
High Efficiency ◽  
Phase Distribution ◽  
Radiation Patterns ◽  
Phased Array Antennas ◽  
Phased Antenna Arrays ◽  
Phased Antenna Array ◽  
Transformation Algorithms ◽  
Computational Resources ◽  
Research Show

The study focuses on reconstructing the amplitude-phase distribution of flat multielement passive and active phased antenna arrays with the use of dynamic radiation patterns, measured with electronical scanning without mechanical rotations and antenna movements. The paper describes the measurement settings of dynamic radiation patterns, necessary for reconstructing the amplitude-phase distribution. Findings of the research show that to reconstruct the amplitude-phase distribution according to dynamic radiation diagrams, there is no need for increased computational resources due to the use of Fourier transformation algorithms. After the method was experimentally verified on the specific samples of active phased antenna arrays, its high efficiency was established. The paper gives the examples of reconstructing the amplitude-phase distribution from dynamic radiation patterns in the presence of malfunctions in active phased array antennas.

scholarly journals Understanding and Using the Brief Implicit Association Test: Recommended Scoring Procedures

2016 ◽  
Author(s):  
Brian A. Nosek ◽  
Yoav Bar-Anan ◽  
Natarajan Sriram ◽  
Jordan Axt ◽  
Anthony G. Greenwald
Keyword(s):  
Implicit Association Test ◽  
Evaluation Criteria ◽  
Association Test ◽  
Group Differences ◽  
Implicit Association ◽  
Implicit Measures ◽  
Average Response Time ◽  
Transformation Algorithms ◽  
Criterion Variables ◽  
Explicit Measures

A brief version of the Implicit Association Test (BIAT) has been introduced. The present research identified analytical best practices for overall psychometric performance of the BIAT. In 7 studies and multiple replications, we investigated analytic practices with several evaluation criteria: sensitivity to detecting known effects and group differences, internal consistency, relations with implicit measures of the same topic, relations with explicit measures of the same topic and other criterion variables, and resistance to an extraneous influence of average response time. The data transformation algorithms D outperformed other approaches. This replicates and extends the strong prior performance of D compared to conventional analytic techniques. We conclude with recommended analytic practices for standard use of the BIAT.

Functional transformation algorithms in cad systems

Cybernetics ◽  
1987 ◽  
Vol 22 (6) ◽  
pp. 747-758
Author(s):  
O. V. Tozoni
Keyword(s):  
Functional Transformation ◽  
Cad Systems ◽  
Transformation Algorithms
Sign in / Sign up

Export Citation Format

Share Document