首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   908篇
  免费   56篇
  国内免费   56篇
化学   207篇
力学   61篇
综合类   26篇
数学   573篇
物理学   153篇
  2023年   11篇
  2022年   14篇
  2021年   16篇
  2020年   14篇
  2019年   17篇
  2018年   22篇
  2017年   25篇
  2016年   21篇
  2015年   22篇
  2014年   31篇
  2013年   51篇
  2012年   47篇
  2011年   38篇
  2010年   27篇
  2009年   45篇
  2008年   60篇
  2007年   52篇
  2006年   41篇
  2005年   42篇
  2004年   34篇
  2003年   21篇
  2002年   34篇
  2001年   32篇
  2000年   25篇
  1999年   31篇
  1998年   28篇
  1997年   19篇
  1996年   19篇
  1995年   22篇
  1994年   19篇
  1993年   28篇
  1992年   22篇
  1991年   11篇
  1990年   15篇
  1989年   7篇
  1988年   2篇
  1987年   4篇
  1986年   8篇
  1985年   8篇
  1984年   3篇
  1982年   10篇
  1981年   5篇
  1980年   4篇
  1979年   4篇
  1978年   1篇
  1977年   2篇
  1976年   1篇
  1975年   2篇
  1972年   1篇
  1967年   1篇
