全文获取类型
收费全文 | 13328篇 |
免费 | 1136篇 |
国内免费 | 600篇 |
专业分类
电工技术 | 809篇 |
技术理论 | 1篇 |
综合类 | 806篇 |
化学工业 | 2097篇 |
金属工艺 | 863篇 |
机械仪表 | 743篇 |
建筑科学 | 927篇 |
矿业工程 | 353篇 |
能源动力 | 412篇 |
轻工业 | 841篇 |
水利工程 | 237篇 |
石油天然气 | 774篇 |
武器工业 | 91篇 |
无线电 | 1680篇 |
一般工业技术 | 1645篇 |
冶金工业 | 815篇 |
原子能技术 | 164篇 |
自动化技术 | 1806篇 |
出版年
2024年 | 77篇 |
2023年 | 201篇 |
2022年 | 341篇 |
2021年 | 510篇 |
2020年 | 387篇 |
2019年 | 335篇 |
2018年 | 411篇 |
2017年 | 435篇 |
2016年 | 386篇 |
2015年 | 493篇 |
2014年 | 640篇 |
2013年 | 705篇 |
2012年 | 795篇 |
2011年 | 830篇 |
2010年 | 722篇 |
2009年 | 716篇 |
2008年 | 717篇 |
2007年 | 727篇 |
2006年 | 701篇 |
2005年 | 606篇 |
2004年 | 398篇 |
2003年 | 464篇 |
2002年 | 447篇 |
2001年 | 390篇 |
2000年 | 365篇 |
1999年 | 362篇 |
1998年 | 342篇 |
1997年 | 317篇 |
1996年 | 305篇 |
1995年 | 212篇 |
1994年 | 172篇 |
1993年 | 128篇 |
1992年 | 94篇 |
1991年 | 84篇 |
1990年 | 66篇 |
1989年 | 45篇 |
1988年 | 33篇 |
1987年 | 26篇 |
1986年 | 20篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 24 毫秒
101.
102.
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so
as to minimize a cost function subject to each task meeting its own constraint. It has been shown that the off-line version
of this problem can be efficiently solved by the Critical Task Decomposition Algorithm (CTDA) (Mao et al., IEEE Trans Mobile Comput 6(6):678–688, 2007). In the on-line version, random task characteristics (e.g., arrival times) are not known in advance. To bypass this difficulty,
worst-case analysis may be used. This, however, does not make use of probability distributions and results in an overly conservative
solution. In this paper, we develop a new approach which does not rely on worst-case analysis but provides a “best solution
in probability” efficiently obtained by estimating the probability distribution of sample-path-optimal solutions. We introduce
a condition termed “non-singularity” under which the best solution in probability leads to the on-line optimal control. Numerical
examples are included to illustrate our results and show substantial performance improvements over worst-case analysis. 相似文献
103.
Yi-Bo Wu Juang Wang Chun-Ping Yan Sheng-Ping Mao Cong-Chun Zhang Hong Wang Gui-Fu Ding 《Microsystem Technologies》2010,16(11):1869-1879
Bistable micro mechanisms are gaining great attention in MEMS applications. This paper presents the mechanical modeling and
experimental characterization of a bistable torsion/cantilever micro latching mechanism for performing low power bistable
relay applications. The bistable micro mechanism consists of two cantilevers which form symmetrical rocker levers. The free–free
cantilever is suspended by a diamond skeleton which in turn is attached to a torsion cantilever. A permanent magnet is placed
beside for holding the closed state with a permalloy soft magnetic circuit. The special diamond support is designed to enhance
the stiffness of the overhang beams. In order to deduce the spring stiffness of system, a mechanical modeling of the leveraged
torsion/cantilever system was performed by Castigliano’s theorem. Meanwhile, the magnetostatic latching force was also deduced
by the Maxwell electromagnetism theory. Then the device has been prepared by a laminated copper sacrificial layer process.
This process can facilitate the fabrication complexities of traditional magnetic device with coil structures. Finally, mechanical
performance was characterized by an atomic force microscopy, combined with finite element simulation using ANSYS™ package and analysis model as well. Two stable states of the micro mechanism were hold successfully with no power consumption
by interferoscope profilometry of WYKO optical profiling system. 相似文献
104.
Due to time spent in computation and transfer, control input is usually subject to delays. Problems of deterministic systems with input delay have received considerable attention. However, relatively few works are concerned with problems of stochastic system with input delay. This paper studies delayed-feedback stabilization of uncertain stochastic systems. Based on a new delay-dependent stability criterion established in this paper, a robust delayed-state-feedback controller that exponentially stabilizes the uncertain stochastic systems is proposed. Numerical examples are given to verify the effectiveness and less conservativeness of the proposed method. 相似文献
105.
Lirong Huang Xuerong Mao 《Automatic Control, IEEE Transactions on》2009,54(8):1898-1902
This note develops a Razumikhin-type theorem on pth moment input-to-state stability of hybrid stochastic retarded systems (also known as stochastic retarded systems with Markovian switching), which is an improvement of an existing result. An application to hybrid stochastic delay systems verifies the effectiveness of the improved result. 相似文献
106.
Tongqing Qiu Edward Chan Mao Ye Guihai Chen Ben Y. Zhao 《The Journal of supercomputing》2009,48(1):15-42
A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of an underlying
physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch
between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization
Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized
one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency
of the overlay and achieve a better logical topology with low overhead. Their overall performance can be further improved
if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems
without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is
more efficient, especially in a heterogenous environment where nodes have different processing capabilities.
相似文献
Edward ChanEmail: |
107.
This article presents a fast self-localization method based on ZigBee wireless sensor network and laser sensor, an obstacle
avoidance algorithm based on ultrasonic sensors for a mobile robot. The positioning system and positioning theory of ZigBee
which can obtain a rough global localization of the mobile robot are introduced. To realize accurate local positioning, a
laser sensor is used to extract the features from environment, then the environmental features and global reference map can
be matched. From the matched environmental features, the position and orientation of the mobile robot can be obtained. To
enable the mobile robot to avoid obstacle in real-time, a heuristic fuzzy neural network is developed by using heuristic fuzzy
rules and the Kohonen clustering network. The experiment results show the effectiveness of the proposed method. 相似文献
108.
基于小波多分辨率分析的指横纹定位新算法 总被引:2,自引:0,他引:2
针对指横纹感兴趣区域(ROI)难以准确定位的问题,在明确提出指横纹ROI定义的前提下,提出利用小波多分辨率分析进行指横纹ROI自动检测定位的新算法.该方法利用纹理相似性原理,在高频子图采用基于特征向量和区域生长法产生指横纹的候选子区域集合,然后利用低频子图Radon投影得到的指横纹的区域特征对候选子区域进行验证,最后结合直线拟合手指轮廓得到指横纹在原图的有效位置,最终实现指横纹ROI的精准定位.实验证明该算法不仅能有效克服噪声以及手形姿态变化的影响,并且对多种情况有很强的鲁棒性. 相似文献
109.
110.
Representative skyline computation is a fundamental issue in database area, which has attracted much attention in recent years. A notable definition of representative skyline is the distance-based representative skyline (DBRS). Given an integer k, a DBRS includes k representative skyline points that aims at minimizing the maximal distance between a non-representative skyline point and its nearest representative. In the 2D space, the state-of-the-art algorithm to compute the DBRS is based on dynamic programming (DP) which takes O(k m 2) time complexity, where m is the number of skyline points. Clearly, such a DP-based algorithm cannot be used for handling large scale datasets due to the quadratic time cost. To overcome this problem, in this paper, we propose a new approximate algorithm called ARS, and a new exact algorithm named PSRS, based on a carefully-designed parametric search technique. We show that the ARS algorithm can guarantee a solution that is at most ?? larger than the optimal solution. The proposed ARS and PSRS algorithms run in O(klog2mlog(T/??)) and O(k 2 log3m) time respectively, where T is no more than the maximal distance between any two skyline points. We also propose an improved exact algorithm, called PSRS+, based on an effective lower and upper bounding technique. We conduct extensive experimental studies over both synthetic and real-world datasets, and the results demonstrate the efficiency and effectiveness of the proposed algorithms. 相似文献