全文获取类型
收费全文 | 1050篇 |
免费 | 42篇 |
国内免费 | 50篇 |
专业分类
化学 | 39篇 |
力学 | 3篇 |
综合类 | 10篇 |
数学 | 532篇 |
物理学 | 162篇 |
综合类 | 396篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 22篇 |
2021年 | 15篇 |
2020年 | 27篇 |
2019年 | 29篇 |
2018年 | 19篇 |
2017年 | 20篇 |
2016年 | 22篇 |
2015年 | 21篇 |
2014年 | 36篇 |
2013年 | 64篇 |
2012年 | 39篇 |
2011年 | 44篇 |
2010年 | 45篇 |
2009年 | 78篇 |
2008年 | 78篇 |
2007年 | 103篇 |
2006年 | 72篇 |
2005年 | 48篇 |
2004年 | 35篇 |
2003年 | 46篇 |
2002年 | 48篇 |
2001年 | 30篇 |
2000年 | 37篇 |
1999年 | 24篇 |
1998年 | 13篇 |
1997年 | 17篇 |
1996年 | 16篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 8篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1142条查询结果,搜索用时 15 毫秒
1.
Bernhard Heinemann 《Mathematical Logic Quarterly》1997,43(2):203-215
Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated. 相似文献
2.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
3.
林诒勋 《高校应用数学学报(英文版)》2003,18(3):361-369
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th… 相似文献
4.
Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
5.
Remco van der Hofstad Gerard Hooghiemstra Piet Van Mieghem 《Random Structures and Algorithms》2002,20(4):519-539
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, l and tree sizes N. The fraction of nodes k steps away from the root is a random probability distribution in k. The expression for the covariances allows us to show that the total variation distance between this (random) probability distribution and its mean converges in probability to zero. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 519–539, 2002 相似文献
6.
Automorphisms of groups acting faithfully on rooted trees are studied. We find conditions under which every automorphism of such a group is induced by a conjugation from the full automorphism group of the rooted tree. These results are applied to known examples such as Grigorchuk groups, Gupta–Sidki group, etc. 相似文献
7.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
8.
Véronique Cariou 《Computational Statistics》2006,21(2):325-341
Summary Several data can be presented as interval curves where intervals reflect a within variability. In particular, this representation
is well adapted for load profiles, which depict the electricity consumption of a class of customers. Electricity load profiling
consists in assigning a daily load curve to a customer based on their characteristics such as energy requirement. Within the
load profiling scope, this paper investigates the extension of multivariate regression trees to the case of interval dependent
(or response) variables. The tree method aims at setting up simultaneously load profiles and their assignment rules based
on independent variables. The extension of multivariate regression trees to interval responses is detailed and a global approach
is defined. It consists in a first stage of a dimension reduction of the interval response variables. Thereafter, the extension
of the tree method is applied to the first principal interval components. Outputs are the classes of the interval curves where
each class is characterized both by an interval load profile (e.g. the class prototype) and an assignment rule based on the
independent variables. 相似文献
9.
10.
Sherif El-Basil Gani Jashari Jan V. Knop Nenad Trinajstić 《Monatshefte für Chemie / Chemical Monthly》1984,115(11):1299-1312
The reduced graph model, when used in conjunction with the search trees method, provides a novel combinatorial procedure for the enumeration and generation ofKekulé structures. The procedure is suited for large benzenoid hydrocarbons consisting of cata- and thin peri-condensed parts.
Zur Anwendung des Reduced Graph Model im Zusammenhang mit Search Trees zur Ermittlung der Anzahl möglicherKekulé-Strukturen
Zusammenfassung Das Modell erlaubt mit der im Titel genannten Kombination eine neuartige Methode zur Ermittlung und Generierung vonKekulé-Strukturen. Das Verfahren ist für große benzoide Kohlenwasserstoffe geeignet, die aus cata- und (dünnen) peri-kondensierten Teilstrukturen bestehen.相似文献