全文获取类型
收费全文 | 1389篇 |
免费 | 112篇 |
国内免费 | 93篇 |
专业分类
化学 | 30篇 |
力学 | 66篇 |
综合类 | 22篇 |
数学 | 841篇 |
物理学 | 137篇 |
无线电 | 498篇 |
出版年
2024年 | 5篇 |
2023年 | 27篇 |
2022年 | 26篇 |
2021年 | 19篇 |
2020年 | 36篇 |
2019年 | 36篇 |
2018年 | 29篇 |
2017年 | 42篇 |
2016年 | 36篇 |
2015年 | 32篇 |
2014年 | 63篇 |
2013年 | 109篇 |
2012年 | 71篇 |
2011年 | 89篇 |
2010年 | 85篇 |
2009年 | 83篇 |
2008年 | 89篇 |
2007年 | 102篇 |
2006年 | 93篇 |
2005年 | 70篇 |
2004年 | 51篇 |
2003年 | 56篇 |
2002年 | 49篇 |
2001年 | 49篇 |
2000年 | 46篇 |
1999年 | 40篇 |
1998年 | 20篇 |
1997年 | 21篇 |
1996年 | 14篇 |
1995年 | 16篇 |
1994年 | 13篇 |
1993年 | 10篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 5篇 |
排序方式: 共有1594条查询结果,搜索用时 15 毫秒
21.
22.
23.
A star edge coloring of a graph is a proper edge coloring such that every connected 2-colored subgraph is a path with at most 3 edges. Deng et al. and Bezegová et al. independently show that the star chromatic index of a tree with maximum degree is at most , which is tight. In this paper, we study the list star edge coloring of -degenerate graphs. Let be the list star chromatic index of : the minimum such that for every -list assignment for the edges, has a star edge coloring from . By introducing a stronger coloring, we show with a very concise proof that the upper bound on the star chromatic index of trees also holds for list star chromatic index of trees, i.e. for any tree with maximum degree . And then by applying some orientation technique we present two upper bounds for list star chromatic index of -degenerate graphs. 相似文献
24.
Let be a connected graph with edges. An antimagic labeling of is a one-to-one mapping from to such that the vertex sum (i.e., sum of the labels assigned to edges incident to a vertex) for distinct vertices are different. A graph is called antimagic if has an antimagic labeling. It was conjectured by Hartsfield and Ringel that every tree other than is antimagic. The conjecture remains open though it was verified for trees with some constrains. Caterpillars are an important subclass of trees. This paper shows caterpillars with maximum degree 3 are antimagic, which gives an affirmative answer to an open problem of Lozano et al. (2019). 相似文献
25.
《Discrete Mathematics》2019,342(6):1564-1576
26.
27.
28.
The power supply for IEF based on features of the Cockcroft‐Walton voltage multiplier (CW VM) is described in this work. The article describes a design of the IEF power supply, its electric characteristics, and testing by IEF analysis. A circuit diagram of the power supply included two opposite charged branches (each consisting of four voltage doublers). The designed CW VM was powered by 230 V/50 Hz alternate current and it generated up to 5 kV and 90 mW at the output. Voltage and current characteristics of the power supply were measured by known load resistances in the range from 10 kΩ to 1 GΩ, which is a common resistance range for IEF strip geometry. Further, the power supply was tested by a separation of a model mixture of colored pI markers using a 175 × 3 × 0.5 mm focusing bed. Automatically limited power load enabled analysis of samples without previous optimization of the focusing voltage or electric current time courses according to sample composition. Moreover, the developed power supply did not produce any intrinsic heat and was easy to set up with cheap and commonly available parts. 相似文献
29.
马昌凤 《高校应用数学学报(A辑)》2006,21(3):349-356
针对二阶椭圆型单障碍问题提出了一类基于非匹配网格的Lagrang ian乘子非重叠型区域分解方法.并在适当条件下给出了该方法的收敛性分析和收敛速度估计. 相似文献
30.
本文研究了基于拟相对内部的非凸集值优化问题弱有效元的最优性条件.首先,讨论了弱有效元与线性子空间之间的关系,利用涉及拟相对内部的凸集分离定理,获得了弱有效元的最优性条件.其次,给出了基于拟相对内部弱有效元的Lagrange乘子定理. 相似文献