Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Locomotor activity, object exploration and space preference in children with autism and Down syndrome

100%

Kawa R. , Pisula E.

Acta Neurobiologiae Experimentalis

2010

tom 70

nr 2

There have been ambiguous accounts of exploration in children with intellectual disabilities with respect to the course of that exploration, and in particular the relationship between the features of explored objects and exploratory behaviour. It is unclear whether reduced exploratory activity seen with object exploration but not with locomotor activity is autism-specific or if it is also present in children with other disabilities. The purpose of the present study was to compare preschool children with autism with their peers with Down syndrome and typical development in terms of locomotor activity and object exploration and to determine whether the complexity of explored objects affects the course of exploration activity in children with autism. In total there were 27 children in the study. The experimental room was divided into three zones equipped with experimental objects providing visual stimulation of varying levels of complexity. Our results indicate that children with autism and Down syndrome differ from children with typical development in terms of some measures of object exploration (i.e. looking at objects) and time spent in the zone with the most visually complex objects.

A remark on hierarchical threshold secret sharing

100%

Kawa R. , Kula M.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

2012

tom Vol. 12, no. 3

55--64

The main results of this paper are theorems which provide a solution to the open problem posed by Tassa [1]. He considers a specific family Γv of hierarchical threshold access structures and shows that two extreme members Γ∧ and Γv of Γv are realized by secret sharing schemes which are ideal and perfect. The question posed by Tassa is whether the other members of Γv can be realized by ideal and perfect schemes as well. We show that the answer in general is negative. A precise definition of secret sharing scheme introduced by Brickell and Davenport in [2] combined with a connection between schemes and matroids are crucial tools used in this paper. Brickell and Davenport describe secret sharing scheme as a matrix M with n+1 columns, where n denotes the number of participants, and define ideality and perfectness as properties of the matrix M. The auxiliary theorems presented in this paper are interesting not only because of providing the solution of the problem. For example, they provide an upper bound on the number of rows of M if the scheme is perfect and ideal.