全文获取类型
收费全文 | 7211篇 |
免费 | 1194篇 |
国内免费 | 435篇 |
专业分类
化学 | 2076篇 |
晶体学 | 35篇 |
力学 | 862篇 |
综合类 | 243篇 |
数学 | 2164篇 |
物理学 | 3460篇 |
出版年
2024年 | 31篇 |
2023年 | 128篇 |
2022年 | 485篇 |
2021年 | 381篇 |
2020年 | 251篇 |
2019年 | 190篇 |
2018年 | 153篇 |
2017年 | 294篇 |
2016年 | 350篇 |
2015年 | 280篇 |
2014年 | 460篇 |
2013年 | 560篇 |
2012年 | 453篇 |
2011年 | 447篇 |
2010年 | 405篇 |
2009年 | 440篇 |
2008年 | 409篇 |
2007年 | 420篇 |
2006年 | 363篇 |
2005年 | 277篇 |
2004年 | 246篇 |
2003年 | 251篇 |
2002年 | 230篇 |
2001年 | 183篇 |
2000年 | 191篇 |
1999年 | 155篇 |
1998年 | 132篇 |
1997年 | 115篇 |
1996年 | 108篇 |
1995年 | 69篇 |
1994年 | 70篇 |
1993年 | 69篇 |
1992年 | 36篇 |
1991年 | 29篇 |
1990年 | 37篇 |
1989年 | 22篇 |
1988年 | 16篇 |
1987年 | 11篇 |
1986年 | 19篇 |
1985年 | 18篇 |
1984年 | 15篇 |
1983年 | 2篇 |
1982年 | 10篇 |
1981年 | 10篇 |
1979年 | 5篇 |
1977年 | 5篇 |
1972年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
1957年 | 1篇 |
排序方式: 共有8840条查询结果,搜索用时 31 毫秒
41.
42.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
43.
《中国科学A辑(英文版)》2007,(7)
The double loop network(DLN)is a circulant digraph with n nodes and outdegree 2.It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems.Given the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed. 相似文献
44.
电力市场中合同电量与竞争电量交易比例的研究 总被引:1,自引:0,他引:1
在单边开放的区域电力市场中,合理的合同电量与竞争电量交易比例是保证电力市场有效运行的一个重要环节。竞争电量所占的比例将主要取决于当前发电公司的市场行为。首先使用BP神经网络对电力需求弹性系数进行了预测,然后以长期电力市场均衡为目标函数,考虑贵州电网发电机组的可用容量与负荷预测的误差,以及贵州输电线路的可靠性诸因素,推导出合同电量与竞争电量交易比例,经过与南方区域电力市场目前运营规则规定的交易比例比较,该比例是合理的,可以规避电力市场价格波动等带来的风险。 相似文献
45.
By using the tools of statistical physics and recent investigations of the scaling properties of different complex networks,
the structural and evolving properties of the Chinese railway network (CRN) is studied. It has been verified that the CRN
has the same small-world properties of the Indian railway network (IRN). According to the class of small-world networks, we
believe the CRN is a single scale. In addition, a novel result is obtained. Measurements on the CRN indicate that the rate
at which nodes acquire links depends on the node’s degree and follows a power law.
相似文献
46.
小长径比垂直管气液两相流动特性分析 总被引:1,自引:0,他引:1
实验观察了小长径比垂直上流管内流型及特点,并对管入口处的压力波动特性和系统的压差波动特性进行了试验研究.结果表明:小长径比(L/D)垂直管内流型表现为泡状流、塞状流、乳沫状流、环状流和液束环状流;分别增加管线中的气量、液量,或者同时增加气液流量,均会造成垂直管入口处压力波动的均值和最大压力的增加;压力信号的概率密度(PDF)大部分呈双峰分布,也存在单峰和多峰分布;差压信号的概率密度符合正态分布,其功率谱密度同压力信号相比具有频率波动范围宽、幅值小的特点. 相似文献
47.
M. Abbad R. El. Azouzi M. El. Kamili 《Mathematical Methods of Operations Research》2006,63(3):461-471
In this paper we consider some properties on prices under flow control in a network that is to be shared by noncooperative users. Each user is faced with an optimization problem which is formulated as the minimization of its own criterion subject to constraint on the flows of the other users. The operating points of the network are the Nash equilibria of the underlying routing game. Our objective is to study the behavior of prices of all users when the network designer needs to allocate capacities to network links. For parallel links topologies, we show that degradation of the performances such as prices will not take place, as well as the users may find it beneficial to improve their requests 相似文献
48.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
49.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献
50.
L. Jackowska-Strumillo J. Sokolowski A. Żochowski A. Henrot 《Computational Optimization and Applications》2002,23(2):231-255
The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem. 相似文献