全文获取类型
收费全文 | 1832篇 |
免费 | 33篇 |
国内免费 | 2篇 |
专业分类
化学 | 1204篇 |
晶体学 | 25篇 |
力学 | 24篇 |
数学 | 175篇 |
物理学 | 439篇 |
出版年
2022年 | 15篇 |
2021年 | 18篇 |
2020年 | 14篇 |
2019年 | 19篇 |
2018年 | 10篇 |
2016年 | 28篇 |
2015年 | 22篇 |
2014年 | 23篇 |
2013年 | 75篇 |
2012年 | 73篇 |
2011年 | 57篇 |
2010年 | 54篇 |
2009年 | 48篇 |
2008年 | 108篇 |
2007年 | 101篇 |
2006年 | 97篇 |
2005年 | 100篇 |
2004年 | 77篇 |
2003年 | 75篇 |
2002年 | 99篇 |
2001年 | 33篇 |
2000年 | 27篇 |
1999年 | 24篇 |
1998年 | 24篇 |
1997年 | 25篇 |
1996年 | 23篇 |
1995年 | 21篇 |
1994年 | 21篇 |
1993年 | 14篇 |
1992年 | 26篇 |
1991年 | 16篇 |
1990年 | 22篇 |
1989年 | 19篇 |
1988年 | 25篇 |
1987年 | 27篇 |
1986年 | 29篇 |
1985年 | 26篇 |
1984年 | 37篇 |
1983年 | 21篇 |
1982年 | 35篇 |
1981年 | 38篇 |
1980年 | 32篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 21篇 |
1976年 | 20篇 |
1975年 | 30篇 |
1974年 | 8篇 |
1973年 | 10篇 |
1971年 | 7篇 |
排序方式: 共有1867条查询结果,搜索用时 15 毫秒
1.
Dr. Manussada Ratanasak Takumi Murata Taishin Adachi Prof. Jun-ya Hasegawa Prof. Tadashi Ema 《Chemistry (Weinheim an der Bergstrasse, Germany)》2022,28(58):e202202210
BPh3 catalyzes the N-methylation of secondary amines and the C-methylenation (methylene-bridge formation between aromatic rings) of N,N-dimethylanilines or 1-methylindoles in the presence of CO2 and PhSiH3; these reactions proceed at 30–40 °C under solvent-free conditions. In contrast, B(C6F5)3 shows little or no activity. 11B NMR spectra suggested the generation of [HBPh3]−. The detailed mechanism of the BPh3-catalyzed N-methylation of N-methylaniline ( 1 ) with CO2 and PhSiH3 was studied by using DFT calculations. BPh3 promotes the conversion of two substrates (N-methylaniline and CO2) into a zwitterionic carbamate to give three-component species [Ph(Me)(H)N+CO2−⋅⋅⋅BPh3]. The carbamate and BPh3 act as the nucleophile and Lewis acid, respectively, for the activation of PhSiH3 to generate [HBPh3]−, which is used to produce key CO2-derived species, such as silyl formate and bis(silyl)acetal, essential for the N-methylation of 1 . DFT calculations also suggested other mechanisms involving water for the generation of [HBPh3]− species. 相似文献
2.
Surface texturing has been recognized as an effective means to improve the tribological performances of sliding surfaces. Usually, generation additional hydrodynamic pressure to increase the load carrying capacity is regarded as the most significant effect of surface texture. In the case of silicon carbide sliding against identical material in water, the experimental results indicate that surface texture is also helpful to improve the running-in progress to smooth the contact surfaces, showing another reason to result in low friction. Based on the consideration of enhancing the generation of hydrodynamic pressure and improving running-in progress, a surface texture pattern, which was combined with large (circle, 350 μm in diameter) and small (rectangular, 40 μm in length) dimples, was designed to maximize the texture effect on the load carrying capacity of SiC surfaces sliding in water. The friction coefficient of such textured surface was evaluated and compared with that of untextured and those only with large or small dimples only. The friction reduction mechanisms of the patterns with different dimples in size are discussed. 相似文献
3.
Yamashita Hiromi Ariyuki Masao Yoshizawa Katsuhiro Kida Keiko Ohshiro Satoshi Anpo Masakazu 《Research on Chemical Intermediates》2004,30(2):235-245
The photocatalytic reactivities of chromium-containing mesoporous silica molecular sieves (Cr-HMS) under visible light irradiation have been investigated. Cr-HMS involves tetrahedral chromium oxide (Cr-oxide) moieties which are highly dispersed and incorporated in the framework of molecular sieve with two terminal Cr=O groups. In the presence of propane with molecular oxygen, a partial oxidation proceeded under visible light irradiation to produce acetone and acrolein, with high selectivity, while a complete oxidation proceeded under UV light irradiation mainly to produce CO2. The charge-transfer excited state of the tetrahedral Cr-oxide moieties plays a significant role in the photocatalytic reactions. 相似文献
4.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
5.
Modular and quasimodular solutions of a specific second order differential equation in the upper-half plane, which originates from a study of supersingular j-invariants in the first author's work with Don Zagier, are given explicitly. Positivity of Fourier coefficients of some of the solutions as well as a characterization of the differential equation are also discussed. 相似文献
6.
A globally convergent Newton method for solving strongly monotone variational inequalities 总被引:14,自引:0,他引:14
Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method. 相似文献
7.
Dashan Huang Yoshitaka Kai Frank J. Fabozzi Masao Fukushima 《European Journal of Operational Research》2007
This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model. 相似文献
8.
9.
10.
Satoru Ibaraki Masao Fukushima Toshihide Ibaraki 《Computational Optimization and Applications》1992,1(2):207-226
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs. 相似文献