Storage time affects the level and diagnostic efficacy of plasma biomarkers for neurodegenerative diseases

Several promising plasma biomarker proteins,such as amyloid-β(Aβ),tau,neurofilament light chain,and glial fibrillary acidic protein,are widely used for the diagnosis of neurodegenerative diseases.However,little is known about the long-term stability of these biomarker proteins in plasma samples stored at-80°C.We aimed to explore how storage time would affect the diagnostic accuracy of these biomarkers using a large cohort.Plasma samples from 229 cognitively unimpaired individuals,encompassing healthy controls and those experiencing subjective cognitive decline,as well as 99 patients with cognitive impairment,comprising those with mild cognitive impairment and dementia,were acquired from the Sino Longitudinal Study on Cognitive Decline project.These samples were stored at-80°C for up to 6 years before being used in this study.Our results showed that plasma levels of Aβ42,Aβ40,neurofilament light chain,and glial fibrillary acidic protein were not significantly correlated with sample storage time.However,the level of total tau showed a negative correlation with sample storage time.Notably,in individuals without cognitive impairment,plasma levels of total protein and tau phosphorylated protein threonine 181(p-tau181)also showed a negative correlation with sample storage time.This was not observed in individuals with cognitive impairment.Consequently,we speculate that the diagnostic accuracy of plasma p-tau181 and the p-tau181 to total tau ratio may be influenced by sample storage time.Therefore,caution is advised when using these plasma biomarkers for the identification of neurodegenerative diseases,such as Alzheimer's disease.Furthermore,in cohort studies,it is important to consider the impact of storage time on the overall results.

Local polynomial prediction method of multivariate chaotic time series and its application

To improve the prediction accuracy of chaotic time series, a new methodformed on the basis of local polynomial prediction is proposed. The multivariate phase spacereconstruction theory is utilized to reconstruct the phase space firstly, and on its basis, apolynomial function is applied to construct the prediction model, then the parameters of the modelaccording to the data matrix built with the embedding dimensions are estimated and a one-stepprediction value is calculated. An estimate and one-step prediction value is calculated. Finally,the mean squared root statistics are used to estimate the prediction effect. The simulation resultsobtained by the Lorenz system and the prediction results of the Shanghai composite index show thatthe local polynomial prediction errors of the multivariate chaotic time series are small and itsprediction accuracy is much higher than that of the univariate chaotic time series.

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game

Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

4种植物源性成分多重real-time PCR检测方法的建立及其在食用淀粉中的应用

建立一种可同时快速检测红薯、木薯、马铃薯、玉米源性成分的多重实时聚合酶链式反应(real-time polymerase chain reaction,real-time PCR)方法。分别以红薯g3pdh基因、木薯g3pdh基因、马铃薯UGPase基因、玉米zSSIIb基因为靶基因设计特异性引物和TaqMan探针,以18S rRNA基因为内参基因,建立多重real-time PCR方法,开展方法学验证,并对不同掺入比例模拟样品和实际淀粉样品进行检测。结果显示,该方法具有高通量、特异性强、灵敏度高等优点。与15种非目标源性均无交叉反应;对目标DNA的检测灵敏度可达到3×10^(-3) ng/μL,且具有良好的线性关系和扩增效率;对淀粉样品的检出限可达0.1%,对50份实际样品进行检测,结果与参比方法一致,说明建立的多重real-time PCR法可用于食用淀粉种类掺假鉴别检测。

Novel Stability Criteria for Linear Time-Delay Systems Using Lyapunov-Krasovskii Functionals With A Cubic Polynomial on Time-Varying Delay

One of challenging issues on stability analysis of time-delay systems is how to obtain a stability criterion from a matrix-valued polynomial on a time-varying delay.The first contribution of this paper is to establish a necessary and sufficient condition on a matrix-valued polynomial inequality over a certain closed interval.The degree of such a matrix-valued polynomial can be an arbitrary finite positive integer.The second contribution of this paper is to introduce a novel LyapunovKrasovskii functional,which includes a cubic polynomial on a time-varying delay,in stability analysis of time-delay systems.Based on the novel Lyapunov-Krasovskii functional and the necessary and sufficient condition on matrix-valued polynomial inequalities,two stability criteria are derived for two cases of the time-varying delay.A well-studied numerical example is given to show that the proposed stability criteria are of less conservativeness than some existing ones.

SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS

Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.

Kernel polynomial representation for imaginary-time Green's functions in continuous-time quantum Monte Carlo impurity solver

