全文获取类型
收费全文 | 815篇 |
免费 | 25篇 |
专业分类
化学 | 563篇 |
力学 | 6篇 |
数学 | 187篇 |
物理学 | 84篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 10篇 |
2018年 | 12篇 |
2017年 | 16篇 |
2016年 | 17篇 |
2015年 | 30篇 |
2014年 | 22篇 |
2013年 | 67篇 |
2012年 | 45篇 |
2011年 | 49篇 |
2010年 | 34篇 |
2009年 | 32篇 |
2008年 | 58篇 |
2007年 | 51篇 |
2006年 | 57篇 |
2005年 | 45篇 |
2004年 | 34篇 |
2003年 | 33篇 |
2002年 | 21篇 |
2001年 | 6篇 |
2000年 | 25篇 |
1999年 | 11篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 11篇 |
1995年 | 11篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 6篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1975年 | 6篇 |
1974年 | 2篇 |
1973年 | 3篇 |
排序方式: 共有840条查询结果,搜索用时 15 毫秒
741.
István Deák Imre Pólik András Prékopa Tamás Terlaky 《Annals of Operations Research》2012,200(1):171-182
The following question arises in stochastic programming: how can one approximate a noisy convex function with a convex quadratic function that is optimal in some sense. Using several approaches for constructing convex approximations we present some optimization models yielding convex quadratic regressions that are optimal approximations in L 1, L ?? and L 2 norm. Extensive numerical experiments to investigate the behavior of the proposed methods are also performed. 相似文献
742.
In order to be convergent, linear multistep methods must be zero stable. While constant step size theory was established in the 1950’s, zero stability on nonuniform grids is less well understood. Here we investigate zero stability on compact intervals and smooth nonuniform grids. In practical computations, step size control can be implemented using smooth (small) step size changes. The resulting grid \(\{t_n\}_{n=0}^N\) can be modeled as the image of an equidistant grid under a smooth deformation map, i.e., \(t_n = {\varPhi }(\tau _n)\), where \(\tau _n = n/N\) and the map \({\varPhi }\) is monotonically increasing with \({\varPhi }(0)=0\) and \({\varPhi }(1)=1\). The model is justified for any fixed order method operating in its asymptotic regime when applied to smooth problems, since the step size is then determined by the (smooth) principal error function which determines \({\varPhi }\), and a tolerance requirement which determines N. Given any strongly stable multistep method, there is an \(N^*\) such that the method is zero stable for \(N>N^*\), provided that \({\varPhi }\in C^2[0,1]\). Thus zero stability holds on all nonuniform grids such that adjacent step sizes satisfy \(h_n/h_{n-1} = 1 + {\mathrm {O}}(N^{-1})\) as \(N\rightarrow \infty \). The results are exemplified for BDF-type methods. 相似文献
743.
Given natural numbers n?3 and 1?a, r?n?1, the rose window graph Rn(a, r) is a quartic graph with vertex set $\{{{x}}_{{i}}|{{i}}\in {\mathbb{Z}}_{{n}}\} \cup \{{{y}}_{{i}}|{{i}}\in{\mathbb{Z}}_{{n}}\}Given natural numbers n?3 and 1?a, r?n?1, the rose window graph Rn(a, r) is a quartic graph with vertex set $\{{{x}}_{{i}}|{{i}}\in {\mathbb{Z}}_{{n}}\} \cup \{{{y}}_{{i}}|{{i}}\in{\mathbb{Z}}_{{n}}\}$ and edge set $\{\{{{x}}_{{i}},{{x}}_{{{i+1}}}\} \mid {{i}}\in {\mathbb{Z}}_n \} \cup \{\{{{y}}_{{{i}}},{{y}}_{{{i+r}}}\}\mid {{i}} \in{\mathbb{Z}}_{{n}}\}\cup \{\{{{x}}_{{{i}}},{{y}}_{{{i}}}\} \mid {{i}}\in {\mathbb{Z}}_{{{n}}}\}\cup \{\{{{x}}_{{{i+a}}},{{y}}_{{{i}}}\} \mid{{i}} \in {\mathbb{Z}}_{{{n}}}\}$. In this article a complete classification of edge‐transitive rose window graphs is given, thus solving one of the three open problems about these graphs posed by Steve Wilson in 2001. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 216–231, 2010 相似文献
744.
745.
Structural Chemistry - 相似文献
746.
Structural Chemistry - 相似文献
747.
Nalâv Gülpinar Gautam Mitra István Maros 《Computational Optimization and Applications》2002,21(1):71-93
In this paper, we investigate how an embedded pure network structure arising in many linear programming (LP) problems can be exploited to create improved sparse simplex solution algorithms. The original coefficient matrix is partitioned into network and non-network parts. For this partitioning, a decomposition technique can be applied. The embedded network flow problem can be solved to optimality using a fast network flow algorithm. We investigate two alternative decompositions namely, Lagrangean and Benders. In the Lagrangean approach, the optimal solution of a network flow problem and in Benders the combined solution of the master and the subproblem are used to compute good (near optimal and near feasible) solutions for a given LP problem. In both cases, we terminate the decomposition algorithms after a preset number of passes and active variables identified by this procedure are then used to create an advanced basis for the original LP problem. We present comparisons with unit basis and a well established crash procedure. We find that the computational results of applying these techniques to a selection of Netlib models are promising enough to encourage further research in this area. 相似文献
748.
A characteristic feature of the primal network simplex algorithm (NSA) is that it usually makes a large number of degenerate iterations. Though cycling and even stalling can be avoided by recently introduced pivot rules for NSA, the practical efficiency of these rules is not known yet. For the case when the simplex algorithm is used to solve the continuous linear programming (LP) problem there exists a practical anti-cycling procedure that proved to be efficient. It is based on an expanding relaxation of the individual bound on the variables. In this paper we discuss the adaptation of this method to NSA, taking advantage of the special integer nature of network problems. We also give an account of our experience with these ideas as they are experimentally implemented in the MINET network LP solver. Reductions of CPU time have been achieved on a smaller set of specially structured real-life problems.This research was supported in part by Hungarian Research Fund OTKA 2587, and by DAAD 314 108 060 0 while the author was at Universität Heidelberg, Germany, October, 1990. 相似文献
749.
Abstract 18-lodo criocerine (3), a synthetic precursor to (?)-criocerine (1), was prepared from (+)-vincamine (4) via a new one-step procedure. Full 1H and 13C NMR assignments for 3 are also given. 相似文献
750.
István Puskás Mária Schrott Milo Malanga Lajos Szente 《Journal of inclusion phenomena and macrocyclic chemistry》2013,75(3-4):269-276
Photon correlation spectroscopy has been employed for the purpose of characterizing the aggregation behavior of cyclodextrin molecules in aqueous solutions. This optical method is generally intended to study particle size distribution of colloidal particles, associates and macromolecules. Herein we report on some general methodological issues of photon correlation spectroscopy aiming to illustrate aggregated and non-aggregated state of parent cyclodextrins and cyclodextrin derivatives, such as (2-hydroxy)propyl-β-cyclodextrin and tetraamino rhodaminyl (2-hydroxypropyl)-β-cyclodextrin in different aqueous media. Based on particle size analysis data we have demonstrated that the tendency of cyclodextrin molecules to form aggregates may be controlled by temperature and by various additives, e.g. urea, citric acid and polyvinylpyrrolidone. In the case of (2-hydroxypropyl)-β-cyclodextrin the effect of degree of substitution was also studied. 相似文献