全文获取类型
收费全文 | 3508篇 |
免费 | 78篇 |
国内免费 | 98篇 |
专业分类
化学 | 1093篇 |
晶体学 | 19篇 |
力学 | 472篇 |
综合类 | 14篇 |
数学 | 879篇 |
物理学 | 1207篇 |
出版年
2024年 | 4篇 |
2023年 | 44篇 |
2022年 | 72篇 |
2021年 | 60篇 |
2020年 | 69篇 |
2019年 | 69篇 |
2018年 | 73篇 |
2017年 | 81篇 |
2016年 | 69篇 |
2015年 | 68篇 |
2014年 | 135篇 |
2013年 | 484篇 |
2012年 | 102篇 |
2011年 | 160篇 |
2010年 | 150篇 |
2009年 | 226篇 |
2008年 | 204篇 |
2007年 | 221篇 |
2006年 | 198篇 |
2005年 | 171篇 |
2004年 | 113篇 |
2003年 | 124篇 |
2002年 | 79篇 |
2001年 | 68篇 |
2000年 | 61篇 |
1999年 | 78篇 |
1998年 | 73篇 |
1997年 | 35篇 |
1996年 | 35篇 |
1995年 | 27篇 |
1994年 | 40篇 |
1993年 | 28篇 |
1992年 | 36篇 |
1991年 | 23篇 |
1990年 | 21篇 |
1989年 | 18篇 |
1988年 | 23篇 |
1987年 | 25篇 |
1986年 | 19篇 |
1985年 | 17篇 |
1984年 | 17篇 |
1983年 | 7篇 |
1982年 | 14篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1972年 | 4篇 |
1970年 | 1篇 |
排序方式: 共有3684条查询结果,搜索用时 5 毫秒
1.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献
2.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
3.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献
4.
Mehdi Dehghan 《Numerical Methods for Partial Differential Equations》2002,18(2):193-202
Developement of numerical methods for obtaining approximate solutions to the three dimensional diffusion equation with an integral condition will be carried out. The numerical techniques discussed are based on the fully explicit (1,7) finite difference technique and the fully implicit (7,1) finite difference method and the (7,7) Crank‐Nicolson type finite difference formula. The new developed methods are tested on a problem. Truncation error analysis and numerical examples are used to illustrate the accuracy of the new algorithms. The results of numerical testing show that the numerical methods based on the finite difference techniques discussed in the present article produce good results. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 193–202, 2002; DOI 10.1002/num.1040 相似文献
5.
Hiroshi Noguchi Masanori Ueda Yoshinobu Baba Masako Takasu 《Journal of Polymer Science.Polymer Physics》2003,41(12):1316-1322
The electrophoresis of DNA chains in uncrosslinked polymer solutions with a Brownian dynamics simulation with an anisotropic friction tensor was analyzed. According to the degree of anisotropy, three types of migration behavior are obtained: fluctuation without or with periodicity between U‐shaped and compact conformations, or migration with linear conformation. We found good agreement between our simulation results and the direct observations of DNA by fluorescence microscopy. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 1316–1322, 2003 相似文献
6.
The goal of the paper is to analyse properties of solutions for linear thermoelastic systems of type III in one space variable. Our approach does not use energy methods, it bases on a special diagonalization procedure which is different in different parts of the phase space. This procedure allows to derive explicit representations of solutions. These representations help to prove results for well‐posedness of the Cauchy problem, LP–Lq decay estimates on the conjugate line and results for propagation of singularities. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
7.
The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques. 相似文献
8.
We study a class of shape optimization problems for semi-linear elliptic equations with Dirichlet boundary conditions in smooth
domains in ℝ2. A part of the boundary of the domain is variable as the graph of a smooth function. The problem is equivalently reformulated
on a fixed domain. Continuity of the solution to the state equation with respect to domain variations is shown. This is used
to obtain differentiability in the general case, and moreover a useful formula for the gradient of the cost functional in
the case where the principal part of the differential operator is the Laplacian.
Online publication 23 January 2004. 相似文献
9.
Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences. 相似文献
10.
Optimized prefactored compact schemes 总被引:1,自引:0,他引:1
The numerical simulation of aeroacoustic phenomena requires high-order accurate numerical schemes with low dispersion and dissipation errors. In this paper we describe a strategy for developing high-order accurate prefactored compact schemes, requiring very small stencil support. These schemes require fewer boundary stencils and offer simpler boundary condition implementation than existing compact schemes. The prefactorization strategy splits the central implicit schemes into forward and backward biased operators. Using Fourier analysis, we show it is possible to select the coefficients of the biased operators such that their dispersion characteristics match those of the original central compact scheme and their numerical wavenumbers have equal and opposite imaginary components. This ensures that when the forward and backward stencils are added, the original central compact scheme is recovered. To extend the resolution characteristic of the schemes, an optimization strategy is employed in which formal order of accuracy is sacrificed in preference to enhanced resolution characteristics across the range of wavenumbers realizable on a given mesh. The resulting optimized schemes yield improved dispersion characteristics compared to the standard sixth- and eighth-order compact schemes making them more suitable for high-resolution numerical simulations in gas dynamics and computational aeroacoustics. The efficiency, accuracy and convergence characteristics of the new optimized prefactored compact schemes are demonstrated by their application to several test problems. 相似文献