OpenRaiser/Intern-Atlas huggingface dataset:
Security Analysis of Two Recent Pairing-Free Certificateless Two-Party Authenticated Key Agreement Protocols for Smart Grid
Venue: arXiv cs.CR 2022
Year: 2022

Smart grids are intelligent power transmission networks that monitor and control communication participants and grid nodes to ensure bidirectional flow of information and power between all nodes. To secure the smart grid, it is very important to design the key agreement protocol. The pairing-free certificateless two-party authenticated key agreement protocol has been widely studied and applied as a basic core protocol to protect the security of the smart grid. Until now, various protocols have been proposed, and these protocols are being introduced and operated not only in smart grid, but also in smart cities, healthcare, and vehicle ad hoc networks. In this paper, we analyzed the security properties of two recently proposed pairing-free certificateless two-party authenticated key agreement protocols for Smart grid. According to our analysis, these two protocols are insecure against basic impersonation attacks of malicious key-generator centers, man-in-the-middle attacks of malicious key generator centers, and key offset attacks. We also found and pointed out some errors in the descriptions of these protocols.
How Do Organizations Seek Cyber Assurance? Investigations on the Adoption of the Common Criteria and Beyond
Venue: arXiv cs.CR 2022
Year: 2022

Cyber assurance, which is the ability to operate under the onslaught of cyber attacks and other unexpected events, is essential for organizations facing inundating security threats on a daily basis. Organizations usually employ multiple strategies to conduct risk management to achieve cyber assurance. Utilizing cybersecurity standards and certifications can provide guidance for vendors to design and manufacture secure Information and Communication Technology (ICT) products as well as provide a level of assurance of the security functionality of the products for consumers. Hence, employing security standards and certifications is an effective strategy for risk management and cyber assurance. In this work, we begin with investigating the adoption of cybersecurity standards and certifications by surveying 258 participants from organizations across various countries and sectors. Specifically, we identify adoption barriers of the Common Criteria through the designed questionnaire. Taking into account the seven identified adoption barriers, we show the recommendations for promoting cybersecurity standards and certifications. Moreover, beyond cybersecurity standards and certifications, we shed light on other risk management strategies devised by our participants, which provides directions on cybersecurity approaches for enhancing cyber assurance in organizations.
Towards Smart Networking with SDN Enabled IPv6 Network
Venue: arXiv cs.NI 2022
Year: 2022

This paper presents the features and benefits of legacy IPv4 network migration towards major two latest networking paradigms viz. Internet protocol version 6 (IPv6) and the software-defined networking (SDN). These latest networking paradigms are the enabler of future generation networking so that the standards and requirements of fifth generation (5G) wireless networking can be achieved. Features and migration approaches of IPv6 and SDN will be separately discussed, then a joint migration approach of SDN and IPv6 network termed as SoDIP6 network migration will be presented, and the integration of SoDIP6 network as a backbone of 5G network will be introduced.
SegTAD: Precise Temporal Action Detection via Semantic Segmentation
Venue: arXiv cs.CV 2022
Year: 2022

Temporal action detection (TAD) is an important yet challenging task in video analysis. Most existing works draw inspiration from image object detection and tend to reformulate it as a proposal generation - classification problem. However, there are two caveats with this paradigm. First, proposals are not equipped with annotated labels, which have to be empirically compiled, thus the information in the annotations is not necessarily precisely employed in the model training process. Second, there are large variations in the temporal scale of actions, and neglecting this fact may lead to deficient representation in the video features. To address these issues and precisely model temporal action detection, we formulate the task of temporal action detection in a novel perspective of semantic segmentation. Owing to the 1-dimensional property of TAD, we are able to convert the coarse-grained detection annotations to fine-grained semantic segmentation annotations for free. We take advantage of them to provide precise supervision so as to mitigate the impact induced by the imprecise proposal labels. We propose an end-to-end framework SegTAD composed of a 1D semantic segmentation network (1D-SSN) and a proposal detection network (PDN).
Momentum-Aware Trajectory Optimization and Control for Agile Quadrupedal Locomotion
Venue: arXiv cs.RO 2022
Year: 2022

