An LMI approach to synthesis subject to almost asymptotic regulation constraints

A multi-objective controller synthesis problem is considered in which an output is to be regulated approximately by assuring a bound on the steady-state peak amplification in response to an infinite-energy disturbance, while also guaranteeing a desired level of performance measured in terms of the worst-case energy gain from a finite-energy input to a performance output. Relying on a characterization of the controllers with which almost asymptotic regulation is accomplished, the problem of guaranteeing the desired level of performance is reduced to solving a system of linear matrix inequalities subject to a set of linear equality constraints. Based on the solution of this system, a procedure is outlined for the construction of a suitable controller whose order is equal to the order of the plant plus the order of the exogenous system.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Invariance properties of RAMS and linear time

An operation on integers isLTTC if it is computable in linear time on a Turing machine (using the dyadic or binary representation of integers). AnLTTC-RAM (respectivelyI-RAM) is a RAM which only uses LTTC operations (respectively operations in the setI).The address-free time complexity measure of a RAM evaluates execution times using the logarithmic cost criterion but assumes that addressing operations are performed for free.     

Space-efficient recognition of sparse self-reducible languages

Mahaney and others have shown that sparse self-reducible sets have time-efficient algorithms, and have concluded that it is unlikely that NP has sparse complete sets. Mahaney's work, intuition, and a 1978 conjecture of Hartmanis notwithstanding, nothing has been known about the density of complete sets for feasible classes until now. This paper shows that sparse self-reducible sets have space-efficient algorithms, and in many cases, even have time-space-efficient algorithms. We conclude that NL, NC ^k , AC ^k , LOG(DCFL), LOG(CFL), and P lack complete (or even Turing-hard) sets of low density unless implausible complexity class inclusions hold. In particular, if NL (respectively P, _k , or NP) has a polylog-sparse logspace-hard set, then NLSC (respectively PSC, _k , or PHSC), and if P has subpolynomially sparse logspace-hard sets, then PPSPACE.     

载体Al/Si比对Cu-ZnO-ZrO2催化剂上CO2加氢合成甲醇的影响

用直接合成法制备了不同铝硅物质的量比Al-SBA-15(β)(β=n(Al)/n(Si)=0,0.02,0.03,0.05)介孔分子筛,并采用浸渍法制备了金属负载量m=35%的CZZ/Al-SBA-15(β)负载型介孔催化剂,考察了Al/Si比对负载催化剂结构和性能的影响。采用N_2吸附-脱附、X射线衍射(XRD)、H_2程序升温还原(H_2-TPR)、CO_2吸附(CO_2-TPD)、NH3吸附(NH3-TPD)和透射电子显微镜(TEM)等手段对样品进行了表征,在固定床反应器上评价了其CO_2加氢合成甲醇的催化性能。实验结果表明,CZZ/Al-SBA-15(β)具有介孔结构,Al的引入不但增加了载体表面酸性位点,同时还提高了催化剂表面铜分散度(DCu%)和铜比表面积(SCu)以及促进了Cu~+-O-Zn活性位的形成,从而大大提高了催化剂的活性。其中CZZ/Al-SBA-15(0.03)催化剂的甲醇选择性达到26%,与不掺铝的CZZ/Al-SBA-15(0)催化剂相比,甲醇选择性提高了11%,但随着掺Al量的继续增加,酸性太强,CO_2吸附能力下降,活性反而降低。     

EIGA法制备激光3D打印用TA15钛合金粉末

采用电极感应熔炼气雾化(EIGA)法制备了激光3D打印用TA15钛合金粉末,研究了熔炼功率对粉末收得率、粒径分布、粉末形貌、松装密度和流动性等特征的影响。结果表明,随着感应熔炼功率增大,粉末收得率和平均粒径减小,当熔炼功率为65kW时,粉末收得率超过62%,中值粒径D_(50)小于100μm,松装密度为2.731g/cm3,流动性为22.46s/50g。对粒径50~180μm的粉末采用激光3D打印,激光直接沉积成形的TA15钛合金样品表面无宏观裂纹和气孔等缺陷,金相组织为细晶网篮组织,制备的TA15钛合金粉末具有良好的可打印性。     

A high quality and small shadow size visual secret sharing scheme based on hybrid strategy for grayscale images

Many secret sharing schemes for digital images have been developed in recent decades. Traditional schemes typically must deal with the problem of computational complexity, and other visual secret sharing schemes come with a higher transmission cost and storage cost; that is, each shadow size is m times as big as the original secret image. The new (2,n) secret sharing scheme for grayscale images proposed in this paper is based a combination of acceptable image quality using block truncation coding (BTC), high compression ratio discrete wavelet transform (DWT) and good subjective performance of the vector quantization (VQ) technique. Experimental results confirm that our proposed scheme not only generates a high quality reconstructed original image but also generates small, random-like grayscale shadows.     

On the convective nature of the instability of a front undergoing a supercritical Turing bifurcation

Fronts are traveling waves in spatially extended systems that connect two different spatially homogeneous rest states. If the rest state behind the front undergoes a supercritical Turing instability, then the front will also destabilize. On the linear level, however, the front will be only convectively unstable since perturbations will be pushed away from the front as it propagates. In other words, perturbations may grow but they can do so only behind the front. It is of interest to show that this behavior carries over to the full nonlinear system. It has been successfully done in a case study by Ghazaryan and Sandstede [A. Ghazaryan, B. Sandstede, Nonlinear convective instability of Turing-unstable fronts near onset: a case study, SIAM J. Appl. Dyn. Syst. 6 (2007) 319–347]. In the present paper, analogous results are obtained for the same system as in Ghazaryan and Sandstede (2007), but for a different parameter regime.     

On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

In this paper, to obtain an efficient parallel algorithm to solve sparse block-tridiagonal linear systems, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are suitable when the desired goal is to maximize parallelism. Moreover, some theoretical results concerning these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block tridiagonal H-matrices is also described. In addition, the validity of these preconditioners is illustrated with some numerical experiments arising from the second order elliptic partial differential equations and oil reservoir simulations.     

Forecasting conditional correlations in stock,bond and foreign exchange markets

The paper forecasts conditional correlations between three classes of international financial assets, namely stock, bond and foreign exchange. Two countries are considered, namely Australia and New Zealand. Forecasting will be conducted using three multivariate GARCH models, namely the CCC model [T. Bollerslev, Modelling the coherence in short-run nominal exchange rates: a multivariate generalized ARCH model, Rev. Econ. Stat. 72 (1990) 498–505], VARMA-GARCH model [S. Ling, M. McAleer, Asymptotic theory for a vector ARMA-GARCH model, Econometric Theory 19 (2003) 280–310], and VARMA-AGARCH model [M. McAleer, S. Hoti, F. Chan, Structure and asymptotic theory for multivariate asymmetric volatility, Econometric Rev., in press]. A rolling window technique is used to forecast 1-day ahead conditional correlations. To evaluate the impact of model specification on conditional correlations forecasts, this paper calculates and compares the correlations between conditional correlations forecasts resulted from the three models. The paper finds the evidence of volatility spillovers and asymmetric effect of negative and positive shock on the conditional variance in most pairs of series. However, it suggests that incorporating volatility spillovers and asymmetric do not contribute to better conditional correlations forecasts.