全文获取类型
收费全文 | 1134篇 |
免费 | 115篇 |
国内免费 | 31篇 |
专业分类
化学 | 108篇 |
晶体学 | 1篇 |
力学 | 42篇 |
综合类 | 34篇 |
数学 | 537篇 |
物理学 | 77篇 |
无线电 | 481篇 |
出版年
2024年 | 10篇 |
2023年 | 23篇 |
2022年 | 23篇 |
2021年 | 46篇 |
2020年 | 55篇 |
2019年 | 26篇 |
2018年 | 31篇 |
2017年 | 37篇 |
2016年 | 47篇 |
2015年 | 36篇 |
2014年 | 83篇 |
2013年 | 68篇 |
2012年 | 79篇 |
2011年 | 69篇 |
2010年 | 65篇 |
2009年 | 61篇 |
2008年 | 66篇 |
2007年 | 69篇 |
2006年 | 73篇 |
2005年 | 45篇 |
2004年 | 37篇 |
2003年 | 29篇 |
2002年 | 26篇 |
2001年 | 31篇 |
2000年 | 18篇 |
1999年 | 8篇 |
1998年 | 15篇 |
1997年 | 19篇 |
1996年 | 9篇 |
1995年 | 13篇 |
1994年 | 7篇 |
1993年 | 2篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1280条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
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). 相似文献
5.
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. 相似文献
6.
This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced. 相似文献
7.
Kj?rand Iversen Per Nilsson 《International Journal of Computers for Mathematical Learning》2007,12(2):113-133
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. 相似文献
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. 相似文献