Reviewerly/exHarmony huggingface dataset:
Block Pruning For Faster Transformers

Pre-training has improved model accuracy for both classification and generation tasks at the cost of introducing much larger and slower models. Pruning methods have proven to be an effective way of reducing model size, whereas distillation methods are proven for speeding up inference. We introduce a block pruning approach targeting both small and fast models. Our approach extends structured methods by considering blocks of any size and integrates this structure into the movement pruning paradigm for fine-tuning. We find that this approach learns to prune out full components of the underlying model, such as attention heads. Experiments consider classification and generation tasks, yielding among other results a pruned model that is a 2.4x faster, 74% smaller BERT on SQuAD v1, with a 1% drop on F1, competitive both with distilled models in speed and pruned models in size.
GeoSPARQL 1.1: Motivations, Details and Applications of the Decadal Update to the Most Important Geospatial LOD Standard

In 2012, the Open Geospatial Consortium published GeoSPARQL defining “an RDF/OWL ontology for [spatial] information”, “SPARQL extension functions” for performing spatial operations on RDF data and “RIF rules” defining entailments to be drawn from graph pattern matching. In the 8+ years since its publication, GeoSPARQL has become the most important spatial Semantic Web standard, as judged by references to it in other Semantic Web standards and its wide use for Semantic Web data. An update to GeoSPARQL was proposed in 2019 to deliver a version 1.1 with a charter to: handle outstanding change requests and source new ones from the user community and to “better present” the standard, that is to better link all the standard’s parts and better document and exemplify elements. Expected updates included new geometry representations, alignments to other ontologies, handling of new spatial referencing systems, and new artifact presentation. This paper describes motivating change requests and actual resultant updates in the candidate version 1.1 of the standard alongside reference implementations and usage examples. We also describe the theory behind particular updates, initial implementations of many parts of the standard, and our expectations for GeoSPARQL 1.1’s use.
Digital twin-driven intelligence disaster prevention and mitigation for infrastructure: advances, challenges, and opportunities

Natural hazards, which have the potential to cause catastrophic damage and loss to infrastructure, have increased significantly in recent decades. Thus, the construction demand for disaster prevention and mitigation for infrastructure (DPMI) systems is increasing. Many studies have applied intelligence technologies to solve key aspects of infrastructure, such as design, construction, disaster prevention and mitigation, and rescue and recovery; however, systematic construction is still lacking. Digital twin (DT) is one of the most promising technologies for multi-stage management which has great potential to solve the above challenges. This paper initially puts forward a scientific concept, in which DT drives the construction of intelligent disaster prevention and mitigation for infrastructure (IDPMI) systematically. To begin with, a scientific review of DT and IDPMI is performed, where the development of DT is summarized and a DT-based life cycle of infrastructures is defined. In addition, the intelligence technologies used in disaster management are key reviewed and their relative merits are illustrated. Furthermore, the development and technical feasibility of DT-driven IDPMI are illustrated by reviewing the relevant practice of DT in infrastructure. In conclusion, a scientific framework of DT-IDPMI is programmed, which not only provides some guidance for the deep integration between DT and IDPMI but also identifies the challenges that inspire the professional community to advance these techniques to address them in future research.
Social Perception of Artificial Intelligence and Digitization of Cultural Heritage: Russian Context

The article considers the social perception of artificial intelligence (AI) as an essential factor having an impact on the digitization, transfer, and popularization of cultural heritage. The article aims at the theoretical comprehension of the digital ontology and implementation of AI in the context of Russian realia. The research relies on comprehensive analysis based on statistical data, using descriptive and comparative methods. The interdisciplinary approach adopted includes reflexive analysis of both positive and negative consequences of the digitalization process. The article examines the peculiarities of the “digital ontology”, deterritorization effect, new actors in the digital process, the effect of digital trust, and opposite views of AI-enthusiasts and AI-alarmists. The article describes objective and subjective reasons for the negative perception of digital artifacts, and states the need to consider the influence of key figures in digital ontology: influencers, stakeholders, and data scientists. The ambivalence of public perception of both artificial intelligence and digital cultural heritage is stated. The research reveals digitization frontiers, which involve three factors: the axiological factor, indicating the need for consistency between a human values system and AI development programs; the subject vector, emphasizing the role of a new type of digital heritage bearers and digital influence actors; ethical factor associated with the need to transform relations with information technologies in order to subordinate them to human reflection and comprehension. The authors conclude that cultural heritage digitization should be aimed at generating a human-centered future.
Artificial Intelligence-Based Breast Cancer Diagnosis Using Ultrasound Images and Grid-Based Deep Feature Generator

