JOINT MODEL AND CRITERION OPTIMAL EXPERIMENT DESIGN

In this paper,a new optimal design criterion--joint model and criterion optimal de-sign criterioon is put forward. The design that is subject to this criterion satisfies many kinds of lin-ear optimal criterion and D-optimal criterion on several experiment models at the same time. Theequivalent condition of this optimal design is given. Its iterative algorithm and the algorithm cover-genee are stated.     

Novel criterion for stability of discrete-time systems in a state-space realization utilizing saturation nonlinearities

A new criterion for the global asymptotic stability of discrete-time systems in a state-space realization utilizing saturation nonlinearities is presented. The form of the criterion is unconventional in that it offers the flexibility of using even an unsymmetric Lyapunov matrix P. A recently reported criterion is shown to be a special case of the present criterion. An example shows the effectiveness of the new criterion.     

Bias correction of cross-validation criterion based on Kullback-Leibler information under a general condition

This paper deals with the bias correction of the cross-validation (CV) criterion to estimate the predictive Kullback-Leibler information. A bias-corrected CV criterion is proposed by replacing the ordinary maximum likelihood estimator with the maximizer of the adjusted log-likelihood function. The adjustment is just slight and simple, but the improvement of the bias is remarkable. The bias of the ordinary CV criterion is O(n^-1), but that of the bias-corrected CV criterion is O(n^-2). We verify that our criterion has smaller bias than the AIC, TIC, EIC and the ordinary CV criterion by numerical experiments.     

On the reduction to a complete class in multiple decision problems (2)

Summary As a criterion for the reduction to a complete class of decision rule in case where actions, samples and states are finite in number, “regret-relief ratio” criterion and “incremental loss-gain ratio” criterion were introduced in 2-state of nature case [2]. In this paper, “generalized regret-relief ratio” criterion ink-state of nature case is introduced as an extension of “regret-relief ratio” criterion and its usefulness is shown with an example. The Institute of Statistical Mathematics     

On semirings satisfying the Baer criterion

It is well-known that for modules over rings the Baer injectivity criterion takes place. In this paper we prove that under one additional condition this criterion is also valid for modules over semirings. We prove that a semiring S satisfies the Baer criterion if and only if all injective (with respect to one-sided ideals of S) semimodules satisfy the above condition. We propose a newmethod for constructing semirings satisfying the Baer criterion.     

Algebraic A-hypergeometric functions

We formulate and prove a combinatorial criterion to decide if an A-hypergeometric system of differential equations has a full set of algebraic solutions or not. This criterion generalises the so-called interlacing criterion in the case of hypergeometric functions of one variable.     

Topological Complexity of Zero-Finding

The topological complexity of zero-finding is studied using a BSS machine over the reals with an information node. The topological complexity depends on the class of functions, the class of arithmetic operations, and on the error criterion. For the root error criterion the following results are established. If only Hölder operations are permitted as arithmetic operations then the topological complexity is roughly −log₂ε and bisection is optimal. This holds even for the small class of linear functions. On the other hand, for the class of all increasing functions, if we allow the sign function or division, together with log and exp, then the topological complexity drops to zero. For the residual error criterion, results can be totally different than for the root error criterion. For example, the topological complexity can be zero for the residual error criterion, and roughly −log₂ε for the root error criterion.     

Elimination of limit cycles in a class of digital filters using single saturation nonlinearity

Using Lyapunov's direct method, a novel frequency-domain criterion for the elimination of limit cycles in a class of digital filters using single saturation nonlinearity is derived. The criterion turns out to be a generalization and improvement over an earlier criterion due to Kar and Singh. An example showing the effectiveness of the criterion is given. A graphical interpretation of a simplified version (involving one free parameter) of the criterion is discussed.     

Classification trees for ordinal variables

We introduce new criteria to obtain classification trees for ordinal response variables. At this aim, Breiman et al. (Classification and regression trees. Wadsworth, Belmont, 1984), extended their twoing criterion to the ordinal case. Following CART procedure, we extend the well known Gini–Simpson criterion to the ordinal case. Referring to the exclusivity preference property (introduced by Taylor and Silverman in Stat Comput 3:147–161, 1993, for the nominal case), suitably modified for the ordinal case, a second criterion is introduced. The hereby proposed methods are compared with the ordered twoing criterion via simulations.     

Criteria for the strong regularity of J-inner functions and γ-generating matrices

The class of left and right strongly regular J-inner mvf's plays an important role in bitangential interpolation problems and in bitangential direct and inverse problems for canonical systems of integral and differential equations. A new criterion for membership in this class is presented in terms of the matricial Muckenhoupt condition (A₂) that was introduced for other purposes by Treil and Volberg. Analogous results are also obtained for the class of γ-generating functions that intervene in the Nehari problem. The new criterion is simpler than the criterion that we presented earlier. A determinental criterion is also presented.