Reviewerly/exHarmony huggingface dataset:
DRNet: Double Recalibration Network for Few-Shot Semantic Segmentation

Few-shot segmentation aims at learning to segment query images guided by only a few annotated images from the support set. Previous methods rely on mining the feature embedding similarity across the query and the support images to achieve successful segmentation. However, these models tend to perform badly in cases where the query instances have a large variance from the support ones. To enhance model robustness against such intra-class variance, we propose a Double Recalibration Network (DRNet) with two recalibration modules, i.e., the Self-adapted Recalibration (SR) module and the Cross-attended Recalibration (CR) module. In particular, beyond learning robust feature embedding for pixel-wise comparison between support and query as in conventional methods, the DRNet further exploits semantic-aware knowledge embedded in the query image to help segment itself, which we call 'self-adapted recalibration'. More specifically, DRNet first employs guidance from the support set to roughly predict an incomplete but correct initial object region for the query image, and then reversely uses the feature embedding extracted from the incomplete object region to segment the query image. Also, we devise a CR module to refine the feature representation of the query image by propagating the underlying knowledge embedded in the support image's foreground to the query. Instead of foreground global pooling, we refine the response at each pixel in the query feature map by attending to all foreground pixels in the support feature map and taking the weighted average by their similarity; meanwhile, feature maps of the query image are also added back to weighted feature maps as a residual connection. Our DRNet can effectively address the intra-class variance under the few-shot setting with such two recalibration modules, and mine more accurate target regions for query images. We conduct extensive experiments on the popular benchmarks PASCAL- 5i and COCO- 20i . The DRNet with the best configuration achieves the mIoU of 63.6% and 64.9% on PASCAL- 5i and 44.7% and 49.6% on COCO- 20i for 1-shot and 5-shot settings respectively, significantly outperforming the state-of-the-arts without any bells and whistles. Code is available at: https://github.com/fangzy97/drnet.
What you get is not always what you see—pitfalls in solar array assessment using overhead imagery

Effective integration planning for small, distributed solar photovoltaic (PV) arrays into electric power grids requires access to high quality data: the location and power capacity of individual solar PV arrays. Unfortunately, national databases of small-scale solar PV do not exist; those that do are limited in their spatial resolution, typically aggregated up to state or national levels. While several promising approaches for solar PV detection have been published, strategies for evaluating the performance of these models are often highly heterogeneous from study to study. The resulting comparison of these methods for practical applications for energy assessments becomes challenging and may imply that the reported performance evaluations overly optimistic. The heterogeneity comes in many forms, each of which we explore in this work: the degree of diversity of the locations and sensors (e.g. different satellites, aerial photography) from which the training and validation data originate, the validation of ground truth (manual annotation of imagery vs known solar PV locations), the level of spatial aggregation (e.g. array-level vs regional estimates), and inconsistencies in the training and validation datasets (e.g. different datasets are used for each study and those data are not always made accessible). For each, we discuss emerging practices from the literature to address them or suggest directions of future research. As part of our investigation, we evaluate solar PV identification performance in two large regions: the entire state of Connecticut and the city of San Diego, CA. In Connecticut, we also use 33,114 known parcel-level solar PV installations from Berkeley Lab’s Tracking the Sun dataset to evaluate parcel-level performance and evaluate capacity estimates using 169 municipalities. We also make our code (which we call SolarMapper), pre-trained models, training data, and predictions publicly available and provide a web portal for interactively inspecting each prediction that was made. Our findings suggest that traditional performance evaluation of the automated identification of solar PV from satellite imagery may be optimistic due to common limitations in the validation process. The takeaways from this work are intended to inform and catalyze the large-scale practical application of automated solar PV assessment techniques by energy researchers and professionals.
Digital age: The importance of 21st century skills among the undergraduates

The recent emphasis on refining the quality of higher education has incited insightful debates about numerous education reforms. Due to the demands of our ever-changing world, many institutions have begun to embed the 21st century skills into the curriculum design to better prepare the students for workplace success and lifelong career development. Despite its importance, there are disparities in regards to establishing an in-depth understanding of its significance. Thus, this study is aimed to investigate the perspective of undergraduate students in Malaysia on the importance of the 21st century skills for career readiness This study employed the quantitative research design wherein purposive sampling was utilized. The findings assert that data literacy is an essential skill to excel in the workplace, and similarly, problem-solving skill helps develop critical thinking skill, which contribute to the development of creative thinking skill. Recommendations are further deliberated.
Simplified Algorithms for Adaptive Experiment Design in Parameter Estimation

