Abstract The Indo-Pacific warm pool (IPWP) has warmed and expanded substantially over the past decades, which significantly affected hydrological cycle global climate system. It is unclear how IPWP will change in future under anthropogenic (ANT) forcing. Here, we quantify human contribution to observed warming/expansion adjust projected changes using an optimal fingerprinting method based on Co...

We introduce a reformulation technique that converts many-set feasibility problem into an equivalent two-set problem. This involves reformulating the original by replacing pair of its constraint sets with their intersection, before applying Pierra’s classical product space reformulation. The step combining two reduces dimension spaces. refer to this as reduction and use it obtain constraint-red...

We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the problem of updating the online hypothesis by defining a projection problem in which each prediction task corresponds to a single linear constraint. These constraints are tied together through a single slack parameter. We t...

Deferring discretization can occasionally change our perspective on imaging problems. To illustrate, we offer a reformulation of regularized computed tomography (CT) in which the large system of coupled equations for the unknown smoothed image is decoupled into many smaller and simpler equations, each for a separate projection. Regularized CT thus becomes a two-stage process of (nonhomogeneous)...

Both Constraint Handling Rules (CHR) and tabling as implemented in XSB are powerful enhancements of Prolog systems, based on fix point computation. Until now they have only been implemented in separate systems. This paper presents the work involved in porting a CHR system to XSB and in particular the technical issues related to the integration of CHR with tabled resolution. These issues include...

—This work addresses the problem of how a robot can improve a manipulation skill in a sample-efficient and secure manner. As an alternative to the standard reinforcement learning formulation where all objectives are defined in a single reward function, we propose a generalized formulation that consists of three components: 1) A known analytic control cost function; 2) A black-box return functio...

In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...

We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be ...