全文获取类型
收费全文 | 1493篇 |
免费 | 62篇 |
国内免费 | 51篇 |
专业分类
化学 | 90篇 |
晶体学 | 1篇 |
力学 | 36篇 |
综合类 | 22篇 |
数学 | 326篇 |
物理学 | 71篇 |
综合类 | 1060篇 |
出版年
2024年 | 1篇 |
2023年 | 20篇 |
2022年 | 21篇 |
2021年 | 26篇 |
2020年 | 21篇 |
2019年 | 20篇 |
2018年 | 25篇 |
2017年 | 26篇 |
2016年 | 26篇 |
2015年 | 50篇 |
2014年 | 83篇 |
2013年 | 89篇 |
2012年 | 75篇 |
2011年 | 108篇 |
2010年 | 97篇 |
2009年 | 71篇 |
2008年 | 96篇 |
2007年 | 125篇 |
2006年 | 108篇 |
2005年 | 78篇 |
2004年 | 69篇 |
2003年 | 67篇 |
2002年 | 49篇 |
2001年 | 45篇 |
2000年 | 25篇 |
1999年 | 26篇 |
1998年 | 17篇 |
1997年 | 19篇 |
1996年 | 19篇 |
1995年 | 21篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 9篇 |
1991年 | 13篇 |
1990年 | 6篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1606条查询结果,搜索用时 31 毫秒
1.
在深井、超深井以及地层复杂等条件下,为了避免或减少钻井事故的发生,达到优质快速钻井的目的,选择合适的钻井液体系至关重要。基于案例推理(CBR,Case-Based Reasoning)的钻井液设计中,钻井液体系由岩性、井型和井深等属性推理得出,但属性权重的分配会对推理结果产生显著的影响;遗传算法在优化属性权重时,存在收敛速度慢、收敛精度低的缺点。针对上述问题,提出一种解决CBR中属性权重分配问题的改进遗传算法。首先,对遗传算子进行改进:选择算子方面,利用指数尺度变换法优化个体选择;交叉算子方面,对算术交叉中的比例因子进行自适应调整;变异算子方面,改进个体变异方向,保持种群多样性。其次,从个体适应度和交叉个体的差异程度两方面实现交叉概率自适应调整。最后,通过对UCI数据集的对比实验,证明了改进后的遗传算法能改善全局收敛性能,提高CBR的准确率。将该算法运用到基于CBR的钻井液设计中,实验结果表明,所提方法能够优化属性权重的分配,进而提高钻井液设计的质量。 相似文献
2.
3.
杜美华 《青海师范大学学报(自然科学版)》2015,(2)
本文分析了现行线性代数的教学问题,提出了问题驱动与案例任务相结合的教学模式,并以两个案例来说明了此种教学模式的优越性,培养了学生的应用和创新能力,提高了学生的学习兴趣与课堂教学质量. 相似文献
4.
管理信息系统教学刍议 总被引:3,自引:0,他引:3
李竹宁 《上海应用技术学院学报:自然科学版》2002,(Z1)
企业管理的发展变化和计算机信息技术的迅猛发展,给管理信息系统的教学提出了更高的要求,要求管理信息系统的教学体系要不断完善、教学内容要不断充实,教学方式要不断改进。从预备知识的重要性、教学内容的更新、强化案例教学、加强实践环节等方面进行探讨,探索出一条真正有效、切实可行的教学改革之路。 相似文献
5.
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes 总被引:1,自引:0,他引:1
It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n). 相似文献
6.
The goal of the paper is to analyse properties of solutions for linear thermoelastic systems of type III in one space variable. Our approach does not use energy methods, it bases on a special diagonalization procedure which is different in different parts of the phase space. This procedure allows to derive explicit representations of solutions. These representations help to prove results for well‐posedness of the Cauchy problem, LP–Lq decay estimates on the conjugate line and results for propagation of singularities. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
7.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
8.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
9.
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. 相似文献
10.
Under the nonresonant case where the carrier frequency of a Gaussian beam deviates from the resonant frequency of a Fabry–Perot etalon, the transmission of a Gaussian beam after incidenting nonnormally on a Fabry–Perot etalon has been investigated. The results show that under the nonresonant case, variations of the peak intensity, the position of the peak intensity and the spot size of the transmitted beam with the input angle behave differently and even with a reversed tendency compared with those obtained under the resonant case. 相似文献