首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14432篇
  免费   971篇
  国内免费   807篇
化学   213篇
晶体学   2篇
力学   1445篇
综合类   166篇
数学   13301篇
物理学   1083篇
  2024年   30篇
  2023年   139篇
  2022年   162篇
  2021年   201篇
  2020年   314篇
  2019年   324篇
  2018年   378篇
  2017年   385篇
  2016年   373篇
  2015年   274篇
  2014年   607篇
  2013年   1151篇
  2012年   650篇
  2011年   764篇
  2010年   680篇
  2009年   941篇
  2008年   988篇
  2007年   1017篇
  2006年   898篇
  2005年   697篇
  2004年   598篇
  2003年   667篇
  2002年   573篇
  2001年   431篇
  2000年   442篇
  1999年   393篇
  1998年   363篇
  1997年   323篇
  1996年   248篇
  1995年   204篇
  1994年   138篇
  1993年   119篇
  1992年   119篇
  1991年   105篇
  1990年   79篇
  1989年   38篇
  1988年   41篇
  1987年   38篇
  1986年   41篇
  1985年   54篇
  1984年   53篇
  1983年   28篇
  1982年   28篇
  1981年   25篇
  1980年   19篇
  1979年   21篇
  1978年   14篇
  1977年   15篇
  1976年   9篇
  1936年   3篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
The problem of finding the plane supporting curve (brachistochrone) along which a heavy particle released from rest at the given starting point slides with dry (Coulomb) friction and reaches the given destination point in least time, is stated as a variational isoperimetrical problem. The finite parametric equations of the extremal curve are obtained. This curve is the sought-for brachistochrone if the solution of the problem exists. Several numerical examples are given.  相似文献   
992.
The notion of shear centre in Saint-Venant beam theory was introduced by Robert Maillart who envisaged it to explain the results of experimental tests on beams with C-shaped sections. In literature, the location of the shear centre is provided in terms of flexure functions. The new result is a formula for the shear centre, based on the knowledge of the sole twist warping function of the cross-section.  相似文献   
993.
The size of support of initial heat distribution is determined by the heat flow observed either at any fixed time or at any fixed position  相似文献   
994.
张守慧  梁栋 《计算物理》2018,35(4):413-428
给出求解二维抛物型方程的Strang型的交替分段区域分裂格式。交替分段思想可以将区域分为一些不重叠的子区域,Strang型算子分裂技巧通过将高维问题的求解分解为几个低维问题的求解来降低其求解的复杂度。方法是无条件稳定的,理论分析了截断误差。数值算例说明格式的有效性及时空的二阶精度.  相似文献   
995.
This paper considers the treatment of fluid–solid interaction problems under shock wave loading, where the solid experiences large bulk Lagrangian displacements. This work addresses the issues associated with using a level set as a generalized interface for fluid–solid coupling where the fluid–solid interface is embedded in an unstructured fluid grid. We outline the formulation used for the edge‐based unstructured‐grid Euler solver. The identification of the fluid–solid interface on the unstructured fluid mesh uses a super‐sampled ??2 projection technique, which in conjunction with a Lagrangian interface position, permits fast identification of the interface and the concomitant imposition of boundary conditions. The use of a narrow‐band approach for the identification of the wetted interface is presented with the details of the construction of interface conditions. A series of two and three‐dimensional shock‐body computations are presented to demonstrate the validity of the current approach on problems with static and dynamic interfaces, including projectile/shock interaction simulations. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   
996.
We consider the Monge transportation problem when the cost is the squared geodesic distance around a convex obstacle. We show that there exists at least one—and in general infinitely many—optimal transport maps.  相似文献   
997.
The paper formulates an extension of the traveling purchaser problem where multiple types of commodities are sold at spatially distributed locations with stochastic prices (each following a known probability distribution). A purchaser’s goal is to find the optimal routing and purchasing strategies that minimize the expected total travel and purchasing costs needed to purchase one unit of each commodity. The purchaser reveals the actual commodity price at a seller upon arrival, and then either purchases the commodity at the offered price, or rejects the price and visits a next seller. In this paper, we propose an exact solution algorithm based on dynamic programming, an iterative approximate algorithm that yields bounds for the minimum total expected cost, and a greedy heuristic for fast solutions to large-scale applications. We analyze the characteristics of the problem and test the computational performance of the proposed algorithms. The numerical results show that the approximate and heuristic algorithms yield near-optimum strategies and very good estimates of the minimum total cost.  相似文献   
998.
It is common in statistical practice that one needs to make a choice among m + 1 mutually exclusive claims on distributions.When m=1,it is done by the (traditional) hypothesis test.In this paper,a generalization to the case m > 1 is proposed.The fundamental difference with the case m=1 is that the new alternative hypothesis is a partition of m multiple claims and is data-dependent.Data is used to decide which claim in the partition is to be tested as the alternative.Thus,a random alternative is involved.The...  相似文献   
999.
This study analyzes multiobjective d-dimensional knapsack problems (MOd-KP) within a comparative analysis of three multiobjective evolutionary algorithms (MOEAs): the ε-nondominated sorted genetic algorithm II (ε-NSGAII), the strength Pareto evolutionary algorithm 2 (SPEA2) and the ε-nondominated hierarchical Bayesian optimization algorithm (ε-hBOA). This study contributes new insights into the challenges posed by correlated instances of the MOd-KP that better capture the decision interdependencies often present in real world applications. A statistical performance analysis of the algorithms uses the unary ε-indicator, the hypervolume indicator and success rate plots to demonstrate their relative effectiveness, efficiency, and reliability for the MOd-KP instances analyzed. Our results indicate that the ε-hBOA achieves superior performance relative to ε-NSGAII and SPEA2 with increasing number of objectives, number of decisions, and correlative linkages between the two. Performance of the ε-hBOA suggests that probabilistic model building evolutionary algorithms have significant promise for expanding the size and scope of challenging multiobjective problems that can be explored.  相似文献   
1000.
We present a cavitation model based on the Stokes equation and formulate adaptive finite element methods for its numerical solution. A posteriori error estimates and adaptive algorithms are derived, and numerical examples illustrating the theory are supplied, in particular with comparison to the simplified Reynolds model of lubrication. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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