全文获取类型
收费全文 | 4622篇 |
免费 | 522篇 |
国内免费 | 141篇 |
专业分类
化学 | 172篇 |
力学 | 38篇 |
综合类 | 80篇 |
数学 | 2797篇 |
物理学 | 310篇 |
无线电 | 1888篇 |
出版年
2024年 | 6篇 |
2023年 | 37篇 |
2022年 | 118篇 |
2021年 | 140篇 |
2020年 | 132篇 |
2019年 | 121篇 |
2018年 | 110篇 |
2017年 | 158篇 |
2016年 | 162篇 |
2015年 | 150篇 |
2014年 | 322篇 |
2013年 | 323篇 |
2012年 | 293篇 |
2011年 | 271篇 |
2010年 | 249篇 |
2009年 | 291篇 |
2008年 | 288篇 |
2007年 | 343篇 |
2006年 | 243篇 |
2005年 | 198篇 |
2004年 | 192篇 |
2003年 | 167篇 |
2002年 | 141篇 |
2001年 | 130篇 |
2000年 | 91篇 |
1999年 | 82篇 |
1998年 | 71篇 |
1997年 | 46篇 |
1996年 | 67篇 |
1995年 | 41篇 |
1994年 | 42篇 |
1993年 | 20篇 |
1992年 | 21篇 |
1991年 | 24篇 |
1990年 | 15篇 |
1989年 | 14篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 15篇 |
1985年 | 27篇 |
1984年 | 24篇 |
1983年 | 8篇 |
1982年 | 19篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1957年 | 1篇 |
排序方式: 共有5285条查询结果,搜索用时 656 毫秒
1.
Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes. 相似文献
2.
3.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
4.
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. 相似文献
5.
基于ISO/IEC17799标准建立了一个综合的信息系统风险分析框架,并运用模糊多准则决策(FMCDM)方法计算信息安全风险,根据风险等级矩阵(RLM)对信息资产风险进行级别划分,最终建立评估信息资产相关风险的完整模型。 相似文献
6.
探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型,应用数据挖掘中决策树算法,对高校人力资源数据源中的信息进行分析,发现其中有价值的数据模式,寻找其中存在的关系和规则,对高校人才规划提供比较客观的决策支持。 相似文献
7.
文[1]提出了两个DEA的逆问题,并用搜索法来解.而本文根据所证的定理,对每个问题一般只要解二、三个线性规划问题就能得到答案. 相似文献
8.
基于粗糙集信息观的决策表属性约简方法 总被引:2,自引:0,他引:2
粗糙集理论是近年来发展起来的一种有效的处理不精确、不确定、含糊信息的数学理论方法,它被广泛应用于相容和不相容决策表的属性约简和核属性计算。利用反例指出目前基于粗糙集信息观[2、6]的决策表属性约简和核属性计算方法的局限性。对决策表的性质作了深入的研究,研究发现文献[2、6]方法的不足原因是:它们没有考虑U/ind(C)中等价类的相客性。给出了基于U/ind(C)中等价类相客性的属性约简定义和核属性定义,并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。讨论了该方法同文献[2、6]方法的区别。最后用相同实例验证了该方法的有效性。 相似文献
9.
首先建立了数据传输网络选择的最小成本模型,给出了有效支撑树代表集的概念,并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题,分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。 相似文献