全文获取类型
收费全文 | 5710篇 |
免费 | 444篇 |
国内免费 | 296篇 |
专业分类
化学 | 271篇 |
晶体学 | 21篇 |
力学 | 217篇 |
综合类 | 61篇 |
数学 | 906篇 |
物理学 | 2098篇 |
综合类 | 2876篇 |
出版年
2024年 | 21篇 |
2023年 | 53篇 |
2022年 | 129篇 |
2021年 | 132篇 |
2020年 | 115篇 |
2019年 | 120篇 |
2018年 | 106篇 |
2017年 | 240篇 |
2016年 | 221篇 |
2015年 | 214篇 |
2014年 | 522篇 |
2013年 | 361篇 |
2012年 | 293篇 |
2011年 | 381篇 |
2010年 | 312篇 |
2009年 | 342篇 |
2008年 | 337篇 |
2007年 | 390篇 |
2006年 | 320篇 |
2005年 | 275篇 |
2004年 | 226篇 |
2003年 | 199篇 |
2002年 | 162篇 |
2001年 | 149篇 |
2000年 | 110篇 |
1999年 | 93篇 |
1998年 | 118篇 |
1997年 | 91篇 |
1996年 | 69篇 |
1995年 | 54篇 |
1994年 | 39篇 |
1993年 | 39篇 |
1992年 | 41篇 |
1991年 | 26篇 |
1990年 | 42篇 |
1989年 | 28篇 |
1988年 | 35篇 |
1987年 | 14篇 |
1986年 | 5篇 |
1985年 | 5篇 |
1984年 | 14篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 3篇 |
排序方式: 共有6450条查询结果,搜索用时 0 毫秒
11.
使用BXP无盘网络改造计算机实验室 总被引:1,自引:0,他引:1
计算机实验室一般采用带有保护卡的有盘系统,该模式下,计算机故障率高且可维护性差。该文以BXP技术为对象,介绍在无盘网络模式下,计算机实验室彻底克服了有盘系统的缺点。 相似文献
12.
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog2n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m3logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found. 相似文献
13.
We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m2+loglogσ)logσ) in the best case and O((m2+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force. 相似文献
14.
15.
单循环赛赛程安排的一个图论方法 总被引:2,自引:0,他引:2
唐保祥 《数学的实践与认识》2004,34(5):120-125
利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案 相似文献
16.
一种高性能数字显微图像分析系统 总被引:1,自引:0,他引:1
给出了基于Windows操作系统的24位真彩色通用的高性能显微图像检测与分析软件系统,它采用先进的图像处理和形态分析算法,能对各种显微图像进行处理、分析和检测;并具有友好的操作界面、性能稳定等特点,可为材料、冶金、医药、生物、化工等相关领域的用户提供便捷的显微图像分析及处理测量工具。 相似文献
17.
An exact method based on Green's equation is used to find the diffusion-controlled faradaic current for certain electrode geometries that incorporate edges and vertices. Thereby the magnitudes of the time-independent current density associated with angled electrode/electrode and electrode/insulator junctions are calculated. As well, the square-root-of-time-dependent currents associated with vertices, receive attention. These terms extend to longer times, the Cottrell formulation appropriate for short times. Though most of the problems solved here have been tackled previously, the novel Green function approach is shown to be straightforward and intuitive. 相似文献
18.
19.
介绍了高校研究生论文答辩系统的核心算法,并给出了一种处理冲突的方法——专家相关回溯法。 相似文献
20.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献