首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   436篇
  免费   90篇
  国内免费   9篇
化学   24篇
力学   128篇
综合类   7篇
数学   127篇
物理学   72篇
无线电   177篇
  2025年   5篇
  2024年   20篇
  2023年   14篇
  2022年   15篇
  2021年   21篇
  2020年   21篇
  2019年   19篇
  2018年   16篇
  2017年   25篇
  2016年   32篇
  2015年   20篇
  2014年   28篇
  2013年   27篇
  2012年   30篇
  2011年   29篇
  2010年   17篇
  2009年   26篇
  2008年   16篇
  2007年   14篇
  2006年   19篇
  2005年   18篇
  2004年   12篇
  2003年   15篇
  2002年   12篇
  2001年   8篇
  2000年   10篇
  1999年   5篇
  1998年   5篇
  1997年   2篇
  1996年   4篇
  1995年   2篇
  1994年   4篇
  1993年   3篇
  1992年   1篇
  1991年   3篇
  1990年   2篇
  1988年   4篇
  1987年   1篇
  1986年   1篇
  1985年   2篇
  1982年   2篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1977年   1篇
  1971年   1篇
排序方式: 共有535条查询结果,搜索用时 15 毫秒
31.
Due to the extensive applications of nonnegative matrix factorizations (NMFs) of nonnegative matrices, such as in image processing, text mining, spectral data analysis, speech processing, etc., algorithms for NMF have been studied for years. In this paper, we propose a new algorithm for NMF, which is based on an alternating projected gradient (APG) approach. In particular, no zero entries appear in denominators in our algorithm which implies no breakdown occurs, and even if some zero entries appear in numerators new updates can always be improved in our algorithm. It is shown that the effect of our algorithm is better than that of Lee and Seung’s algorithm when we do numerical experiments on two known facial databases and one iris database.  相似文献   
32.
In this paper we discuss the index of the complex eigenvalue of a parity progressive population operator. Under certain conditions, we first prove that all the complex eigenvalues of this operator, except at most finitely many ones, are of index 1, and then, as an application of this result, we obtain the asymptotic expansion of the solution of the corresponding parity progressive population equation.  相似文献   
33.
Let ∑, Г be two n-by-n diagonal matrices with σi,γi as their diagonals. For the inverse eigenvalue problem: look for y∈Rn such that Г + yyT is similar to ∑, we prove thatu also the sufficient condition for the solvability of this inverse problem. Its solution (set) is given explicitly. In some case, the problem is unstable. But we prove that the sums of the square of some contigious components keep stable, i.e., small sum keeps small, large sum has a small relative perturbation, see Theorem 3.  相似文献   
34.
本文对逐步增加Ⅱ型截尾下指数分布场合恒定应力加速寿命试验进行了统计分析,得到参数的最大似然估计存在唯一的充要条件。最后通过模拟例子表明最大似然估计是有效的。  相似文献   
35.
基于对偶性原理捷联惯导划船误差补偿优化算法   总被引:1,自引:0,他引:1  
先介绍了算法的对偶性原理,并根据此原理和圆锥误差补偿的一般形式,得到了陀螺和加速度计任意子样数下划船误差补偿的一般形式;然后在经典的划船运动条件下,对划船误差补偿算法的系数进行优化,得到了优化后的通用公式及其算法漂移;最后,通过对圆锥误差算法和划船误差算法的复杂度、算法漂移的比较,得出一些有益结论。基于该方法可以充分利用圆锥误差算法的已有结果,由计算机编程计算得到划船误差补偿的任意子样数算法,无需繁琐的重复性推导。  相似文献   
36.
探讨了常微分方程初值问题解的存在唯一性定理教学策略.为便于教学和有利于学生理解并掌握其思想方法,对定理证明过程的表述作了命题化处理,给出了Picard逐步逼近法的应用实例,提出了教学讨论与知识拓展的一些有益内容.  相似文献   
37.
    
Point estimators for the parameters of the component lifetime distribution in coherent systems are evolved assuming to be independently and identically Weibull distributed component lifetimes. We study both complete and incomplete information under continuous monitoring of the essential component lifetimes. First, we prove that the maximum likelihood estimator (MLE) under complete information based on progressively Type‐II censored system lifetimes uniquely exists and we present two approaches to compute the estimates. Furthermore, we consider an ad hoc estimator, a max‐probability plan estimator and the MLE for the parameters under incomplete information. In order to compute the MLEs, we consider a direct maximization of the likelihood and an EM‐algorithm–type approach, respectively. In all cases, we illustrate the results by simulations of the five‐component bridge system and the 10‐component parallel system, respectively.  相似文献   
38.
    
The Turán number of a graph H, , is the maximum number of edges in any graph of order n that does not contain an H as a subgraph. A graph on vertices consisting of k triangles that intersect in exactly one common vertex is called a k‐fan, and a graph consisting of k cycles that intersect in exactly one common vertex is called a k‐flower. In this article, we determine the Turán number of any k‐flower containing at least one odd cycle and characterize all extremal graphs provided n is sufficiently large. Erdős, Füredi, Gould, and Gunderson determined the Turán number for the k‐fan. Our result is a generalization of their result. The addition aim of this article is to draw attention to a powerful tool, the so‐called progressive induction lemma of Simonovits.  相似文献   
39.
    
《Physics letters. A》2020,384(11):126224
Epidemic spreading has been widely investigated over the past decades. And voluntary vaccination has been often utilized to explore dynamical process in epidemics where vaccines are available. In this letter, we establish a framework considering conformity motivated update as well as myopic best response motivated update on a family network which is demonstrated by a two-layered network. Extensive numerical simulations are conducted to study the dynamics of epidemic spreading under the aforementioned update rules, from which we discover the oscillation phenomenon under the pure myopic best response condition and the amplitude diversification phenomenon under the mixing of conformity and myopic best response motivated conditions. Moreover, we find that smaller overlapping fraction of links on two-layered network shall promote the epidemic propagation. The current findings can shed some lights on the evolution of epidemic spreading process in the real-world scenarios.  相似文献   
40.
    
The major challenge in wireless body area networks (WBAN) is setting up a protected communication between data consumers and a body area network controller while meeting the security and privacy requirements. This paper proposes efficient and secure data communication in WBANs using a Twofish symmetric algorithm and ciphertext‐policy attribute‐based encryption with constant size ciphertext; in addition, the proposed scheme incorporates policy updating to update access policies. To the best of the author's knowledge, policy updating in WBAN has not been studied in earlier works. The proposed scheme is evaluated in terms of message size, energy consumption, and computation cost, and the results are compared with those of existing schemes. The result shows that the proposed method can achieve higher efficiency than conventional methods.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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