首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   259951篇
  免费   3426篇
  国内免费   822篇
电工技术   5130篇
综合类   330篇
化学工业   37252篇
金属工艺   10256篇
机械仪表   8486篇
建筑科学   6107篇
矿业工程   1076篇
能源动力   6401篇
轻工业   22881篇
水利工程   2561篇
石油天然气   3908篇
武器工业   68篇
无线电   34725篇
一般工业技术   50082篇
冶金工业   46537篇
原子能技术   5420篇
自动化技术   22979篇
  2021年   2039篇
  2019年   2035篇
  2018年   3472篇
  2017年   3535篇
  2016年   3731篇
  2015年   2322篇
  2014年   4052篇
  2013年   11298篇
  2012年   6567篇
  2011年   8889篇
  2010年   6991篇
  2009年   7855篇
  2008年   8683篇
  2007年   8620篇
  2006年   7807篇
  2005年   7142篇
  2004年   6888篇
  2003年   6731篇
  2002年   6372篇
  2001年   6470篇
  2000年   6170篇
  1999年   6256篇
  1998年   14245篇
  1997年   10269篇
  1996年   8112篇
  1995年   6411篇
  1994年   5711篇
  1993年   5582篇
  1992年   4551篇
  1991年   4212篇
  1990年   4048篇
  1989年   3779篇
  1988年   3624篇
  1987年   3170篇
  1986年   3065篇
  1985年   3610篇
  1984年   3382篇
  1983年   3031篇
  1982年   2850篇
  1981年   2951篇
  1980年   2760篇
  1979年   2648篇
  1978年   2499篇
  1977年   2945篇
  1976年   3554篇
  1975年   2316篇
  1974年   2312篇
  1973年   2320篇
  1972年   1849篇
  1971年   1745篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
Chaum  D. Brands  S. 《Spectrum, IEEE》1997,34(2):30-34
Electronic equivalents of traditional cash payment systems are being launched worldwide. Electronic cash can combine the benefits of traditional cash with those of payment by debit and credit card, while circumventing both their shortcomings. As with traditional cash, electronic cash should have high acceptability and be suitable for low value payment from person to person. With the possible exception of online payment platforms such as the Internet, it is preferred that payments be verifiable offline, without the bank's involvement, for reasons of cost effectiveness and speed. To facilitate electronic cash payments over the phone and the Internet, physical proximity of payer and payee should not be necessary. Moreover, electronic cash should offer privacy of payments. In particular, payments by an honest payer should be untraceable, and information about transaction content should remain privy to payer and payee. Yet a payer ought to always be able to trace the payee; traceability suits electronic cash and is as open to extortion, money laundering, and bribery as a check or wire transfer. Lastly, as with payments by debit and credit card, electronic cash should be convenient to store and transport, while protecting users against loss, theft, and accidental destruction  相似文献   
182.
Wavelength selection for low-saturation pulse oximetry   总被引:1,自引:0,他引:1  
Conventional pulse oximeters are accurate at high oxygen saturation under a variety of physiological conditions but show worsening accuracy at lower saturation (below 70%). Numerical modeling suggests that sensors fabricated with 735 and 890 nm emitters should read more accurately at low saturation under a variety of conditions than sensors made with conventionally used 660 and 900 nm band emitters. Recent animal testing confirms this expectation. It is postulated that the most repeatable and stable accuracy of the pulse oximeter occurs when the fractional change in photon path lengths due to perturbations in the tissue (relative to the conditions present during system calibration) is equivalent at the two wavelengths. Additionally, the penetration depth (and/or breadth) of the probing light needs to be well matched at the two wavelengths in order to minimize the effects of tissue heterogeneity. At high saturation these conditions are optimally met with 660 and 900 nm band emitters, while at low saturation 735 and 890 nm provide better performance  相似文献   
183.
A new method based on a two-wire line has been developed for noncontact diagnostics of a low-temperature plasma and its fluxes in channels with complex profiles. This method provides good spatial and time resolution. Pis’ma Zh. Tekh. Fiz. 23, 1–7 (July 26, 1997)  相似文献   
184.
BACKGROUND: Home parenteral nutrition (HPN) is used to treat intestinal failure. A minority of HPN patients are dependent on opiates and benzodiazepines to control pain and anxiety. The aim of this study was to determine what effects such drug dependence had on patient outcomes. METHODS: Ten dependent patients were prospectively compared with 10 well-matched, nondependent HPN patients for the same 12-month period. Episodes of line sepsis and other complications were documented and the cost of treatment estimated. Health status was measured using the SF36 and EuroQol instruments. RESULTS: The dependent group had significantly more episodes of central line sepsis (p = .0007) as well as other complications (p = .0002). This led to significantly longer periods of inpatient care (p = .0004) and therefore higher costs of treatment. Health status was lower in the dependent group; they reported more pain (p = .04) and less energy (p = .04). CONCLUSIONS: The complication rate and increased cost of treatment for opiate- and sedative-dependent patients receiving HPN significantly detract from the overall outcome of this therapy.  相似文献   
185.
We explore techniques for the measurement of local mean signal strength at 900 MHz and 2 GHz. In particular, we characterize the impact of transmitter and receiver antenna rotation on the estimated local mean. Then, we explore the collection of high resolution data while moving along a linear trajectory and using linear averaging techniques to estimate the local mean. With this information, the best measurement techniques can be chosen depending on the required speed versus accuracy tradeoff. Finally, we use a ray tracing propagation model to evaluate different methods of calculating the local mean signal strength for indoor environments  相似文献   
186.
187.
A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.  相似文献   
188.
189.
190.
The levels of mRNA expression of three UDP-N-acetyl-alpha-D-galactosamine:polypeptide GalNAc N-acetylgalactosaminyltransferases (GalNAc-transferases) were quantified for human adenocarcinoma cell lines from pancreas, colon, stomach, and breast. Two of the GalNAc-transferases, GalNAc-T1 and GalNAc-T2, were expressed constitutively and at low levels in most or all cell lines examined. A third GalNAc-transferase, GalNAc-T3, was differentially expressed. Well-differentiated adenocarcinoma cell lines expressed high levels and moderately differentiated cell lines expressed lower levels of GalNAc-T3. Cell lines classified as poorly differentiated failed to express GalNAc-T3 mRNA at levels that could be detected by Northern blot analysis. Differential expression of the GalNAc-T3 protein was confirmed in these cell lines by Western blotting. We propose that glycosylation in tumor cell lines may be regulated in part by differential expression of GalNAc-transferases, and we suggest that GalNAc-T3 gene expression may be a molecular indicator of differentiated adenocarcinoma.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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