全文获取类型
收费全文 | 25835篇 |
免费 | 3019篇 |
国内免费 | 3255篇 |
学科分类
工业技术 | 32109篇 |
出版年
2024年 | 88篇 |
2023年 | 277篇 |
2022年 | 470篇 |
2021年 | 501篇 |
2020年 | 591篇 |
2019年 | 520篇 |
2018年 | 521篇 |
2017年 | 739篇 |
2016年 | 774篇 |
2015年 | 994篇 |
2014年 | 1520篇 |
2013年 | 1665篇 |
2012年 | 1862篇 |
2011年 | 2169篇 |
2010年 | 1867篇 |
2009年 | 2075篇 |
2008年 | 2395篇 |
2007年 | 2400篇 |
2006年 | 2196篇 |
2005年 | 1857篇 |
2004年 | 1554篇 |
2003年 | 1231篇 |
2002年 | 956篇 |
2001年 | 793篇 |
2000年 | 592篇 |
1999年 | 352篇 |
1998年 | 230篇 |
1997年 | 185篇 |
1996年 | 121篇 |
1995年 | 108篇 |
1994年 | 83篇 |
1993年 | 83篇 |
1992年 | 53篇 |
1991年 | 48篇 |
1990年 | 29篇 |
1989年 | 36篇 |
1988年 | 20篇 |
1987年 | 13篇 |
1986年 | 14篇 |
1985年 | 18篇 |
1984年 | 11篇 |
1983年 | 12篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1975年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 250 毫秒
71.
一个基于优化的有限元模型修正方法 总被引:10,自引:5,他引:5
本文提供了一个基于一阶搜索优化的有限元模型修正方法。它只需利用结构模态试验的部分固有频率,就能获得较精确的有限元模型。文中附有某无人机上垂尾有限元模型修正的实例。根据上垂尾前二阶试验的固有频率,采用本文方法,对有限元模型进行了修正。修正后有限元模型的前二阶固有频率与试验值的相对误差在2.35%以内,而第三阶固有频率与试验值的相对误差仅为5.81%。它不仅大大地缩小了用修正前有限元模型算得的固有频率与试验值的相对误差,而且还能较精确地预测无试验结果的高阶固有频率值。 相似文献
72.
73.
利用ZM定向凝固装置研究了镍基单晶高温合金DD3在高温度梯度(700~1200K/cm)定向凝固条件下的微观组织演化特征及其对工艺参数的响应函数,结果表明:该合金在高界面温度梯度条件下,柱晶生长速度范围向高速区扩展,从而使单晶亚结构细化成为可能。所得单晶棒中亚结构一次间距可比传统HRS法定向凝固籽晶中相应尺度减小5~10倍。本文还对其组织演化机制进行了分析。 相似文献
74.
针对SAT问题的复杂性及求解速度缓慢的问题,采用可重构器件FPGA设计,实现了静态回溯搜索算法SAT问题并行处理器,提出了研制动态SAT并行处理器的设想。 相似文献
75.
一个表示和运用非功能性需求的框架 总被引:1,自引:0,他引:1
本文分析了一个软件开发进程中表示和运用非功能性需求的综合框架,该框架的目的是开发一套技术以调整软件开发进程中的设计决策,从而强调了依据非功能需求,探索合理化的软件开发进程。 相似文献
76.
This research investigates and approach to query processing in a multidatabase system that uses an objectoriented model to capture the semantics of other data models. The object-oriented model is used to construct a global schema, defining an integrated view of the different schemas in the environment. The model is also used as a self-describing model to build a meta-database for storing information about the global schema. A unique aspect of this work is that the object-oriented model is used to describe the different data models of the multidatabase environment, thereby extending the meta database with semantic information about the local schemas. With the global and local schemas all represented in an object-oriented form, structural mappings between the global schema and each local schema are then easily supported. An object algebra then provides a query language for expressing global queries, using the structural mappings to translate object algebra queries into SQL queries over local relational schema. The advantage of using an object algebra is that the object-oriented database can be viewed as a blackboard for temporary storage of local data and for establishing relationships between different databases. The object algebra can be used to directly retrieve temporarily-stored data from the object-oriented database or to transparently retrieve data from local sources using the translation process described in this paper. 相似文献
77.
Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans 总被引:14,自引:0,他引:14
A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is difficult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans.In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The first algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers. 相似文献
78.
Ibrahim H. Osman Nicos Christofides 《International Transactions in Operational Research》1994,1(3):317-336
The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms. 相似文献
79.
80.