Analytical study on cantilever resonance type magnet-integrated sensor device for micro-magnetic field detection

A beam-shaped cantilever resonance type magnetic sensor device has been proposed with a micro magnet. Two structural designs, named as design 1 and design 2, have been comparatively analyzed using ANSYS in order to obtain larger frequency shifts (higher magnetism sensitivity) due to the applied exterior magnetic field. The analytical results show that, in the range of 0–10 mT, the frequency shifts are small, while under 100 mT, a relatively larger frequency shift of about 30 Hz can be theoretically obtained. The power consumption of the proposed devices has been further theoretically studied for preliminary understanding. Using the well-known displacement equations, the estimated power consumption is around 0.21 μW, which is very lower than that of the reported magnetic field sensors. This implies that it is possible to fabricate higher sensitive magnetic field sensor with lower power consumption.     

一种用于大数据分析服务的启发式云爆发算法

基于异构云联合的并行化大数据分析服务可以提升性能。然而由于大数据网络传输存在较大时延,原则上必须在并行化水平和大数据分析性能之间进行折衷。鉴于此,提出一种启发式云爆发算法用于并行化大数据分析服务。首先确定联合云中哪些计算结点应该用于大数据分析并行处理,然后将大数据妥善地分配给这些计算结点,确保处理同步完成且性能最优,最后,确定被分配的不同大小数据块在各个结点的计算次序,确保数据块传输尽量在结点上一数据块计算期间完成。与其他负载均衡算法做了对比,结果表明,使用该算法后性能可提升20%~60%。     

基于社交属性的访问控制系统研究与实现

随着社交化的推进,社交网络平台在结构和业务特征上出现了新的特点。通过对社交网络业务环境的访问控制需求进行分析,结合访问控制的最新发展方向研究设计适合社交网络业务环境系统的访问控制方案,从而实现社交网络平台中的权限的灵活管理,为社交网络业务环境中的安全保护提供访问控制解决方案。     

EAST电源数据采集控制系统的设计与实现

随着EAST装置不断升级,现有的电源数据采集及其控制系统已不能满足等离子体长时间放电要求,需设计新型EAST电源数据采集控制系统.该控制系统采用LAMP架构,对采集参数管理加入多种安全验证,实现了数据采集系统的远程启动、实时监测、异常检测、故障恢复和日志管理,解决了原有系统移植性差和安全性弱等问题;此外通过对实验数据进行有效性分析,并对有效实验数据的关键参数进行统计,实现了基于数据内容的检索.实验结果表明,该系统能够稳定运行,可有效降低人为故障,缩短异常处理时间,具备良好的扩展性和移植性,对EAST其他子装置的数据采集及其控制系统的升级有很好的参考价值.     

基于Aspen Plus的聚甲氧基二甲醚精馏过程模拟分析

在装有θ环填料的精馏塔内进行了聚甲氧基二甲醚精馏实验。利用化工流程模拟软件.AspenPlus对聚甲氧基二甲醚精馏过程进行模拟,首先,采用DsTWU简捷蒸馏模型,运用软件中NRTL、WILSON、UNIQUAC,3种物性方法对精馏塔进行了计算,得到了回流比、塔板数和温度等操作参数。接着,采用RadFrac严格精馏模型对精馏塔进行了验证,其计算结果与实验结果吻合良好,满足工艺要求。最后,对精馏塔的操作变量进行了灵敏度分析,讨论了进料位置、进料流率和回流比等参数对精馏分离要求与能耗的影响,并确定了最优化方案,即:进料板为第50块,进料流率为35 mol/h,回流比为6。     

介观模拟研究温度对DPPC磷脂双层膜结构的影响

生物膜作为生物体的一种基本组成单元,在各种生命活动中占据重要地位。生物膜的结构和功能的稳定性是其发挥一切生理功能的前提。本文以DPPC磷脂双分子层为生物膜模型,采用基于Martini力场的粗粒化模拟方法,考察了温度对DPPC磷脂双层膜结构、形态和功能的影响。结果表明,315 K为DPPC磷脂双层膜的相转变温度;温度升高,DPPC分子间隙增加,尾链发生折叠弯曲,引起脂均面积增大,厚度减小,流动性增加;DPPC双层膜中甘油酯基团组成的栅栏区为膜中分子排列最有序的区域,也是阻碍小分子透膜的主要屏障区。研究结果不仅有助于更好地阐释生物膜的结构形态和功能之间的关系,也有助于理解药物与膜的相互作用,指导临床用药。     

基于地址-事件表示的高速二值连通域标记方法

为提高二值连通域标记的速度,将地址-事件表示AER（Address Event Representation）思想引入到二值图像处理,提出了一种基于事件对等价标号的二值连通域标记方法。该算法无需多次遍历图像中的背景点和冗余目标点,首先将待标记的连通域以AER“事件对”的方式编码保存,通过“事件对”的遍历生成临时标号和等价标记表;然后根据等价表修改临时标号;完成标号映射后最终实现连通域标记。整个算法只处理极低冗余的事件信息,避免了对全图像素的重复扫描与处理。实验结果表明,图像以AER“事件对”方式存储,数据量仅为全帧图像的10%~35%,有较高的压缩比;且该算法速度快,可达到了传统基于等价标号算法的1.5~8倍。     

Think,feel, bid: the impact of environmental conditions on the role of bidders’ cognitive and affective processes in auction bidding

Environmental conditions and the interplay of cognitive and affective processes both exert influences on bidding behavior. This paper brings the above together, considering how the (external) auction environment determines the impact of (internal) cognitive and affective processes on bidding behavior, assessed in comparison to the optimal bid. Two aspects of the auction environment were considered, namely auction dynamics (low: first-price sealed-bid auction, high: Dutch auction) and value uncertainty (low, high). In a laboratory experiment, we assess bidders’ cognitive workload and emotional arousal through physiological measurements. We find that higher auction dynamics increase the impact of emotional arousal on bid deviations, but not that of cognitive workload. Higher value uncertainty, conversely, increases the impact of cognitive workload on bid deviations, but not that of emotional arousal. Taken together, the auction environment is a critical factor in understanding the nature of the underlying decision process and its impact on bids.     

Quantum commitments from complexity assumptions

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time.     

Factors of low individual degree polynomials

Kaltofen (Randomness in computation, vol 5, pp 375–412, 1989) proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas also have small arithmetic formulas, asked in Kopparty et al. (2014), and the question of bounding the depth of the circuits computing the factors of a polynomial. We are able to answer these questions in the affirmative for the interesting class of polynomials of bounded individual degrees, which contains polynomials such as the determinant and the permanent. We show that if \({P(x_{1},\ldots,x_{n})}\) is a polynomial with individual degrees bounded by r that can be computed by a formula of size s and depth d, then any factor \({f(x_{1},\ldots, x_{n})}\) of \({P(x_{1},\ldots,x_{n})}\) can be computed by a formula of size \({\textsf{poly}((rn)^{r},s)}\) and depth d + 5. This partially answers the question above posed in Kopparty et al. (2014), who asked if this result holds without the dependence on r. Our work generalizes the main factorization theorem from Dvir et al. (SIAM J Comput 39(4):1279–1293, 2009), who proved it for the special case when the factors are of the form \({f(x_{1}, \ldots, x_{n}) \equiv x_{n} - g(x_{1}, \ldots, x_{n-1})}\). Along the way, we introduce several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas).