全文获取类型
收费全文 | 2814篇 |
免费 | 67篇 |
专业分类
公路运输 | 753篇 |
综合类 | 878篇 |
水路运输 | 608篇 |
铁路运输 | 571篇 |
综合运输 | 71篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 34篇 |
2021年 | 91篇 |
2020年 | 80篇 |
2019年 | 24篇 |
2018年 | 32篇 |
2017年 | 24篇 |
2016年 | 38篇 |
2015年 | 69篇 |
2014年 | 91篇 |
2013年 | 142篇 |
2012年 | 162篇 |
2011年 | 196篇 |
2010年 | 206篇 |
2009年 | 273篇 |
2008年 | 232篇 |
2007年 | 294篇 |
2006年 | 288篇 |
2005年 | 197篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 40篇 |
2001年 | 42篇 |
2000年 | 38篇 |
1999年 | 30篇 |
1998年 | 21篇 |
1997年 | 27篇 |
1996年 | 20篇 |
1995年 | 15篇 |
1994年 | 18篇 |
1993年 | 6篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 3篇 |
1986年 | 8篇 |
1984年 | 4篇 |
排序方式: 共有2881条查询结果,搜索用时 15 毫秒
81.
82.
83.
85.
86.
87.
Along with higher and higher integration of intellectual properties (IPs) on a single chip, traditional bus-based system-on-chips (SoC) meets several design difficulties (such as low scalability, high power consumption, packet latency and clock tree problem). As a promising solution, network-on-chips (NoC) has been proposed and widely studied. In this work, a novel algorithm for NoC topology synthesis, which is decomposing and cluster refinement (DCR) algorithm, has been proposed to minimize the total power consumption of application-specific NoC. This algorithm is composed of two stages: decomposing with cluster generation, and cluster refinement. For partitioning and cluster generation, an initial low-power solution for NoC topology is generated. For cluster refinement, the clustering is optimized by performing floorplan to further reduce power consumption. Meanwhile, a good tradeoff between power consumption and CPU time can be achieved. Experimental results show that the proposed method outperforms the existing work. 相似文献
88.
Web page classification is an important application in many fields of Internet information retrieval, such as providing directory classification and vertical search. Methods based on query log which is a light weight version of Web page classification can avoid Web content crawling, making it relatively high in efficiency, but the sparsity of user click data makes it difficult to be used directly for constructing a classifier. To solve this problem, we explore the semantic relations among different queries through word embedding, and propose three improved graph structure classification algorithms. To reflect the semantic relevance between queries, we map the user query into the low-dimensional space according to its query vector in the first step. Then, we calculate the uniform resource locator (URL) vector according to the relationship between the query and URL. Finally, we use the improved label propagation algorithm (LPA) and the bipartite graph expansion algorithm to classify the unlabeled Web pages. Experiments show that our methods make about 20% more increase in F1-value than other Web page classification methods based on query log. 相似文献
89.
Computer-aided hip surgery planning and implant design applications require accurate segmentation of femoral head and proximal acetabulum. An accurate outer surface extraction of femoral head using marching cubes algorithm remains challenging due to deformed shapes and extremely narrow inter-bone regions. In this paper, we present an automatic and fast approach for segmentation of femoral head and proximal acetabulum which leads to accurate and compact representation of femoral head using marching cubes algorithm. At first, valley-emphasized images are constructed from original images so that valleys stand out in high relief. Otsu’s multiple thresholding technique is applied to seperate the images into bone and non-bone classes. Region growing method and threedimensional (3D) morphological operations are performed to fill holes in the bone. In the reclassification process, the bone regions are further segmented, and the boundaries of the bone regions are further refined based on Bayes decision rule. Finally, marching cubes algorithm is applied to reconstruct a 3D model and extract the outer surface of femoral head and proximal acetabulum. Experimental results show that this method is an accurate segmentation technique for femoral head and proximal acetabulum and it can be applied as a tool in medical practice. 相似文献
90.
应用高精度定位解算软件PANDA对框架网进行解算,并与Bernese解进行比较,探讨不同软件模型下框架网的点位坐标解算方法及其精度;通过算例表明PANDA软件的定位解算结果与Bernese的解有较好的一致性,表明PANDA软件有较高的可靠性和稳定性。 相似文献