Reviewerly/exHarmony huggingface dataset:
New Time-Memory Trade-Offs for Subset Sum – Improving ISD in Theory and Practice

We propose new time-memory trade-offs for the random subset sum problem defined on $$(a_1,\ldots ,a_n,t)$$ over $$\mathbb {Z}_{2^n}$$ . Our trade-offs yield significant running time improvements for every fixed memory limit $$M\ge 2^{0.091n}$$ . Furthermore, we interpolate to the running times of the fastest known algorithms when memory is not limited. Technically, our design introduces a pruning strategy to the construction by Becker-Coron-Joux (BCJ) that allows for an exponentially small success probability. We compensate for this reduced probability by multiple randomized executions. Our main improvement stems from the clever reuse of parts of the computation in subsequent executions to reduce the time complexity per iteration. As an application of our construction, we derive the first non-trivial time-memory trade-offs for Information Set Decoding (ISD) algorithms. Our new algorithms improve on previous (implicit) trade-offs asymptotically as well as practically. Moreover, our optimized implementation also improves on running time, due to reduced memory access costs. We demonstrate this by obtaining a new record computation in decoding quasi-cyclic codes (QC-3138). Using our newly obtained data points we then extrapolate the hardness of suggested parameter sets for the NIST PQC fourth round candidates McEliece, BIKE and HQC, lowering previous estimates by up to 6 bits and further increasing their reliability.
Integrating Nearest Neighbors with Neural Network Models for Treatment Effect Estimation

Treatment effect estimation is of high-importance for both researchers and practitioners across many scientific and industrial domains. The abundance of observational data makes them increasingly used by researchers for the estimation of causal effects. However, these data suffer from biases, from several weaknesses, leading to inaccurate causal effect estimations, if not handled properly. Therefore, several machine learning techniques have been proposed, most of them focusing on leveraging the predictive power of neural network models to attain more precise estimation of causal effects. In this work, we propose a new methodology, named Nearest Neighboring Information for Causal Inference (NNCI), for integrating valuable nearest neighboring information on neural network-based models for estimating treatment effects. The proposed NNCI methodology is applied to some of the most well established neural network-based models for treatment effect estimation with the use of observational data. Numerical experiments and analysis provide empirical and statistical evidence that the integration of NNCI with state-of-the-art neural network models leads to considerably improved treatment effect estimations on a variety of well-known challenging benchmarks.
Fully Autonomous Programming with Large Language Models

Current approaches to program synthesis with Large Language Models (LLMs) exhibit a "near miss syndrome": they tend to generate programs that semantically resemble the correct answer (as measured by text similarity metrics or human evaluation), but achieve a low or even zero accuracy as measured by unit tests due to small imperfections, such as the wrong input or output format. This calls for an approach known as Synthesize, Execute, Debug (SED), whereby a draft of the solution is generated first, followed by a program repair phase addressing the failed tests. To effectively apply this approach to instruction-driven LLMs, one needs to determine which prompts perform best as instructions for LLMs, as well as strike a balance between repairing unsuccessful programs and replacing them with newly generated ones. We explore these trade-offs empirically, comparing replace-focused, repair-focused, and hybrid debug strategies, as well as different template-based and model-based prompt-generation techniques. We use OpenAI Codex as the LLM and Program Synthesis Benchmark 2 as a database of problem descriptions and tests for evaluation. The resulting framework outperforms both conventional usage of Codex without the repair phase and traditional genetic programming approaches.
Toward Information-Centric Vehicular Cloud: Technologies, Challenges, and Opportunities

At present, road-safety problems such as traffic accidents have become increasingly serious. In the next ten years, road safety problems will lead to 13 million deaths if no effective measures are taken. Rapid retrieval of road information can prevent most traffic accidents, so it is becoming an important measure to solve road-safety problems. However, with increasing complexity and diversification of road information, an individual vehicle can no longer produce the entire traffic and road information due to limitations of visual angles and resources. In this circumstance, the concept of Vehicular Cloud (VC) is proposed to enable resource sharing and collaboration among cloud members as a solution for overcoming resource limitations. In this article, we analyze the features of VC, the advantages of the information-centric model, and propose that the information-centric model could be an ideal solution for achieving VC. Then, we discuss the open challenges encountered in enabling VC using the information-centric model, as well as some possible solutions.
An enhanced Runge Kutta boosted machine learning framework for medical diagnosis