In this letter, we present a versatile hierarchical offline planning algorithm, along with an online control pipeline for agile quadrupedal locomotion. Our offline planner alternates between optimizing centroidal dynamics for a reduced-order model and whole-body trajectory optimization, with the aim of achieving dynamics consensus. Our novel momentum-inertia-aware centroidal optimization, which uses an equimomental ellipsoid parameterization, is able to generate highly acrobatic motions via ``inertia shaping". Our whole-body optimization approach significantly improves upon the quality of standard DDP-based approaches by iteratively exploiting feedback from the centroidal level. For online control, we have developed a novel convex model predictive control scheme through a linear transformation of the full centroidal dynamics. Our controller can efficiently optimize for both contact forces and joint accelerations in single optimization, enabling more straightforward tracking for momentum-rich motions compared to existing quadrupedal MPC controllers. We demonstrate the capability and generality of our trajectory planner on four different dynamic maneuvers. We then present one hardware experiment on the MIT Mini Cheetah platform to demonstrate the performance of the entire planning and control pipeline on a twisting jump maneuver.
Automated clustering of COVID-19 anti-vaccine discourse on Twitter
Venue: arXiv cs.SI 2022
Year: 2022

Attitudes about vaccination have become more polarized; it is common to see vaccine disinformation and fringe conspiracy theories online. An observational study of Twitter vaccine discourse is found in Ojea Quintana et al. (2021): the authors analyzed approximately six months' of Twitter discourse -- 1.3 million original tweets and 18 million retweets between December 2019 and June 2020, ranging from before to after the establishment of Covid-19 as a pandemic. This work expands upon Ojea Quintana et al. (2021) with two main contributions from data science. First, based on the authors' initial network clustering and qualitative analysis techniques, we are able to clearly demarcate and visualize the language patterns used in discourse by Antivaxxers (anti-vaccination campaigners and vaccine deniers) versus other clusters (collectively, Others). Second, using the characteristics of Antivaxxers' tweets, we develop text classifiers to determine the likelihood a given user is employing anti-vaccination language, ultimately contributing to an early-warning mechanism to improve the health of our epistemic environment and bolster (and not hinder) public health initiatives.
Dialogue Summaries as Dialogue States (DS2), Template-Guided Summarization for Few-shot Dialogue State Tracking
Venue: arXiv cs.CL 2022
Year: 2022

Annotating task-oriented dialogues is notorious for the expensive and difficult data collection process. Few-shot dialogue state tracking (DST) is a realistic solution to this problem. In this paper, we hypothesize that dialogue summaries are essentially unstructured dialogue states; hence, we propose to reformulate dialogue state tracking as a dialogue summarization problem. To elaborate, we train a text-to-text language model with synthetic template-based dialogue summaries, generated by a set of rules from the dialogue states. Then, the dialogue states can be recovered by inversely applying the summary generation rules. We empirically show that our method DS2 outperforms previous works on few-shot DST in MultiWoZ 2.0 and 2.1, in both cross-domain and multi-domain settings. Our method also exhibits vast speedup during both training and inference as it can generate all states at once. Finally, based on our analysis, we discover that the naturalness of the summary templates plays a key role for successful training.
DareFightingICE Competition: A Fighting Game Sound Design and AI Competition
Venue: arXiv cs.HC 2022
Year: 2022

This paper presents a new competition -- at the 2022 IEEE Conference on Games (CoG) -- called DareFightingICE Competition. The competition has two tracks: a sound design track and an AI track. The game platform for this competition is also called DareFightingICE, a fighting game platform. DareFightingICE is a sound-design-enhanced version of FightingICE, used earlier in a competition at CoG until 2021 to promote artificial intelligence (AI) research in fighting games. In the sound design track, participants compete for the best sound design, given the default sound design of DareFightingICE as a sample, where we define a sound design as a set of sound effects combined with the source code that implements their timing-control algorithm. Participants of the AI track are asked to develop their AI algorithm that controls a character given only sound as the input (blind AI) to fight against their opponent; a sample deep-learning blind AI will be provided by us. Our means to maximize the synergy between the two tracks are also described. This competition serves to come up with effective sound designs for visually impaired players, a group in the gaming community which has been mostly ignored. To the best of our knowledge, DareFightingICE Competition is the first of its kind within and outside of CoG.
ViTransPAD: Video Transformer using convolution and self-attention for Face Presentation Attack Detection
Venue: arXiv cs.CV 2022
Year: 2022

Face Presentation Attack Detection (PAD) is an important measure to prevent spoof attacks for face biometric systems. Many works based on Convolution Neural Networks (CNNs) for face PAD formulate the problem as an image-level binary classification task without considering the context. Alternatively, Vision Transformers (ViT) using self-attention to attend the context of an image become the mainstreams in face PAD. Inspired by ViT, we propose a Video-based Transformer for face PAD (ViTransPAD) with short/long-range spatio-temporal attention which can not only focus on local details with short attention within a frame but also capture long-range dependencies over frames. Instead of using coarse image patches with single-scale as in ViT, we propose the Multi-scale Multi-Head Self-Attention (MsMHSA) architecture to accommodate multi-scale patch partitions of Q, K, V feature maps to the heads of transformer in a coarse-to-fine manner, which enables to learn a fine-grained representation to perform pixel-level discrimination for face PAD. Due to lack inductive biases of convolutions in pure transformers, we also introduce convolutions to the proposed ViTransPAD to integrate the desirable properties of CNNs by using convolution patch embedding and convolution projection. The extensive experiments show the effectiveness of our proposed ViTransPAD with a preferable accuracy-computation balance, which can serve as a new backbone for face PAD.
Reconfigurable Intelligent Surface Assisted OFDM Relaying: Subcarrier Matching with Balanced SNR
Venue: arXiv cs.IT 2022
Year: 2022

