全文获取类型
收费全文 | 5139篇 |
免费 | 186篇 |
国内免费 | 26篇 |
专业分类
电工技术 | 77篇 |
综合类 | 8篇 |
化学工业 | 1010篇 |
金属工艺 | 162篇 |
机械仪表 | 120篇 |
建筑科学 | 54篇 |
矿业工程 | 16篇 |
能源动力 | 314篇 |
轻工业 | 232篇 |
水利工程 | 36篇 |
石油天然气 | 20篇 |
无线电 | 676篇 |
一般工业技术 | 1193篇 |
冶金工业 | 742篇 |
原子能技术 | 34篇 |
自动化技术 | 657篇 |
出版年
2023年 | 73篇 |
2022年 | 106篇 |
2021年 | 183篇 |
2020年 | 155篇 |
2019年 | 134篇 |
2018年 | 181篇 |
2017年 | 168篇 |
2016年 | 199篇 |
2015年 | 114篇 |
2014年 | 192篇 |
2013年 | 431篇 |
2012年 | 224篇 |
2011年 | 239篇 |
2010年 | 205篇 |
2009年 | 276篇 |
2008年 | 180篇 |
2007年 | 134篇 |
2006年 | 134篇 |
2005年 | 114篇 |
2004年 | 100篇 |
2003年 | 102篇 |
2002年 | 91篇 |
2001年 | 72篇 |
2000年 | 66篇 |
1999年 | 71篇 |
1998年 | 145篇 |
1997年 | 111篇 |
1996年 | 122篇 |
1995年 | 84篇 |
1994年 | 84篇 |
1993年 | 80篇 |
1992年 | 60篇 |
1991年 | 69篇 |
1990年 | 70篇 |
1989年 | 47篇 |
1988年 | 46篇 |
1987年 | 45篇 |
1986年 | 42篇 |
1985年 | 47篇 |
1984年 | 31篇 |
1983年 | 25篇 |
1982年 | 26篇 |
1981年 | 36篇 |
1980年 | 20篇 |
1979年 | 31篇 |
1978年 | 31篇 |
1977年 | 28篇 |
1976年 | 34篇 |
1975年 | 16篇 |
1973年 | 13篇 |
排序方式: 共有5351条查询结果,搜索用时 0 毫秒
111.
A Tosaki N Maulik DT Engelman RM Engelman DK Das 《Canadian Metallurgical Quarterly》1996,28(5):723-731
Protein kinase C (PKC) has been implicated in the preconditioning-induced cardiac protection in ischemic/reperfused myocardium. We studied the effect of PKC inhibition with calphostin C (25, 50, 100, 200, 400, and 800 nM), a potent and specific inhibitor of PKC, in isolated working nonpreconditioned and preconditioned ischemic/reperfused hearts. In the nonpreconditioned groups, all hearts underwent 30 min of normothermic global ischemia followed by 30 min of reperfusion. In the preconditioned groups, hearts were subjected to four cycles of ischemic preconditioning by using 5 min of ischemia followed by 10 min reperfusion, before the induction of 30 min ischemia and reperfusion. At low concentrations of calphostin C (25, 50, and 100 nM), the PKC inhibitor had no effect on the incidence or arrhythmias or postischemic cardiac function in the nonpreconditioned ischemic/reperfused groups. With 200 and 400 nM of calphostin C, a significant increase in postischemic function and a reduction in the incidence of arrhythmias were observed in the nonpreconditioned ischemic/reperfused groups. Increasing the concentration of calphostin C to 800 NM, the recovery of postischemic cardiac function was similar to that of the drug-free control group. In preconditioned hearts, lower concentrations (< 100 nM) of calphostin C did not change the response of the myocardium to ischemia and reperfusion in comparison to the preconditioned drug-free myocardium. Two hundred and 400 nM of the PKC inhibitor further reduced the incidence of ventricular fibrillation (VF) from the preconditioned drug-free value of 50% to 0 (p < 0.05) and 0 (p < 0.05), respectively, indicating that the combination of the two, preconditioning and calphostin C, affords significant additional protection. Increasing the concentration of calphostin C to 800 nM blocked the cardioprotective effect of preconditioning (100% incidence of VF). The recovery of cardiac function was similarly improved at calphostin C doses of 200 and 400 nM and was reduced at 800 nM (p < 0.05). With 200 and 400 nM of calphostin C, both cytosolic and particulate PKC activity were reduced by approximately 40 and 60%, respectively, in both preconditioned and preconditioned/ischemic/reperfused hearts. The highest concentration of calphostin C (800 nM) resulted in almost a complete inhibition of cytosolic (100%) and particulate (85%) PKC activity correlated with the abolition of preconditioning-induced cardiac protection. In conclusion, calphostin C protects the ischemic myocardium obtained from intact animals, provides significant additional protection to preconditioning at moderate doses, and blocks the protective effect of preconditioning at high concentrations. The dual effects of calphostin C appear to be strictly dose and "enzyme inhibition" related. 相似文献
112.
113.
In this paper we develop a local distributed privacy preserving algorithm for feature selection in a large peer-to-peer environment.
Feature selection is often used in machine learning for data compaction and efficient learning by eliminating the curse of
dimensionality. There exist many solutions for feature selection when the data are located at a central location. However,
it becomes extremely challenging to perform the same when the data are distributed across a large number of peers or machines.
Centralizing the entire dataset or portions of it can be very costly and impractical because of the large number of data sources,
the asynchronous nature of the peer-to-peer networks, dynamic nature of the data/network, and privacy concerns. The solution
proposed in this paper allows us to perform feature selection in an asynchronous fashion with a low communication overhead
where each peer can specify its own privacy constraints. The algorithm works based on local interactions among participating
nodes. We present results on real-world dataset in order to test the performance of the proposed algorithm. 相似文献
114.
Items made of glass, ceramic, etc. are normally stored in stacks and get damaged during the storage due to the accumulated stress of heaped stock. These items are known as breakable items. Here a multi-item inventory model of breakable items is developed, where demands of the items are stock dependent, breakability rates increase linearly with stock and nonlinearly with time. Due to non-linearity and complexity of the problem, the model is solved numerically and final decisions are made using Genetic Algorithm (GA). In a particular case, model is solved analytically as well as numerically and results are compared. Models are developed with both crisp and uncertain inventory costs. For uncertain inventory costs both fuzzy and stochastic parameters are considered. A chance constrained approach is followed to deal with simultaneous presence of stochastic and fuzzy parameters. Different numerical examples are used to illustrate the problem for different cases. 相似文献
115.
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. 相似文献
116.
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. 相似文献
117.
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. 相似文献
118.
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. 相似文献
119.
Chakrabarti A Naik V Dechoudhury S Bandyopadhyay A Mondal M Pandey HK Roy TK Sanyal D Bhowmick D 《The Review of scientific instruments》2007,78(4):043303
A 33.7 MHz heavy-ion radio frequency quadrupole (RFQ) linear accelerator has been designed, built, and tested. It is a four-rod-type RFQ designed for acceleration of 1.38 keVu, qA> or =116 ions to about 29 keVu. Transmission efficiencies of about 85% and 80% have been measured for the unanalyzed and analyzed beams, respectively, of oxygen ((16)O(2+), (16)O(3+), (16)O(4+)), nitrogen ((14)N(3+), (14)N(4+)), and argon ((40)Ar(4+)). The system design and measurements along with results of beam acceleration test will be presented. 相似文献
120.
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. 相似文献