全文获取类型
收费全文 | 15601篇 |
免费 | 358篇 |
国内免费 | 149篇 |
专业分类
电工技术 | 234篇 |
综合类 | 10篇 |
化学工业 | 1802篇 |
金属工艺 | 504篇 |
机械仪表 | 212篇 |
建筑科学 | 262篇 |
矿业工程 | 5篇 |
能源动力 | 219篇 |
轻工业 | 553篇 |
水利工程 | 59篇 |
石油天然气 | 31篇 |
无线电 | 752篇 |
一般工业技术 | 1019篇 |
冶金工业 | 312篇 |
原子能技术 | 119篇 |
自动化技术 | 10015篇 |
出版年
2024年 | 6篇 |
2023年 | 86篇 |
2022年 | 248篇 |
2021年 | 322篇 |
2020年 | 174篇 |
2019年 | 213篇 |
2018年 | 212篇 |
2017年 | 207篇 |
2016年 | 250篇 |
2015年 | 213篇 |
2014年 | 477篇 |
2013年 | 613篇 |
2012年 | 1149篇 |
2011年 | 3490篇 |
2010年 | 1452篇 |
2009年 | 1323篇 |
2008年 | 950篇 |
2007年 | 822篇 |
2006年 | 651篇 |
2005年 | 716篇 |
2004年 | 642篇 |
2003年 | 662篇 |
2002年 | 355篇 |
2001年 | 66篇 |
2000年 | 58篇 |
1999年 | 77篇 |
1998年 | 162篇 |
1997年 | 86篇 |
1996年 | 65篇 |
1995年 | 28篇 |
1994年 | 39篇 |
1993年 | 31篇 |
1992年 | 19篇 |
1991年 | 16篇 |
1990年 | 21篇 |
1989年 | 16篇 |
1988年 | 14篇 |
1987年 | 17篇 |
1986年 | 13篇 |
1985年 | 18篇 |
1984年 | 31篇 |
1983年 | 27篇 |
1982年 | 13篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 10篇 |
1973年 | 3篇 |
1971年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Ezequiel López-Rubio Author Vitae 《Pattern recognition》2010,43(5):1835-1846
Many approaches to image restoration are aimed at removing either Gaussian or uniform impulsive noise. This is because both types of degradation processes are distinct in nature, and hence they are easier to manage when considered separately. Nevertheless, it is possible to find them operating on the same image, which produces a hard damage. This happens when an image, already contaminated by Gaussian noise in the image acquisition procedure, undergoes impulsive corruption during its digital transmission. Here we propose a principled method to remove both types of noise. It is based on a Bayesian classification of the input pixels, which is combined with the kernel regression framework. 相似文献
992.
Robust model predictive control of constrained linear systems with bounded disturbances 总被引:2,自引:0,他引:2
This paper provides a novel solution to the problem of robust model predictive control of constrained, linear, discrete-time systems in the presence of bounded disturbances. The optimal control problem that is solved online includes, uniquely, the initial state of the model employed in the problem as a decision variable. The associated value function is zero in a disturbance invariant set that serves as the ‘origin’ when bounded disturbances are present, and permits a strong stability result, namely robust exponential stability of the disturbance invariant set for the controlled system with bounded disturbances, to be obtained. The resultant online algorithm is a quadratic program of similar complexity to that required in conventional model predictive control. 相似文献
993.
Yuhua Qian Author Vitae Jiye Liang Author Vitae Witold Pedrycz Author Vitae 《Pattern recognition》2011,44(8):1658-1670
Feature selection (attribute reduction) from large-scale incomplete data is a challenging problem in areas such as pattern recognition, machine learning and data mining. In rough set theory, feature selection from incomplete data aims to retain the discriminatory power of original features. To address this issue, many feature selection algorithms have been proposed, however, these algorithms are often computationally time-consuming. To overcome this shortcoming, we introduce in this paper a theoretic framework based on rough set theory, which is called positive approximation and can be used to accelerate a heuristic process for feature selection from incomplete data. As an application of the proposed accelerator, a general feature selection algorithm is designed. By integrating the accelerator into a heuristic algorithm, we obtain several modified representative heuristic feature selection algorithms in rough set theory. Experiments show that these modified algorithms outperform their original counterparts. It is worth noting that the performance of the modified algorithms becomes more visible when dealing with larger data sets. 相似文献
994.
Ehsan Hashemi Maani Ghaffari Jadidi Navid Ghaffari JadidiAuthor vitae 《Robotics and Autonomous Systems》2011,59(11):930-942
The purpose of this study is to suggest and examine a PI–fuzzy path planner and associated low-level control system for a linear discrete dynamic model of omni-directional mobile robots to obtain optimal inputs for drivers. Velocity and acceleration filtering is also implemented in the path planner to satisfy planning prerequisites and prevent slippage. Regulated drivers’ rotational velocities and torques greatly affect the ability of these robots to perform trajectory planner tasks. These regulated values are examined in this research by setting up an optimal controller. Introducing optimal controllers such as linear quadratic tracking for multi-input–multi-output control systems in acceleration and deceleration is one of the essential subjects for motion control of omni-directional mobile robots. The main topics presented and discussed in this article are improvements in the presented discrete-time linear quadratic tracking approach such as the low-level controller and combined PI–fuzzy path planner with appropriate speed monitoring algorithm such as the high-level one in conditions both with and without external disturbance. The low-level tracking controller presented in this article provides an optimal solution to minimize the differences between the reference trajectory and the system output. The efficiency of this approach is also compared with that of previous PID controllers which employ kinematic modeling. Utilizing the new approach in trajectory-planning controller design results in more precise and appropriate outputs for the motion of four-wheeled omni-directional mobile robots, and the modeling and experimental results confirm this issue. 相似文献
995.
Faridah M. Ali Author Vitae A. Shoba Das Author Vitae 《Computers & Electrical Engineering》2004,30(7):471-489
Real-time systems cover a wide application domain. This paper presents an efficient heuristic algorithm for enforcing the schedulability of aperiodic hard real-time tasks arriving simultaneously with precedence constraints and individual deadlines. The proposed co-synthesis algorithm integrates partitioning and non-preemptive scheduling. Reconfigurable FPGAs are incrementally added when schedulability suffers in a uniprocessor system. Initially, a schedule that minimizes the maximum lateness and satisfies the precedence constraints is made. If individual timing constraints are not met in this schedule, some tasks are selected and transferred to dynamically reconfigured FPGAs. The proposed algorithm was implemented and tested with a large number of task graphs with task size as high as 700 nodes. The algorithm could not only achieve schedulability but also could reduce the total completion time of the task graph. Moreover, incremental addition of reconfigurable FPGAs yielded a cost effective solution. 相似文献
996.
Global exponential synchronization of fuzzy cellular neural networks with delays and reaction-diffusion terms 总被引:2,自引:0,他引:2
Fang YuAuthor VitaeHaijun JiangAuthor Vitae 《Neurocomputing》2011,74(4):509-515
The global exponential synchronization for a class of fuzzy cellular neural networks with delays and reaction-diffusion terms is discussed. Some new sufficient conditions are obtained by using the Lyapunov functional method, many real parameters and inequality techniques. The result is also easy to check and plays an important role in the design and application of globally exponentially synchronization. Finally, an example is given to verify our results. 相似文献
997.
In this paper, we establish the robustness of adaptive controllers designed using the standard backstepping technique with respect to unmodeled dynamics involving unknown input time delay. While noting that some results on robust stabilization of non-minimum phase systems using the backstepping technique are available, we realize that the standard adaptive backstepping technique has only been shown applicable to unknown minimum phase systems. Another significance of our result is to enable the class of systems stablizable by adaptive backstepping controllers to cross the boundary of minimum phase systems, since systems with input time delay belong to non-minimum phase systems. Moreover, the L2 and L∞ norms of the system output are also established as functions of design parameters. This implies that the transient system performance can be adjusted by choosing suitable design parameters. 相似文献
998.
Peter A.C. Varley Author Vitae Pedro P. Company Author Vitae 《Computer aided design》2010,42(4):279-309
The problem of identifying the topology implied by wireframe drawings of polyhedral objects requires the identification of face loops, loops of edges which correspond to a face in the object the drawing portrays.In this paper, we survey the advantages and limitations of known approaches, and present and discuss test results which illustrate the successes and failures of a currently popular approach based on Dijkstra’s Algorithm. We conclude that the root cause of many failure cases is that the underlying algorithm assumes that the cost of traversing an edge is fixed.We propose a new polynomial-order algorithm for finding faces in wireframes. This algorithm could be adapted to any graph-theoretical least-cost circuit problem where the cost of traversing an edge is not fixed but context-dependent. 相似文献
999.
Accurate grading for hepatocellular carcinoma (HCC) biopsy images is important to prognosis and treatment planning. In this paper, we propose an automatic system for grading HCC biopsy images. In preprocessing, we use a dual morphological grayscale reconstruction method to remove noise and accentuate nuclear shapes. A marker-controlled watershed transform is applied to obtain the initial contours of nuclei and a snake model is used to segment the shapes of nuclei smoothly and precisely. Fourteen features are then extracted based on six types of characteristics for HCC classification. Finally, we propose a SVM-based decision-graph classifier to classify HCC biopsy images. Experimental results show that 94.54% of classification accuracy can be achieved by using our SVM-based decision-graph classifier while 90.07% and 92.88% of classification accuracy can be achieved by using k-NN and SVM classifiers, respectively. 相似文献
1000.
Sunggeun Park Author Vitae 《Journal of Systems and Software》2009,82(12):2012-2022
Broadcast is widely accepted as an efficient technique for disseminating data to a large number of mobile clients over a single or multiple channels. Due to the limited uplink bandwidth from mobile clients to server, conventional concurrency control methods cannot be directly applied. There has been many researches on concurrency control methods for wireless broadcast environments. However, they are mostly for read-only transactions or do not consider exploiting cache. They also suffer from the repetitive aborts and restarts of mobile transactions when the access patterns of mobile transactions are skewed. In this paper, we propose a new optimistic concurrency control method suitable for mobile broadcast environments. To prevent the repetitive aborts and restarts of mobile transactions, we propose a random back-off technique. To exploit the cache on mobile clients, our method keeps the read data set of mobile transactions and prefetches those data items when the mobile transactions are restarted. As other existing optimistic concurrency control methods for mobile broadcast environments does, it works for both read-only and update transactions. Read-only transactions are validated and locally committed without using any uplink bandwidth. Update transactions are validated with forward and backward validation, and committed after final validation consuming a small amount of uplink bandwidth. Our performance analysis shows that it significantly decreases uplink and downlink bandwidth usage compared to other existing methods. 相似文献