全文获取类型
收费全文 | 5228篇 |
免费 | 178篇 |
国内免费 | 27篇 |
专业分类
电工技术 | 77篇 |
综合类 | 10篇 |
化学工业 | 1015篇 |
金属工艺 | 167篇 |
机械仪表 | 121篇 |
建筑科学 | 55篇 |
矿业工程 | 16篇 |
能源动力 | 344篇 |
轻工业 | 239篇 |
水利工程 | 37篇 |
石油天然气 | 22篇 |
无线电 | 685篇 |
一般工业技术 | 1195篇 |
冶金工业 | 727篇 |
原子能技术 | 36篇 |
自动化技术 | 687篇 |
出版年
2023年 | 73篇 |
2022年 | 105篇 |
2021年 | 183篇 |
2020年 | 154篇 |
2019年 | 132篇 |
2018年 | 185篇 |
2017年 | 163篇 |
2016年 | 197篇 |
2015年 | 115篇 |
2014年 | 200篇 |
2013年 | 438篇 |
2012年 | 235篇 |
2011年 | 247篇 |
2010年 | 212篇 |
2009年 | 284篇 |
2008年 | 190篇 |
2007年 | 141篇 |
2006年 | 134篇 |
2005年 | 115篇 |
2004年 | 103篇 |
2003年 | 106篇 |
2002年 | 93篇 |
2001年 | 70篇 |
2000年 | 68篇 |
1999年 | 78篇 |
1998年 | 145篇 |
1997年 | 110篇 |
1996年 | 123篇 |
1995年 | 86篇 |
1994年 | 85篇 |
1993年 | 81篇 |
1992年 | 61篇 |
1991年 | 72篇 |
1990年 | 70篇 |
1989年 | 49篇 |
1988年 | 46篇 |
1987年 | 46篇 |
1986年 | 42篇 |
1985年 | 47篇 |
1984年 | 33篇 |
1983年 | 25篇 |
1982年 | 27篇 |
1981年 | 35篇 |
1980年 | 20篇 |
1979年 | 30篇 |
1978年 | 30篇 |
1977年 | 27篇 |
1976年 | 33篇 |
1975年 | 15篇 |
1973年 | 13篇 |
排序方式: 共有5433条查询结果,搜索用时 15 毫秒
81.
Santosh Biswas Dipankar Sarkar Siddhartha Mukhopadhyay Amit Patra 《Discrete Event Dynamic Systems》2010,20(3):349-376
Failure diagnosability has been widely studied for discrete event system (DES) models because of modeling simplicity and computational
efficiency due to abstraction. In the literature it is often held that for diagnosability, such models can be used not only
for systems that fall naturally in the class of DES but also for the ones traditionally treated as continuous variable dynamic
systems. A class of algorithms for failure diagnosability of DES models has been successfully developed for systems where
fairness is not a part of the model. These algorithms are based on detecting cycles in the normal and the failure model that
look identical. However, there exist systems with all transitions fair where the diagnosability condition that hinges upon
this feature renders many failures non-diagnosable although they may actually be diagnosable by transitions out of a cycle.
Hence, the diagnosability conditions based on cycle detection need to be modified to hold for many real-world systems where
all transitions are fair. In this work, however, it is shown by means of an example that a system may have some transitions
fair and some unfair. A new failure diagnosability mechanism is proposed for DES models with both fair and unfair transitions.
Time complexity for deciding diagnosability of DES models with fair and unfair transitions is analyzed and compared with the
time complexities of other DES diagnosability analysis methods reported in the literature. 相似文献
82.
We present a non-linear 2-D/2-D affine registration technique for MR and CT modality images of section of human brain. Automatic
registration is achieved by maximization of a similarity metric, which is the correlation function of two images. The proposed
method has been implemented by choosing a realistic, practical transformation and optimization techniques. Correlation-based
similarity metric should be maximal when two images are perfectly aligned. Since similarity metric is a non-convex function
and contains many local optima, choice of search strategy for optimization is important in registration problem. Many optimization
schemes are existing, most of which are local and require a starting point. In present study we have implemented genetic algorithm
and particle swarm optimization technique to overcome this problem. A comparative study shows the superiority and robustness
of swarm methodology over genetic approach. 相似文献
83.
We consider three different communication tasks for quantum broadcast channels, and we determine the capacity region of a Hadamard broadcast channel for these various tasks. We define a Hadamard broadcast channel to be such that the channel from the sender to one of the receivers is entanglement-breaking and the channel from the sender to the other receiver is complementary to this one. As such, this channel is a quantum generalization of a degraded broadcast channel, which is well known in classical information theory. The first communication task we consider is classical communication to both receivers, the second is quantum communication to the stronger receiver and classical communication to other, and the third is entanglement-assisted classical communication to the stronger receiver and unassisted classical communication to the other. The structure of a Hadamard broadcast channel plays a critical role in our analysis: The channel to the weaker receiver can be simulated by performing a measurement channel on the stronger receiver’s system, followed by a preparation channel. As such, we can incorporate the classical output of the measurement channel as an auxiliary variable and solve all three of the above capacities for Hadamard broadcast channels, in this way avoiding known difficulties associated with quantum auxiliary variables. 相似文献
84.
By exploiting the unattended nature of the wireless sensor networks, an attacker can physically capture and compromise sensor nodes and then launch a variety of attacks. He can additionally create many replicas of a few compromised nodes and spread these replicas over the network, thus launching further attacks with their help. In order to minimize the damage incurred by compromised and replicated nodes, it is very important to detect such malicious nodes as quickly as possible. In this review article, we synthesize our previous works on node compromise detection in sensor networks while providing the extended analysis in terms of performance comparison to the related work. More specifically, we use the methodology of the sequential analysis to detect static and mobile compromised nodes, as well as mobile replicated nodes in sensor networks. With the help of analytical and simulation results, we also demonstrate that our schemes provide robust and efficient node compromise detection capability. 相似文献
85.
Das S. Abraham A. Konar A. 《IEEE transactions on systems, man, and cybernetics. Part A, Systems and humans : a publication of the IEEE Systems, Man, and Cybernetics Society》2008,38(1):218-237
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the automatic clustering of large unlabeled data sets. In contrast to most of the existing clustering techniques, the proposed algorithm requires no prior knowledge of the data to be classified. Rather, it determines the optimal number of partitions of the data "on the run." Superiority of the new method is demonstrated by comparing it with two recently developed partitional clustering techniques and one popular hierarchical clustering algorithm. The partitional clustering algorithms are based on two powerful well-known optimization algorithms, namely the genetic algorithm and the particle swarm optimization. An interesting real-world application of the proposed method to automatic segmentation of images is also reported. 相似文献
86.
Presents new methods for lossless predictive coding of medical images using two dimensional multiplicative autoregressive models. Both single-resolution and multi-resolution schemes are presented. The performances of the proposed schemes are compared with those of four existing techniques. The experimental results clearly indicate that the proposed schemes achieve higher compression compared to the lossless image coding techniques considered. 相似文献
87.
The oxidation kinetics of CuFeO2 in the Cu-Fe-O system have been studied between 500 and 900° C in an atmosphere containing 1 vol% oxygen in a nitrogen stream using thermogravimetric analysis (TGA). It was found that addition of Fe2O3 to the CuFeO2 caused a decrease in the oxidation rate while addition of CuO caused an increase. On increasing the concentration of Fe2O3 the activation energy was found to increase from ~ 18 kcal mol–1 to ~ 45 kcal mol–1 and the exponent n in Avrami's equationf=1-exp (–kt
n) was also observed to increase, from 1.3 to 2.3. On adding CuO to the CuFeO2 in the Cu-Fe-O system the activation energy decreased from ~ 18 kcal mol–1 to ~ 8 kcal mol–1. The variation in both values indicates changes in the oxidation mechanisms. The microstructural changes associated with oxidation have been studied using optical microscopy. A model has been proposed to explain the results. 相似文献
88.
An inertia-adaptive particle swarm system with particle mobility factor for improved global optimization 总被引:2,自引:2,他引:0
Sayan Ghosh Swagatam Das Debarati Kundu Kaushik Suresh B. K. Panigrahi Zhihua Cui 《Neural computing & applications》2012,21(2):237-250
Particle Swarm Optimization (PSO) has recently emerged as a nature-inspired algorithm for real parameter optimization. This
article describes a method for improving the final accuracy and the convergence speed of PSO by firstly adding a new coefficient
(called mobility factor) to the position updating equation and secondly modulating the inertia weight according to the distance
between a particle and the globally best position found so far. The two-fold modification tries to balance between the explorative
and exploitative tendencies of the swarm with an objective of achieving better search performance. We also mathematically
analyze the effect of the modifications on the dynamics of the PSO algorithm. The new algorithm has been shown to be statistically
significantly better than the basic PSO and four of its state-of-the-art variants on a twelve-function test-suite in terms
of speed, accuracy, and robustness. 相似文献
89.
This paper presents a fuzzy-Pareto dominance driven possibilistic model based planning of electrical distribution systems using multi-objective particle swarm optimization (MOPSO). This multi-objective planning model captures the possibilistic variations of the system loads using a fuzzy triangular number. The MOPSO based on the Pareto-optimality principle is used to obtain a set of non-dominated solutions representing different network structures under uncertainties in load demands and these non-dominated solutions are stored in an elite archive of limited size. Normally, choosing the candidate non-dominated solutions to be retained in the elite archive while maintaining the quality of the Pareto-approximation front as well as maintaining the diversity of solutions on this front is very much computationally demanding. In this paper, the principles of fuzzy Pareto-dominance are used to find out and rank the non-dominated solutions on the Pareto-approximation front. This ranking in turn is used to maintain the elite archive of limited size by discarding the lower ranked solutions. The two planning objectives are: (i) minimization of total installation and operational cost and (ii) minimization of risk factor. The risk factor is defined as a function of an index called contingency-load-loss index (CLLI), which captures the effect of load loss under contingencies, and the degree of network constraint violations. The minimization of the CLLI improves network reliability. The network variables that are optimized are: (i) number of feeders and their routes, and (ii) number and locations of sectionalizing switches. An MOPSO (developed by the authors), based on a novel technique for the selection and assignment of leaders/guides for efficient search of non-dominated solutions, is used as the optimization tool. The proposed planning approach is validated on a typical 100-node distribution system. Performance comparisons between the planning approaches with the possibilistic and deterministic load models are provided highlighting the relative merits and demerits. It is also verified that the proposed solution ranking scheme based on the fuzzy-Pareto dominance is very much better from both quality and computational burden point of view in comparison with the other well-known archive truncation techniques based on clustering and solution density measurement etc. 相似文献
90.
P V Ananthapadmanabhan A V Bapat A K Das B K Karan R Majumder R K Marwah D S Patil S V K Rao V K Rohatgi K G Sankaran P Satyamurthy R Sharma P B Shrivastava M K Totlani N Venkat-Ramani F A Akopov A V Karpukhin V V Kirillov V I Maksimenko A S Prokop A I Romanov B V Roshin E V Shishkov A S Tikhotsky V I Zalkind N I Antonov V V Brajevsky D K Burenkov V A Efremov V N Sukhov 《Sadhana》1982,5(3):169-195
This paper summarizes the major results of the joint Indo-Soviet experiment for testing the Indianmhd generator channel section, designed and fabricated at the Bhabha Atomic Research Centre, Bombay, which was carried out at the U-02 facility in Moscow, USSR, in May 1980. The total test duration was 65 hours and included electrophysical tests and life tests under applied electric fields. The main purpose of the tests was to substantiate the physical concepts, computer codes, design features and special processing techniques involved in the development ofmhd generators for the Indian pilot plant at Tiruchirapalli. The experimental observations on the phenomena of heat transfer to the walls, gas dynamics in the channel, electrical characteristics of the generator and near-electrode processes including the analysis of arc spots correlate with the theoretical estimates based on present understanding of the physical processes occuring in similarmhd generators. The post-operational inspection of the channel section and extensive investigation of materials through microscopic analysis, chemical analysis and x-ray analysis are also reported in this paper. The joint test programme has clearly demonstrated the definite operating capability of the test section and has given sufficient information and encouragement for building better and improved channels for the future. 相似文献