首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   42481篇
  免费   3279篇
  国内免费   1987篇
化学   21014篇
晶体学   147篇
力学   1460篇
综合类   972篇
数学   12071篇
物理学   12083篇
  2023年   311篇
  2022年   1031篇
  2021年   1628篇
  2020年   797篇
  2019年   925篇
  2018年   725篇
  2017年   893篇
  2016年   1170篇
  2015年   1108篇
  2014年   1613篇
  2013年   2461篇
  2012年   1696篇
  2011年   1936篇
  2010年   1791篇
  2009年   2327篇
  2008年   2475篇
  2007年   2633篇
  2006年   1990篇
  2005年   1358篇
  2004年   1244篇
  2003年   1251篇
  2002年   3716篇
  2001年   1409篇
  2000年   931篇
  1999年   772篇
  1998年   776篇
  1997年   571篇
  1996年   615篇
  1995年   522篇
  1994年   503篇
  1993年   560篇
  1992年   546篇
  1991年   348篇
  1990年   316篇
  1989年   270篇
  1988年   285篇
  1987年   206篇
  1986年   228篇
  1985年   342篇
  1984年   254篇
  1983年   164篇
  1982年   307篇
  1981年   470篇
  1980年   428篇
  1979年   474篇
  1978年   379篇
  1977年   285篇
  1976年   239篇
  1974年   75篇
  1973年   154篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
171.
We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.  相似文献   
172.
Chen  Shan-Tai  Lin  Shun-Shii  Huang  Li-Te  Wei  Chun-Jen 《Journal of Heuristics》2004,10(3):337-355
Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks.  相似文献   
173.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.  相似文献   
174.
Abdullah Bal   《Optik》2004,115(7):295-300
A new type of optoelectronic cellular neural network has been developed by providing the capability of coefficients adjusment of cellular neural network (CNN) using Widrow based perceptron learning algorithm. The new supervised cellular neural network is called Widrow-CNN. Despite the unsupervised CNN, the proposed learning algorithm allows to use the Widrow-CNN for various image processing applications easily. Also, the capability of CNN for image processing and feature extraction has been improved using basic joint transform correlation architecture. This hardware application presents high speed processing capability compared to digital applications. The optoelectronic Widrow-CNN has been tested for classic CNN feature extraction problems. It yields the best results even in case of hard feature extraction problems such as diagonal line detection and vertical line determination.  相似文献   
175.
176.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
177.
A new double pass long wavelength band erbium-doped fiber amplifier with enhanced noise figure characteristics is demonstrated. The noise figure is improved by about 2.6 dB with the incorporation of broadband conventional-band fiber Bragg grating (FBG) in between the two segments of erbium-doped fiber. By incorporating both the pre-amplifier and the FBG, the noise figure is further improved, which varies from 4.0 to 5.0 dB in the flat gain region from 1570 to 1600 nm. The gain varies from 32.0 to 33.4 dB within this region. The new amplifier with high gain and low noise figure can be useful as an inline amplifier in a wavelength division multiplexing transmission system.  相似文献   
178.
The magnetic structures of Mn1-xFexWO4 with x = 0.0, 0.16, 0.21, 0.225, 0.232, 0.24, 0.27, 0.29, and 1.0 were refined from neutron powder diffraction data. The magnetic phase diagram could be completed in the coexistence range of different magnetic structures up to x = 0.29. For the magnetic state at 1.5 K a commensurate antiferromagnetic structure with a propagation vector = (±1/4, 1/2, 1/2) was found for x ⩽ 0.22 while the magnetic spins order with = (1/2, 0, 0) for x ≥ 0.22. In the latter phase, additionally, weak magnetic reflections indexed to an incommensurate ordering with = (- 0.214, 1/2, 0.457) occur in the diffraction pattern up to x = 0.29 indicating the occurence of a reentrant phase. For 0.12 ⩽ x ⩽ 0.29 the low temperature phases are separated from a magnetic high temperature phase showing only magnetic reflections indexed to a spin arrangement with = (1/2, 0, 0). The magnetic phase diagram is discussed qualitatively considering random superexchange between the statistically distributed Mn2+- and Fe2+-ions in the coexistence range 0.12 ⩽ x ⩽ 0.29 of different magnetic structures related to those of pure MnWO4 and FeWO4. Received 9 October 2002 Published online 14 March 2003  相似文献   
179.
Photoinduced optical and second-order non-linear optical effects in the interfaces separating In2O3–SiON (O/N ratio equals 1) films doped with A1, Sn and glass substrates were investigated using the photoinduced optical second harmonic generation. The photoinduced effective second-order optical susceptibility deff (at λ=1.76 μm) shows a good correlation with the linear optical susceptibility, particularly with the shift of the absorption edge. The maximal response of the photoinduced optical response signal was observed for the pump–probe delaying time of 34 ps. The performed experimental measurements indicate that the observed effects are mainly caused by the interface potential gradients on the border glass–In2O3–SiON film and by additional polarization due to insertion of the Al and Sn atoms. The observed phenomenon may be proposed as a sensitive tool for investigation of thin semiconducting interfacial layers and simultaneously such films may be used as materials for non-linear optical devices.  相似文献   
180.
(2S,3S)- and (2R,3R)-2-amino-3-phenyl-5-hexenoic acids have been synthesized in large scale by using Ni(II)-complexes as a template. The amino acids were used in the synthesis of [4,3,0]-bicyclic β-turn mimetics by a convergent methodology. The unique advantage of this strategy is the convenience of introducing side chain groups with predetermined chiralities on both the five- and six-membered heterocyclic rings.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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