全文获取类型
收费全文 | 9053篇 |
免费 | 848篇 |
国内免费 | 526篇 |
专业分类
化学 | 497篇 |
晶体学 | 7篇 |
力学 | 612篇 |
综合类 | 202篇 |
数学 | 7034篇 |
物理学 | 2075篇 |
出版年
2024年 | 27篇 |
2023年 | 104篇 |
2022年 | 174篇 |
2021年 | 171篇 |
2020年 | 254篇 |
2019年 | 253篇 |
2018年 | 230篇 |
2017年 | 283篇 |
2016年 | 238篇 |
2015年 | 194篇 |
2014年 | 300篇 |
2013年 | 719篇 |
2012年 | 338篇 |
2011年 | 406篇 |
2010年 | 358篇 |
2009年 | 532篇 |
2008年 | 563篇 |
2007年 | 510篇 |
2006年 | 514篇 |
2005年 | 391篇 |
2004年 | 380篇 |
2003年 | 402篇 |
2002年 | 417篇 |
2001年 | 347篇 |
2000年 | 372篇 |
1999年 | 293篇 |
1998年 | 252篇 |
1997年 | 198篇 |
1996年 | 170篇 |
1995年 | 87篇 |
1994年 | 117篇 |
1993年 | 84篇 |
1992年 | 80篇 |
1991年 | 86篇 |
1990年 | 65篇 |
1989年 | 65篇 |
1988年 | 58篇 |
1987年 | 43篇 |
1986年 | 33篇 |
1985年 | 54篇 |
1984年 | 65篇 |
1983年 | 29篇 |
1982年 | 29篇 |
1981年 | 35篇 |
1980年 | 18篇 |
1979年 | 18篇 |
1978年 | 18篇 |
1977年 | 13篇 |
1976年 | 11篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
61.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
62.
Thomas Wanner 《Transactions of the American Mathematical Society》2004,356(6):2251-2279
Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.
In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.
63.
Tracy Noble Ricardo Nemirovsky Cara Dimattia Tracey Wright 《International Journal of Computers for Mathematical Learning》2004,9(2):109-167
In this article, we will describe the results of a study of 6th grade students learning about the mathematics of change. The
students in this study worked with software environments for the computer and the graphing calculator that included a simulation
of a moving elevator, linked to a graph of its velocity vs. time. We will describe how the students and their teacher negotiated
the mathematical meanings of these representations, in interaction with the software and other representational tools available
in the classroom. The class developed ways of selectively attending to specific features of stacks of centimeter cubes, hand-drawn
graphs, and graphs (labeled velocity vs. time) on the computer screen. In addition, the class became adept at imagining the
motions that corresponded to various velocity vs. time graphs. In this article, we describe this development as a process
of learning to see mathematical representations of motion. The main question this article addresses is: How do students learn
to see mathematical representations in ways that are consistent with the discipline of mathematics?
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
64.
We model the motion of a receptor on the membrane surface of a synapse as free Brownian motion in a planar domain with intermittent trappings in and escapes out of corrals with narrow openings. We compute the mean confinement time of the Brownian particle in the asymptotic limit of a narrow opening and calculate the probability to exit through a given small opening, when the boundary contains more than one. Using this approach, it is possible to describe the Brownian motion of a random particle in an environment containing domains with small openings by a coarse grained diffusion process. We use the results to estimate the confinement time as a function of the parameters and also the time it takes for a diffusing receptor to be anchored at its final destination on the postsynaptic membrane, after it is inserted in the membrane. This approach provides a framework for the theoretical study of receptor trafficking on membranes. This process underlies synaptic plasticity, which relates to learning and memory. In particular, it is believed that the memory state in the brain is stored primarily in the pattern of synaptic weight values, which are controlled by neuronal activity. At a molecular level, the synaptic weight is determined by the number and properties of protein channels (receptors) on the synapse. The synaptic receptors are trafficked in and out of synapses by a diffusion process. Following their synthesis in the endoplasmic reticulum, receptors are trafficked to their postsynaptic sites on dendrites and axons. In this model the receptors are first inserted into the extrasynaptic plasma membrane and then random walk in and out of corrals through narrow openings on their way to their final destination. 相似文献
65.
Ghulam Mustafa 《数学研究及应用》2003,23(3):413-421
本文引入了一种满足更一般的收缩不等式的多重函数类,并证明了属于该类的可测多重函数对的一些随机重合点定理。 相似文献
66.
Here we prove a limit theorem in the sense of the weak convergence of probability measures in the space of meromorphic functions
for a general Dirichlet series. The explicit form of the limit measure in this theorem is given.
Partially supported by Lithuanian Foundation of Studies and Science 相似文献
67.
设{Xni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论. 相似文献
68.
可交换随机变量序列的随机极限定理 总被引:1,自引:0,他引:1
本文讨论了可交换随机变量序列{Xn:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果. 相似文献
69.
就如何在4英寸热氧化硅衬底上沉积高质量的磁性隧道结纳米多层薄膜材料和如何利用光刻方法微加工制备均匀性较好的磁性隧道结方面做了初步研究,并对磁性隧 道结的磁电性质及其工作特性进行了初步测量和讨论.利用现有的光刻设备和工艺条 件在4英寸热氧化硅衬底上直接制备出的磁性隧道结,其结电阻与面积的积 矢的绝对误差在10% 以内,隧穿磁电阻的绝对误差在7% 以内,样品的磁性隧道结性质具有较好的均匀性和一致性,可以满足研制磁随机存储器存储单元演示器件的基本要求.
关键词:
磁性隧道结
隧穿磁电阻
磁随机存储器
4英寸热氧化硅衬底 相似文献
70.