全文获取类型
收费全文 | 1949篇 |
免费 | 50篇 |
国内免费 | 2篇 |
专业分类
化学 | 1254篇 |
晶体学 | 11篇 |
力学 | 29篇 |
数学 | 404篇 |
物理学 | 303篇 |
出版年
2022年 | 24篇 |
2021年 | 16篇 |
2020年 | 22篇 |
2019年 | 25篇 |
2018年 | 24篇 |
2017年 | 31篇 |
2016年 | 35篇 |
2015年 | 27篇 |
2014年 | 51篇 |
2013年 | 96篇 |
2012年 | 106篇 |
2011年 | 106篇 |
2010年 | 66篇 |
2009年 | 65篇 |
2008年 | 140篇 |
2007年 | 107篇 |
2006年 | 99篇 |
2005年 | 87篇 |
2004年 | 80篇 |
2003年 | 56篇 |
2002年 | 61篇 |
2001年 | 27篇 |
2000年 | 23篇 |
1999年 | 13篇 |
1997年 | 15篇 |
1996年 | 28篇 |
1995年 | 19篇 |
1994年 | 25篇 |
1993年 | 16篇 |
1992年 | 23篇 |
1991年 | 15篇 |
1990年 | 16篇 |
1989年 | 20篇 |
1988年 | 24篇 |
1987年 | 20篇 |
1986年 | 8篇 |
1985年 | 30篇 |
1984年 | 37篇 |
1983年 | 22篇 |
1982年 | 39篇 |
1981年 | 29篇 |
1980年 | 22篇 |
1979年 | 19篇 |
1978年 | 28篇 |
1977年 | 18篇 |
1976年 | 21篇 |
1974年 | 15篇 |
1973年 | 31篇 |
1972年 | 13篇 |
1971年 | 12篇 |
排序方式: 共有2001条查询结果,搜索用时 15 毫秒
1.
Christopher E. Stuart Paul Abraham 《Journal of Mathematical Analysis and Applications》2004,300(2):224-361
Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems for scalar-valued measures on rings of sets that are in general not σ-rings are presented. As a consequence, the rings of subsets of N with density zero and uniform density zero are shown to have the Nikodym property. In addition, vector measure generalizations of the Vitali–Hahn–Saks theorem are given. 相似文献
2.
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. 相似文献
3.
Abraham Chemtob Valrie Hroguez Yves Gnanou 《Journal of polymer science. Part A, Polymer chemistry》2004,42(11):2705-2716
This study critically examines the similarities and differences between poly(ethylene oxide) (PEO) stabilized latices of polynorbornene and polybutadiene. Features such as the kinetics of copolymerization of norbornene and cyclooctadiene with a macromonomer of PEO, the particles' size and morphology, the type of copolymer formed, and the stability of these latices were investigated and the results obtained are considered. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2705–2716, 2004 相似文献
4.
Becky Lavi Abraham Marmur 《Colloids and surfaces. A, Physicochemical and engineering aspects》2004,250(1-3):409-414
An equation for the kinetics of partial drop spreading is proposed. This equation was empirically derived from experimental data for the spreading kinetics of partially wetting liquids in terms of the wet area versus time. The equation has the form of an exponential power law (EPL), and transforms into the well-known power law for complete wetting, when the equilibrium contact angle approaches zero. The EPL fits very well available experimental data. To lend additional support to the validity of this generalized equation, it will be demonstrated that when it is transformed to present the dynamic contact angle (DCA), it fits very well DCA experimental data for other wetting processes, such as capillary flow and tape coating. 相似文献
5.
Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered. 相似文献
6.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
7.
Details are given of a new method allowing an exact calculation of the spontaneous magnetization in the corner as well as along the edge at an arbitrary distance of the corner for a rectangular planar Ising ferromagnet. 相似文献
8.
Mary Beth Walsh Connie M. Moss Benny G. Johnson Dale A. Holder Jeffry D. Madura 《The Chemical Educator》2002,7(6):379-383
The need for improved interactive tutoring capabilities in educational software for chemistry problem solving is an important one clearly articulated by teachers and students. To deliver the next generation of individualized interactive capabilities users demand, it is necessary to go beyond the conventional computer-assisted instruction methodology. The focus of this paper is the assessment with first-semester general chemistry students of a recently developed artificial intelligence (AI) tutor for balancing chemical equations. This is the first such assessment of an AI-based learning tool in chemistry. Students in CHEM 121 in the Fall 2001 semester at Duquesne University (N = 273) participated in the study. Students were divided into a test group that used the AI tutor as part of their study activities and a control group that did not use the tutor. It was found that the tutor improved the performance of the test group students to a statistically significant degree, helping the weakest students the most. This study establishes the feasibility of an AI-based approach to creating advanced new tutoring software for chemistry problem solving. Access to a Web-based demonstration of the equation-balancing tutor may be obtained by emailing the corresponding author. 相似文献
9.
A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided. 相似文献
10.
We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Qn contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006 相似文献