全文获取类型
收费全文 | 6842篇 |
免费 | 1168篇 |
国内免费 | 415篇 |
专业分类
化学 | 2034篇 |
晶体学 | 35篇 |
力学 | 509篇 |
综合类 | 235篇 |
数学 | 2383篇 |
物理学 | 3229篇 |
出版年
2024年 | 29篇 |
2023年 | 122篇 |
2022年 | 477篇 |
2021年 | 368篇 |
2020年 | 229篇 |
2019年 | 187篇 |
2018年 | 146篇 |
2017年 | 274篇 |
2016年 | 330篇 |
2015年 | 257篇 |
2014年 | 456篇 |
2013年 | 551篇 |
2012年 | 443篇 |
2011年 | 405篇 |
2010年 | 382篇 |
2009年 | 435篇 |
2008年 | 402篇 |
2007年 | 428篇 |
2006年 | 343篇 |
2005年 | 256篇 |
2004年 | 218篇 |
2003年 | 221篇 |
2002年 | 214篇 |
2001年 | 166篇 |
2000年 | 175篇 |
1999年 | 147篇 |
1998年 | 121篇 |
1997年 | 104篇 |
1996年 | 106篇 |
1995年 | 62篇 |
1994年 | 76篇 |
1993年 | 65篇 |
1992年 | 34篇 |
1991年 | 30篇 |
1990年 | 30篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 17篇 |
1986年 | 20篇 |
1985年 | 16篇 |
1984年 | 13篇 |
1982年 | 8篇 |
1981年 | 7篇 |
1979年 | 4篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有8425条查询结果,搜索用时 15 毫秒
41.
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.
相似文献
42.
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 相似文献
43.
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. 相似文献
44.
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 相似文献
45.
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. 相似文献
46.
提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。 相似文献
47.
Based on observations made during an extensive study of police patrol operations in New York City, we examine the issues of the validity and utility of queueing models of service systems in which adaptive behavior by the (human) customers or servers is likely. We find that in addition to depending on the technical accuracy of its assumptions, the accuracy of such a model will also depend upon the level of managerial control of the system and adequacy of resources. We recommend that queueing models of human service systems be used in a normative fashion and incorporated in the management feedback loop. 相似文献
48.
I.TntroductionStatisticalandneuralnetworkmcthodsforpatternclassiflcationusesignificantlydifTerentapproachesintrainingaclassificr.Inthestatistica1approach,thcformationofaclassifier1arge1ydependsonthestatisticsofthetrainingpatternsand,insomecases,theassumptionsaboutthedistributionofthepopulation.Theneuralnetworkmethodisnon-parametricandcanbeadaptivcinthetrainingprocessl'l.Becauseofitssimplicityandflexibility,theneuralnetworkhasbecnincreasing1yusedforpatternclassiflcation.Itisnowwe11knownthatan… 相似文献
49.
本在无向网络中,建立了带有边集限制的最均匀支撑树问题的网络模型.中首先解决最均匀支撑树问题,并给出求无向网络中最均匀支撑树的多项式时间算法;然后,给出了求无向网络中带有边集限制的最小树多项式时间算法;最后,在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题. 相似文献
50.
采用AMI方法研究了10种新型的磺酰脲类除草剂的电子结构,并以原子的Mulliken净电荷和除草剂在不同浓度(100,10mg/L)下对油菜、稗草两种作物的根、茎部位的抑制率为训练样本集。构造并训练得到具有活性预测能力的BP神经网络.结果表明,该BP网络不仅能对训练样本很好拟合。亦能对未知化合物的活性作出很好的预测. 相似文献