排序方式: 共有1020条查询结果,搜索用时 31 毫秒
31.
Automatic computer programs are developed to calculate one- two-, and three-dimensional Debye functions. Prior tables of these functions are critically reviewed. Also, strategies are derived to calculate Debye temperatures from heat capacities. Both, simple three-dimensional Debye analyses and Tarasov analyses were carried out on 35 linear macromolecules. The experimental heat capacities for these analyses were collected in the ATHAS data bank. It is shown that the skeletal heat capacity of linear macromolecules is often best represented by only two vibrations per chain atom. For most of the all-carbon chain macromolecules the intramolecular skeletal heat capacity can be given by Cvs=D1[520 (28/MW)1/2] whereMW is the molecular mass andD 1 represents the one-dimensional Debye function. Polyoxides show a higher intramolecular theta temperature, but a lower intermolecular theta temperature. Double bonds and phenylene groups in the chain increase the intramolecular theta temperature.Dedicated to Prof. Dr. F. H. Müller.On leave from the Lumumba Peoples' Friendship University, Moscow, USSR.  相似文献   
32.
Calculation methods based on hybrid Density Functional Theory (DFT) with the basis sets of the B3LYP/6‐31+G(d)//B3LYP/4‐31G(d) method and the differential overlap (INDO) program were used to derive reasonable decomposition mechanisms of 1,4,5,8‐tetranitro‐1,4,5,8‐tetraazadecalin (TNAD) and 1,3,3‐trinitroazetidine (TNAZ) explosives. All possible decomposition species and transition states, including intermediates and products, were identified and their corresponding enthalpy of formation and Gibbs free energy of formation were obtained using polyparametric modification equations. INDO bond energy calculation results reveal the weakest bonding site for reference and determine where cleavage can occur easily. This work is concerned mainly with eliminating HONO (cis or trans form). The activation energy for trans‐form HONO elimination is lower than that of cis‐form HONO elimination in the initial steps of both TNAD and TNAZ decomposition, being 18.5 kJ/mol and 33.3 kJ/mol, respectively. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2005  相似文献   
33.
The interdiffusion process in thin and thick (500nm–60µm) Au–Ni layers deposited on different substrates is studied using the EDS technique. In-depth X-ray analysis based on the Pouchou and Pichoir method is applied for obtaining the concentration profiles in nanometre scale multi-layers. A theoretical analysis using the Darken method is employed for modelling interdiffusion in the Au–Ni system. Computer simulations, where intrinsic diffusivities of the Au and Ni are functions of composition, are presented and compared with experimental results.  相似文献   
34.
Summary In this work a parallel implementation of the COLUMBUS MRSDCI program system is presented. A coarse grain parallelization approach using message passing via the portable toolkit TCGMSG is used. The program is very well portable and runs on shared memory machines like the Cray Y-MP, Alliant FX/2800 or Convex C2 and on distributed memory machines like the iPSC/860. Further implementations on a network of workstations and on the Intel Touchstone Delta are in progress. Overall, results are quite satisfactory considering the complexity and the prodigious requirements, especially the I/O bandwidth, of MRCI programs in general. For our largest test case we obtain a speedup of a factor of 7.2 on an eight processor Cray Y-MP for that section of the program (hamiltonian matrix times trial vector product) which has been parallelized. The speedup for one complete diagonalization iteration amounts to 5.9. An absolute speed close to 1 GFLOPS is found. Results for the iPSC/860 show that ordinary disk I/O is certainly not sufficient in order to guarantee a satisfactory performance. As a solution for that problem, the implementation of a fully asynchronous distributed-memory model for certain data files is in preparation. On leave from: Bereich Informatik, Universität Leipzig, Augustusplatz 10/11, O-7010 Leipzig, Germany  相似文献   
35.
The Golay-Giddings and Poiseuille equations are used to derive equations for the calculation of the maximum plate number and minimum time conditions for given columns at fixed, but selectable, outlet pressures. In addition, expressions are presented for the determination of minimum analysis times for separation problems requiring given plate numbers. In this instance, the optimum column length can be calculated as a function of outlet pressure. A Basic computer program, incorporating the equations for the various optima, together with the H-ū curves, is described. Input variables are either column length or desired plate number, column diameter, film thickness, capacity ratio of the solute, column outlet pressure, seperation temperature, and carrier gas. The carrier gas viscosity is automatically calculated in the case of hydrogen, helium, or nitrogen. For these gases, and if the solute is a n-alkane, the diffusivity of the solute in the mobile phase is calculated. In this case, the carbon number of the solute is needed in the computation. For high molecular weight polydimethylsilicone phases (e.g. SE-30), the program can approximate the diffusivity of n-alkanes in the stationary phase at the given temperature as a function of the carbon number. Of course, manually entered values of viscosity and diffusion coefficients can be included in the calculations.  相似文献   
36.
The affine-scaling algorithm, first proposed by Dikin, is presently enjoying great popularity as a potentially effective means of solving linear programs. An outstanding question about this algorithm concerns its convergence in the presence of degeneracy. In this paper, we give new convergence results for this algorithm that do not require any non-degeneracy assumption on the problem. In particular, we show that if the stepsize choice of either Dikin or Barnes or Vanderbei, et al. is used, then the algorithm generates iterates that converge at least linearly with a convergence ratio of , wheren is the number of variables and (0,1] is a certain stepsize ratio. For one particular stepsize choice which is an extension of that of Barnes, we show that the cost of the limit point is within O(/(1–)) of the optimal cost and, for sufficiently small (roughly, proportional to how close the cost of the nonoptimal vertices are to the optimal cost), is exactly optimal. We prove the latter result by using an unusual proof technique, that of analyzing the ergodic convergence of the corresponding dual vectors. For the special case of network flow problems with integer data, we show that it suffices to take = 1/(6mC), wherem is the number of constraints andC is the sum of the cost coefficients, to attain exact optimality.This research is partially supported by the U.S. Army Research Office, contract DAAL03-86-K-0171 (Center for Intelligent Control Systems), by the National Science Foundation, grant NSF-ECS-8519058, and by the Science and Engineering Research Board of McMaster University.  相似文献   
37.
On affine scaling algorithms for nonconvex quadratic programming   总被引:8,自引:0,他引:8  
We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa.  相似文献   
38.
This paper was given as the opening address at the 1970 Albany International Conference on Radiation Effects in Semiconductors, and it attempts to establish a general overview of the field by concentrating on recent research developments and important unanswered questions. The continuing importance of impurity-defect interactions, of microscopic defect identification, and of the necessity for more theoretical calculations are emphasized. The rapid development of the field of ion implantation and its close relationship with radiation effects studies are pointed out. It is predicted that research in compound semiconductors will increase rapidly with close beneficial interaction with ion implantation studies.  相似文献   
39.
将影视节目中酸碱指示剂的应用引入到化学教学中,让学生在娱乐中学习化学知识,创造一个有趣的学习情境,提高学生的学习兴趣。  相似文献   
40.
Langlands program is the central concern of modern number theory. In general, we think that the main tool for studying this program is the trace formula. Arthur-Selberg’s trace formula is successful in solving the endoscopic case of Langlands program. Arthur stabilized the geometric side of the local trace formula in the general case, but did not stabilize the general spectral. This paper aims to solve the general case by different method in the Archimedean case, by directly stabilizing the spectral side of the local trace formula, and obtains the stable local trace formula.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号