一种快速自适应谱估计算法

通过对梯度格型快速自适应算法的研究,结合最大熵谱外推目前存在的缺点,将梯度格型算法应用于最大熵谱外推中,并将其与伯格算法进行了比较。     

Approximate dynamic programming solutions with a single network adaptive critic for a class of nonlinear systems

Approximate dynamic programming (ADP) formulation implemented with an adaptive critic (AC)-based neural network (NN) structure has evolved as a powerful technique for solving the Hamilton-Jacobi-Bellman (HJB) equations. As interest in ADP and the AC solutions are escalating with time, there is a dire need to consider possible enabling factors for their implementations. A typical AC structure consists of two interacting NNs, which is computationally expensive. In this paper, a new architecture, called the ‘cost-function-based single network adaptive critic (J-SNAC)’ is presented, which eliminates one of the networks in a typical AC structure. This approach is applicable to a wide class of nonlinear systems in engineering. In order to demonstrate the benefits and the control synthesis with the J-SNAC, two problems have been solved with the AC and the J-SNAC approaches. Results are presented, which show savings of about 50% of the computational costs by J-SNAC while having the same accuracy levels of the dual network structure in solving for optimal control. Furthermore, convergence of the J-SNAC iterations, which reduces to a least-squares problem, is discussed; for linear systems, the iterative process is shown to reduce to solving the familiar algebraic Ricatti equation.     

Guiding students to the right questions: adaptive navigation support in an E‐Learning system for Java programming

Rapid growth of the volume of interactive questions available to the students of modern E‐Learning courses placed the problem of personalized guidance on the agenda of E‐Learning researchers. Without proper guidance, students frequently select too simple or too complicated problems and ended either bored or discouraged. This paper explores a specific personalized guidance technology known as adaptive navigation support. We developed JavaGuide, a system, which guides students to appropriate questions in a Java programming course, and investigated the effect of personalized guidance a three‐semester long classroom study. The results of this study confirm the educational and motivational effects of adaptive navigation support.     

ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi...     

一种基于自适应量化嵌入器的隐写方法

感知质量和容量一直是图像隐写算法设计中难以折中的两个要素,如何取得更好的综合性能已吸引了很多研究者的兴趣.提出一种基于自适应量化嵌入器的隐写方法.这一方法通过改变某一载体信号所在子空间的索引来调制秘密信息,自适应特性体现在决定着子空间尺寸的分割码本的设计上.将这种隐写方法用于以2×2图像块为单元的数字图像隐写算法设计中,并将分割码本设计得具备HVS特性以取得较好的折中效果.实验表明,算法在感知质量和容量方面具有较好的综合性能.     

基于FPGA的高速自适应滤波器的实现

在LMS算法进行变步长处理的基础上,结合驰豫超前流水线技术和时序重构技术提出了创新结构和改进算法,在FPGA的仿真综合环境中设计实现了该高速自适应滤波器,并且在AlteraDE2-70开发板上进行了板级测试。     

直埋玻璃钢聚氨酯保温管及其保温层厚度设计

介绍了直埋玻璃钢聚氨酯保温管的结构形式及优良性能．为了降低玻璃钢聚氨酯保温管的初期投资,探讨了直埋玻璃钢聚氨酯热力管保温层的2种设计方法,并采用工程实例进行计算．结果表明,按双层保温计算法设计保温层更为经济合理．以上结论为直埋玻璃铜聚氨酯保温管保温层设计提供了理论依据．     

Combination of non-classical pseudospectral and direct methods for the solution of brachistochrone problem

In this paper, we propose a combination of non-classical pseudospectral and direct methods to find the solution of brachistochrone problem. The method converts the optimal control problem of brachistochrone, into a sequence of quadratic programming problems. To this end, the quasilinearization method is used to replace the nonlinear optimal control problem into a sequence of constrained linear-quadratic optimal control problems; then each of the state variables is approximated by a weighted interpolation function based on the non-classical orthogonal polynomials. The method gives the information of the quadratic programming problems explicitly (the Hessian and the gradient of the cost function). Using this method, the solution of the brachistochrone problem is compared with those in the literature.