OpenRaiser/Intern-Atlas huggingface dataset:
Do bibliometrics introduce gender, institutional or interdisciplinary biases into research evaluations?
Venue: arXiv cs.DL 2022
Year: 2022

Systematic evaluations of publicly funded research typically employ a combination of bibliometrics and peer review, but it is not known whether the bibliometric component introduces biases. This article compares three alternative mechanisms for scoring 73,612 UK Research Excellence Framework (REF) journal articles from all 34 field-based Units of Assessment (UoAs) 2014-17: peer review, field normalised citations, and journal average field normalised citation impact. All three were standardised into a four-point scale. The results suggest that in almost all academic fields, bibliometric scoring can disadvantage departments publishing high quality research, with the main exception of article citation rates in chemistry. Thus, introducing journal or article level citation information into peer review exercises may have a regression to the mean effect. Bibliometric scoring slightly advantaged women compared to men, but this varied between UoAs and was most evident in the physical sciences, engineering, and social sciences. In contrast, interdisciplinary research gained from bibliometric scoring in about half of the UoAs, but relatively substantially in two. In conclusion, out of the three potential source of bias examined, the most serious seems to be the tendency for bibliometric scores to work against high quality departments, assuming that the peer review scores are correct. This is almost a paradox: although high quality departments tend to get the highest bibliometric scores, bibliometrics conceal the full extent of departmental quality advantages. This should be considered when using bibliometrics or bibliometric informed peer review.
Impact in informetrics and beyond
Venue: arXiv cs.DL 2022
Year: 2022

The concept of impact is one of the most important concepts in informetrics. It is here studied mathematically. We first fix a topic for which we want to find influential objects such as authors or journals, and their production, such as publications generating citations. These objects are then said to have a certain degree of impact. We work on three levels. On the first level, we need a measure for these objects, represented by their rank-frequency function, describing the number of items per source (ranked in decreasing order of the number of items): an impact measure. These measures focus on the production of the most productive sources. The h-index is one example. In paper II we study a formal definition of impact measures based on these left-hand sides of the source-item rank-frequency functions representing these objects. The second level of impact investigation is using impact bundles (or sheaves) as in paper III. As an illustration, we mention that the h-index of a function Z is defined as x for which Z(x) = x, i.e., the abscissa of the intersection of the graph of Z with the line y = x. The h-bundle is defined in the same way but now the line y = x is replaced by an increasing line through the origin: y = $θ$.x, $θ$ > 0. So, we have a bundle of impact measures which is more powerful to measure the impact of an object Z. Impact bundles are characterized in paper III. A third level of impact investigations involves the non-normalized form of the Lorenz curve. In papers IV and V we study global impact measures as measures that respect the non-normalized Lorenz order between the rank-frequency functions representing objects Z. We say that object Z has more impact than object Y if Y is smaller than Z in the sense of the non-normalized Lorenz order. This is the highest level of impact treatment: a mathematical definition of the concept itself.
Multi-Level Association Rule Mining for Wireless Network Time Series Data
Venue: arXiv cs.NI 2022
Year: 2022

Key performance indicators(KPIs) are of great significance in the monitoring of wireless network service quality. The network service quality can be improved by adjusting relevant configuration parameters(CPs) of the base station. However, there are numerous CPs and different cells may affect each other, which bring great challenges to the association analysis of wireless network data. In this paper, we propose an adjustable multi-level association rule mining framework, which can quantitatively mine association rules at each level with environmental information, including engineering parameters and performance management(PMs), and it has interpretability at each level. Specifically, We first cluster similar cells, then quantify KPIs and CPs, and integrate expert knowledge into the association rule mining model, which improve the robustness of the model. The experimental results in real world dataset prove the effectiveness of our method.
Integrated Sensing and Communication System via Dual-Domain Waveform Superposition
Venue: arXiv cs.IT 2022
Year: 2022

Integrated Sensing and Communication (ISAC) systems are recognised as one of the key ingredients of the sixth generation (6G) network. A challenging topic in ISAC is the design of a single waveform combining both communication and sensing functionalities on the same time-frequency-space resources, allowing to tune the performance of both with partial or full hardware sharing. This paper proposes a dual-domain waveform design approach that superposes onto the frequency-time (FT) domain both the legacy orthogonal frequency division multiplexing (OFDM) signal and a sensing one, purposely designed in the delay-Doppler domain. With a proper power downscaling of the sensing signal w.r.t. OFDM, it is possible to exceed regulatory bandwidth limitations proper of legacy multicarrier systems to increase the sensing performance while leaving communication substantially unaffected. Numerical and experimental results prove the effectiveness of the dual-domain waveform, notwithstanding a power abatement of at least 30 dB of the signal used for sensing compared to the one used for communication. The dual-domain ISAC waveform outperforms both OFDM and orthogonal time-frequency-space (OTFS) in terms of Cramér-Rao bound on delay estimation (up to 20 dB), thanks to its superior resolution, with a negligible penalty on the achievable rate.
Impact of State and State Sponsored Actors on the Cyber Environment and the Future of Critical Infrastructure
Venue: arXiv cs.CY 2022
Year: 2022

