全文获取类型
收费全文 | 1866篇 |
免费 | 153篇 |
国内免费 | 20篇 |
专业分类
电工技术 | 38篇 |
综合类 | 2篇 |
化学工业 | 638篇 |
金属工艺 | 30篇 |
机械仪表 | 51篇 |
建筑科学 | 60篇 |
矿业工程 | 4篇 |
能源动力 | 98篇 |
轻工业 | 246篇 |
水利工程 | 14篇 |
石油天然气 | 54篇 |
无线电 | 160篇 |
一般工业技术 | 350篇 |
冶金工业 | 40篇 |
原子能技术 | 27篇 |
自动化技术 | 227篇 |
出版年
2024年 | 6篇 |
2023年 | 46篇 |
2022年 | 100篇 |
2021年 | 143篇 |
2020年 | 119篇 |
2019年 | 152篇 |
2018年 | 162篇 |
2017年 | 160篇 |
2016年 | 122篇 |
2015年 | 81篇 |
2014年 | 126篇 |
2013年 | 189篇 |
2012年 | 108篇 |
2011年 | 141篇 |
2010年 | 103篇 |
2009年 | 69篇 |
2008年 | 49篇 |
2007年 | 39篇 |
2006年 | 24篇 |
2005年 | 11篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1999年 | 7篇 |
1998年 | 6篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1987年 | 3篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有2039条查询结果,搜索用时 15 毫秒
41.
Double Auction-based Scheduling of Scientific Applications in Distributed Grid and Cloud Environments 总被引:1,自引:0,他引:1
Economy models have long been considered as a promising complement to the classical distributed resource management not only
due of their dynamic and decentralized nature, but also because the concept of financial valuation of resources and services
is an inherent part of any such model. In its broadest sense, scheduling of scientific applications in distributed Grid and
Cloud environments can be regarded as a market-based negotiation between a scheduling service optimizing user-centric objectives
(execution time, budget), and a resource manager optimizing provider-centric metrics (resource utilization, income, job throughput).
In this paper, we propose a new instantiation of the negotiation protocol between the scheduler and resource manager using
a market-based Continuous Double Auction (CDA) model. We analyze different scheduling strategies that can be applied and identify
general strategic patterns that can lead to a fast and cheap work ow execution. In the experimental study, we demonstrate
that under certain circumstances one can benefit by applying an aggressive scheduling strategy. 相似文献
42.
Zahra YarahmadiAli Reza Ashrafi 《Computers & Mathematics with Applications》2011,62(1):319-325
The bipartite edge frustration of a graph G, denoted by φ(G), is the smallest number of edges that have to be deleted from G to obtain a bipartite spanning subgraph of G. This topological index is related to the well-known Max-cut problem, and has important applications in computing stability of fullerenes. In this paper, the bipartite edge frustration of an infinite family of fullerenes is computed. Moreover, this quantity for four classes of graphs arising from a given graph under different types of edge subdivisions is investigated. 相似文献
43.
We have developed a compensated capacitive pressure and temperature sensor for kraft pulp digesters (pH 13.5, temperatures
25–175°C reaching a local maximum of 180°C and pressures up to 2 MPa). The gauge capacitive pressure sensor was fabricated
by bonding silicon and Pyrex chips using a high temperature, low viscosity UV (ultraviolent) adhesive as the gap-controlling
layer and heat curing adhesive as the bonding agent. A simple chip bonding technique, involving insertion of the adhesive
into the gap between two chips was developed. A platinum thin-film wire was patterned on top of a silicon chip to form a resistance
temperature detector (RTD) with a nominal resistance of 1,500 Ω. A silicon dioxide layer and a thin layer of Parylene were
deposited to passivate the pressure sensor diaphragm and the sensors were embedded into epoxy for protection against the caustic
environment in kraft digesters. The sensors were tested up to 2 MPa and 170°C in an environment chamber. The maximum thermal
error of ±1% (absolute value of ±20 kPa) full scale output (FSO) and an average sensitivity of 0.554 fF/kPa were measured.
Parylene-coated silicon chips were tested for a full kraft pulping cycle with no signs of corrosion. 相似文献
44.
Mehdi Mohammadi Bijan Raahemi Ahmad Akbari Hossein Moeinzadeh Babak Nasersharif 《Expert systems with applications》2011,38(6):6417-6423
In this paper, we propose a hybrid approach using genetic algorithm and neural networks to classify Peer-to-Peer (P2P) traffic in IP networks. We first compute the minimum classification error (MCE) matrix using genetic algorithm. The MCE matrix is then used during the pre-processing step to map the original dataset into a new space. The mapped data set is then fed to three different classifiers: distance-based, K-Nearest Neighbors, and neural networks classifiers. We measure three different indexes, namely mutual information, Dunn, and SD to evaluate the extent of separation of the data points before and after mapping is performed. The experimental results demonstrate that with the proposed mapping scheme we achieve, on average, 8% higher accuracy in classification of the P2P traffic compare to the previous solutions. Moreover, the genetic-based MCE matrix increases the classification accuracy more than what the basic MCE does. 相似文献
45.
Development of broadband forward‐wave directional couplers loaded by periodic patterned ground structure 下载免费PDF全文
In this paper two wideband Forward‐Wave Directional Couplers (FWDCs) with 0 dB and 3 dB coupling level are proposed. Using periodic patterned ground structure in a microstrip coupled lines by a new unit cell; even‐ and odd‐mode characteristic impedances of the couplers are equal over a wide frequency range. Moreover, it provides a constant phase difference between even and odd‐modes. The proposed cell is modeled using the equivalent circuit model and a design procedure is introduced for designing FWDCs for an arbitrary value of coupling level. The introduced couplers are numerically investigated and a prototype of both couplers is made. It is shown that for 0 dB coupling level, the measured coupling is 0.85 dB with 1 dB flatness over fractional bandwidth of 96% bandwidth. In case of 3 dB coupling, the measured coupling level is 3.5 dB at 7.42 GHz with 1 dB flatness over fractional bandwidth of 67.1%. 相似文献
46.
Learning from data streams is a challenging task which demands a learning algorithm with several high quality features. In addition to space complexity and speed requirements needed for processing the huge volume of data which arrives at high speed, the learning algorithm must have a good balance between stability and plasticity. This paper presents a new approach to induce incremental decision trees on streaming data. In this approach, the internal nodes contain trainable split tests. In contrast with traditional decision trees in which a single attribute is selected as the split test, each internal node of the proposed approach contains a trainable function based on multiple attributes, which not only provides the flexibility needed in the stream context, but also improves stability. Based on this approach, we propose evolving fuzzy min–max decision tree (EFMMDT) learning algorithm in which each internal node of the decision tree contains an evolving fuzzy min–max neural network. EFMMDT splits the instance space non-linearly based on multiple attributes which results in much smaller and shallower decision trees. The extensive experiments reveal that the proposed algorithm achieves much better precision in comparison with the state-of-the-art decision tree learning algorithms on the benchmark data streams, especially in the presence of concept drift. 相似文献
47.
Elnaz Bigdeli Mahdi Mohammadi Bijan Raahemi Stan Matwin 《Pattern Analysis & Applications》2017,20(1):183-199
Clustering, while systematically applied in anomaly detection, has a direct impact on the accuracy of the detection methods. Existing cluster-based anomaly detection methods are mainly based on spherical shape clustering. In this paper, we focus on arbitrary shape clustering methods to increase the accuracy of the anomaly detection. However, since the main drawback of arbitrary shape clustering is its high memory complexity, we propose to summarize clusters first. For this, we design an algorithm, called Summarization based on Gaussian Mixture Model (SGMM), to summarize clusters and represent them as Gaussian Mixture Models (GMMs). After GMMs are constructed, incoming new samples are presented to the GMMs, and their membership values are calculated, based on which the new samples are labeled as “normal” or “anomaly.” Additionally, to address the issue of noise in the data, instead of labeling samples individually, they are clustered first, and then each cluster is labeled collectively. For this, we present a new approach, called Collective Probabilistic Anomaly Detection (CPAD), in which, the distance of the incoming new samples and the existing SGMMs is calculated, and then the new cluster is labeled the same as of the closest cluster. To measure the distance of two GMM-based clusters, we propose a modified version of the Kullback–Libner measure. We run several experiments to evaluate the performances of the proposed SGMM and CPAD methods and compare them against some of the well-known algorithms including ABACUS, local outlier factor (LOF), and one-class support vector machine (SVM). The performance of SGMM is compared with ABACUS using Dunn and DB metrics, and the results indicate that the SGMM performs superior in terms of summarizing clusters. Moreover, the proposed CPAD method is compared with the LOF and one-class SVM considering the performance criteria of (a) false alarm rate, (b) detection rate, and (c) memory efficiency. The experimental results show that the CPAD method is noise resilient, memory efficient, and its accuracy is higher than the other methods. 相似文献
48.
Classifying the Geometric Dilution of Precision of GPS satellites utilizing Bayesian decision theory
M. Saraf K. Mohammadi M.R. MosaviAuthor vitae 《Computers & Electrical Engineering》2011,37(6):1009-1018
The errors resulting from satellite configuration geometry can be determined by Geometric Dilution of Precision (GDOP). Considering optimal satellite subset selection, lower GDOP value usually causes better accuracy in GPS positioning. However, GDOP computation based on complicated transformation and inversion of measurement matrices is a time consuming procedure. This paper deals with classification of GPS GDOP utilizing Parzen estimation based Bayesian decision theory. The conditional probability of each class is estimated by Parzen algorithm. Then based on Bayesian decision theory, the class with maximum posterior probability is selected. The experiments on measured dataset demonstrate that the proposed algorithm lead, in mean classification improvement, to 4.08% in comparison with Support Vector Machine (SVM) and 9.83% in comparison with K-Nearest Neighbour (KNN) classifier. Extra work on feature extraction has been performed based on Principle Component Analysis (PCA). The results demonstrate that the feature extraction approach has best performance respect to all classifiers. 相似文献
49.
A new fuzzy decision-making procedure applied to emergency electric power distribution scheduling 总被引:1,自引:0,他引:1
S. Khan Mohammadi I. Hassanzadeh R. M. Mathur K. V. Patil 《Engineering Applications of Artificial Intelligence》2000,13(6):731-740
In this paper a new fuzzy decision-making procedure is developed. Two levels of weightings, called upper and lower weights, are proposed to calculate the fuzzy weightings of different criteria. The preference table is introduced to calculate the upper and lower weights. Also a new method is developed to determine the expected preference values of different alternatives. These values are used for generating the priority list of alternatives. The procedure is applied for providing an emergency electric power distribution, scheduling time table. The IEEE 14-bus standard system and a 14-bus system with four power plants are considered as case studies. Using fuzzy decision-making procedure, the regions with more priorities are more connected to the distribution net, while the maximum consumption criterion is also reasonably respected. 相似文献
50.
Developing decision support system (DSS) can overcome the issues with personnel attributes and specifications. Personnel specifications have greatest impact on total efficiency. They can enhance total efficiency of critical personnel attributes. This study presents an intelligent integrated decision support system (DSS) for forecasting and optimization of complex personnel efficiency. DSS assesses the impact of personnel efficiency by data envelopment analysis (DEA), artificial neural network (ANN), rough set theory (RST), and K-Means clustering algorithm. DEA has two roles in this study. It provides data to ANN and finally it selects the best reduct through ANN results. Reduct is described as a minimum subset of features, completely discriminating all objects in a data set. The reduct selection is achieved by RST. ANN has two roles in the integrated algorithm. ANN results are basis for selecting the best reduct and it is used for forecasting total efficiency. Finally, K-Means algorithm is used to develop the DSS. A procedure is proposed to develop the DSS with stated tools and completed rule base. The DSS could help managers to forecast and optimize efficiencies by selected attributes and grouping inferred efficiency. Also, it is an ideal tool for careful forecasting and planning. The proposed DSS is applied to an actual banking system and its superiorities and advantages are discussed. 相似文献