全文获取类型
收费全文 | 41707篇 |
免费 | 3047篇 |
国内免费 | 2685篇 |
专业分类
化学 | 2008篇 |
晶体学 | 26篇 |
力学 | 1314篇 |
综合类 | 520篇 |
数学 | 7930篇 |
物理学 | 4514篇 |
综合类 | 31127篇 |
出版年
2024年 | 197篇 |
2023年 | 492篇 |
2022年 | 932篇 |
2021年 | 1042篇 |
2020年 | 868篇 |
2019年 | 889篇 |
2018年 | 936篇 |
2017年 | 1208篇 |
2016年 | 1265篇 |
2015年 | 1357篇 |
2014年 | 2221篇 |
2013年 | 2166篇 |
2012年 | 2309篇 |
2011年 | 2579篇 |
2010年 | 1918篇 |
2009年 | 2310篇 |
2008年 | 2459篇 |
2007年 | 3183篇 |
2006年 | 2939篇 |
2005年 | 2528篇 |
2004年 | 2239篇 |
2003年 | 1863篇 |
2002年 | 1577篇 |
2001年 | 1248篇 |
2000年 | 1061篇 |
1999年 | 936篇 |
1998年 | 775篇 |
1997年 | 661篇 |
1996年 | 535篇 |
1995年 | 493篇 |
1994年 | 367篇 |
1993年 | 346篇 |
1992年 | 291篇 |
1991年 | 225篇 |
1990年 | 225篇 |
1989年 | 189篇 |
1988年 | 150篇 |
1987年 | 131篇 |
1986年 | 87篇 |
1985年 | 51篇 |
1984年 | 52篇 |
1983年 | 16篇 |
1982年 | 31篇 |
1981年 | 13篇 |
1980年 | 12篇 |
1979年 | 13篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1959年 | 6篇 |
1955年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog2n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m3logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found. 相似文献
142.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
143.
Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks. 相似文献
144.
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. 相似文献
145.
Using the iterative scheme we prove the local existence and uniqueness of solutions of the spherically symmetric Einstein-Vlasov-Maxwell system with small initial data. We prove a continuation criterion to global in-time solutions. 相似文献
146.
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. 相似文献
147.
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 相似文献
148.
149.
Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation 总被引:2,自引:0,他引:2
Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points. 相似文献
150.
Frequency dependence of ac conductivity from 1 to 105 Hz and time series of the conductivity at 2 kHz were measured along c-axis of thulium nitrate crystal, Tm(NO3)36H2O at temperatures from 203.15 to 293.15 K. The meta-stability was observed. The frequency spectra of the conductivity were similar to those in disorder system. Aging effect was observed. Non-periodic instability (burst) was found. Non-linear dynamical property was characterized by 1/f noise spectrum, limit cycle in return map and dependence of correlation exponent on embedding dimension. 相似文献