Reviewerly/exHarmony huggingface dataset:
Solving Optimization Problems of Metamaterial and Double T-Shape Antennas Using Advanced Meta-Heuristics Algorithms

This study offers an adaptive dynamic sine cosine fitness grey wolf optimizer (ADSCFGWO) for optimizing the parameters of two types of antennas. The two types of antennas are metamaterial and double T-shape monopoles. The ADSCFGWO algorithm is based on an adaptive dynamic technique and two recently developed and powerful optimization techniques: a modified grey wolf optimization (GWO) based on fitness value and a sine cosine algorithm (SCA). The suggested approach utilizes the capabilities of both algorithms to balance better the exploration and exploitation responsibilities of the optimization process while achieving rapid convergence. First, a new feature selection approach is proposed to choose the most significant features from the metamaterial dataset using the suggested ADSCFGWO-based ensemble model for optimal performance. The ADSCFGWO algorithm also optimizes a bidirectional recurrent neural network (BRNN) to estimate the double T-shape monopole antenna characteristics. Several experiments were undertaken to demonstrate the superiority of the suggested algorithms by comparing their results to those of existing optimization algorithms, feature selectors, and regression models. In addition, a statistical analysis is offered to evaluate the algorithm&#x2019;s effectiveness and stability. The achieved findings demonstrate the efficacy and superiority of the suggested method over numerous competing algorithms.
Trust in blockchain-enabled exchanges: Future directions in blockchain marketing

Abstract Prior research typically positions blockchain technology as enabling a trustless exchange environment without specifically investigating how blockchain technology provides trust and what makes the data in a blockchain “tamperproof” and “immutable.” This article serves to address these research gaps by conducting semi-structured interviews with 18 informants who have had at least three years of project experience with blockchain-enabled exchanges. Our findings uncover three unique aspects of blockchain that enable trust in exchange vs. a traditional exchange: (1) trust in exchange actors: mathematics and cryptography vs. human guardians within institutions, (2) trust in exchange actions: information transparency enabling tamperproof and immutable data vs. information asymmetry, and (3) trust in exchange assets: digital vs. manual escrows for verifying ownership of valuable goods. This research is vital for marketing scholars and practitioners who seek to understand the rise of threats to trust regarding online advertising, customer trust, privacy, and digital rights.
A Two-Step Descriptor-Based Keypoint Filtering Algorithm for Robust Image Matching

Finding robust and correct keypoints in images remains a challenge, especially when repetitive patterns are present. In this article, we propose a universal two-step filtering method to solve the mismatch problem in repetitive patterns. Having applied a mean-shift clustering algorithm to remove obvious mismatches, the proposed confusion reduction (CR) method uses a novel confusion index (CI) in a gridding schema to identify and filter out the remaining confusing keypoints. In both steps, the descriptors&#x2019; statistical properties are evaluated using kernel density estimation. Various synthetic and real stereo pairs, along with multiview image blocks, were used to assess the performance of the presented algorithm. The results were also compared with those obtained by several state-of-the-art mismatch removal methods. The experiments showed that, on average, the proposed strategy improves the accuracy of matching by 10&#x0025; and the accuracy of photogrammetric blocks by 20&#x0025;&#x2013;30&#x0025;.
High-frequency connectedness between Bitcoin and other top-traded crypto assets during the COVID-19 crisis

In this paper, we analyse co-movements and correlations between Bitcoin and thirty-one of the most-tradable crypto assets using high-frequency data for the period from January 2019 to December 2020. We apply the Diagonal-BEKK model to data from the pre-COVID and COVID-19 periods, and identify significant changes in patterns of co-movements and correlations during the pandemic period. We also employ the Minimum Spanning Tree (MST) and Planar Maximally Filtered Graph (PMFG) methods to study the changes of the crypto asset network structure after the COVID-19 outbreak. While the influential role of Bitcoin in the digital asset ecosystem has been confirmed, our novel findings reveal that due to recent developments in the blockchain ecosystem, crypto assets that can be categorised as dApps and protocols have become more attractive to investors than pure cryptocurrencies.
Fast vehicle detection algorithm in traffic scene based on improved SSD

For autonomous driving systems, vehicle detection is an important part and challenging problem due to the complex traffic scenes and poor computing resources. This paper proposes an improved SSD(single shot mutlibox detector) algorithm for the fast detection of vehicles in traffic scenes. MobileNet v2 is selected as the backbone feature extraction network for SSD, which improves the real-time performance of the algorithm. To improve detection accuracy, the channel attention mechanism is utilized for feature weighting, and the deconvolution module is utilized to construct a bottom–top feature fusion structure. The experimental results show that the average precision of the proposed algorithm on the BDD100K and KITTI datasets is 82.59% and 84.83%, respectively. The single inference time of the algorithm is 73ms, which is only about 5/11 of the original model, realizing the improvement of inference speed and prediction accuracy.
Solar Cell Surface Defect Detection Based on Improved YOLO v5

