检索结果-南通市图书馆

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Investigating the interaction between umami peptides and umami receptor T1R1/T1R3-VFT: a computational approach

The 2.10 IEEE International Conference on Progress in Informatics and Computing

作者： Yue Hu Weiqin tong Yanbao cui and Liangliang Cai {2. of computer Engineering and science Shanghai University Shanghai china 2.0072.Ying Li {2. of Mathematics & Information technology Nanjing XiaoZhuang University Nanjing china 2.1171

＜正＞In parallel computing,especially in the field of massively large scale problems,such as the complex large scale electromagnetic problems,the memory requirement is extremely *** understand the memory shifting pattern,when the system size alternating is crucial in optimizing or utilizing a parallel *** this paper,an incremental memory statistic model,varying with system size,is proposed,which is also available to comprehending the entire memory requirement of a *** on the statistic model,the relationship of memory and time is also analyzed.

关键词： parallel computing memory shifting pattern incremental memory statistic model relationship of memory and time

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Food science and Human Wellness 2024年

作者： Hengli Meng Zhiyong cui Yingqiu Li Yanyang Yu Shui Jiang Yuan Liu Department of Food science & technology， {2. of Agriculture and Biology， Shanghai Shanghai Jiao tong University Secondary College of Cereals and Tourism， Guangxi Vocational College of technology and Business

The study of ligand-receptor interactions is of great significance in food flavor perception. In this study， a computer simulation method was used to investigate the mechanism of interaction between umami peptides and T1R1/T1R3-VFT receptor. The binding site， conformational changes， and binding free energy between umami peptides and T1R1/T1R3-VFT were analyzed through molecular modeling， molecular docking， and molecular dynamics simulations. The receptor model constructed using AlphaFold2.has the best rationality. The molecular docking results showed that umami peptides primarily bound to T1R1-VFT through hydrogen bonding， with key binding residues such as 149THR， 151ARG， and 108ASP. The binding of umami peptides led to a more stable complex system， and the positively charged amino acids contributed positively to the overall binding free energy. This study provides theoretical support for the development of a better understanding of the interaction between umami substances and the umami receptor.

关键词：

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

基于双重多视角表示的目标级隐性情感分类

计算机工程 2024年第1期50卷 79-90页

作者：崔蒙蒙刘井平阮彤宋雨秋杜渂华东理工大学信息科学与工程学院上海200237 迪爱斯信息技术股份有限公司上海200032

目标级隐性情感分类是自然语言处理中一项重要的情感分析任务。目前多数研究主要侧重于对上下文感知的目标进行建模,且建模信息源较为单一,难以充分捕获到目标词在文本中的隐性情感。针对该问题,提出基于双重多视角表示学习的目标级隐... 详细信息

目标级隐性情感分类是自然语言处理中一项重要的情感分析任务。目前多数研究主要侧重于对上下文感知的目标进行建模,且建模信息源较为单一,难以充分捕获到目标词在文本中的隐性情感。针对该问题,提出基于双重多视角表示学习的目标级隐性情感分类方法,采用3种视角对目标和输入文本进行建模,分别设计文本自身的表示学习、图视角下的表示学习以及外部知识视角下的表示学习,并通过卷积神经网络将3种视角下的表示进行深度融合。此外,同时采用上述3种视角对目标进行表示学习,将文本的语义表示和目标的语义表示相结合,并输入到情感极性分类器中。在5个公共数据集上进行实验并与8个基线模型的对比结果表明,该方法性能达到了最优水平,在News MTSC-mt和News MTSC-rw隐性情感分析数据集上的F1_m值分别比最好模型提高1.0%和2.6%,在Laptop14、Restaurant14和Twitter显性情感分析数据集上的F1_m值分别比最好模型提高3.6%、1.4%和1.6%。

关键词：目标级隐性情感分类自然语言处理情感分析双重多视角表示学习

Variational Gridded Graph Convolution Network for Node Classification

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第10期8卷 1697-1708页

作者： Xiaobin Hong tong Zhang Zhen cui Jian Yang Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and EngineeringNanjing University of Science and TechnologyNanjing 210094China

The existing graph convolution methods usually suffer high computational burdens,large memory requirements,and intractable *** this paper,we propose a high-efficient variational gridded graph convolution network(VG-GCN)to encode non-regular graph data,which overcomes all these aforementioned *** capture graph topology structures efficiently,in the proposed framework,we propose a hierarchically-coarsened random walk(hcr-walk)by taking advantage of the classic random walk and node/edge *** hcr-walk greatly mitigates the problem of exponentially explosive sampling times which occur in the classic version,while preserving graph structures *** efficiently encode local hcr-walk around one reference node,we project hcrwalk into an ordered space to form image-like grid data,which favors those conventional convolution *** of the direct 2.D convolution filtering,a variational convolution block(VCB)is designed to model the distribution of the randomsampling hcr-walk inspired by the well-formulated variational *** experimentally validate the efficiency and effectiveness of our proposed VG-GCN,which has high computation speed,and the comparable or even better performance when compared with baseline GCNs.

关键词： Graph coarsening gridding node classification random walk variational convolution

Worst-Case Finish Time Analysis for DAG-Based Applications in the Presence of Transient Faults

在线全文

学校读者我要写书评

暂无评论

Journal of computer science & {2. 2016年第2期31卷 267-283页

作者： Xiao-tong cui Kai-Jie Wu tong-Quan Wei Hsing-Mean Sha Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Chongqing 400014 China College of computer science Chongqing University Chongqing 400044 China Department of computer science and {2. East China Normal University Shanghai 200241 China

Tasks in hard real-time systems are required to meet preset deadlines, even in the presence of transient faults and hence the analysis of worst-case finish time （WCFT） must consider the extra time incurred by re-executing tasks that were faulty. Existing solutions can only estimate WCFT and usually result in significant under- or over-estimation. In this work, we conclude that a sufficient and necessary condition of a task set experiencing its WCFT is that its critical task incurs all expected transient faults. A method is presented to identify the critical task and WCFT in O（IVI ＋ IEI） where IVI and IEI are the number of tasks and dependencies between tasks, respectively. This method finds its application in testing the feasibility of directed acyclic graph （DAG） based task sets scheduled in a wide variety of fault-prone multi-processor systems, where the processors could be either homogeneous or heterogeneous, DVS-capable or DVS-incapable, etc. The common practices, which require the same time complexity as the proposed critical-task method, could either underestimate the worst case by up to 2.%, or overestimate by 13%. Based on the proposed critical-task method, a simulated-annealing scheduling algorithm is developed to find the energy efficient fault-tolerant schedule for a given DAG task set. Experimental results show that the proposed critical-task method wins over a common practice by up to 40% in terms of energy saving.

关键词： fault tolerance worst-case analysis simulated annealing energy conservation dynamic voltage scaling (DVS)

Investigation of the Free Vibrations of Radial Functionally Graded Circular Cylindrical Beams Based on Differential Quadrature Method

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computer Modeling in Engineering & sciences 2022年第7期132卷 23-41页

作者： xiaojun Huang Liaojun Zhang Renyu Ge Hanbo cui Zhedong Xu College of Water Conservancy and Hydropower Engineering Hohai UniversityNanjing210098China school of Architecture and Civil Engineering Anhui Polytechnic UniversityWuhu241000China

In the current research,an effective differential quadrature method(DQM)has been developed to solve natural frequency and vibration modal functions of circular section beams along radial functional *** on the high-order theory of transverse vibration of circular cross-section beams,lateral displacement equation was reconstructed neglecting circumferential shear *** equations coupled with deflection and rotation angles were derived based on elastic mechanics theory and further simplified into a constant coefficient differential equation with natural frequency as ***,differential quadrature method was applied to transform the eigenvalue problem of the derived differential equation into a set of algebraic equation eigenvalue *** frequencies of the free vibrations of cylindrical beams with circular cross-sections were calculated at one time,and corresponding modal functions were solved *** obtained numerical results indicated that the natural frequencies of functionally graded(FG)circular cylindrical beams obtained using differential quadrature method agreed with the results reported in related *** addition,influences of varying gradient parameters on the modal shapes of circular cylindrical beams were found to be strongly consistent with previous *** results further validated the feasibility and accuracy of the developed differential quadrature method in solving the transverse vibration of FG circular cross-section beams.

关键词： Functionally graded materials circular cylindrical beams natural frequency modal function differential quadrature method

Full-Length Transcriptome Analysis of Cultivated and Wild Tetraploid Peanut

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Phyton-International Journal of Experimental Botany 2023年第2期92卷 439-453页

作者： Danlei Song Xiaona Yu Yaoyao Li Xianheng Wang Xinyuan cui tong Si Xiaoxia Zou Yuefu Wang Minglun Wang {2. Zhang Dry Farming technology Key Laboratory of Shandong Province College of AgronomyQingdao Agricultural UniversityQingdao266109China

The high-quality genomes and large-scale full-length cDNA sequences of allotetraploid peanuts have been sequenced and released,which has accelerated the functional genomics and molecular breeding research of *** order to understand the difference in the transcriptional levels of wild and cultivated *** this study,we integrated of second-and third-generation sequencing technologies to sequence full-length transcriptomes in peanut ***9616 and its putative ancestor Arachis *** RNA extracted from six different tissues(i.e.,roots,stems,leaves,flowers,needles and pods)were sampled at 2. days after flowering.A total of 31,764 and 33,981 high-quality transcripts were obtained from Monticola and Pingdu9616,*** number of alternative splicing,the unit point mutation of variable adenylation,the number of open reading frames and the two-site mutation were identified in Pingdu9616 more than in Monticola,but the three-site mutation in Pingdu9616 was lower than in Monticola.1,691 LncRNAs,and 4,000 bp of maximum length of LncRNA was identified in Monticola and ***,comparative analysis between transcript data shown that 56 transcription factor families were involved in Monticola,and Pingdu9616 and the number of transcription factors in Pingdu9616 was higher than that in Monticola,the number of expressed genes estimated in flower,root,young pod and leaf organs was higher in Monticola than *** all,our study provided a valuable resource of large-scale full-length transcripts for further research of the molecular breeding and functional analysis of genes.

关键词： Peanut second generation transcriptome full-length transcriptome

基于TPE-BP神经网络的爆破振速预测模型研究

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

矿业研究与开发 2024年第5期44卷 53-58页

作者：崔红艳张子禄胡静张荣国王桐王勇太原科技大学计算机科学与技术学院山西太原030024 山西焦煤民爆集团矿山民爆工程分公司山西太原030300

爆破振动速度是爆破设计需要考虑的的重要因素之一,然而在爆破振动速度预测中,BP神经网络超参数的确定依赖经验公式且具有主观性。为克服这种局限性,并提高振动速度预测精度,采用超参数优化算法TPE对BP神经网络进行超参数优选。以最大... 详细信息

爆破振动速度是爆破设计需要考虑的的重要因素之一,然而在爆破振动速度预测中,BP神经网络超参数的确定依赖经验公式且具有主观性。为克服这种局限性,并提高振动速度预测精度,采用超参数优化算法TPE对BP神经网络进行超参数优选。以最大段起爆炸药量、炮孔深度、水平距离、垂直距离和炸药单耗参数作为输入量,建立了隐含层数量神经元数量为31个的BP神经网络(TPE-BP)预测模型,该模型的爆破振动速度平均预测误差为2.35%,最大误差为6.2.%,与基于经验公式确定超参数的BP神经网络模型和传统的BP神经网络模型相比较,平均预测误差分别降低了2..2.个百分点和4.2.个百分点,说明参数网络优化后TPE-BP预测模型能更好地拟合振动数据,其预测结果更接近真实值,可为爆破参数设计提供参考依据,从而有效地控制爆破振动。

关键词：爆破振动振动速度预测 BP神经网络 TPE算法超参数优化

New Chaotic Image Encryption Algorithm Based on Cross-Mapping

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural sciences 2012年第6期17卷 461-467页

作者： tong xiaojun LIU Yang ZHANG Miao SHI Hongyu school of computer {2. and technology Harbin Institute of TechnologyWeihai 264209ShandongChina

Chaotic cryptography has been applied to image encryption;however,only the traditional low-dimensional chaotic systems has been widely analyzed or deciphered,which does not show satisfied security and *** solve this problem,a new algorithm based on cross-chaos map has been created in this *** image pixels are scrambled under control of high-dimensional chaotic sequence,which is generated by cross chaotic *** image pixels are substituted by ciphertext feedback *** can relate encryption required parameters with plaintext and can make a plaintext byte affect more ciphertext *** by theoretical analysis and experimental results,the algorithm has higher complex degree and has passed SP800-2. pseudo-random number standard tests,and it has high encryption speed,high security,*** can be widely applied in the field of image encryption.

关键词： chaos image encryption cross chaotic map cross-scrambling substitute