全文获取类型
收费全文 | 1903篇 |
免费 | 399篇 |
国内免费 | 311篇 |
学科分类
工业技术 | 2613篇 |
出版年
2024年 | 8篇 |
2023年 | 43篇 |
2022年 | 62篇 |
2021年 | 76篇 |
2020年 | 105篇 |
2019年 | 83篇 |
2018年 | 83篇 |
2017年 | 91篇 |
2016年 | 99篇 |
2015年 | 117篇 |
2014年 | 138篇 |
2013年 | 138篇 |
2012年 | 168篇 |
2011年 | 149篇 |
2010年 | 147篇 |
2009年 | 110篇 |
2008年 | 154篇 |
2007年 | 135篇 |
2006年 | 100篇 |
2005年 | 90篇 |
2004年 | 94篇 |
2003年 | 80篇 |
2002年 | 63篇 |
2001年 | 43篇 |
2000年 | 41篇 |
1999年 | 27篇 |
1998年 | 18篇 |
1997年 | 31篇 |
1996年 | 18篇 |
1995年 | 17篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 9篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1962年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2613条查询结果,搜索用时 0 毫秒
1.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
2.
A Novel Segmentation and Feedback Model for Resolving Contention in Optical Burst Switching 总被引:2,自引:0,他引:2
A novel segmentation and feedback model (SFM) applied to resolve contention is proposed. Simulation and performance analyses show that the SFM effectively avoids contentions in optical burst switching (OBS). The long delay time of deflection routing and the immature technology of wavelength converters and optical buffers are not deployed in the SFM. The SFM does not only realize fast switching but also allows preemption by higher priority bursts. 相似文献
3.
EuLisp has an integrated object system with reflective capabilities. We discuss some example applications which use these facilities to experiment with some advanced and powerful concepts, namely, finalization, virtual shared memory and persistence. A secondary goal is to attempt to illustrate the additional possibilities of metaobject programming over non-metalevel techniques. 相似文献
4.
A very simple algorithm for computing all k nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering. 相似文献
5.
6.
Thao P. Nghiem Kiki Maulana Kinh Nguyen David Green Agustinus Borgy Waluyo David Taniar 《Journal of Parallel and Distributed Computing》2014
The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks. 相似文献
7.
针对光照变化人脸识别问题中传统的光谱回归算法不能很好地进行特征提取而严重影响识别性能的问题,提出了局部判别嵌入优化光谱回归分类的人脸识别算法。计算出训练样本的特征向量;借助于数据的近邻和分类关系,利用局部判别嵌入算法构建分类问题所需的嵌入,同时学习每种分类的子流形所需的嵌入;利用光谱回归分类算法计算投影矩阵,并利用最近邻分类器完成人脸的识别。在两大人脸数据库扩展YaleB及CMU PIE上的实验验证了该算法的有效性,实验结果表明,相比其他光谱回归算法,该算法取得了更高的识别率、更好的工作特性,并且降低了计算复杂度。 相似文献
8.
为解决动态环境中移动点的连续反向最近邻查询问题,将连续反向最近邻查询分为单色和双色2种情况进行研究。利用移动点Voronoi图,分别给出单色连续反向最近邻查询算法、双色连续反向最近邻查询算法以及相关定理,对算法正确性和可终止性进行证明,分析算法时间复杂性。按照移动点Voronoi图的拓扑结构是否改变分为2种情况,分析每种情况下候选所在区域的变化,在变化区域内进行Voronoi图的重构,得到对应的解决方法。在多数情况下,该算法只需生成局部移动点的Voronoi图即可找到结果,减小了连续反向最近邻查询的代价。 相似文献
9.
10.
基于RTX的工程飞行模拟器数据采集与存储系统设计 总被引:1,自引:0,他引:1
在一些仿真应用中,由于Windows操作系统较差的实时性,从而给许多半物理仿真试验带来了一些不确定的因素.在充分论证的基础上,引入了Ardence公司的基于Windows的硬实时解决方案RTX(Real-Time eXtension),并结合某型号飞行器仿真课题总结出了Windows环境下RTX实时应用系统的设计方法与开发流程以及RTX下硬件板卡驱动程序的编写,最后将这种设计方法成功应用在某型号飞行器飞行仿真系统中.实验证明该仿真系统是可靠的、稳定的,整个实验过程中飞行器的飞行数据没有丢失,仿真周期确定,结果正确,RTX仿真程序能够满足系统对实时性和确定性的要求. 相似文献