Abstract

SS02. 00002: Single and double touch mode capacitive pressure/force sensing technique and approach*

Abstract

Linear n-local networks are compatible with quantum-repeater-based entanglement distribution protocols. Different sources of imperfections such as error in entanglement generation, communication over noisy quantum channels, and imperfections in measurements result in decay of quantumness across such networks. From practical perspectives it becomes imperative to analyze the nonclassicality of quantum network correlations in the presence of different types of noise. The present discussion provides a formal characterization of non-n-local features of quantum correlations in a noisy network scenario. In this context, persistency of non-n-locality has been introduced. Such a notion helps in analyzing decay of non-n-local features of network correlations with increasing length of the linear network in the presence of one or more causes of imperfections.

Abstract

The presence of a new decay mode relaxes the current mass exclusion limits on vectorlike quarks considerably. We consider the case of a weak-singlet vectorlike B quark that can decay to a singlet scalar or pseudoscalar Φ. In an earlier paper [A. Bhardwaj et al., Roadmap to explore vectorlike quarks decaying to a new scalar or pseudoscalar, Phys. Rev. D, 106 (2022) 095014; arXiv:2203.13753], we mapped the possibilities to explore such setups at the LHC. We showed that it is possible for a B quark to decay into Φ and the Φ to dominantly decay to a pair of gluons or b quark(s) without fine-tuning the parameters. In this paper, we present a collider search strategy to look for the pair production of singlet B quarks. If both B’s decay into bΦ pairs, the final state is fully hadronic: BB → (bΦ)(bΦ) → (bgg)(bgg)/(bbb)(bbb), which is very challenging to probe. Therefore, we consider a simpler mixed decay specific to the singlet B case, BB → (bΦ)(tW) with a lepton in the final state, to achieve the best sensitivity at the highluminosity LHC. We use a deep neural network with a weighted cross-entropy loss to separate the signal from the huge SM background. Our analysis shows that large areas of the MB − MΦ parameter space are discoverable through this signature. We show how the discovery and exclusion regions scale with the branching ratio in the new decay mode. We also estimate the reach in the inclusive monolepton channel with the same network model.

Abstract

Autonomous driving requires accurate reasoning of the location of objects from raw sensor data. Recent end-to-end learning methods go from raw sensor data to a trajectory output via Bird’s Eye View(BEV) segmentation as an interpretable intermediate representation. Motion planning over cost maps generated via Birds Eye View (BEV) segmentation has emerged as a prominent approach in autonomous driving. However, the current approaches have two critical gaps. First, the optimization process is simplistic and involves just evaluating a fixed set of trajectories over the cost map. The trajectory samples are not adapted based on their associated cost values. Second, the existing cost maps do not account for the uncertainty in the cost maps that can arise due to noise in RGB images, BEV annotations etc. As a result, these approaches can struggle in challenging scenarios where there is abrupt cutin, stopping, overtaking, merging, etc from the neighbouring vehicles. In this paper, we propose UAP-BEV, a novel approach that models the noise in Spatio-Temporal BEV predictions to create an uncertainty-aware occupancy grid map. Using queries of the distance to the closest occupied cell, we obtain a sample estimate of the collision probability of the ego-vehicle. Subsequently, our approach uses gradient-free sampling-based optimization to compute low-cost trajectories over the cost

Abstract

Extreme multi-label (XML) classification refers to the task of supervised multi-label learning that involves a large number of labels. Hence, scalability of the classifier with increasing label dimension is an important consideration. In this paper, we develop a method called LightDXML which modifies the recently developed deep learning based XML framework by using label embeddings instead of feature embedding for negative sampling and iterating cyclically through three major phases: (1) proxy training of label embeddings (2) shortlisting of labels for negative sampling and (3) final classifier training using the negative samples. Consequently, LightDXML also removes the requirement of a re-ranker module, thereby, leading to further savings on time and memory requirements. The proposed method achieves the best of both worlds: while the training time, model size and prediction times are on par or better compared to the tree-based methods, it attains much better prediction accuracy that is on par with the deep learning based methods. Moreover, the proposed approach achieves the best tail-label prediction accuracy over most state-of-the-art XML methods on some of the large datasets1 . Code: https://github.com/misterpawan/ LightDXML

Abstract

Throwing motion is known for phenomenally fast rearrangement, sorting tasks, and placing the object outside the limited workspace with less effort. However, in the robotics domain, despite many simple yet versatile, mechanically intelligent grippers reported earlier, they fo- cus primarily on achieving robust grasping and dexterous manipulation. This article presents a novel design of a sin- gle actuator driven hybrid gripper with mechanically cou- pled rigid links and elastic gripping surface; this arrange- ment provides the dual function of versatile grasping and throwing manipulation. The gripper comprises a latching mechanism (LM) that drives two passive rigid fingers by elongating/releasing the coupled elastic strip. Elongating the gripping surface enables the gripper to adapt to ob- jects with different geometries, vary surface contact force characteristics, and store the energy in the form of elastic potential. A mechanism to discharge the stored potential energy gradually or instantaneously is essential when the intended task is to place the object free from impact or away from the limited reachable workspace. The proposed LM can swiftly shift from a quick release to a gradual release of the stored elastic potential for greater object’s accelera- tion during throwing and no acceleration while placing. By doing so, the object can be placed at the desired location even farther than the manipulator’s reachable workspace. We report the proposed gripper’s design details, develop- ment, and experimentally demonstrate the versatile grasp- ing, impact-free placing, and throwing capabilities. Index Terms—Gripper design, multipurpose gripper, non- prehensile manipulation, throwing.

