首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1201篇
  免费   54篇
  国内免费   103篇
化学   87篇
力学   16篇
综合类   24篇
数学   1092篇
物理学   139篇
  2024年   1篇
  2023年   11篇
  2022年   21篇
  2021年   14篇
  2020年   30篇
  2019年   22篇
  2018年   22篇
  2017年   26篇
  2016年   32篇
  2015年   13篇
  2014年   49篇
  2013年   121篇
  2012年   30篇
  2011年   60篇
  2010年   42篇
  2009年   77篇
  2008年   89篇
  2007年   94篇
  2006年   74篇
  2005年   56篇
  2004年   57篇
  2003年   45篇
  2002年   54篇
  2001年   41篇
  2000年   38篇
  1999年   38篇
  1998年   41篇
  1997年   25篇
  1996年   20篇
  1995年   13篇
  1994年   15篇
  1993年   12篇
  1992年   10篇
  1991年   6篇
  1990年   9篇
  1989年   3篇
  1988年   3篇
  1987年   2篇
  1985年   3篇
  1984年   9篇
  1983年   5篇
  1982年   3篇
  1981年   2篇
  1980年   2篇
  1979年   6篇
  1978年   4篇
  1977年   4篇
  1971年   1篇
  1970年   2篇
  1959年   1篇
排序方式: 共有1358条查询结果,搜索用时 12 毫秒
31.
The finite-difference time-domain method based on recursive convoltion method (RC-FDTD) for the electric anisotropic dispersive medium is discussed in detail. To exemplify the availability of the three-dimensional RC-FDTD algorithm, the backscattering Radar-Cross-Section(RCS) of a non-magnetized plasma sphere is computed, and the numerical results are the same as the one of the Shift Operater-FDTD method, and show that the RC-FDTD method is correct and efficient. In addition, the co-polarized and cross-polarized backscattering time-domain of a magnetized plasma sphere are obtained by the RC-FDTD algorithm. The results show that when the external magnetic field is implemented, the cross-polarized component appear, evidently.  相似文献   
32.
This paper proposes an all-optical label processing scheme that uses the multiple optical orthogonal codes sequences (MOOCS)-based optical label for optical packet switching (OPS) (MOOCS-OPS) networks. In this scheme, each MOOCS is a permutation or combination of the multiple optical orthogonal codes (MOOC) selected from the multiple-groups optical orthogonal codes (MGOOC). Following a comparison of different optical label processing (OLP) schemes, the principles of MOOCS-OPS network are given and analyzed. Firstly, theoretical analyses are used to prove that MOOCS is able to greatly enlarge the number of available optical labels when compared to the previous single optical orthogonal code (SOOC) for OPS (SOOC-OPS) network. Then, the key units of the MOOCS-based optical label packets, including optical packet generation, optical label erasing, optical label extraction and optical label rewriting etc., are given and studied. These results are used to verify that the proposed MOOCS-OPS scheme is feasible.  相似文献   
33.
This paper is concerned with large-O error estimates concerning convergence in distribution as well as norm convergence for Banach space-valued martingale difference sequences. Indeed, two general limit theorems equipped with rates of convergence for such difference sequences are established. Applications of these lead to the central limit theorem and the weak law of large numbers with rates for Banach space-valued martingales.  相似文献   
34.
Finite pulse durations in diverse pulse schemes lead to the reduction of the magnitude of the magnetization vector due to T1 and T2 effects during the radio-frequency pulses. This paper presents an analysis of the steady state signal in the presence of relaxation effects during radio-frequency pulses in MRI spoiled gradient echo sequences. It is shown that minor attenuations of the magnetization vector can have dramatic consequences on the measured signal, and may thus entail a loss in SNR benefits at high static magnetic fields if a careful analysis is not performed. It is emphasized that it is the time-integrated magnetization vector trajectory that matters for these effects and not only the pulse duration. Some experimental results obtained on a phantom at 3 T verify this analysis.  相似文献   
35.
36.
37.
The recursive network design used in this paper to monitor traffic flow ensures accurate anomaly identification. The suggested method enhances the effectiveness of cyber attacks in SDN. The suggested model achieves a remarkable attack detection performance in the case of distributed denial-of-service (DDoS) attacks by preventing network forwarding performance degradation. The suggested methodology is designed to teach users how to match traffic flows in ways that increase granularity while proactively protecting the SDN data plane from overload. The application of a learnt traffic flow matching control policy makes it possible to obtain the best traffic data for detecting abnormalities obtained during runtime, improving the performance of cyber-attack detection. The accuracy of the suggested model is superior to the MMOS, FMS, DATA, Q-DATA, and DEEP-MC by 19.23%, 16.25%, 47.61%, 16.25%, and 12.04%.  相似文献   
38.
Pure enantiomers of chiral (atropisomeric) polychlorinated biphenyls (PCBs) obtained by high-performance liquid chromatography were used to establish the gas chromatographic elution sequences of the (+)- and (−)-enantiomers of six PCB atropisomers on Chirasil-Dex. The elution order was found to be (−/+) for PCBs 84, 132, 136, and 176 and (+/−) for PCBs 135 and 174. The retention characteristics of all 19 tri- and tetra-ortho atropisomeric PCBs were also investigated. Nine of the atropisomers could be separated using this chiral selector. PCBs 95, 132, and 149 were completely resovled and PCBs 84, 91, 135, 136, 174, and 176 were partially separated (R = 0.7–0.9). All of the separated congeners are 2,3,6-substituted in at least one ring, and conversely – none of the congeners that lacks 2,3,6-substitution could be separated. Thus, chiral recognition and enantiomer separation seems to be strongly governed by 2,3,6-substitution.  相似文献   
39.
An algorithm for stabilizing linear iterative schemes is developed in this study. The recursive projection method is applied in order to stabilize divergent numerical algorithms. A criterion for selecting the divergent subspace of the iteration matrix with an approximate eigenvalue problem is introduced. The performance of the present algorithm is investigated in terms of storage requirements and CPU costs and is compared to the original Krylov criterion. Theoretical results on the divergent subspace selection accuracy are established. The method is then applied to the resolution of the linear advection–diffusion equation and to a sensitivity analysis for a turbulent transonic flow in the context of aerodynamic shape optimization. Numerical experiments demonstrate better robustness and faster convergence properties of the stabilization algorithm with the new criterion based on the approximate eigenvalue problem. This criterion requires only slight additional operations and memory which vanish in the limit of large linear systems.  相似文献   
40.
In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x 0 1 i /p} on [0, 1] fori=0, 1,..., (p–1)p–1–1, i.e. in current terminology, generators given byx n+1 1 x n mod p wheren=0, 1,..., (p–1)p –1–1,p is any odd prime, (x 0,p)=1, 1 is a primitive root modp 2, and 1 is any positive integer.We derive the expectationsE(X, ),E(X 2, ),E(X nXn+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of 1 for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号