A class of new transforms tailored for the hypergeometric series

A new class of transforms, tailored for the hypergeometric series, is proposed and tested on a number of series. From a knowledge of a given number of terms of a sequence, these transforms reproduce the functions with a better accuracy than the Levin-like transforms. Though there exists a correlation between the approximative power of a rational approximant and its ability to predict the leading terms of a series, there are exceptions to this, especially in the case of divergent series. The new transforms can, in most cases, predict a number of extra terms not used in the construction of the approximants.     

重庆岩溶地区景观格局特征研究

景观格局是地貌格局、土壤格局、水资源格局、植物分布格局及生产力格局等的综合。根据地质、地貌和区域景观特征,可将重庆岩溶区划成三大景观区:渝东北中山区(I)、渝东南中低山区(Ⅱ)、渝中平行岭谷低山丘陵区(Ⅲ)。各景观分区景观格局特征主要表现为:景观多样性指数分别为Ⅰ区1.38、Ⅱ区1.35、Ⅲ区1.77;各景观分区的人工干扰指数分别为Ⅰ区0.33、Ⅱ区0.69和Ⅲ区0.95,人工干扰的程度按照区域代码顺序依次增强;景观均匀度、优势度和丰富度密度分别为Ⅰ区0.49、1.43和0.0005,Ⅱ区0.48、1.46和0.0003,Ⅲ区0.63、1.04、0.0025;景观变化态势按照景观分区代码Ⅰ、Ⅱ、Ⅲ的顺序表现为耕地、居民工矿用地和水域面积比例呈明显递增,而林地、草地呈现明显递减的,园地分布比例为Ⅲ区远大于Ⅰ、Ⅱ区;未利用地比例出现Ⅱ区最小,Ⅲ区最大的现象。     

支持向量回归机在物价预测上的应用

把时间序列SVM预测模型应用于物价指数的预测,采用逐步递归的方法进行,同时注意尽量减少训练样本的浪费和充分挖掘SVM模型适合短期预测的潜力.分析结果表明,无论是拟合情况,还是预测值的检验和物价指数的实际规律来看,都有很高的精度,可以作为物价指数预测的一种行之有效的方法.     

Improved inter-view correlations for low complexity MV-HEVC

The more advanced multi-view extension, MV-HEVC, effectively exploits visual similarities between multi-view videos and enables high compression efficiency. Each view in the multi-view sequence depends on the captured scene, the distance between cameras and recording angles. Increasing the distance between dependent viewpoints generates an inter-view disparity. This impacts the inter-view similarities, affects the disparity estimation and further increases the computational complexity of the MV-HEVC encoder. In this paper, an efficient earlier disparity estimation is proposed for low complexity MV-HEVC. This algorithm is based on reducing the complexity of disparity estimation by eliminating the inter-view offset. Moreover, the inter-view similarities are controlled by considering the reliability of each coding unit size in the search range. This reliability is estimated by reducing the number of searching points within a new limited window. For reliable motion estimation, we further proposed an earlier decision of coding units splitting in the dependent views according to those in the reference views. Experimental results show that the proposed algorithm can achieve an average encoding time saving of 20.37%–40,61% with marginal performance degradation.     

A modified θ projection model for constant load creep curves-II. Application of creep life prediction

To minimize the deviation of the predicted creep curves obtained under constant load conditions by the original θ projection model, a new modified version that can be expressed by $\epsilon ={\theta }_1\left(1-e^{-{\theta }_{2}t}\right)+{\theta }_3\left(e^{{\theta }_4{e}^{{\theta }_5\epsilon }t}-1\right)$, was derived and experimentally validated in our last study. In the present study, the predictive capability of the modified θ projection model was investigated by comparing the simulated and experimentally determined creep curves of K465 and DZ125 superalloys over a range of temperatures and stresses. Furthermore, the linear relationship between creep temperature and initial stress was extended to the 5-parameter model. The results indicated that the modified model could be used as a creep life prediction method, as it described the creep curve shape and resulted in predictions that fall within a specified error interval. Meanwhile, this modified model provides a more accurate way of describing creep curves under constant load conditions. The limitations and future direction of the modified model were also discussed. In addition, this modified θ projection model shows great potential for the evaluation and assessment of the service safety of structural materials used in components governed by creep deformation.     

