Reviewerly/exHarmony huggingface dataset:
A Transformer-based multimodal-learning framework using sky images for ultra-short-term solar irradiance forecasting

The development of solar energy is crucial to combat the global climate change and fossil energy crisis. However, the inherent uncertainty of solar power prevents its large-scale integration into power grids. Although various sky-image-derived modeling methods exist to forecast the variations of solar irradiance, few focus on fully utilizing the coupling correlations between sky images and historical data to improve the forecasting performance. Therefore, a novel multimodal-learning framework is proposed for forecasting global horizontal irradiance (GHI) in the ultra-short-term. First, the historical and empirically estimated clear-sky GHI are encoded by Informer. Then, the ground-based sky images are transformed into optical flow maps, which can be handled by Vision Transformer. Subsequently, a cross-modality attention method is proposed to explore the coupling correlations between the two modalities. Last, a generative decoder is used to implement multi-step forecasting. The experimental results show that the proposed method achieves a normalized root mean square error (NRMSE) of 4.28% in 10-min-ahead forecasting. Several state-of-the-art methods are also used for comparisons. The experimental results show that the proposed method outperforms the benchmark methods and exhibits higher accuracy and robustness in ultra-short-term GHI forecasting.
High-Speed Drone Detection Based On Yolo-V8

Detecting drones in a video is a challenging problem due to their dynamic movements and varying range of scales. Moreover, since drone detection is often required for security, it should be as fast as possible. In this paper, we modify the state-of-the-art YOLO-V8 to achieve fast and reliable drone detection. Specifically, we add Multi-Scale Image Fusion and P2 Layer to the medium-size model (M-model) of YOLO-V8. Our model was evaluated in the 6th WOSDETC challenge.
Achieving Privacy-Preserving and Verifiable Support Vector Machine Training in the Cloud

With the proliferation of machine learning, the cloud server has been employed to collect massive data and train machine learning models. Several privacy-preserving machine learning schemes have been suggested recently to guarantee data and model privacy in the cloud. However, these schemes either mandate the involvement of the data owner in model training or utilize high-cost cryptographic techniques, resulting in excessive computational and communication overheads. Furthermore, none of the existing work considers the malicious behavior of the cloud server during model training. In this paper, we propose the first privacy-preserving and verifiable support vector machine training scheme by employing a two-cloud platform. Specifically, based on the homomorphic verification tag, we design a verification mechanism to enable verifiable machine learning training. Meanwhile, to improve the efficiency of model training, we combine homomorphic encryption and data perturbation to design an efficient multiplication operation for the encryption domain. A rigorous theoretical analysis demonstrates the security and reliability of our scheme. The experimental results indicate that our scheme can reduce computational and communication overheads by at least 43.94% and 99.58%, respectively, compared to state-of-the-art SVM training methods.
Faster sorting algorithms discovered using deep reinforcement learning

Fundamental algorithms such as sorting or hashing are used trillions of times on any given day1. As demand for computation grows, it has become critical for these algorithms to be as performant as possible. Whereas remarkable progress has been achieved in the past2, making further improvements on the efficiency of these routines has proved challenging for both human scientists and computational approaches. Here we show how artificial intelligence can go beyond the current state of the art by discovering hitherto unknown routines. To realize this, we formulated the task of finding a better sorting routine as a single-player game. We then trained a new deep reinforcement learning agent, AlphaDev, to play this game. AlphaDev discovered small sorting algorithms from scratch that outperformed previously known human benchmarks. These algorithms have been integrated into the LLVM standard C++ sort library3. This change to this part of the sort library represents the replacement of a component with an algorithm that has been automatically discovered using reinforcement learning. We also present results in extra domains, showcasing the generality of the approach.
AudioLM: A Language Modeling Approach to Audio Generation

We introduce AudioLM, a framework for high-quality audio generation with long-term consistency. AudioLM maps the input audio to a sequence of discrete tokens and casts audio generation as a language modeling task in this representation space. We show how existing audio tokenizers provide different trade-offs between reconstruction quality and long-term structure, and we propose a hybrid tokenization scheme to achieve both objectives. Namely, we leverage the discretized activations of a masked language model pre-trained on audio to capture long-term structure and the discrete codes produced by a neural audio codec to achieve high-quality synthesis. By training on large corpora of raw audio waveforms, AudioLM learns to generate natural and coherent continuations given short prompts. When trained on speech, and without any transcript or annotation, AudioLM generates syntactically and semantically plausible speech continuations while also maintaining speaker identity and prosody for unseen speakers. Furthermore, we demonstrate how our approach extends beyond speech by generating coherent piano music continuations, despite being trained without any symbolic representation of music.
Study on Sentence and Question Formation Using Deep Learning Techniques

