This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme of defining functions inductively with the set as domain. We conclude with defining the scheme of...

This article is a continuation of an article on defining functions on trees (see [6]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme of defining functions inductively with the set as domain. We conclude with defining the scheme of...

A set of blocks which can be a subset of only one t-( v, k, At) design has been termed a defining set of that design. In an earlier paper the author examined the smallest such sets of blocks for certain designs; that work is continued here for further designs. Improved lower bounds for the cardinality of a defining set are given for the affine and projective planes of order n. 1. Defining Sets:...

this paper presents a comprehensive case study on electro-mechanical analysis of mems[1] variable capacitors. using the fundamental mechanical and electrical equations, static and dynamic behaviors of the device are studied. the analysis is done for three different modes, namely: dc (static mode), small signal ac and large signal regime. a complete set of equations defining dynamic behavior of ...

in this paper, weak defining hyperplanes and the anchor points in dea, as an important subset of the set of extreme efficient points of the production possibility set (pps), are used to construct unobserved dmus and in the long run to improve the envelopment of all observed dmus. there has been a surge of articles on improving envelopment in recent years. what has been done first is in constant...