Pacific Ocean
PETAL: Physics Emulation Through Averaged Linearizations for Solving Inverse Problems
Jin, Jihui, Ollivier, Etienne, Touret, Richard, McKinley, Matthew, Sabra, Karim G., Romberg, Justin K.
Inverse problems describe the task of recovering an underlying signal of interest given observables. Typically, the observables are related via some non-linear forward model applied to the underlying unknown signal. Inverting the non-linear forward model can be computationally expensive, as it often involves computing and inverting a linearization at a series of estimates. Rather than inverting the physics-based model, we instead train a surrogate forward model (emulator) and leverage modern auto-grad libraries to solve for the input within a classical optimization framework. Current methods to train emulators are done in a black box supervised machine learning fashion and fail to take advantage of any existing knowledge of the forward model. In this article, we propose a simple learned weighted average model that embeds linearizations of the forward model around various reference points into the model itself, explicitly incorporating known physics. Grounding the learned model with physics based linearizations improves the forward modeling accuracy and provides richer physics based gradient information during the inversion process leading to more accurate signal recovery. We demonstrate the efficacy on an ocean acoustic tomography (OAT) example that aims to recover ocean sound speed profile (SSP) variations from acoustic observations (e.g.
Spatial-temporal recurrent reinforcement learning for autonomous ships
This paper proposes a spatial-temporal recurrent neural network architecture for deep $Q$-networks that can be used to steer an autonomous ship. The network design makes it possible to handle an arbitrary number of surrounding target ships while offering robustness to partial observability. Furthermore, a state-of-the-art collision risk metric is proposed to enable an easier assessment of different situations by the agent. The COLREG rules of maritime traffic are explicitly considered in the design of the reward function. The final policy is validated on a custom set of newly created single-ship encounters called `Around the Clock' problems and the commonly used Imazu (1987) problems, which include 18 multi-ship scenarios. Performance comparisons with artificial potential field and velocity obstacle methods demonstrate the potential of the proposed approach for maritime path planning. Furthermore, the new architecture exhibits robustness when it is deployed in multi-agent scenarios and it is compatible with other deep reinforcement learning algorithms, including actor-critic frameworks.
Bridging History with AI A Comparative Evaluation of GPT 3.5, GPT4, and GoogleBARD in Predictive Accuracy and Fact Checking
Tasar, Davut Emre, Tasar, Ceren Ocal
The rapid proliferation of information in the digital era underscores the importance of accurate historical representation and interpretation. While artificial intelligence has shown promise in various fields, its potential for historical fact-checking and gap-filling remains largely untapped. This study evaluates the performance of three large language models LLMs GPT 3.5, GPT 4, and GoogleBARD in the context of predicting and verifying historical events based on given data. A novel metric, Distance to Reality (DTR), is introduced to assess the models' outputs against established historical facts. The results reveal a substantial potential for AI in historical studies, with GPT 4 demonstrating superior performance. This paper underscores the need for further research into AI's role in enriching our understanding of the past and bridging historical knowledge gaps.
A minor extension of the logistic equation for growth of word counts on online media: Parametric description of diversity of growth phenomena in society
To understand the growing phenomena of new vocabulary on nationwide online social media, we analyzed monthly word count time series extracted from approximately 1 billion Japanese blog articles from 2007 to 2019. In particular, we first introduced the extended logistic equation by adding one parameter to the original equation and showed that the model can consistently reproduce various patterns of actual growth curves, such as the logistic function, linear growth, and finite-time divergence. Second, by analyzing the model parameters, we found that the typical growth pattern is not only a logistic function, which often appears in various complex systems, but also a nontrivial growth curve that starts with an exponential function and asymptotically approaches a power function without a steady state. Furthermore, we observed a connection between the functional form of growth and the peak-out. Finally, we showed that the proposed model and statistical properties are also valid for Google Trends data (English, French, Spanish, and Japanese), which is a time series of the nationwide popularity of search queries.
Bringing AI to the edge: A formal M&S specification to deploy effective IoT architectures
Cárdenas, Román, Arroba, Patricia, Risco-Martín, José L.
The Internet of Things is transforming our society, providing new services that improve the quality of life and resource management. These applications are based on ubiquitous networks of multiple distributed devices, with limited computing resources and power, capable of collecting and storing data from heterogeneous sources in real-time. To avoid network saturation and high delays, new architectures such as fog computing are emerging to bring computing infrastructure closer to data sources. Additionally, new data centers are needed to provide real-time Big Data and data analytics capabilities at the edge of the network, where energy efficiency needs to be considered to ensure a sustainable and effective deployment in areas of human activity. In this research, we present an IoT model based on the principles of Model-Based Systems Engineering defined using the Discrete Event System Specification formalism. The provided mathematical formalism covers the description of the entire architecture, from IoT devices to the processing units in edge data centers. Our work includes the location-awareness of user equipment, network, and computing infrastructures to optimize federated resource management in terms of delay and power consumption. We present an effective framework to assist the dimensioning and the dynamic operation of IoT data stream analytics applications, demonstrating our contributions through a driving assistance use case based on real traces and data.
Aerospace Corp. CEO predicts swarm of AI-controlled 'hyper-intelligence satellites': 'Almost like Hal 9000'
The Aerospace Corporation President and CEO Steve Isakowitz said he anticipates the future of space exploration and defense will include AI-controlled satellites and permanent living on the surface of the Moon and Mars. Speaking with Fox News Digital at the Milken Global Conference on May 4, Isakowitz noted that NASA has been using artificial intelligence (AI) for many years in Mars rovers because of the time it takes to communicate back and forth with Earth. The rover needed to know where to go and how to do so safely to combat the delay. Today, with the expansion in capabilities of AI and smaller, more affordable computer chips, advanced AI tech can now be packed into the satellites orbiting Earth. "I do think we're entering an age where we're going to have hyper-intelligence satellites, satellites that will not just be dumb cameras that are looking at the Earth and just filming everything, but you could tell it what to look for. So, don't just take pictures of the Pacific Ocean. Look for these kinds of tankers or look for these kinds of ships or look for these kind of warships or these kind of airplanes where you actually have the satellite. Know what it's looking at that has the intelligence to know if it doesn't feel well," Isakowitz said.
Inside The High-Stakes, AI-Powered Race To Dethrone Google Search
In an unassuming office on a quiet, mostly residential street in Mountain View, California -- located eight minutes from Google's sprawling headquarters -- a couple of ex-Googlers and their team of 50 are trying to build a search engine they hope will someday rival their former employer's. The company, Neeva, was started in 2020 by Sridhar Ramaswamy, who ran Google's $162 billion advertising arm before stepping down in 2018, and Vivek Raghunathan, a former Google vice president who worked on monetizing YouTube and other parts of the company. For a few years, the startup, which has raised over $77 million from some of Silicon Valley's top investors, focused on differentiating itself from Google by shunning invasive advertising and allowing power users to pay for extra features. Then, around the end of last year, the team at Neeva watched as a chatbot called ChatGPT created by the San Francisco–based startup OpenAI went viral. ChatGPT's ability to divine answers to nearly every question with an eerily humanlike sentience made it an instant hit, unleashing a modern AI wave. Suddenly, people around the world were talking about replacing Google search with ChatGPT. After all, if a chatbot could instantly answer any question for you, why would you need a search engine that simply spat out a bunch of links for you to trawl through?
Deep Multi-View Semi-Supervised Clustering with Sample Pairwise Constraints
Chen, Rui, Tang, Yongqiang, Zhang, Wensheng, Feng, Wenlong
Multi-view clustering has attracted much attention thanks to the capacity of multi-source information integration. Although numerous advanced methods have been proposed in past decades, most of them generally overlook the significance of weakly-supervised information and fail to preserve the feature properties of multiple views, thus resulting in unsatisfactory clustering performance. To address these issues, in this paper, we propose a novel Deep Multi-view Semi-supervised Clustering (DMSC) method, which jointly optimizes three kinds of losses during networks finetuning, including multi-view clustering loss, semi-supervised pairwise constraint loss and multiple autoencoders reconstruction loss. Specifically, a KL divergence based multi-view clustering loss is imposed on the common representation of multi-view data to perform heterogeneous feature optimization, multi-view weighting and clustering prediction simultaneously. Then, we innovatively propose to integrate pairwise constraints into the process of multi-view clustering by enforcing the learned multi-view representation of must-link samples (cannot-link samples) to be similar (dissimilar), such that the formed clustering architecture can be more credible. Moreover, unlike existing rivals that only preserve the encoders for each heterogeneous branch during networks finetuning, we further propose to tune the intact autoencoders frame that contains both encoders and decoders. In this way, the issue of serious corruption of view-specific and view-shared feature space could be alleviated, making the whole training procedure more stable. Through comprehensive experiments on eight popular image datasets, we demonstrate that our proposed approach performs better than the state-of-the-art multi-view and single-view competitors.
China, Russia, North Korea, and Iran are investing in ways to nuke us. The time is now for missile defense
Editor's note: What follows is exclusively adapted from a longer essay that was published as a part of the Ronald Reagan Institute's Essay Series on Presidential Principles and Beliefs which is premised on the conviction that President Reagan's words and ideas hold important lessons for today. You can find more about the essay series here. At the height of the Cold War, President Ronald Reagan had the foresight to call upon the nation to support the Strategic Defense Initiative, later known as the "Star Wars" defense system, to protect the United States from a potential USSR missile attack. Due to fierce Democrat opposition, our nation never fully built out our missile defense capability and doubled down on nuclear deterrence. We have relied upon our adversaries' fear that our nuclear weapons could destroy them to deter their use of nuclear weapons against us or our allies.
Toward the Automated Construction of Probabilistic Knowledge Graphs for the Maritime Domain
Shiri, Fatemeh, Wang, Teresa, Pan, Shirui, Chang, Xiaojun, Li, Yuan-Fang, Haffari, Reza, Nguyen, Van, Yu, Shuang
International maritime crime is becoming increasingly sophisticated, often associated with wider criminal networks. Detecting maritime threats by means of fusing data purely related to physical movement (i.e., those generated by physical sensors, or hard data) is not sufficient. This has led to research and development efforts aimed at combining hard data with other types of data (especially human-generated or soft data). Existing work often assumes that input soft data is available in a structured format, or is focused on extracting certain relevant entities or concepts to accompany or annotate hard data. Much less attention has been given to extracting the rich knowledge about the situations of interest implicitly embedded in the large amount of soft data existing in unstructured formats (such as intelligence reports and news articles). In order to exploit the potentially useful and rich information from such sources, it is necessary to extract not only the relevant entities and concepts but also their semantic relations, together with the uncertainty associated with the extracted knowledge (i.e., in the form of probabilistic knowledge graphs). This will increase the accuracy of and confidence in, the extracted knowledge and facilitate subsequent reasoning and learning. To this end, we propose Maritime DeepDive, an initial prototype for the automated construction of probabilistic knowledge graphs from natural language data for the maritime domain. In this paper, we report on the current implementation of Maritime DeepDive, together with preliminary results on extracting probabilistic events from maritime piracy incidents. This pipeline was evaluated on a manually crafted gold standard, yielding promising results.