A connectionist implementation of the theory of planned behavior: Association of beliefs with exercise intention.

The theory of planned behavior suggests attitudes are a product of salient beliefs. This study examined whether aggregating salient beliefs was plausible within a more biologically centered information-processing environment. A neural network was used to examine associations among beliefs relating to exercise intention. Data on intentions and behavioral, normative, and control beliefs from 114 respondents were used to train (by error backpropagation) a neural network to associate beliefs with intention. The R2 between the network's estimated and self-reported intention was .66. The network's representation comprised 6 belief profiles associated with high, moderate, or low behavioral intention. The neural network accommodated complex relationships among beliefs and belief-intention associations and indicated how high-level constructs such as attitudes may be viewed as the best fit (compromise state) between aroused beliefs. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Uniform modeling of parameter dependent nonlinear systems

This paper addresses the problem of approximating parameter dependent nonlinear systems in a unified framework. This modeling has been presented for the first time in the form of parameter dependent piecewise affine systems. In this model, the matrices and vectors defining piecewise affine systems are affine functions of parameters. Modeling of the system is done based on distinct spaces of state and parameter, and the operating regions are partitioned into the sections that we call ’multiplied simplices’. It is proven that this method of partitioning leads to less complexity of the approximated model compared with the few existing methods for modeling of parameter dependent nonlinear systems. It is also proven that the approximation is continuous for continuous functions and can be arbitrarily close to the original one. Next, the approximation error is calculated for a special class of parameter dependent nonlinear systems. For this class of systems, by solving an optimization problem, the operating regions can be partitioned into the minimum number of hyper-rectangles such that the modeling error does not exceed a specified value. This modeling method can be the first step towards analyzing the parameter dependent nonlinear systems with a uniform method.     

基于模型设计的数字集群分组数据业务的实现

为解决数字集群通信系统中图像、视频等大数据业务的传输问题,深入分析数字集群空中接口协议栈的结构,重点研究分组数据业务提供者子网相关汇聚协议的结构和原理。基于模型设计方法设计该协议的相关功能模块,并进行编码实现。开发中使用IBM Rational Rhapsody这一基于UML建模的开发工具,使整个开发过程简洁而清晰。最后,通过对协议进行一致性测试,证明协议参数及流程符合数字集群通信系统协议标准。     

Delay‐dependent passivity and passification for uncertain Markovian jump systems with time‐varying delays

This paper deals with the problems of passivity analysis and passivity‐based controller design for Markovian jump systems with both time‐varying delays and norm‐bounded parametric uncertainties. Firstly, new delay‐dependent conditions for the considered system to be passive are obtained by using a mode‐dependent Lyapunov functional and by introducing some slack variables. These conditions are expressed by means of LMIs that are easy to check. It is shown through a numerical example that the obtained passivity conditions are less conservative than the existing ones in the literature. Secondly, the passification problem is investigated. On the basis of the obtained passivity conditions, dynamic output‐feedback controllers are designed, which ensure that the resulting closed‐loop system is passive. The effectiveness of the proposed design method is demonstrated by a numerical example. Copyright © 2011 John Wiley & Sons, Ltd.     

Delay‐dependent stability for Markovian genetic regulatory networks with time‐varying delays

This paper is concerned with the problem of stochastic stability analysis for a class of genetic regulatory networks with Markovian jump parameters and time‐varying delays. A delay‐dependent stability criterion is derived by using a novel mode‐dependent Lyapunov functional. The derived stability criterion is expressed in terms of linear matrix inequalities and is less conservative than the existing ones in the literature. A numerical example is provided to demonstrate the effectiveness of the proposed stability criterion. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Input‐to‐state stability of min‐max MPC scheme for nonlinear time‐varying delay systems

This paper studies the robustness problem of the min–max model predictive control (MPC) scheme for constrained nonlinear time‐varying delay systems subject to bounded disturbances. The notion of the input‐to‐state stability (ISS) of nonlinear time‐delay systems is introduced. Then by using the Lyapunov–Krasovskii method, a delay‐dependent sufficient condition is derived to guarantee input‐to‐state practical stability (ISpS) of the closed‐loop system by way of nonlinear matrix inequalities (NLMI). In order to lessen the online computational demand, the non‐convex min‐max optimization problem is then converted to a minimization problem with linear matrix inequality (LMI) constraints and a suboptimal MPC algorithm is provided. Finally, an example of a truck‐trailer is used to illustrate the effectiveness of the proposed results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Augment low-field intra-operative MRI with preoperative MRI using a hybrid non-rigid registration method

Background

Preoperatively acquired diffusion tensor image (DTI) and blood oxygen level dependent (BOLD) have been proved to be effective in providing more anatomical and functional information; however, the brain deformation induced by brain shift and tumor resection severely impairs the correspondence between the image space and the patient space in image-guided neurosurgery.

Method

To address the brain deformation, we developed a hybrid non-rigid registration method to register high-field preoperative MRI with low-field intra-operative MRI in order to recover the deformation induced by brain shift and tumor resection. The registered DTI and BOLD are fused with low-field intra-operative MRI for image-guided neurosurgery.

Results

The proposed hybrid registration method was evaluated by comparing the landmarks predicted by the hybrid registration method with the landmarks identified in the low-field intra-operative MRI for 10 patients. The prediction error of the hybrid method is 1.92 ± 0.54 mm, and the compensation accuracy is 74.3 ± 5.0%. Compared to the landmarks far from the resection region, those near the resection region demonstrated a higher compensation accuracy (P-value = .003) although these landmarks had larger initial displacements.

Conclusions

The proposed hybrid registration method is able to bring preoperatively acquired BOLD and DTI into the operating room and compensate for the deformation to augment low-field intra-operative MRI with rich anatomical and functional information.     

Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model

This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II.     

位置相关信息服务中的一种数据预取方法

位置相关信息服务中访问数据涉及到复杂的空间计算,导致访问数据的延迟时间较长,而数据预取能够显著提高数据的访问速度,缩短访问数据的时间。基于LDD的预取策略如DDP考虑了数据距离,但是没有考虑数据的访问概率和更新频率及数据大小。针对以上问题提出基于价值的数据预取（CDP）策略,一些重要的数据预取因素如访问概率、更新频率、数据项大小、数据距离和有效范围等都包含在价值函数里,根据价值函数值的大小来选择被预取的数据。通过实验对比,CDP比DDP策略能更有效的提高缓存命中率。