首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1062篇
  免费   20篇
  国内免费   18篇
化学   29篇
力学   76篇
综合类   3篇
数学   877篇
物理学   115篇
  2024年   3篇
  2023年   6篇
  2022年   9篇
  2021年   8篇
  2020年   14篇
  2019年   18篇
  2018年   15篇
  2017年   21篇
  2016年   19篇
  2015年   27篇
  2014年   69篇
  2013年   105篇
  2012年   110篇
  2011年   42篇
  2010年   56篇
  2009年   66篇
  2008年   51篇
  2007年   71篇
  2006年   44篇
  2005年   22篇
  2004年   22篇
  2003年   25篇
  2002年   14篇
  2001年   17篇
  2000年   17篇
  1999年   23篇
  1998年   22篇
  1997年   19篇
  1996年   19篇
  1995年   24篇
  1994年   20篇
  1993年   13篇
  1992年   5篇
  1990年   2篇
  1989年   1篇
  1988年   2篇
  1987年   1篇
  1986年   2篇
  1985年   17篇
  1984年   6篇
  1983年   3篇
  1982年   12篇
  1981年   6篇
  1980年   8篇
  1979年   12篇
  1978年   10篇
  1977年   2篇
排序方式: 共有1100条查询结果,搜索用时 234 毫秒
981.
研究了大量铬、镍中钛的分离方法。在一定条件下使三价铬氧化成6价铬,再在氨性条件下使钛沉淀,大量铬、镍留在溶液中。将分离后的沉淀酸溶后用二氨替比林甲烷光度法测定钛。回收率为93.7%-102.4%。  相似文献   
982.
For solving the Euclidean distance Weber problem Weiszfeld proposed an iterative method. This method can also be applied to generalized Weber problems in Banach spaces. Examples for generalized Weber problems are: minimal surfaces with obstacles, Fermat's principle in geometrical optics and brachistochrones with obstacles.Wenn aber schon einmal Theorie getrieben werden soll, (man möchte die Vorliebe dafür angesichts gewisser missglückter Erscheinungen ja allerdings manchmal zum Teufel wünschen) so ist als eine ihrer Formen auch diejenige nötig, die die Abstraktion auf die Spitze treibt.Alfred Weber, 1909  相似文献   
983.
We consider the linear complementarity problem (q, M) in whichM is a positive definite symmetric matrix of ordern. This problem is equivalent to a nearest point problem [; b] in which = {A.1,, A. n } is a basis for R n ,b is a given point in R n ; and it is required to find the nearest point in the simplicial cone Pos() tob. We develop an algorithm for solving the linear complementarity problem (q, M) or the equivalent nearest point problem [; b]. Computational experience in comparison with an existing algorithm is presented.Research effort partially supported by the Air Force Office of Scientific Research. Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, not withstanding any copyright notation hereon.  相似文献   
984.
The paper is devoted to study a global optimization problem for a class of nonsmooth, nonconvex and non-locally Lipschitz functionals on a vector-valued reflexive Banach space. The existence of an element which is both a global minimizer and a solution of the associated hemivariational inequality is proved under some unilateral growth restrictions imposed on nonlinearities and under the assumption that an appropriately modified version of the Hedberg truncation procedure can be applied.On leave from his original institute.  相似文献   
985.
In this paper we study the following problem, which we call the weighted routing problem. Let be given a graphG = (V, E) with non-negative edge weightsw e + and letN,N 1, be a list of node sets. The weighted routing problem consists in finding mutually disjoint edge setsS 1,...,S N such that, for eachk {1, ...,N}, the subgraph (V(S k),S k) contains an [s, t]-path for alls, t T k and the sum of the weights of the edge sets is minimal. Our motivation for studying this problem arises from the routing problem in VLSI-design, where given sets of points have to be connected by wires. We consider the weighted routing problem from a polyhedral point of view. We define an appropriate polyhedron and try to (partially) describe this polyhedron by means of inequalities. We describe our separation algorithms for some of the presented classes of inequalities. Based on these separation routines we have implemented a branch and cut algorithm. Our algorithm is applicable to an important subclass of routing problems arising in VLSI-design, namely to switchbox routing problems where the underlying graph is a grid graph and the list of node sets is located on the outer face of the grid. We report on our computational experience with this class of problem instances.  相似文献   
986.

The harmonic function spaces are considered on the unit ball, which unify the Bloch space ( s = 1) and the Lipschitz spaces (0 < s < 1). This article presents a characterization of when s > 1 and gives a solution of Gleason's problem in for any s > 0.  相似文献   
987.
On the complexity of the k-customer vehicle routing problem   总被引:1,自引:0,他引:1  
We investigate the complexity of the k-CUSTOMER VEHICLE ROUTING PROBLEM: Given an edge weighted graph, the problem requires to compute a minimum weight set of cyclic routes such that each contains a distinguished depot vertex and at most other k customer vertices, and every customer belongs to exactly one route.  相似文献   
988.
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete and several heuristic algorithms have been developed to solve it. We suggest very efficient, yet simple, heuristic algorithms for the RWA problem developed by applying classical bin packing algorithms. The heuristics were tested on a series of large random networks and compared with an efficient existing algorithm for the same problem. Results indicate that the proposed algorithms yield solutions significantly superior in quality, not only with respect to the number of wavelength used, but also with respect to the physical length of the established lightpaths. Comparison with lower bounds shows that the proposed heuristics obtain optimal or near optimal solutions in many cases.  相似文献   
989.
§1.IntroductionThestudyofslowlyoscilating(S.O.)solutionsofdelaydiferentialequationswasinitiatedinthe50'sbypioneeringworkofWri...  相似文献   
990.
§ 1.Introduction  The finite elementor finite difference methods along characteristics for convection-dif-fusion problems in an unbounded domain R have been developed by Douglas and Rus-sel[1 ] .In those problems with significant convection,the solution changes much lessrapidly in the characteristicτ direction than in time tdirection.Thus,the characteristic-type numerical methods will permitthe use of largertime steps,with corresponding im-provements in efficiency,at no cost in accuracy. …  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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