Inspired by the recently proposed Legendre orthogonal polynomial representation for imaginary-time Green s functions G（τ）,we develop an alternate and superior representation for G（τ） and implement it in the hybridization expansion continuous-time quantum Monte Carlo impurity solver.This representation is based on the kernel polynomial method,which introduces some integral kernel functions to filter the numerical fluctuations caused by the explicit truncations of polynomial expansion series and can improve the computational precision significantly.As an illustration of the new representation,we re-examine the imaginary-time Green＇s functions of the single-band Hubbard model in the framework of dynamical mean-field theory.The calculated results suggest that with carefully chosen integral kernel functions,whether the system is metallic or insulating,the Gibbs oscillations found in the previous Legendre orthogonal polynomial representation have been vastly suppressed and remarkable corrections to the measured Green＇s functions have been obtained.

ICON/MIGHTI与TIMED/SABER探测温度数据的对比

ICON卫星为临近空间环境特性研究、建模和预报提供了新数据.通过对ICON/MIGHTI与TIMED/SABER在90~105 km高度探测温度数据的比较,计算两者的年平均温度偏差和均方根误差,同时分析月平均温度偏差在不同月份中随高度和纬度的分布情况,为MIGHTI和SABER温度探测数据在临近空间大气建模和预报应用提供参考依据.结果表明,MIGHTI和SABER的温度垂直廓线变化趋势基本吻合,数值上有所差异.在12°S-42°N范围内,MIGHTI探测温度与SABER相比,在90~93 km时偏低,偏差最大值约2.5 K,在93~105 km偏高,偏差的绝对值最大约10 K.在不同季节,白天的温度偏差通常高于夜晚.SABER和MIGHTI的月平均温度偏差随季节和纬度的变化显著,夏季时的月平均温度偏差最大,且温度的均方根误差最大.

Polynomial Time Method for Solving Nash Equilibria of Zero-Sum Games

There are a few studies that focus on solution methods for finding a Nash equilibrium of zero-sum games. We discuss the use of Karmarkar’s interior point method to solve the Nash equilibrium problems of a zero-sum game, and prove that it is theoretically a polynomial time algorithm. We implement the Karmarkar method, and a preliminary computational result shows that it performs well for zero-sum games. We also mention an affine scaling method that would help us compute Nash equilibria of general zero-sum games effectively.

Partition-Time Masking:一种唇语识别数据增强方法

提出了一种唇语识别数据增强方法Partition-Time Masking。该方法直接作用于输入数据,通过将输入划分为多个子序列再分别进行Mask操作最后再将各子序列按序拼接,使得模型能对部分帧缺失的输入具有更强的鲁棒性,从而增强泛化能力。实验前根据划分的子序列数目与掩码值来源不同而设计了5种增强策略,并与唇语识别研究中最重要的数据增强方法Time Masking进行了对比实验。实验在LRW数据集和LRW1000数据集上进行,实验结果表明Partition-Time Masking方法对模型性能提升的效果要优于Time Masking方法,其中子序列数目为3、掩码值选择各子序列平均帧时为最优策略,该策略使得目前最佳的唇语识别模型DC-TCN的性能从89.6%提高到90.0%。

TimeGAN-Informer长时机场能见度预测

能见度的预测对机场的业务决策、保障飞机的安全起降具有重要的意义。针对现有能见度预测模型预测时间较短的问题,提出一种基于TimeGAN Informer(Time Generative Adversarial Network-Informer)的机场能见度预测方法。利用2018—2022年气象和污染物数据,通过相关系数法和递归特征消除法提取出能见度的主要影响因素,使用TimeGAN时间序列生成对抗网络对数据进行扩充,并将Informer长时间序列预测模型应用于能见度预测。结果显示:当预测步长为1 d、2 d、3 d时,TimeGAN Informer的绝对误差(Mean Absolute Error,MAE)分别为2.42、3.13、3.57,比Informer分别降低了0.29、0.27、0.28,比长短时记忆网络(Long Short-Term Memory,LSTM)分别降低了0.28、0.49、0.63;均方根误差(Root Mean Square Error,RMSE)分别为3.03、3.7、4.09,比Informer分别降低了0.38、0.22、0.24,比长短时记忆网络(LSTM)分别降低了0.3、0.5、1.04;百分误差小于30%的分别占测试样本集的78.07%、70.68%、63.84%。尽管随着步长的增加预测效果变差,但在预测步长为3 d时,多数样本的预测误差仍小于30%,实现了对机场区域较为准确的长时能见度预测。

Solving the Binary Linear Programming Model in Polynomial Time

The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.

基于TimeGAN数据增强的复杂过程故障分类方法

