Pressure Dependence of Wall Relaxation in Polarized 3^3He Gaseous Cells

We have observed a linear pressure dependence of longitudinal relaxation time ($T_1$) at 4.2 K and 295 K in gaseous $^3$He cells made of either bare pyrex glass or Cs/Rb-coated pyrex due to paramagnetic sites in the cell wall. The paramagnetic wall relaxation is previously thought to be independent of $^3$He pressure. We develop a model to interpret the observed wall relaxation by taking into account the diffusion process, and our model gives a good description of the data

On controllability of neuronal networks with constraints on the average of control gains

Control gains play an important role in the control of a natural or a technical system since they reflect how much resource is required to optimize a certain control objective. This paper is concerned with the controllability of neuronal networks with constraints on the average value of the control gains injected in driver nodes, which are in accordance with engineering and biological backgrounds. In order to deal with the constraints on control gains, the controllability problem is transformed into a constrained optimization problem (COP). The introduction of the constraints on the control gains unavoidably leads to substantial difficulty in finding feasible as well as refining solutions. As such, a modified dynamic hybrid framework (MDyHF) is developed to solve this COP, based on an adaptive differential evolution and the concept of Pareto dominance. By comparing with statistical methods and several recently reported constrained optimization evolutionary algorithms (COEAs), we show that our proposed MDyHF is competitive and promising in studying the controllability of neuronal networks. Based on the MDyHF, we proceed to show the controlling regions under different levels of constraints. It is revealed that we should allocate the control gains economically when strong constraints are considered. In addition, it is found that as the constraints become more restrictive, the driver nodes are more likely to be selected from the nodes with a large degree. The results and methods presented in this paper will provide useful insights into developing new techniques to control a realistic complex network efficiently

Time-and event-driven communication process for networked control systems: A survey

Copyright © 2014 Lei Zou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In recent years, theoretical and practical research topics on networked control systems (NCSs) have gained an increasing interest from many researchers in a variety of disciplines owing to the extensive applications of NCSs in practice. In particular, an urgent need has arisen to understand the effects of communication processes on system performances. Sampling and protocol are two fundamental aspects of a communication process which have attracted a great deal of research attention. Most research focus has been on the analysis and control of dynamical behaviors under certain sampling procedures and communication protocols. In this paper, we aim to survey some recent advances on the analysis and synthesis issues of NCSs with different sampling procedures (time-and event-driven sampling) and protocols (static and dynamic protocols). First, these sampling procedures and protocols are introduced in detail according to their engineering backgrounds as well as dynamic natures. Then, the developments of the stabilization, control, and filtering problems are systematically reviewed and discussed in great detail. Finally, we conclude the paper by outlining future research challenges for analysis and synthesis problems of NCSs with different communication processes.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Semantic Wide and Deep Learning for Detecting Crisis-Information Categories on Social Media

When crises hit, many flog to social media to share or consume information related to the event. Social media posts during crises tend to provide valuable reports on affected people, donation offers, help requests, advice provision, etc. Automatically identifying the category of information (e.g., reports on affected individuals, donations and volunteers) contained in these posts is vital for their efficient handling and consumption by effected communities and concerned organisations. In this paper, we introduce Sem-CNN; a wide and deep Convolutional Neural Network (CNN) model designed for identifying the category of information contained in crisis-related social media content. Unlike previous models, which mainly rely on the lexical representations of words in the text, the proposed model integrates an additional layer of semantics that represents the named entities in the text, into a wide and deep CNN network. Results show that the Sem-CNN model consistently outperforms the baselines which consist of statistical and non-semantic deep learning models

Description of Charged Particle Pseudorapidity Distributions in Pb+Pb Collisions with Tsallis Thermodynamics

The centrality dependence of pseudorapidity distributions for charged particles produced in Au+Au collisions at $\sqrt{s_{NN}}=130$ GeV and 200 GeV at RHIC, and in Pb+Pb collisions at $\sqrt{s_{NN}}=2.76$ TeV at LHC are investigated in the fireball model, assuming that the rapidity axis is populated with fireballs following one distribution function. We assume that the particles in the fireball fulfill the Tsallis distribution. The theoretical results are compared with the experimental measurements and a good agreement is found. Using these results, the pseudorapidity distributions of charged particles produced in Pb+Pb central collisions at $\sqrt{s_{NN}}=5.02$ TeV and 10 TeV are predicted.Comment: 9 pages, 8 figure