Measurements to estimate parameters of a model are commonplace in the physical sciences, where the traditional approach to automation is to use a sequence of preselected settings followed by least-squares fitting of a model function to the data. This measure-then-fit approach is simple and effective and entirely appropriate for many applications but when measurement resources are limited, efficiency becomes more important. To increase efficiency, Bayesian experiment design allows measurement settings to be chosen adaptively based on accumulated data and utility, the predicted improvement in results as a function of settings. However, the calculation of utility has been judged too impractical for most applications. In this paper, we introduce computational methods and simplified algorithms that accelerate utility calculations by over an order of magnitude, with only slight degradation in measurement efficiency. The methods eliminate utility calculation as a barrier to practical application of efficient adaptive measurement.
Rapid Sharing of Islamophobic Hate on Facebook: The Case of the Tablighi Jamaat Controversy

The COVID-19 pandemic brought about several challenges in addition to the virus itself. The rise of Islamophobic hate speech on social media is one such challenge. As countries were coping with economic collapse due to mass lockdown, hateful people, especially those associated with far-right groups, were targeting and blaming Muslims for the spread of the coronavirus. In India, where intense religious/communal polarization is taking place under the right-wing Bharatiya Janata Party (BJP)-led government, one such prominent instance of Islamophobia—the “Tablighi Jamaat Controversy” (TJC)—occurred. This article analyzes Facebook posts by public groups over a 5-month period (March–August 2020) to find the major actors and track their link-sharing behavior. We found that the Pro-BJP groups with a right-wing ideology spread Islamophobic hate speech, while other groups (anti-hate) worked to counter the hate. We also found that the hate disseminators were extremely active (three times faster) in sharing their content as compared with the anti-hate groups. Finally, our research indicated that the links most widely shared by the hate spreaders were mostly misinformation. These results explain the use of the Facebook platform to spread hate and misinformation, demonstrating how BJP’s pro-Hindu ideology and its attitude toward Muslims is directly and indirectly enabling these actors to spew hate against Muslims with no legal consequences.
Finding MNEMON

Previous security research efforts orbiting around graphs have been exclusively focusing on either (de-)anonymizing the graphs or understanding the security and privacy issues of graph neural networks. Little attention has been paid to understand the privacy risks of integrating the output from graph embedding models (e.g., node embeddings) with complex downstream machine learning pipelines. In this paper, we fill this gap and propose a novel model-agnostic graph recovery attack that exploits the implicit graph structural information preserved in the embeddings of graph nodes. We show that an adversary can recover edges with decent accuracy by only gaining access to the node embedding matrix of the original graph without interactions with the node embedding models. We demonstrate the effectiveness and applicability of our graph recovery attack through extensive experiments.
Modeling of a multi-parameter chaotic optoelectronic oscillator based on the Fourier neural operator

A model construction scheme of chaotic optoelectronic oscillator (OEO) based on the Fourier neural operator (FNO) is proposed. Different from the conventional methods, we learn the nonlinear dynamics of OEO (actual components) in a data-driven way, expecting to obtain a multi-parameter OEO model for generating chaotic carrier with high-efficiency and low-cost. FNO is a deep learning architecture which utilizes neural network as a parameter structure to learn the trajectory of the family of equations from training data. With the assistance of FNO, the nonlinear dynamics of OEO characterized by differential delay equation can be modeled easily. In this work, the maximal Lyapunov exponent is applied to judge whether these time series have chaotic behavior, and the Pearson correlation coefficient ( PCC ) is introduced to evaluate the modeling performance. Compare with long and short-term memory (LSTM), FNO is not only superior to LSTM in modeling accuracy, but also requires less training data. Subsequently, we analyze the modeling performance of FNO under different feedback gains and time delays. Both numerical and experimental results show that the PCC can be greater than 0.99 in the case of low feedback gain. Next, we further analyze the influence of different system oscillation frequencies, and the generalization ability of FNO is also analyzed.
An Object Detection and Localization Method Based on Improved YOLOv5 for the Teleoperated Robot

