全文获取类型
收费全文 | 20293篇 |
免费 | 1025篇 |
国内免费 | 2366篇 |
专业分类
系统科学 | 3435篇 |
丛书文集 | 591篇 |
教育与普及 | 19篇 |
理论与方法论 | 27篇 |
现状及发展 | 90篇 |
综合类 | 19522篇 |
出版年
2024年 | 125篇 |
2023年 | 246篇 |
2022年 | 417篇 |
2021年 | 467篇 |
2020年 | 483篇 |
2019年 | 403篇 |
2018年 | 379篇 |
2017年 | 441篇 |
2016年 | 424篇 |
2015年 | 634篇 |
2014年 | 927篇 |
2013年 | 860篇 |
2012年 | 1197篇 |
2011年 | 1299篇 |
2010年 | 1058篇 |
2009年 | 1285篇 |
2008年 | 1343篇 |
2007年 | 1845篇 |
2006年 | 1666篇 |
2005年 | 1392篇 |
2004年 | 1209篇 |
2003年 | 983篇 |
2002年 | 828篇 |
2001年 | 656篇 |
2000年 | 528篇 |
1999年 | 482篇 |
1998年 | 400篇 |
1997年 | 330篇 |
1996年 | 271篇 |
1995年 | 221篇 |
1994年 | 165篇 |
1993年 | 150篇 |
1992年 | 112篇 |
1991年 | 104篇 |
1990年 | 108篇 |
1989年 | 80篇 |
1988年 | 70篇 |
1987年 | 50篇 |
1986年 | 18篇 |
1985年 | 8篇 |
1981年 | 7篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
971.
An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times 总被引:1,自引:0,他引:1
Belgacem BETTAYEB Imed KACEM Kondo H.ADJALLAH LOSI-ICD CNRS FRE Universitéde technologie de Troyes France 《系统科学与系统工程学报(英文版)》2008,17(4):446-459
This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems. 相似文献
972.
Krylov subspace method based on data preprocessing technology 总被引:2,自引:0,他引:2
The performance of adaptive beamforming techniques is limited by the nonhomogeneous clutter scenario. An augmented Krylov subspace method is proposed, which utilizes only a single snapshot of the data for adaptive processing. The novel algorithm puts together a data preprocessor and adaptive Krylov subspace algorithm, where the data preprocessor suppresses discrete interference and the adaptive Krylov subspace algorithm suppresses homogeneous clutter. The novel method uses a single snapshot of the data received by the array antenna to generate a cancellation matrix that does not contain the signal of interest (SOI) component, thus, it mitigates the problem of highly nonstationary clutter environment and it helps to operate in real-time. The benefit of not requiring the training data comes at the cost of a reduced degree of freedom (DOF) of the system. Simulation illustrates the effectiveness in clutter suppression and adaptive beamforming. The numeric results show good agreement with the proposed theorem. 相似文献
973.
A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm (FE-BI-MLFMA). Among many algorithms of FE-BI-MLFMA, the decomposition algorithm (DA) is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization. On the basis of the DA, the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively. The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor- mance computing platform CEMS-Liuhui. Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy, efficiency, and generality. 相似文献
974.
An extension of 2-D assignment approach is proposed for measurement-to-target association for improving multiple targets vector miss distance measurement accuracy. When the multiple targets move so closely, the measurements can not be fully resolved due to finite resolution. The proposed method adopts an auction algorithm to compute the feasible measurement-to-target assignment with unresolved measurements for solving this 2-D assignment problem. Computer simulation results demonstrate the effectiveness and feasibility of this method. 相似文献
975.
针对背景噪声中复正弦信号的检测和估计问题,分析了自适应格型IIR陷波器的两种复数算法即梯度算法和简化的梯度算法的收敛性能,证明了输入白噪声方差的大小不影响收敛速度。并分析了由一阶自回归模型产生的有色噪声对算法的收敛性能的影响,为有色噪声中复正弦信号检测的自适应过程的参数的选取提供了理论依据。 相似文献
976.
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness. 相似文献
977.
978.
提出一种多元共生遗传神经网络(PGANN),从遗传算法和神经网络——进化和学习两方面及其相互关系着手完善进化过程,以提高优化效果和泛化能力。该算法包括一个共生平衡交叉算子,一种多元选择策略和一种神经网络的分级优化策略,其中共生平衡算子能够兼顾进化过程中的方向性、多样性和自适应性;多元选择策略能够适应进化过程不同时段对选择压力不同的需求;而分级优化使运算规模和运算速度之间的矛盾得到缓解。将该改进的遗传神经网络PGANN应用于水库和湖泊有毒的优势蓝绿藻爆发预测,取得了满意的效果。 相似文献
979.
残留频偏条件下码辅助的迭代载波同步算法 总被引:1,自引:1,他引:0
LDPC编码系统,接收端在译码前需要对频偏和相差进行估计,使残留频偏和相差在译码器收敛的允许范围之内,但在低信噪比条件下,即使在收敛范围内,较大的残留频偏和相差也会对LDPC编码系统性能有明显的恶化,所以必须结合迭代译码系统,对信号的残留频偏和相差进行进一步的估计。基于EM算法推导了频偏联合相差的迭代估计算法,给出了一种简单有效的残留频偏估计方法,并以此为基础,结合LDPC迭代译码输出软信息的统计特性,提出了一种码辅助的迭代载波同步算法,仿真结果表明,只要残留频偏和相差在迭代估计器收敛范围内,提出的算法可以使LDPC编码系统的误比特率接近理想同步条件下的译码性能。 相似文献
980.
提出了基于遗传算法的三维粒子图像匹配方法及实际中的优化设计。该方法以视差为编码、结合SSD(sum of square difference)与SAD(sum of absolute difference)法对结果进行评估,并通过单点、多点的双交叉、变异与序列的混沌化处理达到对分析空间的搜索;最后,局部处理结合全局唯一性迭代检测进一步增加了匹配结果的可信度。利用优化前后所提算法对空间粒子图进行了对比及误差分析。结果表明:所提算法适用于粒子测速系统的立体匹配,能够给出较准确的视差信息。 相似文献