Search results for "Identifiability"
showing 10 items of 35 documents
Numeral classifiers in East Asia
2017
AbstractThe understanding of the functional range of numeral classifiers requires a combined effort from different theoretical approaches and the integration of findings from syntax, semantics and pragmatics. This article demonstrates how such an integrative perspective creates new insights into classifiers in Sinitic languages in the fields of counting and word order, the expression of definiteness and indefiniteness and the syntax of verbal classification.
Closedness properties in team learning of recursive functions
1997
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: “Does the identifiability of classes U1 and U2 imply the identifiability of U1∪U2?” In this paper we are interested in a more general question: “Does the identifiability of every union of n−1 classes out of U1,...,Un imply the identifiability of U1∪...∪Un?” If the answer is positive, we call such identification type n-closed. We show that n-closedness can be equivalently formulated in terms of team learning. After that we find for which n team identification in the limit and team finite identification t…
Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
1994
Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…
Closedness properties in ex-identification
2001
In this paper we investigate in which cases unions of identifiable classes are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we and n such that (1) if every union of n − 1 classes out of U1, ... , Un is identifiable, so is the union of all n classes; (2) there are classes U1, ... ,Un−1 such that every union of n−2 classes out of them is identifiable, while the union of n − 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of cl…
On the improved Estimation of the Compliance-Parameters of the Physiologically Closed Cardiovascular System
1987
The influence of the type of the sampling-schedule and of the system-excitation with respect to identifiability and estimation-accuracy of the compliance-parameters of a nonlinear model of the physiologically closed cardiovascular system will be investigated. Using the sensitivity-functions of the arterial systemic pressure with respect to the compliance-parameters it will be shown how to select the sample-schedule and system-excitation in order to get optimal estimation-accuracy.
A comprehensive analysis for N2O mechanisms by advanced mathematical techniques
2018
Recent evaluation of the existing activated sludge models, incorporating nitrous oxide (N2O) formation, is only based on the capabilities and inabilities in describing experimental data under different conditions. This paper will present an advanced mathematical modeling framework (i.e. coupling global sensitivity, identifiability and uncertainty analysis) for a comprehensive analysis on the evaluation of the structural differences among three ammonia oxidizing bacteria (AOB) two-pathway models in combination with two heterotrophic denitrification models. The analysis will be performed based on experimental data from a lab-scale deammonification granular sequencing batch reactor operated un…
Derived sets and inductive inference
1994
The paper deals with using topological concepts in studies of the Gold paradigm of inductive inference. They are — accumulation points, derived sets of order α (α — constructive ordinal) and compactness. Identifiability of a class U of total recursive functions with a bound α on the number of mindchanges implies \(U^{(\alpha + 1)} = \not 0\). This allows to construct counter-examples — recursively enumerable classes of functions showing the proper inclusion between identification types: EXα⊂EXα+1.
New Results on Identifiability of Nonlinear Systems
2004
Abstract In this paper, we recall definition of identifiability of nonlinear systems. We prove equivalence between identifiability and smooth identifiability. This new result justifies our definition of identifiability. In a previous paper (Busvelle and Gauthier, 2003), we have established that • If the number of observations is three or more, then, systems are generically identifiable. • If the number of observations is 1 or 2, then the situation is reversed. Identifiability is not at all generic. Also, we have completely classified infinitesimally identifiable systems in the second case, and in particular, we gave normal forms for identifiable systems. Here, we will give similar results i…
Parameter subset selection for the dynamic calibration of activated sludge models (ASMs): experience versus systems analysis.
2007
In this work we address the issue of parameter subset selection within the scope of activated sludge model calibration. To this end, we evaluate two approaches: (i) systems analysis and (ii) experience-based approach. The evaluation has been carried out using a dynamic model (ASM2d) calibrated to describe nitrogen and phosphorus removal in the Haaren WWTP (The Netherlands). The parameter significance ranking shows that the temperature correction coefficients are among the most influential parameters on the model output. This outcome confronts the previous identifiability studies and the experience based approaches which excluded them from their analysis. Systems analysis reveals that parame…
A systematic approach for fine-tuning of fuzzy controllers applied to WWTPs
2010
A systematic approach for fine-tuning fuzzy controllers has been developed and evaluated for an aeration control system implemented in a WWTP. The challenge with the application of fuzzy controllers to WWTPs is simply that they contain many parameters, which need to be adjusted for different WWTP applications. To this end, a methodology based on model simulations is used that employs three statistical methods: (i) Monte-Carlo procedure: to find proper initial conditions, (ii) Identifiability analysis: to find an identifiable parameter subset of the fuzzy controller and (iii) minimization algorithm: to fine-tune the identifiable parameter subset of the controller. Indeed, the initial locatio…