Microstructure,Rheology, and Potential Oil Absorbency of Poly(Butyl Methacrylate) and Poly(Hydroxyethyl Methacrylate) Blends

To prepare oil-absorptive polymers with moderate cross-linking structure, poly(butyl methacrylate) (PBMA) was synthesized as a linear hydrophobic polymer by suspension polymerization. In addition, hydroxyethyl methacrylate (HEMA), as a monomer, which could construct a network structure among the macromolecules via hydrogen bond interactions, was solution polymerized in dimethylacetamide (DMAc) with PBMA, yielding a polymer blend of PBMA and PHEMA. The solution of the polymer blend was investigated by rotational viscometry and extended rheometry. The results showed that the viscosity varied greatly with the temperature and shear rate for three different compositions. Fourier transform infrared (FTIR) spectra indicated that an entanglement or interlocking cross-linking structure of molecular chains was constructed by hydrogen bonds. The results from nuclear magnetic resonance (NMR) spectra exhibited a downfield movement of the proton peak as influenced by end groups or hydroxyls in the polymer chains. The rheological measurements demonstrated that the cross-linking structure greatly affected the rheological behavior of the blend solution. In addition, the cross-linking structure was also evaluated by oil absorbency of films.     

Overview of DWDM/ODC Project

Abstract

This article introduces the main achievements resulting from the DWDM/ODC project. The five areas of research activity within the DWDM/ODC project cover some of the main issues of design and development of dense wavelength division multiplexing systems for transparent optical networks. These issues are: performance assessment with arbitrary optical filtering; performance of signaling formats; dispersion compensation strategies for directly and externally modulated systems in presence of nonlinear transmission-induced degradation; and the impact of noise and crosstalk in the extent of transparent optical networks. All five areas of research activity have contributed significantly to a better understanding of the limitations present in dense wavelength division multiplexing systems.     

Control and scheduling in a two-station queueing network: Optimal policies and heuristics

Consider a two-station queueing network with two types of jobs: type 1 jobs visit station 1 only, while type 2 jobs visit both stations in sequence. Each station has a single server. Arrival and service processes are modeled as counting processes with controllable stochastic intensities. The problem is to control the arrival and service processes, and in particular to schedule the server in station 1 among the two job types, in order to minimize a discounted cost function over an infinite time horizon. Using a stochastic intensity control approach, we establish the optimality of a specific stationary policy, and show that its value function satisfies certain properties, which lead to a switching-curve structure. We further classify the problem into six parametric cases. Based on the structural properties of the stationary policy, we establish the optimality of some simple priority rules for three of the six cases, and develop heuristic policies for the other three cases.     

Approximate Entropy of Brain Network in the Study of Hemispheric Differences

Human brain, a dynamic complex system, can be studied with different approaches, including linear and nonlinear ones. One of the nonlinear approaches widely used in electroencephalographic (EEG) analyses is the entropy, the measurement of disorder in a system. The present study investigates brain networks applying approximate entropy (ApEn) measure for assessing the hemispheric EEG differences; reproducibility and stability of ApEn data across separate recording sessions were evaluated. Twenty healthy adult volunteers were submitted to eyes-closed resting EEG recordings, for 80 recordings. Significant differences in the occipital region, with higher values of entropy in the left hemisphere than in the right one, show that the hemispheres become active with different intensities according to the performed function. Besides, the present methodology proved to be reproducible and stable, when carried out on relatively brief EEG epochs but also at a 1-week distance in a group of 36 subjects. Nonlinear approaches represent an interesting probe to study the dynamics of brain networks. ApEn technique might provide more insight into the pathophysiological processes underlying age-related brain disconnection as well as for monitoring the impact of pharmacological and rehabilitation treatments.     

A Survey of Information Entropy Metrics for Complex Networks

Information entropy metrics have been applied to a wide range of problems that were abstracted as complex networks. This growing body of research is scattered in multiple disciplines, which makes it difficult to identify available metrics and understand the context in which they are applicable. In this work, a narrative literature review of information entropy metrics for complex networks is conducted following the PRISMA guidelines. Existing entropy metrics are classified according to three different criteria: whether the metric provides a property of the graph or a graph component (such as the nodes), the chosen probability distribution, and the types of complex networks to which the metrics are applicable. Consequently, this work identifies the areas in need for further development aiming to guide future research efforts.     

受扰统一混沌系统基于RBF网络的主动滑模控制

针对受外扰影响的统一混沌系统,提出一种基于径向基函数(RBF)神经网络的主动滑模自适应控制方法.将被控系统分解为受控子系统和自由子系统,利用主动控制思想,建立受控子系统在目标点处的状态误差的可控标准型,设计出一个结构简单的基于滑模趋近率在线参数整定的RBF函数神经网络控制器,并且基于Lyapunov稳定性理论分析了系统的稳定性.仿真结果表明该控制器对系统参数突变和外部干扰具有鲁棒性,同时抑制了抖振. 关键词： 统一混沌系统 主动控制 滑模控制 RBF网络     

Unified Model for Generation Complex Networks with Utility Preferential Attachment

In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics ofthis new network are given.     

Event-based state estimation for a class of complex networks with time-varying delays: A comparison principle approach

The paper is concerned with the state estimation problem for a class of time-delayed complex networks with event-triggering communication protocol. A novel event generator function, which is dependent not only on the measurement output but also on a predefined positive constant, is proposed with hope to reduce the communication burden. A new concept of exponentially ultimate boundedness is provided to quantify the estimation performance. By means of the comparison principle, some sufficient conditions are obtained to guarantee that the estimation error is exponentially ultimately bounded, and then the estimator gains are obtained in terms of the solution of certain matrix inequalities. Furthermore, a rigorous proof is proposed to show that the designed triggering condition is free of the Zeno behavior. Finally, a numerical example is given to illustrate the effectiveness of the proposed event-based estimator.     

基于休眠机理的三维小基站蜂窝网络能效优化

小基站通常部署在写字楼、商贸区等城市密集区域以弥补传统宏基站在覆盖和传输方面的不足.小基站的分布一般是根据高峰时的网络负荷设计的,这必然导致网络负荷较低时的资源浪费.讨论了在平均接入率和信道容量双重约束下基于休眠机理的三维小基站蜂窝网络的能效优化问题.借助泊松点过程理论推导了三维小基站网络下行信道容量和平均接入率的数学表达式.通过分析下行信道容量和平均接入率的单调性得出同时满足传输信道容量和接入率要求的最佳休眠概率.分析了小基站最大用户连接数的最佳值,通过对该参数的合理配置,可以在满足通信指标的前提下最大程度地降低网络能耗.仿真结果表明,设计的基站休眠机理可以使小基站网络的能耗下降约21%.     

Community detection in signed networks based on discrete-time model

Community detection in signed networks has been studied widely in recent years. In this paper, a discrete difference equation is proposed to imitate the consistently changing phases of the nodes. During the interaction, each node will update its phase based on the difference equation. Each node has many different nodes connected with it, and these neighbors have different influences on it. The similarity between two nodes is applied to describe the influences between them. Nodes with high positive similarities will get together and nodes with negative similarities will be far away from each other.Communities are detected ultimately when the phases of the nodes are stable. Experiments on real world and synthetic signed networks show the efficiency of detection performance. Moreover, the presented method gains better detection performance than two existing good algorithms.