首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1903篇
  免费   1篇
  国内免费   34篇
系统科学   265篇
丛书文集   2篇
教育与普及   52篇
理论与方法论   12篇
现状及发展   20篇
综合类   1587篇
  2024年   1篇
  2023年   1篇
  2019年   2篇
  2018年   1篇
  2017年   1篇
  2016年   1篇
  2015年   1篇
  2014年   3篇
  2013年   3篇
  2012年   3篇
  2011年   211篇
  2010年   52篇
  2009年   184篇
  2008年   35篇
  2007年   90篇
  2006年   28篇
  2005年   31篇
  2004年   233篇
  2003年   236篇
  2002年   150篇
  2001年   93篇
  2000年   22篇
  1999年   24篇
  1998年   83篇
  1997年   110篇
  1996年   16篇
  1995年   6篇
  1994年   38篇
  1993年   105篇
  1992年   95篇
  1991年   59篇
  1990年   2篇
  1989年   4篇
  1988年   13篇
  1986年   1篇
排序方式: 共有1938条查询结果,搜索用时 15 毫秒
21.
In this paper, we propose a dimension-reducing, K-mean clustering procedureby Projection Pursuit (PP) technique so as to explore the clustering structure of data inhigh-dimensional space in terms of low-dimensional projective points of data, and we obtainthe a.s. consistence of the estimates of the cluster centers and projection orientations.  相似文献   
22.
We develop the interpolated finite element method to solve second-order hy-perbolic equations. The standard linear finite element solution is used to generate a newsolution by quadratic interpolation over adjacent elements. We prove that this interpo-lated finite element solution has superconvergence. This method can easily be applied togenerating more accurate gradient either locally or globally, depending on the applications.This method is also completely vectorizable and parallelizable to take the advantages ofmodern computer structures. Several numerical examples are presented to confirm ourtheoretical analysis.  相似文献   
23.
介绍刚性的本质,综述刚性算法、间断处理、实时算法、微分代数问题、稳定性、并行算法的一些结果,给出在这个领域的进一步研究的建议。  相似文献   
24.
一类微分代数系统并行仿真算法   总被引:1,自引:0,他引:1  
利用对误差的预校正技术,本文提出一类微分代数系统的并行仿真算法,进行仿真误差估计。对于一个模型问题进行稳定性分析,画出稳定区域。计算实例表明算法是有效的。  相似文献   
25.
终止规则在优化算法中起着十分重要的作用。本文首先对采用传统终止规则的优化算法在处理DEDS优化问题时遇到的问题进行分析,在此基础上针对DEDS优化问题及其算法的特点提出一个新的终止规则,文章最后通过实际例子对终止规则进行了仿真分析。  相似文献   
26.
This paper introduces the conception of open complex giant system and the methodology for dealing with the system, with stress on its profound significance in development of science and technology. The authors conclude that the reductionism underlying the exact science is not suitable to open complex giant system, and the only feasible alternative is the meta-synthetic engineering from the qualitative to the quantitative.  相似文献   
27.
This paper presents the principle of electromagnetic missile from the mathematical point of view, and verifies rigorously that the radiating power over whole space is limited.  相似文献   
28.
Fuzzy technology is a newly developed discipline based on fuzzy mathematics. In the recent years, it has been successfully applied into many areas, such as process control, diagnosis,evaluation, decision making and scheduling, especially in simulation where accurate mathematical models can not or very hard be established. In this paper, to meet the demands of fuzzy simulation, two fuzzy nets will first be presented, which are quite suitable for modeling the parallel or concurrent systems with fuzzy behavior. Then, a concept of active simulation will be introduced, in which the simulation model not only can show its fuzzy behavior, but also has a certain ability which can actively perform many very useful actions, such as automatic warning, realtime monitoring, simulation re-sult checking, simulation model self-adapting, error recovery, simulating path tracing, system states inspecting and exception handling, by a unified approach while some specified events occur. The simulation model described by this  相似文献   
29.
Let G be a graph of order n. We define the distance between two vertices u andv in G, denoted by d(u, v), as the minimum value of the lengths of all u-v paths. We writeσ_k(G)=min{∑_i=1~k d(v_i)|{v_1, v_2,…, v_k} is an independent set in G} and NC2(G)=min {|N(u)∪N(v)| | d(u, v)=2}. We denote by ω(G) the number of components of agraph G. A graph G is called 1-tough if ω(G\S)≤|S| for every subset S of V(G) withω(G\S)>l. By c(G) we denote the length of the longest cycle in G; in particular, G iscalled a Hamiltonian graph if c(G)=n. H.A. Jung proved that every 1-tough graphwith order n≥11 and σ2≥n-4 is Hamiltonian. We generalize it further as follows: ifG is a 1-tough graph and σ3(G)≥n, then c(G)≥min {n,2NC2(G)+4}. Thus, theconjecture of D. Bauer, G. Fan and H.J. Veldman in [2] is completely solved.  相似文献   
30.
液体爆炸分散过程中界面破碎的实验研究   总被引:4,自引:0,他引:4  
设计了一种有上下平面约束的液体爆炸分散装置, 通过阴影照相获得气液界面破碎形态变化的时间序列, 并应用平面激光诱导荧光(PLIF)得到了径向膨胀液体环内诱导的荧光照片. 采用二维图像处理、分形几何和数值模拟相结合的方法, 较系统地分析了实验结果. 最后, 讨论了液体环及其气液界面运动数学模型建立中的问题.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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