全文获取类型
收费全文 | 575篇 |
免费 | 28篇 |
国内免费 | 5篇 |
专业分类
化学 | 271篇 |
晶体学 | 10篇 |
力学 | 19篇 |
数学 | 215篇 |
物理学 | 93篇 |
出版年
2020年 | 4篇 |
2019年 | 4篇 |
2017年 | 8篇 |
2016年 | 14篇 |
2015年 | 10篇 |
2014年 | 18篇 |
2013年 | 26篇 |
2012年 | 29篇 |
2011年 | 30篇 |
2010年 | 22篇 |
2009年 | 15篇 |
2008年 | 35篇 |
2007年 | 34篇 |
2006年 | 43篇 |
2005年 | 40篇 |
2004年 | 35篇 |
2003年 | 34篇 |
2002年 | 30篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 10篇 |
1998年 | 2篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1993年 | 5篇 |
1991年 | 3篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 12篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1974年 | 5篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1939年 | 1篇 |
1871年 | 1篇 |
排序方式: 共有608条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
Theorists often characterize modeling as a cyclic problem-solving process. One builds the model, assesses its validity with regard to the underlying problem situation, and revises accordingly. The process halts when, in the opinion of the modeler, the model generates a valid solution to the underlying problem. Recent research suggests that students, like experts, employ cyclic modeling processes. Extensive observations of university and high school students’ modeling efforts, however, suggest the use of linear rather than cyclic modeling strategies. That is, novice modelers often fail to look back or revise their initial models. This paper offers empirical evidence on behalf of the linear modeling theory and identifies five factors that promote the use of linear modeling strategies: students’ conceptions of models and the modeling process, the perceived objectives of the modeling activity, constraints on time and resources, statistical misconceptions, and an overall lack of interest. The paper concludes with several promising instructional strategies (strategies that address students’ difficulties and promote reflective modeling behavior), as well as suggestions for future research. 相似文献
5.
6.
7.
An optimization approach for planning daily drayage operations 总被引:1,自引:0,他引:1
Yetkin Ileri Mokhtar Bazaraa Ted Gifford George Nemhauser Joel Sokol Erick Wikum 《Central European Journal of Operations Research》2006,14(2):141-156
Daily drayage operations involve moving loaded or empty equipment between customer locations and rail ramps. Our goal is to
minimize the cost of daily drayage operations in a region on a given day. Drayage orders are generally pickup and delivery
requests with time windows. The repositioning of empty equipment may also be required in order to facilitate loaded movements.
The drayage orders are satisfied by a heterogeneous fleet of drivers. Driver routes must satisfy various operational constraints.
We present an optimization methodology for finding cost-effective schedules for regional daily drayage operations. The core
of the formulation is a set partitioning model whose columns represent routes. Routes are added to the formulation by column
generation. We present numerical results for real-world data which demonstrate that our methodology produces low cost solutions
in a reasonably short time. 相似文献
8.
Motivated by Gauss's first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves.
By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data
of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a
basketball, consisting of a pair of noncrossing matchings satisfying one additional constraint. We prove that every noncrossing
matching arises from some harmonic curve, and deduce from this that every basketball arises from some polynomial. 相似文献
9.
Ted K. Ralphs Matthew J. Saltzman Margaret M. Wiecek 《Annals of Operations Research》2006,147(1):43-70
A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based
on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions
are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive
version that provides access to all Pareto outcomes. Extensive computational tests on instances of the biobjective knapsack
problem and a capacitated network routing problem are presented. 相似文献
10.
The extraction behavior of several alkyl-substituted hydroxamic acids in chloroform solution with several metal ions is described. Among the N-phenylacylhydroxamic acids used, those with o-alkyl substituents on either the phenyl or acyl ring generally do not extract metals, apparently because of steric problems at the O=CNO? chelation site. An improved synthesis of substituted hydroxamic acids is reported. 相似文献