离子推力器栅极组件热变形测量方法

栅极组件是离子推力器的核心部件,其所包含的多层栅极结构在工作过程中会发生热变形,导致栅极间距发生改变,进而影响离子推力器的工作性能及寿命。为了实现栅极结构在实际工况下热变形的非接触测量与评估,本研究提出了基于摄像测量的栅极变形观测方法,评价了不同图像分析方法（灰度重心法、圆拟合法、灰度匹配法）对变形测量精度的影响。结果表明灰度匹配方法观测精度高,环境适应性好;同时,设计并实现了一套栅极热变形环境模拟与变形测量系统,可实现高温、通水、通气环境下变形的高精度观测。最后,对环境箱通水通气对测量精度的影响进行了评价,结果表明二者均会对测量精度造成影响,通水对实验结果的影响大于通气的影响。     

考虑地质分层约束的长短期记忆循环神经网络测井曲线重构

延长油田东部裸眼井区早期测井资料普遍只有自然电位（SP）、自然伽马（GR）及梯度电阻率(R2.5)三条曲线,因缺失声波（AC）、地层电阻率（RT）等测井曲线,难以满足精细油藏地质研究需求。东部裸眼井区开发时间长、单井产量低,重新测井缺乏可行性及经济性。采用长短期记忆循环神经网络(Long Short-Term Memory,LSTM)进行缺失测井曲线重构是一种经济有效方法,适用于地层测井序列数据。然而延长油田东部浅层油藏上覆黄土层段测井数据信号干扰大,直接应用模型精度较差。针对此问题,本文采用考虑地质分层约束的LSTM模型进行缺失测井曲线的重构,通过分层数据截取每口井长6层段测井数据作为样本数据,既保留了LSTM模型处理序列数据的优势,同时又避免了上覆黄土层测井数据对模型的干扰。利用裸眼井区完整测井数据进行模型训练优化和验证,讨论了考虑地质分层约束的LSTM测井曲线重构精度,结果表明通过引入地质分层约束,模型重构测井曲线精度更高。应用优化后模型实现裸眼井区50口仅有GR、SP、R2.5三条曲线数据井的AC、RT曲线重构,对50口井的142个射孔段进行二次解释,对比试油解释结论符合率达到89.4%,验证了该方法对测井曲线重构的实用性和有效性。     

基于孤岛划分约束的有源配电网故障恢复策略

为提高供电恢复效果,更好地应对当前有源配电网信息-物理耦合程度不断加深的形势,提出了一种考虑信息流、能量流、业务流多流融合以及智能软开关(soft open point,SOP)作用的孤岛划分算法,基于该算法实现供电恢复策略。首先,为保证负荷的可靠恢复,该策略深入研究信息-物理耦合并建模,对节点信息重要度排序,讨论其对负荷恢复的影响;其次,构建了SOP的稳态模型,分析了SOP的工作原理及控制模式;接着,为了更大程度、更加灵活地恢复负荷,考虑SOP的作用,建立考虑光伏时变性及负荷运行特性的有源配电网孤岛划分模型;最后,算例仿真验证所提策略的有效性。     

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.     

高斯杂波中距离扩展目标的模糊CFAR检测

为提高高分辨雷达的检测性能,提出了一种高斯杂波背景下距离扩展目标的模糊检测方法。该方法采用模糊恒虚警率(constant false alarm rate, CFAR)检测器代替传统的二进制CFAR检测器,将距离单元值转换成映射到虚警空间的模糊隶属函数值,然后采用模糊积累准则进行积累,得到检测统计量。研究了模糊代数积、模糊代数和两种积累准则,推导出这两种方法虚警概率的数学解析式。仿真结果表明,高斯杂波背景下模糊代数积积累较双门限二进制积累可获得近2 dB的性能改善。同时,模糊检测方法只采用单个检测门限,具有易于调节的优点。     

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.     

一种基于小波的互连线模型自适应约减算法

基于偏微分方程的谱分解理论,针对VLSI中的互连线系统,提出了一种基于小波的自适应模型约减算法,选取逼近空间的一组基函数,通过积分合同变换,从而得到一个能够逼近原无穷维系统的有限低阶无源模型.该算法在不需要对互连线进行离散处理的情况下,能直接对非均匀互连线系统进行约减;利用了小波的多尺度和紧支撑特性,并采用自适应机制来平衡逼近精度和计算效率的矛盾.理论分析和数值仿真说明了该方法的有效性.     

Interval Time Series Analysis with an Application to the Sterling-Dollar Exchange Rate

Traditional econometrics has long employed ＂points＂ to measure time series data. In real life situations, however, it suffers the loss of volatility information, since many variables are bounded by intervals in a given period. To address this issue, this paper provides a new methodology for interval time series analysis. The concept of ＂interval stochastic process＂ is formally defined as a counterpart of ＂stochastic process＂ in point-based econometrics. The authors introduce the concepts of interval stationarity, interval statistics （including interval mean, interval variance, etc.） and propose an interval linear model to investigate the dynamic relationships between interval processes. A new interval-based optimization approach for estimation is proposed, and corresponding evaluation criteria are derived. To demonstrate that the new interval method provides valid results, an empirical example on the sterling-dollar exchange rate is presented.