全文获取类型
收费全文 | 77611篇 |
免费 | 318篇 |
国内免费 | 374篇 |
专业分类
化学 | 23884篇 |
晶体学 | 787篇 |
力学 | 6719篇 |
数学 | 31924篇 |
物理学 | 14989篇 |
出版年
2018年 | 10430篇 |
2017年 | 10257篇 |
2016年 | 6051篇 |
2015年 | 833篇 |
2014年 | 280篇 |
2013年 | 295篇 |
2012年 | 3750篇 |
2011年 | 10466篇 |
2010年 | 5611篇 |
2009年 | 6024篇 |
2008年 | 6565篇 |
2007年 | 8727篇 |
2006年 | 196篇 |
2005年 | 1281篇 |
2004年 | 1508篇 |
2003年 | 1953篇 |
2002年 | 997篇 |
2001年 | 239篇 |
2000年 | 284篇 |
1999年 | 149篇 |
1998年 | 188篇 |
1997年 | 142篇 |
1996年 | 194篇 |
1995年 | 114篇 |
1994年 | 74篇 |
1993年 | 92篇 |
1992年 | 52篇 |
1991年 | 62篇 |
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条查询结果,搜索用时 15 毫秒
731.
Using variational method and lower and upper solutions, we get a generalized quasilinearization method which construct an
iterative scheme converging uniformly to a solution of a nonlinear second-order impulsive differential equations involving
the p-Laplacian, and converging quadratically when p=2. 相似文献
732.
Tohru Nakashima 《Designs, Codes and Cryptography》2010,57(1):107-115
We discuss the properties of algebraic-geometric codes defined by a vector bundle on a curve X over a finite field. We investigate the correction capacities of the codes defined from vector bundles constructed by means
of finite coverings of X. 相似文献
733.
Quadratic assignment problems (QAPs) are known to be among the hardest discrete optimization problems. Recent study shows
that even obtaining a strong lower bound for QAPs is a computational challenge. In this paper, we first discuss how to construct
new simple convex relaxations of QAPs based on various matrix splitting schemes. Then we introduce the so-called symmetric
mappings that can be used to derive strong cuts for the proposed relaxation model. We show that the bounds based on the new
models are comparable to some strong bounds in the literature. Promising experimental results based on the new relaxations
are reported. 相似文献
734.
Finitary Markov processes are described in G. Morvai and B. Weiss, Prediction for discrete time series, Probability Theory and Related Fields 132 (2005), 1–12. The transition functions of finitary Markov processes are residually locally constant g-functions that can be extended by continuity to their maximal domain of definition. The study of their associated symbolic
dynamics leads one to the D-shifts as introduced in W. Krieger, On g-functions for subshifts, Institute of Mathematical Statistics Lecture Notes-Monograph Series, Vol. 48, Dynamics & Stochastics, arXiv:math.DS/0608259,
(2006), 306–316, We study the phenomena that can arise in residually locally constant and locally constant maximally defined
g-functions on D-shifts, Markov shifts and synchronizing systems with respect to future measures and g-measures 相似文献
735.
We investigate the relationship between the Gröbner-Shirshov bases in free associative algebras, free left modules and “double-free” left modules (that is, free modules over a free algebra). We first give Chibrikov’s Composition-Diamond lemma for modules and then we show that Kang-Lee’s Composition-Diamond lemma follows from it. We give the Gröbner-Shirshov bases for the following modules: the highest weight module over a Lie algebra sl 2, the Verma module over a Kac-Moody algebra, the Verma module over the Lie algebra of coefficients of a free conformal algebra, and a universal enveloping module for a Sabinin algebra. As applications, we also obtain linear bases for the above modules. 相似文献
736.
We consider the median regression with a LASSO-type penalty term for variable selection. With the fixed number of variables
in regression model, a two-stage method is proposed for simultaneous estimation and variable selection where the degree of
penalty is adaptively chosen. A Bayesian information criterion type approach is proposed and used to obtain a data-driven
procedure which is proved to automatically select asymptotically optimal tuning parameters. It is shown that the resultant
estimator achieves the so-called oracle property. The combination of the median regression and LASSO penalty is computationally
easy to implement via the standard linear programming. A random perturbation scheme can be made use of to get simple estimator
of the standard error. Simulation studies are conducted to assess the finite-sample performance of the proposed method. We
illustrate the methodology with a real example. 相似文献
737.
We propose new robust classification algorithms for planar and spatial curves subjected to affine transformations. Our motivation comes from the problems in computer image recognition. To each planar or spatial curve, we assign a planar signature curve. Curves, equivalent under an affine transformation, have the same signature. The signatures are based on integral invariants, which are significantly less sensitive to small perturbations of curves and noise than classically known differential invariants. Affine invariants are derived in terms of Euclidean invariants. We present two types of signatures: the global and the local signature. Both signatures are independent of curve parameterization. The global signature depends on a choice of the initial point and, therefore, cannot be used for local comparison. The local signature, albeit being slightly more sensitive to noise, is independent of the choice of the initial point and can be used to solve local equivalence problem. An experiment that illustrates robustness of the proposed signatures is presented. 相似文献
738.
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. 相似文献
739.
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. 相似文献
740.
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. 相似文献