A solar cell defect detection method with an improved YOLO v5 algorithm is proposed for the characteristics of the complex solar cell image background, variable defect morphology, and large-scale differences. First, the deformable convolution is incorporated into the CSP module to achieve an adaptive learning scale and perceptual field size; then, the feature extraction capability of the model is enhanced by introducing the ECA-Net attention mechanism; finally, the model network structure is improved and one tiny defect prediction head is added to improve the accuracy of target detection at different scales. To further optimize and improve the YOLO v5 algorithm, this paper uses Mosaic and MixUp fusion data enhancement, K-means++ clustering anchor box algorithm, and CIOU loss function to enhance the model performance. The experimental results show that the improved YOLO v5 algorithm achieves 89.64% mAP for the model trained on the solar cell EL image dataset, which is 7.85% higher than the mAP of the original algorithm, and the speed reaches 36.24 FPS, which can complete the solar cell defect detection task more accurately while meeting the real-time requirements.
Pigeon Inspired Optimization with Encryption Based Secure Medical Image Management System

Presently, technological advancements in the healthcare sector pose a challenging problem relevant to the security and privacy of health-related applications. Medical images can be considered significant and sensitive data in the medical informatics system. In order to transmit medical images in an open medium, the design of secure encryption algorithms becomes essential. Encryption can be considered one of the effective solutions for accomplishing security. Although numerous models have existed in the literature, they could not adaptable to the rising number of medicinal images in the health sector. At the same time, the optimal key generation process acts as a vital part in defining the performance of the encryption techniques. Therefore, this article presents a Pigeon Inspired Optimization with Encryption-based Secure Medical Image Management (PIOE-SMIM) technique. The proposed PIOE-SMIM approach majorly concentrates on the development of secret share creation (SSC) and the encryption process. At the initial stage, the medical images are converted into a collection of 12 shares using the SSC approach. In addition, an elliptic curve cryptography (ECC) scheme is employed for the encryption process. In order to optimum key creation procedure in the ECC model, the PIO technique is exploited with the aim of maximizing PSNR. Finally, on the receiver side, the decryption and share reconstruction processes are performed to construct the original images. The PIOE-SMIM model displayed an enhanced PSNR of 59.37 dB in image 1. Improved PSNR of 59.53 dB is given for image 5 using the PIOE-SMIM model. For demonstrating an enhanced performance of the PIOE-SMIM method, a widespread experimental study is made and the results highlighted the supremacy of the PIOE-SMIM model over other techniques.
Central Bank Digital Currencies: Motives, Economic Implications, and the Research Frontier

In just a few years, central banks have rapidly ramped up their research and development efforts on central bank digital currencies (CBDCs). A growing body of economic research informs these activities, often focusing on the “reserves for all” aspect of CBDCs for retail use. However, CBDCs should be considered in the full context of the digital economy and the centrality of data, which raises concerns around competition, payment system integrity, and privacy. This review gives a guided tour of the growing CBDC literature on the microeconomic considerations related to operation architectures, technologies, and privacy as well as the macroeconomic implications for the financial system, financial stability, and monetary policy. A set of questions, particularly on the cross-border dimensions of CBDCs, remains unresolved and calls for further work to expand the research frontier.
Meta-Heuristic Optimization and Keystroke Dynamics for Authentication of Smartphone Users

Personal Identification Numbers (PIN) and unlock patterns are two of the most often used smartphone authentication mechanisms. Because PINs have just four or six characters, they are subject to shoulder-surfing attacks and are not as secure as other authentication techniques. Biometric authentication methods, such as fingerprint, face, or iris, are now being studied in a variety of ways. The security of such biometric authentication is based on PIN-based authentication as a backup when the maximum defined number of authentication failures is surpassed during the authentication process. Keystroke-dynamics-based authentication has been studied to circumvent this limitation, in which users were categorized by evaluating their typing patterns as they input their PIN. A broad variety of approaches have been proposed to improve the capacity of PIN entry systems to discriminate between normal and abnormal users based on a user’s typing pattern. To improve the accuracy of user discrimination using keystroke dynamics, we propose a novel approach for improving the parameters of a Bidirectional Recurrent Neural Network (BRNN) used in classifying users’ keystrokes. The proposed approach is based on a significant modification to the Dipper Throated Optimization (DTO) algorithm by employing three search leaders to improve the exploration process of the optimization algorithm. To assess the effectiveness of the proposed approach, two datasets containing keystroke dynamics were included in the conducted experiments. In addition, we propose a feature selection algorithm for selecting the proper features that enable better user classification. The proposed algorithms are compared to other optimization methods in the literature, and the results showed the superiority of the proposed algorithms. Moreover, a statistical analysis is performed to measure the stability and significance of the proposed methods, and the results confirmed the expected findings. The best classification accuracy achieved by the proposed optimized BRNN is 99.02% and 99.32% for the two datasets.
AnoDDPM: Anomaly Detection with Denoising Diffusion Probabilistic Models using Simplex Noise