Natural language techniques require less personal information to communicate between computers and people. Generative models can create text for machine translation, summarization, and captioning without the need for dataset labelling. Markov chains and hidden Markov models can also be employed. A language model that can produce sentences word by word was created using RNNs (recurrent neural networks), LSTMs (long short-term memory model), and GRUs (gated recurrent unit). The suggested method compares RNN, LSTM, and GRU networks to see which produces the most realistic text and how training loss varies with iterations. Cloze questions feature alternative responses with distractors, whereas open-cloze questions include instructive phrases with one or more gaps. This chapter provides two novel ways to generate distractors for computer-aided exams that are simple and dependable.
Explainable Artificial Intelligence (XAI): Concepts and Challenges in Healthcare

Artificial Intelligence (AI) describes computer systems able to perform tasks that normally require human intelligence, such as visual perception, speech recognition, decision-making, and language translation. Examples of AI techniques are machine learning, neural networks, and deep learning. AI can be applied in many different areas, such as econometrics, biometry, e-commerce, and the automotive industry. In recent years, AI has found its way into healthcare as well, helping doctors make better decisions (“clinical decision support”), localizing tumors in magnetic resonance images, reading and analyzing reports written by radiologists and pathologists, and much more. However, AI has one big risk: it can be perceived as a “black box”, limiting trust in its reliability, which is a very big issue in an area in which a decision can mean life or death. As a result, the term Explainable Artificial Intelligence (XAI) has been gaining momentum. XAI tries to ensure that AI algorithms (and the resulting decisions) can be understood by humans. In this narrative review, we will have a look at some central concepts in XAI, describe several challenges around XAI in healthcare, and discuss whether it can really help healthcare to advance, for example, by increasing understanding and trust. Finally, alternatives to increase trust in AI are discussed, as well as future research possibilities in the area of XAI.
NTIRE 2023 Challenge on Stereo Image Super-Resolution: Methods and Results

This paper summarizes the 2nd NTIRE challenge on stereo image super-resolution (SR) with a focus on new solutions and results. The task of the challenge is to super-resolve a low-resolution stereo image pair to a high-resolution one with a magnification factor of ×4. Compared with single image SR, the major challenge of this challenge lies in how to exploit additional information in another viewpoint and how to maintain stereo consistency in the results. This challenge has 3 tracks, including one track on distortion (e.g., PSNR) and bicubic degradation, one track on perceptual quality (e.g., LPIPS) and bicubic degradation, as well as another track on real degradations. In total, 175, 93, and 103 participants were successfully registered for each track, respectively. In the test phase, 21, 17, and 12 teams successfully submitted results with PSNR (RGB) scores better than the baseline. This challenge establishes a new benchmark for stereo image SR.
Prompting Large Language Models with Answer Heuristics for Knowledge-Based Visual Question Answering

Knowledge-based visual question answering (VQA) requires external knowledge beyond the image to answer the question. Early studies retrieve required knowledge from explicit knowledge bases (KBs), which often introduces irrelevant information to the question, hence restricting the performance of their models. Recent works have sought to use a large language model (i.e., GPT-3 [3]) as an implicit knowledge engine to acquire the necessary knowledge for answering. Despite the encouraging results achieved by these methods, we argue that they have not fully activated the capacity of GPT-3 as the provided input information is insufficient. In this paper, we present Prophet-a conceptually simple framework designed to <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$prompt$</tex> GPT-3 with answer heuristics for knowledge-based VQA. Specifically, we first train a vanilla VQA model on a specific knowledge-based VQA dataset without external knowledge. After that, we extract two types of complementary answer heuristics from the model: answer candidates and answer-aware examples. Finally, the two types of answer heuristics are encoded into the prompts to enable GPT-3 to better comprehend the task thus enhancing its capacity. Prophet significantly outperforms all existing state-of-the-art methods on two challenging knowledge-based VQA datasets, OK-VQA and A-OKVQA, delivering 61.1% and 55.7% accuracies on their testing sets, respectively.
Curricular Contrastive Regularization for Physics-Aware Single Image Dehazing

