全文获取类型
收费全文 | 69篇 |
免费 | 5篇 |
国内免费 | 1篇 |
专业分类
化学 | 2篇 |
力学 | 37篇 |
综合类 | 2篇 |
数学 | 15篇 |
物理学 | 19篇 |
出版年
2023年 | 2篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 4篇 |
2014年 | 2篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 2篇 |
2010年 | 4篇 |
2009年 | 6篇 |
2008年 | 4篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 2篇 |
1999年 | 2篇 |
1997年 | 2篇 |
1995年 | 5篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有75条查询结果,搜索用时 15 毫秒
1.
N.P. Somasiri W.K. Toh X. Chen I.D. Robertson A.A. Rezazadeh 《International Journal of Infrared and Millimeter Waves》2002,23(12):1777-1785
This paper describes numerical modelling of a dual band multi-layered microstrip patch antenna operating at 35GHz on an in-house semi-insulating GaAs substrate. The simulated and measured resonant frequencies at both lower and upper resonant frequencies will be compared to check the accuracy of the different numerical modelling techniques. 相似文献
2.
浙江磐安尖山地区旅游资源丰富,有待开发的旅游资源主要包括火山岩峡谷、多级瀑潭组合、高山飞瀑、皇城湖、破火山口、玄武岩台地、生态旅游资源,工业旅游资源、人文史迹和宗教寺庙等10个方面。可划分成皇城湖、夹溪、胡宅和鞍顶山4个景区,尖山地区的旅游资源要统筹规划,全方位、高标准开发,提高科学文化品位,并且纳入周边大旅游圈中。 相似文献
3.
Guillermo Durán Min Chih Lin Sergio Mera Jayme L. Szwarcfiter 《Annals of Operations Research》2008,157(1):37-45
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. It is NP-hard to determine the minimum cardinality τ
c
of a clique-transversal of G. In this work, first we propose an algorithm for determining this parameter for a general graph, which runs in polynomial
time, for fixed τ
c
. This algorithm is employed for finding the minimum cardinality clique-transversal of
[`(3K2)]\overline{3K_{2}}
-free circular-arc graphs in O(n
4) time. Further we describe an algorithm for determining τ
c
of a Helly circular-arc graph in O(n) time. This represents an improvement over an existing algorithm by Guruswami and Pandu Rangan which requires O(n
2) time. Finally, the last proposed algorithm is modified, so as to solve the weighted version of the corresponding problem,
in O(n
2) time. 相似文献
4.
5.
基于冷轧成型工艺,采用不同的轧制道次制备Al/Ni多层复合材料。开展了Al/Ni多层复合材料准静态压缩和准密闭二次撞击反应实验,对它的力学性能和冲击释能特性进行测试。同时,通过扫描电镜得到了材料的细观结构特性,分析了Al/Ni多层复合材料细观特性对宏观力/化学行为的影响机制。结果表明,基于冷轧技术制备的Al/Ni多层复合材料比粉末压制而成的Al/Ni复合材料塑性更强,材料的抗压强度总体随冷轧次数的增加呈上升趋势。另外,冷轧3~5道次的Al/Ni多层复合材料的准密闭二次撞击反应实验表明,材料在相同的撞击速度(800~1 500 m/s)下释放的化学能随着轧制道次的增加而逐渐降低。 相似文献
6.
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v∈V(G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively. 相似文献
7.
8.
Guillermo Durán Min Chih Lin Sergio Mera Jayme Luiz Szwarcfiter 《Discrete Applied Mathematics》2006,154(13):1783-1790
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose polynomial time algorithms for finding the maximum cardinality and weight of a clique-independent set of a -free CA graph. Also, we apply the algorithms to the special case of an HCA graph. The complexity of the proposed algorithm for the cardinality problem in HCA graphs is O(n). This represents an improvement over the existing algorithm by Guruswami and Pandu Rangan, whose complexity is O(n2). These algorithms suppose that an HCA model of the graph is given. 相似文献
9.
A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path missed by the remaining two vertices. This is akin to the notion of asteroidal triple used in the classical characterization of interval graphs by Lekkerkerker and Boland [Klee, V., What are the intersection graphs of arcs in a circle?, American Mathematical Monthly 76 (1976), pp. 810–813.].In this note, we first observe that blocking quadruples are obstructions for circular-arc graphs. We then focus on chordal graphs, and study the relationship between the structure of chordal graphs and the presence/absence of blocking quadruples.Our contribution is two-fold. Firstly, we provide a forbidden induced subgraph characterization of chordal graphs without blocking quadruples. In particular, we observe that all the forbidden subgraphs are variants of the subgraphs forbidden for interval graphs [Klee, V., What are the intersection graphs of arcs in a circle?, American Mathematical Monthly 76 (1976), pp. 810–813.]. Secondly, we show that the absence of blocking quadruples is sufficient to guarantee that a chordal graph with no independent set of size five is a circular-arc graph. In our proof we use a novel geometric approach, constructing a circular-arc representation by traversing around a carefully chosen clique tree. 相似文献
10.
I.IntroductionItisofgreattheoreticalandpracticalimportancetostudytheproblemofscatteringofSH-wavesonsemi-canyontopographyofarbitraryshapewithlining.Especiallyinengineeringpractice,itisofgrePthelptotechnicians'analysisanddesignoftheanti-seismicstructureoftu… 相似文献