全文获取类型
收费全文 | 4393篇 |
免费 | 248篇 |
国内免费 | 245篇 |
专业分类
化学 | 435篇 |
晶体学 | 2篇 |
力学 | 65篇 |
综合类 | 38篇 |
数学 | 3008篇 |
物理学 | 397篇 |
无线电 | 941篇 |
出版年
2024年 | 6篇 |
2023年 | 43篇 |
2022年 | 66篇 |
2021年 | 95篇 |
2020年 | 92篇 |
2019年 | 110篇 |
2018年 | 100篇 |
2017年 | 116篇 |
2016年 | 160篇 |
2015年 | 117篇 |
2014年 | 199篇 |
2013年 | 423篇 |
2012年 | 215篇 |
2011年 | 224篇 |
2010年 | 195篇 |
2009年 | 232篇 |
2008年 | 230篇 |
2007年 | 285篇 |
2006年 | 208篇 |
2005年 | 179篇 |
2004年 | 136篇 |
2003年 | 163篇 |
2002年 | 147篇 |
2001年 | 144篇 |
2000年 | 116篇 |
1999年 | 110篇 |
1998年 | 85篇 |
1997年 | 71篇 |
1996年 | 79篇 |
1995年 | 78篇 |
1994年 | 68篇 |
1993年 | 32篇 |
1992年 | 36篇 |
1991年 | 46篇 |
1990年 | 26篇 |
1989年 | 27篇 |
1988年 | 28篇 |
1987年 | 19篇 |
1986年 | 15篇 |
1985年 | 35篇 |
1984年 | 19篇 |
1983年 | 16篇 |
1982年 | 18篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 19篇 |
1978年 | 9篇 |
1977年 | 12篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有4886条查询结果,搜索用时 15 毫秒
1.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
2.
根据Flether等人的研究,基于感知独立性假设的子带识别方法被用于抗噪声鲁棒语音识别。本文拓展子带方法,采用基于噪声污染假定的多带框架来减少噪声影响。论文不仅从理论上分析了噪声污染假定多带框架在识别性能上的潜在优势,而且提出了多带环境下的鲁棒语音识别算法。研究表明:多带框架不仅回避了独立感知假设要求,而且与子带方法相比,多带方法能更好的减少噪声影响,提高系统识别性能。 相似文献
3.
L. Aggoun 《Mathematical and Computer Modelling》2002,36(11-13)
In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model. 相似文献
4.
5.
This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
6.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
7.
We consider Markov processes built from pasting together pieces of strong Markov processes which are killed at a position
dependent rate and connected via a transition kernel. We give necessary and sufficient conditions for local absolute continuity
of probability laws for such processes on a suitable path space and derive an explicit formula for the corresponding likelihood
ratio process. The main tool is the consideration of the process between successive jumps – what we call ‘elementary experiments’
– and criteria for absolute continuity of laws of the process there. We apply our results to systems of branching diffusions
with interactions and immigrations.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
8.
We study the induced measure obtained from a 1-step Markov measure, supported by a topological Markov chain, after the mapping of the original alphabet onto another one. We give sufficient conditions for the induced measure to be a Gibbs measure (in the sense of Bowen) when the factor system is again a topological Markov chain. This amounts to constructing, when it does exist, the induced potential and proving its Hölder continuity. This is achieved through a matrix method. We provide examples and counterexamples to illustrate our results. 相似文献
9.
The usual tool for modelling bond ratings migration is a discrete, time‐homogeneous Markov chain. Such model assumes that all bonds are homogeneous with respect to their movement behaviour among rating categories and that the movement behaviour does not change over time. However, among recognized sources of heterogeneity in ratings migration is age of a bond (time elapsed since issuance). It has been observed that young bonds have a lower propensity to change ratings, and thus to default, than more seasoned bonds. The aim of this paper is to introduce a continuous, time‐non‐homogeneous model for bond ratings migration, which also incorporates a simple form of population heterogeneity. The specific form of heterogeneity postulated by the proposed model appears to be suitable for modelling the effect of age of a bond on its propensity to change ratings. This model, called a mover–stayer model, is an extension of a Markov chain. This paper derives the maximum likelihood estimators for the parameters of a continuous time mover–stayer model based on a sample of independent continuously monitored histories of the process, and develops the likelihood ratio statistic for discriminating between the Markov chain and the mover–stayer model. The methods are illustrated using a sample of rating histories of young corporate issuers. For these issuers the default probabilities predicted by the Markov chain and mover–stayer models are different. In particular for 1–4 years old bonds the mover–stayer model estimates substantially lower default probabilities from rating C than a Markov chain. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
10.
本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力.利用该算法在对模型的参数进行重估计时.涉及到复杂的目标函数的梯度运算.击运用矩阵运算使得梯度运算变得简单明了,因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明. 相似文献