全文获取类型
收费全文 | 1385篇 |
免费 | 42篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 27篇 |
综合类 | 1篇 |
化学工业 | 264篇 |
金属工艺 | 34篇 |
机械仪表 | 27篇 |
建筑科学 | 18篇 |
矿业工程 | 5篇 |
能源动力 | 55篇 |
轻工业 | 84篇 |
水利工程 | 10篇 |
石油天然气 | 1篇 |
无线电 | 182篇 |
一般工业技术 | 282篇 |
冶金工业 | 249篇 |
原子能技术 | 6篇 |
自动化技术 | 186篇 |
出版年
2023年 | 10篇 |
2022年 | 20篇 |
2021年 | 45篇 |
2020年 | 31篇 |
2019年 | 29篇 |
2018年 | 41篇 |
2017年 | 38篇 |
2016年 | 37篇 |
2015年 | 29篇 |
2014年 | 44篇 |
2013年 | 94篇 |
2012年 | 47篇 |
2011年 | 58篇 |
2010年 | 46篇 |
2009年 | 53篇 |
2008年 | 74篇 |
2007年 | 57篇 |
2006年 | 38篇 |
2005年 | 45篇 |
2004年 | 29篇 |
2003年 | 22篇 |
2002年 | 25篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 20篇 |
1998年 | 57篇 |
1997年 | 41篇 |
1996年 | 43篇 |
1995年 | 27篇 |
1994年 | 22篇 |
1993年 | 26篇 |
1992年 | 21篇 |
1991年 | 20篇 |
1990年 | 14篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 12篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 14篇 |
1983年 | 19篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1979年 | 8篇 |
1978年 | 9篇 |
1977年 | 13篇 |
1976年 | 14篇 |
1974年 | 9篇 |
1973年 | 8篇 |
1972年 | 6篇 |
排序方式: 共有1431条查询结果,搜索用时 0 毫秒
91.
92.
Sk. Manirul Islam Kajari Ghosh Anupam Singha Roy Noor Salam Tanmay Chatterjee 《Journal of Inorganic and Organometallic Polymers and Materials》2014,24(2):457-467
A polymer-anchored iron(III) catalyst was synthesized and characterized. Its catalytic activity was evaluated for the oxidation of various alkenes, sulfides, aromatic alcohols and ethylbenzene with 30 % H2O2 as the oxidizing agent. The catalyst was also effective for the oxidative bromination reaction with 80–100 % selectivity of monobrominated products with H2O2/KBr at room temperature. The above reactions require a minimum amount of H2O2 and short reaction time. Most importantly, all the above reactions occur in aqueous medium. The catalyst can be facilely recovered and reused six-atimes without significant decrease in its activity and selectivity. 相似文献
93.
Three-phase Induction Generators (IGs) are increasingly being used as smallscale energy producing devices in nonconventional energy conversion systems. Both squirrel-cage and wound rotor types of induction motors used as generators are popular in this regard. The aim of this paper is to discuss critically the important contributions of researchers on the applications in both grid-connected and isolated modes of operations and critical evaluation of performance of these generators under different operating conditions. The major focus has been on the evaluation performance of squirrel-cage induction motor used as Self-Excited Induction Generator (SEIG), and both experimental and theoretical results are provided to represent the important characteristics of this generator. Finally, the future trend of research in this field has been pointed out. 相似文献
94.
Chatterjee Gaurav Latorre Laurent Mailly Frédérick Nouet Pascal Hachelef Nacim Oudea Coumar 《Microsystem Technologies》2017,23(9):3969-3978
Microsystem Technologies - Inertial measurement units (IMU) are essentially a combination of acceleration and rotation rate sensors, generating position and attitude information. For tactical and... 相似文献
95.
Roderick Bloem Krishnendu Chatterjee Karin Greimel Thomas A. Henzinger Georg Hofferek Barbara Jobstmann Bettina Könighofer Robert Könighofer 《Acta Informatica》2014,51(3-4):193-220
Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results. 相似文献
96.
Krishnendu Chatterjee Thomas A. Henzinger 《Journal of Computer and System Sciences》2012,78(2):394-413
We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications. 相似文献
97.
Akhilesh Chander Amitava Chatterjee Patrick Siarry 《Expert systems with applications》2011,38(5):4998-5004
In this paper, we present a new variant of Particle Swarm Optimization (PSO) for image segmentation using optimal multi-level thresholding. Some objective functions which are very efficient for bi-level thresholding purpose are not suitable for multi-level thresholding due to the exponential growth of computational complexity. The present paper also proposes an iterative scheme that is practically more suitable for obtaining initial values of candidate multilevel thresholds. This self iterative scheme is proposed to find the suitable number of thresholds that should be used to segment an image. This iterative scheme is based on the well known Otsu’s method, which shows a linear growth of computational complexity. The thresholds resulting from the iterative scheme are taken as initial thresholds and the particles are created randomly around these thresholds, for the proposed PSO variant. The proposed PSO algorithm makes a new contribution in adapting ‘social’ and ‘momentum’ components of the velocity equation for particle move updates. The proposed segmentation method is employed for four benchmark images and the performances obtained outperform results obtained with well known methods, like Gaussian-smoothing method (Lim, Y. K., & Lee, S. U. (1990). On the color image segmentation algorithm based on the thresholding and the fuzzy c-means techniques. Pattern Recognition, 23, 935–952; Tsai, D. M. (1995). A fast thresholding selection procedure for multimodal and unimodal histograms. Pattern Recognition Letters, 16, 653–666), Symmetry-duality method (Yin, P. Y., & Chen, L. H. (1993). New method for multilevel thresholding using the symmetry and duality of the histogram. Journal of Electronics and Imaging, 2, 337–344), GA-based algorithm (Yin, P. -Y. (1999). A fast scheme for optimal thresholding using genetic algorithms. Signal Processing, 72, 85–95) and the basic PSO variant employing linearly decreasing inertia weight factor. 相似文献
98.
The particle swarm optimization (PSO) is a relatively new generation of combinatorial metaheuristic algorithms which is based on a metaphor of social interaction, namely bird flocking or fish schooling. Although the algorithm has shown some important advances by providing high speed of convergence in specific problems it has also been reported that the algorithm has a tendency to get stuck in a near optimal solution and may find it difficult to improve solution accuracy by fine tuning. The present paper proposes a new variation of PSO model where we propose a new method of introducing nonlinear variation of inertia weight along with a particle's old velocity to improve the speed of convergence as well as fine tune the search in the multidimensional space. The paper also presents a new method of determining and setting a complete set of free parameters for any given problem, saving the user from a tedious trial and error based approach to determine them for each specific problem. The performance of the proposed PSO model, along with the fixed set of free parameters, is amply demonstrated by applying it for several benchmark problems and comparing it with several competing popular PSO and non-PSO combinatorial metaheuristic algorithms. 相似文献
99.
Krishnendu Chatterjee Thomas A. Henzinger Nir Piterman 《Information and Computation》2010,208(6):677-693
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL1, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula). 相似文献
100.