针对传统基于重构的故障分类方法在故障样本稀疏或失衡情况下效果不佳、故障子空间区分能力弱的问题,提出基于TimeGAN数据增强的复杂过程故障分类方法.针对小子样故障,使用TimeGAN对历史故障数据进行数据增强,生成与历史数据分布相似的虚拟故障样本;采用马氏距离评估虚拟样本的质量,剔除不可信样本,构造平衡的故障样本集.将故障样本映射到高维核空间,并在核空间中提取故障子空间.设计故障分类策略并定义4种故障分类性能评估指标以定量衡量算法的分类性能.Tennessee Eastman应用结果表明,所提数据增强方法可以有效扩充故障样本,进而提高故障重构率.与WGAN-GP和SMOTE方法进行对比,发现基于TimeGAN数据增强的故障分类方法具有更好的分类性能.

Probabilistic analysis of tunnel face seismic stability in layered rock masses using Polynomial Chaos Kriging metamodel

Face stability is an essential issue in tunnel design and construction.Layered rock masses are typical and ubiquitous;uncertainties in rock properties always exist.In view of this,a comprehensive method,which combines the Upper bound Limit analysis of Tunnel face stability,the Polynomial Chaos Kriging,the Monte-Carlo Simulation and Analysis of Covariance method(ULT-PCK-MA),is proposed to investigate the seismic stability of tunnel faces.A two-dimensional analytical model of ULT is developed to evaluate the virtual support force based on the upper bound limit analysis.An efficient probabilistic analysis method PCK-MA based on the adaptive Polynomial Chaos Kriging metamodel is then implemented to investigate the parameter uncertainty effects.Ten input parameters,including geological strength indices,uniaxial compressive strengths and constants for three rock formations,and the horizontal seismic coefficients,are treated as random variables.The effects of these parameter uncertainties on the failure probability and sensitivity indices are discussed.In addition,the effects of weak layer position,the middle layer thickness and quality,the tunnel diameter,the parameters correlation,and the seismic loadings are investigated,respectively.The results show that the layer distributions significantly influence the tunnel face probabilistic stability,particularly when the weak rock is present in the bottom layer.The efficiency of the proposed ULT-PCK-MA is validated,which is expected to facilitate the engineering design and construction.

Brain Time Stack图像融合技术在CT中的应用

目的:分析Brain Time Stack图像融合技术在CT中的应用。方法:选取2021年3月—2022年9月衡水市第四人民医院收治的50例CT检查患者作为研究对象。所有患者进行CT检查并进行Brain Time Stack后处理。比较四组不同部位CT值、标准差(SD)、信噪比(SNR)。比较四组图像主观质量评分。分析不同部位CT值、SD、SNR与图像主观质量评分的相关性。结果:B组的延髓、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉CT值明显低于A组;C组的延髓、脑室、额叶白质、小脑内侧、小脑外侧、颞肌肌肉CT值高于A组;D组延髓、额叶灰质、颞肌肌肉CT值明显低于A组,脑室、额叶白质、小脑外侧CT值明显高于A组;C组延髓、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉CT值明显高于B组;D组延髓、脑室、额叶白质、小脑内侧、小脑外侧、颞肌肌肉CT值明显高于B组;D组延髓、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉CT值明显低于C组;D组脑室CT值明显高于C组,差异有统计学意义(P<0.05)。B组、C组、D组延髓、脑室、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉SD值明显低于A组;C组延髓、脑室、额叶白质、小脑内侧、小脑外侧、颞肌肌肉SD值均明显高于B组;C组额叶灰质SD明显低于B组;D组延髓、脑室、额叶灰质、额叶白质、小脑内侧、小脑外侧、肌肉SD均明显低于B组、C组,差异有统计学意义(P<0.05)。B组、C组、D组延髓、脑室、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉SNR均明显高于A组;C组、D组延髓、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉SNR值明显高于B组;C组、D组脑室SNR明显低于B组;D组延髓、脑室、额叶灰质、额叶白质、小脑内侧、小脑外侧、颞肌肌肉SNR明显高于C组,差异有统计学意义(P<0.05)。D组图像主观质量评分最高,差异有统计学意义(P<0.05)。延髓、脑室、额叶灰质、额叶白质、小脑内侧、小脑外侧及颞肌肌肉SD与主观质量评分呈明显负相关,SNR与主观质量评分间呈明显正相关,差异有统计学意义(P<0.05)。结论:利用Brain Time Stack图像融合技术对头部CT扫描检查图像处理,动脉期结合前一期及后一期的图像数据在处理后具有更好的质量和更少的噪音。

Association of daily sitting time and leisure-time physical activity with body fat among U.S.adults