The purpose of this research paper is to critically explore the impact of state and state-sponsored actors on the cyber environment and the future of critical infrastructure, the majority of these attacks on the cyber environment have focused more on the vulnerability of critical infrastructures, this can be evidenced in the cyber-attack by Russia on December 23rd, 2015 that caused power outages experienced by the Ukrainian power companies which affected many customers in Ukraine [8]. Considering the enormous resources available to state and state-sponsored actors it has become difficult to detect cyber-attacks, even when the attack is discovered, proving that it was carried out by a particular state is not easy as such it is now being commonly exploited by malicious states. The paper examines the effect of the actions of the state and state-sponsored attacks on the cyber environment and critical infrastructures, these adverse effects include; greatly diminished defense capacity of the attacked states, destabilise the micro-economy, disinformation that can effectively sway public opinion in a state [1]. Consequently, being aware of the number of resources available at the disposal of the actors and the enormous negative impacts on the cyber environment and critical infrastructures, the government, agencies, and other professionals will be prepared to protect and prioritise network and security systems as a national issue thus encouraging public-private collaboration.
Can REF output quality scores be assigned by AI? Experimental evidence
Venue: arXiv cs.CY 2022
Year: 2022

This document describes strategies for using Artificial Intelligence (AI) to predict some journal article scores in future research assessment exercises. Five strategies have been assessed.
Silhouette: Toward Performance-Conscious and Transferable CPU Embeddings
Venue: arXiv cs.LG 2022
Year: 2022

Learned embeddings are widely used to obtain concise data representation and enable transfer learning between different data sets and tasks. In this paper, we present Silhouette, our approach that leverages publicly-available performance data sets to learn CPU embeddings. We show how these embeddings enable transfer learning between data sets of different types and sizes. Each of these scenarios leads to an improvement in accuracy for the target data set.
The Role of AI in Drug Discovery: Challenges, Opportunities, and Strategies
Venue: arXiv cs.CL 2022
Year: 2022

Artificial intelligence (AI) has the potential to revolutionize the drug discovery process, offering improved efficiency, accuracy, and speed. However, the successful application of AI is dependent on the availability of high-quality data, the addressing of ethical concerns, and the recognition of the limitations of AI-based approaches. In this article, the benefits, challenges and drawbacks of AI in this field are reviewed, and possible strategies and approaches for overcoming the present obstacles are proposed. The use of data augmentation, explainable AI, and the integration of AI with traditional experimental methods, as well as the potential advantages of AI in pharmaceutical research are also discussed. Overall, this review highlights the potential of AI in drug discovery and provides insights into the challenges and opportunities for realizing its potential in this field. Note from the human-authors: This article was created to test the ability of ChatGPT, a chatbot based on the GPT-3.5 language model, to assist human authors in writing review articles. The text generated by the AI following our instructions (see Supporting Information) was used as a starting point, and its ability to automatically generate content was evaluated. After conducting a thorough review, human authors practically rewrote the manuscript, striving to maintain a balance between the original proposal and scientific criteria. The advantages and limitations of using AI for this purpose are discussed in the last section.
Backdoor Attack Detection in Computer Vision by Applying Matrix Factorization on the Weights of Deep Networks
Venue: arXiv cs.CV 2022
Year: 2022

The increasing importance of both deep neural networks (DNNs) and cloud services for training them means that bad actors have more incentive and opportunity to insert backdoors to alter the behavior of trained models. In this paper, we introduce a novel method for backdoor detection that extracts features from pre-trained DNN's weights using independent vector analysis (IVA) followed by a machine learning classifier. In comparison to other detection techniques, this has a number of benefits, such as not requiring any training data, being applicable across domains, operating with a wide range of network architectures, not assuming the nature of the triggers used to change network behavior, and being highly scalable. We discuss the detection pipeline, and then demonstrate the results on two computer vision datasets regarding image classification and object detection. Our method outperforms the competing algorithms in terms of efficiency and is more accurate, helping to ensure the safe application of deep learning and AI.
Epistemological Equation for Analysing Uncontrollable States in Complex Systems: Quantifying Cyber Risks from the Internet of Things
Venue: arXiv cs.CY 2022
Year: 2022

