Here on Earth, we have more detailed maps of Mars than of our own ocean, and that's a problem. A massive force for surviving climate change, the ocean absorbs 90% of the heat caused by emissions and generates 50% of the oxygen we breathe. "We have the ocean to thank for so many aspects of our safety and well-being," says Dawn Wright, oceanographer and chief scientist at geographic information system (GIS) provider Esri, who notes the ocean also provides renewable energy, a major food source, and a transportation corridor for not only ships but submarine internet cables. Now, the same type of smart maps and geospatial technology guiding outer space exploration support the quest to better understand and protect our ocean. "For the first time, our knowledge of the ocean can approach our knowledge of the land," Wright says.

The problem of code generation from textual program descriptions has long been viewed as a grand challenge in software engineering. In recent years, many deep learning based approaches have been proposed, which can generate a sequence of code from a sequence of textual program description. However, the existing approaches ignore the global relationships among API methods, which are important for understanding the usage of APIs. In this paper, we propose to model the dependencies among API methods as an API dependency graph (ADG) and incorporate the graph embedding into a sequence-to-sequence (Seq2Seq) model. In addition to the existing encoder-decoder structure, a new module named ``embedder" is introduced. In this way, the decoder can utilize both global structural dependencies and textual program description to predict the target code. We conduct extensive code generation experiments on three public datasets and in two programming languages (Python and Java). Our proposed approach, called ADG-Seq2Seq, yields significant improvements over existing state-of-the-art methods and maintains its performance as the length of the target code increases. Extensive ablation tests show that the proposed ADG embedding is effective and outperforms the baselines.

This paper presents a production Semi-Supervised Learning (SSL) pipeline based on the student-teacher framework, which leverages millions of unlabeled examples to improve Natural Language Understanding (NLU) tasks. We investigate two questions related to the use of unlabeled data in production SSL context: 1) how to select samples from a huge unlabeled data pool that are beneficial for SSL training, and 2) how do the selected data affect the performance of different state-of-the-art SSL techniques. We compare four widely used SSL techniques, Pseudo-Label (PL), Knowledge Distillation (KD), Virtual Adversarial Training (VAT) and Cross-View Training (CVT) in conjunction with two data selection methods including committee-based selection and submodular optimization based selection. We further examine the benefits and drawbacks of these techniques when applied to intent classification (IC) and named entity recognition (NER) tasks, and provide guidelines specifying when each of these methods might be beneficial to improve large scale NLU systems.

Seeking the equivalent entities among multi-source Knowledge Graphs (KGs) is the pivotal step to KGs integration, also known as \emph{entity alignment} (EA). However, most existing EA methods are inefficient and poor in scalability. A recent summary points out that some of them even require several days to deal with a dataset containing 200,000 nodes (DWY100K). We believe over-complex graph encoder and inefficient negative sampling strategy are the two main reasons. In this paper, we propose a novel KG encoder -- Dual Attention Matching Network (Dual-AMN), which not only models both intra-graph and cross-graph information smartly, but also greatly reduces computational complexity. Furthermore, we propose the Normalized Hard Sample Mining Loss to smoothly select hard negative samples with reduced loss shift. The experimental results on widely used public datasets indicate that our method achieves both high accuracy and high efficiency. On DWY100K, the whole running process of our method could be finished in 1,100 seconds, at least 10* faster than previous work. The performances of our method also outperform previous works across all datasets, where Hits@1 and MRR have been improved from 6% to 13%.

Since many real world networks are evolving over time, such as social networks and user-item networks, there are increasing research efforts on dynamic network embedding in recent years. They learn node representations from a sequence of evolving graphs but not only the latest network, for preserving both structural and temporal information from the dynamic networks. Due to the lack of comprehensive investigation of them, we give a survey of dynamic network embedding in this paper. Our survey inspects the data model, representation learning technique, evaluation and application of current related works and derives common patterns from them. Specifically, we present two basic data models, namely, discrete model and continuous model for dynamic networks. Correspondingly, we summarize two major categories of dynamic network embedding techniques, namely, structural-first and temporal-first that are adopted by most related works. Then we build a taxonomy that refines the category hierarchy by typical learning models. The popular experimental data sets and applications are also summarized. Lastly, we have a discussion of several distinct research topics in dynamic network embedding.

A robotic fruit packing machine that uses artificial intelligence could be adapted to harvesting in rural and regional Australia.

As a single person wandering through the world, it can be difficult to find someone who loves all the right things: parks, subways, bike lanes, human-scale buildings, high-density housing, debates over the ideal length of a city block. Even on a dating app, you can't always tell from a profile who might be thinking, behind a smile, I hate cars. But if this is exactly the sort of partner--or friend or fling--you're looking for, there is a solution: Join the wildly popular Facebook meme group and leftist community NUMTOTs ("New Urbanist Memes for Transit-Oriented Teens," which isn't really just for teens) and request access to its private spin-off group, NUMTinder. With about 8,000 members living mostly in North America, the United Kingdom, and Australia, NUMTinder is a makeshift dating environment for those who consider liking public transportation to be a core part of their personality, or those for whom a lack of interest in urban planning is a deal breaker. Almost everyone in the group posts at least one selfie with a bike or a subway entrance to demonstrate commitment to the lifestyle, and when a new member introduces herself, it's not uncommon for her to brag about the fact that she doesn't have a driver's license.

Pre-training models such as BERT have achieved great success in many natural language processing tasks. However, how to obtain better sentence representation through these pre-training models is still worthy to exploit. Previous work has shown that the anisotropy problem is an critical bottleneck for BERT-based sentence representation which hinders the model to fully utilize the underlying semantic features. Therefore, some attempts of boosting the isotropy of sentence distribution, such as flow-based model, have been applied to sentence representations and achieved some improvement. In this paper, we find that the whitening operation in traditional machine learning can similarly enhance the isotropy of sentence representations and achieve competitive results. Furthermore, the whitening technique is also capable of reducing the dimensionality of the sentence representation. Our experimental results show that it can not only achieve promising performance but also significantly reduce the storage cost and accelerate the model retrieval speed.

In the last few years, the interest in knowledge bases has grown exponentially in both the research community and the industry due to their essential role in AI applications. Entity alignment is an important task for enriching knowledge bases. This paper provides a comprehensive tutorial-type survey on representative entity alignment techniques that use the new approach of representation learning. We present a framework for capturing the key characteristics of these techniques, propose two datasets to address the limitation of existing benchmark datasets, and conduct extensive experiments using the proposed datasets. The framework gives a clear picture of how the techniques work. The experiments yield important results about the empirical performance of the techniques and how various factors affect the performance. One important observation not stressed by previous work is that techniques making good use of attribute triples and relation predicates as features stand out as winners.

An expert on the social implications of technology responds to Shiv Ramdas' "The Trolley Solution." Imagine a university without any teachers, just peer learners, open-access resources, and an office space full of high-speed internet-enabled computers, accessible to anyone between 18–30 years of age, regardless of any prior learning. That university is called 42. It does not have any academic instructors; the teachers are the self-starting students who have their eyes set on a job in Big Tech. Aided only by a problem-based learning curriculum, students gain a certificate of completion about three to five years after starting out.