全文获取类型
收费全文 | 10821篇 |
免费 | 1272篇 |
国内免费 | 604篇 |
专业分类
化学 | 2730篇 |
晶体学 | 37篇 |
力学 | 718篇 |
综合类 | 245篇 |
数学 | 5229篇 |
物理学 | 3738篇 |
出版年
2024年 | 22篇 |
2023年 | 165篇 |
2022年 | 421篇 |
2021年 | 419篇 |
2020年 | 286篇 |
2019年 | 258篇 |
2018年 | 208篇 |
2017年 | 349篇 |
2016年 | 398篇 |
2015年 | 334篇 |
2014年 | 588篇 |
2013年 | 883篇 |
2012年 | 644篇 |
2011年 | 633篇 |
2010年 | 598篇 |
2009年 | 734篇 |
2008年 | 717篇 |
2007年 | 729篇 |
2006年 | 542篇 |
2005年 | 407篇 |
2004年 | 377篇 |
2003年 | 353篇 |
2002年 | 337篇 |
2001年 | 244篇 |
2000年 | 247篇 |
1999年 | 199篇 |
1998年 | 201篇 |
1997年 | 176篇 |
1996年 | 197篇 |
1995年 | 123篇 |
1994年 | 153篇 |
1993年 | 124篇 |
1992年 | 86篇 |
1991年 | 58篇 |
1990年 | 62篇 |
1989年 | 40篇 |
1988年 | 35篇 |
1987年 | 25篇 |
1986年 | 47篇 |
1985年 | 49篇 |
1984年 | 41篇 |
1983年 | 12篇 |
1982年 | 47篇 |
1981年 | 25篇 |
1980年 | 22篇 |
1979年 | 29篇 |
1978年 | 16篇 |
1977年 | 16篇 |
1976年 | 8篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
21.
差分吸收光谱法测量大气痕量气体浓度误差分析及改善方法 总被引:8,自引:2,他引:6
差分吸收光谱技术(DOAS)中采用线性最小二乘拟合方法,用痕量气体标准差分吸收截面对测量得到的差分吸收光谱进行拟合,得出大气中痕量气体的浓度.计算结果的准确性不仅取决于光谱的测量精度,而且受标准差分吸收截面以及仪器函数和温度等诸多因素的影响.详细地分析了计算误差的产生原因,提出了用高浓度样品池得到标准吸收截面的方法,针对光谱固有结构,以及温度对标准吸收截面的影响,改进了浓度反演算法.大量的实验表明,综合运用上述方法,即便对低浓度的样气,相对测量误差也能降低到10%以下. 相似文献
22.
Experimental analysis, modeling, and theoretical design of McMaster pore-filled nanofiltration membranes 总被引:1,自引:0,他引:1
A side-by-side comparison of the performance of McMaster pore-filled (MacPF) and commercial nanofiltration (NF) membranes is presented here. The single-salt and multi-component performance of these membranes is studied using experimental data and using a mathematical model. The pseudo two-dimensional model is based on the extended Nernst–Planck equation, a modified Poisson–Boltzmann equation, and hydrodynamic calculations. The model includes four structural properties of the membrane: pore radius, pure water permeability, surface charge density and the ratio of effective membrane thickness to water content. The analysis demonstrates that the rejection and transport mechanisms are the same in the commercial and MacPF membranes with different contributions from each type of mechanism (convection, diffusion and electromigration). Solute rejection in NF membranes is determined primarily by a combination of steric and electrostatic effects. The selectivity of MacPF membranes is primarily determined by electrostatic effects with a significantly smaller contribution of steric effects compared to commercial membranes. Hence, these membranes have the ability to reject ions while remaining highly permeable to low molecular weight organics. Additionally, a new theoretical membrane design approach is presented. This design procedure potentially offers the optimization of NF membrane performance by tailoring the membrane structure and operating variables to the specific process, simultaneously. The procedure is validated at the laboratory scale. 相似文献
23.
A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series. 相似文献
24.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
25.
On effectiveness of wiretap programs in mapping social networks 总被引:1,自引:0,他引:1
Maksim Tsvetovat Kathleen M. Carley 《Computational & Mathematical Organization Theory》2007,13(1):63-87
Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost.
Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on
Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php 相似文献
26.
The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period. 相似文献
27.
SUN Qiyu 《数学年刊B辑(英文版)》2003,24(3):367-386
In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2). 相似文献
28.
网络股泡沫大小测度研究 总被引:1,自引:0,他引:1
网络股泡沫是最能反映网络泡沫本质的表现形式,本文利用理性预期理论,构建了网络股泡沫大小的测度模型,说明网络股泡沫的存在,在此基础上确定了网络股泡沫大小的测度指标,并以雅虎公司股票为例对泡沫的大小进行了测度,结果符合网络泡沫的实际情况。 相似文献
29.
30.
An Application of Branch and Cut to Open Pit Mine Scheduling 总被引:5,自引:0,他引:5
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. 相似文献