A multiprocessor system is classified as t/s-diagnosable if it is possible to pinpoint all malfunctioning processors within a group of no more than s processors, assuming the total number of faults does not surpass t. The notion of t/(t + 1)-diagnosability represents the highest value of k for which the system is considered k/(k + 1)-diagnosable. This metric has received considerable attention in prior research concerning various multiprocessor systems. This paper's significant contributions include introducing a necessary and sufficient criterion for t/(t + 1)-diagnosability of multiprocessor systems under the PMC model. Moreover, we assess the t/(t + 1)-diagnosability for an n-dimensional alternating group graph AGn within the same model. Specifically, we find that the diagnosability of AG4 is 5, AG5 is 13, and for n >= 6, the diagnosability of AGn is 6n-16.
This paper studies secure multi-party computation (secure MPC) protocols constructed by secret-sharing techniques. One of well-known secret-sharing-based secure MPC protocols is the CCD protocol previously developed by Chaum, Crepeau and Da & ring;mgard which is of high efficiency. However, the CCD-based MPC protocol has a limitation that the number of participants is required to be larger than 2. Until now, it is still unknown whether there a CCD-based secure two-party computation (secure 2PC) protocol exists or not. In this work, we address this open problem by first defining the feasibility of CCD-based secure 2PC protocol construction. Then, based on the feasibility definition, we give an impossibility proof for constructing a CCD-based secure 2PC protocol.
Visual testing for cross-browser testing is an essential part of web automated regression testing. However, there is an inevitable challenge in visual testing, which is "dynamic content." Dynamic content, such as advertisements and news, constantly changes its appearance over and overAtime. AExisting visual testing tools fail to handleAdynamic content, and some even treat it as cross-browser incompatibilities (XBIs), Athen generate false positives warning to developer. Currently there are two types of approaches to identifying dynamic content. First, manually marking the positions of dynamic content does not signifi-cantly alleviate the developers' workload. ASecond, repeatedly executing the website on the same browser and regarding different pixels as dynamic content. However, this method can lead to false judgments. In this paper, we propose a Siamese network-based comparison approach to detect visual disparities by comparing the visual structuresAofAa webpage rendered by two browsers. This approach can identify cross-browser inconsistencies and accommodate minor element shifts, achieving a high F1-score of 0.9749. A comparison with the usage of structural similarity (SSIM) and multi-scale structural similarity (MS-SSIM) is also carried out and discussed.
The vision of the Internet of Things (IoT) involves devices seamlessly communicating and collaborating over a network. However, IoT devices often face significant limitations due to limited computing power and energy consumption, which require dedicated networks tailored to specific use cases. This, in turn, complicates inter-device communication across different networks. Although the Web of Things (WoT) and 6LoWPAN have addressed some of these challenges, implementing 6LoWPAN over non-IEEE 802.15.4 networks, such as BLE, has proven to be complex and inefficient. This paper proposes a novel RESTful programming model, called WeBLE (Web of BLE devices), that enables access to devices in BLE networks as if they were WoT endpoints (Web resources) on an IP network, without modifying the existing protocol stack. We address three key challenges in achieving transparency - addressability, accessibility, and findability - and design solutions to address these issues. These mechanisms not only enhance device interoperability but also lay the foundation for more robust and scalable IoT applications.
The integration of dual-message encoding in a single quick response (QR) code has been a challenge because of standard reader limitations. In this paper, we present a novel two-level QR code system that enables the encoding of two distinct messages, discernible through standard QR code readers with and without a colored cellophane mask. Our method enhances QR code interactivity by leveraging color module design and optical filtering. Thus, it offers high feasibility and practical applications in diverse settings. Our experiments demonstrate a high scanning success rate, particularly with the red and green color combination, showcasing the robustness of our approach. Our code and experimental data are available at https://github.com/yjhuang-tw/color-masked-qr-code/.
