全文获取类型
收费全文 | 235篇 |
免费 | 1篇 |
国内免费 | 6篇 |
专业分类
教育 | 137篇 |
科学研究 | 81篇 |
体育 | 3篇 |
综合类 | 8篇 |
信息传播 | 13篇 |
出版年
2023年 | 24篇 |
2022年 | 17篇 |
2021年 | 8篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2015年 | 4篇 |
2014年 | 11篇 |
2013年 | 7篇 |
2012年 | 7篇 |
2011年 | 16篇 |
2010年 | 16篇 |
2009年 | 14篇 |
2008年 | 12篇 |
2007年 | 14篇 |
2006年 | 14篇 |
2005年 | 13篇 |
2004年 | 13篇 |
2003年 | 13篇 |
2002年 | 4篇 |
2001年 | 6篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有242条查询结果,搜索用时 0 毫秒
31.
着重研究一般绝对中心点选址问题,考虑对象为网络图上所有的点.根据点与边的距离函数图形性质,给出了关于一般绝对中心点存在与如何寻找的定理,并利用所给定理解决了某居住区内消防站设立选址问题. 相似文献
32.
孟宪亮 《温州大学学报(社会科学版)》2009,(5):27-33
用双逐次投影迭代法来求解奇异线性方程组,当线性方程组的系数矩阵是对称半正定时,给出了不同情形时有关参量的选取以及相应的算法,并就收敛结果分别与雅可比迭代法和Gauss-Seidel迭代法进行了比较,数值结果表明,该方法对求解奇异线性方程组是很有效的. 相似文献
33.
《Information processing & management》2022,59(4):102992
Structured sentiment analysis is a newly proposed task, which aims to summarize the overall sentiment and opinion status on given texts, i.e., the opinion expression, the sentiment polarity of the opinion, the holder of the opinion, and the target the opinion towards. In this work, we investigate a transition-based model for end-to-end structured sentiment analysis task. We design a transition architecture which supports the recognition of all the possible opinion quadruples in one shot. Based on the transition backbone, we then propose a Dual-Pointer module for more accurate term boundary detection. Besides, we further introduce a global graph reasoning mechanism, which helps to learn the global-level interactions between the overlapped quadruples. The high-order features are navigated into the transition system to enhance the final predictions. Extensive experimental results on five benchmarks demonstrate both the prominent efficacy and efficiency of our system. Our model outperforms all baselines in terms of all metrics, especially achieving a 10.5% point gain over the current best-performing system only detecting the holder-target-opinion triplets. Further analyses reveal that our framework is also effective in solving the overlapping structure and long-range dependency issues. 相似文献
34.
35.
《Information processing & management》2023,60(2):103223
Aspect-based sentiment analysis aims to determine sentiment polarities toward specific aspect terms within the same sentence or document. Most recent studies adopted attention-based neural network models to implicitly connect aspect terms with context words. However, these studies were limited by insufficient interaction between aspect terms and opinion words, leading to poor performance on robustness test sets. In addition, we have found that robustness test sets create new sentences that interfere with the original information of a sentence, which often makes the text too long and leads to the problem of long-distance dependence. Simultaneously, these new sentences produce more non-target aspect terms, misleading the model because of the lack of relevant knowledge guidance. This study proposes a knowledge guided multi-granularity graph convolutional neural network (KMGCN) to solve these problems. The multi-granularity attention mechanism is designed to enhance the interaction between aspect terms and opinion words. To address the long-distance dependence, KMGCN uses a graph convolutional network that relies on a semantic map based on fine-tuning pre-trained models. In particular, KMGCN uses a mask mechanism guided by conceptual knowledge to encounter more aspect terms (including target and non-target aspect terms). Experiments are conducted on 12 SemEval-2014 variant benchmarking datasets, and the results demonstrated the effectiveness of the proposed framework. 相似文献
36.
张祥波 《四川职业技术学院学报》2012,22(4):150-152
本文证明了赋权完全图Kn中关于最短H圈与最短H通路的两个定理,由此得到了它们的一个上确界.通过探讨最短H圈的有关性质,得到了关于最短H通路的对偶性结论,文末研究了它们之间的关系,使之更接近最优解. 相似文献
37.
辜玉斌 《韩山师范学院学报》2012,(5):9-15
传统潮筝催奏速度与弦诗乐催奏速度存在较大差距。潮筝快速催奏法"突破八度对称"弹奏模式,揉合潮乐的其他催奏形式,使潮筝的催奏速度达到弦诗乐演奏的要求,从而提高了潮筝在潮州音乐中的地位,并且丰富了潮州音乐的整体表现力。 相似文献
38.
39.
设G是阶数不小于3的简单连通图,G的k-正常边染色称为是邻点可区别的,如果对G任意相邻两顶点关联边的颜色集合不同,则k中最小者称为是G的邻点可区别的边色数.本文证明了C5m×C5n的邻点可区别的边色数是5. 相似文献
40.