首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5526篇
  免费   278篇
  国内免费   9篇
电工技术   63篇
综合类   18篇
化学工业   1119篇
金属工艺   95篇
机械仪表   109篇
建筑科学   208篇
矿业工程   33篇
能源动力   142篇
轻工业   395篇
水利工程   75篇
石油天然气   20篇
武器工业   1篇
无线电   447篇
一般工业技术   927篇
冶金工业   1270篇
原子能技术   35篇
自动化技术   856篇
  2023年   36篇
  2022年   64篇
  2021年   97篇
  2020年   73篇
  2019年   87篇
  2018年   95篇
  2017年   91篇
  2016年   126篇
  2015年   112篇
  2014年   181篇
  2013年   308篇
  2012年   271篇
  2011年   394篇
  2010年   275篇
  2009年   297篇
  2008年   319篇
  2007年   325篇
  2006年   258篇
  2005年   208篇
  2004年   194篇
  2003年   187篇
  2002年   173篇
  2001年   122篇
  2000年   117篇
  1999年   107篇
  1998年   111篇
  1997年   100篇
  1996年   92篇
  1995年   82篇
  1994年   77篇
  1993年   83篇
  1992年   55篇
  1991年   43篇
  1990年   54篇
  1989年   65篇
  1988年   51篇
  1987年   42篇
  1986年   40篇
  1985年   50篇
  1984年   48篇
  1983年   33篇
  1982年   30篇
  1981年   43篇
  1980年   25篇
  1979年   20篇
  1978年   37篇
  1977年   23篇
  1976年   23篇
  1975年   15篇
  1974年   15篇
排序方式: 共有5813条查询结果,搜索用时 15 毫秒
91.
Decentralized Reputation Systems have recently emerged as a prominent method of establishing trust among self-interested agents in online environments. A key issue is the efficient aggregation of data in the system; several approaches have been proposed, but they are plagued by major shortcomings. We put forward a novel, decentralized data management scheme grounded in gossip-based algorithms. Rumor mongering is known to possess algorithmic advantages, and indeed, our framework inherits many of their salient features: scalability, robustness, a global perspective, and simplicity. We demonstrate that our scheme motivates agents to maintain a very high reputation, by showing that the higher an agent’s reputation is above the threshold set by its peers, the more transactions it would be able to complete within a certain time unit. We analyze the relation between the amount by which an agent’s average reputation exceeds the threshold and the time required to close a deal. This analysis is carried out both theoretically, and empirically through a simulation system called GossipTrustSim. Finally, we show that our approach is inherently impervious to certain kinds of attacks. A preliminary version of this article appeared in the proceedings of IJCAI 2007.  相似文献   
92.
We show that several classes of tree patterns observe the independence of containing patterns property, that is, if a pattern is contained in the union of several patterns, then it is contained in one of them. We apply this property to two related problems on tree pattern rewriting using views. First, given view V and query Q, is it possible for Q to have an equivalent rewriting using V which is the union of two or more tree patterns, but not an equivalent rewriting which is a single pattern? This problem is of both theoretical and practical importance because, if the answer is no, then, to find an equivalent rewriting of a tree pattern using a view, we should use more efficient methods, such as the polynomial time algorithm of Xu and Özsoyoglu (2005), rather than try to find the union of all contained rewritings (which takes exponential time in the worst case) and test its equivalence to Q. Second, given a set S of views, we want to know under what conditions a subset S′ of S is redundant in the sense that for any query Q, the contained rewritings of Q using the views in S′ are contained in those using the views in S???S′. Solving this problem can help us to, for example, choose the minimum number of views to be cached, or better design the virtual schema in a mediated data integration system, or avoid repeated calculation in query optimization. For the first problem, we identify several classes of tree patterns for which the equivalent rewriting can be expressed as a single tree pattern. For the second problem, we present necessary and sufficient conditions for S′ to be redundant with respect to some classes of tree patterns. For both problems we consider extension to cases where there are rewritings using the intersection of multiple views and/or where a schema graph is present.  相似文献   
93.
Various extensions of the tanh-function method and their implementations for finding explicit travelling wave solutions to nonlinear partial differential equations (PDEs) have been reported in the literature. However, some solutions are often missed by these packages. In this paper, a new algorithm and its implementation called TWS for solving single nonlinear PDEs are presented. TWS is implemented in Maple 10. It turns out that, for PDEs whose balancing numbers are not positive integers, TWS works much better than existing packages. Furthermore, TWS obtains more solutions than existing packages for most cases.

Program summary