With the development and maturity of machine learning methods, medical diagnosis aided with machine learning methods has become a popular method to assist doctors in diagnosing and treating patients. However, machine learning methods are greatly affected by their hyperparameters, for instance, the kernel parameter in kernel extreme learning machine (KELM) and the learning rate in residual neural networks (ResNet). If the hyperparameters are appropriately set, the performance of the classifier can be significantly improved. To boost the performance of the machine learning methods, this paper proposes to improve the Runge Kutta optimizer (RUN) to adaptively adjust the hyperparameters of the machine learning methods for medical diagnosis purposes. Although RUN has a solid mathematical theoretical foundation, there are still some performance defects when dealing with complex optimization problems. To remedy these defects, this paper proposes a new enhanced RUN method with a grey wolf mechanism and an orthogonal learning mechanism called GORUN. The superior performance of the GORUN was validated against other well-established optimizers on IEEE CEC 2017 benchmark functions. Then, the proposed GORUN is employed to optimize the machine learning models, including the KELM and ResNet, to construct robust models for medical diagnosis. The performance of the proposed machine learning framework was validated on several medical data sets, and the experimental results have demonstrated its superiority.
Sustainable Approaches of Blockchain Tech, Artificial Intelligence, and Climate Finance in the 4&amp;5IR

Save the green and live in the green should be the mottos of the modern high-tech world. Industry 4.0 introduces the most advanced automated technologies, but many of them cause high CO2 emissions around the globe that need strong compelling force because any catastrophic changes in the climate causes dreadful vandalization in the economy and society. This chapter discusses the climate-friendly economic and low-emission technological developments in the 4IR and 5IR by using the practical-sense mechanism. Reading this chapter will therefore increase the knowledge of blockchain technology (BT), artificial intelligence (AI), and climate finance in the low carbon economic sustainability. Furthermore, the proposed green development themes (i.e., hybrid green city and industrial layout, hybrid low emission agriculture farm) affirms the sustainable low carbon economic developments in the forthcoming Industry 5.0. Finally, the strategic recommendations will assist in developing the low carbon economy with the perfection of BT, AI, and global climate finance in the world.
Domain-adaptive message passing graph neural network

Cross-network node classification (CNNC), which aims to classify nodes in a label-deficient target network by transferring the knowledge from a source network with abundant labels, draws increasing attention recently. To address CNNC, we propose a domain-adaptive message passing graph neural network (DM-GNN), which integrates graph neural network (GNN) with conditional adversarial domain adaptation. DM-GNN is capable of learning informative representations for node classification that are also transferrable across networks. Firstly, a GNN encoder is constructed by dual feature extractors to separate ego-embedding learning from neighbor-embedding learning so as to jointly capture commonality and discrimination between connected nodes. Secondly, a label propagation node classifier is proposed to refine each node's label prediction by combining its own prediction and its neighbors' prediction. In addition, a label-aware propagation scheme is devised for the labeled source network to promote intra-class propagation while avoiding inter-class propagation, thus yielding label-discriminative source embeddings. Thirdly, conditional adversarial domain adaptation is performed to take the neighborhood-refined class-label information into account during adversarial domain adaptation, so that the class-conditional distributions across networks can be better matched. Comparisons with eleven state-of-the-art methods demonstrate the effectiveness of the proposed DM-GNN.
Multi-Modal Mutual Attention and Iterative Interaction for Referring Image Segmentation

We address the problem of referring image segmentation that aims to generate a mask for the object specified by a natural language expression. Many recent works utilize Transformer to extract features for the target object by aggregating the attended visual regions. However, the generic attention mechanism in Transformer only uses the language input for attention weight calculation, which does not explicitly fuse language features in its output. Thus, its output feature is dominated by vision information, which limits the model to comprehensively understand the multi-modal information, and brings uncertainty for the subsequent mask decoder to extract the output mask. To address this issue, we propose Multi-Modal Mutual Attention (M3Att) and Multi-Modal Mutual Decoder ( M3Dec ) that better fuse information from the two input modalities. Based on M3Dec , we further propose Iterative Multi-modal Interaction (IMI) to allow continuous and in-depth interactions between language and vision features. Furthermore, we introduce Language Feature Reconstruction (LFR) to prevent the language information from being lost or distorted in the extracted feature. Extensive experiments show that our proposed approach significantly improves the baseline and outperforms state-of-the-art referring image segmentation methods on RefCOCO series datasets consistently.
Cross-modal hashing with missing labels

