首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3322篇
  免费   372篇
  国内免费   134篇
化学   960篇
晶体学   2篇
力学   187篇
综合类   148篇
数学   1268篇
物理学   1263篇
  2024年   18篇
  2023年   123篇
  2022年   289篇
  2021年   447篇
  2020年   256篇
  2019年   191篇
  2018年   148篇
  2017年   174篇
  2016年   205篇
  2015年   132篇
  2014年   203篇
  2013年   227篇
  2012年   142篇
  2011年   148篇
  2010年   136篇
  2009年   140篇
  2008年   133篇
  2007年   140篇
  2006年   97篇
  2005年   80篇
  2004年   50篇
  2003年   44篇
  2002年   28篇
  2001年   23篇
  2000年   30篇
  1999年   20篇
  1998年   24篇
  1997年   28篇
  1996年   24篇
  1995年   22篇
  1994年   7篇
  1993年   10篇
  1992年   11篇
  1991年   8篇
  1990年   9篇
  1989年   6篇
  1988年   8篇
  1987年   3篇
  1986年   9篇
  1985年   4篇
  1984年   6篇
  1983年   5篇
  1980年   3篇
  1979年   3篇
  1978年   2篇
  1977年   2篇
  1971年   1篇
  1969年   1篇
  1967年   1篇
  1959年   5篇
排序方式: 共有3828条查询结果,搜索用时 15 毫秒
151.
Single Machine Scheduling of Unit-time Jobs with Controllable Release Dates   总被引:1,自引:0,他引:1  
The paper presents a bicriterion approach to solve the single-machine scheduling problem in which the job release dates can be compressed while incurring additional costs. The two criteria are the makespan and the compression cost. For the case of equal job processing times, an O(n4) algorithm is developed to construct integer Pareto optimal points. We discuss how the algorithm developed can be modified to construct an -approximation of noninteger Pareto optimal points. The complexity status of the problem with total weighted completion time criterion is also established.  相似文献   
152.
We consider a production system with finite buffers and arbitrary topology where service time is subject to interruptions in one of three ways, viz. machine breakdown, machine vacations or Npolicy. We develop a unified approximation (analytical) methodology to calculate the throughput of the system using queueing networks together with decomposition, isolation and expansion techniques. The methodology is rigorously tested covering a large experimental region. Orthogonal arrays are used to design the experiments in order to keep the number of experiments manageable. The results obtained using the approximation methodology are compared to the simulation results. The ttests carried out to investigate the differences between the two results show that they are statistically insignificant. Finally, we test the methodology by applying it to several arbitrary topology networks. The results show that the performance of the approximation methodology is consistent, robust and produces excellent results in a variety of experimental conditions.  相似文献   
153.
双热源空调-热水器一体机冬季制热的实验研究   总被引:1,自引:0,他引:1  
冬季室外温度低时,空气源热泵系统的蒸发器会结霜,使系统COP降低。所设计的空调-热水器一体机可以制冷、制热、一年四季提供生活用热水。冬季室外温度低时,用太阳能加热后的水作为热泵的低温热源,可以提高热泵的效率。分别用空气源蒸发器和水源蒸发器独立工作使系统给房间制热,实验结果发现水源蒸发器工作时系统的COP平均值为3.56,空气源蒸发器工作时的COP平均值为2.51。  相似文献   
154.
蔡俊伟  胡寿松  陶洪峰 《物理学报》2007,56(12):6820-6827
提出了一种基于聚类的选择性支持向量机集成预测模型.为提高支持向量机集成的泛化能力,采用自组织映射和K均值聚类算法结合的聚类组合算法,从每簇中选择出精度最高的子支持向量机进行集成,可以保证子支持向量机有较高精度并提高了子支持向量机之间的差异度.该方法能以较小的代价显著提高支持向量机集成的泛化能力.采用该方法对Mackey-Glass混沌时间序列和Lorenz系统生成的混沌时间序列进行预测实验,结果表明可以对混沌时间序列进行准确预测,验证了该方法的有效性. 关键词: 支持向量机 集成 混沌时间序列 聚类  相似文献   
155.
One of the greatest challenges facing the cognitive sciences is to explain what it means to know a language, and how the knowledge of language is acquired. The dominant approach to this challenge within linguistics has been to seek an efficient characterization of the wealth of documented structural properties of language in terms of a compact generative grammar—ideally, the minimal necessary set of innate, universal, exception-less, highly abstract rules that jointly generate all and only the observed phenomena and are common to all human languages. We review developmental, behavioral, and computational evidence that seems to favor an alternative view of language, according to which linguistic structures are generated by a large, open set of constructions of varying degrees of abstraction and complexity, which embody both form and meaning and are acquired through socially situated experience in a given language community, by probabilistic learning algorithms that resemble those at work in other cognitive modalities.  相似文献   
156.
The term “cyborg” refers to a cybernetic organism, which characterizes the chimera of a living organism and a machine. Owing to the widespread application of intracorporeal medical devices, cyborgs are no longer exclusively a subject of science fiction novels, but technically they already exist in our society. In this review, we briefly summarize the development of modern prosthetics and the evolution of brain–machine interfaces, and discuss the latest technical developments of implantable devices, in particular, biocompatible integrated electronics and microfluidics used for communication and control of living organisms. Recent examples of animal cyborgs and their relevance to fundamental and applied biomedical research and bioethics in this novel and exciting field at the crossroads of chemistry, biomedicine, and the engineering sciences are presented.  相似文献   
157.
Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured a negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime.  相似文献   
158.
A misalignment fault is a kind of potential fault in double-fed wind turbines. The reasonable and effective fault prediction models are used to predict its development trend before serious faults occur, which can take measures to repair in advance and reduce human and material losses. In this paper, the Least Squares Support Vector Machine optimized by the Improved Artificial Fish Swarm Algorithm is used to predict the misalignment index of the experiment platform. The mixed features of time domain, frequency domain, and time-frequency domain indexes of vibration or stator current signals are the inputs of the Least Squares Support Vector Machine. The kurtosis of the same signals is the output of the model, and the 3σ principle of the normal distribution is adopted to set the warning line of misalignment fault. Compared with other optimization algorithms, the experimental results show that the proposed prediction model can predict the development trend of the misalignment index with the least prediction error.  相似文献   
159.
领域分类结构的抽取已成为本体工程和本体学习的关键部分,提出一种新的分类结构学习算法,将Web作为知识获取的语料库,运用迭代方法抽取相关语言学模式,再利用语言学模式抽取分类结构,并采用改进的互信息方法对结果进行评价和过滤,最后通过实验对该分类学习算法的性能进行评价.实验表明:算法具有良好的跨领域性,在准确率和召回率方面也有改善.  相似文献   
160.
In this paper, we address the problem of allocating the work elements, belonging to the products of a lot, to the stations of an assembly line so as to minimize the makespan. The lots that are processed on the assembly line are characterized by a low overall demand for each product. There is no buffer permitted in between the stations, and the line operates under learning. In particular, the stations’ learning slopes are assumed to be different. We present a procedure to determine the optimal assignments of the workload to the stations under learning variability and show that it considerably affects these assignments.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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