全文获取类型
收费全文 | 217篇 |
免费 | 9篇 |
国内免费 | 4篇 |
专业分类
化学 | 28篇 |
力学 | 74篇 |
综合类 | 5篇 |
数学 | 82篇 |
物理学 | 41篇 |
出版年
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 4篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 10篇 |
2012年 | 12篇 |
2011年 | 27篇 |
2010年 | 5篇 |
2009年 | 13篇 |
2008年 | 9篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有230条查询结果,搜索用时 406 毫秒
1.
2.
Sh. M. Aitaliev 《International Applied Mechanics》2004,40(10):1065-1091
Some results on underground structures obtained by Kazakh mechanicians are reviewed. The review covers a period of the last forty years. Also results on the mechanics of special objects are discussed.Translated from Prikladnaya Mekhanika, Vol. 40, No. 10, pp. 3–36, October 2004. 相似文献
3.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
4.
The locality of underground water, contaminated with cyanides, has been successfully cleaned by using the hydraulic barrier method (assembly of pumped wells) since 1986. The average cyanide concentrations in the outflow exceeded 35 m per litre. Contamination had to be eliminated before the discharge into the sewer system. The radiation approach “in situ” i.e. decomposition of cyanides by barrier, was applied and is still being used today. The cyanide concentration was lowered more than one order of magnitude. This process was approved by the Czechoslovak radiation security authorities and further applications of “in Situ” regeneration of underground water contamination is anticipated. 相似文献
5.
6.
Alexander Postnikov Boris Shapiro 《Transactions of the American Mathematical Society》2004,356(8):3109-3142
For a graph , we construct two algebras whose dimensions are both equal to the number of spanning trees of . One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to -parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We show that the Hilbert series of a monotone monomial ideal is always bounded by the Hilbert series of its deformation. Then we define an even more general class of monomial ideals associated with posets and construct free resolutions for these ideals. In some cases these resolutions coincide with Scarf resolutions. We prove several formulas for Hilbert series of monotone monomial ideals and investigate when they are equal to Hilbert series of deformations. In the appendix we discuss the abelian sandpile model.
7.
A (u1,
u2, . . . )-parking function of length
n is a sequence (x1,
x2, . . . ,
xn)
whose order
statistics (the sequence (x(1),
x(2), . . . ,
x(n)) obtained by rearranging the original sequence in
non-decreasing order) satisfy
x(i)
u(i).
The Gonarov polynomials g
n
(x; a0, a
1, . . . , a
n-1) are
polynomials biorthogonal to the linear functionals (a
i)
Di,
where (a) is evaluation at
a and D
is differentiation. In this paper, we give explicit formulas for the first and second moments of
sums of u-parking functions using Gonarov polynomials by
solving a linear recursion based on a decomposition of the set of sequences of positive integers.
We also give a combinatorial proof of one of the formulas for the expected sum. We specialize
these formulas to the classical case when u
i=a+
(i-1)b and obtain, by
transformations with Abel identities, different but equivalent
formulas for expected sums. These formulas are used to verify the classical case of the
conjecture that the expected sums are increasing functions of the gaps
ui+1
- ui.
Finally, we give analogues of our results for real-valued parking functions.AMS Subject Classification: 05A15, 05A19, 05A20, 05E35. 相似文献
8.
This paper presents a new class of valid inequalities for the single-item capacitated lot sizing problem with step-wise production costs (LS-SW). Constant sized batch production is carried out with a limited production capacity in order to satisfy the customer demand over a finite horizon. A new class of valid inequalities we call mixed flow cover, is derived from the existing integer flow cover inequalities by a lifting procedure. The lifting coefficients are sequence independent when the batch sizes (V) and the production capacities (P) are constant and when V divides P. When the restriction of the divisibility is removed, the lifting coefficients are shown to be sequence independent. We identify some cases where the mixed flow cover inequalities are facet defining. We propose a cutting plane algorithm for different classes of valid inequalities introduced in the paper. The exact separation algorithm proposed for the constant capacitated case runs in polynomial time. Computational results show the efficiency of the new class mixed flow cover compared to the existing methods. 相似文献
9.
This paper proposes an integer linear programming formulation for a simultaneous lot sizing and scheduling problem in a job shop environment. Among others, one of our realistic assumptions is dealing with flexible machines which enable the production manager to change their working speeds. Then, a number of valid inequalities are developed based on problem structures. As the valid inequalities can help in reducing the non-optimal parts of the solution space, they are dealt with as some cutting planes. The proposed cutting planes are used to solve the problem in (i) cut-and-branch, and (ii) branch-and-cut approaches. The performance of each cutting plane is investigated with CPLEX 12.2 on a set of randomly-generated test data. Then, some performance criteria are identified and the proposed cutting planes are ranked by TOPSIS method. 相似文献
10.