全文获取类型
收费全文 | 2018篇 |
免费 | 346篇 |
国内免费 | 122篇 |
专业分类
化学 | 230篇 |
晶体学 | 23篇 |
力学 | 220篇 |
综合类 | 60篇 |
数学 | 1034篇 |
物理学 | 919篇 |
出版年
2024年 | 2篇 |
2023年 | 28篇 |
2022年 | 58篇 |
2021年 | 55篇 |
2020年 | 63篇 |
2019年 | 67篇 |
2018年 | 81篇 |
2017年 | 96篇 |
2016年 | 76篇 |
2015年 | 47篇 |
2014年 | 100篇 |
2013年 | 165篇 |
2012年 | 104篇 |
2011年 | 131篇 |
2010年 | 110篇 |
2009年 | 142篇 |
2008年 | 140篇 |
2007年 | 122篇 |
2006年 | 107篇 |
2005年 | 110篇 |
2004年 | 92篇 |
2003年 | 77篇 |
2002年 | 84篇 |
2001年 | 62篇 |
2000年 | 57篇 |
1999年 | 52篇 |
1998年 | 50篇 |
1997年 | 44篇 |
1996年 | 28篇 |
1995年 | 32篇 |
1994年 | 16篇 |
1993年 | 16篇 |
1992年 | 10篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1976年 | 1篇 |
排序方式: 共有2486条查询结果,搜索用时 140 毫秒
41.
Given a connected undirected graph G, the Degree Preserving Spanning Tree Problem (DPSTP) consists in finding a spanning tree T of G that maximizes the number of vertices that have the same degree in T and in G. In this paper, we introduce Integer Programming formulations, valid inequalities and a Branch-and-cut algorithm for the DPSTP. Reinforced with new valid inequalities, the upper bounds provided by the formulation behind our Branch-and-cut method dominate previous DPSTP bounds in the literature. 相似文献
42.
In this paper interfacial edge crack problems are considered by the application of the finite element method. The stress intensity factors are accurately determined from the ratio of crack-tip-stress value between the target given unknown and reference problems. The reference problem is chosen to produce the singular stress fields proportional to those of the given unknown problem. Here the original proportional method is improved through utilizing very refined meshes and post-processing technique of linear extrapolation. The results for a double-edge interface crack in a bonded strip are newly obtained and compared with those of a single-edge interface crack for different forms of combination of material. It is found that the stress intensity factors should be compared in the three different zones of relative crack lengths. Different from the case of a cracked homogeneous strip, the results for the double edge interface cracks are found to possibly be bigger than those for a single edge interface crack under the same relative crack length. 相似文献
43.
We present an accurate and fast wave tracking method that uses parametric representations of tracked fronts, combined with modifications of level set methods that use narrow bands. Our strategy generates accurate computations of the front curvature and other geometric properties of the front. We introduce data structures that can store discrete representations of the location of the moving fronts and boundaries, as well as the corresponding level set fields, that are designed to reduce computational overhead and memory storage. We present an algorithm we call stack sweeping to efficiently sort and store data that is used to represent orientable fronts. Our implementation features two reciprocal procedures, a forward ‘front parameterization’ that constructs a parameterization of a front given a level set field and a backward ‘field construction’ that constructs an approximation of the signed normal distance to the front, given a parameterized representation of the front. These reciprocal procedures are used to achieve and maintain high spatial accuracy. Close to the front, precise computation of the normal distance is carried out by requiring that displacement vectors from grid points to the front be along a normal direction. For front curves in two dimensions, a cubic interpolation scheme is used, and G 1 surface parameterization based on triangular patches is used for the three-dimensional implementation to compute the distances from grid points near the front. To demonstrate this new, high accuracy method we present validations and show examples of combustion-like applications that include detonation shock dynamics, material interface motions in a compressible multi-material simulation and the Stephan problem associated with dendrite solidification. 相似文献
44.
45.
Maria De Fenza Anna Esposito Daniele DAlonzo Annalisa Guaragna 《Molecules (Basel, Switzerland)》2021,26(6)
The de novo synthesis of piperidine nucleosides from our homologating agent 5,6-dihydro-1,4-dithiin is herein reported. The structure and conformation of nucleosides were conceived to faithfully resemble the well-known nucleoside drugs Immucillins H and A in their bioactive conformation. NMR analysis of the synthesized compounds confirmed that they adopt an iminosugar conformation bearing the nucleobases and the hydroxyl groups in the appropriate orientation. 相似文献
46.
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. 相似文献
47.
Malek Taher Maghsoodlou Nourollah Hazeri Sayyed Mostafa Habibi Khorasani Aqil Ghulame Shahzadeh Mahmoud Nassiri 《Phosphorus, sulfur, and silicon and the related elements》2013,188(4):913-919
Stable crystalline phosphorus ylides were obtained in excellent yields from the 1:1:1 addition reaction between triphenylphosphine and dialkyl acetylenedicarboxylates in the presence of strong NH acids, such as indole and 2-methyl indole, 3-methyl indole, and 5-boromo indole. These stable ylides exist in a solution as a mixture of two geometrical isomers as a result of the restricted rotation around the carbon–carbon partial double bond resulting from the conjugation of the ylide moiety with the adjacent carbonyl group. 相似文献
48.
Douglas R. Woodall 《Journal of Graph Theory》2019,92(4):488-490
In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree is at least if , at least if , and at least if . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if and , respectively. 相似文献
49.
Ariane Carrance 《Random Structures and Algorithms》2019,55(3):615-648
We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞. 相似文献
50.
Nursel Erey 《代数通讯》2018,46(9):4007-4020
We show that if G is a gap-free and diamond-free graph, then I(G)s has a linear minimal free resolution for every s≥2. 相似文献