首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84106篇
  免费   1293篇
  国内免费   922篇
化学   28521篇
晶体学   814篇
力学   7058篇
综合类   16篇
数学   32629篇
物理学   17283篇
  2023年   151篇
  2022年   214篇
  2021年   283篇
  2020年   281篇
  2019年   240篇
  2018年   10586篇
  2017年   10390篇
  2016年   6315篇
  2015年   1108篇
  2014年   650篇
  2013年   748篇
  2012年   4332篇
  2011年   11044篇
  2010年   6003篇
  2009年   6349篇
  2008年   6962篇
  2007年   9067篇
  2006年   544篇
  2005年   1545篇
  2004年   1705篇
  2003年   2106篇
  2002年   1123篇
  2001年   370篇
  2000年   407篇
  1999年   283篇
  1998年   293篇
  1997年   234篇
  1996年   316篇
  1995年   217篇
  1994年   144篇
  1993年   155篇
  1992年   121篇
  1991年   119篇
  1990年   123篇
  1989年   111篇
  1988年   92篇
  1987年   86篇
  1986年   81篇
  1985年   64篇
  1984年   58篇
  1983年   52篇
  1982年   56篇
  1981年   48篇
  1980年   54篇
  1979年   64篇
  1978年   49篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
A multi-objective mixed integer programming model for equity portfolio construction and selection is developed in this study, in order to generate the Pareto optimal portfolios, using a novel version of the well known ε-constraint method. Subsequently, an interactive filtering process is also proposed to assist the decision maker in making his/her final choice among the Pareto solutions. The proposed methodology is tested through an application in the Athens Stock Exchange.  相似文献   
992.
In this paper we investigate certain aspects of infeasibility in convex integer programs, where the constraint functions are defined either as a composition of a convex increasing function with a convex integer valued function of n variables or the sum of similar functions. In particular we are concerned with the problem of an upper bound for the minimal cardinality of the irreducible infeasible subset of constraints defining the model. We prove that for the considered class of functions, every infeasible system of inequality constraints in the convex integer program contains an inconsistent subsystem of cardinality not greater than 2 n , this way generalizing the well known theorem of Scarf and Bell for linear systems. The latter result allows us to demonstrate that if the considered convex integer problem is bounded below, then there exists a subset of at most 2 n −1 constraints in the system, such that the minimum of the objective function subject to the inequalities in the reduced subsystem, equals to the minimum of the objective function over the entire system of constraints.  相似文献   
993.
We prove that a real function is operator monotone (operator convex) if the corresponding monotonicity (convexity) inequalities are valid for some normal state on the algebra of all bounded operators in an infinite-dimensional Hilbert space. We describe the class of convex operator functions with respect to a given von Neumann algebra in dependence of types of direct summands in this algebra. We prove that if a function from ℝ+ into ℝ+ is monotone with respect to a von Neumann algebra, then it is also operator monotone in the sense of the natural order on the set of positive self-adjoint operators affiliated with this algebra.  相似文献   
994.
The purpose of this paper is to describe the structures of the Möbius semigroup induced by the Möbius transformation group (?, SL(2,?)). In particular, we study stabilizer subsemigoups of Möbius semigroup via the triangle semigroup. In this work, we obtained a geometric interpretation of the least contraction coefficient function of the Möbius semigroup via the triangle semigroup and investigated an extension of stabilizer subsemigoups of the Möbius semigroup. Finally, we obtained a factorization of our stabilizer subsemigoups of the Möbius semigroup.  相似文献   
995.
Encoding the hierarchical structure of images by p-adic numbers allows for image processing and computer vision methods motivated from arithmetic physics. The p-adic Polyakov action leads to the p-adic diffusion equation in low level vision. Hierarchical segmentation provides another way of p-adic encoding. Then a topology on that finite set of p-adic numbers yields a hierarchy of topological models underlying the image. In the case of chain complexes, the chain maps yield conditions for the existence of a hierarchy, and these can be expressed in terms of p-adic integrals. Such a chain complex hierarchy is a special case of a persistence complex from computational topology, where it is used for computing persistence barcodes for shapes. The approach is motivated by the observation that using p-adic numbers often leads to more efficient algorithms than their real or complex counterparts.  相似文献   
996.
Multivariate Hierarchical Copulas with Shocks   总被引:2,自引:0,他引:2  
A transformation to obtain new multivariate hierarchical copulas, starting with an arbitrary copula, is introduced. In addition to the hierarchical structure, the presented construction principle explicitly supports singular components. These may be interpreted as the effect of local or global shocks to the underlying random variables. A large spectrum of dependence patterns can be achieved by the presented transformation, which seems promising for practical applications. Moreover, copulas arising from this construction are similarly admissible with respect to analytical tractability and sampling routines as the original copula. Finally, several well-known families of copulas may be interpreted as special cases.  相似文献   
997.
In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape.  相似文献   
998.
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.  相似文献   
999.
We derive several new transformations relating WP-Bailey pairs. We also consider the corresponding transformations relating standard Bailey pairs, and as a consequence, derive some quite general expansions for products of theta functions which can also be expressed as certain types of Lambert series.  相似文献   
1000.
Classification is concerned with the development of rules for the allocation of observations to groups, and is a fundamental problem in machine learning. Much of previous work on classification models investigates two-group discrimination. Multi-category classification is less-often considered due to the tendency of generalizations of two-group models to produce misclassification rates that are higher than desirable. Indeed, producing “good” two-group classification rules is a challenging task for some applications, and producing good multi-category rules is generally more difficult. Additionally, even when the “optimal” classification rule is known, inter-group misclassification rates may be higher than tolerable for a given classification model. We investigate properties of a mixed-integer programming based multi-category classification model that allows for the pre-specification of limits on inter-group misclassification rates. The mechanism by which the limits are satisfied is the use of a reserved judgment region, an artificial category into which observations are placed whose attributes do not sufficiently indicate membership to any particular group. The method is shown to be a consistent estimator of a classification rule with misclassification limits, and performance on simulated and real-world data is demonstrated.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号