全文获取类型
收费全文 | 77616篇 |
免费 | 318篇 |
国内免费 | 374篇 |
专业分类
化学 | 23888篇 |
晶体学 | 787篇 |
力学 | 6719篇 |
数学 | 31924篇 |
物理学 | 14990篇 |
出版年
2018年 | 10430篇 |
2017年 | 10257篇 |
2016年 | 6050篇 |
2015年 | 833篇 |
2014年 | 280篇 |
2013年 | 295篇 |
2012年 | 3751篇 |
2011年 | 10465篇 |
2010年 | 5611篇 |
2009年 | 6024篇 |
2008年 | 6565篇 |
2007年 | 8727篇 |
2006年 | 197篇 |
2005年 | 1282篇 |
2004年 | 1509篇 |
2003年 | 1953篇 |
2002年 | 997篇 |
2001年 | 239篇 |
2000年 | 284篇 |
1999年 | 150篇 |
1998年 | 188篇 |
1997年 | 142篇 |
1996年 | 194篇 |
1995年 | 114篇 |
1994年 | 74篇 |
1993年 | 92篇 |
1992年 | 53篇 |
1991年 | 63篇 |
1990年 | 49篇 |
1989年 | 58篇 |
1988年 | 58篇 |
1987年 | 57篇 |
1986年 | 57篇 |
1985年 | 46篇 |
1984年 | 42篇 |
1983年 | 36篇 |
1982年 | 41篇 |
1981年 | 38篇 |
1980年 | 46篇 |
1979年 | 44篇 |
1978年 | 34篇 |
1973年 | 25篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1910年 | 24篇 |
1909年 | 41篇 |
1908年 | 40篇 |
1907年 | 32篇 |
1904年 | 28篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
891.
Energy Decay for the Strongly Damped Nonlinear Beam Equation and Its Applications in Moving Boundary
We study the existence and energy decay of solutions for the strongly damped nonlinear beam equation. We apply a method based
on Nakao method to show that the solution decays exponentially, and to obtain precise estimates of the constants in the estimates.
Finally, we discuss its applications in moving boundary. 相似文献
892.
We consider a risk minimization problem in a continuous-time Markovian regime-switching financial model modulated by a continuous-time,
observable and finite-state Markov chain whose states represent different market regimes. We adopt a particular form of convex
risk measure, which includes the entropic risk measure as a particular case, as a measure of risk. The risk-minimization problem
is formulated as a Markovian regime-switching version of a two-player, zero-sum stochastic differential game. One important
feature of our model is to allow the flexibility of controlling both the diffusion process representing the financial risk
and the Markov chain representing macro-economic risk. This is novel and interesting from both the perspectives of stochastic
differential game and stochastic control. A verification theorem for the Hamilton-Jacobi-Bellman (HJB) solution of the game
is provided and some particular cases are discussed. 相似文献
893.
Cristina Fernández-Córdoba Jaume Pujol Mercè Villanueva 《Designs, Codes and Cryptography》2010,56(1):43-59
A code C{{\mathcal C}} is
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C{{\mathcal C}} by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-additive codes under an extended Gray map are called
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes. In this paper, the invariants for
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the rank and dimension of the kernel, are studied. Specifically, given the algebraic parameters of
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the possible values of these two invariants, giving lower and upper bounds, are established. For each possible
rank r between these bounds, the construction of a
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with dimension of the kernel k is given. Finally, the bounds on the rank, once the kernel dimension is fixed, are established and the construction of a
\mathbbZ2\mathbbZ4{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code for each possible pair (r, k) is given. 相似文献
894.
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming 总被引:1,自引:0,他引:1
Gianni Di Pillo Giampaolo Liuzzi Stefano Lucidi Laura Palagi 《Computational Optimization and Applications》2010,45(2):311-352
In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming problems. The core of the
method is a local algorithm which relies on a truncated procedure for the computation of a search direction, and is thus suitable
for large scale problems. The truncated direction produces a sequence of points which locally converges to a KKT pair with
superlinear convergence rate. 相似文献
895.
Koszul algebras have arisen in many contexts; algebraic geometry, combinatorics, Lie algebras, non-commutative geometry and
topology. The aim of this paper and several sequel papers is to show that for any finite dimensional algebra there is always
a naturally associated Koszul theory. To obtain this, the notions of Koszul algebras, linear modules and Koszul duality are
extended to additive (graded) categories over a field. The main focus of this paper is to provide these generalizations and
the necessary preliminaries. 相似文献
896.
T Birbas S Daskalaki E Housos 《The Journal of the Operational Research Society》1997,48(12):1191-1200
The timetabling process and the resulting weekly schedules are important components for the daily operation of any school. This paper presents an efficient solution to the timetabling problem for the secondary educational system in Greece. Such a problem involves scheduling a large number of classes, teachers, courses, and classrooms to a number of time-periods. The development of the basic structure and the modelling of the problem as an integer mathematical program allows for the generation of constraints necessary for the satisfaction of all the school system rules and regulations. The integer programming approach and the commercial tools available for this class of problems facilitated the process of locating the optimal solution for the problem. The model is flexible and modular allowing for adaptations to satisfy the local characteristics of each school by changing the parameters of the model and adding or replacing constraints. A fully defined timetabling problem for a typical Greek high school is presented and optimally solved in order to demonstrate the effectiveness of the model in satisfying both the hard and the soft operational rules of the problem. Implementation of the new methodology for regular use for high schools is currently being attempted. 相似文献
897.
The existence of reliable and flexible FORTRAN programs for integer linear programming has recently enabled the development of very efficient algorithms for the travelling salesman problem. The main characteristic of these algorithms is the relaxation of most of the constraints of the problem during its solution. The same approach can be used for the solution of the m-salesmen problem in which m salesmen starting from the same city must visit only once n cities at minimum cost. The number of salesmen can be fixed in advance or allowed to vary, upper and lower bounds set on the number of salesmen and even fixed costs associated with the salesmen. The results obtained so far are very encouraging. Problems of up to 100 cities have been solved optimally for the m-travelling salesmen case and other more complex problems are currently under study. 相似文献
898.
Mason Gene Bailey Billy E. Gillett 《The Journal of the Operational Research Society》1980,31(3):257-262
An algorithm is presented for solving families of integer linear programming problems in which the problems are "related" by having identical objective coefficients and constraint matrix coefficients. The righthand-side constants have the form b + θd where b and d are conformable vectors and θ varies from zero to one.The approach consists primarily of solving the most relaxed problem (θ = 1) using cutting planes and then contracting the region of feasible integer solutions in such a manner that the current optimal integer solution is eliminated.The algorithm was applied to 1800 integer linear programming problems with reasonable success. Integer programming problems which have proved to be unsolvable using cutting planes have been solved by expanding the region of feasible integer solutions (θ = 1) and then contracting to the original region. 相似文献
899.
The problem of scheduling delivery vehicles from a number of depots to customers, subject to constraints on load and distance or time, is considered. A new algorithm is presented; this allows routes from several depots to be constructed simultaneously, subject to restrictions on numbers of vehicles at individual depots. Where too many customers require service, a flexible priority rule will select those to be served. Results for the single depot case are compared with other known algorithms; further results are given and discussed for cases of several depots. 相似文献
900.
Oscar Chisini 《Rendiconti del Circolo Matematico di Palermo》1916,42(1):59-64
An improvement of the uniqueness theorem of Wintner for the differential equationx (n)(t)=f(t, x) is given. 相似文献