带钢窄边线状裂纹缺陷的形成原因及预防措施

本文通过对带钢窄边线状裂纹缺陷的金相显微组织观察和扫描电镜与能谱分析，确定了带钢窄边线状裂纹缺陷的形成原因，并针对原因提出了相应的预防措施，有效地控制了带钢窄边线状裂纹缺陷的重复发生。     

聚酯－聚醚嵌段共聚物的合成及抗静电性能研究

研究和分析了ＰＥＧ分子量、加料次序、反应时间和温度、物料比例、分散剂和固相缩聚等因素对ＰＥＴ－ＰＥＧ嵌段共聚物分子量和耐水性的影响。合成的嵌段共聚酯醚与ＰＥＴ共混纺丝可以显著改善ＰＥＴ纤维的抗静电性能。     

两栖装甲装备故障诊断智能检测系统设计

针对目前两栖装甲装备故障检测时间长、检测效率低的缺点,研究设计了一种两栖装甲装备故障诊断智能检测系统。系统充分利用现代最新发展的大规模集成电路技术和数字处理技术,对多发、易发故障部位的故障信号进行采样、检测及处理,从而快速确定故障部位,便于及时排除故障。     

基于互补原理确定黄土高原Budyko方程的流域特性参数

Budyko方程的流域特性参数一般根据植被覆盖度等下垫面特征进行确定,但相关资料不易获取。本文针对黄土高原地区29个小流域,通过分析流域特性参数、植被覆盖度和互补关系中大气湿润指数之间的关系发现,大气湿润指数能够间接反映植被覆盖度的大小,进而能够利用常规气象数据确定流域特性参数,并拟合出了经验公式。相比采用固定流域特性参数,这种方法能够提高Budyko方程对实际蒸散发量的模拟效果。相比于植被覆盖度等下垫面资料,常规气象数据时间序列长、且更易获取,因此本方法具有较好的应用前景。     

A deep multi-source adaptation transfer network for cross-subject electroencephalogram emotion recognition

Neural Computing and Applications - In real-world application of affective brain–computer interface (aBCI), individual differences across subjects and non-stationary characteristics of...     

Blind estimation of the PN sequence in lower SNR DS-SS signals with residual carrier

This paper presents a method of singular value decomposition (SVD) plus digital phase lock loop (DPLL) to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS, DS) signals with residual carrier. Of course, the method needs to know the parameters of DS signal, such as the period and code rate of PN sequence. Firstly, the received signal is sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. Then, an autocorrelation matrix is computed and accumulated by the signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of this autocorrelation matrix. Furthermore, a DPLL is used to deal with the estimated PN sequence with residual carrier, it estimates and tracks the residual carrier, removes the residual carrier in the end. Theory analysis and computer simulation results show that this method can effectively realize the PN sequence estimation from the input DS signals with residual carrier in lower SNR.     

Register allocation for write activity minimization on non-volatile main memory for embedded systems

Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average.     

Integer linear programming optimization of joint RRM policies for heterogeneous wireless systems

Wireless systems will be characterized by the coexistence of heterogeneous Radio Access Technologies (RATs) with different, but also complementary, performance and technical characteristics. These heterogeneous wireless networks will provide network operators the possibility to efficiently and coordinately use the heterogeneous radio resources, for which novel Joint Radio Resource Management (JRRM) policies need to be designed. In this context, this work proposes and evaluates a JRRM policy that simultaneously determines for each user an adequate combination of RAT and number of radio resources within such RAT to guarantee the user/service QoS requirements, and efficiently distribute the radio resources considering a user fairness approach aimed at maximizing the system capacity. To this aim, the JRRM algorithm, which takes into account the discrete nature of radio resources, is based on integer linear programming optimization mechanisms.     

Usable optimistic fair exchange

Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance.