生活中的化学课程建设调查——以赤峰学院为例

本文分析了所发出并收回的关于《生活中的化学》课程的353份调查问卷,问卷主要为态度题和印象题。态度题包括对课程内容、课堂模式、考核方式与知识分享方式。印象题涉及班型、对课程本身的印象(未开本课程的学生)。本文逐一分析了每个题每个学院的选择意愿和比例情况,并对文理科分别总结和分析,也对总的结果进行了解读。所有的结果都表明,我校学生对本课程热情很高。对课程内容的支持率均超过90%,他们愿意为了家人的安全、食品安全、洗化用品安全而学习本课程,并愿意与人分享,只是对考核方式和课堂模式有所存疑,但所占比例不大,这一点我们需要在教学中进一步磨合、改进。

Optimal sensor scheduling for hybrid estimation

A sensor scheduling problem was considered for a class of hybrid systems named as the stochastic linear hybrid system （SLHS）. An algorithm was proposed to select one （or a group of） sensor at each time from a set of sensors. Then, a hybrid estimation algorithm was designed to compute the estimates of the continuous and discrete states of the SLHS based on the observations from the selected sensors. As the sensor scheduling algorithm is designed such that the Bayesian decision risk is minimized, the true discrete state can be better identified. Moreover, the continuous state estimation performance of the proposed algorithm is better than that of hybrid estimation algorithms using only predetermined sensors. Finallyo the algorithms are validated through an illustrative target tracking example.

An optimizing algorithm of static task scheduling problem based on hybrid genetic algorithm

To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.

Nonlinear Diffusion and Transient Osmosis

We investigate both analytically and numerically the concentration dynamics of a solution in two containers connected by a narrow and short channel, in which diffusion obeys a porous medium equation. We also consider the variation of the pressure in the containers due to the flow of matter in the channel. In particular, we identify a phenomenon, which depends on the transport of matter across nano-porous membranes, which we call ＂transient osmosis＂. We find that nonlinear diffusion of the porous medium equation type allows numerous different osmotic-like phenomena, which are not present in the case of ordinary Fickian diffusion. Experimental results suggest one possible candidate for transiently osmotic processes.

Towards a Dynamic Controller Scheduling-Timing Problem in Software-Defined Networking

Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.

ON STABILITY AND REGULARIZATION FOR BACKWARD HEAT EQUATION

Consider a backward heat equation in a bounded domain Ω (?) R2 with the noisy data in the initial time geometry. The aim is to find the temperature for 0 < ε < t < T. For this ill-posed problem, the authors give a continuous dependence estimate of the solution. Moreover, the convergence rate of the approximate solution is also given.

On a Nonlinear Model in Adiabatic Evolutions

In this paper, we study a kind of nonlinear model of adiabatic evolution in quantum search problem. As will be seen here, for this problem, there always exists a possibility that this nonlinear model can successfully solve the problem, while the linear model can not. Also in the same setting, when the overlap between the initial state and the final stare is sufficiently large, a simple linear adiabatic evolution can achieve O(1) time efficiency, but infinite time complexity for the nonlinear model of adiabatic evolution is needed. This tells us, it is not always a wise choice to use nonlinear interpolations in adiabatic algorithms. Sometimes, simple linear adiabatic evolutions may be sufficient for using.