Attentional negativity bias moderated by positive mood arousal

Automatically allocation of more attention to negative stimuli is called emotional negativity bias. An event-related potentials (ERPs) experiment investigated whether or not this bias was altered by positive mood arousal. The results suggested that the attention bias towards negative stimuli was attenuated when positive information was accessible.     

基于虚拟仪器的信号发生器系统设计

介绍了一种基于AD9852的多路高频信号发生器,通过CAN总线将各个信号发生模块连接到上位机,由上位机控制各个模块产生高频信号。     

An Analysis of an SIRS Epidemic Model with General Direct Immunization in Networks北大核心CSCD

We consider an SIRS epidemic model with a general direct immunization rate on networks. By constructing suitable Lyapunov functions, we find that the dynamical behvaior of the model is completely determined by the epidemic threshold λc. When λ≤λc, the disease-free equilibrium is globally asymptotically stable; when λ>λc, the endemic equilibrium is globally asymptotically stable. In addition, we propose a uniform direct immunization and a targeted direct immunization. The results show that under the same average immunization rate s there exists a critical immunization-lost rate δc so that the epidemic threshold of the targeted direct immunization is smaller (larger) than that of the uniform direct immunization if δ<δc(δ>δc). © 2017, The Journal of Agency of Complex Systems and Complexity Science. All right reserved.     

Non-fragile decentralized H∞ controller design for uncertain linear systems

Considering the design problem of non-fragile decentralized H∞ controller with gain variations, the dynamic feedback controller by measurement feedback for uncertain linear systems is constructed and studied. The parameter uncertainties are considered to be unknown but norm bounded. The design procedures are investigated in terms of positive definite solutions to modify algebraic Riccati inequalities. Using information exchange among local controllers, the designed non-fragile decentralized H∞ controllers guarantee that the uncertain closed-loop linear systems are stable and with H∞ -norm bound on disturbance attenuation. A sufficient condition that there are such non-fragile H∞ controllers is obtained by algebraic Riccati inequalities. The approaches to solve modified algebraic Riccati inequalities are carried out preliminarily. Finally, a numerical example to show the validity of the proposed approach is given.     

Exploration of TCM Masters Knowledge Mining

Traditional Chinese medicine （TCM） has a rich knowledge about human health and disease by its special way evolved along a very long history. As modern medicine is achieving much progress, arguments and disputes toward TCM never end. To avoid losing precious knowledge of living TCM masters, endeavors have been engaged to systematic collection of those knowledge of TCM masters, such as their growth experiences, effective practical cases toward diseases and typical therapeutic principles and methods. Knowledge mining methods have been expected to explore some useful or hidden patterns to unveil some mysteries of the TCM system. In the paper, some computerized methods are applied toward those collected materials about some living TCM masters in China mainland to show a different way of exposing essential ideas of those TCM masters by correspondence visualization which aims to help people understand TCM holistic views toward disease and body, and facilitate tacit knowledge transfer and sense-making of the essence of TCM. The work is one kind of qualitative meta-synthesis of TCM masters＇ knowledge.     

On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines

The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The authors propose an on-line algorithm and prove that the competitive ratio is 1/2 （2 W √3） ≈ 1.86602.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.     

Optimal maintenance and replacement of extraction machinery

This paper considers a problem of optimal preventive maintenance and replacement schedule of equipment devoted to extracting resources from known deposits. Typical examples are oil drills, mine shovels, etc. At most one replacement of the existing machinery by a new one is allowed. The problem is formulated as an optimal control problem subject to the state constraint that the remaining deposit at any given time is nonnegative. We show that the optimal preventive maintenance, production rates, and the replacement and salvage times of the existing machinery and the new one, if required, can be obtained by solving sequentially a series of free-end-point optimal control problems. Moreover, an algorithm based on this result is developed and used to solve two illustrative examples.     

An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.     

Krylov subspace method based on data preprocessing technology

The performance of adaptive beamforming techniques is limited by the nonhomogeneous clutter scenario. An augmented Krylov subspace method is proposed, which utilizes only a single snapshot of the data for adaptive processing. The novel algorithm puts together a data preprocessor and adaptive Krylov subspace algorithm, where the data preprocessor suppresses discrete interference and the adaptive Krylov subspace algorithm suppresses homogeneous clutter. The novel method uses a single snapshot of the data received by the array antenna to generate a cancellation matrix that does not contain the signal of interest （SOI） component, thus, it mitigates the problem of highly nonstationary clutter environment and it helps to operate in real-time. The benefit of not requiring the training data comes at the cost of a reduced degree of freedom （DOF） of the system. Simulation illustrates the effectiveness in clutter suppression and adaptive beamforming. The numeric results show good agreement with the proposed theorem.