Generative models have been shown to provide a powerful mechanism for anomaly detection by learning to model healthy or normal reference data which can subsequently be used as a baseline for scoring anomalies. In this work we consider denoising diffusion probabilistic models (DDPMs) for unsupervised anomaly detection. DDPMs have superior mode coverage over generative adversarial networks (GANs) and higher sample quality than variational autoencoders (VAEs). However, this comes at the expense of poor scalability and increased sampling times due to the long Markov chain sequences required. We observe that within reconstruction-based anomaly detection a full-length Markov chain diffusion is not required. This leads us to develop a novel partial diffusion anomaly detection strategy that scales to high-resolution imagery, named AnoDDPM. A secondary problem is that Gaussian diffusion fails to capture larger anomalies; therefore we develop a multi-scale simplex noise diffusion process that gives control over the target anomaly size. AnoDDPM with simplex noise is shown to significantly outperform both f-AnoGAN and Gaussian diffusion for the tumorous dataset of 22 T1-weighted MRI scans (CCBS Edinburgh) qualitatively and quantitatively (improvement of +25.5% Sørensen–Dice coefficient, +17.6% IoU and +7.4% AUC).
New Directions in Cryptography

chapter Share on New Directions in Cryptography Authors: Whitfield Diffie View Profile , Martin E. Hellman View Profile Authors Info & Claims Democratizing Cryptography: The Work of Whitfield Diffie and Martin HellmanAugust 2022 Pages 365–390https://doi.org/10.1145/3549993.3550007Published:26 August 2022Publication History 0citation45DownloadsMetricsTotal Citations0Total Downloads45Last 12 Months45Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
A Comprehensive Survey on the Applications of Blockchain for Securing Vehicular Networks

Vehicular networks promise features such as traffic management, route scheduling, data exchange, entertainment, and much more. With any large-scale technological integration comes the challenge of providing security. Blockchain technology has been a popular choice of many studies for making the vehicular network more secure. Its characteristics meet some of the essential security requirements such as decentralization, transparency, tamper-proof nature, and public audit. This study catalogues some of the notable efforts in this direction over the last few years. We analyze around 75 blockchain-based security schemes for vehicular networks from an application, security, and blockchain perspective. The application perspective focuses on various applications which use secure blockchain-based vehicular networks such as transportation, parking, data sharing/ trading, and resource sharing. The security perspective focuses on security requirements and attacks. The blockchain perspective focuses on blockchain platforms, blockchain types, and consensus mechanisms used in blockchain implementation. We also compile the popular simulation tools used for simulating blockchain and for simulating vehicular networks. Additionally, to give the readers a broader perspective of the research area, we discuss the role of various state-of-the-art emerging technologies in blockchain-based vehicular networks. Finally, we summarize the survey by listing out some common challenges and future research directions in this field.
A new human-based metahurestic optimization method based on mimicking cooking training

Metaheuristic algorithms have a wide range of applications in handling optimization problems. In this study, a new metaheuristic algorithm, called the chef-based optimization algorithm (CBOA), is developed. The fundamental inspiration employed in CBOA design is the process of learning cooking skills in training courses. The stages of the cooking training process in various phases are mathematically modeled with the aim of increasing the ability of global search in exploration and the ability of local search in exploitation. A collection of 52 standard objective functions is utilized to assess the CBOA's performance in addressing optimization issues. The optimization results show that the CBOA is capable of providing acceptable solutions by creating a balance between exploration and exploitation and is highly efficient in the treatment of optimization problems. In addition, the CBOA's effectiveness in dealing with real-world applications is tested on four engineering problems. Twelve well-known metaheuristic algorithms have been selected for comparison with the CBOA. The simulation results show that CBOA performs much better than competing algorithms and is more effective in solving optimization problems.
Putting People in their Place: Monocular Regression of 3D People in Depth

