首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   20183篇
  免费   643篇
  国内免费   117篇
化学   14331篇
晶体学   190篇
力学   392篇
综合类   1篇
数学   3042篇
物理学   2987篇
  2022年   168篇
  2021年   207篇
  2020年   298篇
  2019年   295篇
  2018年   193篇
  2017年   184篇
  2016年   414篇
  2015年   358篇
  2014年   460篇
  2013年   940篇
  2012年   990篇
  2011年   1299篇
  2010年   634篇
  2009年   538篇
  2008年   1026篇
  2007年   1111篇
  2006年   1095篇
  2005年   1057篇
  2004年   897篇
  2003年   766篇
  2002年   747篇
  2001年   260篇
  2000年   265篇
  1999年   237篇
  1998年   227篇
  1997年   270篇
  1996年   294篇
  1995年   236篇
  1994年   231篇
  1993年   256篇
  1992年   216篇
  1991年   197篇
  1990年   180篇
  1989年   152篇
  1988年   143篇
  1987年   160篇
  1986年   142篇
  1985年   219篇
  1984年   261篇
  1983年   190篇
  1982年   223篇
  1981年   245篇
  1980年   189篇
  1979年   186篇
  1978年   218篇
  1977年   168篇
  1976年   163篇
  1975年   157篇
  1974年   168篇
  1973年   145篇
排序方式: 共有10000条查询结果,搜索用时 66 毫秒
981.
982.
983.
Sodium borohydride, lithium borohydride and borane. THF reduce carbonyl groups (esters, amide) in 1-substituted 2-nitroimidazoIes in high yield without reduction of the nitroheterocycle.  相似文献   
984.
Abstract

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current statistical practice, matched samples are formed using “nearest available” matching, a greedy algorithm. Greedy matching does not minimize the total distance within matched pairs, though good algorithms exist for optimal matching that do minimize the total distance. How much better is optimal matching than greedy matching? We find that optimal matching is sometimes noticeably better than greedy matching in the sense of producing closely matched pairs, sometimes only marginally better, but it is no better than greedy matching in the sense of producing balanced matched samples. (2) Structures: In common practice, treated units are matched to one control, called pair matching or 1–1 matching, or treated units are matched to two controls, called 1–2 matching, and so on. It is known, however, that the optimal structure is a full matching in which a treated unit may have one or more controls or a control may have one or more treated units. Optimal 1 — k matching is compared to optimal full matching, finding that optimal full matching is often much better. (3) Distances: Matching involves defining a distance between covariate vectors, and several such distances exist. Three recent proposals are compared. Practical advice is summarized in a final section.  相似文献   
985.
The interaction of benzyl alcohol with trimethoxyboroxine has been investigated by hydrogen-1 and carbon-13 NMR and IR spectroscopy. These techniques indicate formation of a weak Lewis acid/base adduct, additionally stabilized by a hydrogen-bonding interaction, which undergoes rapid ligand exchange at room temperature. The system has been modelled by the synthesis and characterization of a series of amine-triarylboroxine adducts. These adducts rapidly undergo ligand dissociation-recombination in solution with ΔG+ of ca. 40-50 kJ/mol.  相似文献   
986.
Low ceiling temperature, thermodynamically unstable polymers have been troublesome to synthesize and keep stable during storage. In this study, stable poly(phthalaldehyde) has been synthesized with BF3‐OEt2 catalyst. The role of BF3 in the polymerization is described. The interaction of BF3 with the monomer is described and used to maximize the yield and molecular weight of poly(phthalaldehyde). Various Lewis acids were used to investigate the effect of catalyst acidity on poly(phthalaldehyde) chain growth. In situ nuclear magnetic resonance was used to identify possible interactions formed between BF3 and phthalaldehyde monomer and polymer. The molecular weight of the polymer tracks with polymerization yield. The ambient temperature stability of poly(phthalaldehyde) was investigated and the storage life of the polymer has been improved. © 2016 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2016 , 55, 1166–1172  相似文献   
987.
Cannibalization is a major concern for a firm when designing a product line. In addition, external options from outside the firm’s product line may also play a significant role. In this paper, we investigate the impact of external options, represented by reservation utility, on product line design and introduction sequence. We find that: (a) heterogeneous reservation utility defines the relative attractiveness of segments and corresponding product line; (b) reservation utility makes it more favorable to introduce products sequentially rather than simultaneously; (c) aggregating segments is an effective way to mitigate cannibalization when it becomes too difficult to manage with different values of reservation utility across multiple segments; and (d) introducing products in a non-monotone order of quality can improve profit from simultaneous introduction when the value of reservation utility of a middle segment is particularly high.  相似文献   
988.
In the multiple changepoint setting, various search methods have been proposed, which involve optimizing either a constrained or penalized cost function over possible numbers and locations of changepoints using dynamic programming. Recent work in the penalized optimization setting has focused on developing an exact pruning-based approach that, under certain conditions, is linear in the number of data points. Such an approach naturally requires the specification of a penalty to avoid under/over-fitting. Work has been undertaken to identify the appropriate penalty choice for data-generating processes with known distributional form, but in many applications the model assumed for the data is not correct and these penalty choices are not always appropriate. To this end, we present a method that enables us to find the solution path for all choices of penalty values across a continuous range. This permits an evaluation of the various segmentations to identify a suitable penalty choice. The computational complexity of this approach can be linear in the number of data points and linear in the difference between the number of changepoints in the optimal segmentations for the smallest and largest penalty values. Supplementary materials for this article are available online.  相似文献   
989.
990.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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