Qinghai Petroleum Administration Has Set Its Near-Term Exploration Target

ＱｉｎｇｈａｉＰｅｔｒｏｌｅｕｍＡｄｍｉｎｉｓｔｒａｔｉｏｎＨａｓＳｅｔＩｔｓＮｅａｒ－ＴｅｒｍＥｘｐｌｏｒａｔｉｏｎＴａｒｇｅｔＬｉｎＸｕｂｉｎＯｎｔｈｅｂａｓｉｓｏｆａｎｏｖｅｒａｌｌｅｖａｌｕａｔｉｏｎｆｏｒｎａｔｕｒａｌｇａｓｅｘｐｌｏｒａｔ...

CAS Sets Food Security as Main Target for 2001

The Chinese Academy of Sci-ences (CAS)has designatedguaranteeing food safety forthe future population peak of 1.6 bil-lion as its first and foremost targettaking into account the stress thatwill place on China’s existingresources, said a CAS official at theacademy’s annual work

Setting Targets For 2011

At the opening of full annual session of the lawmaking National People’s Congress on March 5, Premier Wen Jiabao delivered the government work report. The report consists of three parts: Review of National Economic and Social Development During the 11th Five-Year Plan Period, Major Objectives and Tasks for the 12th Five-Year Plan Period and Work for 2011. When outlining this year’s work, Wen said the government would focus on improving people’s livelihoods. Excerpts follow:

Online multi-target intelligent tracking using a deep long-short term memory network

Multi-target tracking is facing the difficulties of modeling uncertain motion and observation noise.Traditional tracking algorithms are limited by specific models and priors that may mismatch a real-world scenario.In this paper,considering the model-free purpose,we present an online Multi-Target Intelligent Tracking(MTIT)algorithm based on a Deep Long-Short Term Memory(DLSTM)network for complex tracking requirements,named the MTIT-DLSTM algorithm.Firstly,to distinguish trajectories and concatenate the tracking task in a time sequence,we define a target tuple set that is the labeled Random Finite Set(RFS).Then,prediction and update blocks based on the DLSTM network are constructed to predict and estimate the state of targets,respectively.Further,the prediction block can learn the movement trend from the historical state sequence,while the update block can capture the noise characteristic from the historical measurement sequence.Finally,a data association scheme based on Hungarian algorithm and the heuristic track management strategy are employed to assign measurements to targets and adapt births and deaths.Experimental results manifest that,compared with the existing tracking algorithms,our proposed MTIT-DLSTM algorithm can improve effectively the accuracy and robustness in estimating the state of targets appearing at random positions,and be applied to linear and nonlinear multi-target tracking scenarios.

A novel variable-lag probability hypothesis density smoother for multi-target tracking

It is understood that the forward-backward probability hypothesis density （PHD） smoothing algorithms proposed recently can significantly improve state estimation of targets. However, our analyses in this paper show that they cannot give a good cardinality （i.e., the number of targets） estimate. This is because backward smoothing ignores the effect of temporary track drop- ping caused by forward filtering and/or anomalous smoothing resulted from deaths of targets. To cope with such a problem, a novel PHD smoothing algorithm, called the variable-lag PHD smoother, in which a detection process used to identify whether the filtered cardinality varies within the smooth lag is added before backward smoothing, is developed here. The analytical results show that the proposed smoother can almost eliminate the influences of temporary track dropping and anomalous smoothing, while both the cardinality and the state estimations can significantly be improved. Simulation results on two multi-target tracking scenarios verify the effectiveness of the proposed smoother.

First Passage Models for Denumerable Semi-Markov Decision Processes with Nonnegative Discounted Costs

This paper considers a first passage model for discounted semi-Markov decision processes with denumerable states and nonnegative costs. The criterion to be optimized is the expected discounted cost incurred during a first passage time to a given target set. We first construct a semi-Markov decision process under a given semi-Markov decision kernel and a policy. Then, we prove that the value function satisfies the optimality equation and there exists an optimal （or ε-optimal） stationary policy under suitable conditions by using a minimum nonnegative solution approach. Further we give some properties of optimal policies. In addition, a value iteration algorithm for computing the value function and optimal policies is developed and an example is given. Finally, it is showed that our model is an extension of the first passage models for both discrete-time and continuous-time Markov decision processes.