朱庄水库流域径流量变化特征及影响因素

利用朱庄区域长系列水文资料,对径流量的年内、年际变化特征及变化趋势进行了分析研究,分析了人类活动影响引起下垫面变化导致径流变化的原因,估算了降水和下垫面变化对径流量的影响量。该区域径流量年内、年际变化较大;多年径流量系列呈减少趋势,尤其从20世纪70年代末以来径流量发生了显著变异;下垫面变化是径流量减少的主要原因。     

Decision-theoretic planning with generalized first-order decision diagrams

Many tasks in AI require representation and manipulation of complex functions. First-Order Decision Diagrams (FODD) are a compact knowledge representation expressing functions over relational structures. They represent numerical functions that, when constrained to the Boolean range, use only existential quantification. Previous work has developed a set of operations for composition and for removing redundancies in FODDs, thus keeping them compact, and showed how to successfully employ FODDs for solving large-scale stochastic planning problems through the formalism of relational Markov decision processes (RMDP). In this paper, we introduce several new ideas enhancing the applicability of FODDs. More specifically, we first introduce Generalized FODDs (GFODD) and composition operations for them, generalizing FODDs to arbitrary quantification. Second, we develop a novel approach for reducing (G)FODDs using model checking. This yields – for the first time – a reduction that maximally reduces the diagram for the FODD case and provides a sound reduction procedure for GFODDs. Finally we show how GFODDs can be used in principle to solve RMDPs with arbitrary quantification, and develop a complete solution for the case where the reward function is specified using an arbitrary number of existential quantifiers followed by an arbitrary number of universal quantifiers.     

Explicit/multi-parametric model predictive control (MPC) of linear discrete-time systems by dynamic and multi-parametric programming

This work presents a new algorithm for solving the explicit/multi-parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques. The algorithm features two key steps: (i) a dynamic programming step, in which the mp-MPC problem is decomposed into a set of smaller subproblems in which only the current control, state variables, and constraints are considered, and (ii) a multi-parametric programming step, in which each subproblem is solved as a convex multi-parametric programming problem, to derive the control variables as an explicit function of the states. The key feature of the proposed method is that it overcomes potential limitations of previous methods for solving multi-parametric programming problems with dynamic programming, such as the need for global optimization for each subproblem of the dynamic programming step.     

Feedback stabilization for high order feedforward nonlinear time-delay systems

This paper investigates the problem of global strong stabilization by state feedback, for a family of high order feedforward nonlinear time-delay systems. The uncertain nonlinearities are assumed to satisfy a polynomial growth assumption with an input or delayed input dependent rate. With the help of the appropriate Lyapunov–Krasovskii functionals, and a rescaling transformation with a gain to be tuned online by a dynamic equation, we propose a dynamic low gain state feedback control scheme. A simulation example is given to demonstrate the effectiveness of the proposed design procedure.     

Modeling the impact of spectral sensor configurations on the FLD retrieval accuracy of sun-induced chlorophyll fluorescence

Chlorophyll fluorescence is related to photosynthesis and can serve as a remote sensing proxy for estimating photosynthetic energy conversion and carbon uptake. Recent advances in sensor technology allow remote measurements of the sun-induced chlorophyll fluorescence signal (Fs) at leaf and canopy scale. The commonly used Fraunhofer Line Depth (FLD) principle exploits spectrally narrow atmospheric oxygen absorption bands and relates Fs to the difference of the absorption feature depth of a fluorescensing and a non-fluorescensing surface. However, due to the nature of these narrow bands, Fs retrieval results depend not only on vegetation species type or environmental conditions, but also on instrument technology and processing algorithms. Thus, an evaluation of all influencing factors and their separate quantification is required to further improve Fs retrieval and to allow a reproducible interpretation of Fs signals.Here we present a modeling study that isolates and quantifies the impacts of sensor characteristics, such as spectral sampling interval (SSI), spectral resolution (SR), signal to noise ratio (SNR), and spectral shift (SS) on the accuracy of Fs measurements in the oxygen A band centered at 760 nm (O₂-A). Modeled high resolution radiance spectra associated with known Fs were spectrally resampled, taking into consideration the various sensor properties. Fs was retrieved using the three most common FLD retrieval methods, namely the original FLD method (sFLD), the modified FLD (3FLD) and the improved FLD (iFLD). The analysis investigates parameter ranges, which are representative for field and airborne instruments currently used in Fs research (e.g., ASD FieldSpec, OceanOptics HR, AirFLEX, AISA, APEX, CASI, and MERIS).Our results show that the most important parameter affecting the retrieval accuracy is SNR, SR accounts for ≤ 40% of the error, the SSI for ≤ 12%, and SS for ≤ 7% of the error. A trade-off study revealed that high SR can partly compensate for low SNR. There is a strong interrelation between all parameters and the impact of specific parameters can compensate or amplify the influence of others. Hence, the combination of all parameters must be considered by the evaluation of sensors and their potential for Fs retrieval. In general, the standard FLD method strongly overestimates Fs, while 3FLD and iFLD provide a more accurate estimation of Fs. We conclude that technical sensor specifications and the retrieval methods cause a significant variability in retrieved Fs signals. Results are intended to be one relevant component of the total uncertainty budget of Fs retrieval and have to be considered in the interpretation of retrieved Fs signals.     