Considering the ill-posed nature, contrastive regularization has been developed for single image dehazing, introducing the information from negative images as a lower bound. However, the contrastive samples are non-consensual, as the negatives are usually represented distantly from the clear (i.e., positive) image, leaving the solution space still under-constricted. Moreover, the interpretability of deep dehazing models is underexplored towards the physics of the hazing process. In this paper, we propose a novel curricular contrastive regularization targeted at a consensual contrastive space as opposed to a non-consensual one. Our negatives, which provide better lower-bound constraints, can be assembled from 1) the hazy image, and 2) corresponding restorations by other existing methods. Further, due to the different similarities between the embeddings of the clear image and negatives, the learning difficulty of the multiple components is intrinsically imbalanced. To tackle this issue, we customize a curriculum learning strategy to reweight the importance of different negatives. In addition, to improve the interpretability in the feature space, we build a physics-aware dual-branch unit according to the atmospheric scattering model. With the unit, as well as curricular contrastive regularization, we establish our dehazing network, named C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> PNet. Extensive experiments demonstrate that our C <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> PNet significantly outperforms state-of-the-art methods, with extreme PSNR boosts of 3.94dB and 1.50dB, respectively, on SOTS-indoor and SOTS-outdoor datasets. Code is available at https://github.com/YuZheng9/C2PNet.
Feature Distilled Tracking

Feature extraction and representation is one of the most important components for fast, accurate, and robust visual tracking. Very deep convolutional neural networks (CNNs) provide effective tools for feature extraction with good generalization ability. However, extracting features using very deep CNN models needs high performance hardware due to its large computation complexity, which prohibits its extensions in real-time applications. To alleviate this problem, we aim at obtaining small and fast-to-execute shallow models based on model compression for visual tracking. Specifically, we propose a small feature distilled network (FDN) for tracking by imitating the intermediate representations of a much deeper network. The FDN extracts rich visual features with higher speed than the original deeper network. To further speed-up, we introduce a shift-and-stitch method to reduce the arithmetic operations, while preserving the spatial resolution of the distilled feature maps unchanged. Finally, a scale adaptive discriminative correlation filter is learned on the distilled feature for visual tracking to handle scale variation of the target. Comprehensive experimental results on object tracking benchmark datasets show that the proposed approach achieves 5× speed-up with competitive performance to the state-of-the-art deep trackers.
Multi-Task Structure-Aware Context Modeling for Robust Keypoint-Based Object Tracking

In the fields of computer vision and graphics, keypoint-based object tracking is a fundamental and challenging problem, which is typically formulated in a spatio-temporal context modeling framework. However, many existing keypoint trackers are incapable of effectively modeling and balancing the following three aspects in a simultaneous manner: temporal model coherence across frames, spatial model consistency within frames, and discriminative feature construction. To address this problem, we propose a robust keypoint tracker based on spatio-temporal multi-task structured output optimization driven by discriminative metric learning. Consequently, temporal model coherence is characterized by multi-task structured keypoint model learning over several adjacent frames; spatial model consistency is modeled by solving a geometric verification based structured learning problem; discriminative feature construction is enabled by metric learning to ensure the intra-class compactness and inter-class separability. To achieve the goal of effective object tracking, we jointly optimize the above three modules in a spatio-temporal multi-task learning scheme. Furthermore, we incorporate this joint learning scheme into both single-object and multi-object tracking scenarios, resulting in robust tracking results. Experiments over several challenging datasets have justified the effectiveness of our single-object and multi-object trackers against the state-of-the-art.
Applying Neural Networks for Tire Pressure Monitoring Systems

A proof-of-concept indirect tire-pressure monitoring system is developed using artificial neural networks to identify the tire pressure of a vehicle tire. A quarter-car model was developed with MATLAB and Simulink to generate... | Find, read and cite all the research you need on Tech Science Press
Design and evaluation of braced touch for touchscreen input stabilisation

Incorporating touchscreen interaction into cockpit flight systems offers several potential advantages to aircraft manufacturers, airlines, and pilots. However, vibration and turbulence are challenges to reliable interaction. We examine the design space for braced touch interaction, which allows users to mechanically stabilise selections by bracing multiple fingers on the touchscreen before completing selection. Our goal is to enable fast and accurate target selection during high levels of vibration, without impeding interaction performance when vibration is absent. Three variant methods of braced touch are evaluated, using doubletap, dwell, or a force threshold in combination with heuristic selection criteria to discriminate intentional selection from concurrent braced contacts. We carried out an experiment to test the performance of these methods in both abstract selection tasks and more realistic flight tasks. The study results confirm that bracing improves performance during vibration, and show that doubletap was the best of the tested methods.
On the current status of the evolutionary theory of behavior dynamics

