全文获取类型
收费全文 | 8384篇 |
免费 | 1349篇 |
国内免费 | 577篇 |
专业分类
化学 | 2461篇 |
晶体学 | 37篇 |
力学 | 570篇 |
综合类 | 266篇 |
数学 | 3526篇 |
物理学 | 3450篇 |
出版年
2024年 | 22篇 |
2023年 | 123篇 |
2022年 | 390篇 |
2021年 | 377篇 |
2020年 | 269篇 |
2019年 | 219篇 |
2018年 | 205篇 |
2017年 | 331篇 |
2016年 | 401篇 |
2015年 | 320篇 |
2014年 | 542篇 |
2013年 | 715篇 |
2012年 | 515篇 |
2011年 | 512篇 |
2010年 | 457篇 |
2009年 | 535篇 |
2008年 | 522篇 |
2007年 | 531篇 |
2006年 | 427篇 |
2005年 | 355篇 |
2004年 | 297篇 |
2003年 | 295篇 |
2002年 | 307篇 |
2001年 | 234篇 |
2000年 | 239篇 |
1999年 | 196篇 |
1998年 | 172篇 |
1997年 | 135篇 |
1996年 | 126篇 |
1995年 | 74篇 |
1994年 | 78篇 |
1993年 | 74篇 |
1992年 | 41篇 |
1991年 | 37篇 |
1990年 | 34篇 |
1989年 | 21篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 23篇 |
1985年 | 20篇 |
1984年 | 24篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 12篇 |
1980年 | 5篇 |
1979年 | 14篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1975年 | 3篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
71.
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. 相似文献
72.
We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting pn(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for pn(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability
pm(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n0 servers are occupied, 0≤ n0≤ m). Numerical studies back up the asymptotic analysis.
AMS subject classification: 60K25,34E10
Supported in part by NSF grants DMS-99-71656 and DMS-02-02815 相似文献
73.
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 相似文献
74.
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. 相似文献
75.
Cardy's formula for some dependent percolation models 总被引:2,自引:0,他引:2
F. Camia C. M. Newman V. Sidoravicius 《Bulletin of the Brazilian Mathematical Society》2002,33(2):147-156
We prove Cardy's formula for rectangular crossing probabilities in dependent site percolation models that arise from a deterministic cellular automaton with a random initial state. The cellular automaton
corresponds to the zero-temperature case of Domany's stochastic Ising ferromagnet on the hexagonal lattice (with alternating
updates of two sublattices) [7]; it may also be realized on the triangular lattice 𝕋 with flips when a site disagrees with
six, five and sometimes four of its six neighbors.
Received: 24 December 2001 相似文献
76.
提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。 相似文献
77.
证明了强平稳正相协列乘积和的重对数律与不同分布正相协列乘积和的强大数律,指出了部分和服从强大数律但乘积和未必服从强大数律这一事实,并讨论了定理2中一个条件的必要性. 相似文献
78.
79.
高抗冲聚丙烯序列结构的综合表征 总被引:3,自引:0,他引:3
用高分辨^13C NMR、FTIR等手段获得了高抗冲聚丙烯的组成和序列分布等链结构方面的信息。用DSC、WAXD等方法研究了它们的结晶行为、熔融转变及晶体结构,多种方法相结合有效地表征了高抗冲聚丙烯的序列结构。 相似文献
80.
I.TntroductionStatisticalandneuralnetworkmcthodsforpatternclassiflcationusesignificantlydifTerentapproachesintrainingaclassificr.Inthestatistica1approach,thcformationofaclassifier1arge1ydependsonthestatisticsofthetrainingpatternsand,insomecases,theassumptionsaboutthedistributionofthepopulation.Theneuralnetworkmethodisnon-parametricandcanbeadaptivcinthetrainingprocessl'l.Becauseofitssimplicityandflexibility,theneuralnetworkhasbecnincreasing1yusedforpatternclassiflcation.Itisnowwe11knownthatan… 相似文献