In the traditional teleoperation system, the operator locates the object using the real-time scene information sent back from the robot terminal; however, the localization accuracy is poor and the execution efficiency is low. To address the issues, we propose an object detection and localization method for the teleoperated robot. First, we improved the classic YOLOv5 network model to produce superior object detection performance and named the improved model YOLOv5_Tel. On the basis of the classic YOLOv5 network model, the feature pyramid network was changed to a bidirectional feature pyramid network (BiFPN) network module to achieve the weighted feature fusion mechanism. The coordinate attention (CA) module was added to make the model pay more attention to the features of interest. Furthermore, we pruned the model from the depth and width to make it more lightweight and changed the bounding box regression loss function GIOU to SIOU to speed up model convergence. Then, the YOLOv5_Tel model and ZED2 depth camera were used to achieve object localization based on the binocular stereo vision ranging principle. Finally, we established an object detection platform for the teleoperated robot and created a small dataset to validate the proposed method. The experiment shows that compared with the classic YOLOv5 series network model, the YOLOv5_Tel is higher in accuracy, lighter in weight, and faster in detection speed. The mean average precision (mAP) value of the YOLOv5_Tel increased by 0.8%, 0.9%, and 1.0%, respectively. The model size decreased by 11.1%, 70.0%, and 86.4%, respectively. The inference time decreased by 9.1%, 42.9%, and 58.3%, respectively. The proposed object localization method has a high localization accuracy with an average relative error of only 1.12%.
Forensic Analysis of Blackhole Attack in Wireless Sensor Networks/Internet of Things

The internet of things (IoT) is prone to various types of denial of service (DoS) attacks due to their resource-constrained nature. Extensive research efforts have been dedicated to securing these systems, but various vulnerabilities remain. Notably, it is challenging to maintain the confidentiality, integrity, and availability of mobile ad hoc networks due to limited connectivity and dynamic topology. As critical infrastructure including smart grids, industrial control, and intelligent transportation systems is reliant on WSNs and IoT, research efforts that forensically investigate and analyze the cybercrimes in IoT and WSNs are imperative. When a security failure occurs, the causes, vulnerabilities, and facts behind the failure need to be revealed and examined to improve the security of these systems. This research forensically investigates the performance of the ad hoc IoT networks using the ad hoc on-demand distance vector (AODV) routing protocol under the blackhole attack, which is a type of denial of service attack detrimental to IoT networks. This work also examines the traffic patterns in the network and nodes to assess the attack damage and conducts vulnerability analysis of the protocol to carry out digital forensic (DF) investigations. It further reconstructs the networks under different modes and parameters to verify the analysis and provide suggestions to design roubust routing protocols.
Pap Smear Images Classification Using Machine Learning: A Literature Matrix

Cervical cancer is regularly diagnosed in women all over the world. This cancer is the seventh most frequent cancer globally and the fourth most prevalent cancer among women. Automated and higher accuracy of cervical cancer classification methods are needed for the early diagnosis of cancer. In addition, this study has proved that routine Pap smears could enhance clinical outcomes by facilitating the early diagnosis of cervical cancer. Liquid-based cytology (LBC)/Pap smears for advanced cervical screening is a highly effective precancerous cell detection technology based on cell image analysis, where cells are classed as normal or abnormal. Computer-aided systems in medical imaging have benefited greatly from extraordinary developments in artificial intelligence (AI) technology. However, resource and computational cost constraints prevent the widespread use of AI-based automation-assisted cervical cancer screening systems. Hence, this paper reviewed the related studies that have been done by previous researchers related to the automation of cervical cancer classification based on machine learning. The objective of this study is to systematically review and analyses the current research on the classification of the cervical using machine learning. The literature that has been reviewed is indexed by Scopus and Web of Science. As a result, for the published paper access until October 2022, this study assessed past approaches for cervical cell classification based on machine learning applications.
An Overview of Knowledge Graph Reasoning: Key Technologies and Applications

In recent years, with the rapid development of Internet technology and applications, the scale of Internet data has exploded, which contains a significant amount of valuable knowledge. The best methods for the organization, expression, calculation, and deep analysis of this knowledge have attracted a great deal of attention. The knowledge graph has emerged as a rich and intuitive way to express knowledge. Knowledge reasoning based on knowledge graphs is one of the current research hot spots in knowledge graphs and has played an important role in wireless communication networks, intelligent question answering, and other applications. Knowledge graph-oriented knowledge reasoning aims to deduce new knowledge or identify wrong knowledge from existing knowledge. Different from traditional knowledge reasoning, knowledge reasoning methods oriented to knowledge graphs are more diversified due to the concise, intuitive, flexible, and rich knowledge expression forms in knowledge graphs. Based on the basic concepts of knowledge graphs and knowledge graph reasoning, this paper introduces the latest research progress in knowledge graph-oriented knowledge reasoning methods in recent years. Specifically, according to different reasoning methods, knowledge graph reasoning includes rule-based reasoning, distributed representation-based reasoning, neural network-based reasoning, and mixed reasoning. These methods are summarized in detail, and the future research directions and prospects of knowledge reasoning based on knowledge graphs are discussed and prospected.
A Novel Data-Driven Evaluation Framework for Fork after Withholding Attack in Blockchain Systems

