基于超立方体和圈的细胞分裂生长网络及其性质
Computer engineering & Software（2017）
Abstract
立方连通圈是超立方体的有界变型,在这篇文章中作者以立方连通圈网络CCC(n)(n＞2)为基础设计了一种新网络--CCC(n,k)(n＞2且k是非负数),它是3正则3连通的,且有许多好的性质.作者证明了CCC(3,0)是哈密尔顿连通图,且CCC(n,k)(n＞2且k是非负数)是哈密尔顿图,但当k＞2和n＞2或者k=l和2＜n＜8时,CCC(n,k)不是点可迁的.作者还研究了CCC(n,k)(n＞2且k是非负数)和Cm的笛卡尔积的一些性质.
More求助PDF
上传PDF
View via Publisher
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
- Pretraining has recently greatly promoted the development of natural language processing (NLP)
- We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
- We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
- The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
- Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
GPU is busy, summary generation fails
Rerequest