首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13344篇
  免费   320篇
  国内免费   74篇
化学   8341篇
晶体学   133篇
力学   453篇
数学   1956篇
物理学   2855篇
  2022年   131篇
  2021年   144篇
  2020年   181篇
  2019年   174篇
  2018年   135篇
  2017年   116篇
  2016年   277篇
  2015年   245篇
  2014年   310篇
  2013年   682篇
  2012年   635篇
  2011年   708篇
  2010年   361篇
  2009年   419篇
  2008年   652篇
  2007年   657篇
  2006年   620篇
  2005年   562篇
  2004年   530篇
  2003年   436篇
  2002年   385篇
  2001年   240篇
  2000年   246篇
  1999年   141篇
  1998年   137篇
  1997年   139篇
  1996年   187篇
  1995年   138篇
  1994年   195篇
  1993年   195篇
  1992年   197篇
  1991年   141篇
  1990年   142篇
  1989年   150篇
  1988年   120篇
  1987年   139篇
  1986年   126篇
  1985年   223篇
  1984年   183篇
  1983年   128篇
  1982年   157篇
  1981年   136篇
  1980年   157篇
  1979年   144篇
  1978年   150篇
  1977年   128篇
  1976年   144篇
  1975年   117篇
  1974年   143篇
  1973年   132篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
Abstract Some spectral properties of certain 2×2 globally elliptic systems of ordinary differential operators, a class of vector-valued deformations of the classical harmonic oscillator here called noncommutative harmonic oscillators, will be described, with special emphasis on the Poisson relation and clustering properties of the eigenvalues. Keywords: Clustering theorems, Periodic trajectories, Poisson relations, Noncommutative harmonic oscillators  相似文献   
42.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.  相似文献   
43.
Online weighted flow time and deadline scheduling   总被引:1,自引:0,他引:1  
In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|ri,pmtn|∑wiFi. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.  相似文献   
44.
We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.  相似文献   
45.
46.
47.
Here we prove that every compact differential manifold has a smooth algebraic model defined over Q. In dimension 2 we find an algebraic model (may be singular) defined over Q and birational over Q to the projective plane.  相似文献   
48.
In previous work, we considered the representation of human decision-making processes in closed-form simulation models of conflict. An important element of this representation is the rapid planning process that embodies the processing of information for situation assessment to support a course of action decision (eg in a military headquarters). The application of this work is in support of operational analysis models for defence procurement and balance of investment. This paper describes the application of non-linear multi-attribute utility theory in conflict scenarios in order to extend the representation of the rapid planning process to account for a wider set of subjective attributes of the decision-maker. The results show, through examination of experimental data, that decision-making can be modelled through a particular class of utility functions. These utilities embody a geometry which allows us to classify the types of decision being made when there are conflicting objectives and when decision-makers adopt very different and subjective appraisals of constraints and beliefs in outcome. The experimental results help to demonstrate that the subjective nature of the situation assessment, and the personality, training, experience and history of the decision-maker are central to the functional representations. This paper presents a way to capture this deeper representation of human decision-making in a way that is potentially useful for quantitative modelling using the rapid planning process as a basis.  相似文献   
49.
Time-of-flight secondary ion mass spectrometry (ToF-SIMS) and polarisation-modulation reflection-absorption infrared spectroscopy (PM-RAIRS) have been used to monitor the surface synthesis of self-assembled aromatic π-conjugated molecular wires on gold substrates as a step towards a novel structure for organic electroluminescent devices (OLEDs). The wires have been synthesised using a series of Schiff's base coupling reactions in solution on a self-assembled monolayer of an aromatic thiolate anchor. ToF-SIMS and PM-RAIRS measurements have demonstrated that: (i) the anchor molecules self-assemble at the gold surface, (ii) the anchor molecules selectively react through imino coupling reactions with additional wire units with high efficiency and (iii) the wire-like structure is predominantly orientated normal to the surface.  相似文献   
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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