全文获取类型
收费全文 | 7068篇 |
免费 | 986篇 |
国内免费 | 469篇 |
专业分类
化学 | 213篇 |
晶体学 | 1篇 |
力学 | 607篇 |
综合类 | 60篇 |
数学 | 773篇 |
物理学 | 1556篇 |
综合类 | 5313篇 |
出版年
2024年 | 40篇 |
2023年 | 75篇 |
2022年 | 162篇 |
2021年 | 219篇 |
2020年 | 197篇 |
2019年 | 178篇 |
2018年 | 177篇 |
2017年 | 256篇 |
2016年 | 289篇 |
2015年 | 324篇 |
2014年 | 445篇 |
2013年 | 398篇 |
2012年 | 518篇 |
2011年 | 476篇 |
2010年 | 380篇 |
2009年 | 398篇 |
2008年 | 424篇 |
2007年 | 493篇 |
2006年 | 409篇 |
2005年 | 381篇 |
2004年 | 334篇 |
2003年 | 272篇 |
2002年 | 245篇 |
2001年 | 225篇 |
2000年 | 193篇 |
1999年 | 153篇 |
1998年 | 157篇 |
1997年 | 139篇 |
1996年 | 104篇 |
1995年 | 77篇 |
1994年 | 81篇 |
1993年 | 65篇 |
1992年 | 58篇 |
1991年 | 42篇 |
1990年 | 42篇 |
1989年 | 29篇 |
1988年 | 19篇 |
1987年 | 13篇 |
1986年 | 11篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1959年 | 1篇 |
1957年 | 1篇 |
1955年 | 5篇 |
排序方式: 共有8523条查询结果,搜索用时 319 毫秒
21.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
22.
23.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
24.
将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发,提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计,有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明,该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理.
关键词:
自适应滤波
心磁图
最小均方误差 相似文献
25.
通过对非线性规划问题的K-T点的光滑路径跟踪方法研究,得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法,证明了光滑跟踪路径的存在性。 相似文献
26.
Decentralized iterative learning control for a class of large scale interconnected dynamical systems
Hansheng Wu 《Journal of Mathematical Analysis and Applications》2007,327(1):233-245
The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes. 相似文献
27.
分析了用自适应滤波器进行故障诊断的方法.针对该方法在计算上要花费大量时间、难于完成实时诊断任务的缺点,提出了用神经网络自适应滤波器来完成故障诊断的方法.神经网络有极快的运行速度,能很好地完成实时诊断任务. 相似文献
28.
29.
介绍了利用状态反馈综合带加速度反馈的最优控制系统,利用系统所检测的位置量和速度量设计了加速度观测器,并对综合的最优控制系统进行仿真,包括系统幅频、相频特性及状态估计值与真实状态之间的误差,最后给出了有、无加速度观测器反馈时系统跟踪晃动误差曲线。带加速度观测器反馈系统使晃动误差减小84%,滤除噪声的效果也比较好。 相似文献
30.
通过混沌系统的形式的抽象,提出了一种间接自适应模糊控制方法来控制一类具有未知非线性函数的混沌系统跟踪一参考轨迹. 相似文献