首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2798篇
  免费   145篇
  国内免费   289篇
化学   140篇
晶体学   2篇
力学   87篇
综合类   42篇
数学   2674篇
物理学   287篇
  2024年   3篇
  2023年   31篇
  2022年   39篇
  2021年   37篇
  2020年   56篇
  2019年   71篇
  2018年   79篇
  2017年   82篇
  2016年   60篇
  2015年   45篇
  2014年   84篇
  2013年   290篇
  2012年   87篇
  2011年   99篇
  2010年   93篇
  2009年   152篇
  2008年   192篇
  2007年   163篇
  2006年   160篇
  2005年   132篇
  2004年   141篇
  2003年   140篇
  2002年   140篇
  2001年   120篇
  2000年   131篇
  1999年   102篇
  1998年   90篇
  1997年   77篇
  1996年   76篇
  1995年   28篇
  1994年   32篇
  1993年   30篇
  1992年   30篇
  1991年   23篇
  1990年   14篇
  1989年   13篇
  1988年   13篇
  1987年   6篇
  1986年   4篇
  1985年   13篇
  1984年   6篇
  1983年   3篇
  1982年   9篇
  1981年   9篇
  1980年   9篇
  1979年   4篇
  1978年   5篇
  1977年   4篇
  1976年   2篇
  1975年   3篇
排序方式: 共有3232条查询结果,搜索用时 15 毫秒
21.
Masanori Asakura 《K-Theory》2002,27(3):273-280
We construct 0-cycles on a self-product of a curve whose cycle classes are linearly independent in the extension group of arithmetic Hodge structure. This is an extended version of Theorem 4.5 of Asakura's contribution to CMR Lecture Notes Ser. 24 ((2000), pp. 133–154).  相似文献   
22.
Regularization of singular systems of linear algebraic equations by shifts is examined. New equivalent conditions for the shift regularizability of such systems are derived.  相似文献   
23.
本文考虑了欧式空间R ̄n中任意单纯形剖分上的样条函数空间.证明了当k≥(3μ+1)2 ̄(n-2)+1时,计算任意单纯形剖分Δ上的k次μ阶光滑样条空间的维数,可归结为计算每个σ-关联域(i-单纯形σ∈Δ)R(σ)上的2 ̄(n-i-1)μ次μ阶光滑(i≤n-1)样条空间的维数。这里σ-关联域R(σ)是指Δ中所有包含σ的单纯形所成的单纯形剖分.  相似文献   
24.
In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T. (eds.) Nonlinear analysis and convex analysis, pp. 221–228, 1999). We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given. The authors thank the two referees for valuable comments and suggestions on early versions of the paper. The research of the first author was partially supported by Ministerio de Educación y Ciencia (Spain) Project MTM2006-02629 and by Junta de Castilla y León (Spain) Project VA027B06.  相似文献   
25.
Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t2, t3 and t satisfy s ≥ 2, t2 ≥ 2 and t3t2(t2+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t2 and t3. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders  相似文献   
26.
When depicted on maps as homogenous territorial wholes, ancient states are visually summarized as static entities in a way that conceals the highly fluid dynamics of polity formation, maintenance, and growth. Models derived from studies of animal behavior show that “territory” does not consist of an undifferentiated use of the landscape. Instead, the concept of territory can be parsed into a series of resource‐rich nodes linked by corridors of access, surrounded by unutilized regions and boundaries marked at points of competition. Ancient human groups also can be analyzed as having perceived and occupied landscapes through strategies of flexible networks in which nodes and corridors were surrounded by unutilized spaces around which boundaries were selectively identified and defended. This strategy is identifiable in human social groups at different levels of complexity ranging from hunter‐gatherers through ancient chiefdoms and states. © 2007 Wiley Periodicals, Inc. Complexity 12: 28–35, 2007  相似文献   
27.
Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??1 and ??2, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??1 or ??2, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??1 or ??2. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, ti (0 ≤ id) satisfy (s, t2, t3) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006  相似文献   
28.
29.
为改进Fuzzy HX环的结果,使之包含Fuzzy商环,提出了弱Fuzzy HX环的概念,研究了它的性质与结构,并重新讨论了拟Fuzzy商环,证明了在正则条件下拟Fuzzy商环与弱Fuzzy HX环的统一性:同时也得到了一致弱Fuzzy HX环与普通Fuzzy商环的关系。  相似文献   
30.
Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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