Hashing-based cross-modal retrieval methods have become increasingly popular due to their advantages in storage and speed. While current methods have demonstrated impressive results, there are still several issues that have not been addressed. Specifically, many of these approaches assume that labels are perfectly assigned, despite the fact that in real-world scenarios, labels are often incomplete or partially missing. There are two reasons for this, as manual labeling can be a complex and time-consuming task, and annotators may only be interested in certain objects. As such, cross-modal retrieval with missing labels is a significant challenge that requires further attention. Moreover, the similarity between labels is frequently ignored, which is important for exploring the high-level semantics of labels. To address these limitations, we propose a novel method called Cross-Modal Hashing with Missing Labels (CMHML). Our method consists of several key components. First, we introduce Reliable Label Learning to preserve reliable information from the observed labels. Next, to infer the uncertain part of the predicted labels, we decompose the predicted labels into latent representations of labels and samples. The representation of samples is extracted from different modalities, which assists in inferring missing labels. We also propose Label Correlation Preservation to enhance the similarity between latent representations of labels. Hash codes are then learned from the representation of samples through Global Approximation Learning. We also construct a similarity matrix according to predicted labels and embed it into hash codes learning to explore the value of labels. Finally, we train linear classifiers to map original samples to a low-dimensional Hamming space. To evaluate the efficacy of CMHML, we conduct extensive experiments on four publicly available datasets. Our method is compared to other state-of-the-art methods, and the results demonstrate that our model performs competitively even when most labels are missing.
A Pilot Validation Study Comparing Fluorescence-Imitating Brightfield Imaging, A Slide-Free Imaging Method, With Standard Formalin-Fixed, Paraffin-Embedded Hematoxylin-Eosin–Stained Tissue Section Histology for Primary Surgical Pathology Diagnosis

Digital pathology using whole slide images has been recently approved to support primary diagnosis in clinical surgical pathology practices. Here we describe a novel imaging method, fluorescence-imitating brightfield imaging, that can capture the surface of fresh tissue without requiring prior fixation, paraffin embedding, tissue sectioning, or staining.To compare the ability of pathologists to evaluate direct-to-digital images with standard pathology preparations.One hundred surgical pathology samples were obtained. Samples were first digitally imaged, then processed for standard histologic examination on 4-μm hematoxylin-eosin-stained sections and digitally scanned. The resulting digital images from both digital and standard scan sets were viewed by each of 4 reading pathologists. The data set consisted of 100 reference diagnoses and 800 study pathologist reads. Each study read was compared to the reference diagnosis, and also compared to that reader's diagnosis across both modalities.The overall agreement rate, across 800 reads, was 97.9%. This consisted of 400 digital reads at 97.0% versus reference and 400 standard reads versus reference at 98.8%. Minor discordances (defined as alternative diagnoses without clinical treatment or outcome implications) were 6.1% overall, 7.2% for digital, and 5.0% for standard.Pathologists can provide accurate diagnoses from fluorescence-imitating brightfield imaging slide-free images. Concordance and discordance rates are similar to published rates for comparisons of whole slide imaging to standard light microscopy of glass slides for primary diagnosis. It may be possible, therefore, to develop a slide-free, nondestructive approach for primary pathology diagnosis.
A Siamese Transformer Network for Zero-Shot Ancient Coin Classification

Ancient numismatics, the study of ancient coins, has in recent years become an attractive domain for the application of computer vision and machine learning. Though rich in research problems, the predominant focus in this area to date has been on the task of attributing a coin from an image, that is of identifying its issue. This may be considered the cardinal problem in the field and it continues to challenge automatic methods. In the present paper, we address a number of limitations of previous work. Firstly, the existing methods approach the problem as a classification task. As such, they are unable to deal with classes with no or few exemplars (which would be most, given over 50,000 issues of Roman Imperial coins alone), and require retraining when exemplars of a new class become available. Hence, rather than seeking to learn a representation that distinguishes a particular class from all the others, herein we seek a representation that is overall best at distinguishing classes from one another, thus relinquishing the demand for exemplars of any specific class. This leads to our adoption of the paradigm of pairwise coin matching by issue, rather than the usual classification paradigm, and the specific solution we propose in the form of a Siamese neural network. Furthermore, while adopting deep learning, motivated by its successes in the field and its unchallenged superiority over classical computer vision approaches, we also seek to leverage the advantages that transformers have over the previously employed convolutional neural networks, and in particular their non-local attention mechanisms, which ought to be particularly useful in ancient coin analysis by associating semantically but not visually related distal elements of a coin’s design. Evaluated on a large data corpus of 14,820 images and 7605 issues, using transfer learning and only a small training set of 542 images of 24 issues, our Double Siamese ViT model is shown to surpass the state of the art by a large margin, achieving an overall accuracy of 81%. Moreover, our further investigation of the results shows that the majority of the method’s errors are unrelated to the intrinsic aspects of the algorithm itself, but are rather a consequence of unclean data, which is a problem that can be easily addressed in practice by simple pre-processing and quality checking.
Decoy state semi-quantum key distribution

