全文获取类型
收费全文 | 2459篇 |
免费 | 57篇 |
国内免费 | 9篇 |
专业分类
化学 | 1748篇 |
晶体学 | 28篇 |
力学 | 33篇 |
数学 | 309篇 |
物理学 | 407篇 |
出版年
2024年 | 3篇 |
2023年 | 19篇 |
2022年 | 57篇 |
2021年 | 62篇 |
2020年 | 47篇 |
2019年 | 57篇 |
2018年 | 47篇 |
2017年 | 40篇 |
2016年 | 86篇 |
2015年 | 81篇 |
2014年 | 81篇 |
2013年 | 171篇 |
2012年 | 191篇 |
2011年 | 210篇 |
2010年 | 138篇 |
2009年 | 152篇 |
2008年 | 173篇 |
2007年 | 137篇 |
2006年 | 133篇 |
2005年 | 105篇 |
2004年 | 98篇 |
2003年 | 69篇 |
2002年 | 62篇 |
2001年 | 35篇 |
2000年 | 24篇 |
1999年 | 24篇 |
1998年 | 17篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 23篇 |
1994年 | 7篇 |
1993年 | 22篇 |
1992年 | 17篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 9篇 |
1978年 | 6篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1972年 | 2篇 |
1970年 | 3篇 |
排序方式: 共有2525条查询结果,搜索用时 15 毫秒
961.
Based on Châtelet’s insights into the nature of mathematical inventiveness, drawn from historical analyses, we propose a new way of framing creativity in the mathematics classroom. The approach we develop emphasizes the social and material nature of creative acts. Our analysis of creative acts in two case studies involving primary school classrooms also reveals the characteristic ways in which digital technologies can occasion such acts. 相似文献
962.
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups 总被引:3,自引:0,他引:3
A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed
into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent
setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally
tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and
tested. Finally the solutions are compared with those currently practiced at the foundry. 相似文献
963.
A heuristic based on genetic algorithms is proposed to the problem of configuring hub-and-spoke networks for trucking companies that operate less-than-truckload (LTL) services in Brazil. The problem consists of determining the number of consolidation terminals (also known as hubs), their locations and the assignment of the spokes to the hubs, aiming to minimize the total cost, which is composed of fixed and variable costs. The proposed formulation differs from similar formulations found in the literature in the sense that it allows variable scale-reduction factors for the transportation costs according to the total amount of freight between hub terminals, as occurs to less-than-truckload (LTL) freight carriers in Brazil. Our genetic algorithm approach incorporates an efficient local improvement procedure that is applied to each generated individual of the population. Computational results for benchmark problems are presented. A practical application to a real world problem involving one of the top-ten trucking companies in Brazil is also described. 相似文献
964.
Domingos M. Cardoso Maria Aguieiras A. de Freitas Enide Andrade Martins María Robbiano 《Discrete Mathematics》2013,313(5):733-741
Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional consequences are explored, namely regarding the largest eigenvalue and algebraic connectivity. 相似文献
965.
During the last decades, much research has been conducted on deriving classes of valid inequalities for mixed integer knapsack sets, which we call knapsack cuts. Bixby et?al. (The sharpest cut: the impact of Manfred Padberg and his work. MPS/SIAM Series on Optimization, pp. 309?C326, 2004) empirically observe that, within the context of branch-and-cut algorithms to solve mixed integer programming problems, the most important inequalities are knapsack cuts derived by the mixed integer rounding (MIR) procedure. In this work we analyze this empirical observation by developing an algorithm to separate over the convex hull of a mixed integer knapsack set. The main feature of this algorithm is a specialized subroutine for optimizing over a mixed integer knapsack set which exploits dominance relationships. The exact separation of knapsack cuts allows us to establish natural benchmarks by which to evaluate specific classes of them. Using these benchmarks on MIPLIB 3.0 and MIPLIB 2003 instances we analyze the performance of MIR inequalities. Our computations, which are performed in exact arithmetic, are surprising: In the vast majority of the instances in which knapsack cuts yield bound improvements, MIR cuts alone achieve over 87% of the observed gain. 相似文献
966.
Marcos Salvai 《Monatshefte für Mathematik》2014,175(4):613-619
Let \(M\) and \(N\) be two connected smooth manifolds, where \(M\) is compact and oriented and \(N\) is Riemannian. Let \(\mathcal {E}\) be the Fréchet manifold of all embeddings of \(M\) in \(N\) , endowed with the canonical weak Riemannian metric. Let \(\sim \) be the equivalence relation on \(\mathcal {E}\) defined by \(f\sim g\) if and only if \(f=g\circ \phi \) for some orientation preserving diffeomorphism \(\phi \) of \(M\) . The Fréchet manifold \(\mathcal {S}= \mathcal {E}/_{\sim }\) of equivalence classes, which may be thought of as the set of submanifolds of \(N\) diffeomorphic to \(M\) and is called the nonlinear Grassmannian (or Chow manifold) of \(N\) of type \(M\) , inherits from \( \mathcal {E}\) a weak Riemannian structure. We consider the following particular case: \(N\) is a compact irreducible symmetric space and \(M\) is a reflective submanifold of \(N\) (that is, a connected component of the set of fixed points of an involutive isometry of \( N\) ). Let \(\mathcal {C}\) be the set of submanifolds of \(N\) which are congruent to \(M\) . We prove that the natural inclusion of \(\mathcal {C}\) in \(\mathcal {S}\) is totally geodesic. 相似文献
967.
Marcos Sebastiani 《Mathematische Zeitschrift》1982,180(4):483-487
Sans résumé 相似文献
968.
J.C.V. Mattos J.A. Freitas E.G. Lluesma R.C.C. Leite 《Solid State Communications》1974,14(11):1199-1201
Induced non equilibrium distribution of optical phonons allows direct measurement of electron-phonon coupling as a function of phonon wave-vector K. Results indicate that near K=0(K<20, 000 cm?1 coupling between TO phonons and electrons is independent of K whereas LO phonons show a K-2 dependence. Results also suggest that electron relaxation in the conduction band by multiple phonon production is quite significant. 相似文献
969.
970.