全文获取类型
收费全文 | 3185篇 |
免费 | 410篇 |
国内免费 | 132篇 |
专业分类
化学 | 272篇 |
力学 | 112篇 |
综合类 | 44篇 |
数学 | 1077篇 |
物理学 | 823篇 |
无线电 | 1399篇 |
出版年
2024年 | 12篇 |
2023年 | 56篇 |
2022年 | 66篇 |
2021年 | 76篇 |
2020年 | 96篇 |
2019年 | 95篇 |
2018年 | 89篇 |
2017年 | 125篇 |
2016年 | 118篇 |
2015年 | 109篇 |
2014年 | 190篇 |
2013年 | 213篇 |
2012年 | 209篇 |
2011年 | 191篇 |
2010年 | 166篇 |
2009年 | 188篇 |
2008年 | 192篇 |
2007年 | 190篇 |
2006年 | 184篇 |
2005年 | 168篇 |
2004年 | 136篇 |
2003年 | 124篇 |
2002年 | 106篇 |
2001年 | 86篇 |
2000年 | 105篇 |
1999年 | 62篇 |
1998年 | 39篇 |
1997年 | 57篇 |
1996年 | 38篇 |
1995年 | 39篇 |
1994年 | 32篇 |
1993年 | 22篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 15篇 |
1989年 | 18篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1982年 | 8篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有3727条查询结果,搜索用时 15 毫秒
1.
A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed. 相似文献
2.
为了减小传统的最差情况设计方法引入的电压裕量,提出了一种变化可知的自适应电压缩减(AVS)技术,通过调整电源电压来降低电路功耗.自适应电压缩减技术基于检测关键路径的延时变化,基于此设计了一款预错误原位延时检测电路,可以检测关键路径延时并输出预错误信号,进而控制单元可根据反馈回的预错误信号的个数调整系统电压.本芯片采用SMIC180 nm工艺设计验证,仿真分析表明,采用自适应电压缩减技术后,4个目标验证电路分别节省功耗12.4%,11.3%,10.4%和11.6%. 相似文献
3.
《Discrete Mathematics》2020,343(2):111679
A path in an edge-colored graph is called monochromatic if any two edges on the path have the same color. For , an edge-colored graph is said to be monochromatic -edge-connected if every two distinct vertices of are connected by at least edge-disjoint monochromatic paths, and is said to be uniformly monochromatic -edge-connected if every two distinct vertices are connected by at least edge-disjoint monochromatic paths such that all edges of these paths are colored with a same color. We use and to denote the maximum number of colors that ensures to be monochromatic -edge-connected and, respectively, to be uniformly monochromatic -edge-connected. In this paper, we first conjecture that for any -edge-connected graph , , where is a minimum -edge-connected spanning subgraph of . We verify the conjecture for . We also prove the conjecture for and with . When is a minimal -edge-connected graph, we give an upper bound of , i.e., . For the uniformly monochromatic -edge-connectivity, we prove that for all , , where is a minimum -edge-connected spanning subgraph of . 相似文献
4.
移动机器人路径规划方法研究 总被引:3,自引:0,他引:3
移动机器人技术研究中的一个重要领域是路径规划技术,它分为基于模型的环境已知的全局路径规划和基于传感器的环境未知的局部路径规划。综述了移动机器人路径规划技术的发展现状指出了各种方法的优点与不足,最后对移动机器人路径规划技术的发展趋势进行了展望。 相似文献
5.
Paul S. Wesson 《General Relativity and Gravitation》2003,35(1):111-119
Results from 5D induced-matter and membrane theory with null paths are extended to show that a particle obeys the 4D Klein-Gordon equation but with a variable mass. The Dirac equation also follows, but raises concerns about 4D quantization in the two natural 5D gauges, and reopens the question of a Regge-like trajectory for the spin angular momenta and squared masses of gravitationally-dominated systems. 相似文献
6.
首先介绍了给图像周围加上美丽艺术花纹的方式,其次介绍了给图像周围加上美丽的像框的方式,这两种方式都能对图像周边加以修饰,其中使用了通道法,渐变法和路径法等等。读者还可以上面介绍的方法为启迪,充分发挥个人的想象力,创作出各种各样的、多姿多彩的图像边框。 相似文献
7.
Resilient optical networks are predominately designed to protect against single failures of fiber links. But in larger networks, operators also see dual failures. As the capacity was planned for single failures, disconnections can occur by dual failures even if enough topological connectivity is provided. In our approach the design of the network minimizes the average loss caused by dual failures, while single failures are still fully survived. High dual failure restorability is the primary aim, capacity is optimized in a second step. For WDM networks with full wavelength conversion, we formulate mixed integer linear programming models for dedicated path protection, shared (backup) path protection, and path rerouting with and without stub-release. For larger problem instances in path rerouting, we propose two heuristics. Computational results indicate that the connectivity is of much more importance for high restorability values than the overall protection capacity. Shared protection has similar restorability levels as dedicated protection while the capacity is comparable to rerouting. Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability. Compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning. 相似文献
8.
Regis Guyonnet 《Journal of statistical physics》1991,65(1-2):269-289
The NMR properties of nuclei linked to long linear polymer molecules are sensitive to the influence of hard walls. In this context, the residual energy of tensorial spin-spin interactions is calculated using a path integral approach. Several thermodynamic quantities of the polymer system (free energy, equation of state,...) are also expressed, taking chain stiffness effects and the presence of two repulsive walls into consideration. 相似文献
9.
10.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献