A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization

Traditional Genetic Algorithms (GAs) mating schemes select individuals for crossover independently of their genotypic or phenotypic similarities. In Nature, this behavior is known as random mating. However, non-random protocols, in which individuals mate according to their kinship or likeness, are more common in natural species. Previous studies indicate that when applied to GAs, dissortative mating - a type of non-random mating in which individuals are chosen according to their similarities - may improve their performance (on both speed and reliability). Dissortative mating maintains genetic diversity at a higher level during the run, a fact that is frequently observed as a possible cause of dissortative GAs’ ability to escape local optima. Dynamic optimization demands a special attention when designing and tuning a GA, since diversity plays an even more crucial role than it does when tackling static ones. This paper investigates the behavior of the Adaptive Dissortative Mating GA (ADMGA) in dynamic problems and compares it to GAs based on random immigrants. ADMGA selects parents according to their Hamming distance, via a self-adjustable threshold value. The method, by keeping population diversity during the run, provides an effective means to deal with dynamic problems. Tests conducted with dynamic trap functions and dynamic versions of Road Royal and knapsack problems indicate that ADMGA is able to outperform other GAs on a wide range of tests, being particularly effective when the frequency of changes is low. Specifically, ADMGA outperforms two state-of-the-art algorithms on many dynamic scenarios. In addition, and unlike preceding dissortative mating GAs and other evolutionary techniques for dynamic optimization, ADMGA self-regulates the intensity of the mating restrictions and does not increase the set of parameters in GAs, thus being easier to tune.     

Weighted dynamic time warping for time series classification

Dynamic time warping (DTW), which finds the minimum path by providing non-linear alignments between two time series, has been widely used as a distance measure for time series classification and clustering. However, DTW does not account for the relative importance regarding the phase difference between a reference point and a testing point. This may lead to misclassification especially in applications where the shape similarity between two sequences is a major consideration for an accurate recognition. Therefore, we propose a novel distance measure, called a weighted DTW (WDTW), which is a penalty-based DTW. Our approach penalizes points with higher phase difference between a reference point and a testing point in order to prevent minimum distance distortion caused by outliers. The rationale underlying the proposed distance measure is demonstrated with some illustrative examples. A new weight function, called the modified logistic weight function (MLWF), is also proposed to systematically assign weights as a function of the phase difference between a reference point and a testing point. By applying different weights to adjacent points, the proposed algorithm can enhance the detection of similarity between two time series. We show that some popular distance measures such as DTW and Euclidean distance are special cases of our proposed WDTW measure. We extend the proposed idea to other variants of DTW such as derivative dynamic time warping (DDTW) and propose the weighted version of DDTW. We have compared the performances of our proposed procedures with other popular approaches using public data sets available through the UCR Time Series Data Mining Archive for both time series classification and clustering problems. The experimental results indicate that the proposed approaches can achieve improved accuracy for time series classification and clustering problems.     

Optimal modalities for radiative transfer-neural network estimation of canopy biophysical characteristics: Evaluation over an agricultural area with CHRIS/PROBA observations

