首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   702篇
  免费   18篇
  国内免费   6篇
化学   469篇
晶体学   9篇
力学   19篇
数学   104篇
物理学   125篇
  2022年   6篇
  2021年   11篇
  2020年   6篇
  2019年   7篇
  2018年   13篇
  2017年   5篇
  2016年   14篇
  2015年   14篇
  2014年   20篇
  2013年   41篇
  2012年   31篇
  2011年   34篇
  2010年   31篇
  2009年   25篇
  2008年   43篇
  2007年   38篇
  2006年   40篇
  2005年   32篇
  2004年   27篇
  2003年   33篇
  2002年   28篇
  2001年   10篇
  2000年   21篇
  1999年   8篇
  1998年   14篇
  1997年   9篇
  1996年   11篇
  1995年   10篇
  1994年   11篇
  1993年   11篇
  1992年   8篇
  1991年   16篇
  1990年   7篇
  1989年   8篇
  1988年   7篇
  1987年   3篇
  1986年   3篇
  1985年   8篇
  1984年   8篇
  1983年   3篇
  1982年   6篇
  1981年   9篇
  1980年   3篇
  1979年   4篇
  1978年   4篇
  1977年   3篇
  1976年   5篇
  1975年   3篇
  1933年   2篇
  1932年   2篇
排序方式: 共有726条查询结果,搜索用时 78 毫秒
1.
2.
3.
The aim of this paper is to study I-fuzzy topologies (fuzzy topologies in ostak's sense) derived from decreasing families of I-topologies (fuzzy topologies in Chang's sense), defined on a set X.  相似文献   
4.
We consider a family of spaces wider than r-UNC spaces and we give some fixed point results in the setting of these spaces.  相似文献   
5.
We analyse some identifiers which can univocally identify hyperbolic components and Misiurewicz points of one-dimensional quadratic maps. After seeing the equivalence among the different identifiers and how to go from one to another, we show which are the best for some specific tasks. Likewise, we present the analytic expressions, some of them shown for the first time in this paper, to calculate these identifiers. Some experimental considerations are taken into account.  相似文献   
6.
7.
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.  相似文献   
8.
A multivalued version of Sharkovskiĭ’s theorem is formulated for M-maps on linear continua and, more generally, for triangular M-maps on a Cartesian product of linear continua. This improves the main result of [AP1] in the sense that our multivalued analogue holds with at most two exceptions. A further specification requires some additional restrictions. For instance, 3- orbits of m-maps imply the existence of k-orbits for all k ? \mathbbNk \in {\mathbb{N}} , except possibly for k ?k \in {4, 6}. It is also shown that, on every connected linearly ordered topological space, an M-map with orbits of all periods can always be constructed. This demonstrates that Baldwin’s classification of linear continua in terms of admissible periods [Ba] is useless for multivalued maps.  相似文献   
9.
We evaluate the financial performance of most of the branch offices of a large European savings bank for a recent accounting period. We employ a complementary pair of nonparametric techniques to evaluate their financial performance, in terms of their ability to conserve on the expenses they incur in building their customer bases and providing customer services. We find variation in the ability of branch offices to perform this task, and agreement on the identity of the laggard branches. We then employ parametric techniques to determine that the list of indicators on which their financial performance is evaluated can be reduced without statistically significant loss of information to bank management. Both findings suggest ways in which the bank can increase the profitability of its branch network. A previous version of this paper was presented at CORE, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, where we received many helpful comments from the audience. We are grateful to three referees for their helpful comments as well.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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