全文获取类型
收费全文 | 2743篇 |
免费 | 100篇 |
国内免费 | 67篇 |
专业分类
化学 | 192篇 |
晶体学 | 2篇 |
力学 | 156篇 |
综合类 | 27篇 |
数学 | 2210篇 |
物理学 | 323篇 |
出版年
2024年 | 2篇 |
2023年 | 24篇 |
2022年 | 41篇 |
2021年 | 46篇 |
2020年 | 33篇 |
2019年 | 32篇 |
2018年 | 30篇 |
2017年 | 29篇 |
2016年 | 48篇 |
2015年 | 40篇 |
2014年 | 82篇 |
2013年 | 118篇 |
2012年 | 95篇 |
2011年 | 106篇 |
2010年 | 115篇 |
2009年 | 177篇 |
2008年 | 202篇 |
2007年 | 232篇 |
2006年 | 165篇 |
2005年 | 131篇 |
2004年 | 123篇 |
2003年 | 110篇 |
2002年 | 113篇 |
2001年 | 84篇 |
2000年 | 79篇 |
1999年 | 73篇 |
1998年 | 84篇 |
1997年 | 59篇 |
1996年 | 61篇 |
1995年 | 41篇 |
1994年 | 40篇 |
1993年 | 40篇 |
1992年 | 28篇 |
1991年 | 25篇 |
1990年 | 19篇 |
1989年 | 18篇 |
1988年 | 26篇 |
1987年 | 15篇 |
1986年 | 16篇 |
1985年 | 17篇 |
1984年 | 21篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有2910条查询结果,搜索用时 31 毫秒
81.
《Analytica chimica acta》2004,515(1):87-100
The goal of present work is to analyse the effect of having non-informative variables (NIV) in a data set when applying cluster analysis and to propose a method computationally capable of detecting and removing these variables. The method proposed is based on the use of a genetic algorithm to select those variables important to make the presence of groups in data clear. The procedure has been implemented to be used with k-means and using the cluster silhouettes as fitness function for the genetic algorithm.The main problem that can appear when applying the method to real data is the fact that, in general, we do not know a priori what the real cluster structure is (number and composition of the groups).The work explores the evolution of the silhouette values computed from the clusters built by using k-means when non-informative variables are added to the original data set in both a literature data set as well as some simulated data in higher dimension. The procedure has also been applied to real data sets. 相似文献
82.
Pogliani L 《Journal of computational chemistry》2003,24(9):1097-1109
The complete graph conjecture that encodes the inner-core electrons of atoms with principal quantum number n >or= 2 with complete graphs, and especially with odd complete graphs, is discussed. This conjecture is used to derive new values for the molecular connectivity and pseudoconnectivity basis indices of hydrogen-suppressed chemical pseudographs. For atoms with n = 2 the new values derived with this conjecture are coincident with the old ones. The modeling ability of the new homogeneous basis indices, and of the higher-order terms, is tested and compared with previous modeling studies, which are centered on basis indices that are either based on quantum concepts or partially based on this new conjecture for the inner-core electrons. Two similar algorithms have been proposed with this conjecture, and they parallel the two "quantum" algorithms put forward by molecular connectivity for atoms with n > 2. Nine properties of five classes of compounds have been tested: the molecular polarizabilities of a class of organic compounds, the dipole moment, molar refraction, boiling points, ionization energies, and parachor of a series of halomethanes, the lattice enthalpy of metal halides, the rates of hydrogen abstraction of chlorofluorocarbons, and the pED(50) of phenylalkylamines. The two tested algorithms based on the odd complete graph conjecture give rise to a highly interesting model of the nine properties, and three of them can even be modeled by the same set of basis indices. Interesting is the role of some basis indices all along the model. 相似文献
83.
84.
On affine scaling algorithms for nonconvex quadratic programming 总被引:8,自引:0,他引:8
Yinyu Ye 《Mathematical Programming》1992,56(1-3):285-300
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. 相似文献
85.
A. Miele B. P. Mohanty P. Venkataraman Y. M. Kuo 《Journal of Optimization Theory and Applications》1982,38(1):97-109
This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance. 相似文献
86.
Discontinuous Galerkin methods on graphics processing units for nonlinear hyperbolic conservation laws
下载免费PDF全文
![点击此处可从《国际流体数值方法杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We present a novel implementation of the modal DG method for hyperbolic conservation laws in two dimensions on graphics processing units (GPUs) using NVIDIA's Compute Unified Device Architecture. Both flexible and highly accurate, DG methods accommodate parallel architectures well as their discontinuous nature produces element‐local approximations. High‐performance scientific computing suits GPUs well, as these powerful, massively parallel, cost‐effective devices have recently included support for double‐precision floating‐point numbers. Computed examples for Euler equations over unstructured triangle meshes demonstrate the effectiveness of our implementation on an NVIDIA GTX 580 device. Profiling of our method reveals performance comparable with an existing nodal DG‐GPU implementation for linear problems. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
87.
S. Talatahari B. Farahmand AzarR. Sheikholeslami A.H. Gandomi 《Communications in Nonlinear Science & Numerical Simulation》2012,17(3):1312-1319
A novel chaotic improved imperialist competitive algorithm (CICA) is presented for global optimization. The ICA is a new meta-heuristic optimization developed based on a socio-politically motivated strategy and contains two main steps: the movement of the colonies and the imperialistic competition. Here different chaotic maps are utilized to improve the movement step of the algorithm. Seven different chaotic maps are investigated and the Logistic and Sinusoidal maps are found as the best choices. Comparing the new algorithm with the other ICA-based methods demonstrates the superiority of the CICA for the benchmark functions. 相似文献
88.
《Operations Research Letters》2014,42(6-7):450-454
We consider the problem of maximally decreasing the edge-connectivity of an edge-weighted graph by removing a limited set of edges. This problem, which we term connectivity interdiction, falls into a large family of so-called interdiction problems, which have been considered in a variety of contexts. Whereas little is known about the approximability of most interdiction problems, we show that connectivity interdiction admits a PTAS, and a natural special case of it can even be solved efficiently. 相似文献
89.
In this paper, we present a thermomechanical framework which makes use of the internal variable theory of thermodynamics for damage-coupled finite viscoplasticity with nonlinear isotropic hardening. Damage evolution, being an irreversible process, generates heat. In addition to its direct effect on material's strength and stiffness, it causes deterioration of the heat conduction. The formulation, following the footsteps of Simó and Miehe (1992), introduces inelastic entropy as an additional state variable. Given a temperature dependent damage dissipation potential, we show that the evolution of inelastic entropy assumes a split form relating to plastic and damage parts, respectively. The solution of the thermomechanical problem is based on the so-called isothermal split. This allows the use of the model in 2D and 3D example problems involving geometrical imperfection triggered necking in an axisymmetric bar and thermally triggered necking of a 3D rectangular bar. 相似文献
90.
Abstract In this article, two static routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment algorithms reduce the blocking probability to maximize the utilization of the network. All of these algorithms are analyzed and compared with four wavelength assignment schemes, which are first-fit, random, most used, and least used. It is shown that our proposed static algorithms give the best performance for first-fit wavelength assignment and most used wavelength assignment strategies with reduced complexity. For least used wavelength assignment and random wavelength assignment, 1 fixed and 2 alternate routing algorithm gives the lowest blocking probability. 相似文献