全文获取类型
收费全文 | 9736篇 |
免费 | 1328篇 |
国内免费 | 476篇 |
专业分类
化学 | 2382篇 |
晶体学 | 36篇 |
力学 | 609篇 |
综合类 | 285篇 |
数学 | 4695篇 |
物理学 | 3533篇 |
出版年
2024年 | 26篇 |
2023年 | 136篇 |
2022年 | 305篇 |
2021年 | 444篇 |
2020年 | 282篇 |
2019年 | 204篇 |
2018年 | 162篇 |
2017年 | 322篇 |
2016年 | 392篇 |
2015年 | 302篇 |
2014年 | 571篇 |
2013年 | 722篇 |
2012年 | 621篇 |
2011年 | 597篇 |
2010年 | 531篇 |
2009年 | 673篇 |
2008年 | 598篇 |
2007年 | 645篇 |
2006年 | 533篇 |
2005年 | 402篇 |
2004年 | 323篇 |
2003年 | 333篇 |
2002年 | 310篇 |
2001年 | 296篇 |
2000年 | 269篇 |
1999年 | 222篇 |
1998年 | 196篇 |
1997年 | 182篇 |
1996年 | 164篇 |
1995年 | 100篇 |
1994年 | 80篇 |
1993年 | 85篇 |
1992年 | 47篇 |
1991年 | 43篇 |
1990年 | 43篇 |
1989年 | 27篇 |
1988年 | 24篇 |
1987年 | 12篇 |
1986年 | 27篇 |
1985年 | 65篇 |
1984年 | 61篇 |
1983年 | 20篇 |
1982年 | 43篇 |
1981年 | 40篇 |
1980年 | 25篇 |
1979年 | 19篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
一类死区非线性输入系统的自适应模糊控制 总被引:1,自引:0,他引:1
针对一类具有死区非线性输入的非线性系统,基于滑模控制的基本原理,利用II型模糊逻辑系统对未知函数进行在线逼近,提出了一种具有监督器的自适应模糊滑模控制方法。该方法通过监督控制器保证闭环系统所有信号有界,并通过引入最优逼近误差的自适应补偿项来消除建模误差的影响。通过理论分析,证明了跟踪误差收敛到零。 相似文献
82.
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. 相似文献
83.
基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。 相似文献
84.
M. Abbad R. El. Azouzi M. El. Kamili 《Mathematical Methods of Operations Research》2006,63(3):461-471
In this paper we consider some properties on prices under flow control in a network that is to be shared by noncooperative users. Each user is faced with an optimization problem which is formulated as the minimization of its own criterion subject to constraint on the flows of the other users. The operating points of the network are the Nash equilibria of the underlying routing game. Our objective is to study the behavior of prices of all users when the network designer needs to allocate capacities to network links. For parallel links topologies, we show that degradation of the performances such as prices will not take place, as well as the users may find it beneficial to improve their requests 相似文献
85.
光学相关识别是图像识别的重要方法,有效识别相关器输出平面的相关峰信号是保证光学相关器图像识别准确性的关键。由于激光器输出功率的波动、光学系统本身的误差以及SLM器件本身带来的噪声,采用一般的阈值方法很难达到理想的效果。该文提出对相关器的输出平面进行预处理,充分考虑相关信号的形状信息,提取感兴趣区域(ROI),采用BP神经网络对输入矢量进行计算,可达到对相关峰信号和噪声的有效分类识别,从而提高了光学相关器识别的可靠性,降低了误判的概率。 相似文献
86.
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. 相似文献
87.
LI Ke-Ping 《理论物理通讯》2006,46(8)
In this work, we propose a new model of evolution networks, which is based on the evolution of the traffic flow. In our method, the network growth does not take into account preferential attachment, and the attachment of new node is independent of the degree of nodes. Our aim is that employing the theory of evolution network, we give a further understanding about the dynamical evolution of the traffic flow. We investigate the probability distributions and scaling properties of the proposed model. The simulation results indicate that in the proposed model, the distribution of the output connections can be well described by scale-free distribution. Moreover, the distribution of the connections is largely related to the traffic flow states, such as the exponential distribution (i.e., the scale-free distribution) and random distribution etc. 相似文献
88.
讨论了Fuzzy矩阵A的同解简化矩阵A^(2),指出陈贻源论文《解Fuzzy关系方程》中定量3的错误。研究Fuzzy矩阵方程的摄动问题,解决了汤服成(2000)提出的未解决问题。 相似文献
89.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
90.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献