scholarly journals Higher-order functional languages and intensional logic

1999 ◽  
Vol 9 (5) ◽  
pp. 527-564 ◽  
Author(s):  
P. RONDOGIANNIS ◽  
W. W. WADGE
Keyword(s):  
Broad Class ◽  
Higher Order ◽  
Final Outcome ◽  
Intensional Logic ◽  
New Technique ◽  
Functional Languages ◽  
Order Zero ◽  
Functional Program ◽  
Source Program ◽  
Context Manipulation

In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates user-defined functions from the source program, by appropriately introducing context manipulation (i.e. intensional) operators. The transformation takes place in M steps, where M is the order of the initial functional program. During each step the order of the program is reduced by one, and the final outcome of the algorithm is an M-dimensional intensional program of order zero. As the resulting intensional code can be executed in a purely tagged-dataflow way, the proposed approach offers a promising new technique for the implementation of higher-order functional languages.

Two-Dimensional Local Deep-Level Transient Spectroscopy Imaging Using Super-Higher-Order Scanning Nonlinear Dielectric Microscopy

2016 ◽  
Author(s):  
N. Chinone ◽  
Y. Cho ◽  
R. Kosugi ◽  
Y. Tanaka ◽  
S. Harada ◽  
...  
Keyword(s):  
Deep Level Transient Spectroscopy ◽  
Deep Level ◽  
Higher Order ◽  
Trap Density ◽  
New Technique ◽  
Two Dimensional ◽  
Nonlinear Dielectric ◽  
Annealing Conditions ◽  
Transient Spectroscopy ◽  
A New Technique

Abstract A new technique for local deep level transient spectroscopy (DLTS) imaging using super-higher-order scanning nonlinear dielectric microscopy is proposed. Using this technique. SiCVSiC structure samples with different post oxidation annealing conditions were measured. We observed that the local DLTS signal decreases with post oxidation annealing (POA), which agrees with the well-known phenomena that POA reduces trap density. Furthermore, obtained local DLTS images had dark and bright areas, which is considered to show the trap distribution at/near SiCVSiC interface.

First-order functional languages and intensional logic

1997 ◽  
Vol 7 (1) ◽  
pp. 73-101 ◽  
Author(s):  
P. RONDOGIANNIS ◽  
W. W. WADGE
Keyword(s):  
Point Of View ◽  
Intensional Logic ◽  
Functional Languages ◽  
Practical Point ◽  
First Order ◽  
Formal Basis

The purpose of this paper is to demonstrate that first-order functional programs can be transformed into intensional programs of nullary variables, in a semantics preserving way. On the foundational side, the goal of our study is to bring new insights and a better understanding of the nature of functional languages. From a practical point of view, our investigation provides a formal basis for the tagging mechanism that is used in the implementation of first-order functional languages on dataflow machines.

New Technique to Excite Higher-Order Radiating Mode in a Cylindrical Dielectric Resonator Antenna

2014 ◽  
Vol 13 ◽  
pp. 15-18 ◽  
Author(s):  
Debatosh Guha ◽  
Archita Banerjee ◽  
Chandrakanta Kumar ◽  
Yahia M. M. Antar
Keyword(s):  
Dielectric Resonator ◽  
Higher Order ◽  
New Technique ◽  
Dielectric Resonator Antenna

FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE

1995 ◽  
Vol 05 (01n02) ◽  
pp. 37-51 ◽  
Author(s):  
NAOKI KATOH ◽  
KAZUO IWANO
Keyword(s):  
Voronoi Diagrams ◽  
Search Space ◽  
Higher Order ◽  
Efficient Algorithms ◽  
New Technique ◽  
Enumeration Problems ◽  
A New Technique ◽  
Geometric Enumeration

We study the problem of enumerating k farthest pairs for n points in the plane and the problem of enumerating k closest/farthest bichromatic pairs of n red and n blue points in the plane. We propose a new technique for geometric enumeration problems which iteratively reduces the search space by a half and provides efficient algorithms. As applications of this technique, we develop algorithms, using higher order Voronoi diagrams, for the above problems, which run in O(min{n2, n log n+k4/3log n/log1/3 k}) time and O(n+k4/3/log1/3 k+k log n) space for general Lp metric with p≠2, and O(min{n2, n log n+k4/3}) time and O(n+k4/3+k log n) space for L2 metric. For the problem of enumerating k closest/farthest bichromatic pairs, we shall also discuss the case where we have different numbers of red and blue points. To the authors’ knowledge, no nontrivial algorithms have been known for these problems and our algorithms are faster than trivial ones when k=o(n3/2).

A NEW TECHNIQUE FOR CLASSIFICATION OF DIGITAL SIGNAL TYPES

2008 ◽  
Vol 17 (05) ◽  
pp. 957-971
Author(s):  
ATAOLLAH EBRAHIMZADEH ◽  
ABOLFAZL RANJBAR ◽  
MEHRDAD ARDEBLILPOUR
Keyword(s):  
High Performance ◽  
Cross Validation ◽  
Digital Signal ◽  
Higher Order ◽  
New Technique ◽  
Communication Signals ◽  
Communication Signal ◽  
A New Technique ◽  
Fold Cross Validation

Classification of the communication signals has seen under increasing demands. In this paper, we present a new technique that identifies a variety of digital communication signal types. This technique utilizes a radial basis function neural network (RBFN) as the classifier. Swarm intelligence, as an evolutionary algorithm, is used to construct RBFN. A combination of the higher-order moments and the higher-order cumulants up to eight are selected as the features of the considered digital signal types. In conjunction with RBFN, we have used k-fold cross-validation to improve the generalization potentiality. Simulation results show that the proposed technique has high performance for classification of different communication signals even at very low signal-to-noise ratios.

Sign in / Sign up

Export Citation Format

Share Document