Multi-Step H∞ Generalized Predictive Control

An H generalized control law is derived which has properties in common with both the GH and GPC control laws. The stability and robustness properties are the same as for a GH optimal controller but a cost on future predictive error and control action is dealt with in the same manner as for the GPC or model based predictive control laws. This type of long range predictive control algorithm has stability and robustness problems which are much improved through the H formalism. The general two-block problem solution is considered first and this is then reduced to a novel one-block multi-step GH control law which is very attractive computationally. This latter algorithm has all the benefits of one-block H controllers and yet the equations can be written in a form where GPC type constrained solutions can be obtained.     

Measuring universal intelligence: Towards an anytime intelligence test

In this paper, we develop the idea of a universal anytime intelligence test. The meaning of the terms “universal” and “anytime” is manifold here: the test should be able to measure the intelligence of any biological or artificial system that exists at this time or in the future. It should also be able to evaluate both inept and brilliant systems (any intelligence level) as well as very slow to very fast systems (any time scale). Also, the test may be interrupted at any time, producing an approximation to the intelligence score, in such a way that the more time is left for the test, the better the assessment will be. In order to do this, our test proposal is based on previous works on the measurement of machine intelligence based on Kolmogorov complexity and universal distributions, which were developed in the late 1990s (C-tests and compression-enhanced Turing tests). It is also based on the more recent idea of measuring intelligence through dynamic/interactive tests held against a universal distribution of environments. We discuss some of these tests and highlight their limitations since we want to construct a test that is both general and practical. Consequently, we introduce many new ideas that develop early “compression tests” and the more recent definition of “universal intelligence” in order to design new “universal intelligence tests”, where a feasible implementation has been a design requirement. One of these tests is the “anytime intelligence test”, which adapts to the examinee's level of intelligence in order to obtain an intelligence score within a limited time.     

A local variance-controlled reversible data hiding method using prediction and histogram-shifting

The stego image quality produced by the histogram-shifting based reversible data hiding technique is high; however, it often suffers from lower embedding capacity compared to other types of reversible data hiding techniques. In 2009, Tsai et al. solved this problem by exploiting the similarity of neighboring pixels to construct a histogram of prediction errors; data embedding is done by shifting the error histogram. However, Tsai et al.’s method does not fully exploit the correlation of the neighboring pixels. In this paper, a set of basic pixels is employed to improve the prediction accuracy, thereby increasing the payload. To further improve the image quality, a threshold is used to select only low-variance blocks to join the embedding process. According to the experimental results, the proposed method provides a better or comparable stego image quality than Tsai et al.’s method and other existing reversible data hiding methods under the same payload.     

Predictive control and scheduling codesign in network control systems

A codesign approach combining predictive control compensation and network scheduling is presented in this paper to overcome the adverse influences of stochastic time delays and packet losses encountered in network-based real-time control systems. The state estimation and control prediction compensation algorithms are used for the random network delays in the feedback and forward channels, and the stability criteria are analyzed. The proper sampling rate is given with network scheduling to meet the desired system performance, while the network-induced delay is tolerated. Simulations show that the codesign approach works well with the bounded network delay.     

Improved method for development of parsimonious orthonormal basis filter models

One of the major advantages of orthonormal basis filter (OBF) models is that they are parsimonious in parameters. However, this is true only if appropriate type of filter and reasonably accurate dominant poles of the system are used in developing the model. An arbitrary choice of filter type and poles may lead to non-parsimonious model. While the selection of the type of filter may be simple if the damping characteristics of the system are known, finding good estimates of the dominant pole(s) of the system is not a trivial task. Another important advantage of OBF model is the fact that time delays can be easily estimated and incorporated into the model. Currently, time delay of the system is estimated from the step response of the OBF model using the tangent method. While this method is effective in estimating the time delay of systems that can be accurately modeled by first order plus time delay (FOPTD) models, the accuracy is low for systems with second- and higher-order dynamics. In this paper, a scheme is proposed that will result in parsimonious OBF model and a better estimate of time delay starting from an arbitrary set of poles.