70 resultados para Gross motor function classification system

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): H.5.2, H.2.8, J.2, H.5.3.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): H.2.8, H.3.3.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper we propose a refinement of some successive overrelaxation methods based on the reverse Gauss–Seidel method for solving a system of linear equations Ax = b by the decomposition A = Tm − Em − Fm, where Tm is a banded matrix of bandwidth 2m + 1. We study the convergence of the methods and give software implementation of algorithms in Mathematica package with numerical examples. ACM Computing Classification System (1998): G.1.3.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): I.4.9, I.4.10.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The so called “Plural Uncertainty Model” is considered, in which statistical, maxmin, interval and Fuzzy model of uncertainty are embedded. For the last case external and internal contradictions of the theory are investigated and the modified definition of the Fuzzy Sets is proposed to overcome the troubles of the classical variant of Fuzzy Subsets by L. Zadeh. The general variants of logit- and probit- regression are the model of the modified Fuzzy Sets. It is possible to say about observations within the modification of the theory. The conception of the “situation” is proposed within modified Fuzzy Theory and the classifying problem is considered. The algorithm of the classification for the situation is proposed being the analogue of the statistical MLM(maximum likelihood method). The example related possible observing the distribution from the collection of distribution is considered.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): J.2.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): J.2.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): J.2.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): J.2.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): I.7.4.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): J.2.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): J.2.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): I.2.8, I.2.10, I.5.1, J.2.