No abstract

The present study aimed to describe the characteristics of auditory abnormalities present in cases of autism. One hundred and fifty six children with autism and 141 matched controls with language delay were investigated via direct observations combined with parent/caregiver reports. All of the autistic individuals demonstrated auditory abnormalities especially in the domain of hyposensitivity, compared with 33.3% of children with language delay. The auditory abnormalities in autism primarily comprised of auditory hyposensitivity, auditory hypersensitivity, phonophobia, and peculiar interests in certain sounds. Participants with autism were rated as having more problems than the language-delayed children in all the items of each domain. No significant differences in the range of auditory abnormalities were observed between mild and severe autistic children except for the presence of phonophobia. Children with autism presented with diverse auditory abnormalities which may be specific features in autism and may play an important role in the early identification of autism.

No abstract

SUMMARYA ternary content-addressable memory (TCAM) is a popular hardware device for performing fast IPaddress lookup. Because keeping all entries sorted in TCAM, we need move the entries for inserting a new entry. In this paper, we have presented a scheme for minimizing route update overheads in TCAM-based forwarding engines. Our optimizations are based on the hierarchy of prefixes in the routing table. The number of memory movement per update depends on the sequence of the new-inserted prefixes, instead of the initial prefixes in routing table. For the real route update traces, the average number of movements is less than 0.01. Further, when compared to an existing optimization algorithm, in the average case, our algorithm shows a 90% reduction in movement overheads.

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distributed dynamic delay-constrained least-cost multicast routing algorithm (DDDCLCMR) to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.