全文获取类型
收费全文 | 2299篇 |
免费 | 225篇 |
国内免费 | 106篇 |
专业分类
化学 | 146篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1153篇 |
物理学 | 223篇 |
无线电 | 1036篇 |
出版年
2024年 | 3篇 |
2023年 | 22篇 |
2022年 | 60篇 |
2021年 | 51篇 |
2020年 | 69篇 |
2019年 | 70篇 |
2018年 | 50篇 |
2017年 | 83篇 |
2016年 | 82篇 |
2015年 | 69篇 |
2014年 | 142篇 |
2013年 | 191篇 |
2012年 | 142篇 |
2011年 | 137篇 |
2010年 | 132篇 |
2009年 | 134篇 |
2008年 | 173篇 |
2007年 | 175篇 |
2006年 | 134篇 |
2005年 | 94篇 |
2004年 | 101篇 |
2003年 | 87篇 |
2002年 | 68篇 |
2001年 | 64篇 |
2000年 | 49篇 |
1999年 | 44篇 |
1998年 | 43篇 |
1997年 | 21篇 |
1996年 | 31篇 |
1995年 | 14篇 |
1994年 | 13篇 |
1993年 | 10篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2630条查询结果,搜索用时 15 毫秒
1.
Ratnabali Biswas Kaushik Chowdhury Dharma P. Agrawal 《International Journal of Wireless Information Networks》2006,13(4):303-315
Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. 相似文献
2.
探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型,应用数据挖掘中决策树算法,对高校人力资源数据源中的信息进行分析,发现其中有价值的数据模式,寻找其中存在的关系和规则,对高校人才规划提供比较客观的决策支持。 相似文献
3.
首先建立了数据传输网络选择的最小成本模型,给出了有效支撑树代表集的概念,并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题,分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。 相似文献
4.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
5.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
6.
7.
8.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
9.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
10.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献