全文获取类型
收费全文 | 1309篇 |
免费 | 147篇 |
国内免费 | 127篇 |
学科分类
工业技术 | 1583篇 |
出版年
2024年 | 3篇 |
2023年 | 27篇 |
2022年 | 28篇 |
2021年 | 42篇 |
2020年 | 44篇 |
2019年 | 55篇 |
2018年 | 49篇 |
2017年 | 38篇 |
2016年 | 58篇 |
2015年 | 59篇 |
2014年 | 79篇 |
2013年 | 86篇 |
2012年 | 106篇 |
2011年 | 122篇 |
2010年 | 85篇 |
2009年 | 89篇 |
2008年 | 89篇 |
2007年 | 82篇 |
2006年 | 63篇 |
2005年 | 54篇 |
2004年 | 43篇 |
2003年 | 47篇 |
2002年 | 26篇 |
2001年 | 26篇 |
2000年 | 24篇 |
1999年 | 16篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 16篇 |
1995年 | 8篇 |
1994年 | 20篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1985年 | 2篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1964年 | 1篇 |
排序方式: 共有1583条查询结果,搜索用时 484 毫秒
1.
对复杂高阶系统进行模型简化,为研究与设计系统提供了方便的条件。对系统模型的降阶是控制系统设计与仿真工作者的一个重要研究课题,对高阶复杂系统的分析、设计、仿真等具有重要的理论意义和工程实用价值。针对目前比较成熟的基于系统矩阵的有序实Schur分解方法,提出了采用时矩输出拟合来改善降阶系统输出响应逼近程度的改进方法,从而使简化模型具有输出误差更小、计算简便等优点,通过给出的实例仿真证实了这一点。 相似文献
2.
H. W. Brinks V. A. Yartys B. C. Hauback H. Fjellvg B. Ouladdiaf 《Journal of Alloys and Compounds》2002,340(1-2):62-66
TbNiSiD1.78 has been studied by powder neutron diffraction below 100 K. The compound takes the hexagonal room temperature structure at 100 and 50 K (P63/mmc). At 2 K, below the antiferromagnetic ordering temperature of 10 K, there is a small orthorhombic distortion of the lattice. The refined unit-cell dimensions at 2 K (space group Pnma) are a=7.9505(2), b=4.02502(14), c=6.9823(2) Å. The magnetic moments of Tb are 8.71(6) μB, and are ordered antiferromagnetically along a. 相似文献
3.
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to satisfy the constraint. The time-invariant counterpart has already been investigated in Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear]. We first define the POA set for time-varying uncertainties with finite dimensional probability space. Then, we show that an algorithm similar to Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear] provides the POA set also in the time-varying case, as long as an upper bound of a what we call future output admissibility (FOA) index is available. We moreover present two methods for computing the upper bound of the FOA index: probabilistic and deterministic methods. A numerical simulation demonstrates the effectiveness of our algorithm. 相似文献
4.
5.
应用有序聚类法对辽宁省锦凌水库坝基的风化岩体进行定量分带,所得结果与地质观察方法、规范法等所得出的结果进行了分析比较.采用岩体风化差异系数法进行综合分析,最终推荐按照有序聚类方法进行风化岩体分带. 相似文献
6.
Similarity retrieval of iconic image database 总被引:3,自引:0,他引:3
The perception of spatial relationships among objects in a picture is one of the important selection criteria to discriminate and retrieve the images in an iconic image database system. The data structure called 2D string, proposed by Chang et al., is adopted to represent symbolic pictures. The 2D string preserves the objects' spatial knowledge embedded in images. Since spatial relationship is a fuzzy concept, the capability of similarity retrieval for the retrieval by subpicture is essential. In this paper, similarity measure based on 2D string longest common subsequence is defined. The algorithm for similarity retrieval is also proposed. Similarity retrieval provides the iconic image database with the distinguishing function different from a conventional database. 相似文献
7.
8.
9.
10.
The generalized assignment problem with special ordered sets (GAPS2), is the problem of allocating n tasks to m time-periods, where each task must be assigned to a time-period, or shared between two consecutive time-periods. For reasonably large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard mathematical programming software, hence there is a need for heuristic algorithms to solve such problems. It will be shown how an LP-based heuristic developed previously for the well-established generalized assignment problem can be modified and extended to solve GAPS2. Encouraging results, in terms of speed and accuracy, in particular when compared to an existing heuristic for GAPS2, are described. 相似文献