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.     

Adaptive control for a class of nonlinear systems with time-varying delays in state and input

This paper is concerned with the adaptive stabilization problem of uncertain input delayed systems.A solution to this problem is given for a class of uncertain nonlinear systems with time-varying delays in both state and input.An adaptive asymptotically stabilizing controller,which can guarantee the stability of the closed-loop system and the convergence of the original system state,is designed by means of the Lyapunov-Krasovskii functional stability theory combined with linear matrix inequalities (LMIs) an...     

WCDMA直放站数字下变频的FPGA实现

数字下变频器（Digital Down Converter,DDC）是WCDMA直放站的重要组成部分,它将高速采样的数字中频信号下变频到基带,然后进行抽取,低通滤波。重点研究了数字下变频器的数控振荡器NCO和半带滤波器的原理和硬件设计仿真,通过FPGA芯片Virtex-6 XC6VLX75T设计实现了适用于WCDMA直放站的数字下变频器,并对其进行硬件仿真与验证。     

Silicon-based microelectrode arrays for stimulation and signal recording of in vitro cultured neurons

Microelectrode arrays (MEAs) for stimulation and signal recording of in vitro cultured neurons are presented.Each MEA is composed of 60 independent electrodes with 59 working ones and one reference one.These electrodes are divided into 30 pairs.Through each pair of electrodes,four independent states can be realized to define the accessing modes of neurons cultured on the surface of the electrodes.A total MEA covers an area of 10 mm×10 mm.MEAs are fabricated in a silicon-based semiconductor process.An implemented MEA is bonded on a specially designed printed-circuit-board (PCB) and surrounded by a culture chamber.An impedance measurement has been made to verify the electrical characteristics of MEAs.The surface was modified to enhance the biocompatibility.A series of PC12 cells culture experiments validates the effectiveness of the modification.An extracellular signal recording experiment with acetylcholine (Ach) as a stimulant has been carried out,and the results show the feasibility of MEAs for extracellular action potential recording.Extracellular electrical stimulation and recording experiments have been carried out too.They indicate that MEAs can be used for extracellular stimulation,recording,simultaneous stimulation and recording,and isolation of PC12 cells network cultured in vitro.     

政府网站运行的安全性问题研究

本文以政府部门计算机网络和网站在运行中碰到的安全问题,阐述了如何建设相对安全的网控中心,并对因特网上发布信息的网站所受到的各种攻击作出了说明,以及如何采用各种技术方法和措施填补漏洞、防范攻击,保障网站安全。     

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.     

A hybrid trust‐enhanced collaborative filtering recommendation approach for personalized government‐to‐business e‐services

The information overload on the World Wide Web results in the underuse of some existing e‐government services within the business domain. Small‐to‐medium businesses (SMBs), in particular, are seeking “one‐to‐one'' e‐services from government in current highly competitive markets, and there is an imperative need to develop Web personalization techniques to provide business users with information and services specific to their needs, rather than an undifferentiated mass of information. This paper focuses on how e‐governments can support businesses on the problem of selecting a trustworthy business partner to perform reliable business transactions. In the business partner selection process, trust or reputation information is crucial and has significant influence on a business user's decision regarding whether or not to do business with other business entities. For this purpose, an intelligent trust‐enhanced recommendation approach to provide personalized government‐to‐business (G2B) e‐services, and in particular, business partner recommendation e‐services for SMBs is proposed. Accordingly, in this paper, we develop (1) an implicit trust filtering recommendation approach and (2) an enhanced user‐based collaborative filtering (CF) recommendation approach. To further exploit the advantages of the two proposed approaches, we develop (3) a hybrid trust‐enhanced CF recommendation approach (TeCF) that integrates both the proposed implicit trust filtering and the enhanced user‐based CF recommendation approaches. Empirical results demonstrate the effectiveness of the proposed approaches, especially the hybrid TeCF recommendation approach in terms of improving accuracy, as well as in dealing with very sparse data sets and cold‐start users. © 2011 Wiley Periodicals, Inc.     

端到端冗余流量消除技术的指纹选择算法研究

为了兼顾服务器端的内存消耗和有效性,在分析了现有端到端冗余流量消除技术中的指纹选择算法后,提出了贪婪指纹选择算法。该算法认为两个数据包中相同片段的邻接片段很有可能也是相同的,基于这一原理,邻接片段的指纹也将被选为代表指纹,有效地避免了在服务器端缓存整个数据包,大大减少了服务器端的内存消耗。仿真实验结果表明,该算法与现有的指纹选择算法相比,能够大大减少服务器端和用户终端的内存消耗,同时冗余消除率在10%-50%之间,与现有算法相近,证明了该算法的有效性。