首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   558篇
  免费   48篇
  国内免费   14篇
化学   19篇
力学   17篇
综合类   11篇
数学   509篇
物理学   64篇
  2023年   10篇
  2022年   3篇
  2021年   8篇
  2020年   13篇
  2019年   10篇
  2018年   11篇
  2017年   14篇
  2016年   12篇
  2015年   12篇
  2014年   25篇
  2013年   62篇
  2012年   23篇
  2011年   30篇
  2010年   26篇
  2009年   32篇
  2008年   26篇
  2007年   45篇
  2006年   33篇
  2005年   37篇
  2004年   36篇
  2003年   24篇
  2002年   11篇
  2001年   9篇
  2000年   17篇
  1999年   18篇
  1998年   6篇
  1997年   6篇
  1996年   9篇
  1995年   10篇
  1994年   3篇
  1993年   5篇
  1992年   3篇
  1991年   3篇
  1990年   1篇
  1989年   7篇
  1988年   8篇
  1986年   3篇
  1985年   2篇
  1984年   2篇
  1983年   1篇
  1978年   1篇
  1977年   2篇
  1975年   1篇
排序方式: 共有620条查询结果,搜索用时 296 毫秒
31.
一类描述混沌映射的符号动力系统   总被引:11,自引:0,他引:11  
本文定义了符号空间上的拟移位映射,并用该类映射描述了Cantor集及平面Cantor集上的混沌映射,本文结果可看作Smale马蹄模型的简化。  相似文献   
32.
S~1×S~1-Borsuk-UlamTheoremonProductSpacesZhongChengkui(钟承奎)(DepartmentofMathematics,LanzhouUniversity,Lanzhou,730000)Abstract:...  相似文献   
33.
本文讨论了F数的扩张加法和扩张数乘运算的性质;并举反例说明这样的扩张运.算不能使F数全体F*构成线性空间;最后对可列个F数的运算进行了讨论.  相似文献   
34.
模糊最短路问题在许多领域有着广泛的应用,研究这一问题具有重要意义。根据多准则决策理论求非被支配路径集合,求最大效用模糊最短路以及利用模糊数排序方法求模糊最短路是常用的三种研究方法,本文利用OERI排序原理,使网络模糊边长具有线性可加性,对具有三角模糊数边权的网络给出了一种标号算法,该算法简单高效,且易于在计算机上实现,算法的时间复杂度为O(n^2)。  相似文献   
35.
An experimental investigation with 5 kW CW CO2 laser system was carried out to study the effects of different laser and process parameters on the microstructure and hardness of carbon steel specimen with varying carbon percentage. The laser beam is allowed to scan on the surface of the work piece varying the power (1.1–2.5 kW) and traverse speed (6–15 mm/s) at two different spot sizes using TEM01* mode laser beam. The most hardenable microstructure achieved in case of three grades of carbon steel and the most influencing parameter on the value of hardness are reported. Besides the above study, some multipass operations are also carried out to recommend an appropriate gap between consecutive passes.  相似文献   
36.
The role of optimization is central to economic analysis, particularly in its “neoclassical” phase, since about 1870, and is therefore highly compatible with the impulse behind linear programming (LP), as developed by Dantzig. LP’s stress on alternative activities fits very well with modern economic analysis. The concept of economic equilibrium, properly understood, required the central notion of complementary slackness. so central in LP.

LP was seen as a tool for actual implementation of neoclassical principles precisely at a time when the market was under attack from several directions. The economists Koopmans and Hurwicz played an important role both in stimulating the crucial development of the simplex method and in relating LP to the world of economics.

LP became widely used in national economic planning, particularly for developing countries, and for the study of individual industries, especially the energy sector. The works of Chenery and of Manne are central in these fields.

As respect for the usefulness of the market increased, the emphasis on national planning diminished and was replaced by an emphasis on equilibrium analysis, in which LP still plays a large part in the study of individual sectors, particularly energy.  相似文献   

37.
38.
Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.  相似文献   
39.
POPMUSIC for the point feature label placement problem   总被引:1,自引:0,他引:1  
Point feature label placement is the problem of placing text labels adjacent to point features on a map so as to maximize legibility. The goal is to choose positions for the labels that do not give rise to label overlaps and that minimize obscuration of features. A practical goal is to minimize the number of overlaps while considering cartographic preferences. This article proposes a new heuristic for solving the point feature label placement problem based on the application of the POPMUSIC frame. Computational experiments show that the proposed heuristic outperformed other recent metaheuristics approaches in the literature. Experiments with problem instances involving up to 10 million points show that the computational time of the proposed heuristic increases almost linearly with the problem size. New problem instances based on real data with more than 13,000 labels are proposed.  相似文献   
40.
Flum  Jörg 《Order》2000,17(1):61-73
In this note we want to point out the usefulness of antitone operations in the study of games on graphs. We demonstrate this by proving, among others, the generalizations from games to antitone operations of theorems stated by Fraenkel. This perspective makes also clear the general nature of some problems by separating what is general and what is particular.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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