首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3859篇
  免费   512篇
  国内免费   234篇
化学   875篇
晶体学   99篇
力学   189篇
综合类   100篇
数学   1130篇
物理学   2212篇
  2024年   5篇
  2023年   38篇
  2022年   130篇
  2021年   116篇
  2020年   101篇
  2019年   85篇
  2018年   78篇
  2017年   141篇
  2016年   147篇
  2015年   118篇
  2014年   222篇
  2013年   247篇
  2012年   155篇
  2011年   200篇
  2010年   197篇
  2009年   322篇
  2008年   249篇
  2007年   265篇
  2006年   237篇
  2005年   176篇
  2004年   157篇
  2003年   142篇
  2002年   115篇
  2001年   120篇
  2000年   102篇
  1999年   93篇
  1998年   114篇
  1997年   89篇
  1996年   58篇
  1995年   60篇
  1994年   54篇
  1993年   42篇
  1992年   38篇
  1991年   26篇
  1990年   32篇
  1989年   19篇
  1988年   25篇
  1987年   24篇
  1986年   7篇
  1985年   4篇
  1984年   13篇
  1983年   6篇
  1982年   6篇
  1981年   4篇
  1980年   7篇
  1979年   2篇
  1978年   3篇
  1977年   2篇
  1973年   2篇
  1972年   8篇
排序方式: 共有4605条查询结果,搜索用时 15 毫秒
1.
一种新型彩色三维光学成像系统   总被引:7,自引:4,他引:3  
张宗华  彭翔  胡小唐 《光学学报》2002,22(8):94-998
提出一种新型三维彩色光学数字成像系统。此系统利用投影结构光对现实世界中的物体进行数字化,同时得到对应的彩色纹理。详细介绍了系统的硬件设计和软件体系结构设计,得到物体彩色纹理的两种不同方法;直接获取和从编码条纹中提取,给出了用该系统得到的实验结果并简单评价了系统的性能。此系统在反求工程、影视制作、三维游戏制作、医学应用等方面有远大的应用前景。  相似文献   
2.
Bit-parallel approximate string matching algorithms with transposition   总被引:1,自引:0,他引:1  
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(mk)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.  相似文献   
3.
To investigate the position and amount of the CF3 group affecting the coloration of polyimides (PIs), we prepared 2,2‐bis[4‐(4‐amino‐2‐trifluoromethylphenoxy)phenyl]hexafluoropropane ( 2 ) with four CF3 groups with 2‐chloro‐5‐nitrobenzotrifluoride and 2,2‐bis(4‐hydroxyphenol)hexafluoropropane. A series of soluble and light‐colored fluorinated PIs ( 5 ) were synthesized from 2 and various aromatic dianhydrides ( 3a – 3f ). 5a – 5f had inherent viscosities ranging from 0.80 to 1.19 dL/g and were soluble in amide polar solvents and even in less polar solvents. The glass‐transition temperatures of 5 were 221–265 °C, and the 10% weight‐loss temperatures were above 493 °C. Their films had cutoff wavelengths between 343 and 390 nm, b* values (a yellowness index) ranging from 5 to 41, dielectric constants of 2.68–3.01 (1 MHz), and moisture absorptions of 0.03–0.29 wt %. In a comparison of the PI series 6 – 8 based on 2,2‐bis[4‐(4‐aminophenoxy)phenyl]hexafluoropropane, 2,2‐bis[4‐(4‐amino‐2‐trifluoromethylphenoxy)phenyl]propane, and 2,2‐bis[4‐(4‐aminophenoxy)phenyl]propane, we found that the CF3 group close to the imide group was more effective in lowering the color; this means that CF3 of 5 , 7 , and 8f was more effective than that of 6c . The color intensity of the four PI series was lowered in the following order: 5 > 7 > 6 > 8 . The PI 5f , synthesized from diamine 2 and 4,4′‐hexafluoroisopropylidenediphthalic anhydride, had six CF3 groups in a repeated segment, so it exhibited the lightest color among the four series. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 922–938, 2003  相似文献   
4.
We measured the entire region of mesopic and photopic vision to determine the color zone covering the visual field with unique red, yellow, green, and blue hue components. Eight kinds of test stimuli in the natural color system (NCS) color notation system were used. These stimuli were presented at horizontal and vertical meridians, and at meridians inclined at 45° angles. The illuminance level was set at six levels: 0.01 lx-1000 lx. The evaluation method measured chromatic, white, and black components as well as the hue component of the stimuli. Results show that the color zone of the retina extended further into the periphery with increasing illuminance; the response of opponent colors y-b was shown to be greater than that of the opponent colors r-g.  相似文献   
5.
Photopolymerization of cadmium 10,12-pentacosadiynoate (CdDA) in Langmuir–Blodgett (LB) films, with the molecular packing well arranged by moderate preannealing, was investigated with near-edge X-ray absorption fine structure (NEXAFS) spectroscopy. Greenish films of polydiacetylene with an absorption wavelength of 705 nm were obtained through the photopolymerization of preannealed monomer LB films, and this resulted in an extended π-conjugate system based on the well-ordered monomer in a two-dimensional arrangement. The electronic structures of the polydiacetylenes were found to be correlated to the variation of the molecular arrangements in the films from the changes in the NEXAFS spectra through photopolymerization in the LB films. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2329–2336, 2004  相似文献   
6.
马俊  高成修 《数学杂志》2003,23(2):181-184
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。  相似文献   
7.
For a graph G and a positive integer m, G(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m2 edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G(2) does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G(2) does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003  相似文献   
8.
研究了Eu(2+):BaFxCl2在紫外线辐照下的光激励发光。通过改变激励方式及激励光的扫描方向,给出了Eu(2+):BaFxCl2-x光激励发光过程中,两种F色心的浓度比值与光激励截面比值的测定方法。利用这种测定方法,进一步研究了两种F色心的浓度比值和光激励截面比值与F/CI比值的关系。  相似文献   
9.
This paper focuses on the different ways in which students in lower secondary school (14–16 year olds) experience compound random events, presented to them in the form of combined junctions. A carefully designed ICT environment was developed enabling the students to interact with different representations of such structures. Data for the analysis was gathered from two interview sessions. The analysis of the interaction is based on constructivist principles on learning; i.e. we adopted a student-oriented perspective, taking into consideration the different ways students try to make sense of chance encounters. Our results show how some students give priority to geometrical and physical concerns, and we discuss how seeking causal explanations of random phenomena may have encouraged this. With respect to numerically oriented models a division strategy appears to stand out as the preferred one.  相似文献   
10.
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog2n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m3logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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