全文获取类型
收费全文 | 5133篇 |
免费 | 788篇 |
国内免费 | 682篇 |
专业分类
电工技术 | 390篇 |
综合类 | 567篇 |
化学工业 | 174篇 |
金属工艺 | 109篇 |
机械仪表 | 601篇 |
建筑科学 | 177篇 |
矿业工程 | 55篇 |
能源动力 | 103篇 |
轻工业 | 26篇 |
水利工程 | 72篇 |
石油天然气 | 146篇 |
武器工业 | 106篇 |
无线电 | 509篇 |
一般工业技术 | 634篇 |
冶金工业 | 53篇 |
原子能技术 | 17篇 |
自动化技术 | 2864篇 |
出版年
2024年 | 41篇 |
2023年 | 114篇 |
2022年 | 163篇 |
2021年 | 169篇 |
2020年 | 233篇 |
2019年 | 203篇 |
2018年 | 208篇 |
2017年 | 196篇 |
2016年 | 257篇 |
2015年 | 253篇 |
2014年 | 319篇 |
2013年 | 345篇 |
2012年 | 343篇 |
2011年 | 406篇 |
2010年 | 286篇 |
2009年 | 295篇 |
2008年 | 328篇 |
2007年 | 338篇 |
2006年 | 291篇 |
2005年 | 282篇 |
2004年 | 258篇 |
2003年 | 188篇 |
2002年 | 212篇 |
2001年 | 138篇 |
2000年 | 158篇 |
1999年 | 101篇 |
1998年 | 92篇 |
1997年 | 94篇 |
1996年 | 66篇 |
1995年 | 49篇 |
1994年 | 43篇 |
1993年 | 24篇 |
1992年 | 22篇 |
1991年 | 20篇 |
1990年 | 16篇 |
1989年 | 15篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 5篇 |
1976年 | 1篇 |
排序方式: 共有6603条查询结果,搜索用时 15 毫秒
1.
实体造型中的几何约束 总被引:5,自引:0,他引:5
实体造型是一个基于约束的过程,完成从功能约束到几何约束、再到代数约束的转化而得到实体模型。本文讨论了几何约束的层次性及其表示,并且对几何约束同设计意图的关系进行了研究,提出了基于CSG/GCG/B-rep的模型表示。 相似文献
2.
In this paper the optimal H∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration. 相似文献
3.
4.
几何设计约束的表示与满足问题研究 总被引:3,自引:1,他引:2
对于智能CAD系统来说,具有解决几何设计约束的功能是重要的。本文提出了一种面向对象的几何设计约束表示方法,它可以通过两种方式来表达。文中给出了一个约束传播算法,用于解决约束满足问题。 相似文献
5.
6.
基于概念网络的文本信息监控技术 总被引:1,自引:0,他引:1
由于网上信息的迅速增长,文本信息监控已经成为网上信息管理中的热点研究课题。本文在模糊集和语义网络的理论基础上,构建了模糊值动态约束性概念网络,介绍了该概念网络的基本构建方法,并提出了基于概念网络的文本分析算法。 相似文献
7.
José Luis García-Lapresta 《Information Sciences》2006,176(4):352-365
In this paper we have introduced a class of decision rules related to simple majority, by considering individual intensities of preference. These intensities will be shown by means of linguistic labels. In order to compare the amount of opinion obtained by each alternative, we have considered the total ordered monoid generated by the sums of the original labels, according to an addition and an ordering. In this general framework different sets of linguistic labels can be employed and these sets can be represented by means of diverse mathematical objects. Moreover, on these mathematical representations of linguistic labels several orderings can be considered. Thus, flexibility is an important feature of this new class of group decision making procedures. Some examples of putting in practice the simple majority decision rules based on linguistic labels are provided, and the main properties of these voting systems are analyzed. It is worth emphasizing that these properties are satisfied for any total ordered monoid, regardless of the mathematical representation of linguistic labels or the ordering used to compare collective opinions. 相似文献
8.
Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts 总被引:2,自引:0,他引:2
This paper proposes a performance index to measure the quality level of a stochastic-flow network in which each node has a designated capacity, which will have different lower levels due to various partial and complete failures. The performance index is the probability that the maximum flow of the network equals the demand d without exceeding the budget b. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, b), and then the probability that the maximum flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, b) is a maximal vector representing the capacity of each arc such that the maximum flow of the network under the budget b is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary point for (d−1, b). A benchmark example is shown to illustrate the solution procedure. 相似文献
9.
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times. 相似文献
10.
Bonifacio Llamazares 《Information Sciences》2007,177(21):4745-4756
One of the most important issues in the theory of OWA operators is the determination of associated weights. This matter is essential in order to use the best-suited OWA operator in each aggregation process. Given that some aggregation processes can be seen as extensions of majority rules to the field of gradual preferences, it is possible to determine the OWA operator weights by taking into account the class of majority rule that we want to obtain when individuals do not grade their pairwise preferences. However, a difficulty with this approach is that the same majority rule can be obtained through a wide variety of OWA operators. For this reason, a model for selecting the best-suited OWA operators is proposed in this paper. 相似文献