首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1006篇
  免费   20篇
化学   546篇
晶体学   18篇
力学   7篇
数学   160篇
物理学   295篇
  2022年   3篇
  2021年   10篇
  2020年   11篇
  2019年   15篇
  2018年   37篇
  2017年   24篇
  2016年   51篇
  2015年   35篇
  2014年   44篇
  2013年   109篇
  2012年   28篇
  2011年   55篇
  2010年   38篇
  2009年   35篇
  2008年   53篇
  2007年   39篇
  2006年   33篇
  2005年   32篇
  2004年   33篇
  2003年   37篇
  2002年   18篇
  2001年   26篇
  2000年   17篇
  1999年   16篇
  1998年   12篇
  1997年   15篇
  1996年   9篇
  1995年   13篇
  1994年   6篇
  1993年   11篇
  1992年   8篇
  1991年   8篇
  1990年   3篇
  1989年   9篇
  1988年   5篇
  1987年   12篇
  1986年   7篇
  1985年   9篇
  1984年   12篇
  1983年   6篇
  1982年   8篇
  1981年   9篇
  1980年   9篇
  1979年   9篇
  1978年   5篇
  1977年   6篇
  1976年   3篇
  1975年   3篇
  1973年   4篇
  1929年   5篇
排序方式: 共有1026条查询结果,搜索用时 15 毫秒
41.
42.
In a symmetric 2-structure ${\Sigma =(P,\mathfrak{G}_1,\mathfrak{G}_2,\mathfrak{K})}$ we fix a chain ${E \in \mathfrak{K}}$ and define on E two binary operations “+” and “·”. Then (E,+) is a K-loop and for ${E^* := E {\setminus}\{o\}}$ , (E *,·) is a Bol loop. If ${\Sigma}$ is even point symmetric then (E,+ ,·) is a quasidomain and one has the set ${Aff(E,+,\cdot) := \{a^+\circ b^\bullet | a \in E, b \in E^*\}}$ of affine permutations. From Aff(E, +, ·) one can reproduce via a “chain derivation” the point symmetric 2-structure ${\Sigma}$ .  相似文献   
43.
We classify symmetric 2-structures ${(P, \mathfrak{G}_1, \mathfrak{G}_2, \mathfrak{K})}$ , i.e. chain structures which correspond to sharply 2-transitive permutation sets (E, Σ) satisfying the condition: “ ${(*) \, \, \forall \sigma, \tau \in \Sigma : \sigma \circ \tau^{-1} \circ \sigma \in \Sigma}$ ”. To every chain ${K \in \mathfrak{K}}$ one can associate a reflection ${\widetilde{K}}$ in K. Then (*) is equivalent to “ ${(**) \, \, \forall K \in \mathfrak{K} : \widetilde{K}(\mathfrak{K}) = \mathfrak{K}}$ ” and one can define an orthogonality “ ${\perp}$ ” for chains ${K, L \in \mathfrak{K}}$ by “ ${K \perp L \Leftrightarrow K \neq L \wedge \widetilde{K}(L) = L}$ ”. The classification is based on the cardinality of the set of chains which are orthogonal to a chain K and passing through a point p of K. For one of these classes (called point symmetric 2-structures) we proof that in each point there is a reflection and that the set of point reflections forms a regular involutory permutation set.  相似文献   
44.
This paper generalizes the classical discounted utility model introduced in Samuelson (Rev. Econ. Stud. 4:155–161, 1937) by replacing a constant discount rate with a function. The existence of recursive utilities and their constructions are based on Matkowski’s extension of the Banach Contraction Principle. The derived utilities go beyond the class of recursive utilities studied in the literature and enable a discussion on subtle issues concerning time preferences in the theory of finance, economics or psychology. Moreover, our main results are applied to the theory of optimal economic growth related with resource extraction models with unbounded utility function of consumption.  相似文献   
45.
Simultaneous confidence bands for the integrated hazard function   总被引:1,自引:1,他引:0  
The construction of the simultaneous confidence bands for the integrated hazard function is considered. The Nelson–Aalen estimator is used. The simultaneous confidence bands based on bootstrap methods are presented. Four methods of construction of such confidence bands are proposed. The weird and conditional bootstrap methods are used for resampling. Simulations are made to compare the actual coverage probability of the bootstrap and the asymptotic simultaneous confidence bands. It is shown that the equal-tailed bootstrap confidence band has the coverage probability closest to the nominal one. We also present application of our confidence bands to the data regarding survival after heart transplant. This research was partly supported by AGH grant No. 10.420.03.  相似文献   
46.
The paper is devoted to searching algorithms which will allow to generate images of attractors of generalized iterated function systems (GIFS in short), which are certain generalization of classical iterated function systems, defined by Mihail and Miculescu in 2008, and then intensively investigated in the last years (the idea is that instead of selfmaps of a metric space X, we consider mappings form the Cartesian product X×...×X to X). Two presented algorithms are counterparts of classical deterministic algorithm and so-called chaos game. The third and fourth one is fitted to special kind of GIFSs - to affine GIFS, which are, in turn, also investigated.  相似文献   
47.
We study a generalization of the Fréchet functional equation, stemming from a characterization of inner product spaces. We show, in particular, that under some weak additional assumptions each solution of such an equation is additive. We also obtain a theorem on the Ulam type stability of the equation. In its proof we use a fixed point result to show the existence of an exact solution of the equation that is close to a given approximate solution.  相似文献   
48.
In this note we give elementary examples of the naturalness of generalized Clifford algebras appearance, in some particular quantum mechanical models. First Weyl’s program [1] for quantum kinematics for the case of simplest Galois fieldsZ n is realized in terms of generalized Clifford algebras. Dynamics might then be introduced, following the ideas of Hanney and Berry [2], as shown in [3]. Second the coherent state picture of the finite dimensional “Z n — Quantum Mechanics” is presented. In the last part the known coherent states ofq-deformed quantum oscillators (q≡ω) are explicitly shown in the generalized Grassman algebras and the generalized Clifford algebras settings. Presented atThe Polish-Mexican Seminar, Kazimierz Dolny, August 1998 — Poland. 176  相似文献   
49.
We construct infinite dimensional families of non-singular stationary space times, solutions of the vacuum Einstein equations with a negative cosmological constant. Submitted: December 12, 2005. Accepted: May 22, 2006.  相似文献   
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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