Breast cancer is a prominent cancer type with high mortality. Early detection of breast cancer could serve to improve clinical outcomes. Ultrasonography is a digital imaging technique used to differentiate benign and malignant tumors. Several artificial intelligence techniques have been suggested in the literature for breast cancer detection using breast ultrasonography (BUS). Nowadays, particularly deep learning methods have been applied to biomedical images to achieve high classification performances.This work presents a new deep feature generation technique for breast cancer detection using BUS images. The widely known 16 pre-trained CNN models have been used in this framework as feature generators. In the feature generation phase, the used input image is divided into rows and columns, and these deep feature generators (pre-trained models) have applied to each row and column. Therefore, this method is called a grid-based deep feature generator. The proposed grid-based deep feature generator can calculate the error value of each deep feature generator, and then it selects the best three feature vectors as a final feature vector. In the feature selection phase, iterative neighborhood component analysis (INCA) chooses 980 features as an optimal number of features. Finally, these features are classified by using a deep neural network (DNN).The developed grid-based deep feature generation-based image classification model reached 97.18% classification accuracy on the ultrasonic images for three classes, namely malignant, benign, and normal.The findings obviously denoted that the proposed grid deep feature generator and INCA-based feature selection model successfully classified breast ultrasonic images.
An effective detection approach for phishing websites using URL and HTML features

Today's growing phishing websites pose significant threats due to their extremely undetectable risk. They anticipate internet users to mistake them as genuine ones in order to reveal user information and privacy, such as login ids, pass-words, credit card numbers, etc. without notice. This paper proposes a new approach to solve the anti-phishing problem. The new features of this approach can be represented by URL character sequence without phishing prior knowledge, various hyperlink information, and textual content of the webpage, which are combined and fed to train the XGBoost classifier. One of the major contributions of this paper is the selection of different new features, which are capable enough to detect 0-h attacks, and these features do not depend on any third-party services. In particular, we extract character level Term Frequency-Inverse Document Frequency (TF-IDF) features from noisy parts of HTML and plaintext of the given webpage. Moreover, our proposed hyperlink features determine the relationship between the content and the URL of a webpage. Due to the absence of publicly available large phishing data sets, we needed to create our own data set with 60,252 webpages to validate the proposed solution. This data contains 32,972 benign webpages and 27,280 phishing webpages. For evaluations, the performance of each category of the proposed feature set is evaluated, and various classification algorithms are employed. From the empirical results, it was observed that the proposed individual features are valuable for phishing detection. However, the integration of all the features improves the detection of phishing sites with significant accuracy. The proposed approach achieved an accuracy of 96.76% with only 1.39% false-positive rate on our dataset, and an accuracy of 98.48% with 2.09% false-positive rate on benchmark dataset, which outperforms the existing baseline approaches.
State‐of‐the‐Art in the Architecture, Methods and Applications of StyleGAN

Abstract Generative Adversarial Networks (GANs) have established themselves as a prevalent approach to image synthesis. Of these, StyleGAN offers a fascinating case study, owing to its remarkable visual quality and an ability to support a large array of downstream tasks. This state‐of‐the‐art report covers the StyleGAN architecture, and the ways it has been employed since its conception, while also analyzing its severe limitations. It aims to be of use for both newcomers, who wish to get a grasp of the field, and for more experienced readers that might benefit from seeing current research trends and existing tools laid out. Among StyleGAN's most interesting aspects is its learned latent space. Despite being learned with no supervision, it is surprisingly well‐behaved and remarkably disentangled. Combined with StyleGAN's visual quality, these properties gave rise to unparalleled editing capabilities. However, the control offered by StyleGAN is inherently limited to the generator's learned distribution, and can only be applied to images generated by StyleGAN itself. Seeking to bring StyleGAN's latent control to real‐world scenarios, the study of GAN inversion and latent space embedding has quickly gained in popularity. Meanwhile, this same study has helped shed light on the inner workings and limitations of StyleGAN. We map out StyleGAN's impressive story through these investigations, and discuss the details that have made StyleGAN the go‐to generator. We further elaborate on the visual priors StyleGAN constructs, and discuss their use in downstream discriminative tasks. Looking forward, we point out StyleGAN's limitations and speculate on current trends and promising directions for future research, such as task and target specific fine‐tuning.
Learning to Detect 3D Symmetry From Single-View RGB-D Images With Weak Supervision

3D symmetry detection is a fundamental problem in computer vision and graphics. Most prior works detect symmetry when the object model is fully known, few studies symmetry detection on objects with partial observation, such as single RGB-D images. Recent work addresses the problem of detecting symmetries from incomplete data with a deep neural network by leveraging the dense and accurate symmetry annotations. However, due to the tedious labeling process, full symmetry annotations are not always practically available. In this work, we present a 3D symmetry detection approach to detect symmetry from single-view RGB-D images without using symmetry supervision. The key idea is to train the network in a weakly-supervised learning manner to complete the shape based on the predicted symmetry such that the completed shape be similar to existing plausible shapes. To achieve this, we first propose a discriminative variational autoencoder to learn the shape prior in order to determine whether a 3D shape is plausible or not. Based on the learned shape prior, a symmetry detection network is present to predict symmetries that produce shapes with high shape plausibility when completed based on those symmetries. Moreover, to facilitate end-to-end network training and multiple symmetry detection, we introduce a new symmetry parametrization for the learning-based symmetry estimation of both reflectional and rotational symmetry. The proposed approach, coupled symmetry detection with shape completion, essentially learns the symmetry-aware shape prior, facilitating more accurate and robust symmetry detection. Experiments demonstrate that the proposed method is capable of detecting reflectional and rotational symmetries accurately, and shows good generality in challenging scenarios, such as objects with heavy occlusion and scanning noise. Moreover, it achieves state-of-the-art performance, improving the F1-score over the existing supervised learning method by 2&#x0025;-11&#x0025; on the ShapeNet and ScanNet datasets.
A heuristic whale optimization algorithm with niching strategy for global multi-dimensional engineering optimization

• A niching strategy hybrid heuristic whale optimization algorithm (NHWOA). • The NHWOA for global multi-dimensional engineering optimization. • Algorithm design with good exploration capability as well as fast convergence. • Better performance of the NHWOA compared with other state-of-the-art algorithms. • Validation for the NHWOA by benchmark functions and practical engineering problems. Whale optimization algorithm (WOA) has received increasing attention in engineering optimization owing to its high computation efficiency, whereas, it has exhibited the drawback of premature convergence in solving multi-dimensional engineering global optimization problems. In this research, a niching hybrid heuristic whale optimization algorithm (NHWOA) is proposed to enhance convergence speed and search coverage in solving global optimization problems. In the algorithm, the niching technique is introduced to promote the diversity of population and restrain premature convergence in search of a global best solution. A heuristic adjustment to the parameters of the hybrid WOA algorithm is made to promote the exploration potential of search agents in the evolution. A designed perturbation to all the search agents’ positions is executed to avoid their falling into a local optimum. Optimization to the CEC2014 benchmark functions as validation cases are conducted along with comparisons to both conventional intelligent optimization algorithms and other state-of-the-art modified WOAs. Results indicate the effectiveness and superiority of NHWOA in solving the problems. Five practical engineering problems for global optimization with multiply variables are introduced to validate the performance of the presented algorithm with good performance results in the global computations.
Type4Py

Dynamic languages, such as Python and Javascript, trade static typing for developer flexibility and productivity. Lack of static typing can cause run-time exceptions and is a major factor for weak IDE support. To alleviate these issues, PEP 484 introduced optional type annotations for Python. As retrofitting types to existing codebases is error-prone and laborious, machine learning (ML)-based approaches have been proposed to enable automatic type inference based on existing, partially annotated codebases. However, previous ML-based approaches are trained and evaluated on human-provided type annotations, which might not always be sound, and hence this may limit the practicality for real-world usage. In this paper, we present Type4Py, a deep similarity learning-based hierarchical neural network model. It learns to discriminate between similar and dissimilar types in a high-dimensional space, which results in clusters of types. Likely types for arguments, variables, and return values can then be inferred through the nearest neighbor search. Unlike previous work, we trained and evaluated our model on a type-checked dataset and used mean reciprocal rank (MRR) to reflect the performance perceived by users. The obtained results show that Type4Py achieves an MRR of 77.1%, which is a substantial improvement of 8.1% and 16.7% over the state-of-the-art approaches Typilus and TypeWriter, respectively. Finally, to aid developers with retrofitting types, we released a Visual Studio Code extension, which uses Type4Py to provide ML-based type auto-completion for Python.
Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment

Cloud computing is one of the most commonly used infrastructures for carrying out activities using virtual machines known as processing units. One of the most fundamental issues with cloud computing is task scheduling. The optimal determination of scheduling criteria in cloud computing is a non-deterministic polynomial-time (NP)-complete optimization problem, and several procedures to manage this problem have been suggested by researchers in the past. Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. Literature shows that HEFT gives extraordinary results in terms of quality of schedule and execution time. However, in some cases, the average computation cost and selection of the first idle slot may not produce a good solution. Therefore, here we propose modified versions of the HEFT algorithm that can obtain improved results. In the rank generation phase, we implement different methodologies for calculating ranks, while in the processor selection phase, we modify the way of selecting idle slots for scheduling the tasks. This paper suggests enhanced versions of the HEFT algorithm under user-required financial constraints to minimize the makespan of a specified workflow submission on virtual machines. Our findings also suggest that enhanced versions of the HEFT algorithm perform better than the basic HEFT method in terms of lesser schedule length of the workflow problems running on various virtual machines.
A new human-inspired metaheuristic algorithm for solving optimization problems based on mimicking sewing training

This paper introduces a new human-based metaheuristic algorithm called Sewing Training-Based Optimization (STBO), which has applications in handling optimization tasks. The fundamental inspiration of STBO is teaching the process of sewing to beginner tailors. The theory of the proposed STBO approach is described and then mathematically modeled in three phases: (i) training, (ii) imitation of the instructor's skills, and (iii) practice. STBO performance is evaluated on fifty-two benchmark functions consisting of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. The optimization results show that STBO, with its high power of exploration and exploitation, has provided suitable solutions for benchmark functions. The performance of STBO is compared with eleven well-known metaheuristic algorithms. The simulation results show that STBO, with its high ability to balance exploration and exploitation, has provided far more competitive performance in solving benchmark functions than competitor algorithms. Finally, the implementation of STBO in solving four engineering design problems demonstrates the capability of the proposed STBO in dealing with real-world applications.
Artificial Intelligence in Cancer Research: Trends, Challenges and Future Directions

The World Health Organization (WHO), in their 2022 report, identified cancer as one of the leading causes of death, accounting for about 16% of deaths worldwide. The Cancer-Moonshot community aims to reduce the cancer death rate by half in the next 25 years and wants to improve the lives of cancer-affected people. Cancer mortality can be reduced if detected early and treated appropriately. Cancers like breast cancer and cervical cancer have high cure probabilities when treated early in accordance with best practices. Integration of artificial intelligence (AI) into cancer research is currently addressing many of the challenges where medical experts fail to bring cancer to control and cure, and the outcomes are quite encouraging. AI offers many tools and platforms to facilitate more understanding and tackling of this life-threatening disease. AI-based systems can help pathologists in diagnosing cancer more accurately and consistently, reducing the case error rates. Predictive-AI models can estimate the likelihood for a person to get cancer by identifying the risk factors. Big data, together with AI, can enable medical experts to develop customized treatments for cancer patients. The side effects from this kind of customized therapy will be less severe in comparison with the generalized therapies. However, many of these AI tools will remain ineffective in fighting against cancer and saving the lives of millions of patients unless they are accessible and understandable to biologists, oncologists, and other medical cancer researchers. This paper presents the trends, challenges, and future directions of AI in cancer research. We hope that this paper will be of help to both medical experts and technical experts in getting a better understanding of the challenges and research opportunities in cancer diagnosis and treatment.
A semantic and emotion‐based dual latent variable generation model for a dialogue system

Abstract With the development of intelligent agents pursuing humanisation, artificial intelligence must consider emotion, the most basic spiritual need in human interaction. Traditional emotional dialogue systems usually use an external emotional dictionary to select appropriate emotional words to add to the response or concatenate emotional tags and semantic features in the decoding step to generate appropriate responses. However, selecting emotional words from a fixed emotional dictionary may result in loss of the diversity and consistency of the response. We propose a semantic and emotion‐based dual latent variable generation model (Dual‐LVG) for dialogue systems, which is able to generate appropriate emotional responses without an emotional dictionary. Different from previous work, the conditional variational autoencoder (CVAE) adopts the standard transformer structure. Then, Dual‐LVG regularises the CVAE latent space by introducing a dual latent space of semantics and emotion. The content diversity and emotional accuracy of the generated responses are improved by learning emotion and semantic features respectively. Moreover, the average attention mechanism is adopted to better extract semantic features at the sequence level, and the semi‐supervised attention mechanism is used in the decoding step to strengthen the fusion of emotional features of the model. Experimental results show that Dual‐LVG can successfully achieve the effect of generating different content by controlling emotional factors.