Governments, investors and business leaders need to adopt practical solutions that can be deployed across the world at scale. The arrival of 5G along with wider adoption of AI technology into the physical world will make it possible to substantially enhance the opportunities to scale cleaner energy generation technologies, enable efficiency gains in manufacturing, our homes, retail stores, offices and transportation that will enable substantial reductions in pollution. Policies that incentivise the accelerated development and deployment of Industry 4.0 solutions will require politicians and regulators to better understand the opportunities that 5G alongside AI will enable. The OECD published a paper "What works in Innovation Policy" and observed that "Policies ignoring or resisting the industrial transition have proven to be not just futile but result in an innovative disadvantage and weak economic performance." Entering the new year will allow us to develop and deploy solutions for the 2020s that make use of the next industrial revolution with 5G and AI to enable dramatic efficiency gains across all sectors of the economy and to enhance renewable energy generation. The emergence of India, China and others as industrial economic powers is occurring at a time when we now know the damage that such pollution causes and hence there is a need to work together, collaboratively to solve a global problem. Embracing technological change and enhancing its capabilities to deliver better living standards alongside sustainable development is the best option for those who really want to make an impact on climate change at scale in the 2020s and beyond. I wish to thank Henry Derwent, former advisor to Prime Minister Margaret Thatcher and former CEO of IETA for his efforts to promote technological innovation and scaled up financing with Green Bonds.

Malicious URL detection is an emerging research area due to continuous modernization of various systems, for instance, Edge Computing. In this article, we present a novel malicious URL detection technique, called deepBF (deep learning and Bloom Filter). deepBF is presented in two-fold. Firstly, we propose a learned Bloom Filter using 2-dimensional Bloom Filter. We experimentally decide the best non-cryptography string hash function. Then, we derive a modified non-cryptography string hash function from the selected hash function for deepBF by introducing biases in the hashing method and compared among the string hash functions. The modified string hash function is compared to other variants of diverse non-cryptography string hash functions. It is also compared with various filters, particularly, counting Bloom Filter, Kirsch \textit{et al.}, and Cuckoo Filter using various use cases. The use cases unearth weakness and strength of the filters. Secondly, we propose a malicious URL detection mechanism using deepBF. We apply the evolutionary convolutional neural network to identify the malicious URLs. The evolutionary convolutional neural network is trained and tested with malicious URL datasets. The output is tested in deepBF for accuracy. We have achieved many conclusions from our experimental evaluation and results and are able to reach various conclusive decisions which are presented in the article.

Nowadays online users prefer to join multiple social media for the purpose of socialized online service. The problem \textit{anchor link prediction} is formalized to link user data with the common ground on user profile, content and network structure across social networks. Most of the traditional works concentrated on learning matching function with explicit or implicit features on observed user data. However, the low quality of observed user data confuses the judgment on anchor links, resulting in the matching collision problem in practice. In this paper, we explore local structure consistency and then construct a matching graph in order to circumvent matching collisions. Furthermore, we propose graph convolution networks with mini-batch strategy, efficiently solving anchor link prediction on matching graph. The experimental results on three real application scenarios show the great potentials of our proposed method in both prediction accuracy and efficiency. In addition, the visualization of learned embeddings provides us a qualitative way to understand the inference of anchor links on the matching graph.

Direct decoding for task-oriented dialogue is known to suffer from the explaining-away effect, manifested in models that prefer short and generic responses. Here we argue for the use of Bayes' theorem to factorize the dialogue task into two models, the distribution of the context given the response, and the prior for the response itself. This approach, an instantiation of the noisy channel model, both mitigates the explaining-away effect and allows the principled incorporation of large pretrained models for the response prior. We present extensive experiments showing that a noisy channel model decodes better responses compared to direct decoding and that a two stage pretraining strategy, employing both open-domain and task-oriented dialogue data, improves over randomly initialized models.

The easiest way to fool artificial intelligence Feedback is our weekly column of bizarre stories, implausible advertising claims, confusing instructions and more 10 March 2021 Josie Ford This is not an apple Another week, another artificial intelligence going decidedly off-piste. We recently mentioned the autonomous video-interviewing system that appeared to be grading candidates on the strength of the bookcase behind them (27 February). Now a paper published on the website of the company OpenAI reveals how CLIP, a neural network system that learns to recognise visual concepts through being fed verbal descriptions of them, can be spoofed simply by overlaying an image with text declaring it to be something else. Stick a sticker on an apple declaring it to be a different apple product, an iPod, and the AI says it is an iPod 99.7 per cent of the time. Plaster dollar signs on a picture of anything, from a poodle to a chainsaw to a horse chestnut, and, with a charmingly artless naivety, CLIP mostly returns the answer "piggy bank".

