全文获取类型
收费全文 | 5427篇 |
免费 | 620篇 |
专业分类
系统科学 | 1076篇 |
理论与方法论 | 275篇 |
现状及发展 | 868篇 |
研究方法 | 1篇 |
综合类 | 3827篇 |
出版年
2022年 | 2篇 |
2021年 | 1篇 |
2018年 | 727篇 |
2017年 | 732篇 |
2016年 | 430篇 |
2015年 | 31篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 256篇 |
2011年 | 951篇 |
2010年 | 814篇 |
2009年 | 454篇 |
2008年 | 507篇 |
2007年 | 762篇 |
2006年 | 2篇 |
2005年 | 41篇 |
2004年 | 121篇 |
2003年 | 149篇 |
2002年 | 55篇 |
2000年 | 1篇 |
1994年 | 2篇 |
1991年 | 3篇 |
1967年 | 1篇 |
排序方式: 共有6047条查询结果,搜索用时 31 毫秒
691.
This review presents the scintillators requirements for the medical imaging modalities. The history and the development in
recent years of the medical scintillators (mainly for GSO:Ce, LSO:Ce, LuAP:Ce) are expatiated in detail. 相似文献
692.
Weiping BI 《系统科学与复杂性》2007,20(4):545-553
This paper studies the robust H∞ disturbance attenuation with internal stability for uncertain nonlinear control systems. By adding one power integrator technique, this paper designs a explicit smooth robust dynamic feedback law while rejecting the disturbance to any specified degree of accuracy. Further, the example and simulation results show the effectiveness of the proposed schemes. 相似文献
693.
The distribution function of the hyperbranched polymers formed from the self-condensing vinyl polymerization with unequal reactivities was derived and the differential equations for the second moments are established, based on the variable of the conversion of B^* groups. The various average degrees of branching can be designed by suitable values of reactivities ratio (r) and the conversion of A group (x). In order to reach the maximum degree of branching at a specified x, r needed is dependant on the value of x. The higher the x, the less the r needed is for the maximum value of degree of branching. At the end of the reaction, the maximum degree of branching reaches 0.5 with r=2.59. 相似文献
694.
695.
Probabilistic D-Clustering 总被引:1,自引:1,他引:0
We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of
data points from these centers, the probability of cluster membership at any point is assumed inversely proportional to the
distance from (the center of) the cluster in question. This assumption is our working principle.
The method is a generalization, to several centers, of theWeiszfeld method for solving the Fermat–Weber location problem.
At each iteration, the distances (Euclidean, Mahalanobis, etc.) from the cluster centers are computed for all data points,
and the centers are updated as convex combinations of these points, with weights determined by the above principle. Computations
stop when the centers stop moving. 相似文献
696.
Number crunching vs. number theory: computers and FLT,from Kummer to SWAC (1850–1960), and beyond 总被引:1,自引:1,他引:0
Leo Corry 《Archive for History of Exact Sciences》2008,62(4):393-455
The present article discusses the computational tools (both conceptual and material) used in various attempts to deal with
individual cases of FLT, as well as the changing historical contexts in which these tools were developed and used, and affected
research. It also explores the changing conceptions about the role of computations within the overall disciplinary picture
of number theory, how they influenced research on the theorem, and the kinds of general insights thus achieved. After an overview
of Kummer’s contributions and its immediate influence, I present work that favored intensive computations of particular cases
of FLT as a legitimate, fruitful, and worth-pursuing number-theoretical endeavor, and that were part of a coherent and active,
but essentially low-profile tradition within nineteenth century number theory. This work was related to table making activity
that was encouraged by institutions and individuals whose motivations came mainly from applied mathematics, astronomy, and
engineering, and seldom from number theory proper. A main section of the article is devoted to the fruitful collaboration
between Harry S. Vandiver and Emma and Dick Lehmer. I show how their early work led to the hesitant introduction of electronic
computers for research related with FLT. Their joint work became a milestone for computer-assisted activity in number theory
at large. 相似文献
697.
Thomas L. SAATY 《系统科学与系统工程学报(英文版)》2004,13(4):385-404
1. Introduction This is the fourth exposition on theAnalytic Hierarchy Process. It is true thatmany decisions we make subconsciously ariseout of our physical and biological needs andderive from the pressure to survive physically.We also make subconsciou… 相似文献
698.
Jingyuan YU Xiaoji ZHOU Shan FENG Beijing Institute of Information Control P.O. Box Beijing Chian Huazhong University of Science Technology 《系统科学与系统工程学报(英文版)》2005,14(4):462-475
1 Introduction Science of complexity and complex systems is a relatively new area In wide fields from chemistry, biology, environment, geo-science, climatology to economics and sociology, complexity has been studied from diverse views and understandings Systems science, which could be traced back to Ludwig von Bertalanffy’foundational work on general system theory, plays an active role in complexity studies From system perspectives, relevant concepts often include interaction, feedback, evol… 相似文献
699.
QIU Yong HU Yuanchuan Dong Guifang WANG Liduo Xie Junfeng & MA Yaning Organic Optoelectronic Laboratory Department of Chemistry Tsinghua University Beijing China 《科学通报(英文版)》2003,48(15):1554-1557
Much attention has been attracted to organic thin-film field-effect transistors (OTFFETs) in the past decades[1—4]. Because of their lower cost and easier preparation, OTFFETs are considered to be useful in driving liquid crystal displays (LCD) and organic light-emitting diodes (OLED). Furthermore, flexible OTFFETs will be one of the most useful electronic devices for flexible active matrix driving circuits. OTFFETs based on pentacene single crystal have been reported to be of g… 相似文献
700.
Yigal GERCHAK 《系统科学与系统工程学报(英文版)》2004,13(1):36-44
We consider tasks where in order to perform them it is sufficient that one member of a group will know how to do it. We are interested in the effect of task difficulty, and variability of that difficulty, on group performance, and in particular on the marginal contribution of an additional number to the performance of groups of different size. We explore the implications of various stochastic orders over task difficulty and variability. Some intuitive conjectures are shown to be false. 相似文献