To enable quantitative risk assessment of uncontrollable risk states in complex and coupled IoT systems, a new epistemological equation is designed and tested though comparative and empirical analysis. The comparative analysis is conducted on national digital strategies, followed by an empirical analysis of cyber risk assessment approaches. The new epistemological analysis approach enables the assessment of uncontrollable risk states in complex IoT systems, which begin to resemble artificial intelligence, and can be used for a quantitative self-assessment of IoT cyber risk posture.
Approximate counting using Taylor's theorem: a survey
Venue: arXiv cs.DS 2022
Year: 2022

In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the independence polynomial and proper colourings in the case of the chromatic polynomial. They also have interpretations as partition functions in statistical physics. The algorithmic problem of (approximately) computing these types of polynomials has been studied for close to 50 years, especially using Markov chain techniques. Around eight years ago, Barvinok devised a new algorithmic approach based on Taylor's theorem for computing the permanent of certain matrices, and the approach has been applied to various graph polynomials since then. This article is intended as a gentle introduction to the approach as well as a partial survey of associated techniques and results.
Learning Sparsity and Randomness for Data-driven Low Rank Approximation
Venue: arXiv cs.LG 2022
Year: 2022

Learning-based low rank approximation algorithms can significantly improve the performance of randomized low rank approximation with sketch matrix. With the learned value and fixed non-zero positions for sketch matrices from learning-based algorithms, these matrices can reduce the test error of low rank approximation significantly. However, there is still no good method to learn non-zero positions as well as overcome the out-of-distribution performance loss. In this work, we introduce two new methods Learning Sparsity and Learning Randomness which try to learn a better sparsity patterns and add randomness to the value of sketch matrix. These two methods can be applied with any learning-based algorithms which use sketch matrix directly. Our experiments show that these two methods can improve the performance of previous learning-based algorithm for both test error and out-of-distribution test error without adding too much complexity.
A unified information-theoretic model of EEG signatures of human language processing
Venue: arXiv cs.CL 2022
Year: 2022

