全文获取类型
收费全文 | 31650篇 |
免费 | 3114篇 |
国内免费 | 2229篇 |
专业分类
化学 | 1590篇 |
晶体学 | 122篇 |
力学 | 1457篇 |
综合类 | 438篇 |
数学 | 6416篇 |
物理学 | 4422篇 |
综合类 | 22548篇 |
出版年
2024年 | 154篇 |
2023年 | 356篇 |
2022年 | 689篇 |
2021年 | 829篇 |
2020年 | 707篇 |
2019年 | 691篇 |
2018年 | 716篇 |
2017年 | 961篇 |
2016年 | 1063篇 |
2015年 | 1061篇 |
2014年 | 1662篇 |
2013年 | 1718篇 |
2012年 | 1902篇 |
2011年 | 2014篇 |
2010年 | 1538篇 |
2009年 | 1892篇 |
2008年 | 1945篇 |
2007年 | 2449篇 |
2006年 | 2213篇 |
2005年 | 1830篇 |
2004年 | 1641篇 |
2003年 | 1359篇 |
2002年 | 1214篇 |
2001年 | 1023篇 |
2000年 | 866篇 |
1999年 | 751篇 |
1998年 | 663篇 |
1997年 | 574篇 |
1996年 | 457篇 |
1995年 | 376篇 |
1994年 | 294篇 |
1993年 | 266篇 |
1992年 | 227篇 |
1991年 | 163篇 |
1990年 | 174篇 |
1989年 | 122篇 |
1988年 | 117篇 |
1987年 | 83篇 |
1986年 | 52篇 |
1985年 | 50篇 |
1984年 | 33篇 |
1983年 | 10篇 |
1982年 | 23篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1959年 | 7篇 |
1955年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
52.
Deborah M. Greaves 《国际流体数值方法杂志》2006,50(6):693-711
An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
53.
束晕-混沌的复杂性理论与控制方法及其应用前景 总被引:18,自引:0,他引:18
本文系统论述涉及强流加速器等强流离子束装置中产生的束晕-混沌的复杂性理论与控制方法及其应用前景。强流离子束在核材料生产与增殖、洁净核能、放射性废物嬗变、放射性药物生产、重离子聚变、高能物理、核科学与工程、国防与民用工业和医疗等许多方面都有极其重要的应用潜力和诱人的发展前景。尤其是,近年来强流加速器驱动的放射性洁净核能系统是国内外关注的热门课题,因为它比常规核电更安全、更干净、更便宜。但是,强流离子束形成的束晕-混沌的复杂性现象已引起了国内外广泛关注,需要加以抑制、控制和消除这类现象,解决这一难题已经成为强流离子束应用中的关键问题之一。目前不仅必须深入研究这类束晕-混沌的复杂特性及其产生的物理机制,而且需要研究如何实现对束晕-混沌的有效控制,并寻求和发展其新理论、新方法和新技术。这就向强流离子束物理和非线性-复杂性科学及其技术提出了一系列极富挑战性的新课题。本文结合国内外的研究概况,根据我们多年来的研究成果,特别是我们首创性地提出了一些束晕-混沌的有效控制方法,它们包括:非线性反馈控制法,小波反馈控制法,变结构控制法,延迟反馈控制法,参数自适应控制法等,进行重点的介绍。对上述课题当前的主要进展及相关问题进行系统的总结和比较全面综述的评论。最后,指出该领域今后的研究方向,以推动这个崭新领域的深入研究和应用发展。 相似文献
54.
骆雪梅 《光谱学与光谱分析》2003,23(1):178-181
量子计算机是一种以量子耦合方式进行信息处理的装置[1 ] 。原则上 ,它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2 ] 。建造大型量子计算机的主要困难是噪音、去耦和制造工艺。一方面 ,虽然离子陷阱和光学腔实验方法大有希望 ,但这些方法都还没有成功实现过量子计算。另一方面 ,因为隔离于自然环境 ,核自旋可以成为很好的“量子比特” ,可能以非传统方式使用核磁共振 (NMR)技术实现量子计算。本文介绍一种用NMR方法实现量子计算的方法 ,该方法能够用比传统方法少的步骤解决一个纯数学问题。基于该方法的简单量子计算机使用比传统计算机使用更少的函数“调用”判断一未知函数的类别。 相似文献
55.
56.
给出了多种交叉方式遗传算法的模式定理及相关的证明.该定理避免了遗传算法模式理论的不足,使模式理论更加准确、严格. 相似文献
57.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
58.
分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题.基于断点图的概念,给出一个时间复杂性为O(max{b^(π),nb(π)}),空间复杂性为0(n)的求其近似最优解的算法.其中n为基因组中基因个数,π=(π1,π2,…,πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据实验的结果表明,该近似算法可以求得较好的结果. 相似文献
59.
On effectiveness of wiretap programs in mapping social networks 总被引:1,自引:0,他引:1
Maksim Tsvetovat Kathleen M. Carley 《Computational & Mathematical Organization Theory》2007,13(1):63-87
Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost.
Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on
Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php 相似文献
60.
序列模式挖掘是数据挖掘的重要分支,GSP算法与PSP算法是序列模式挖掘中的两种典型算法。本文介绍了这两种算法并对其进行了分析与比较。 相似文献