Abstract Semi-quantum key distribution describes a system in which a fully quantum user and classical user perform key distribution. The main advantage of key distribution is its security. Owing to the bottlenecks of existing technology, highly attenuated lasers and threshold detectors are required for semi-quantum key distribution; however, these components make semi-quantum key distribution susceptible to eavesdroppers. Our previous study presented the first semi-quantum key distribution experiment and verified the feasibility of the mirror protocol in 2021. Herein, we first build a semi-quantum key distribution channel model and use Gottesman-Lo-Lütkenhaus-Preskill theory to evaluate its safety performance in the case of a quasi-single photon source. Moreover, we determine that an eavesdropper can steal all information through the photon-number-splitting attack without being detected. Therefore, we add decoy states to the semi-quantum key distribution to estimate the furthest transmission distance and secure bit rate under asymptotic conditions. Semi-quantum key distribution can still be achieved safely with highly attenuated lasers and threshold detectors in 150 km.
A Simple Chaotic Model With Complex Chaotic Behaviors and Its Hardware Implementation

Recently, due to the initial sensitivity, ergodicity, boundedness, and unpredictability of chaos, it has been widely used in the fields of secure communication, signal processing, chaotic synchronization, etc. Moreover, due to the low complexity of hardware implementation, widespread attention to one-dimensional (1D) chaotic maps has been paid from researchers. However, some existing 1D maps have simple chaotic behaviors and discrete chaotic intervals, which have significantly affected the practical application. To address these shortcomings, this paper proposes a 1D chaotic model based on the absolute value function and the cosine function called the cosine-coupled chaotic model (CCCM). It can use existing 1D chaotic maps as seed maps to construct a series of 1D chaotic maps with continuous chaotic intervals and complex chaotic behaviors. To verify the effectiveness of the CCCM, we first generate three new chaotic maps using the CCCM, and then their chaotic properties are analyzed by using various measures including Lyapunov exponent (LE), sample entropy (SE), correlation dimension (CD), 0–1 test and sensitivity. The experimental results confirm that the new chaotic maps have wider chaotic intervals and more complex chaotic behaviors than the corresponding seed maps and some other advanced chaotic maps. Then we use a field programmable gate array (FPGA) as the hardware platform for simple hardware implementations of the new chaotic maps. And a new pseudo-random number generator (PRNG) is introduced to verify practical applications of the new maps. Finally, experimental results show that the new chaotic maps can be implemented on FPGA and the proposed PRNG has strong random properties.
Clinical concept and relation extraction using prompt-based machine reading comprehension

Objective: To develop a natural language processing system that solves both clinical concept extraction and relation extraction in a unified prompt-based machine reading comprehension (MRC) architecture with good generalizability for cross-institution applications. Methods: We formulate both clinical concept extraction and relation extraction using a unified prompt-based MRC architecture and explore state-of-the-art transformer models. We compare our MRC models with existing deep learning models for concept extraction and end-to-end relation extraction using two benchmark datasets developed by the 2018 National NLP Clinical Challenges (n2c2) challenge (medications and adverse drug events) and the 2022 n2c2 challenge (relations of social determinants of health [SDoH]). We also evaluate the transfer learning ability of the proposed MRC models in a cross-institution setting. We perform error analyses and examine how different prompting strategies affect the performance of MRC models. Results and Conclusion: The proposed MRC models achieve state-of-the-art performance for clinical concept and relation extraction on the two benchmark datasets, outperforming previous non-MRC transformer models. GatorTron-MRC achieves the best strict and lenient F1-scores for concept extraction, outperforming previous deep learning models on the two datasets by 1%~3% and 0.7%~1.3%, respectively. For end-to-end relation extraction, GatorTron-MRC and BERT-MIMIC-MRC achieve the best F1-scores, outperforming previous deep learning models by 0.9%~2.4% and 10%-11%, respectively. For cross-institution evaluation, GatorTron-MRC outperforms traditional GatorTron by 6.4% and 16% for the two datasets, respectively. The proposed method is better at handling nested/overlapped concepts, extracting relations, and has good portability for cross-institute applications.
Global contextual attention augmented YOLO with ConvMixer prediction heads for PCB surface defect detection

To solve the problem of missed and false detection caused by the large number of tiny targets and complex background textures in a printed circuit board (PCB), we propose a global contextual attention augmented YOLO model with ConvMixer prediction heads (GCC-YOLO). In this study, we apply a high-resolution feature layer (P2) to gain more details and positional information of small targets. Moreover, in order to suppress the background noisy information and further enhance the feature extraction capability, a global contextual attention module (GC) is introduced in the backbone network and combined with a C3 module. Furthermore, in order to reduce the loss of shallow feature information due to the deepening of network layers, a bi-directional weighted feature pyramid (BiFPN) feature fusion structure is introduced. Finally, a ConvMixer module is introduced and combined with the C3 module to create a new prediction head, which improves the small target detection capability of the model while reducing the parameters. Test results on the PCB dataset show that GCC-YOLO improved the Precision, Recall, mAP@0.5, and mAP@0.5:0.95 by 0.2%, 1.8%, 0.5%, and 8.3%, respectively, compared to YOLOv5s; moreover, it has a smaller model volume and faster reasoning speed compared to other algorithms.