In the blockchain system, mining pools are popular for miners to work collectively and obtain more revenue. Nowadays, there are consensus attacks that threaten the efficiency and security of mining pools. As a new type of consensus attack, the Fork After Withholding (FAW) attack can cause huge economic losses to mining pools. Currently, there are a few evaluation tools for FAW attacks, but it is still difficult to evaluate the FAW attack protection capability of target mining pools. To address the above problem, this paper proposes a novel evaluation framework for FAW attack protection of the target mining pools in blockchain systems. In this framework, we establish the revenue model for mining pools, including honest consensus revenue, block withholding revenue, successful fork revenue, and consensus cost. We also establish the revenue functions of target mining pools and other mining pools, respectively. In particular, we propose an efficient computing power allocation optimization algorithm (CPAOA) for FAW attacks against multiple target mining pools. We propose a model-solving algorithm based on improved Aquila optimization by improving the selection mechanism in different optimization stages, which can increase the convergence speed of the model solution and help find the optimal solution in computing power allocation. Furthermore, to greatly reduce the possibility of falling into local optimal solutions, we propose a solution update mechanism that combines the idea of scout bees in an artificial bee colony optimization algorithm and the constraint of allocating computing power. The experimental results show that the framework can effectively evaluate the revenue of various mining pools. CPAOA can quickly and accurately allocate the computing power of FAW attacks according to the computing power of the target mining pool. Thus, the proposed evaluation framework can effectively help evaluate the FAW attack protection capability of multiple target mining pools and ensure the security of the blockchain system.
Confidentiality Protection in the 2020 US Census of Population and Housing

In an era where external data and computational capabilities far exceed statistical agencies’ own resources and capabilities, they face the renewed challenge of protecting the confidentiality of underlying microdata when publishing statistics in very granular form and ensuring that these granular data are used for statistical purposes only. Conventional statistical disclosure limitation methods are too fragile to address this new challenge. This article discusses the deployment of a differential privacy framework for the 2020 US Census that was customized to protect confidentiality, particularly the most detailed geographic and demographic categories, and deliver controlled accuracy across the full geographic hierarchy.
Rethinking Sampling Strategies for Unsupervised Person Re-Identification

Unsupervised person re-identification (re-ID) remains a challenging task. While extensive research has focused on the framework design and loss function, this paper shows that sampling strategy plays an equally important role. We analyze the reasons for the performance differences between various sampling strategies under the same framework and loss function. We suggest that deteriorated over-fitting is an important factor causing poor performance, and enhancing statistical stability can rectify this problem. Inspired by that, a simple yet effective approach is proposed, termed group sampling, which gathers samples from the same class into groups. The model is thereby trained using normalized group samples, which helps alleviate the negative impact of individual samples. Group sampling updates the pipeline of pseudo-label generation by guaranteeing that samples are more efficiently classified into the correct classes. It regulates the representation learning process, enhancing statistical stability for feature representation in a progressive fashion. Extensive experiments on Market-1501, DukeMTMC-reID and MSMT17 show that group sampling achieves performance comparable to state-of-the-art methods and outperforms the current techniques under purely camera-agnostic settings. Code has been available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/ucas-vg/GroupSampling</uri> .
Constant-Cost Implementations of Clifford Operations and Multiply-Controlled Gates Using Global Interactions

We consider quantum circuits composed of single-qubit operations and global entangling gates generated by Ising-type Hamiltonians. It is shown that such circuits can implement a large class of unitary operators commonly used in quantum algorithms at a very low cost---using a constant or effectively constant number of global entangling gates. Specifically, we report constant-cost implementations of Clifford operations with and without ancillae, constant-cost implementation of the multiply-controlled gates with linearly many ancillae, and an $\mathrm{O}({\mathrm{log}}^{*}(n))$ cost implementation of the $n$-controlled single-target gates using logarithmically many ancillae. This shows a significant asymptotic advantage of circuits enabled by the global entangling gates.
Driven-Dissipative Time Crystalline Phases in a Two-Mode Bosonic System with Kerr Nonlinearity

For the driven-dissipative system of two coupled bosonic modes in a nonlinear cavity resonator, we demonstrate a sequence of phase transitions from a trivial steady state to two distinct dissipative time crystalline phases. These effects are already anticipated at the level of the semiclassical analysis of the Lindblad equation using the theory of bifurcations and are further supported by the full quantum treatment. The system is predicted to exhibit different dynamical phases characterized by an oscillating nonequilibrium steady state with nontrivial periodicity, which is a hallmark of time crystals. We expect that these phases can be directly probed in various cavity QED experiments.