全文获取类型
收费全文 | 21280篇 |
免费 | 3097篇 |
国内免费 | 623篇 |
专业分类
化学 | 806篇 |
晶体学 | 17篇 |
力学 | 1109篇 |
综合类 | 360篇 |
数学 | 5901篇 |
物理学 | 3013篇 |
无线电 | 13794篇 |
出版年
2024年 | 70篇 |
2023年 | 239篇 |
2022年 | 430篇 |
2021年 | 547篇 |
2020年 | 551篇 |
2019年 | 454篇 |
2018年 | 479篇 |
2017年 | 714篇 |
2016年 | 939篇 |
2015年 | 979篇 |
2014年 | 1593篇 |
2013年 | 1463篇 |
2012年 | 1551篇 |
2011年 | 1627篇 |
2010年 | 1185篇 |
2009年 | 1305篇 |
2008年 | 1475篇 |
2007年 | 1512篇 |
2006年 | 1273篇 |
2005年 | 1086篇 |
2004年 | 930篇 |
2003年 | 820篇 |
2002年 | 678篇 |
2001年 | 534篇 |
2000年 | 464篇 |
1999年 | 364篇 |
1998年 | 325篇 |
1997年 | 258篇 |
1996年 | 229篇 |
1995年 | 174篇 |
1994年 | 120篇 |
1993年 | 121篇 |
1992年 | 104篇 |
1991年 | 47篇 |
1990年 | 60篇 |
1989年 | 39篇 |
1988年 | 45篇 |
1987年 | 27篇 |
1986年 | 32篇 |
1985年 | 34篇 |
1984年 | 35篇 |
1983年 | 13篇 |
1982年 | 20篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 8篇 |
1976年 | 4篇 |
1959年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 515 毫秒
131.
132.
133.
In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd > 0 is a constant depending on the problem dimension and data. 相似文献
134.
Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization. 相似文献
135.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning. 相似文献
136.
137.
基于约束优化的联想记忆模型学习算法 总被引:1,自引:1,他引:0
本文提出了一种对称互连神经元网络的学习策略,利用全局约束优化方法确定连接权。优化过程采用了梯度下降技术。这种学习算法可以保证训练样本成为系统的稳定吸引子,并且具有优化意义上的最大吸引域。本文讨论了网络的存储容量,训练样本的渐近稳定性和吸引域大小。计算机实验结果说明了学习算法的优越性。 相似文献
138.
提出种基于TEMIC射频卡Manchester编码的速率自适应读卡算法,并对该算法进行了说明和示例。 相似文献
139.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
140.
I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance… 相似文献