全文获取类型
收费全文 | 745篇 |
免费 | 25篇 |
国内免费 | 2篇 |
专业分类
化学 | 545篇 |
晶体学 | 2篇 |
力学 | 7篇 |
数学 | 185篇 |
物理学 | 33篇 |
出版年
2023年 | 6篇 |
2022年 | 8篇 |
2021年 | 15篇 |
2020年 | 15篇 |
2019年 | 15篇 |
2018年 | 15篇 |
2017年 | 12篇 |
2016年 | 18篇 |
2015年 | 36篇 |
2014年 | 28篇 |
2013年 | 41篇 |
2012年 | 34篇 |
2011年 | 36篇 |
2010年 | 43篇 |
2009年 | 35篇 |
2008年 | 41篇 |
2007年 | 33篇 |
2006年 | 34篇 |
2005年 | 35篇 |
2004年 | 24篇 |
2003年 | 19篇 |
2002年 | 20篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 13篇 |
1997年 | 5篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1968年 | 4篇 |
1927年 | 3篇 |
1926年 | 2篇 |
排序方式: 共有772条查询结果,搜索用时 250 毫秒
1.
Julien Ferrari Christian Terreaux Tibor Kurtn Attila Szikszai‐Kiss Sndor Antus JeromeD. Msonthi Kurt Hostettmann 《Helvetica chimica acta》2003,86(8):2768-2778
Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3. 相似文献
2.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
3.
We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour
hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check
the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization
problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and
the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located
by the new technique. 相似文献
4.
A two-dimensional framework (G,p) is
a graph G = (V,E) together with a map p: V → ℝ2. We view (G,p) as a straight line realization of G in ℝ2. Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length.
A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points
corresponding to u and v is the same
in all pairs of equivalent generic realizations of G. The graph G is globally rigid
if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the
first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs.
As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid
graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given
generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3]. 相似文献
5.
L.G. Casado I. García T. Csendes V.G. Ruíz 《Journal of Optimization Theory and Applications》2003,118(1):27-43
Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach. 相似文献
6.
Presented by R. Freese. 相似文献
7.
Dan Hefetz Michael Krivelevich Tibor Szabó 《Journal of Combinatorial Theory, Series A》2007,114(5):840-853
Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K2n for every q?cn/logn for an appropriate constant c, and the (1,q) Hamilton cycle game on Kn for every q?cnloglogloglogn/lognlogloglogn for an appropriate constant c. We also determine exactly those values of q for which Enforcer can win the (1,q) connectivity game on Kn. This result is quite surprising as it substantially differs from its Maker-Breaker analog. Our method extends easily to improve a result of Lu [X. Lu, A note on biased and non-biased games, Discrete Appl. Math. 60 (1995) 285-291], regarding forcing an opponent to pack many pairwise edge disjoint spanning trees in his graph. 相似文献
8.
Tibor Cserháti 《Analytical and bioanalytical chemistry》1994,349(10-11):751-755
The interaction between 23 anticancer drugs and acetyl-β-cyclodextrin (acetyl-β-CD) was studied by reversed-phase charge-transfer thin-layer chromatography and the relative strength of interaction was calculated. Acetyl-β-CD formed inclusion complexes with 16 compounds, the complex always being more hydrophilic than the uncomplexed drug. The inclusion forming capacity of drugs differed considerably according to their chemical structure. The significant linear correlation between the hydrophobicity and specific hydrophobic surface area of anticancer drugs indicated that they can be considered as a homologous series of compounds, however, their chemical structures are highly different. 相似文献
9.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
10.
For any unit vector in an inner product space S, we define a mapping on the system of all -closed subspaces of S, F(S), whose restriction on the system of all splitting subspaces of S, E(S), is always a finitely additive state. We show that S is complete iff at least one such mapping is a finitely additive state on F(S). Moreover, we give a completeness criterion via the existence of a regular finitely additive state on appropriate systems of subspaces. Finally, the result will be generalized to general inner product spaces. 相似文献