全文获取类型
收费全文 | 4528篇 |
免费 | 736篇 |
国内免费 | 189篇 |
专业分类
化学 | 311篇 |
晶体学 | 19篇 |
力学 | 164篇 |
综合类 | 59篇 |
数学 | 763篇 |
物理学 | 984篇 |
无线电 | 3153篇 |
出版年
2024年 | 20篇 |
2023年 | 72篇 |
2022年 | 114篇 |
2021年 | 145篇 |
2020年 | 135篇 |
2019年 | 141篇 |
2018年 | 132篇 |
2017年 | 205篇 |
2016年 | 222篇 |
2015年 | 236篇 |
2014年 | 380篇 |
2013年 | 318篇 |
2012年 | 306篇 |
2011年 | 302篇 |
2010年 | 224篇 |
2009年 | 286篇 |
2008年 | 312篇 |
2007年 | 306篇 |
2006年 | 273篇 |
2005年 | 231篇 |
2004年 | 175篇 |
2003年 | 169篇 |
2002年 | 124篇 |
2001年 | 119篇 |
2000年 | 98篇 |
1999年 | 67篇 |
1998年 | 64篇 |
1997年 | 54篇 |
1996年 | 47篇 |
1995年 | 38篇 |
1994年 | 19篇 |
1993年 | 21篇 |
1992年 | 17篇 |
1991年 | 16篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 7篇 |
1985年 | 2篇 |
1984年 | 12篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
排序方式: 共有5453条查询结果,搜索用时 31 毫秒
71.
We explore the relationship between the () inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the () model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period. 相似文献
72.
Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way. 相似文献
73.
Ajit A. Diwan 《Discrete Mathematics》2019,342(4):1060-1062
Let be a perfect matching in a graph. A subset of is said to be a forcing set of , if is the only perfect matching in the graph that contains . The minimum size of a forcing set of is called the forcing number of . Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the -dimensional hypercube is , for all . This was revised by Riddle (2002), who conjectured that it is at least , and proved it for all even . We show that the revised conjecture holds for all . The proof is based on simple linear algebra. 相似文献
74.
Kreweras conjectured that every perfect matching of a hypercube for can be extended to a hamiltonian cycle of . Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of for can be extended to two or more hamiltonian cycles of . In this paper, we prove that every perfect matching of for can be extended to at least different hamiltonian cycles of . 相似文献
75.
Video object segmentation, aiming to segment the foreground objects given the annotation of the first frame, has been attracting increasing attentions. Many state-of-the-art approaches have achieved great performance by relying on online model updating or mask-propagation techniques. However, most online models require high computational cost due to model fine-tuning during inference. Most mask-propagation based models are faster but with relatively low performance due to failure to adapt to object appearance variation. In this paper, we are aiming to design a new model to make a good balance between speed and performance. We propose a model, called NPMCA-net, which directly localizes foreground objects based on mask-propagation and non-local technique by matching pixels in reference and target frames. Since we bring in information of both first and previous frames, our network is robust to large object appearance variation, and can better adapt to occlusions. Extensive experiments show that our approach can achieve a new state-of-the-art performance with a fast speed at the same time (86.5% IoU on DAVIS-2016 and 72.2% IoU on DAVIS-2017, with speed of 0.11s per frame) under the same level comparison. Source code is available at https://github.com/siyueyu/NPMCA-net. 相似文献
76.
A graph with at least vertices is said to be distance -extendable if, for any matching of with edges in which the edges lie at distance at least pairwise, there exists a perfect matching of containing . In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 -extendable for any . 相似文献
77.
78.
79.
With the deepening of social information, the panoramic image has drawn a significant interest of viewers and researchers as it can provide a very wide field of view (FoV). Since panoramic images are usually obtained by capturing images with the overlapping regions and then stitching them together, image stitching plays an important role in generating panoramic images. In order to effectively evaluate the quality of stitched images, a novel quality assessment method based on bi-directional matching is proposed for stitched images. Specifically, dense correspondences between the testing and benchmark stitched images are first established by bi-directional SIFT-flow matching. Then, color-aware, geometric-aware and structure-aware features are respectively extracted and fused via support vector regression (SVR) to obtain the final quality score. Experiments on our newly constructed database and ISIQA database demonstrate that the proposed method can achieve comparable performance compared with the conventional blind quality metrics and the quality metrics specially designed for stitched images. 相似文献
80.
如何根据患者的差异化需求,撮合医生与患者双方形成合理有效的医疗服务供需匹配,是医疗服务运作管理中重要的研究问题。本文针对医疗服务中医生与患者的实际需求,提出了一种考虑患者预约行为的匹配决策方法。在该方法中,首先依据患者的预约行为及特征分类;然后,通过计算不同情形下医患双方的差异度,获得了医患双方的满意度矩阵;在此基础上,提出了匹配预约患者与医生的E-HR算法,并进一步构建了匹配剩余患者和医生的多目标优化模型,通过模型求解得到最优匹配结果;最后,通过算例说明了本文提出方法的可行性和实用性。 相似文献