全文获取类型
收费全文 | 270篇 |
免费 | 5篇 |
国内免费 | 21篇 |
专业分类
化学 | 18篇 |
力学 | 18篇 |
综合类 | 2篇 |
数学 | 246篇 |
物理学 | 12篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 7篇 |
2016年 | 4篇 |
2015年 | 4篇 |
2014年 | 10篇 |
2013年 | 25篇 |
2012年 | 18篇 |
2011年 | 11篇 |
2010年 | 9篇 |
2009年 | 30篇 |
2008年 | 12篇 |
2007年 | 10篇 |
2006年 | 15篇 |
2005年 | 17篇 |
2004年 | 8篇 |
2003年 | 14篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1980年 | 3篇 |
排序方式: 共有296条查询结果,搜索用时 203 毫秒
1.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
2.
M. D. Guay 《Acta Mathematica Hungarica》2004,105(3):241-248
Axioms are given for a preconvexity space and certain consequences obtained. In particular, it is shown that in a very natural
way, a preconvexity on a space yields an abstract convexity space in much the same manner as a proximity yields a topological
space.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
3.
The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n˙ Log (n)) execution time, may give an O(n˙n˙ Log (n)) to peel all the set; an O(n˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n˙n) performance. 相似文献
4.
5.
In a category with injective hulls and a cogenerator, the embeddings into injective hulls can never form a natural transformation,
unless all objects are injective. In particular, assigning to a field its algebraic closure, to a poset or Boolean algebra
its Mac-Neille completion, and to an R-module its injective envelope is not functorial, if one wants the respective embeddings to form a natural transformation.
Received January 21, 2000; accepted in final form August 10, 2001.
RID="h1"
RID="h2"
RID="h3"
ID="h1"The hospitality of York University is gratefully acknowledged by the first author.
ID="h2"Third author partially supported by the Grant Agency of the Czech Republic under Grant no. 201/99/0310, and the hospitality
of York University is also acknowledged.
ID="h3"Partial financial assistance by the Natural Sciences and Engineering Councel of Canada is acknowledged by the fourth
author. 相似文献
6.
Armen Edigarian Jan Wiegerinck 《Proceedings of the American Mathematical Society》2003,131(8):2459-2465
Let be domains in . Under very mild conditions on we show that there exist holomorphic functions , defined on with the property that is nowhere extendible across , while the graph of over is not complete pluripolar in . This refutes a conjecture of Levenberg, Martin and Poletsky (1992).
7.
Henrik Schulz 《Discrete Applied Mathematics》2009,157(16):3485-3493
In this paper we introduce an algorithm for the creation of polyhedral approximations for certain kinds of digital objects in a three-dimensional space. The objects are sets of voxels represented as strongly connected subsets of an abstract cell complex. The proposed algorithm generates the convex hull of a given object and modifies the hull afterwards by recursive repetitions of generating convex hulls of subsets of the given voxel set or subsets of the background voxels. The result of this method is a polyhedron which separates object voxels from background voxels. The objects processed by this algorithm and also the background voxel components inside the convex hull of the objects are restricted to have genus 0. The second aim of this paper is to present some practical improvements to the discussed convex hull algorithm to reduce computation time. 相似文献
8.
The study of mechanical systems with uncertain parameters is gaining increasing interest in the field of system analysis to provide an expedient model for the prediction of the system behavior. Making use of the Transformation Method, the uncertain parameters of the system are modeled by fuzzy numbers in contrast to random numbers used in stochastic approaches. As a result of this analysis, a quantification of the overall uncertainty of the system outputs, including a worst-case scenario, is obtained. The inputs of the resulting fuzzy-valued model are a priori uncorrelated but after the uncertainties are propagated through the model, interdependency (or interaction) between the outputs may arise. If such interdependency is neglected, a misinterpretation of the results may occur. For example, in the case of applying uncertainty analysis in the early design phase of a product to determine the relevant design-parameter space, the interdependency between the design variables may reduce significantly the available part of the design space. This paper proposes a measure of interdependency between the uncertain system outputs. The interdependency index can be derived by a postprocessing of the data gained by the analysis with the Transformation Method. Such information can be obtained by a negligible amount of extra computation time. 相似文献
9.
In this note, the 80 non‐isomorphic triple systems on 15 points are revisited from the viewpoint of the convex hull of the characteristic vectors of their blocks. The main observation is that the numbers, of facets of these 80 polyhedra are all different, thus producing a new proof of the non‐isomorphism of these triple systems. The space dimension of these polyhedra is also discussed. Finally, we observe the large number of facets of some of these polyhedra with few vertices, in relation with the upper bound problem for combinatorial polyhedra. © 2005 Wiley Periodicals, Inc. J Combin Designs. 相似文献
10.
The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well. 相似文献