全文获取类型
收费全文 | 20730篇 |
免费 | 2842篇 |
国内免费 | 612篇 |
专业分类
化学 | 1075篇 |
晶体学 | 15篇 |
力学 | 1215篇 |
综合类 | 398篇 |
数学 | 5926篇 |
物理学 | 3119篇 |
无线电 | 12436篇 |
出版年
2024年 | 78篇 |
2023年 | 258篇 |
2022年 | 461篇 |
2021年 | 552篇 |
2020年 | 563篇 |
2019年 | 468篇 |
2018年 | 482篇 |
2017年 | 689篇 |
2016年 | 915篇 |
2015年 | 918篇 |
2014年 | 1483篇 |
2013年 | 1427篇 |
2012年 | 1431篇 |
2011年 | 1553篇 |
2010年 | 1095篇 |
2009年 | 1240篇 |
2008年 | 1375篇 |
2007年 | 1441篇 |
2006年 | 1223篇 |
2005年 | 1035篇 |
2004年 | 883篇 |
2003年 | 782篇 |
2002年 | 666篇 |
2001年 | 528篇 |
2000年 | 477篇 |
1999年 | 359篇 |
1998年 | 339篇 |
1997年 | 263篇 |
1996年 | 253篇 |
1995年 | 172篇 |
1994年 | 118篇 |
1993年 | 124篇 |
1992年 | 106篇 |
1991年 | 54篇 |
1990年 | 66篇 |
1989年 | 42篇 |
1988年 | 49篇 |
1987年 | 28篇 |
1986年 | 33篇 |
1985年 | 41篇 |
1984年 | 33篇 |
1983年 | 10篇 |
1982年 | 21篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1977年 | 5篇 |
1974年 | 3篇 |
1972年 | 3篇 |
1959年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
52.
E. Mathieu Y. Foucher P. Dellamonica J. P. Daures 《Methodology and Computing in Applied Probability》2007,9(3):389-397
In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical
taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In
this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding
the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed.
A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented
for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct
times and follow-up has an impact on the evolution of patients.
相似文献
53.
一种改进的共同进化遗传算法及其应用 总被引:2,自引:0,他引:2
将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。 相似文献
54.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
55.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
56.
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. 相似文献
57.
This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions. 相似文献
58.
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. 相似文献
59.
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 相似文献
60.
本文研究了无线局域网中使信号频谱得到优化的一种简单OFDM子载波加载算法。此算法基于边缘自适应(Margin Adaptive)加载准则及其在室内无线信道上的性能。 相似文献