This paper considers a reconfigurable intelligent surface (RIS) aided orthogonal frequency division multiplexing (OFDM) relaying system, and investigates the joint design of RIS passive beamforming and subcarrier matching under two cases, where Case-I ignores the source-RIS-destination signal, while Case-II explores this signal for rate enhancement. We formulate a mixed-integer nonlinear programming (MINIP) problem to maximize the sum achievable rate of all subcarriers by jointly optimizing the passive beamforming and subcarrier matching. To solve this problem, we first develop a branch-and-bound (BnB)-based alternating optimization algorithm for attaining a near-optimal solution. Then, a low-complexity difference-of-convex penalty-based algorithm and learning-to-optimize approach are also proposed. Finally, simulation results demonstrate that the RIS-assisted OFDM relaying system achieves a substantial achievable rate gain as compared to that without RIS since RIS recasts the subcarrier matching and balances the signal-to-noise ratio (SNR) among different subcarrier pairs.
5G Network Slice Isolation
Venue: arXiv cs.CR 2022
Year: 2022

This article reveals an adequate comprehension of basic defense, security challenges, 2 and attack vectors in deploying multi-network slicing. Network slicing is a revolutionary concept 3 of providing mobile network on-demand and expanding mobile networking business and services 4 to a new era. The new business paradigm and service opportunities are encouraging vertical 5 industries to join and develop their own mobile network capabilities for enhanced performances 6 that are coherent with their applications. However, a number of security concerns are also raised 7 in this new era. In this article, we focus on the deployment of multi-network slicing with multi8 tenancy. We identify the security concerns, and discuss about the defense approaches such as 9 network slice isolation and insulation in a multi-layer network slicing security model. Also, we 10 identify the importance to appropriately select the network slice isolation points, and propose 11 a generic framework to optimize the isolation policy regarding the implementation cost while 12 guaranteeing the security and performance requirements.
Uniform Approximations for Randomized Hadamard Transforms with Applications
Venue: arXiv cs.LG 2022
Year: 2022

Randomized Hadamard Transforms (RHTs) have emerged as a computationally efficient alternative to the use of dense unstructured random matrices across a range of domains in computer science and machine learning. For several applications such as dimensionality reduction and compressed sensing, the theoretical guarantees for methods based on RHTs are comparable to approaches using dense random matrices with i.i.d.\ entries. However, several such applications are in the low-dimensional regime where the number of rows sampled from the matrix is rather small. Prior arguments are not applicable to the high-dimensional regime often found in machine learning applications like kernel approximation. Given an ensemble of RHTs with Gaussian diagonals, $\{M^i\}_{i = 1}^m$, and any $1$-Lipschitz function, $f: \mathbb{R} \to \mathbb{R}$, we prove that the average of $f$ over the entries of $\{M^i v\}_{i = 1}^m$ converges to its expectation uniformly over $\| v \| \leq 1$ at a rate comparable to that obtained from using truly Gaussian matrices. We use our inequality to then derive improved guarantees for two applications in the high-dimensional regime: 1) kernel approximation and 2) distance estimation. For kernel approximation, we prove the first \emph{uniform} approximation guarantees for random features constructed through RHTs lending theoretical justification to their empirical success while for distance estimation, our convergence result implies data structures with improved runtime guarantees over previous work by the authors. We believe our general inequality is likely to find use in other applications.
Ensemble Methods for Robust Support Vector Machines using Integer Programming
Venue: arXiv cs.LG 2022
Year: 2022

In this work we study binary classification problems where we assume that our training data is subject to uncertainty, i.e. the precise data points are not known. To tackle this issue in the field of robust machine learning the aim is to develop models which are robust against small perturbations in the training data. We study robust support vector machines (SVM) and extend the classical approach by an ensemble method which iteratively solves a non-robust SVM on different perturbations of the dataset, where the perturbations are derived by an adversarial problem. Afterwards for classification of an unknown data point we perform a majority vote of all calculated SVM solutions. We study three different variants for the adversarial problem, the exact problem, a relaxed variant and an efficient heuristic variant. While the exact and the relaxed variant can be modeled using integer programming formulations, the heuristic one can be implemented by an easy and efficient algorithm. All derived methods are tested on random and realistic datasets and the results indicate that the derived ensemble methods have a much more stable behaviour when changing the protection level compared to the classical robust SVM model.
A Plant-Inspired Multifunctional, Two Way, and Fiberless Soft Gripper with Sensorized Kinaesthesia
Venue: arXiv cs.RO 2022
Year: 2022