Background:Prolonged sitting and reduced physical activity lead to low energy expenditures.However,little is known about the joint impact of daily sitting time and physical activity on body fat distribution.We investigated the independent and joint associations of daily sitting time and physical activity with body fat among adults.Methods:This was a cross-sectional analysis of U.S.nationally representative data from the National Health and Nutrition Examination Survey2011-2018 among adults aged 20 years or older.Daily sitting time and leisure-time physical activity(LTPA)were self-reported using the Global Physical Activity Questionnaire.Body fat(total and trunk fat percentage)was determined via dual X-ray absorptiometry.Results:Among 10,808 adults,about 54.6%spent 6 h/day or more sitting;more than one-half reported no LTPA(inactive)or less than 150 min/week LTPA(insufficiently active)with only 43.3%reported 150 min/week or more LTPA(active)in the past week.After fully adjusting for sociodemographic data,lifestyle behaviors,and chronic conditions,prolonged sitting time and low levels of LTPA were associated with higher total and trunk fat percentages in both sexes.When stratifying by LTPA,the association between daily sitting time and body fat appeared to be stronger in those who were inactive/insuufficiently active.In the joint analyses,inactive/insuufficiently active adults who reported sitting more than 8 h/day had the highest total(female:3.99%(95%confidence interval(95%CI):3.09%-4.88%);male:3.79%(95%CI:2.75%-4.82%))and trunk body fat percentages(female:4.21%(95%CI:3.09%-5.32%);male:4.07%(95%CI:2.95%-5.19%))when compared with those who were active and sitting less than 4 h/day.Conclusion:Prolonged daily sitting time was associated with increased body fat among U.S.adults.The higher body fat associated with 6 h/day sitting may not be offset by achieving recommended levels of physical activity.

Finite Element Orthogonal Collocation Approach for Time Fractional Telegraph Equation with Mamadu-Njoseh Polynomials

Finite element method (FEM) is an efficient numerical tool for the solution of partial differential equations (PDEs). It is one of the most general methods when compared to other numerical techniques. PDEs posed in a variational form over a given space, say a Hilbert space, are better numerically handled with the FEM. The FEM algorithm is used in various applications which includes fluid flow, heat transfer, acoustics, structural mechanics and dynamics, electric and magnetic field, etc. Thus, in this paper, the Finite Element Orthogonal Collocation Approach (FEOCA) is established for the approximate solution of Time Fractional Telegraph Equation (TFTE) with Mamadu-Njoseh polynomials as grid points corresponding to new basis functions constructed in the finite element space. The FEOCA is an elegant mixture of the Finite Element Method (FEM) and the Orthogonal Collocation Method (OCM). Two numerical examples are experimented on to verify the accuracy and rate of convergence of the method as compared with the theoretical results, and other methods in literature.

Hybrid model for BOF oxygen blowing time prediction based on oxygen balance mechanism and deep neural network

The amount of oxygen blown into the converter is one of the key parameters for the control of the converter blowing process,which directly affects the tap-to-tap time of converter. In this study, a hybrid model based on oxygen balance mechanism (OBM) and deep neural network (DNN) was established for predicting oxygen blowing time in converter. A three-step method was utilized in the hybrid model. First, the oxygen consumption volume was predicted by the OBM model and DNN model, respectively. Second, a more accurate oxygen consumption volume was obtained by integrating the OBM model and DNN model. Finally, the converter oxygen blowing time was calculated according to the oxygen consumption volume and the oxygen supply intensity of each heat. The proposed hybrid model was verified using the actual data collected from an integrated steel plant in China, and compared with multiple linear regression model, OBM model, and neural network model including extreme learning machine, back propagation neural network, and DNN. The test results indicate that the hybrid model with a network structure of 3 hidden layer layers, 32-16-8 neurons per hidden layer, and 0.1 learning rate has the best prediction accuracy and stronger generalization ability compared with other models. The predicted hit ratio of oxygen consumption volume within the error±300 m^(3)is 96.67%;determination coefficient (R^(2)) and root mean square error (RMSE) are0.6984 and 150.03 m^(3), respectively. The oxygen blow time prediction hit ratio within the error±0.6 min is 89.50%;R2and RMSE are0.9486 and 0.3592 min, respectively. As a result, the proposed model can effectively predict the oxygen consumption volume and oxygen blowing time in the converter.

Prescribed Performance Tracking Control of Time-Delay Nonlinear Systems With Output Constraints

The problem of prescribed performance tracking control for unknown time-delay nonlinear systems subject to output constraints is dealt with in this paper. In contrast with related works, only the most fundamental requirements, i.e., boundedness and the local Lipschitz condition, are assumed for the allowable time delays. Moreover, we focus on the case where the reference is unknown beforehand, which renders the standard prescribed performance control designs under output constraints infeasible. To conquer these challenges, a novel robust prescribed performance control approach is put forward in this paper.Herein, a reverse tuning function is skillfully constructed and automatically generates a performance envelop for the tracking error. In addition, a unified performance analysis framework based on proof by contradiction and the barrier function is established to reveal the inherent robustness of the control system against the time delays. It turns out that the system output tracks the reference with a preassigned settling time and good accuracy,without constraint violations. A comparative simulation on a two-stage chemical reactor is carried out to illustrate the above theoretical findings.