Researchers at UniSA have developed a cost-effective new technique to monitor soil moisture using a standard digital camera and machine learning technology. The United Nations predicts that by 2050 many areas of the planet may not have enough fresh water to meet the demands of agriculture if we continue our current patterns of use. One solution to this global dilemma is the development of more efficient irrigation, central to which is precision monitoring of soil moisture, allowing sensors to guide'smart' irrigation systems to ensure water is applied at the optimum time and rate. Current methods for sensing soil moisture are problematic – buried sensors are susceptible to salts in the substrate and require specialised hardware for connections, while thermal imaging cameras are expensive and can be compromised by climatic conditions such as sunlight intensity, fog, and clouds. Researchers from The University of South Australia and Baghdad's Middle Technical University have developed a cost-effective alternative that may make precision soil monitoring simple and affordable in almost any circumstance.

Real-world decision-making tasks are generally complex, requiring trade-offs between multiple, often conflicting, objectives. Despite this, the majority of research in reinforcement learning and decision-theoretic planning either assumes only a single objective, or that multiple objectives can be adequately handled via a simple linear combination. Such approaches may oversimplify the underlying problem and hence produce suboptimal results. This paper serves as a guide to the application of multi-objective methods to difficult problems, and is aimed at researchers who are already familiar with single-objective reinforcement learning and planning methods who wish to adopt a multi-objective perspective on their research, as well as practitioners who encounter multi-objective decision problems in practice. It identifies the factors that may influence the nature of the desired solution, and illustrates by example how these influence the design of multi-objective decision-making systems for complex problems.

A new ensemble framework for interpretable model called Linear Iterative Feature Embedding (LIFE) has been developed to achieve high prediction accuracy, easy interpretation and efficient computation simultaneously. The LIFE algorithm is able to fit a wide single-hidden-layer neural network (NN) accurately with three steps: defining the subsets of a dataset by the linear projections of neural nodes, creating the features from multiple narrow single-hidden-layer NNs trained on the different subsets of the data, combining the features with a linear model. The theoretical rationale behind LIFE is also provided by the connection to the loss ambiguity decomposition of stack ensemble methods. Both simulation and empirical experiments confirm that LIFE consistently outperforms directly trained single-hidden-layer NNs and also outperforms many other benchmark models, including multi-layers Feed Forward Neural Network (FFNN), Xgboost, and Random Forest (RF) in many experiments. As a wide single-hidden-layer NN, LIFE is intrinsically interpretable. Meanwhile, both variable importance and global main and interaction effects can be easily created and visualized. In addition, the parallel nature of the base learner building makes LIFE computationally efficient by leveraging parallel computing.

Recent works in Generative Adversarial Networks (GANs) are actively revisiting various data augmentation techniques as an effective way to prevent discriminator overfitting. It is still unclear, however, that which augmentations could actually improve GANs, and in particular, how to apply a wider range of augmentations in training. In this paper, we propose a novel way to address these questions by incorporating a recent contrastive representation learning scheme into the GAN discriminator, coined ContraD. This "fusion" enables the discriminators to work with much stronger augmentations without increasing their training instability, thereby preventing the discriminator overfitting issue in GANs more effectively. Even better, we observe that the contrastive learning itself also benefits from our GAN training, i.e., by maintaining discriminative features between real and fake samples, suggesting a strong coherence between the two worlds: good contrastive representations are also good for GAN discriminators, and vice versa. Our experimental results show that GANs with ContraD consistently improve FID and IS compared to other recent techniques incorporating data augmentations, still maintaining highly discriminative features in the discriminator in terms of the linear evaluation. Finally, as a byproduct, we also show that our GANs trained in an unsupervised manner (without labels) can induce many conditional generative models via a simple latent sampling, leveraging the learned features of ContraD. Generative adversarial networks (GANs) (Goodfellow et al., 2014) have become one of the most prominent approaches for generative modeling with a wide range of applications (Ho & Ermon, 2016; Zhu et al., 2017; Karras et al., 2019; Rott Shaham et al., 2019). In general, a GAN is defined by a minimax game between two neural networks: a generator network that maps a random vector into the data domain, and a discriminator network that classifies whether a given sample is real (from the training dataset) or fake (from the generator).

This paper proposes a new distance metric function, called Z distance, for KNN classification. The Z distance function is not a geometric direct-line distance between two data points. It gives a consideration to the class attribute of a training dataset when measuring the affinity between data points. Concretely speaking, the Z distance of two data points includes their class center distance and real distance. And its shape looks like "Z". In this way, the affinity of two data points in the same class is always stronger than that in different classes. Or, the intraclass data points are always closer than those interclass data points. We evaluated the Z distance with experiments, and demonstrated that the proposed distance function achieved better performance in KNN classification.