Given an image with multiple people, our goal is to directly regress the pose and shape of all the people as well as their relative depth. Inferring the depth of a person in an image, however, is fundamentally ambiguous without knowing their height. This is particularly problematic when the scene contains people of very different sizes, e.g. from infants to adults. To solve this, we need several things. First, we develop a novel method to infer the poses and depth of multiple people in a single image. While previous work that estimates multiple people does so by reasoning in the image plane, our method, called BEV, adds an additional imaginary Bird's-Eye-View representation to explicitly reason about depth. BEV reasons simultaneously about body centers in the image and in depth and, by combing these, estimates 3D body position. Unlike prior work, BEV is a single-shot method that is end-to-end differentiable. Second, height varies with age, making it impossible to resolve depth without also estimating the age of people in the image. To do so, we exploit a 3D body model space that lets BEV infer shapes from infants to adults. Third, to train BEV, we need a new dataset. Specifically, we create a “Relative Human” (RH) dataset that includes age labels and relative depth relationships between the people in the images. Extensive experiments on RH and AGORA demonstrate the effectiveness of the model and training scheme. BEV out-performs existing methods on depth reasoning, child shape estimation, and robustness to occlusion. The code <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> https://github.com/Arthur151/ROMP and dataset <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> https://github.com/Arthur151/Relative_Human are released for research purposes.
MonoDTR: Monocular 3D Object Detection with Depth-Aware Transformer

Monocular 3D object detection is an important yet challenging task in autonomous driving. Some existing methods leverage depth information from an off-the-shelf depth estimator to assist 3D detection, but suffer from the additional computational burden and achieve limited performance caused by inaccurate depth priors. To alleviate this, we propose MonoDTR, a novel end-to-end depth-aware transformer network for monocular 3D object detection. It mainly consists of two components: (1) the Depth-Aware Feature Enhancement (DFE) module that implicitly learns depth-aware features with auxiliary supervision without requiring extra computation, and (2) the Depth-Aware Transformer (DTR) module that globally integrates context- and depth-aware features. Moreover, different from conventional pixel-wise positional encodings, we introduce a novel depth positional encoding (DPE) to inject depth positional hints into transformers. Our proposed depth-aware modules can be easily plugged into existing image-only monocular 3D object detectors to improve the performance. Extensive experiments on the KITTI dataset demonstrate that our approach outperforms previous state-of-the-art monocular-based methods and achieves real-time detection. Code is available at https://github.com/kuanchihhuang/.MonoDTR.
Self-supervised Learning of Adversarial Example: Towards Good Generalizations for Deepfake Detection

Recent studies in deepfake detection have yielded promising results when the training and testing face forgeries are from the same dataset. However, the problem remains challenging when one tries to generalize the detector to forgeries created by unseen methods in the training dataset. This work addresses the generalizable deepfake detection from a simple principle: a generalizable representation should be sensitive to diverse types of forgeries. Following this principle, we propose to enrich the “diversity” of forgeries by synthesizing augmented forgeries with a pool of forgery configurations and strengthen the “sensitivity” to the forgeries by enforcing the model to predict the forgery configurations. To effectively explore the large forgery augmentation space, we further propose to use the adversarial training strategy to dynamically synthesize the most challenging forgeries to the current model. Through extensive experiments, we show that the proposed strategies are surprisingly effective (see Figure 1), and they could achieve superior performance than the current state-of-the-art methods. Code is available at https://github.com/liangchen527/SLADD.
Long- Tailed Recognition via Weight Balancing

In the real open world, data tends to follow long-tailed class distributions, motivating the well-studied long-tailed recognition (LTR) problem. Naive training produces models that are biased toward common classes in terms of higher accuracy. The key to addressing LTR is to balance various aspects including data distribution, training losses, and gradients in learning. We explore an orthogonal direction, weight balancing, motivated by the empirical observation that the naively trained classifier has “artificially” larger weights in norm for common classes (because there exists abundant data to train them, unlike the rare classes). We investigate three techniques to balance weights, L2-normalization, weight decay, and MaxNorm. We first point out that L2-normalization “perfectly” balances per-class weights to be unit norm, but such a hard constraint might prevent classes from learning better classifiers. In contrast, weight decay penalizes larger weights more heavily and so learns small balanced weights; the MaxNorm constraint encourages growing small weights within a norm ball but caps all the weights by the radius. Our extensive study shows that both help learn balanced weights and greatly improve the LTR accuracy. Surprisingly, weight decay, although underexplored in LTR, significantly improves over prior work. Therefore, we adopt a two-stage training paradigm and propose a simple approach to LTR: (1) learning features using the cross-entropy loss by tuning weight decay, and (2) learning classifiers using class-balanced loss by tuning weight decay and MaxNorm. Our approach achieves the state-of-the-art accuracy on five standard benchmarks, serving as a future baseline for long-tailed recognition.