首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   117篇
  免费   1篇
  国内免费   1篇
化学   42篇
力学   1篇
数学   27篇
物理学   49篇
  2022年   2篇
  2019年   2篇
  2018年   2篇
  2016年   3篇
  2014年   3篇
  2013年   7篇
  2012年   13篇
  2011年   13篇
  2010年   8篇
  2009年   3篇
  2008年   2篇
  2007年   4篇
  2006年   5篇
  2005年   5篇
  2004年   6篇
  2003年   6篇
  2002年   7篇
  2001年   1篇
  2000年   3篇
  1999年   3篇
  1998年   1篇
  1995年   1篇
  1994年   4篇
  1993年   1篇
  1992年   1篇
  1991年   2篇
  1990年   1篇
  1986年   1篇
  1984年   1篇
  1983年   1篇
  1981年   1篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1976年   2篇
  1971年   1篇
排序方式: 共有119条查询结果,搜索用时 15 毫秒
61.
Multiple vortices with different topological charges are formed by the use of two sequential geometric phase elements. These elements are realized by quasi-periodic subwavelength gratings. The first element is a spiral phase element and the second element is a spherical phase element. We provide a theoretical analysis and an experimental demonstration of the formation of the multiple vortices that comprise scalar vortices and a vectorial vortex.  相似文献   
62.
We show that if a language has an interactive proof of logarithmic statistical knowledge-complexity, then it belongs to the class . Thus, if the polynomial time hierarchy does not collapse, then -complete languages do not have logarithmic knowledge complexity. Prior to this work, there was no indication that would contradict languages being proven with even one bit of knowledge. Our result is a common generalization of two previous results: The first asserts that statistical zero knowledge is contained in [11, 2], while the second asserts that the languages recognizable in logarithmic statistical knowledge complexity are in [19]. Next, we consider the relation between the error probability and the knowledge complexity of an interactive proof. Note that reducing the error probability via repetition is not free: it may increase the knowledge complexity. We show that if the negligible error probability is less than (where k(n) is the knowledge complexity) then the language proven is in the third level of the polynomial time hierarchy (specifically, it is in ). In the standard setting of negligible error probability, there exist PSPACE-complete languages which have sub-linear knowledge complexity. However, if we insist, for example, that the error probability is less than , then PSPACE-complete languages do not have sub-quadratic knowledge complexity, unless . In order to prove our main result, we develop an AM protocol for checking that a samplable distribution D has a given entropy h. For any fractions , the verifier runs in time polynomial in and and fails with probability at most to detect an additive error in the entropy. We believe that this protocol is of independent interest. Subsequent to our work Goldreich and Vadhan [16] established that the problem of comparing the entropies of two samplable distributions if they are noticeably different is a natural complete promise problem for the class of statistical zero knowledge (). Received January 6, 2000 RID=" " ID=" " This research was performed while the authors were visiting the Computer Science Department at the University of Toronto, preliminary version of this paper appeared in [27] RID="*" ID="*" Partially supported by Technion V. P. R. Found––N. Haar and R. Zinn Research Fund. RID="†" ID="†" Partially supported by the grants OTKA T-029255, T-030059, FKFP 0607/1999, and AKP 2000-78 2.1.  相似文献   
63.
Let be a quadratic extension of number fields and , where is a reductive group over . We define the integral (in general, non-convergent) of an automorphic form on over via regularization. This regularized integral is used to derive a formula for the integral over of a truncated Eisenstein series on . More explicit results are obtained in the case . These results will find applications in the expansion of the spectral side of the relative trace formula.

  相似文献   

64.
Let L(s,π,r) be an L-function which appears in the Langlands–Shahidi theory. We give a lower bound for L(s,π,r) when R(s)=1 using Eisenstein series. This method is applicable even when L(s,π,r) is not known to be absolutely convergent for R(s)>1. To cite this article: S.S. Gelbart et al., C. R. Acad. Sci. Paris, Ser. I 339 (2004).  相似文献   
65.
We present a novel method for forming linearly polarized axially symmetric beams with various polarization orders that is based on computer-generated space-variant subwavelength gratings. We introduce and experimentally demonstrate that our space-variant polarization state manipulations are accompanied by a phase modification of a helical structure that results from the Pancharatnam-Berry phase. We have verified the polarization properties of our gratings for laser radiation at 10.6-microm wavelength.  相似文献   
66.
Ribak EN  Ragazzoni R 《Optics letters》2004,29(12):1351-1353
Adaptive optics systems measure the wave front to be corrected by use of a reference source, a star, or a laser beacon. Such laser guide stars are a few kilometers long, and when observed near the edges of large telescopes they appear elongated. This limits their utility significantly. However, with more sophisticated launch optics their shape and length can be controlled. We propose to string around the rim of a telescope a number of small telescopes that will add laser beams in the scattering medium to create a compact spot. The method could also be adapted for ocular adaptive optics.  相似文献   
67.
Propagation-invariant vectorial Bessel beams with linearly polarized axial symmetry based on quantized Pancharatnam-Berry phase optical elements are described. The geometric phase is formed through the use of discrete computer-generated space-variant subwavelength dielectric gratings. We have verified the polarization properties of our elements for laser radiation at 10.6-microm wavelength and also demonstrated propagation-invariant, controlled rotation of a propeller-shaped intensity pattern through the simple rotation of a polarizer.  相似文献   
68.
Polymer alternatives sourced from nature have attracted increasing attention for applications in medicine, cosmetics, agriculture, food, water purification, and more. Among them, chitosan is the most versatile due to its full biodegradability, exceptional biocompatibility, multipurpose bioactivity, and low toxicity. Although remarkable progress has been made in its synthetic modification by using C3/C6 secondary/primary hydroxy (−OH) and the C2 amino (−NH2) active sites, its solubility under physiological conditions remains limited and has hampered larger-scale adoption. This review summarizes different synthetic methods that increase chitosan‘s hydrophilicity and water solubility by using covalent modifications, namely amino acid addition, quaternary ammonium formation, phosphorylation, and carboxymethylation. We also review several applications for each type of substitution in fields such as cosmetics, medicine, agriculture, and water purification, and provide an outlook and perspective for future modifications and implementations.  相似文献   
69.
One of the most puzzling aspects of the high Tc superconductors is the appearance of Fermi arcs in the normal state of the underdoped cuprate materials. These are loci of low energy excitations covering part of the Fermi surface that suddenly appear above Tc instead of the nodal quasiparticles. Based on a semiclassical theory, we argue that partial Fermi surfaces arise naturally in a d-wave superconductor that is destroyed by thermal phase fluctuations. Specifically, we show that the electron spectral function develops a square root singularity at low frequencies for wave vectors positioned on the bare Fermi surface. We predict a temperature dependence of the arc length that can partially account for the results of recent angle resolved photoemission experiments.  相似文献   
70.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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