全文获取类型
收费全文 | 9438篇 |
免费 | 2357篇 |
国内免费 | 2230篇 |
专业分类
电工技术 | 900篇 |
技术理论 | 2篇 |
综合类 | 1130篇 |
化学工业 | 167篇 |
金属工艺 | 86篇 |
机械仪表 | 420篇 |
建筑科学 | 137篇 |
矿业工程 | 132篇 |
能源动力 | 135篇 |
轻工业 | 188篇 |
水利工程 | 111篇 |
石油天然气 | 106篇 |
武器工业 | 69篇 |
无线电 | 1456篇 |
一般工业技术 | 421篇 |
冶金工业 | 95篇 |
原子能技术 | 16篇 |
自动化技术 | 8454篇 |
出版年
2024年 | 96篇 |
2023年 | 270篇 |
2022年 | 451篇 |
2021年 | 515篇 |
2020年 | 576篇 |
2019年 | 509篇 |
2018年 | 532篇 |
2017年 | 565篇 |
2016年 | 620篇 |
2015年 | 659篇 |
2014年 | 777篇 |
2013年 | 746篇 |
2012年 | 977篇 |
2011年 | 1043篇 |
2010年 | 860篇 |
2009年 | 808篇 |
2008年 | 852篇 |
2007年 | 874篇 |
2006年 | 570篇 |
2005年 | 440篇 |
2004年 | 331篇 |
2003年 | 232篇 |
2002年 | 180篇 |
2001年 | 121篇 |
2000年 | 90篇 |
1999年 | 75篇 |
1998年 | 43篇 |
1997年 | 34篇 |
1996年 | 32篇 |
1995年 | 25篇 |
1994年 | 17篇 |
1993年 | 14篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1990年 | 10篇 |
1989年 | 10篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1974年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
1.
Thomas L. Landers Melinda K. Beavers Malik Sadiq Don E. Stuart 《Computers & Industrial Engineering》1994,27(1-4):245-248
This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families. 相似文献
2.
Xin Song Xiaoyu Qi Bin Hao Yinbo Qu 《European Journal of Lipid Science and Technology》2008,110(12):1095-1101
Although lipases are widely applied in a wide variety of reactions, available information on the factors that are responsible for the substrate specificities of lipases from different sources is scarce. In this paper, nine lipase‐producing microorganism strains were isolated from oil‐containing samples. The properties of these enzymes, including pH optima, temperature optima, thermal stability, and pH stability, vary significantly with the different sources from which these lipases were isolated. The substrate specificities of the nine lipases, including fatty acid and positional specificities, were also studied. The fatty acid specificities of the nine lipases were observably different toward 15 substrates with different carbon chain lengths, different saturation degrees and different side chains. The lipases from S3 Penicillium citrinum (PCL), MJ1 Aspergillus niger (ANL), MJ2 Aspergillus oryzae (AOL), YM Bacillus coughing (BCL), S9 Geotrichum candidum (GCL), and S11 Candida lypolytica (CLL) showed the strongest specificities to short‐chain esters, and the other lipases showed strong selectivity for medium‐ or long‐chain and branched esters. The positional specificities were examined by analyzing the hydrolytic products of triolein catalyzed by the nine lipases, using TLC. The lipases can be mainly classified into two groups by their specificities for the ester bond at position 2 of triglycerides; one group can selectively hydrolyze the ester bond at position 2 of the triglycerides, the other group cannot. All these nine lipases were divided into four groups by hierarchical clustering analysis on the basis of the results of fatty acid and positional specificities. 相似文献
3.
Ilan Gronau 《Information Processing Letters》2007,104(6):205-210
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’). 相似文献
4.
针对移动无线传感器网络设计一种不依赖于节点地理位置的基于移动汇聚节点(Sink)的数据收集算法(Mobile Sink-based Data Gathering,MSDG)。该算法解决了无线传感器网络中多跳路由通信时出现能量空洞的"热点"问题。Sink沿途以最近的固定节点作为根节点动态构建路由树。簇内移动节点感知的数据经簇头进行数据融合计算,然后将融合后的数据沿路由树反向逐跳转发给Sink。仿真结果表明,MSDG在节点的平均能耗和网络生存时间等方面的性能远超过LEACH、ACE-L等数据收集协议。 相似文献
5.
6.
《Expert systems with applications》2014,41(9):4186-4196
In this paper we introduce a multi-method multiple criteria approach for evaluating the performance of organizations. Performance analysis may include both strategic and operational performance, as well as financial and other less tangible factors. This paper introduces the use of Fuzzy C-Means and TOPSIS for organizational performance evaluation purposes. Using real company data and balanced scorecard accounting and performance dimensions the methodology is applied and evaluated. The predictive abilities of the technique from an organizational performance evaluation approach are evaluated using this data. One of the results from the illustrative application is that economic performance evaluation is not the best predictor of overall viability of some organizations, especially e-commerce based organizations. 相似文献
7.
《Expert systems with applications》2014,41(6):3134-3142
Partitioning the universe of discourse and determining intervals containing useful temporal information and coming with better interpretability are critical for forecasting in fuzzy time series. In the existing literature, researchers seldom consider the effect of time variable when they partition the universe of discourse. As a result, and there is a lack of interpretability of the resulting temporal intervals. In this paper, we take the temporal information into account to partition the universe of discourse into intervals with unequal length. As a result, the performance improves forecasting quality. First, time variable is involved in partitioning the universe through Gath–Geva clustering-based time series segmentation and obtain the prototypes of data, then determine suitable intervals according to the prototypes by means of information granules. An effective method of partitioning and determining intervals is proposed. We show that these intervals carry well-defined semantics. To verify the effectiveness of the approach, we apply the proposed method to forecast enrollment of students of Alabama University and the Taiwan Stock Exchange Capitalization Weighted Stock Index. The experimental results show that the partitioning with temporal information can greatly improve accuracy of forecasting. Furthermore, the proposed method is not sensitive to its parameters. 相似文献
8.
《Expert systems with applications》2014,41(7):3261-3275
Recommender systems apply data mining and machine learning techniques for filtering unseen information and can predict whether a user would like a given item. This paper focuses on gray-sheep users problem responsible for the increased error rate in collaborative filtering based recommender systems. This paper makes the following contributions: we show that (1) the presence of gray-sheep users can affect the performance – accuracy and coverage – of the collaborative filtering based algorithms, depending on the data sparsity and distribution; (2) gray-sheep users can be identified using clustering algorithms in offline fashion, where the similarity threshold to isolate these users from the rest of community can be found empirically. We propose various improved centroid selection approaches and distance measures for the K-means clustering algorithm; (3) content-based profile of gray-sheep users can be used for making accurate recommendations. We offer a hybrid recommendation algorithm to make reliable recommendations for gray-sheep users. To the best of our knowledge, this is the first attempt to propose a formal solution for gray-sheep users problem. By extensive experimental results on two different datasets (MovieLens and community of movie fans in the FilmTrust website), we showed that the proposed approach reduces the recommendation error rate for the gray-sheep users while maintaining reasonable computational performance. 相似文献
9.
10.
《Expert systems with applications》2014,41(13):5780-5787
The massive quantity of data available today in the Internet has reached such a huge volume that it has become humanly unfeasible to efficiently sieve useful information from it. One solution to this problem is offered by using text summarization techniques. Text summarization, the process of automatically creating a shorter version of one or more text documents, is an important way of finding relevant information in large text libraries or in the Internet. This paper presents a multi-document summarization system that concisely extracts the main aspects of a set of documents, trying to avoid the typical problems of this type of summarization: information redundancy and diversity. Such a purpose is achieved through a new sentence clustering algorithm based on a graph model that makes use of statistic similarities and linguistic treatment. The DUC 2002 dataset was used to assess the performance of the proposed system, surpassing DUC competitors by a 50% margin of f-measure, in the best case. 相似文献