Program title:TWSCatalogue identifier:AEAM_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAM_v1_0.htmlProgram obtainable from:CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.:1250No. of bytes in distributed program, including test data, etc.:78 101Distribution format:tar.gzProgramming language:Maple 10Computer:A laptop with 1.6 GHz Pentium CPUOperating system:Windows XP ProfessionalRAM:760 MbytesClassification:5Nature of problem:Finding the travelling wave solutions to single nonlinear PDEs.Solution method:Based on tanh-function method.Restrictions:The current version of this package can only deal with single autonomous PDEs or ODEs, not systems of PDEs or ODEs. However, the PDEs can have any finite number of independent space variables in addition to time t.Unusual features:For PDEs whose balancing numbers are not positive integers, TWS works much better than existing packages. Furthermore, TWS obtains more solutions than existing packages for most cases.Additional comments:It is easy to use.Running time:Less than 20 seconds for most cases, between 20 to 100 seconds for some cases, over 100 seconds for few cases.References:[1] E.S. Cheb-Terrab, K. von Bulow, Comput. Phys. Comm. 90 (1995) 102.[2] S.A. Elwakil, S.K. El-Labany, M.A. Zahran, R. Sabry, Phys. Lett. A 299 (2002) 179.[3] E. Fan, Phys. Lett. 277 (2000) 212.[4] W. Malfliet, Amer. J. Phys. 60 (1992) 650.[5] W. Malfliet, W. Hereman, Phys. Scripta 54 (1996) 563.[6] E.J. Parkes, B.R. Duffy, Comput. Phys. Comm. 98 (1996) 288.  相似文献   
94.
The early stage coarsening behaviour of (Al3Li) precipitates and composite precipitates, consisting of (Al3Zr) core enveloped by a shell, in an Al-2.5% Li-0.15% Zr alloy has been studied at 443, 473 and 503 K by conventional transmission electron microscopy using superlattice dark-field images. Coarsening kinetics of precipitates was found to exhibit considerable deviation from the t 1/3 law corresponding to diffusion control at 473 and 503 K. This deviation may be explained either by the operation of a surface-reaction controlled coarsening mechanism represented by t 1/2 law, or by the presence of a slower precoarsening stage preceding diffusion-controlled coarsening. The particle-size distributions of precipitates were not in accordance with either the earlier theoretical predictions or the normal distribution. They were symmetrical or slightly skewed to the left, and particle sizes twice the average were observed. The coarsening kinetics of composite precipitates, was found to be rather different from that of ; a diffusion model which yields t 1/n law with n changing from 1/4 to 1/6 as the coarsening progresses, was predicted. The composite precipitates have exhibited quite a narrow and rather symmetrical size distribution.  相似文献   
95.
Perovskite light-emitting diodes (PeLEDs) are advancing because of their superior external quantum efficiencies (EQEs) and color purity. Still, additional work is needed for blue PeLEDs to achieve the same benchmarks as the other visible colors. This study demonstrates an extremely efficient blue PeLED with a 488 nm peak emission, a maximum luminance of 8600 cd m−2, and a maximum EQE of 12.2% by incorporating the double-sided ethane-1,2-diammonium bromide (EDBr2) ligand salt along with the long-chain ligand methylphenylammonium chloride (MeCl). The EDBr2 successfully improves the interaction between 2D perovskite layers by reducing the weak van der Waals interaction and creating a Dion–Jacobson (DJ) structure. Whereas the pristine sample (without EDBr2) is inhibited by small stacking number (n) 2D phases with nonradiative recombination regions that diminish the PeLED performance, adding EDBr2 successfully enables better energy transfer from small n phases to larger n phases. As evidenced by photoluminescence (PL), scanning electron microscopy (SEM), and atomic force microscopy (AFM) characterization, EDBr2 improves the morphology by reduction of pinholes and passivation of defects, subsequently improving the efficiencies and operational lifetimes of quasi-2D blue PeLEDs.  相似文献   
96.
97.
Journal of Failure Analysis and Prevention - Over the last decade, the prognostics and health management literature has introduced many conceptual frameworks for remaining useful life predictions....  相似文献   
98.
99.
100.
Trace amount (0.3?wt%) of scandium is added to Al–5.6Mg–0.7Mn alloy to form uniformly distributed Al3Sc precipitates for producing a fine-grained and stable microstructure at high temperature through cross-channel extrusion process. Superplasticity and hot workability of the Sc-containing Al–5.6Mg–0.7Mn alloy, after extrusion, are also examined. The result indicates that Al–5.6Mg–0.7Mn alloys with and without 0.3?wt% Sc after extrusion of six passes at 300°C, fine-grained structures were observed with grain sizes of 1–2?µm and improvement of mechanical properties. Furthermore, Al3Sc phase can effectively retard recrystallization to increase the thermal stability and remain equiaxed. The elongation of Al–5.6Mg–0.7Mn alloy with Sc addition to failure is extended to 873% maximum at high temperature of 450°C at strain rate of 1?×?10?1?s?1after six passes in the CCEP.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号