全文获取类型
收费全文 | 20996篇 |
免费 | 2328篇 |
国内免费 | 1015篇 |
专业分类
化学 | 4694篇 |
晶体学 | 77篇 |
力学 | 2382篇 |
综合类 | 493篇 |
数学 | 11834篇 |
物理学 | 4859篇 |
出版年
2024年 | 48篇 |
2023年 | 228篇 |
2022年 | 654篇 |
2021年 | 717篇 |
2020年 | 547篇 |
2019年 | 558篇 |
2018年 | 556篇 |
2017年 | 778篇 |
2016年 | 908篇 |
2015年 | 646篇 |
2014年 | 1136篇 |
2013年 | 1377篇 |
2012年 | 1262篇 |
2011年 | 1181篇 |
2010年 | 1025篇 |
2009年 | 1250篇 |
2008年 | 1265篇 |
2007年 | 1333篇 |
2006年 | 1097篇 |
2005年 | 960篇 |
2004年 | 810篇 |
2003年 | 776篇 |
2002年 | 657篇 |
2001年 | 577篇 |
2000年 | 539篇 |
1999年 | 436篇 |
1998年 | 417篇 |
1997年 | 393篇 |
1996年 | 292篇 |
1995年 | 290篇 |
1994年 | 227篇 |
1993年 | 204篇 |
1992年 | 177篇 |
1991年 | 135篇 |
1990年 | 130篇 |
1989年 | 95篇 |
1988年 | 88篇 |
1987年 | 68篇 |
1986年 | 74篇 |
1985年 | 82篇 |
1984年 | 80篇 |
1983年 | 27篇 |
1982年 | 41篇 |
1981年 | 26篇 |
1980年 | 23篇 |
1979年 | 39篇 |
1978年 | 22篇 |
1977年 | 35篇 |
1976年 | 20篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
Victor A. Kovtunenko 《Mathematical Methods in the Applied Sciences》2003,26(5):359-374
The 3D‐elasticity model of a solid with a plane crack under the stress‐free boundary conditions at the crack is considered. We investigate variations of a solution and of energy functionals with respect to perturbations of the crack front in the plane. The corresponding expansions at least up to the second‐order terms are obtained. The strong derivatives of the solution are constructed as an iterative solution of the same elasticity problem with specified right‐hand sides. Using the expansion of the potential and surface energy, we consider an approximate quadratic form for local shape optimization of the crack front defined by the Griffith criterion. To specify its properties, a procedure of discrete optimization is proposed, which reduces to a matrix variational inequality. At least for a small load we prove its solvability and find a quasi‐static model of the crack growth depending on the loading parameter. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
132.
In this paper, we formulate the l
p
-norm optimization problem as a conic optimization problem, derive its duality properties (weak duality, zero duality gap, and primal attainment) using standard conic duality and show how it can be solved in polynomial time applying the framework of interior-point algorithms based on self-concordant barriers. 相似文献
133.
J. T. Haslinger K. Kunisch G. Peichl 《Computational Optimization and Applications》2003,26(3):231-251
This contribution deals with an efficient method for the numerical realization of the exterior and interior Bernoulli free boundary problems. It is based on a shape optimization approach. The state problems are solved by a fictitious domain solver using boundary Lagrange multipliers. 相似文献
134.
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. 相似文献
135.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
136.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献
137.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
138.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
139.
Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks. 相似文献
140.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献