We advance an information-theoretic model of human language processing in the brain, in which incoming linguistic input is processed at two levels, in terms of a heuristic interpretation and in terms of error correction. We propose that these two kinds of information processing have distinct electroencephalographic signatures, corresponding to the well-documented N400 and P600 components of language-related event-related potentials (ERPs). Formally, we show that the information content (surprisal) of a word in context can be decomposed into two quantities: (A) heuristic surprise, which signals processing difficulty of word given its inferred context, and corresponds with the N400 signal; and (B) discrepancy signal, which reflects divergence between the true context and the inferred context, and corresponds to the P600 signal. Both of these quantities can be estimated using modern NLP techniques. We validate our theory by successfully simulating ERP patterns elicited by a variety of linguistic manipulations in previously-reported experimental data from Ryskin et al. (2021). Our theory is in principle compatible with traditional cognitive theories assuming a `good-enough' heuristic interpretation stage, but with precise information-theoretic formulation.
Improving self-supervised representation learning via sequential adversarial masking
Venue: arXiv cs.CV 2022
Year: 2022

Recent methods in self-supervised learning have demonstrated that masking-based pretext tasks extend beyond NLP, serving as useful pretraining objectives in computer vision. However, existing approaches apply random or ad hoc masking strategies that limit the difficulty of the reconstruction task and, consequently, the strength of the learnt representations. We improve upon current state-of-the-art work in learning adversarial masks by proposing a new framework that generates masks in a sequential fashion with different constraints on the adversary. This leads to improvements in performance on various downstream tasks, such as classification on ImageNet100, STL10, and CIFAR10/100 and segmentation on Pascal VOC. Our results further demonstrate the promising capabilities of masking-based approaches for SSL in computer vision.
Learning on Persistence Diagrams as Radon Measures
Venue: arXiv cs.CG 2022
Year: 2022

Persistence diagrams are common descriptors of the topological structure of data appearing in various classification and regression tasks. They can be generalized to Radon measures supported on the birth-death plane and endowed with an optimal transport distance. Examples of such measures are expectations of probability distributions on the space of persistence diagrams. In this paper, we develop methods for approximating continuous functions on the space of Radon measures supported on the birth-death plane, as well as their utilization in supervised learning tasks. Indeed, we show that any continuous function defined on a compact subset of the space of such measures (e.g., a classifier or regressor) can be approximated arbitrarily well by polynomial combinations of features computed using a continuous compactly supported function on the birth-death plane (a template). We provide insights into the structure of relatively compact subsets of the space of Radon measures, and test our approximation methodology on various data sets and supervised learning tasks.
Safe Evaluation For Offline Learning: Are We Ready To Deploy?
Venue: arXiv cs.LG 2022
Year: 2022

The world currently offers an abundance of data in multiple domains, from which we can learn reinforcement learning (RL) policies without further interaction with the environment. RL agents learning offline from such data is possible but deploying them while learning might be dangerous in domains where safety is critical. Therefore, it is essential to find a way to estimate how a newly-learned agent will perform if deployed in the target environment before actually deploying it and without the risk of overestimating its true performance. To achieve this, we introduce a framework for safe evaluation of offline learning using approximate high-confidence off-policy evaluation (HCOPE) to estimate the performance of offline policies during learning. In our setting, we assume a source of data, which we split into a train-set, to learn an offline policy, and a test-set, to estimate a lower-bound on the offline policy using off-policy evaluation with bootstrapping. A lower-bound estimate tells us how good a newly-learned target policy would perform before it is deployed in the real environment, and therefore allows us to decide when to deploy our learned policy.
Neural Enhanced Belief Propagation for Multiobject Tracking
Venue: arXiv cs.CV 2022
Year: 2022

Algorithmic solutions for multi-object tracking (MOT) are a key enabler for applications in autonomous navigation and applied ocean sciences. State-of-the-art MOT methods fully rely on a statistical model and typically use preprocessed sensor data as measurements. In particular, measurements are produced by a detector that extracts potential object locations from the raw sensor data collected for a discrete time step. This preparatory processing step reduces data flow and computational complexity but may result in a loss of information. State-of-the-art Bayesian MOT methods that are based on belief propagation (BP) systematically exploit graph structures of the statistical model to reduce computational complexity and improve scalability. However, as a fully model-based approach, BP can only provide suboptimal estimates when there is a mismatch between the statistical model and the true data-generating process. Existing BP-based MOT methods can further only make use of preprocessed measurements. In this paper, we introduce a variant of BP that combines model-based with data-driven MOT. The proposed neural enhanced belief propagation (NEBP) method complements the statistical model of BP by information learned from raw sensor data. This approach conjectures that the learned information can reduce model mismatch and thus improve data association and false alarm rejection. Our NEBP method improves tracking performance compared to model-based methods. At the same time, it inherits the advantages of BP-based MOT, i.e., it scales only quadratically in the number of objects, and it can thus generate and maintain a large number of object tracks. We evaluate the performance of our NEBP approach for MOT on the nuScenes autonomous driving dataset and demonstrate that it has state-of-the-art performance.
Traffic sign detection and recognition using event camera image reconstruction
Venue: arXiv cs.CV 2022
Year: 2022

This paper presents a method for detection and recognition of traffic signs based on information extracted from an event camera. The solution used a FireNet deep convolutional neural network to reconstruct events into greyscale frames. Two YOLOv4 network models were trained, one based on greyscale images and the other on colour images. The best result was achieved for the model trained on the basis of greyscale images, achieving an efficiency of 87.03%.
Utilizing distilBert transformer model for sentiment classification of COVID-19's Persian open-text responses
Venue: arXiv cs.CL 2022
Year: 2022

The COVID-19 pandemic has caused drastic alternations in human life in all aspects. The government's laws in this regard affected the lifestyle of all people. Due to this fact studying the sentiment of individuals is essential to be aware of the future impacts of the coming pandemics. To contribute to this aim, we proposed an NLP (Natural Language Processing) model to analyze open-text answers in a survey in Persian and detect positive and negative feelings of the people in Iran. In this study, a distilBert transformer model was applied to take on this task. We deployed three approaches to perform the comparison, and our best model could gain accuracy: 0.824, Precision: 0.824, Recall: 0.798, and F1 score: 0.804.
Context Label Learning: Improving Background Class Representations in Semantic Segmentation
Venue: arXiv cs.CV 2022
Year: 2022

Background samples provide key contextual information for segmenting regions of interest (ROIs). However, they always cover a diverse set of structures, causing difficulties for the segmentation model to learn good decision boundaries with high sensitivity and precision. The issue concerns the highly heterogeneous nature of the background class, resulting in multi-modal distributions. Empirically, we find that neural networks trained with heterogeneous background struggle to map the corresponding contextual samples to compact clusters in feature space. As a result, the distribution over background logit activations may shift across the decision boundary, leading to systematic over-segmentation across different datasets and tasks. In this study, we propose context label learning (CoLab) to improve the context representations by decomposing the background class into several subclasses. Specifically, we train an auxiliary network as a task generator, along with the primary segmentation model, to automatically generate context labels that positively affect the ROI segmentation accuracy. Extensive experiments are conducted on several challenging segmentation tasks and datasets. The results demonstrate that CoLab can guide the segmentation model to map the logits of background samples away from the decision boundary, resulting in significantly improved segmentation accuracy. Code is available.