全文获取类型
收费全文 | 1242篇 |
免费 | 41篇 |
国内免费 | 55篇 |
专业分类
化学 | 232篇 |
力学 | 52篇 |
综合类 | 2篇 |
数学 | 557篇 |
物理学 | 495篇 |
出版年
2024年 | 2篇 |
2023年 | 38篇 |
2022年 | 27篇 |
2021年 | 26篇 |
2020年 | 26篇 |
2019年 | 31篇 |
2018年 | 14篇 |
2017年 | 17篇 |
2016年 | 31篇 |
2015年 | 30篇 |
2014年 | 64篇 |
2013年 | 86篇 |
2012年 | 48篇 |
2011年 | 69篇 |
2010年 | 79篇 |
2009年 | 94篇 |
2008年 | 99篇 |
2007年 | 104篇 |
2006年 | 78篇 |
2005年 | 39篇 |
2004年 | 46篇 |
2003年 | 34篇 |
2002年 | 26篇 |
2001年 | 21篇 |
2000年 | 25篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 16篇 |
1996年 | 19篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 15篇 |
1992年 | 8篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1338条查询结果,搜索用时 31 毫秒
1.
一种新的WDM光网中的共享链路保护策略 总被引:2,自引:2,他引:0
研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率. 相似文献
2.
3.
4.
Hadi Mohammadi Bidhandi 《Annals of Operations Research》2006,143(1):237-250
This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this
formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous
and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables,
and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach
based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared
by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared
by several numerical examples. Computational experience with these data shows the superiority of the new approach. 相似文献
5.
J. M. Kumpula J. Saramäki K. Kaski J. Kertész 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,56(1):41-45
According to Fortunato and Barthélemy, modularity-based community detection
algorithms have a resolution threshold such that small communities in a large
network are invisible. Here we generalize their work and show that the q-state
Potts community detection method introduced by Reichardt and Bornholdt
also has a resolution threshold. The model contains a parameter by which this threshold can be tuned, but no a priori principle
is known to select the proper value.
Single global optimization criteria do not seem capable for detecting all
communities if their size distribution is broad. 相似文献
6.
Characterization of spherical particles using high-order neural networks and scanning flow cytometry
Vladimir V. Berdnik Alexander Shvalov Valeri Maltsev Valery A. Loiko 《Journal of Quantitative Spectroscopy & Radiative Transfer》2006,102(1):62-72
We retrieve the radius R, real n and imaginary k parts of the refractive index of homogeneous spherical particles using angular distribution of the light-scattering intensity. To solve the inverse light-scattering problem we use a high-order neural-network technique. The effect of network parameters on optimization is examined. The technique is evaluated for noise-corrupted input data at 0.6 μm<R<10.6 μm, 1.02<n<1.38, and 0<k<0.03. The errors of retrieval for nonabsorbing particles do not exceed 0.05 μm for radius and 0.015 for refractive index. The experimental verification is fulfilled by experimental data retrieved by means of a scanning flow cytometer. The light-scattering profiles of polystyrene beads and spherized red blood cells are processed with the high-order neural networks and a non-linear regression at Mie theory. The parameters retrieved by the high-order neural networks correlate well with the parameters retrieved by the least-square method. 相似文献
7.
8.
I.TntroductionStatisticalandneuralnetworkmcthodsforpatternclassiflcationusesignificantlydifTerentapproachesintrainingaclassificr.Inthestatistica1approach,thcformationofaclassifier1arge1ydependsonthestatisticsofthetrainingpatternsand,insomecases,theassumptionsaboutthedistributionofthepopulation.Theneuralnetworkmethodisnon-parametricandcanbeadaptivcinthetrainingprocessl'l.Becauseofitssimplicityandflexibility,theneuralnetworkhasbecnincreasing1yusedforpatternclassiflcation.Itisnowwe11knownthatan… 相似文献
9.
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive
repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain
packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing
the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures
is illustrated by some numerical examples.
This work has been supported by the Interuniversity Attraction Poles Programme–Belgian Science Policy. 相似文献
10.
Discrete-time GI/Geo/1 queue with multiple working vacations 总被引:2,自引:0,他引:2
Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original
work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method,
we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition
property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative
binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting
time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.
相似文献