This work presents a new fiberless soft pneumatic actuator that can work multifunctional and bidirectional, and its embedded sensors give it a self-proprioception ability. This actuator works based on the idea of employing helical pressure channels. Applying the controlled input pressures into these two channels causes a variety of deformations and actuation. In particular, single pressure, imbalanced pressures, and balanced pressures applied in the channels cause bidirectional coilings, opposite bendings, and elongation, respectively, in a single unit actuator. Also, two U-shaped microchannels are created, and by injecting a gel-based conductive material, the actuator is equipped with resistive sensors which are responsive to a vast dynamic range from a small oscillation to a large elongation. This actuator has so many promising features as a multifunctional soft gripper, and its embedded soft sensors enable it to have better controllability in real problems. The multifunctionality of this actuator has been validated with several experimental tests, and also we have shown it has excellent potential in gripping a variety of objects. Finally, the embedded sensors can discriminate the main functions of actuators, and also they can play the role of independent sensors as well like a stretch, pressure, or bending sensors.
On partitioning of an SHM problem and parallels with transfer learning
Venue: arXiv cs.LG 2022
Year: 2022

In the current work, a problem-splitting approach and a scheme motivated by transfer learning is applied to a structural health monitoring problem. The specific problem in this case is that of localising damage on an aircraft wing. The original experiment is described, together with the initial approach, in which a neural network was trained to localise damage. The results were not ideal, partly because of a scarcity of training data, and partly because of the difficulty in resolving two of the damage cases. In the current paper, the problem is split into two sub-problems and an increase in classification accuracy is obtained. The sub-problems are obtained by separating out the most difficult-to-classify damage cases. A second approach to the problem is considered by adopting ideas from transfer learning (usually applied in much deeper) networks to see if a network trained on the simpler damage cases can help with feature extraction in the more difficult cases. The transfer of a fixed trained batch of layers between the networks is found to improve classification by making the classes more separable in the feature space and to speed up convergence.
Capturing Shape Information with Multi-Scale Topological Loss Terms for 3D Reconstruction
Venue: arXiv cs.CV 2022
Year: 2022

Reconstructing 3D objects from 2D images is both challenging for our brains and machine learning algorithms. To support this spatial reasoning task, contextual information about the overall shape of an object is critical. However, such information is not captured by established loss terms (e.g. Dice loss). We propose to complement geometrical shape information by including multi-scale topological features, such as connected components, cycles, and voids, in the reconstruction loss. Our method uses cubical complexes to calculate topological features of 3D volume data and employs an optimal transport distance to guide the reconstruction process. This topology-aware loss is fully differentiable, computationally efficient, and can be added to any neural network. We demonstrate the utility of our loss by incorporating it into SHAPR, a model for predicting the 3D cell shape of individual cells based on 2D microscopy images. Using a hybrid loss that leverages both geometrical and topological information of single objects to assess their shape, we find that topological information substantially improves the quality of reconstructions, thus highlighting its ability to extract more relevant features from image datasets.
Ensembles of Vision Transformers as a New Paradigm for Automated Classification in Ecology
Venue: arXiv cs.CV 2022
Year: 2022

Monitoring biodiversity is paramount to manage and protect natural resources. Collecting images of organisms over large temporal or spatial scales is a promising practice to monitor the biodiversity of natural ecosystems, providing large amounts of data with minimal interference with the environment. Deep learning models are currently used to automate classification of organisms into taxonomic units. However, imprecision in these classifiers introduces a measurement noise that is difficult to control and can significantly hinder the analysis and interpretation of data. {We overcome this limitation through ensembles of Data-efficient image Transformers (DeiTs), which not only are easy to train and implement, but also significantly outperform} the previous state of the art (SOTA). We validate our results on ten ecological imaging datasets of diverse origin, ranging from plankton to birds. On all the datasets, we achieve a new SOTA, with a reduction of the error with respect to the previous SOTA ranging from 29.35% to 100.00%, and often achieving performances very close to perfect classification. Ensembles of DeiTs perform better not because of superior single-model performances but rather due to smaller overlaps in the predictions by independent models and lower top-1 probabilities. This increases the benefit of ensembling, especially when using geometric averages to combine individual learners. While we only test our approach on biodiversity image datasets, our approach is generic and can be applied to any kind of images.