全文获取类型
收费全文 | 469篇 |
免费 | 27篇 |
国内免费 | 30篇 |
专业分类
化学 | 167篇 |
晶体学 | 2篇 |
力学 | 3篇 |
综合类 | 2篇 |
数学 | 332篇 |
物理学 | 20篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 14篇 |
2021年 | 11篇 |
2020年 | 23篇 |
2019年 | 20篇 |
2018年 | 16篇 |
2017年 | 15篇 |
2016年 | 9篇 |
2015年 | 18篇 |
2014年 | 13篇 |
2013年 | 35篇 |
2012年 | 20篇 |
2011年 | 20篇 |
2010年 | 20篇 |
2009年 | 23篇 |
2008年 | 36篇 |
2007年 | 22篇 |
2006年 | 32篇 |
2005年 | 15篇 |
2004年 | 16篇 |
2003年 | 19篇 |
2002年 | 13篇 |
2001年 | 16篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1976年 | 2篇 |
排序方式: 共有526条查询结果,搜索用时 15 毫秒
1.
It has been close to ten years since the publication of Green's influential survey Finite field models in additive combinatorics [28], in which the author championed the use of high-dimensional vector spaces over finite fields as a toy model for tackling additive problems concerning the integers. The path laid out by Green has proven to be a very successful one to follow. In the present article we survey the highlights of the past decade and outline the challenges for the years to come. 相似文献
2.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
3.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
4.
Vasiliy A. Ustimenko 《Acta Appl Math》2002,74(2):117-153
A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques. 相似文献
5.
Victor Alexandrov 《Geometriae Dedicata》2004,107(1):169-186
Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image. 相似文献
6.
N. B. Brusnikina A. V. Lotov 《Computational Mathematics and Mathematical Physics》2007,47(11):1779-1787
A method is proposed for approximating the reachable set of a dynamic system with a state space dimension no higher than six-eight considered on a finite time interval. The system is governed by linear differential equations with piecewise constant coefficients and impulse actions specified at prescribed times. The method is based on guaranteed-accuracy polyhedral approximations of reachable sets at researcher-specified times. Every approximation is constructed using the preceding one. A procedure is described for choosing parameters of the method that ensure the required accuracy with close-to-minimal time costs. 相似文献
7.
In a general measure-theoretic context, it is proved that the action of a stochastic map on a pair of probability distributions can be characterized by the criterion of decreasing mixing distance. 相似文献
8.
We present anO(p · n) algorithm for the problem of finding disjoint simple paths of minimum total length betweenp given pairs of terminals on oriented partial 2-trees withn nodes and positive or negative arc lengths. The algorithm is inO(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the casep=2.We gratefully acknowledge the referee's many helpful suggestions to improve the presentation of this paper. 相似文献
9.
Thermal behaviour of a polyhedral oligomeric silsesquioxane with epoxy resin cured by diamines 总被引:1,自引:0,他引:1
Ramírez C. Abad M. J. Barral L. Cano J. Díez F. J. López J. Montes R. Polo J. 《Journal of Thermal Analysis and Calorimetry》2003,72(2):421-429
A new material belongs to the family of polyhedral oligomeric silsesquioxanes, the 1-(3-glycidyl) propoxy-3,5,7,9,11,13,15-isobutylpentacyclo-[9.5.1.1(3,9).1(5,15).1(7,13)]octasiloxane
(glycidylisobutyl-POSS) is characterized by differential scanning calorimetry, thermogravimetric analysis and atomic force
microscopy. Epoxy systems based on diglycidyl ether of bisphenol A (DGEBA) cured with the diamines, 4,4'-diamine-diphenylmethane
(DDM) and 1,4-phenylenediamine (pPDA), were kinetically studied by differential scanning calorimetry in isothermal and dynamic
modes. The thermal behaviour of these systems as the glycidylisobutyl-POSS was added, is discussed later.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
10.
《Operations Research Letters》2022,50(2):122-128
The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results. 相似文献