首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   553篇
  免费   60篇
  国内免费   42篇
化学   26篇
力学   3篇
综合类   21篇
数学   523篇
物理学   82篇
  2024年   3篇
  2023年   3篇
  2022年   27篇
  2021年   24篇
  2020年   15篇
  2019年   20篇
  2018年   19篇
  2017年   22篇
  2016年   24篇
  2015年   15篇
  2014年   19篇
  2013年   52篇
  2012年   16篇
  2011年   23篇
  2010年   29篇
  2009年   31篇
  2008年   26篇
  2007年   31篇
  2006年   29篇
  2005年   38篇
  2004年   19篇
  2003年   22篇
  2002年   25篇
  2001年   13篇
  2000年   17篇
  1999年   12篇
  1998年   17篇
  1997年   12篇
  1996年   13篇
  1995年   7篇
  1994年   9篇
  1993年   5篇
  1992年   1篇
  1991年   3篇
  1990年   1篇
  1989年   1篇
  1988年   1篇
  1987年   2篇
  1986年   1篇
  1985年   1篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1977年   1篇
  1973年   1篇
  1970年   1篇
  1969年   1篇
排序方式: 共有655条查询结果,搜索用时 15 毫秒
121.
Recently, a number of chaos-based image encryption algorithms that use low-dimensional chaotic map and permutation-diffusion architecture have been proposed. However, low-dimensional chaotic map is less safe than high-dimensional chaotic system. And permutation process is independent of plaintext and diffusion process. Therefore, they cannot resist efficiently the chosen-plaintext attack and chosen-ciphertext attack. In this paper, we propose a hyper-chaos-based image encryption algorithm. The algorithm adopts a 5-D multi-wing hyper-chaotic system, and the key stream generated by hyper-chaotic system is related to the original image. Then, pixel-level permutation and bit-level permutation are employed to strengthen security of the cryptosystem. Finally, a diffusion operation is employed to change pixels. Theoretical analysis and numerical simulations demonstrate that the proposed algorithm is secure and reliable for image encryption.  相似文献   
122.
Is a semiprimary right self-injective ring a quasi-Frobenius ring? Almost half century has passed since Faith raised this problem. He first conjectured “No” in his book Algebra II. Ring Theory in 1976, but changing his mind, he conjectured “Yes” in his article “When self-injective rings are QF: a report on a problem” in 1990. In this paper, we describe recent studies of this problem based on authors works and raise related problems.  相似文献   
123.
如果存在正整数k使得对于D中任意两点u和v(允许u=v),在D中都有从u到v的长为k的有向途径,则称有向图D是本原的.给有向图的每条弧赋以符号+1或者-1得到的图S称为带号有向图.如果带号有向图S中包含SSSD途径对,即包含两条有相同的起点,相同的终点,相同的长度,并且有不同的符号的途径对,则称S是不可幂的.在本文中,我们将Lewin M提出的lewin数的概念从本原有向图推广到本原不可幂带号有向图,给出了本原不可幂带号有向图S的lewin数l(S)的若干上界,并提出了一个公开问题.  相似文献   
124.
杜萌  金宁德  高忠科  朱雷  王振亚 《物理学报》2012,61(23):113-121
采用多尺度排列熵算法研究了垂直油水两相流水包油流型的多尺度动力学特性.首先,在内径为20 mm的垂直管道内采集了油水两相流水包油流型电导传感器波动信号,然后计算了不同流动工况下电导波动信号的多尺度排列熵值.研究发现多尺度排列熵率与均值可定量刻画水包油流型动力学复杂性;此外,提出了通过增量时间序列累积量与多尺度排列熵率联合分布识别三种不同水包油流型的新途径.  相似文献   
125.
Let X be a v‐set, be a set of 3‐subsets (triples) of X, and be a partition of with . The pair is called a simple signed Steiner triple system, denoted by ST, if the number of occurrences of every 2‐subset of X in triples is one more than the number of occurrences in triples . In this paper, we prove that exists if and only if , , and , where and for , . © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 332–343, 2012  相似文献   
126.
本文首先证明了k-全控制问题和符号全控制问题在双弦图上均为NP-完全的.其次,在强消去序已给定的强弦图上,给出了求解符号全控制、负全控制、k-全控制和k-全控制问题的统一的O(m+n)时间算法.  相似文献   
127.
The exact solutions with arbitrary permutation symmetry to the threebody Schrödinger equation for the harmonic oscillator are presented completely.  相似文献   
128.
本是通过在连通置换图中构造辅助树的方法,给出了一个在具有n个顶点的置换图G中寻找深度优先支撑树(简称,DFS树)的最优算法,并证明了该算法的时间复杂性为O(n)。  相似文献   
129.
Insomnia is a common sleep disorder that is closely associated with the occurrence and deterioration of cardiovascular disease, depression and other diseases. The evaluation of pharmacological treatments for insomnia brings significant clinical implications. In this study, a total of 20 patients with mild insomnia and 75 healthy subjects as controls (HC) were included to explore alterations of electroencephalogram (EEG) complexity associated with insomnia and its pharmacological treatment by using multi-scale permutation entropy (MPE). All participants were recorded for two nights of polysomnography (PSG). The patients with mild insomnia received a placebo on the first night (Placebo) and temazepam on the second night (Temazepam), while the HCs had no sleep-related medication intake for either night. EEG recordings from each night were extracted and analyzed using MPE. The results showed that MPE decreased significantly from pre-lights-off to the period during sleep transition and then to the period after sleep onset, and also during the deepening of sleep stage in the HC group. Furthermore, results from the insomnia subjects showed that MPE values were significantly lower for the Temazepam night compared to MPE values for the Placebo night. Moreover, MPE values for the Temazepam night showed no correlation with age or gender. Our results indicated that EEG complexity, measured by MPE, may be utilized as an alternative approach to measure the impact of sleep medication on brain dynamics.  相似文献   
130.
IntroductionLetΓ0 beasmoothconnectedhypersurfaceanditistheboundaryofaboundedopensetU Rn.Supposethatt0 isatime ,M =M(x) ∈C3withM( 0 ) =0 ,M′(x) >0 ,andl1,l2 ,… ,lnarepositiverealnumbers.{Γt} 0 ≤t≤t0 isaclassicalsmoothsurface,anditistheboundaryofaboundedopensetUt,whichisdiff…  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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