全文获取类型
收费全文 | 13382篇 |
免费 | 1169篇 |
国内免费 | 584篇 |
专业分类
化学 | 1832篇 |
晶体学 | 34篇 |
力学 | 1365篇 |
综合类 | 286篇 |
数学 | 8724篇 |
物理学 | 2894篇 |
出版年
2024年 | 28篇 |
2023年 | 136篇 |
2022年 | 397篇 |
2021年 | 438篇 |
2020年 | 273篇 |
2019年 | 322篇 |
2018年 | 326篇 |
2017年 | 448篇 |
2016年 | 481篇 |
2015年 | 348篇 |
2014年 | 682篇 |
2013年 | 789篇 |
2012年 | 817篇 |
2011年 | 696篇 |
2010年 | 602篇 |
2009年 | 787篇 |
2008年 | 814篇 |
2007年 | 839篇 |
2006年 | 738篇 |
2005年 | 616篇 |
2004年 | 484篇 |
2003年 | 452篇 |
2002年 | 433篇 |
2001年 | 389篇 |
2000年 | 383篇 |
1999年 | 275篇 |
1998年 | 295篇 |
1997年 | 263篇 |
1996年 | 193篇 |
1995年 | 191篇 |
1994年 | 171篇 |
1993年 | 131篇 |
1992年 | 123篇 |
1991年 | 100篇 |
1990年 | 84篇 |
1989年 | 81篇 |
1988年 | 55篇 |
1987年 | 47篇 |
1986年 | 48篇 |
1985年 | 70篇 |
1984年 | 59篇 |
1983年 | 16篇 |
1982年 | 28篇 |
1981年 | 27篇 |
1980年 | 25篇 |
1979年 | 32篇 |
1978年 | 22篇 |
1977年 | 32篇 |
1976年 | 23篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
Henrik Stetkær 《Journal of Functional Analysis》2007,252(1):1-33
We extend results on square integrable representations of a locally compact group to subrepresentations of a representations induced from a character of a closed subgroup. We do so working in the framework of quotient representations of ∗-algebras. 相似文献
62.
Fuzzy random vector is a measurable map from a probability space to a collection of fuzzy vectors. Our aim in this paper is
to discuss the measurability criteria for fuzzy random vectors, and show that under mild assumption, the measurability criteria
for upper semicontinuous fuzzy random vectors can be expressed in several different but equivalent formulations. Finally,
applying the obtained results, we resolve an open problem about the relationship between fuzzy random vectors and fuzzy random
variables. 相似文献
63.
Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors,
manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a
dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities
over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally
possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic
terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously
the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim
of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships
and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation
of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical
conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms
and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be
indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the
formulation of demonstrably asymptotically optimal management plans. 相似文献
64.
刘国志 《数学的实践与认识》2006,36(12):1-5
提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果. 相似文献
65.
In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup. 相似文献
66.
Ivan Nunes da Silva Wagner Caradori do AmaralLucia Valeria de Arruda 《Applied Mathematical Modelling》2007
This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network. 相似文献
67.
68.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
69.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
70.
The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant
ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the
predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory
results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach
using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets
show that feature selection using fuzzy SVM obtains better results than using SVM. 相似文献