Non-recursive Types Research Articles

등위접속사의 분류와 통사 현상에 관한 연구

This paper presents an approach to a further classification of English central coordinating conjunctions such as and, or, but, and their syntactic properties. In this approach it is argued that the central coordinating conjunctions can be classed under a recursive type- and, or and a non-recursive type- but. The recursive type is subdivided into omissible(and) and non-omissible(or) types according to the optional omissibility of coordinating conjunctions. This taxonomy can explain the syntactic properties that the recursive type has a strong preference in gapping constructions and it can form a complex coordinate conjunction- and/or. In addition, the classification can reflect that only the non-recursive type displays subsective gradience with adverbs and prepositions.

Block-Adaptive Selection of Recursive and Non-Recursive Type Intra Prediction Modes for Image Coding

Block-Adaptive Selection of Recursive and Non-Recursive Type Intra Prediction Modes for Image Coding

Neural network principle of implementation of digital filters

Comparative evaluations of the frequency responses (FR) of two types of filters implemented by the classical and neural network methods are carried out. It is shown that the neural network principle of the implementation of digital filters can serve as an alternative to the classical method for specifically defined parameters of FR in the pass bands and attenuation bands of the frequencies of signal spectrum. The simplest method for calculating the parameters of the filters’ difference equations is the neural network approach, regardless of the type of classification of discrete and digital filters. The implementation of TM (transmultiplexer) on a digital element base requires the use of methods of filtering, modulating and demodulating signals that are largely different from traditional analog methods. The frequency responses of non-recursive types of filters presented in the paper are based on the property of the approximable function determined only in the pass bands and attenuation bands of the frequencies of signal spectrum.

Characteristics of recursive and non-recursive adaptive network-based fuzzy inference system models for the forecast of typhoon inundation levels

The accurate forecasting of typhoon inundation levels is vital for damage mitigation actions during such an event. The objective of this paper is to investigate the characteristics of adaptive network-based fuzzy inference system models for the forecasting of typhoon inundation levels. A novel approach of recursively using the model to achieve higher prediction lead times is proposed. The approach is advantageous in conducting water level forecasts for various prediction lead times using a single model, whereas common non-recursive models are only applicable for the designed prediction leads. In this study, a total of 6 models, with various configurations and types of recursions, are constructed based on the cross-correlations between rainfall and water level records. The performance of each model is evaluated and compared using three indices: coefficient of efficiency, relative time shift, and threshold statistics. The best recursive and non-recursive models are selected and compared with traditional approaches based on autoregressive models with exogenous input. The results show that although the recursive models display somewhat lesser but comparable forecasting capacities compared to the non-recursive models, the former models have achieved forecasts single handedly for all the prediction leads using single models only. On the other hand, although the non-recursive models exhibit better forecasting capacities, this is at the cost of using multiple models, with each designed for a specific prediction lead time. In comparison with other traditional approaches, both the recursive and non-recursive types of models demonstrate superior performance on all the aspects inspected.

Randomised algorithms for isomorphisms of simple types

We give the first linear time (randomised) algorithm for thefirst order isomorphism problem, that is, the isomorphism of non-recursive types involving product- and function-type constructors, under the axioms of commutativity and associativity of products, currying and distributivity of functions over products. This problem can also be thought of as the problem of formal equality-testing of multi-variate expressions involving only multiplications and exponentiation. Previous work gave a deterministicO(nlog2n) time andO(n) space algorithm for the problem (nbeing the input size). Our specific contribution includes two randomised algorithms for the problem:(i)anO(n) timeMonte Carloalgorithm (that is, with a small probability it may decide erroneously that the two types are isomorphic), and(ii)anO(nlogn) expected time andO(n) spaceLas Vegasalgorithm (that is, with a small probability it may execute long).The algorithms rely on a preprocessing stage, which computes the sequence of the firstnprimes inO(nlogn/log logn) time and space.

Efficient algorithms for isomorphisms of simple types

The first-order isomorphism problem is to decide whether two non-recursive types using product- and function-type constructors are isomorphic under the axioms of commutative and associative products, and currying and distributivity of functions over products. We show that this problem can be solved in time of the best previous algorithm for this problem.

Efficient algorithms for isomorphisms of simple types

The first order isomorphism problem is to decide whether two non-recursive types using product- and function-type constructors, are isomorphic under the axioms of commutative and associative products, and currying and distributivity of functions over products. We show that this problem can be solved in O ( n log 2 n ) time and O ( n ) space, where is n the input size. This result improves upon the O ( n log 2 n ) time and O ( n 2 ) space bounds of the best previous algorithm. We also describe an O ( n ) time algorithm for the linear isomorphism problem , which does not include the distributive axiom, whereby improving upon the O ( n log n ) time of the best previous algorithm for this problem.

A universality theorem for PCF with recursive types, parallel-or and ∃

In a PCF-like call-by-name typed λ-calculus with a minimal fixpoint operator, ‘parallelor’, Plotkin's ‘continuous existential quantifier’ ∃ and recursive types together with constructors and destructors, all computable objects can be denoted by terms of the programming language. According to A. Meyer's terminology (cf. Meyer (1988)), such a programming language is called universal in the sense that any extension of it must be conservative, as all computable objects can already be expressed by program terms.As a byproduct, we get that, in principle, recursive types could be totally avoided, as they appear as syntactically expressible retracts of the non-recursive type → , where and are the flat domains of natural numbers and boolean values, respectively.

Algebraic and calculus query languages for recursively typed complex objects

Algebraic and calculus database query languages for recursively typed complex objects based on the set and tuple constructs are studied. A fundamental characteristic of such complex objects is that, in them, sets may contain members with arbitrarily deep nesting of tuple and/or set constructs. Relative to mappings from flat relations to flat relations, the algebra without while has the expressive power of the algebra on conventional complex objects with non-recursive types. The algebra plus while has the power of the computable queries. The calculus has power equivalent to the arithmetical hierarchy and also to the calculus with countable invention for conventional complex objects. A technical tool, called “domain Turing machine,” is introduced and applied to characterize the expressive power of several classes of relational queries.