首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8632篇
  免费   326篇
  国内免费   31篇
化学   6379篇
晶体学   52篇
力学   197篇
数学   1226篇
物理学   1135篇
  2024年   5篇
  2023年   67篇
  2022年   245篇
  2021年   275篇
  2020年   218篇
  2019年   209篇
  2018年   141篇
  2017年   143篇
  2016年   329篇
  2015年   293篇
  2014年   308篇
  2013年   474篇
  2012年   568篇
  2011年   682篇
  2010年   391篇
  2009年   361篇
  2008年   575篇
  2007年   550篇
  2006年   514篇
  2005年   477篇
  2004年   406篇
  2003年   343篇
  2002年   272篇
  2001年   96篇
  2000年   103篇
  1999年   94篇
  1998年   58篇
  1997年   69篇
  1996年   93篇
  1995年   60篇
  1994年   55篇
  1993年   52篇
  1992年   56篇
  1991年   46篇
  1990年   32篇
  1989年   23篇
  1988年   20篇
  1987年   26篇
  1986年   28篇
  1985年   40篇
  1984年   31篇
  1983年   28篇
  1982年   21篇
  1981年   19篇
  1980年   19篇
  1979年   24篇
  1978年   7篇
  1977年   9篇
  1976年   5篇
  1975年   5篇
排序方式: 共有8989条查询结果,搜索用时 109 毫秒
1.
2.
The development of biodegradable materials for tailored applications, particularly in the field of polymeric films and sheets, is a challenging technological goal as well as a contribution to help protect the environment. Poly(lactic) acid (PLA) is a promising substitute for several oil-based polymers; however, to overcome its thermal and mechanical drawbacks, researchers have developed solutions such as blending PLA with polybutylene adipate terephthalate (PBAT), which is capable of increasing the ductility of the final material. In this study, PLA/PBAT binary blends, with minimum possible content of nonrenewable materials, were examined from processing, thermal, morphological, and rheological perspective. An optimized PLA/PBAT ratio was chosen as the polymeric basis to obtain a biodegradable formulation by adding a biobased plasticizer and appropriate fillers to produce a micrometer film with tailored flexibility and tear resistance. The processing technology involved flat-die extrusion, followed by calendering. The tearing resistance of the produced film was investigated, and the results were compared with literature data. A study on the essential work of fracture was implemented to explore the mode III out-of-plane fracture resistance starting from a trouser tear test.  相似文献   
3.
We consider the problem of estimating a large rank-one tensor u k ∈ (n)k , k ≥ 3 , in Gaussian noise. Earlier work characterized a critical signal-to-noise ratio λ  Bayes = O(1) above which an ideal estimator achieves strictly positive correlation with the unknown vector of interest. Remarkably, no polynomial-time algorithm is known that achieved this goal unless λCn(k − 2)/4 , and even powerful semidefinite programming relaxations appear to fail for 1 ≪ λn(k − 2)/4 . In order to elucidate this behavior, we consider the maximum likelihood estimator, which requires maximizing a degree-k homogeneous polynomial over the unit sphere in n dimensions. We compute the expected number of critical points and local maxima of this objective function and show that it is exponential in the dimensions n , and give exact formulas for the exponential growth rate. We show that (for λ larger than a constant) critical points are either very close to the unknown vector u or are confined in a band of width Θ(λ−1/(k − 1)) around the maximum circle that is orthogonal to u . For local maxima, this band shrinks to be of size Θ(λ−1/(k − 2)) . These “uninformative” local maxima are likely to cause the failure of optimization algorithms. © 2019 Wiley Periodicals, Inc.  相似文献   
4.
5.
6.
In this note we show that the chain space belonging to a quadric can be embedded into the chain geometry over a Clifford algebra via a generalized stereographic projection.  相似文献   
7.
8.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.  相似文献   
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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