全文获取类型
收费全文 | 23714篇 |
免费 | 1976篇 |
国内免费 | 1721篇 |
专业分类
化学 | 754篇 |
晶体学 | 13篇 |
力学 | 1016篇 |
综合类 | 324篇 |
数学 | 5486篇 |
物理学 | 2652篇 |
综合类 | 17166篇 |
出版年
2024年 | 129篇 |
2023年 | 303篇 |
2022年 | 548篇 |
2021年 | 621篇 |
2020年 | 513篇 |
2019年 | 530篇 |
2018年 | 545篇 |
2017年 | 721篇 |
2016年 | 780篇 |
2015年 | 792篇 |
2014年 | 1250篇 |
2013年 | 1235篇 |
2012年 | 1360篇 |
2011年 | 1511篇 |
2010年 | 1140篇 |
2009年 | 1438篇 |
2008年 | 1474篇 |
2007年 | 1901篇 |
2006年 | 1701篇 |
2005年 | 1372篇 |
2004年 | 1216篇 |
2003年 | 987篇 |
2002年 | 870篇 |
2001年 | 719篇 |
2000年 | 594篇 |
1999年 | 537篇 |
1998年 | 463篇 |
1997年 | 399篇 |
1996年 | 320篇 |
1995年 | 262篇 |
1994年 | 195篇 |
1993年 | 186篇 |
1992年 | 158篇 |
1991年 | 112篇 |
1990年 | 121篇 |
1989年 | 88篇 |
1988年 | 79篇 |
1987年 | 59篇 |
1986年 | 40篇 |
1985年 | 37篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 22 毫秒
91.
A new type of optoelectronic cellular neural network has been developed by providing the capability of coefficients adjusment of cellular neural network (CNN) using Widrow based perceptron learning algorithm. The new supervised cellular neural network is called Widrow-CNN. Despite the unsupervised CNN, the proposed learning algorithm allows to use the Widrow-CNN for various image processing applications easily. Also, the capability of CNN for image processing and feature extraction has been improved using basic joint transform correlation architecture. This hardware application presents high speed processing capability compared to digital applications. The optoelectronic Widrow-CNN has been tested for classic CNN feature extraction problems. It yields the best results even in case of hard feature extraction problems such as diagonal line detection and vertical line determination. 相似文献
92.
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 相似文献
93.
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. 相似文献
94.
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. 相似文献
95.
96.
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. 相似文献
97.
数据加密的密码体制与DES算法 总被引:1,自引:0,他引:1
本文论述了保密通信中数据加密的密码体制,并对各种体制地行了比较,指出其优劣,重点论述了数据加密标准DES的算法和特点. 相似文献
98.
I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance… 相似文献
99.
介绍了具有位置反馈信息旋转平台的图象数据采集方法,以及对采集到的图象进行智能化快速细化的新方法,使得在一周内的36幅图象做到边采集边细化,而且仅用40s时间。 相似文献
100.
几种约束广义逆矩阵的有限算法 总被引:2,自引:0,他引:2
陈永林 《高等学校计算数学学报》1997,19(3):232-240
1引言与引理众所周知,关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的,这就是著名的Faddeev算法[1,P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来,有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩 相似文献