全文获取类型
收费全文 | 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 毫秒
101.
Krishnendu Chatterjee Pallab Dasgupta P. P. Chakrabarti 《Journal of Automated Reasoning》2003,30(2):205-232
Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier. 相似文献
102.
It is always better to have an idea about the future situation of a present work. Prediction of software faults in the early phase of software development life cycle can facilitate to the software personnel to achieve their desired software product. Early prediction is of great importance for optimizing the development cost of a software project. The present study proposes a methodology based on Bayesian belief network, developed to predict total number of faults and to reach a target value of total number of faults during early development phase of software lifecycle. The model has been carried out using the information from similar or earlier version software projects, domain expert’s opinion and the software metrics. Interval type-2 fuzzy logic has been applied for obtaining the conditional probability values in the node probability tables of the belief network. The output pattern corresponding to the total number of faults has been identified by artificial neural network using the input pattern from similar or earlier project data. The proposed Bayesian framework facilitates software personnel to gain the required information about software metrics at early phase for achieving targeted number of software faults. The proposed model has been applied on twenty six software project data. Results have been validated by different statistical comparison criterion. The performance of the proposed approach has been compared with some existing early fault prediction models. 相似文献
103.
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. 相似文献
104.
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. 相似文献
105.
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... 相似文献
106.
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). 相似文献
107.
108.
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. 相似文献
109.
Rup Narayan Ray Debashis Chatterjee Swapan Kumar Goswami 《Applied Soft Computing》2009,9(4):1315-1320
Harmonic elimination problem in PWM inverter is treated as an optimization problem and solved using particle swarm optimization (PSO) technique. The derived equation for computation of total harmonic distortion (THD) of the output voltage of PWM inverter is used as the objective function in the PSO algorithm. The objective function is minimized to contribute the minimum THD in the voltage waveform and the corresponding switching angles are computed. The method is applied to investigate the switching patterns of both unipolar and bipolar case. While minimizing the objective function, the individual selected harmonics like 5th, 7th, 11th and 13th can be controlled within the allowable limits by incorporating the constraints in the PSO algorithm. The results of the unipolar case using five switching angles are compared with that of a recently reported work and it is observed that the proposed method is effective in reducing the voltage THD in a wide range of modulation index. The simulated results are also validated through suitable experiments. 相似文献
110.
We address the issue of complexity for vector quantization (VQ) of wide-band speech LSF (line spectrum frequency) parameters. The recently proposed switched split VQ (SSVQ) method provides better rate–distortion (R/D) performance than the traditional split VQ (SVQ) method, even at the requirement of lower computational complexity, but at the expense of much higher memory. We develop the two stage SVQ (TsSVQ) method, by which we gain both the memory and computational advantages and still retain good R/D performance. The proposed TsSVQ method uses a full dimensional quantizer in its first stage for exploiting all the higher dimensional coding advantages and then, uses an SVQ method for quantizing the residual vector in the second stage so as to reduce the complexity. We also develop a transform domain residual coding method in this two stage architecture such that it further reduces the computational complexity. To design an effective residual codebook in the second stage, variance normalization of Voronoi regions is carried out which leads to the design of two new methods, referred to as normalized two stage SVQ (NTsSVQ) and normalized two stage transform domain SVQ (NTsTrSVQ). These two new methods have complimentary strengths and hence, they are combined in a switched VQ mode which leads to the further improvement in R/D performance, but retaining the low complexity requirement. We evaluate the performances of new methods for wide-band speech LSF parameter quantization and show their advantages over established SVQ and SSVQ methods. 相似文献