全文获取类型
收费全文 | 964篇 |
免费 | 26篇 |
国内免费 | 9篇 |
专业分类
化学 | 79篇 |
力学 | 6篇 |
综合类 | 6篇 |
数学 | 72篇 |
物理学 | 176篇 |
无线电 | 660篇 |
出版年
2024年 | 4篇 |
2023年 | 13篇 |
2022年 | 33篇 |
2021年 | 34篇 |
2020年 | 35篇 |
2019年 | 16篇 |
2018年 | 13篇 |
2017年 | 30篇 |
2016年 | 56篇 |
2015年 | 60篇 |
2014年 | 88篇 |
2013年 | 72篇 |
2012年 | 58篇 |
2011年 | 49篇 |
2010年 | 44篇 |
2009年 | 81篇 |
2008年 | 71篇 |
2007年 | 21篇 |
2006年 | 40篇 |
2005年 | 35篇 |
2004年 | 35篇 |
2003年 | 25篇 |
2002年 | 28篇 |
2001年 | 6篇 |
2000年 | 11篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有999条查询结果,搜索用时 9 毫秒
111.
对ADSP Tiger SHARC 101S的在最小二乘恒模算法中的应用进行了研究。首先介绍了最小二乘恒模算法基本原理和权值迭代公式,然后介绍了ADSP Tiger SHARC 101S芯片的基本结构特征和他强大的功能,并简单描述了其相应开发软件Visual DSP^ 3.0的功能及使用方法.给出了最小二乘恒模算法实现波束合成的具体流程图,在经过Matlab软件成功进行仿真模拟之后用Visual DSP^ 3.0设计了DSP程序,用C语言嵌套部分汇鳊语言的形式实现了用ADSP Tiger SHARC 101S进行迭代求权向量的过程。 相似文献
112.
基于IEKF视觉运动分析递归算法的研究 总被引:1,自引:1,他引:0
本文提出基于图象序列上特征点的图象平面轨迹进行运动参数估计,以提取运动物体的姿态、速度以及外部环境内所感兴趣点的位置参数,由于图象特征点轨迹与待估计的参数有关,因此能够组合长序列图象内的信息并利用IEKF递归地估计未知的运动及结构参数。 相似文献
113.
基于视觉误差准则的矢量量化编码 总被引:2,自引:1,他引:1
传统矢量量化编码一般采用绝对误差为误差度量准则,并不符合人类视知觉的特性,本文根据人的视觉感知规律,定义了一种可广泛用于图象编码的视觉误差准则,由此导出了一种新的矢量量化编码方法,实验表明,采用这种方法得到的解码图象在视觉效果比传统方法有较大改善。 相似文献
114.
This article reports the design and implementation of a graphical display that presents an approximation to vocal tract area in real time for voiced vowel articulation. The acoustic signal is digitally sampled by the system. From these data a set of reflection coefficients is derived using linear predictive coding. A matrix of area coefficients is then determined that approximates the vocal tract area of the user. From this information a graphical display is then generated. The complete cycle of analysis and display is repeated at ≈20 times/s. Synchronised audio and visual sequences can be recorded and used as dynamic targets for articulatory development. Use of the system is illustrated by diagrams of system output for spoken cardinal vowels and for vowels sung in a trained and untrained style 相似文献
115.
用VB6.0设计了密立根油滴数据处理系统,通过VB内部程序操纵Excel应用程序,运用ActiveX技术调用Excel,解决实验数据计算量大,计算过程繁琐复杂的问题,从而提高了实验效率。 相似文献
116.
Fahad Sultan Salah Hamodeh Yusuke Murayama Kadharbatcha S. Saleem Nikos Logothetis 《Magnetic resonance imaging》2010
Flattened representations are a useful approach to represent the convoluted complex surface of the neocortex of primates and other large-brained mammals. In this study, we compared the flattened representation of neocortical areas obtained from the recently published MRI and histology atlas of the rhesus monkey brain (Saleem KS, Logothetis NK. A combined MRI and histology atlas of the rhesus monkey brain in stereotaxic coordinates. London: Academic; 2007) with other previously published maps. Our results confirm that flat map representations are advantageous due to their ease of use and that current flat maps are well comparable to each other. Some differences arise due to different distinguishing criteria and here too flat maps can help to reveal them. 相似文献
117.
A general multi-secret visual cryptography scheme 总被引:1,自引:0,他引:1
In a (k, n) visual cryptography scheme (VCS), a secret image is encoded into n shadow images that are distributed to n participants. Any k participants can reveal the secret image by stacking their shadow images, and less than k participants have no information about the secret image. In this paper we consider the case when the secret image is more than one, and this is a so-called multi-secret VCS (MVCS). The previous works on MVCS are all the simple 2-out-of-2 cases. In this paper, we discuss a general (k, n)-MVCS for any k and n. This paper has three main contributions: (1) our scheme is the first general (k, n)-MVCS, which can be applied on any k and n, (2) we give the formal security and contrast conditions of (k, n)-MVCS and (3) we theoretically prove that the proposed (k, n)-MVCS satisfies the security and contrast conditions. 相似文献
118.
119.
120.
Niladri Roy Chowdhury Dianne Cook Heike Hofmann Mahbubul Majumder 《Journal of computational and graphical statistics》2018,27(1):132-145
Graphics play a crucial role in statistical analysis and data mining. Being able to quantify structure in data that is visible in plots, and how people read the structure from plots is an ongoing challenge. The lineup protocol provides a formal framework for data plots, making inference possible. The data plot is treated like a test statistic, and lineup protocol acts like a comparison with the sampling distribution of the nulls. This article describes metrics for describing structure in data plots and evaluates them in relation to the choices that human readers made during several large Amazon Turk studies using lineups. The metrics that were more specific to the plot types tended to better match subject choices, than generic metrics. The process that we followed to evaluate metrics will be useful for general development of numerically measuring structure in plots, and also in future experiments on lineups for choosing blocks of pictures. Supplementary materials for this article are available online. 相似文献