首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   324048篇
  免费   2138篇
  国内免费   885篇
化学   136087篇
晶体学   4736篇
力学   18915篇
综合类   3篇
数学   69436篇
物理学   97894篇
  2020年   1408篇
  2019年   1568篇
  2018年   18579篇
  2017年   19200篇
  2016年   11757篇
  2015年   3404篇
  2014年   3501篇
  2013年   8078篇
  2012年   12546篇
  2011年   26405篇
  2010年   16086篇
  2009年   16516篇
  2008年   21535篇
  2007年   26406篇
  2006年   6454篇
  2005年   12989篇
  2004年   9588篇
  2003年   9473篇
  2002年   6647篇
  2001年   5572篇
  2000年   4421篇
  1999年   3132篇
  1998年   2697篇
  1997年   2531篇
  1996年   2536篇
  1995年   2311篇
  1994年   2242篇
  1993年   2155篇
  1992年   2415篇
  1991年   2369篇
  1990年   2306篇
  1989年   2242篇
  1988年   2255篇
  1987年   2254篇
  1986年   2143篇
  1985年   2759篇
  1984年   2821篇
  1983年   2513篇
  1982年   2621篇
  1981年   2427篇
  1980年   2417篇
  1979年   2563篇
  1978年   2599篇
  1977年   2432篇
  1976年   2515篇
  1975年   2410篇
  1974年   2369篇
  1973年   2584篇
  1972年   1658篇
  1971年   1356篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
An ontology is a classification model for a given domain. In information retrieval, ontologies are used to perform broad searches. An ontology can be visualized as nodes and edges. Each node represents an element and each edge a relation between a parent and a child element. Working with an ontology becomes easier with a visual representation. An idea is to use the expressive power of 3D representation to provide visualization for the user. In this paper, we propose a new method for positioning the elements of the visualized concept lattice in the 3D world based on operations research (OR) methods. One method uses a discrete location model to create an initial solution and we propose heuristic methods to further improve the visual result. We evaluate the visual results according to our success criteria and the feedback from users. Running times of the heuristic indicate that an improved version should be feasible for on-line processing and what-if analysis of ontologies.  相似文献   
992.
Calorimetric results indicate that nitrocellulose (NC)-induced changes in the metabolism of Desulfovibrio desulfuricans 1388 are caused by both chemical (nitrate) and physical (biofilm formation) factors. Nitrate added to lactate-based culture medium with nitrocellulose competed for the electron flux from lactate and suppressed the bacterial sulfidogenesis and growth. The presence of an insoluble compound (carbon backbone of the polymer) induced the creation of a biofilm-like structure with its own metabolism.  相似文献   
993.
We study the corrections to the Clausius-Mossotti formula for the dielectric constant of a disordered system of polarizable spherical particles. Previously we have derived an exact cluster expansion for the correction terms. Here we study the three-body correction in detail. We derive an explicit expression for the integrand of the three-body cluster integral for a system of polarizable point dipoles.  相似文献   
994.
995.
We study property (T) and the fixed-point property for actions on L p and other Banach spaces. We show that property (T) holds when L 2 is replaced by L p (and even a subspace/quotient of L p ), and that in fact it is independent of 1≤p<∞. We show that the fixed-point property for L p follows from property (T) when 1<p< 2+ε. For simple Lie groups and their lattices, we prove that the fixed-point property for L p holds for any 1< p<∞ if and only if the rank is at least two. Finally, we obtain a superrigidity result for actions of irreducible lattices in products of general groups on superreflexive spaces. Bader partially supported by ISF grant 100146; Furman partially supported by NSF grants DMS-0094245 and DMS-0604611; Gelander partially supported by NSF grant DMS-0404557 and BSF grant 2004010; Monod partially supported by FNS (CH) and NSF (US).  相似文献   
996.
997.
This paper provides a quantitative and comparative economic and risk approach to strategic quality control in a supply chain, consisting of one supplier and one producer, using a random payoff game. Such a game is first solved in a risk-neutral framework by assuming that both parties are competing with each other. We show in this case that there may be an interior solution to the inspection game. A similar analysis under a collaborative framework is shown to be trivial and not practical, with a solution to the inspection game being an ‘all or nothing’ solution to one or both the parties involved. For these reasons, the sampling random payoff game is transformed into a Neyman–Pearson risk constraints game, where the parties minimize the expected costs subject to a set of Neyman–Pearson risk (type I and type II) constraints. In this case, the number of potential equilibria can be large. A number of such solutions are developed and a practical (convex) approach is suggested by providing an interior (partial sampling) solution for the collaborative case. Numerical examples are developed to demonstrate the procedure used. Thus, unlike theoretical approaches to the solution of strategic quality control random payoff games, the approach we construct is both practical and consistent with the statistical risk Neyman–Pearson approach.  相似文献   
998.
In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.  相似文献   
999.
This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.  相似文献   
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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