全文获取类型
收费全文 | 1664篇 |
免费 | 28篇 |
国内免费 | 5篇 |
专业分类
化学 | 103篇 |
力学 | 7篇 |
综合类 | 2篇 |
数学 | 1337篇 |
物理学 | 248篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 2篇 |
2021年 | 9篇 |
2020年 | 3篇 |
2019年 | 27篇 |
2018年 | 22篇 |
2017年 | 17篇 |
2016年 | 9篇 |
2015年 | 10篇 |
2014年 | 20篇 |
2013年 | 112篇 |
2012年 | 129篇 |
2011年 | 104篇 |
2010年 | 103篇 |
2009年 | 114篇 |
2008年 | 128篇 |
2007年 | 121篇 |
2006年 | 86篇 |
2005年 | 57篇 |
2004年 | 21篇 |
2003年 | 41篇 |
2002年 | 49篇 |
2001年 | 55篇 |
2000年 | 63篇 |
1999年 | 78篇 |
1998年 | 52篇 |
1997年 | 14篇 |
1996年 | 27篇 |
1995年 | 30篇 |
1994年 | 38篇 |
1993年 | 20篇 |
1992年 | 18篇 |
1991年 | 8篇 |
1990年 | 15篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有1697条查询结果,搜索用时 203 毫秒
1.
2.
Vinod Kumar Pragya Das R.P. Singh S. Muralithar R.K. Bhowmik 《The European Physical Journal A - Hadrons and Nuclei》2003,17(2):153-157
The fusion evaporation reaction 122Sn(14N, 4n)132La was used to populate the high-spin states of 132La at the beam energy of 60 MeV. A new band consisting of mostly E2 transitions has been discovered. This band has the interesting links to the ground state 2- and the isomeric state 6-. A new transition of energy 351 keV connecting the low-spin states of the positive-parity band based on the πh
11/2 ⊗ νh
11/2 particle configuration, has been found. This has played a very important role in resolving the existing ambiguities and inconsistencies
in the spin assignment of the band head.
Received: 12 August 2002 / Accepted: 18 March 2003 / Published online: 7 May 2003 相似文献
3.
Abdo Y. Alfakih 《Discrete Applied Mathematics》2007,155(10):1244-1253
Let V={1,2,…,n}. A mapping p:V→Rr, where p1,…,pn are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in Rr, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in Rr is said to be dimensionally rigid iff there does not exist a framework G(q) in Rs for s?r+1, such that ∥qi-qj∥2=∥pi-pj∥2 for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p1,…,pn of the given r-configuration are in general position, is also investigated. 相似文献
4.
5.
D. Kast A. Jungclaus K.P. Lieb M. Górska G. de Angelis P.G. Bizzeti A. Dewald C. Fahlander H. Grawe R. Peusquens M. De Poli H. Tiesler 《The European Physical Journal A - Hadrons and Nuclei》1998,3(2):115-128
In the neutron deficient isotopes 104,105In lifetimes of high spin states in the range from 0.5 ps to 600 ps have been measured in a coincidence recoil distance Doppler
shift (RDDS) experiment. By combining the Doppler shift attenuation (DSA) and RDDS methods at few μm flight distances, the
problem of delayed feeding has been avoided and very short lifetimes in the range 0.5–0.8 ps have been determined. Shell model
calculations with strong restrictions for the neutron orbitals reveal good agreement with experimental level energies and
still fair agreement for most measured B(M1) and B(E2) values.
Received: 30 June 1998 相似文献
6.
David L. Applegate 《Operations Research Letters》2007,35(6):693-699
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage of the speed of floating-point calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented. 相似文献
7.
Mike Develin 《Discrete Applied Mathematics》2007,155(17):2257-2268
We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid Pn×Pn×Pn which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step. 相似文献
8.
This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R0-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically. 相似文献
9.
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 相似文献
10.
Ronald Ortner 《Operations Research Letters》2007,35(5):619-626
In ergodic MDPs we consider stationary distributions of policies that coincide in all but n states, in which one of two possible actions is chosen. We give conditions and formulas for linear dependence of the stationary distributions of n+2 such policies, and show some results about combinations and mixtures of policies. 相似文献