Slip detection plays a pivotal role in the dexterity of robotics, improving the reliability and precision of manipulations but also contributing to safety, efficiency, and adaptability. Deep learning-based slip detection algorithms commonly difficult to concentrate on key features when faced with dense 3D shape data obtained by visuo-tactile sensors. Data from noncontact locations can interfere with slip judgements and the ignorance of interframe linkage can also lead to slip detection failure. In this paper, a new spatio-temporal sequences fusion-based self-attention, STNet, is proposed to perform slip detection by allocating more attention to the object-sensor contact area when processing complex 3D shape data. A binocular visuo-tactile system (BVTS) is designed and fabricated for dataset construction. The entire 3D shape dataset containing 4 motion patterns, including stationary, pressing, rolling and slipping. Self-attention architecture with and without spatio-temporal sequences fusion mechanism (denoted as STNet and TemNet, respectively) are trained based on the same dataset. The experiments show the validity of STNet, which can reach 98.91% slip detection accuracy. Meanwhile, the ablation studies confirm the effectiveness of the spatio-temporal sequences fusion mechanism.

Leveraging the traditional virtual network concept, some recent research works have proposed the Virtual Data Center (VDC) as an abstraction to capture both bandwidth and compute/storage resource requirements for an application. However a virtual node in a VDC is limited to a virtual machine (VM), which can only be embedded onto a single physical machine. This condition limits the applicability of the VDC abstraction and the potential of deploying parallel computing. In this paper, we propose a new abstraction based on our Application Centric Network Virtualization (ACNV) approach. Specifically, we model a service application offered by a service provider as a virtual network of service function nodes, which closely matches the service provider's view on the architecture of the application. An infrastructure provider that hosts the application decides how to map the virtual network to the substrate network. Different from the VDC abstraction, each virtual node in our proposed abstraction can be split and mapped onto multiple physical machines, which allows the infrastructure provider to provide auto scaling for the application with variable number of physical machines for exploring the full benefits of parallel computing. We also allow multiple virtual nodes to be mapped and colocated in the same physical machine to minimize resource fragmentation and communication overhead. Extensive simulation results show that the proposed ACNV abstraction outperforms existing VDC-like approaches in achieving optimal resource usage.

Outsourcing private data and heavy computation tasks to the cloud may lead to privacy breach as attackers (e.g., malicious outsiders or cloud administrators) may correlate any relevant information to penetrate information of their interests. Therefore, how to preserve cloud users' privacy has been a top concern when adopting cloud solutions. In this paper, we investigate the identity privacy problem for the proxy re-encryption, which allows any third party (e.g., cloud) to re-encrypt ciphertexts in order to delegate the decryption right from one to another user. The relevant identity information, e.g., whose ciphertext was re-encrypted to the ciphertext under whose public key, may leak because re-encryption keys and ciphertexts (before and after re-encryption) are known to the third party. We review prior anonymity (identity privacy) notions, and find that these notions are either impractical or too weak. To address this problem thoroughly, we rigorously define the anonymity notion that not only embraces the prior anonymity notions but also captures the necessary anonymity requirement for practical applications. In addition, we propose a new and efficient proxy re-encryption scheme. The scheme satisfies the proposed anonymity notion under the Squared Decisional Bilinear Diffie-Hellman assumption and achieves security against chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. To the best of our knowledge, it is the first proxy re-encryption scheme attaining both chosen-ciphertext security and anonymity simultaneously.

Network virtualization is a promising technology for the next generation network, which is required to offer a more dynamic and flexible network infrastructure. Virtual network embedding plays a vital role in the resource allocation of network virtualization. Current virtual network embedding allocates resources in an exclusive and excessive manner. For example, the whole bandwidth amount of the virtual network's peak traffic demand is allocated to the virtual network with full availability. However, such excessive resource allocation may result in resource under-utilization, leading to high user cost and low carrier revenue. To address this problem, we propose a new dynamic resource pooling and trading mechanism. The proposed mechanism is formulated as a Stackelberg game, using bandwidth as an example of the resources. We compare the user cost and the carrier revenue under the proposed mechanism against those under the exclusive resource allocation schemes. Our results show that under certain conditions, the "win-win" situation, in which the user saves cost and the carrier increases its revenue, exists and the optimal Subgame Perfect Equilibrium (SPE) point can be found.

The leakage current existing in the bitline of SRAM has attracted more and more concerns for the operation of high-performance SRAM design, especially with the decrease of the threshold voltage of the transistor for high-performance demand, the leakage current would increase exponentially. The increased leakage current may slowdown the performance of the read operation of SRAM because the existence of the leakage current in the bitline may postpone the time to resolve the sufficient differential bitline voltage for SA to sense correctly. In this paper, a new bitline leakage current compensation circuit has been proposed. Different from the traditional technique, the proposed bitline leakage current compensation circuit cancels the "pre-determined" leakage current compensation process. Therefore, it dodges the dilemma where the performance of the SRAM may be degraded in some circumstances if the bit-line leakage current is compensated pre-determinedly. The simulation results show that by adopting the proposed compensation circuit, the time needed to develop 1/2 VDD can be reduced by almost 126.4% under the tt process corner.