全文获取类型
收费全文 | 62009篇 |
免费 | 4812篇 |
国内免费 | 2742篇 |
专业分类
电工技术 | 3291篇 |
技术理论 | 6篇 |
综合类 | 4113篇 |
化学工业 | 10534篇 |
金属工艺 | 3865篇 |
机械仪表 | 3827篇 |
建筑科学 | 4673篇 |
矿业工程 | 2199篇 |
能源动力 | 1966篇 |
轻工业 | 3555篇 |
水利工程 | 1074篇 |
石油天然气 | 4538篇 |
武器工业 | 459篇 |
无线电 | 6474篇 |
一般工业技术 | 7234篇 |
冶金工业 | 3356篇 |
原子能技术 | 721篇 |
自动化技术 | 7678篇 |
出版年
2024年 | 245篇 |
2023年 | 1001篇 |
2022年 | 1726篇 |
2021年 | 2449篇 |
2020年 | 1841篇 |
2019年 | 1657篇 |
2018年 | 1845篇 |
2017年 | 2047篇 |
2016年 | 1827篇 |
2015年 | 2359篇 |
2014年 | 3009篇 |
2013年 | 3477篇 |
2012年 | 3667篇 |
2011年 | 4029篇 |
2010年 | 3692篇 |
2009年 | 3298篇 |
2008年 | 3268篇 |
2007年 | 3227篇 |
2006年 | 3195篇 |
2005年 | 2769篇 |
2004年 | 2041篇 |
2003年 | 2145篇 |
2002年 | 2484篇 |
2001年 | 2080篇 |
2000年 | 1612篇 |
1999年 | 1704篇 |
1998年 | 1253篇 |
1997年 | 1068篇 |
1996年 | 1106篇 |
1995年 | 848篇 |
1994年 | 632篇 |
1993年 | 468篇 |
1992年 | 365篇 |
1991年 | 274篇 |
1990年 | 206篇 |
1989年 | 166篇 |
1988年 | 153篇 |
1987年 | 88篇 |
1986年 | 69篇 |
1985年 | 37篇 |
1984年 | 38篇 |
1983年 | 27篇 |
1982年 | 25篇 |
1981年 | 14篇 |
1980年 | 22篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 19 毫秒
101.
102.
103.
Identical twins pose a great challenge to face recognition due to high similarities in their appearances. Motivated by the psychological findings that facial motion contains identity signatures and the observation that twins may look alike but behave differently, we develop a talking profile to use the identity signatures in the facial motion to distinguish between identical twins. The talking profile for a subject is defined as a collection of multiple types of usual face motions from the video. Given two talking profiles, we compute the similarities of the same type of face motion in both profiles and then perform the classification based on those similarities. To compute the similarity of each type of face motion, we give higher weights to more abnormal motions which are assumed to carry more identity signature information. 相似文献
104.
105.
106.
107.
Massive computation power and storage capacity of cloud computing systems allow scientists to deploy data-intensive applications without the infrastructure investment, where large application datasets can be stored in the cloud. Based on the pay-as-you-go model, data placement strategies have been developed to cost-effectively store large volumes of generated datasets in the scientific cloud workflows. As promising as it is, this paradigm also introduces many new challenges for data security when the users outsource sensitive data for sharing on the cloud servers, which are not within the same trusted domain as the data owners. This challenge is further complicated by the security constraints on the potential sensitive data for the scientific workflows in the cloud. To effectively address this problem, we propose a security-aware intermediate data placement strategy. First, we build a security overhead model to reasonably measure the security overheads incurred by the sensitive data. Second, we develop a data placement strategy to dynamically place the intermediate data for the scientific workflows. Finally, our experimental results show that our strategy can effectively improve the intermediate data security while ensuring the data transfer time during the execution of scientific workflows. 相似文献
108.
109.
Twin support vector machine (TSVM) is regarded as a milestone in the development of the powerful SVM. It finds two nonparallel planes by resolving a pair of smaller-sized quadratic programming problems rather than a single large one, which makes the learning speed of TSVM approximately four times faster than that of the standard SVM. However, the empirical risk minimization principle is implemented in the TSVM, so it easily leads to the over-fitting problem and reduces the prediction accuracy of the classifier. ν-TSVM, as a variant of TSVM, also implements the empirical risk minimization principle. To enhance the generalization ability of the classifier, we propose an improved ν-TSVM by introducing a regularization term into the objective function, so there are two parts in the objective function, one of which is to maximize the margin between the two parallel hyper-planes, and the other one is to minimize the training errors of two classes of samples. Therefore the structural risk minimization principle is implemented in our improved ν-TSVM. Numerical experiments on one artificial dataset and nine benchmark datasets show that our improved ν-TSVM yields better generalization performance than SVM, ν-SVM, and ν-TSVM. Moreover, numerical experiments with different proportions of outliers demonstrate that our improved ν-TSVM is robust and stable. Finally, we apply our improved ν-TSVM to two BCI competition datasets, and also obtain better prediction accuracy. 相似文献
110.
In this paper, nonlinear mapping (NM)-based backstepping control design is presented for a class of strict-feedback nonlinear systems with output constraint. By mapping output value set onto the set of all real numbers, the constrained system is transformed into a new strict-feedback unconstrained system to employ the traditional backstepping control while simultaneously preventing the constraint from being violated. It is proved that the original system has the similar convergence and bounded properties with the new one. Besides the nominal case where full knowledge of the plant is available, we also tackle scenarios wherein parametric uncertainties are present. Furthermore, the comparison with barrier Lyapunov function-based algorithm reveals the advantages of NM algorithm. The closed-loop system is guaranteed to be stable in the sense that all signals involved remain bounded, and the tracking error converges to zero asymptotically. Simulation studies illustrate the performance of the proposed control. 相似文献