全文获取类型
收费全文 | 5050篇 |
免费 | 305篇 |
国内免费 | 241篇 |
专业分类
电工技术 | 104篇 |
综合类 | 89篇 |
化学工业 | 375篇 |
金属工艺 | 97篇 |
机械仪表 | 270篇 |
建筑科学 | 274篇 |
矿业工程 | 105篇 |
能源动力 | 182篇 |
轻工业 | 135篇 |
水利工程 | 26篇 |
石油天然气 | 14篇 |
武器工业 | 12篇 |
无线电 | 493篇 |
一般工业技术 | 929篇 |
冶金工业 | 87篇 |
原子能技术 | 29篇 |
自动化技术 | 2375篇 |
出版年
2024年 | 3篇 |
2023年 | 57篇 |
2022年 | 69篇 |
2021年 | 102篇 |
2020年 | 167篇 |
2019年 | 136篇 |
2018年 | 209篇 |
2017年 | 211篇 |
2016年 | 226篇 |
2015年 | 186篇 |
2014年 | 279篇 |
2013年 | 731篇 |
2012年 | 245篇 |
2011年 | 345篇 |
2010年 | 217篇 |
2009年 | 274篇 |
2008年 | 291篇 |
2007年 | 282篇 |
2006年 | 235篇 |
2005年 | 195篇 |
2004年 | 180篇 |
2003年 | 177篇 |
2002年 | 123篇 |
2001年 | 96篇 |
2000年 | 69篇 |
1999年 | 67篇 |
1998年 | 78篇 |
1997年 | 58篇 |
1996年 | 40篇 |
1995年 | 33篇 |
1994年 | 21篇 |
1993年 | 22篇 |
1992年 | 30篇 |
1991年 | 23篇 |
1990年 | 25篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 10篇 |
1984年 | 6篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1974年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有5596条查询结果,搜索用时 15 毫秒
101.
A. J. Rojas 《Asian journal of control》2013,15(1):132-141
In the present paper we obtain an explicit closed‐form solution for the discrete‐time algebraic Riccati equation (DTARE) with vanishing state weight, whenever the unstable eigenvalues are distinct. We discuss links to current algorithmic solutions and observe that the AREs in such a class solve on one hand the infimal signal‐to‐noise ratio (SNR) problem, whilst on the other hand, in their dual form they solve a Kalman filter problem. We then extend the main result to an example case of the optimal linear quadratic regulator gain. We relax some of the assumptions behind the main result and conclude with possible future directions for the present work. 相似文献
102.
This paper deals with the problem of forbidden states in safe Petri nets to obtain a maximally permissive controller. To prevent the system from entering the forbidden states, assigning some constraints to them is possible. The constraints can be enforced on the system using control places. When the number of forbidden states is large, a large number of constraints should be assigned to them. This results in a large number of control places being added to the model of the system, which causes a complicated model. Some methods have been proposed to reduce the number of constraints. Nevertheless, they do not always give the best results. In this paper, two ideas are offered to reduce the number of constraints, giving a more simplified controller. 相似文献
103.
104.
陈依鹏 《计算机光盘软件与应用》2011,(20)
随着现代信息社会对通信业务要求的不断增长,图像通信与通信容量的矛盾日益突出。为了缓解网络带宽的不足、加快图像信息的传播速度,对于基于高比率的图像压缩算法的研究很有必要。目前比较流行的多级树集合分裂算法压缩效果比较好,输出的比特流较少,但是需要对内存中的数据反复的读取,且反复的在链表结构中扫描不重要系数,增加内存的负担及软硬件实现的复杂度,从而降低了编码的效率。本文针对多级树集合分裂算法的缺点提出了一种基于离散小波变换的改进的多级树集合分裂算法,通过对小波系数排序过程的调整,减少了对内存反复的读取操作,减轻了对内存造成的负担,提高了编码的效率。 相似文献
105.
一种MIMO-OFDM系统的信道估计算法 总被引:1,自引:1,他引:0
导频辅助的最小平方(LS)算法是MIMO—OFDM系统中常用的信道估计方法,特点是易于实现,但精度不高。基于最小均方误差(MMSE)的信道估计算法性能较好,但复杂度高,难以实现。提出了一种基于离散傅里叶变换(DFT)的信道估计算法,首先将LS信道估计循环前缀长度以外的时域响应值置零,然后选择重要路径,再通过计算参考导频的相位偏移量来进行补偿,最终实现信道的估计。算法能够满足一定的估计精度,且便于实现。仿真数据证明了算法的有效性。 相似文献
106.
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one of which complements an earlier result of [L. Benvenuti, L. Farina, An example of how positivity may force realizations of ‘large’ dimensions, Systems Control Lett. 36 (1999) 261–266]. Finally, we improve a lower-bound of [B. Nagy, M. Matolcsi, A lower-bound on the dimension of positive realizations, IEEE Trans. Circuits Syst. I 50 (2003) 782–784] to indicate that the algorithm is indeed efficient in general. 相似文献
107.
Dimas?Martínez?MoreraEmail author Paulo?Cezar?Carvalho Luiz?Velho 《The Visual computer》2008,24(12):1025-1037
This paper discusses the problem of modeling on triangulated surfaces with geodesic curves. In the first part of the paper
we define a new class of curves, called geodesic Bézier curves, that are suitable for modeling on manifold triangulations. As a natural generalization of Bézier curves, the new curves
are as smooth as possible. In the second part we discuss the construction of C
0 and C
1 piecewise Bézier splines. We also describe how to perform editing operations, such as trimming, using these curves. Special
care is taken to achieve interactive rates for modeling tasks. The third part is devoted to the definition and study of convex
sets on triangulated surfaces. We derive the convex hull property of geodesic Bézier curves.
相似文献
Luiz VelhoEmail: |
108.
A common way of computing all efficient (Pareto optimal) solutions for a biobjective combinatorial optimisation problem is to compute first the extreme efficient solutions and then the remaining, non-extreme solutions. The second phase, the computation of non-extreme solutions, can be based on a “k-best” algorithm for the single-objective version of the problem or on the branch-and-bound method. A k-best algorithm computes the k-best solutions in order of their objective values. We compare the performance of these two approaches applied to the biobjective minimum spanning tree problem. Our extensive computational experiments indicate the overwhelming superiority of the k-best approach. We propose heuristic enhancements to this approach which further improve its performance. 相似文献
109.
Plant floor material handling is a loose loop in most assembly plants. Simulation offers a quick, controllable and tunable approach for prototyping complex material handling processes in manufacturing environments. This paper proposes a hybrid simulation approach, using both discrete event and agent-based technologies, to model complex material handling processes in an assembly line. A prototype system is implemented using a commercial multi-paradigm modeling tool. In this prototype, JIT principles are applied to both the production and the material handling processes. The system performance is evaluated and system optimization directions are suggested. The proposed hybrid modeling approach facilitates the implementation of a responsive and adaptive environment in that various “what-if” scenarios can be simulated under different simulation configurations and real-time situations. 相似文献
110.
Mehdi Ghatee S. Mehdi Hashemi Behnam Hashemi Mehdi Dehghan 《Computers & Mathematics with Applications》2008,55(12):2767-2790
Duality properties have been investigated by many researchers in the recent literature. They are introduced in this paper for a fully fuzzified version of the minimal cost flow problem, which is a basic model in network flow theory. This model illustrates the least cost of the shipment of a commodity through a capacitated network in terms of the imprecisely known available supplies at certain nodes which should be transmitted to fulfil uncertain demands at other nodes. First, we review on the most valuable results on fuzzy duality concepts to facilitate the discussion of this paper. By applying Hukuhara’s difference, approximated and exact multiplication and Wu’s scalar production, we exhibit the flow in network models. Then, we use combinatorial algorithms on a reduced problem which is derived from fully fuzzified MCFP to acquire fuzzy optimal flows. To give duality theorems, we utilize a total order on fuzzy numbers due to the level of risk and realize optimality conditions for providing some efficient combinatorial algorithms. Finally, we compare our results with the previous worthwhile works to demonstrate the efficiency and power of our scheme and the reasonability of our solutions in actual decision-making problems. 相似文献