全文获取类型
收费全文 | 2807篇 |
免费 | 100篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 18篇 |
综合类 | 1篇 |
化学工业 | 838篇 |
金属工艺 | 42篇 |
机械仪表 | 61篇 |
建筑科学 | 37篇 |
矿业工程 | 3篇 |
能源动力 | 229篇 |
轻工业 | 209篇 |
水利工程 | 11篇 |
石油天然气 | 7篇 |
无线电 | 268篇 |
一般工业技术 | 504篇 |
冶金工业 | 178篇 |
原子能技术 | 23篇 |
自动化技术 | 488篇 |
出版年
2023年 | 39篇 |
2022年 | 99篇 |
2021年 | 122篇 |
2020年 | 99篇 |
2019年 | 104篇 |
2018年 | 119篇 |
2017年 | 95篇 |
2016年 | 73篇 |
2015年 | 62篇 |
2014年 | 105篇 |
2013年 | 340篇 |
2012年 | 105篇 |
2011年 | 99篇 |
2010年 | 104篇 |
2009年 | 101篇 |
2008年 | 97篇 |
2007年 | 99篇 |
2006年 | 91篇 |
2005年 | 70篇 |
2004年 | 39篇 |
2003年 | 43篇 |
2002年 | 37篇 |
2001年 | 29篇 |
2000年 | 31篇 |
1999年 | 39篇 |
1998年 | 62篇 |
1997年 | 47篇 |
1996年 | 43篇 |
1995年 | 40篇 |
1994年 | 39篇 |
1993年 | 29篇 |
1992年 | 34篇 |
1991年 | 27篇 |
1990年 | 22篇 |
1989年 | 34篇 |
1988年 | 27篇 |
1987年 | 16篇 |
1986年 | 18篇 |
1985年 | 45篇 |
1984年 | 23篇 |
1983年 | 31篇 |
1982年 | 25篇 |
1981年 | 19篇 |
1980年 | 8篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 11篇 |
1976年 | 12篇 |
1975年 | 9篇 |
1971年 | 6篇 |
排序方式: 共有2917条查询结果,搜索用时 15 毫秒
61.
This paper presents the factors affecting the uncertainty of measurement in sound transmission loss testing and the single-number quantities (SNQs) used widely in building acoustics. It provides a retrospective view of the recently published work especially in European continent and standard ISO 12999-1 for interpreting and elaborating the concept of calculation of measurement uncertainty in SNQs particularly for the laboratories engaged in sound transmission loss testing in India by presenting case studies for different types of building materials. The study suggests that the poor low frequency sound insulation and low frequency mass-air-mass and flexural resonances inculcate a higher uncertainty in SNQs for building elements. It is imperative to adopt the strategy recommended in ISO 12999-1 in Indian scenario particularly with growing international trade in building materials and technology and for the recognition as well as acceptance of testing results of Indian laboratories across the globe. 相似文献
62.
Abhishek Arun Barry Haddow Philipp Koehn Adam Lopez Chris Dyer Phil Blunsom 《Machine Translation》2010,24(2):103-121
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic
translation models. We present an alternative approach of sampling from the posterior distribution defined by a translation
model. We define a novel Gibbs sampler for sampling translations given a source sentence and show that it effectively explores
this posterior distribution. In doing so we overcome the limitations of heuristic beam search and obtain theoretically sound
solutions to inference problems such as finding the maximum probability translation and minimum risk training and decoding. 相似文献
63.
We present an improved version of one-against-all method for multiclass SVM classification based on subset sample selection, named reduced one-against-all, to achieve high performance in large multiclass problems. Reduced one-against-all drastically decreases the computing effort involved in training one-against-all classifiers, without any compromise in classification accuracy. Computational comparisons on publicly available datasets indicate that the proposed method has comparable accuracy to that of conventional one-against-all method, but with an order of magnitude faster. On the largest dataset considered, reduced one-against-all method achieved 50% reduction in computing time over one-against-all method for almost the same classification accuracy. We further investigated reduced one-against-all with linear kernel for multi-label text categorization applications. Computational results demonstrate the effectiveness of the proposed method on both the text corpuses considered. 相似文献
64.
Arun K. Ray Mamata Jenamani Pratap K.J. Mohapatra 《Expert systems with applications》2011,38(5):4689-4697
Behavioral uncertainty of a supplier is a major challenge to a buyer operating in e-procurement setting. Modeling suppliers’ behavior from past transactions, estimation of possible future performance and integrating this knowledge with the winner determination process can bring a new dimension to procurement process automation. We propose a states-space model to capture the uncertainty involved in long-term supplier behavior. The states represent the performance level of a supplier. This behavioral aspect is then integrated with the winner determination process of a multi-attribute reverse auction for efficient supplier selection using parallel MDP. We also propose an implementation framework to collect the feedback on supplier, generate an aggregate performance score and integrate it with the winner determination process. The performance aggregation and winner determination with help of Markov decision process effectively uses the past performance information. In addition, it updates performance information in regular invervals and allevates the problem of maintaining a long history. We compare the MDP-based selection with that of performance score-based selection through a simulation experiment. It is observed that our scheme gives better buyer utility, selects best suppliers and fetches better quality product. The benefits realized through these attributes to the buyer increases the efficiency of the MDP-based selection process. 相似文献
65.
This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(N×TDN)have been developed for solving the model, where N is the number of planning periods and TDN is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient. 相似文献
66.
67.
Research into the problem of predicting the maximum depth of scour on grade-control structures like sluice gates, weirs and check dams, etc., has been mainly of an experimental nature and several investigators have proposed a number of empirical relations for a particular situation. These traditional scour prediction equations, although offer some guidance on the likely magnitude of maximum scour depth, yet applicable to a limited range of the situations. It appears from the literature review that a regression mathematical model for predicting maximum depth of scour under all circumstances is not currently available. This paper explores the potential of support vector machines in modeling the scour from the available laboratory and field data obtained form the earlier published studies. To compare the results, a recently proposed empirical relation and a feed forward back propagation neural network model are also used in the present study. The outcome from the support vector machines-based modeling approach suggests a better performance in comparison to both the empirical relation and back propagation neural network approach with the laboratory data. The results also suggest an encouraging performance by the support vector machines learning technique in comparison to both empirical relation as well as neural network approach in scaling up the results from laboratory to field conditions for the purpose of scour prediction. 相似文献
68.
In this paper we formulate a least squares version of the recently proposed twin support vector machine (TSVM) for binary classification. This formulation leads to extremely simple and fast algorithm for generating binary classifiers based on two non-parallel hyperplanes. Here we attempt to solve two modified primal problems of TSVM, instead of two dual problems usually solved. We show that the solution of the two modified primal problems reduces to solving just two systems of linear equations as opposed to solving two quadratic programming problems along with two systems of linear equations in TSVM. Classification using nonlinear kernel also leads to systems of linear equations. Our experiments on publicly available datasets indicate that the proposed least squares TSVM has comparable classification accuracy to that of TSVM but with considerably lesser computational time. Since linear least squares TSVM can easily handle large datasets, we further went on to investigate its efficiency for text categorization applications. Computational results demonstrate the effectiveness of the proposed method over linear proximal SVM on all the text corpuses considered. 相似文献
69.
Nishant Doshi Saru Kumari Dheerendra Mishra Xiong Li Kim-Kwang Raymond Choo Arun Kumar Sangaiah 《Multimedia Tools and Applications》2017,76(24):25893-25918
In this digital era, where Internet of Things (IoT) is increasing day by day, use of resource constrained devices is also increasing. Indeed, the features such as low cost, less maintenance, more adaptive to hostile environment, etc. make the wireless multimedia devices to be the best choice as the resource constrained devices. For the security, the end user device requires to establish the session key with the server before transferring the data. Mobile is one of the device having more and more usage as wireless multimedia device in recent years. In 2013, Li et al. proposed an efficient scheme for the wireless mobile communications and claimed it to be secure against various attacks. Recently, Shen et al. claimed that the scheme of Li et al. is still vulnerable to the privileged insider attack, the stolen verifier attack and finally proposed a scheme to withstand the mentioned and other attacks. However, in this paper we claim that the scheme of Shen et al. is still susceptible to the user anonymity, the session specific temporary information attack and the replay attack. In addition, Shen et al.’s scheme requires more time due to many operations. Further, we propose an efficient scheme that is secure against various known attacks and due to reduced time complexity our scheme is a preferred choice for the wireless mobile networks and hence for wireless multimedia systems. 相似文献
70.
Andrew Walenstein Rachit Mathur Mohamed R. Chouchane Arun Lakhotia 《Journal in Computer Virology》2008,4(4):307-322
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation
engines are used at distribution sites or in self-propagating malware in order to create variation in the distributed programs.
Program normalization is a way to remove variety introduced by mutation engines, and can thus simplify the problem of detecting
variant strains. This paper introduces the “normalizer construction problem” (NCP), and formalizes a restricted form of the
problem called “NCP=”, which assumes a model of the engine is already known in the form of a term rewriting system. It is
shown that even this restricted version of the problem is undecidable. A procedure is provided that can, in certain cases,
automatically solve NCP= from the model of the engine. This procedure is analyzed in conjunction with term rewriting theory
to create a list of distinct classes of normalizer construction problems. These classes yield a list of possible attack vectors.
Three strategies are defined for approximate solutions of NCP=, and an analysis is provided of the risks they entail. A case
study using the virus suggests the approximations may be effective in practice for countering mutated malware.
R. Mathur is presently at McAfee AVERT Labs. 相似文献