全文获取类型
收费全文 | 256480篇 |
免费 | 30357篇 |
国内免费 | 20996篇 |
专业分类
电工技术 | 23434篇 |
技术理论 | 4篇 |
综合类 | 27365篇 |
化学工业 | 32032篇 |
金属工艺 | 17206篇 |
机械仪表 | 18233篇 |
建筑科学 | 19695篇 |
矿业工程 | 10178篇 |
能源动力 | 6546篇 |
轻工业 | 28560篇 |
水利工程 | 8883篇 |
石油天然气 | 9480篇 |
武器工业 | 3726篇 |
无线电 | 27680篇 |
一般工业技术 | 21998篇 |
冶金工业 | 10002篇 |
原子能技术 | 4355篇 |
自动化技术 | 38456篇 |
出版年
2024年 | 1411篇 |
2023年 | 4111篇 |
2022年 | 10091篇 |
2021年 | 12772篇 |
2020年 | 9378篇 |
2019年 | 6568篇 |
2018年 | 6865篇 |
2017年 | 7741篇 |
2016年 | 6987篇 |
2015年 | 11607篇 |
2014年 | 14450篇 |
2013年 | 17243篇 |
2012年 | 21311篇 |
2011年 | 22691篇 |
2010年 | 21455篇 |
2009年 | 20142篇 |
2008年 | 21078篇 |
2007年 | 20116篇 |
2006年 | 17535篇 |
2005年 | 14118篇 |
2004年 | 10079篇 |
2003年 | 7081篇 |
2002年 | 6540篇 |
2001年 | 5851篇 |
2000年 | 4552篇 |
1999年 | 1972篇 |
1998年 | 776篇 |
1997年 | 600篇 |
1996年 | 474篇 |
1995年 | 422篇 |
1994年 | 286篇 |
1993年 | 256篇 |
1992年 | 211篇 |
1991年 | 168篇 |
1990年 | 145篇 |
1989年 | 126篇 |
1988年 | 79篇 |
1987年 | 59篇 |
1986年 | 56篇 |
1985年 | 28篇 |
1984年 | 32篇 |
1983年 | 31篇 |
1982年 | 31篇 |
1981年 | 42篇 |
1980年 | 77篇 |
1979年 | 45篇 |
1976年 | 5篇 |
1965年 | 4篇 |
1959年 | 60篇 |
1951年 | 51篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
《数据结构》精品课程的教学资源在不断丰富,如何让更多学生更便利的使用到这些资源是课程发展的关键。流媒体技术的应用使大容量视频音频文件在网络中的实时传输成为可能。介绍了流媒体技术的工作原理,阐述了流媒体技术在《数据结构》精品课程项目中的几种应用方向。 相似文献
992.
进入二十一世纪以来,随着数字信息技术和网络技术高速发展,嵌入式系统已经深入到工作和生活的方方面面,嵌入式应用拉近了人与计算机的距离,形成一个人机和谐的工作与生活环境,并将发挥更大的作用,无线局域网的应用将会成为未来无线网络的技术主流。该文主要研究内容有嵌入式系统的设计,嵌入式操作系统的研究和移植,视频图像的采集和处理,无线传输技术及无线网络配置的方法。 相似文献
993.
In this paper, we study the design problem of PID controllers for networked control systems (NCSs) with polyhedral uncertainties. The load disturbance and measurement noise are both taken into account in the modeling to better reflect the practical scenario. By using a novel technique, the design problem of PID controllers is converted into a design problem of output feedback controllers. Our goal of this paper is two‐fold: (1) To design the robust PID tracking controllers for practical models; (2) To develop the robust ??∞ PID control such that load and reference disturbances can be attenuated with a prescribed level. Sufficient conditions are derived by employing advanced techniques for achieving delay dependence. The proposed controller can be readily designed based on iterative suboptimal algorithms. Finally, four examples are presented to show the effectiveness of the proposed methods. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
994.
995.
Liu Q Chen E Xiong H Ding CH Chen J 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(1):218-233
Recommender systems suggest a few items from many possible choices to the users by understanding their past behaviors. In these systems, the user behaviors are influenced by the hidden interests of the users. Learning to leverage the information about user interests is often critical for making better recommendations. However, existing collaborative-filtering-based recommender systems are usually focused on exploiting the information about the user's interaction with the systems; the information about latent user interests is largely underexplored. To that end, inspired by the topic models, in this paper, we propose a novel collaborative-filtering-based recommender system by user interest expansion via personalized ranking, named iExpand. The goal is to build an item-oriented model-based collaborative-filtering framework. The iExpand method introduces a three-layer, user-interests-item, representation scheme, which leads to more accurate ranking recommendation results with less computation cost and helps the understanding of the interactions among users, items, and user interests. Moreover, iExpand strategically deals with many issues that exist in traditional collaborative-filtering approaches, such as the overspecialization problem and the cold-start problem. Finally, we evaluate iExpand on three benchmark data sets, and experimental results show that iExpand can lead to better ranking performance than state-of-the-art methods with a significant margin. 相似文献
996.
Given a directed graph, the problem of blackhole mining is to identify groups of nodes, called blackhole patterns, in a way such that the average in-weight of this group is significantly larger than the average out-weight of the same group. The problem of finding volcano patterns is a dual problem of mining blackhole patterns. Therefore, we focus on discovering the blackhole patterns. Indeed, in this article, we develop a generalized blackhole mining framework. Specifically, we first design two pruning schemes for reducing the computational cost by reducing both the number of candidate patterns and the average computation cost for each candidate pattern. The first pruning scheme is to exploit the concept of combination dominance to reduce the exponential growth search space. Based on this pruning approach, we develop the gBlackhole algorithm. Instead, the second pruning scheme is an approximate approach, named approxBlackhole, which can strike a balance between the efficiency and the completeness of blackhole mining. Finally, experimental results on real-world data show that the performance of approxBlackhole can be several orders of magnitude faster than gBlackhole, and both of them have huge computational advantages over the brute-force approach. Also, we show that the blackhole mining algorithm can be used to capture some suspicious financial fraud patterns. 相似文献
997.
This paper addresses the problem of designing robust tracking control for a class of uncertain wheeled mobile robots actuated by brushed direct current motors. This class of electrically‐driven mechanical systems consists of the robot kinematics, the robot dynamics, and the wheel actuator dynamics. Via the backstepping technique, an intelligent robust tracking control scheme that integrates a kinematic controller and an adaptive neural network‐based (or fuzzy‐based) controller is developed such that all of the states and signals of the closed‐loop system are bounded and the tracking error can be made as small as possible. Two adaptive approximation systems are constructed to learn the behaviors of unknown mechanical and electrical dynamics. The effects of both the approximation errors and the unmodeled time‐varying perturbations in the input and virtual‐input weighting matrices are counteracted by suitably tuning the control gains. Consequently, the robust control scheme developed here can be employed to handle a broader class of electrically‐driven wheeled mobile robots in the presence of high‐degree time‐varying uncertainties. Finally, a simulation example is given to demonstrate the effectiveness of the developed control scheme. 相似文献
998.
Financial distress prediction (FDP) is of great importance to both inner and outside parts of companies. Though lots of literatures have given comprehensive analysis on single classifier FDP method, ensemble method for FDP just emerged in recent years and needs to be further studied. Support vector machine (SVM) shows promising performance in FDP when compared with other single classifier methods. The contribution of this paper is to propose a new FDP method based on SVM ensemble, whose candidate single classifiers are trained by SVM algorithms with different kernel functions on different feature subsets of one initial dataset. SVM kernels such as linear, polynomial, RBF and sigmoid, and the filter feature selection/extraction methods of stepwise multi discriminant analysis (MDA), stepwise logistic regression (logit), and principal component analysis (PCA) are applied. The algorithm for selecting SVM ensemble's base classifiers from candidate ones is designed by considering both individual performance and diversity analysis. Weighted majority voting based on base classifiers’ cross validation accuracy on training dataset is used as the combination mechanism. Experimental results indicate that SVM ensemble is significantly superior to individual SVM classifier when the number of base classifiers in SVM ensemble is properly set. Besides, it also shows that RBF SVM based on features selected by stepwise MDA is a good choice for FDP when individual SVM classifier is applied. 相似文献
999.
General competence trust among supply chain partners, referring to the trust that a partner holds the general ability of fulfilling contracts, is a critical factor to ensure effective cooperation in a supply chain, especially in the current financial crisis. The method of supply chain trust diagnosis (SCTD) is to evaluate whether or not a partner holds such competence. This research devotes to an early investigation on diagnosing competence trust of supply chain with the method of inductive case-based reasoning ensemble (ICBRE). The so-called supply chain trust diagnosis with inductive case-based reasoning ensemble consists of five levels, that is, information level, the level of ratios of general competence states, the level of inductive case-based reasoning, ensemble level, and diagnosis result level. Knowledge for diagnosing competence trust, which composes of a case base, is hidden in data represented by ratios of general competence states. Inductive approach is combined with randomness to construct diverse and good member methods of inductive case-based reasoning. Finally, simple voting is used to integrate outputs of member inductive case-based reasoning methods in order to produce the final diagnosis on whether or not a partner holds the general ability of fulfilling contracts. We statistically validated results of the method of supply chain trust diagnosis with inductive case-based reasoning ensemble by comparing them with those of multivariate discriminant analysis, logistic regression, single Euclidean case-based reasoning, and single inductive case-based reasoning. The results indicate that the method of supply chain trust diagnosis with inductive case-based reasoning ensemble significantly improves predictive capability of case-based reasoning in this problem and outperforms all the comparative models by group decision of several decision-making agents and non-strict assumptions like statistical methods. 相似文献
1000.