首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   98363篇
  免费   1007篇
  国内免费   383篇
化学   37793篇
晶体学   933篇
力学   7037篇
数学   35156篇
物理学   18834篇
  2023年   161篇
  2022年   157篇
  2021年   269篇
  2020年   374篇
  2019年   329篇
  2018年   10729篇
  2017年   10507篇
  2016年   6777篇
  2015年   1460篇
  2014年   946篇
  2013年   1730篇
  2012年   5077篇
  2011年   11630篇
  2010年   6352篇
  2009年   6676篇
  2008年   7668篇
  2007年   9832篇
  2006年   1302篇
  2005年   2293篇
  2004年   2432篇
  2003年   2657篇
  2002年   1621篇
  2001年   725篇
  2000年   721篇
  1999年   476篇
  1998年   410篇
  1997年   355篇
  1996年   479篇
  1995年   315篇
  1994年   301篇
  1993年   281篇
  1992年   238篇
  1991年   237篇
  1990年   220篇
  1989年   207篇
  1988年   200篇
  1987年   190篇
  1986年   189篇
  1985年   239篇
  1984年   238篇
  1983年   158篇
  1982年   171篇
  1981年   178篇
  1980年   183篇
  1979年   138篇
  1978年   129篇
  1977年   120篇
  1976年   98篇
  1975年   102篇
  1973年   96篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
Bin Li  R. Srikant 《Queueing Systems》2017,85(3-4):383-385
There is a gap in the proofs of both Propositions 3 and 4 in the correspondence “Queue-Proportional Rate Allocation with Per-Link Information in Multihop Wireless Networks,” previously published in the Queueing Systems (see Li and Srikant 2016). We filled this gap in the proofs for the multihop networks (see Li and Srikant in Queueing Syst 84:203–210, 2016), where each route at most has two links. In this note, we completely fill the gap in the proofs in our original paper (see Li and Srikant in Queueing Syst 83:329–359, 2016).  相似文献   
132.
Tukey depth function is one of the most famous multivariate tools serving robust purposes. It is also very well known for its computability problems in dimensions \(p \ge 3\). In this paper, we address this computing issue by presenting two combinatorial algorithms. The first is naive and calculates the Tukey depth of a single point with complexity \(O\left( n^{p-1}\log (n)\right) \), while the second further utilizes the quasiconcave of the Tukey depth function and hence is more efficient than the first. Both require very minimal memory and run much faster than the existing ones. All experiments indicate that they compute the exact Tukey depth.  相似文献   
133.
Non-negative matrix factorization (NMF) is a technique of multivariate analysis used to approximate a given matrix containing non-negative data using two non-negative factor matrices that has been applied to a number of fields. However, when a matrix containing non-negative data has many zeroes, NMF encounters an approximation difficulty. This zero-inflated situation occurs often when a data matrix is given as count data, and becomes more challenging with matrices of increasing size. To solve this problem, we propose a new NMF model for zero-inflated non-negative matrices. Our model is based on the zero-inflated Tweedie distribution. The Tweedie distribution is a generalization of the normal, the Poisson, and the gamma distributions, and differs from each of the other distributions in the degree of robustness of its estimated parameters. In this paper, we show through numerical examples that the proposed model is superior to the basic NMF model in terms of approximation of zero-inflated data. Furthermore, we show the differences between the estimated basis vectors found using the basic and the proposed NMF models for \(\beta \) divergence by applying it to real purchasing data.  相似文献   
134.
We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least 3 over a finite field of order q. We show that these graphs are non-isomorphic to the collinearity graphs and have the same parameters. For most of these parameters, the collinearity graphs were the only known examples, and so many of our examples are new.  相似文献   
135.
In this paper, a new price is given to the online decision maker at the beginning of each day. The trader must decide how many items to purchase according to the current price. We present three variants and an online algorithm based on cost function. The competitive ratio of the online algorithm is given for each variant, which is a performance measure of an online algorithm. More importantly, we show that the online algorithm is optimal.  相似文献   
136.
We find polymers everywhere in our daily activities, for example, as a part of consumer electronics products, healthcare devices, vehicles, etc. Analytical characterization of such materials is an important step towards understanding their properties and behavior in various applications. The increase of material complexity driven by highly demanding requirements for many applications necessitates the use of sophisticated analytical techniques to obtain sufficient insight into the structure of these materials. Coupling of liquid chromatography with other information-rich instrumental techniques becomes more and more important in the field of polymer characterization. Such combination can enable simultaneous separation, identification, and quantification of polymer sample components. In addition, it can provide information on interdependence of two polymer properties, e.g., molecular weight and chemical composition. Different hyphenated systems may be applied to address different problems in polymer research and development and a selection of the right technique may not be an easy and straightforward task. In this paper, the applications of LC-NMR, LC-IR, LC-Raman, LC-MS, LC-MALDI, LC × LC, and LC × Py-GC for polymer analysis are reviewed, their advantages and limitations are discussed, and practical challenges for the implementation of these techniques in a lab are addressed. Different hyphenated options are compared to facilitate selection of a suitable instrument for the particular problem at hand.  相似文献   
137.
Glycocholic acid (GCA) has been identified as endogenous biomarker for hepatocellular carcinoma (HCC). To dissolve protein and liberate GCA from protein, ionic liquids (ILs) that contain chaotropic ions were used for pretreatment of liquid biological samples. Coupling with solid-phase extraction (SPE) and reversed-phase high-performance liquid chromatography (RP-HPLC), the novel sample pretreatment method was applied for quantitative determination of GCA in urine and plasma samples. Compared with the traditional organic solvents pretreatment of biological samples, the proposed method is “greener” and simpler, due to no use of volatile organic solvent, and avoiding centrifugation. Under the optimal conditions, when the GCA-free urine and plasma samples were spiked with GCA at 0.05–1.0 and 0.2–10 μmol L?1, the recoveries of GCA ranged between 95.8–101.6 and 96.9–100.4%, respectively. These procedures only required 1 mL of urine and 3 mL of 3 mM ILs aqueous solution and 100 μL of plasma and 4 mL of 2 mM ILs aqueous solution, respectively. The proposed method has been successfully validated on a small sample size of 14 HCC patients and 14 healthy volunteers. For HCC patients, the mean concentration of GCA was 24.79 ± 6.86 and 31.98 ± 11.12 μmol L?1 in urine and plasma samples, and was about 3 times and 24 times as much as in healthy people, respectively. The proposed method opens up a new possibility in early diagnosis of HCC.  相似文献   
138.
139.
140.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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