全文获取类型
收费全文 | 8586篇 |
免费 | 203篇 |
国内免费 | 62篇 |
专业分类
化学 | 5797篇 |
晶体学 | 84篇 |
力学 | 250篇 |
综合类 | 1篇 |
数学 | 1314篇 |
物理学 | 1405篇 |
出版年
2022年 | 82篇 |
2021年 | 83篇 |
2020年 | 155篇 |
2019年 | 112篇 |
2018年 | 84篇 |
2017年 | 94篇 |
2016年 | 186篇 |
2015年 | 151篇 |
2014年 | 194篇 |
2013年 | 400篇 |
2012年 | 456篇 |
2011年 | 556篇 |
2010年 | 281篇 |
2009年 | 223篇 |
2008年 | 494篇 |
2007年 | 456篇 |
2006年 | 443篇 |
2005年 | 447篇 |
2004年 | 428篇 |
2003年 | 285篇 |
2002年 | 308篇 |
2001年 | 90篇 |
2000年 | 84篇 |
1999年 | 66篇 |
1998年 | 79篇 |
1997年 | 99篇 |
1996年 | 139篇 |
1995年 | 85篇 |
1994年 | 69篇 |
1993年 | 96篇 |
1992年 | 68篇 |
1991年 | 81篇 |
1990年 | 77篇 |
1989年 | 58篇 |
1988年 | 71篇 |
1987年 | 62篇 |
1986年 | 54篇 |
1985年 | 113篇 |
1984年 | 131篇 |
1983年 | 91篇 |
1982年 | 113篇 |
1981年 | 108篇 |
1980年 | 92篇 |
1979年 | 82篇 |
1978年 | 108篇 |
1977年 | 93篇 |
1976年 | 80篇 |
1975年 | 67篇 |
1974年 | 67篇 |
1973年 | 58篇 |
排序方式: 共有8851条查询结果,搜索用时 15 毫秒
1.
A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps. 相似文献
2.
Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties)
polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with
the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes
for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken
into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional
case provides interesting classes of groups.
Received: 13 December 2001 / Revised version: 24 June 2002
The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107
Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20 相似文献
3.
Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis. 相似文献
4.
A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd. 相似文献
5.
JPC – Journal of Planar Chromatography – Modern TLC - 相似文献
6.
Irada S. Isayeva Joseph P. Kennedy 《Journal of polymer science. Part A, Polymer chemistry》2004,42(17):4337-4352
This article concerns the synthesis and characterization of novel tricomponent amphiphilic membranes consisting of hydrophilic poly(ethylene glycol) (PEG) and hydrophobic polydimethylsiloxane (PDMS) segments cocrosslinked and reinforced by octasilane polyhedral oligomeric silsesquioxane (octasilane‐POSS) cages. Rapid and efficient network synthesis was effected by cocrosslinking diallyl‐telechelic PEG (A‐PEG‐A) and divinyl‐telechelic PDMS (V‐PDMS‐V) with pentamethylpentacyclosiloxane (D5H), using Karstedt's catalyst in conjunction with Et3N cocatalyst and water. Films were prepared by pouring charges in molds and crosslinking by heating at 60 °C for several hours. The films were characterized by sol fractions and equilibrium swelling both in hexane and water, extent of crosslinking, contact angle hysteresis, oxygen permeability, thermogravimetric analysis, and mechanical properties. The crosslinking of octasilane‐POSS achieved by the same catalyst system was studied in separate experiments. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 4337–4352, 2004 相似文献
7.
8.
Joseph Y.-T. Leung 《Discrete Applied Mathematics》2007,155(8):945-970
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space. 相似文献
9.
Editorial: Metal-Enhanced Fluorescence 总被引:1,自引:0,他引:1
10.