Abstract With the rise of the mobile Internet, APP treatment models for autism have also emerged. In China, there are not many applications of health education for children with autism. Its functions are mainly focused on prevention and improvement of knowledge. Many behavioral therapies include applying pressure to the invisible external pressure of autism to achieve appropriate stimulation and correction. This has brought great injustice to the wishes of the children. When children with autism strongly oppose this unfair behavior, it may lead to other extreme behaviors in children with autism. This article adopts the method of letting children with autism actually apply this APP for comprehensive intervention treatment, and let this APP combine with their daily courses: comprehensive sports training, speech training, cognitive training, game training, self‐care training. For courses such as art training and computer games, the children were evaluated for the first time before training, and then evaluated every 2 months. Data were collected to compare whether the children's background factors had a significant impact on the rehabilitation effect of comprehensive interventions. The results of the experiment proved that in the five assessments of perception, gross motor, fine motor, language and communication, cognition, the children had statistically significant differences in the three scores (P < 0.05). This also shows from the side that our APP has a certain effect on children with autism, and is of great strategic significance for adjuvant treatment of autism.

For the sake of cost-effectiveness, it is a conventional wisdom to employ (k + r,k) erasure codes to archive rarely accessed replicas, i.e. erasure-coded data archival. Existing researches on erasure-coded data archival optimizations are mainly aimed to reduce archival traffic within storage clusters. Apart from archival traffic, both non-sequential reads and imbalanced loads can deteriorate archival performance. Traditional distributed archival schemes (DArch for short) for randomly distributed replicas tend to suffer from two problems: (i) non-sequential reads because underlying file systems split a data block into multiple smaller data chunks and (ii) imbalanced loads since archival tasks are assigned according to data locality of replicas. To overcome such drawbacks, we incorporate both prefetching mechanism and balancing strategy into erasure-coded archival for replica-based storage clusters, and propose three new archival schemes: a prefetching-enabled archival scheme (i.e. P-DArch), a balancing-enabled archival scheme (i.e. B-DArch) and a prefetching-and-balancing-enabled archival scheme (i.e. PB-DArch). We implement a proof-of-concept prototype, where all the four archival schemes are deployed and quantitatively evaluated. The experimental results show that both the prefetching mechanism and balancing strategy can effectively optimize archival performance of a replica-based storage cluster exhibiting a random data layout. In a (12,9) RS-coded archival scenario, P-DArch, B-DArch and PB-DArch outperform DArch by a factor of 2.95, 1.72 and 3.85, respectively.

This paper addresses an issue of erasure-coded data archival, where (k + r; k) erasure codes are employed to archive rarely accessed replicas. The traditional synchronous encodingprocess neither leverages the existence of replicas, nor handles encoding operations in a decentralized manner. To overcome these drawbacks, we exploit pipelined encoding processes to boost the data archival performance on storage clusters. First, we propose two data layouts called [D + P]cdand [3X]cdby applying a chained-declustering mechanism to both Mirrored RAID-5 and triplication redundancy groups. Second, in light of the [D + P]cdand [3X]cdlayouts, we design two archiving schemes named DP and 3X, which exhibit the following three salient features: (i) exploiting data locality-two or three local blocks are read by each involved node for encoding; (ii) decentralized computation load-encoding operations are distributed among k nodes; and (iii) parallel archival processing-two or three encoding pipelines are simultaneously deployed to generate parity blocks. We implement both the DPand 3X schemes and three existing solutions (i.e., SynE, DE, and RapidRAID) in a real-world storage cluster. Experimental results show that our archival schemes outperform the other three solutions in terms of archiving time by a factor of at least 3.41 in a nine-node storage cluster. The experiments strongly indicate that the performance bottleneck of SynE lies in its block-receiving stage; it is disk I/O rather than network traffic that dominates archiving time for both the DE and RapidRAID schemes.

For the estimation of block-motion vectors, common techniques use uniform pixel-decimation patterns to select pixels to evaluate block-matching criterion, while other techniques use adaptive pixel patterns and have achieved better efficiency. However, these adaptive techniques still require an initial division of a block into a set of uniform regions, and therefore, are locally adaptive in essence. Our proposed scheme, which does not fix any regions at the beginning and selects pixels only when they have the features important in determining a match, shows an improvement in performance over the existing adaptive schemes. Our results suggest the usefulness of this method in block-motion estimation for low-bit-rate video coding, particularly in video phone and video conferencing.