Neural networks trained over radiative transfer simulations constitute the basis of several operational algorithms to estimate canopy biophysical variables from satellite reflectance measurements. However, only little attention was paid to the training process which has a major impact on retrieval performances. This study focused on the several modalities of the training process within neural network estimation of LAI, FCOVER and FAPAR biophysical variables. Performances were evaluated over both actual experimental observations and model simulations. The SAIL and PROSPECT radiative transfer models were used here to simulate the training and the synthetic test datasets. Measurements of LAI, FCOVER and FAPAR were achieved over the Barrax (Spain) agricultural site for a range of crop types concurrently to CHRIS/PROBA satellite image acquisition. Results showed that the spectral band selection was specific to LAI, FCOVER and FAPAR variables. The optimal band set provided significantly improved performances for LAI, while only small differences were observed for the other variables. Gaussian distributions of the radiative transfer model input variables performed better than uniform distributions for which no prior information was exploited. Including moderate uncertainties in the reflectance simulations used in the training process improved the flexibility of the neural network in cases where simulations departed slightly from observations. Simple neural network architecture with a single hidden layer of five tangent sigmoid transfer functions was performing as good as more complex architectures if the training dataset was larger than ten times the number of coefficients to tune. Small sensitivity of performances was observed depending on the way the solution was selected when several networks were trained in parallel. Finally, comparison with a NDVI based approach showed the generally better retrieval accuracy of neural networks.     

Integrating spectral indices with environmental parameters for estimating heavy metal concentrations in rice using a dynamic fuzzy neural-network model

A generalized dynamic fuzzy neural network (GDFNN) was created to estimate heavy metal concentrations in rice by integrating spectral indices and environmental parameters. Hyperspectral data, environmental parameters, and heavy metal content were collected from field experiments with different levels of heavy metal pollution (Cu and Cd). Input variables used in the GDFNN model were derived from 10 variables acquired by gray relational analysis. The assessment models for Cd and Cu concentration employed five and six input variables, respectively. The results showed that the GDFNN for estimating Cu and Cd concentrations in rice performed well at prediction with a compact network structure using the training, validation, and testing sets (for Cu, fuzzy rules=9, R² greater than 0.75, and RMSE less than 2.5; for Cd, fuzzy rules=9, R² greater than 0.75, and RMSE less than 1.0). The final GDFNN model was then compared with a back-propagation (BP) neural network model, adaptive-network-based fuzzy interference systems (ANFIS), and a regression model. The accuracies of GDFNN model prediction were usually slightly better than those of the other three models. This demonstrates that the GDFNN model is more suitable for predicting heavy metal concentrations in rice.     

Adaptable Decentralized Service Oriented Architecture

In the Service Oriented Architecture (SOA), BPEL specified business processes are executed by non-scalable centralized orchestration engines. In order to address the scalability issue, decentralized orchestration engines are applied, which decentralize BPEL processes into static fragments at design time without considering runtime requirements. The fragments are then encapsulated into runtime components such as agents. There are a variety of attitudes towards workflow decentralization; however, only a few of them produce adaptable fragments with runtime environment. In this paper, producing runtime adaptable fragments is presented in two aspects. The first one is frequent-path adaptability that is equal to finding closely interrelated activities and encapsulating them in the same fragment to omit the communication cost of the activities. Another aspect is proportional-fragment adaptability, which is analogous to the proportionality of produced fragments with number of workflow engine machines. It extenuates the internal communication among the fragments on the same machine. An ever-changing runtime environment along with the mentioned adaptability aspects may result in producing a variety of process versions at runtime. Thus, an Adaptable and Decentralized Workflow Execution Framework (ADWEF) is introduced that proposes an abstraction of adaptable decentralization in the SOA orchestration layer. Furthermore, ADWEF architectures Type-1 and Type-2 are presented to support the execution of fragments created by two decentralization methods, which produce customized fragments known as Hierarchical Process Decentralization (HPD) and Hierarchical Intelligent Process Decentralization (HIPD). However, mapping the current system conditions to a suitable decentralization method is considered as future work. Evaluations of the ADWEF decentralization methods substantiate both adaptability aspects and demonstrate a range of improvements in response-time, throughput, and bandwidth-usage compared to previous methods.