The evolutionary theory of behavior dynamics is a complexity theory that instantiates the Darwinian principles of selection, reproduction, and mutation in a genetic algorithm. The algorithm is used to animate artificial organisms that behave continuously in time and can be placed in any experimental environment. The present paper is an update on the status of the theory. It includes a summary of the evidence supporting the theory, a list of the theory's untested predictions, and a discussion of how the algorithmic operations of the theory may correspond to material reality. Based on the evidence reviewed here, the evolutionary theory appears to be a strong candidate for a comprehensive theory of adaptive behavior.
A survey of Arabic text classification approaches

Categorisation of text is significant trend that ultimately appears owing to the internet revolution nowadays resulting in enormous amounts data that depend on various languages. The Arabic language is one of the most commonly used languages all over the world; it is considered the fifth most spoken one. Various challenges occur through processing and classifying of Arabic text since it has more sophisticated techniques than the English language. These challenges are clear owing to the Arabic language's variation in shape, structure and component; besides, there is a lack of adequate studies discussing Arabic text classification. This research seeks to form a general point of view by categorising different techniques of Arabic text classification for helping new researches concerning this domain. Also, it shows some of prior information and innovative designs about Arabic text classification. Besides, it mentions various works that have discussed classifying Arabic text, with regard to data sets, categories and pre-processes steps, classification mechanism and assessment procedure for those techniques. These discussions aim to conclude a comprehensive overview through forming a general framework for all researchers about this domain via examining the defects of the prior studies, and then the possibility of presenting more advanced directions.
Automatic discrimination of neoplastic epithelium and stromal response in breast carcinoma

In breast carcinoma, epithelial–stromal interactions play a pivotal role in tumor formation and progression, and it must be accurately assessed for a correct extraction of predictive and prognostic biomarkers. Evaluation of preoperative (baseline) neoplasia/stroma ratio and the enumeration of tumor infiltrating lymphocytes (TIL) represent only two conditions in which precise discrimination of cancer epithelium and stromal reaction are relevant. However, subjectivity and expertise of the operators may lead to different degrees of assessment. In this paper, we present a fully automated method for the discrimination between neoplastic epithelium and stromal reaction in breast carcinoma. Starting from cell nuclei, the proposed method implements computer vision strategies to split the neoplastic epithelium tissue from the stromal reaction. The algorithm is tested on 100 H&E (hematoxylin and eosin) stained images representative of 10 different cases of invasive carcinoma. The algorithm performance in the detection of neoplastic epithelium (compared to manual annotations by an expert pathologist) gave a F1SCORE of 0.8894 and mean jaccardINDEX of 0.8481. To the best of our knowledge, the proposed method is the first fully automated algorithm for the discrimination between neoplastic epithelium and stromal reaction in H&E stained images of breast tissue. The proposed approach paves the way for an automated and quantitative analysis of predictive and prognostic biomarkers in breast carcinoma.
A Simple Convolutional Neural Network with Rule Extraction

Classification responses provided by Multi Layer Perceptrons (MLPs) can be explained by means of propositional rules. So far, many rule extraction techniques have been proposed for shallow MLPs, but not for Convolutional Neural Networks (CNNs). To fill this gap, this work presents a new rule extraction method applied to a typical CNN architecture used in Sentiment Analysis (SA). We focus on the textual data on which the CNN is trained with “tweets” of movie reviews. Its architecture includes an input layer representing words by “word embeddings”, a convolutional layer, a max-pooling layer, followed by a fully connected layer. Rule extraction is performed on the fully connected layer, with the help of the Discretized Interpretable Multi Layer Perceptron (DIMLP). This transparent MLP architecture allows us to generate symbolic rules, by precisely locating axis-parallel hyperplanes. Experiments based on cross-validation emphasize that our approach is more accurate than that based on SVMs and decision trees that substitute DIMLPs. Overall, rules reach high fidelity and the discriminative n-grams represented in the antecedents explain the classifications adequately. With several test examples we illustrate the n-grams represented in the activated rules. They present the particularity to contribute to the final classification with a certain intensity.