Abstract

Unmanned Aerial Vehicle (UAV) can be employed in various applications, including traffic control, and delivery application. However, these services are susceptible to various security attacks because sensitive data are exchanged through an open channel. Thus, a secure authentication scheme is essential for UAV. UAV has limited storage resources and computing capabilities. To overcome these problems, cloud computing is considered as a promising solution. Cloud computing provides various properties such as storage availability and scalability. Unfortunately, the cloud server’s database can be a major target for an adversary because it is a centralized system. If an adversary intrudes on the cloud server’s database, he/she may attempt to intercept or learn the stored data. To mitigate these issues, we design a secure and lightweight authentication and key agreement scheme for cloud-assisted UAV using blockchain in flying ad-hoc networks, called LAKA-UAV. LAKA-UAV utilizes blockchain technology to ensure access control and data integrity using log transactions and the cloud server securely manages collected data from UAV. We prove the security of LAKA-UAV based on informal security analysis and formal security verification implementation. Based on testbed experiments using MIRACL, LAKA-UAV provides about 2.13 times more efficient performance on average compared with related schemes in terms of computation. We present the blockchain implementation using Hyperledger Sawtooth platform

Abstract

Increasing use of electronic healthcare (eHealth) services demands efficient and secure solutions. Such solutions need to ensure the prevention of unauthorised access to the patient data and provide faster response. Fog computing is a viable solution to provide faster responses in eHealth systems. Key distribution and authentication play a major role in providing security to patient data. Existing centralized architectures are susceptible to single-point-of-compromise, that is, the entire system is vulnerable when the centralized authority keys are unexpectedly revealed to an adversary. In this paper, we present a fog-based semi-centralised architecture for key distribution and authentication, in which the key distribution service is delegated to individual fog-servers. Thus, the fog-servers become responsible for key distribution to the users without the involvement of the centralised authority, which forms a paradigm of multiple client-server architecture. Thus, achieving centralized trust by designing a single sign-on authentication in such environments is a challenging problem. We design a single sign-on authentication protocol for semi-centralized architectures to achieve centralized trust by ensuring that the user keys are independent of the centralized authority’s keys. A rigorous security analysis under the random oracle model is performed to prove that the proposed protocol is secure against single-point-of-compromise. We also conduct extensive experiments to show the practical perspectives of the proposed scheme. The results show that the protocol is suitable for eHealth applications, including emergency services.

Abstract

Cyber threat hunting proactively searches for cyber threats, which are undetected by the traditional defense mechanisms. It scans deep to identify malicious programs (ie, malware) that escape from detection. It is important because sophisticated cyber threats can bypass the cyber security mechanisms. The performance of the cyber threat hunting can be improved through artificial intelligence (AI), especially, explainable AI (XAI), which adds trust component to the cyber threat hunting process. Due to the inclusion of XAI, the security experts get the full explanations of the detected threats as the working of the detection model in XAI is known. Information, like, which one is a threat, how it has been detected, and why it has been detected, can be obtained very easily due to the inclusion of XAI in the cyber threat hunting. Therefore, an XAI-envisioned mechanism for cyber threat hunting has been proposed (in short, XAISM-CTH). The network and threat models of XAISM-CTH are designed and discussed. The conducted security analysis proves the security of XAISM-CTH against various potential attacks. XAISM-CTH also performs better than the other existing schemes. At the end, a practical implementation of XAISM-CTH has been provided to observe its impact on the performance of the system. KEYWORDS cyber threat hunting, explainable artificial intelligence (XAI), intrusion detection, privacy, security

Abstract

Due to high effectiveness and robust security proto- cols, lattice-based cryptography becomes a very broadly appli- cable optimistic post-quantum technique that is recently used in public key cryptosystem. An aggregate signature scheme enables a party to bundle a set of signatures together into a single short cryptographic signature, which can be verified by any verifier using the public information. In this paper, we provide a lattice- based aggregate signature scheme where the security depends on the difficulty of the Ring Learning-with-Error (Ring-LWE) problem. Next, we use the basic scheme in Internet of Drones (IoD) applications using the blockchain technology for secure and transparent data storage. The detailed security analysis and comparative study show that the proposed scheme provides superior security including resistance to quantum attacks and is efficient as compared to the existing state of art approaches. The testbed experimental results and the blockchain simulation demonstrate that the proposed scheme can be applied in real-life drones applications. Index Terms—Internet of Drones (IoD), unmanned aerial vehi- cles, lattice-based cryptography, aggregate signature, blockchain, security.