Imbuing robots with personality has been shown to be an effective design approach in HRI, promoting user trust and acceptance. We explore personality design in a non-anthropomorphic voice-assisted home robot. Our design approach developed three distinct robot personas: Butler, Buddy, and Sidekick, intended to differ in proactivity and emotional impact. Persona differences were signaled to users by a combination of humanoid (speech, intonation), and indirect cues (colors and movement). We use Big Five personality theory to evaluate perceived differences between personas in an exploratory Wizard of Oz study. Participants were largely able to recognize underlying personality traits expressed through these cue combinations in ways that were consistent with our design goals. The proactive Buddy persona was judged as more Extravert than the more passive Sidekick persona, and the Butler persona was perceived as more Conscientious and less Neurotic than either Buddy or Butler personas. Users also had clear preferences between different personas; they wanted robots that mimicked but accentuated their own personality. Results suggest that future designs might exploit abstract cues to signal personality traits.

The processor failures in a multiprocessor system have a negative impact on its distributed computing efficiency. Because of the rapid expansion of multiprocessor systems, the importance of fault diagnosis is becoming increasingly prominent. The [Formula: see text]-component diagnosability of [Formula: see text], denoted by [Formula: see text], is the maximum number of nodes of the faulty set [Formula: see text] that is correctly identified in a system, and the number of components in [Formula: see text] is at least [Formula: see text]. In this paper, we determine the [Formula: see text]-component diagnosability of general networks under the PMC model and MM[Formula: see text] model. As applications, the component diagnosability is explored for some well-known networks, including complete cubic networks, hierarchical cubic networks, generalized exchanged hypercubes, dual-cube-like networks, hierarchical hypercubes, Cayley graphs generated by transposition trees (except star graphs), and DQcube as well. Furthermore, we provide some comparison results between the component diagnosability and other fault diagnosabilities.

No abstract

No abstract

The design of interconnection networks is a fundamental aspect of high-performance computing (HPC) systems. Among the available topologies, the Galaxyfly network stands out as a low-diameter and flexible-radix network for HPC applications. Given the paramount importance of collective communication in HPC performance, in this paper, we present two different all-to-all broadcast algorithms for the Galaxyfly network, which adhere to the supernode-first rule and the router-first rule, respectively. Our performance evaluation validates their effectiveness and shows that the first algorithm has a higher degree of utilization of network channels, and that the second algorithm can significantly reduce the average time for routers to collect packets from the supernode.