室温磁制冷主动式磁蓄冷器数值模拟

提出了一个研究工作参数、设计参数对主动式磁蓄冷器(AMR)制冷性能影响的数值模型。三个主要参数包括:质量流量m、频率f、蓄冷器孔隙率ε,被用来表征AMR的制冷能力。数值模拟的结果表明:对一个AMR而言,存在一个最佳孔隙率;在某一确定孔隙率条件下,AMR存在最佳换热流体质量流量和最佳工作频率;与高频相比,AMR在较低频率下有更好的制冷性能,一味提高频率并不一定能提高AMR的制冷量。模拟结果对磁制冷样机的设计、工作参数的选择有很大的指导意义。     

近玻尔速度Ne2+离子穿过碳膜引起的电子发射

本文测量了入射能为2–25 keV/u的Ne²⁺离子穿过不同厚度碳膜诱导的前向、后向 (分别对应出射表面和入射表面) 电子发射产额. 实验中通过改变炮弹离子的能量, 系统的研究了势能沉积、电子能损以及反冲原子对前向、后向电子发射产额的贡献. 结果表明, 离子的势能沉积只对后向电子发射有贡献, 前向、后向电子发射产额分别与Ne²⁺离子在薄膜出射、入射表面的电子能损近似成正比关系, 其中电子能损很低 (对应于离子能量很低) 的时候, 反冲原子对电子发射的贡献不能忽略. 关键词： 近玻尔速度 电子发射 电子能损 反冲原子     

能动磨盘变形检测中的各误差因素分析

针对现有f530 mm能动磨盘的检测系统（有效检测口径f420 mm）,系统分析了检测过程中的球头误差、传感器安装角度误差和坐标定位误差,并给出了各项误差对检测精度的影响。同时,还针对检测基座不完全水平的问题建立模型,应用最小二乘法实现了检测数据的去倾斜处理。给出了实测数据去倾斜前后和误差补偿前后的检测精度对比情况,结果表明去倾斜算法能较好地还原实测数据,补偿检测中的系统误差有助于提高检测精度。     

Evaluation of ADC measurements among solid pancreatic masses by respiratory-triggered diffusion-weighted MR imaging with inversion-recovery fat-suppression technique at 3.0 T

Purpose

The objective of this paper was to investigate the value of apparent diffusion coefficients (ADCs) for differential diagnosis among solid pancreatic masses using respiratory triggered diffusion-weighted MR imaging with inversion-recovery fat-suppression technique (RT-IR-DWI) at 3.0 T.

Materials and Methods

20 normal volunteers and 72 patients (Pancreatic ductal adenocarcinoma [PDCA, n = 30], mass-forming pancreatitis [MFP, n = 15], solid pseudopapillary neoplasm [SPN, n = 12], and pancreatic neuroendocrine tumor[PNET, n = 15]) underwent RT-IR-DWI (b values: 0 and 600 s/mm²) at 3.0 T. Results were correlated with histopathologic data and follow-up imaging. ADC values among different types of pancreatic tissue were statistically analyzed and compared.

Results

Statistical difference was noticed in ADC values among normal pancreas, MFP, PDCA, SPN and PNET by ANOVA (p < .001). Normal pancreas had the highest ADC value, then followed by PNET, PDCA, MFP and SPN. There was noticeable statistical difference in ADC values among PDCA, MFP and normal pancreas by Least Significant Difference (LSD) (p < .001). ADC of SPN was statistically lower than that of PNET (p = 0.1800 × 10^− 4), PDCA (p = 0.0300 × 10^− 4) and normal pancreas (p = 0.0007 × 10^− 4). ADC of PNET was statistically lower than that of normal pancreas (p = 0.0360) and higher than that of MFP (p = 9.3000 × 10^− 4).

Conclusions

ADC measurements using RT-IR-DWI at 3.0 T may aid to disclose the histopathological pattern of normal pancreas and solid pancreatic masses, which may be helpful in characterizing solid pancreatic lesions.     

The generalized Kupershmidt deformation for constructing new discrete integrable systems

It is known that the KdV6 equation can be represented as the Kupershmidt deformation of the KdV equation. We propose a generalized Kupershmidt deformation for constructing new discrete integrable systems starting from the bi-Hamiltonian structure of a discrete integrable system. We consider the Toda, Kac-van Moerbeke, and Ablowitz-Ladik hierarchies and obtain Lax representations for these new deformed systems. The generalized Kupershmidt deformation provides a new way to construct discrete integrable systems.     

Envelopes and Covers by Modules of Finite FP-Injective Dimensions

Let R be a ring, n a fixed non-negative integer and ? the class of all left R-modules of FP-injective dimensions at most n. It is proved that all left R-modules over a left coherent ring R have ?-preenvelopes and ?-covers. Left (right) ?-resolutions and the left derived functors of Hom are used to study the FP-injective dimensions of modules and rings.     

Full automorphism group of the generalized symplectic graph

Let Fq be a finite field of odd characteristic, m, ν the integers with 1≤m≤ν and Ka 2ν× 2ν nonsingular alternate matrix over Fq. In this paper, the generalized symplectic graph GSp2ν (q, m) relative to K over Fq is introduced. It is the graph with m-dimensional totally isotropic subspaces of the 2ν-dimensional symplectic space F(2ν)q as its vertices and two vertices P and Q are adjacent if and only if the rank of PKQT is 1 and the dimension of P ∩ Q is m-1. It is proved that the full automorphism group of the graph GSp2ν(q, m) is the projective semilinear symplectic group PΣp(2ν, q).     

Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems

The purpose of this paper is to consider the set-valued optimization problem in Asplund spaces without convexity assumption. By a scalarization function introduced by Tammer and Weidner (J Optim Theory Appl 67:297–320, 1990), we obtain the Lagrangian condition for approximate solutions on set-valued optimization problems in terms of the Mordukhovich coderivative.     

Two new triangles of q-integers via q-Eulerian polynomials of type A and B

The classical Eulerian polynomials can be expanded in the basis t ^k?1(1+t) ^n+1?2k (1≤k≤?(n+1)/2?) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian polynomials. In this paper, we prove a q-analogue of this expansion for Carlitz’s q-Eulerian polynomials as well as a similar formula for Chow–Gessel’s q-Eulerian polynomials of type B. We shall give some applications of these two formulas, which involve two new sequences of polynomials in the variable q with positive integral coefficients. It is an open problem to give a combinatorial interpretation for these polynomials.     

DLSTM-Based Successive Cancellation Flipping Decoder for Short Polar Codes

Polar code has been adopted as the control channel coding scheme for the fifth generation (5G), and the performance of short polar codes is receiving intensive attention. The successive cancellation flipping (SC flipping) algorithm suffers a significant performance loss in short block lengths. To address this issue, we propose a double long short-term memory (DLSTM) neural network to locate the first error bit. To enhance the prediction accuracy of the DLSTM network, all frozen bits are clipped in the output layer. Then, Gaussian approximation is applied to measure the channel reliability and rank the flipping set to choose the least reliable position for multi-bit flipping. To be robust under different codewords, padding and masking strategies aid the network architecture to be compatible with multiple block lengths. Numerical results indicate that the error-correction performance of the proposed algorithm is competitive with that of the CA-SCL algorithm. It has better performance than the machine learning-based multi-bit flipping SC (ML-MSCF) decoder and the dynamic SC flipping (DSCF) decoder for short polar codes.