超宽带聚合物调制器的优化设计

设计了一种以聚合物作为材料的低损耗、宽带宽的Mach—Zehnder光波导调制器。分析了调制器的脊波导的模式特性,设计了脊波导的结构,并使用BPM软件模拟了脊形波导的光场分布;通过对光场分布的分析,优化了脊形波导的宽度Wg,脊高6,芯层高度H。同时对聚合物调制器的电极进行了优化,包括电极宽度W和电极间距D,使得调制器有较小的导体损耗以及较好的阻抗匹配。并结合了脊波导的结构参数和电极的优化参数,给出了优化结果,它能够使微波的有效折射率与光波的有效折射率达到匹配,从而使带宽达到177GHz,导体损耗为0．2569dB／cm·GHz1／2。     

Pr0．45（Ca1-xSrx）0．55MnO3体系调带宽引起的磁相变及电输运性质转变

采用固相法制备了Pr0．45（Ca1-xSrx）0．55MnO3（x=0．0,0．2,0．4,0．6,0．8,1．0）多晶样品．通过测量样品的X射线衍射（XRD）谱、磁化强度-温度（M～T）曲线、电阻率-温度（ρ～T）曲线,研究了Sr^2＋替代Ca^2＋对Pr0．45Ca0．55MnO3体系磁性和电性的影响．实验发现：...     

Theoretical analysis of imaging properties of a pressure-actuated deformable mirror for adaptive compensation of rotationally symmetrical wavefronts

Our work presents a theoretical analysis of aberration properties of a simple single-channel deformable mirror from both the aspect of modeling the shape of the mirror reflecting surface and the mechanisms of wave-front correction using such mirror. The proposed mirror can be used for a compensation of rotationally symmetrical wavefronts, e.g. focusing of optical beams, adaptive change of resonator parameters in laser technology, phase shifting, etc. The detailed analysis of possibilities of wave-front correction was performed.     

Adaptive modification of the delayed feedback control algorithm with a continuously varying time delay

We propose a simple adaptive delayed feedback control algorithm for stabilization of unstable periodic orbits with unknown periods. The state dependent time delay is varied continuously towards the period of controlled orbit according to a gradient-descent method realized through three simple ordinary differential equations. We demonstrate the efficiency of the algorithm with the Rössler and Mackey-Glass chaotic systems. The stability of the controlled orbits is proven by computation of the Lyapunov exponents of linearized equations.     

Synchronization of complex community networks with nonidentical nodes and adaptive coupling strength

In this Letter, the complex dynamical networks with community structure and nonidentical nodes are considered. The globally asymptotical synchronization of the time-delayed complex community networks onto any uniformly smooth state is studied. Some simple and useful criteria are derived by constructing an effective control scheme and adjusting automatically the adaptive coupling strength. Finally, the developed techniques are applied to two complex community networks which are respectively synchronized to a chaotic trajectory and a periodic orbit, and numerical simulations are provided to show the feasibility of the developed methods.     

Effective mechanism for social recommendation of news

Recommender systems represent an important tool for news distribution on the Internet. In this work we modify a recently proposed social recommendation model in order to deal with no explicit ratings of users on news. The model consists of a network of users which continually adapts in order to achieve an efficient news traffic. To optimize the network’s topology we propose different stochastic algorithms that are scalable with respect to the network’s size. Agent-based simulations reveal the features and the performance of these algorithms. To overcome the resultant drawbacks of each method we introduce two improved algorithms and show that they can optimize the network’s topology almost as fast and effectively as other not-scalable methods that make use of much more information.     

Adaptive nonparametric estimation for Lévy processes observed at low frequency

This article deals with adaptive nonparametric estimation for Lévy processes observed at low frequency. For general linear functionals of the Lévy measure, we construct kernel estimators, provide upper risk bounds and derive rates of convergence under regularity assumptions.     

Adaptive Lasso estimators for ultrahigh dimensional generalized linear models

Generalized linear models have been more widely used than linear models which exclude categorical variables. The penalized method becomes an effective tool to study ultrahigh dimensional generalized linear models. In this paper, we study theoretical results of the adaptive Lasso for generalized linear models in terms of diverging number of parameters and ultrahigh dimensionality. The asymptotic results are examined by several simulation studies.     

Further results on adaptive full-order and reduced-order observers for Lur’e differential inclusions

This paper is concerned with the adaptive observer design of Lur’e differential inclusions with unknown parameters. Under a relaxed assumption on nonlinear perturbation functions, a sufficient condition for the existence of an adaptive full-order observer is established. Comparing with results in the literature, the present conditions are complemented with a numerically reliable computational approach, which can be checked by means of linear matrix inequalities. Furthermore, it is shown that, under the sufficient condition, the existence of a reduced-order observer is guaranteed. Also, the reduced-order observer is designed. The effectiveness of the proposed design is illustrated via a simulation example.     

Simulation of the effect of learning on the topology of the functional connectivity of neural networks

We introduce a procedure for simulating adaptive learning in neural networks and the effect this learning has on the way in which the functional connections between the nodes of the network are established. The procedure combines two mechanisms: firstly, the gradual dilution of the network through the elimination of synaptic weights in increasing order of magnitude, thus reducing the costs of the network structure. Secondly, to train the network as it is diluted so as not to compromise its performance pursuant to the proposed task. Considering different levels of learning difficulty, we compare the topology of the functional connectivities that result from the application of this procedure with those obtained using fMRI in healthy volunteers. According to our results, the topology of functional connectivities in healthy subjects can be interpreted as the product of a learning process with a specific degree of difficulty.