首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   250篇
  免费   29篇
  国内免费   29篇
化学   12篇
力学   17篇
综合类   7篇
数学   181篇
物理学   91篇
  2023年   2篇
  2022年   3篇
  2021年   2篇
  2020年   4篇
  2019年   9篇
  2018年   7篇
  2017年   5篇
  2016年   10篇
  2015年   5篇
  2014年   20篇
  2013年   28篇
  2012年   8篇
  2011年   18篇
  2010年   10篇
  2009年   11篇
  2008年   13篇
  2007年   7篇
  2006年   17篇
  2005年   14篇
  2004年   13篇
  2003年   18篇
  2002年   12篇
  2001年   9篇
  2000年   6篇
  1999年   8篇
  1998年   10篇
  1997年   8篇
  1996年   4篇
  1995年   5篇
  1994年   4篇
  1993年   2篇
  1992年   1篇
  1991年   4篇
  1989年   3篇
  1988年   3篇
  1987年   1篇
  1985年   2篇
  1980年   1篇
  1977年   1篇
排序方式: 共有308条查询结果,搜索用时 15 毫秒
1.
龙光芝  陈瀛  陈敬中 《大学物理》2006,25(3):17-20,37
从理论上对准晶体中八方晶系各点群进行了研究.运用八方晶系各点群的极赤投影图,列出了各点群的所有对称操作;填出了固有点群822的群乘表.运用坐标变换和群论在自定义的八方坐标系中,推导出八方晶系点群所有对称操作的矩阵.这32个3×3矩阵的结构是相当简洁的,它们的矩阵元只有5种可能取值:0,±1,±2.其中2是反映八方晶系准晶体所具有的准周期性的特殊无理数.  相似文献   
2.
A novel scheme for all-optical frequency multiplication/recovery based on a semiconductor optical amplifier ring cavity is proposed and investigated numerically. The results show, for a 2.5 GHz driving pulse train, it can be generated 5-25 GHz repetition rate pulse trains with low clock amplitude jitter, polarization independence and high peak power. Furthermore, the extraction of the clock signal from a pseudorandom bit sequence signal can be realized based on the proposed scheme.  相似文献   
3.
INTERSECTION OF PRIME SUBMODULES AND DIMENSION OF MODULES   总被引:1,自引:0,他引:1  
The aim of this paper is to study the conditions by which a P-prime submodule can be expressed as a finite intersection or union of P-prime submodules. Also corresponding to dimension and rank of modules, some equivalent conditions for a ring to be a Dedekind domain are given.  相似文献   
4.
In this paper we characterize weak multiplication modules.  相似文献   
5.
Montgomery Multiplication in GF(2k)   总被引:8,自引:0,他引:8  
We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.  相似文献   
6.
Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.  相似文献   
7.
Winograd矩阵乘法算法用于任意阶矩阵时的一种新处理方法   总被引:3,自引:0,他引:3  
摘要t矩阵乘法StraSsen算法及其变形winograd算法用分而治之的方法把矩阵乘法时间复杂性由传统的D(n。)改进到0(佗kg。n.但是对于奇数阶矩阵,在划分子矩阵时,要作特殊处理才能继续使用此算法.本文提出了一种非等阶“十”字架划分方法,可以最少化填零,最大化性能,使得奇数阶矩阵乘法的时间复杂性更加接近偶数阶矩阵乘法的效果.计算实例显示该方法是有效的.  相似文献   
8.
The purpose of this paper is to decide the conditions under which a CM elliptic curve is modular over its field of definition.  相似文献   
9.
邻羟基苯甲酸(oHBA)和间羟基苯甲酸(mHBA)荧光光谱严重重叠,同步及导数技术虽使选择性有所改善,但仍不能完全分辨开重叠谱。用双峰倍增配平计算法结合同步、一阶导数-同步荧光法对双组分体系(邻羟基苯甲酸/间羟基苯甲酸,pH12介质)同时测定。结合计算的两种测定方法精密度、回收率和不同组分间浓度比范围均优于一阶导数-同步荧光法。  相似文献   
10.
Imines of (1S,9S)-t-butyl-9-amino-octahydro-6,10-dioxo-6H-pyridazino[1,2-a][1,2]diazepine-1-carboxylate undergo thermal (toluene, 110°C) or LiBr-DBU catalysed (MeCN, room temperature) regio- and stereo-specific cycloaddition to a range of chiral dipolarophiles giving enantiopure spiro-cycloadducts in excellent yield. The reactions proceed via intermediate NH azomethine ylides and litho azomethine ylides, respectively and results in the multiplication of chiral centres from 2 (one of which is lost in the process) to 5.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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