全文获取类型
收费全文 | 6587篇 |
免费 | 621篇 |
国内免费 | 440篇 |
学科分类
数理化 | 7648篇 |
出版年
2024年 | 11篇 |
2023年 | 100篇 |
2022年 | 136篇 |
2021年 | 206篇 |
2020年 | 130篇 |
2019年 | 119篇 |
2018年 | 122篇 |
2017年 | 156篇 |
2016年 | 189篇 |
2015年 | 153篇 |
2014年 | 330篇 |
2013年 | 600篇 |
2012年 | 461篇 |
2011年 | 426篇 |
2010年 | 410篇 |
2009年 | 464篇 |
2008年 | 482篇 |
2007年 | 556篇 |
2006年 | 308篇 |
2005年 | 270篇 |
2004年 | 244篇 |
2003年 | 250篇 |
2002年 | 153篇 |
2001年 | 120篇 |
2000年 | 131篇 |
1999年 | 127篇 |
1998年 | 122篇 |
1997年 | 112篇 |
1996年 | 134篇 |
1995年 | 97篇 |
1994年 | 76篇 |
1993年 | 93篇 |
1992年 | 64篇 |
1991年 | 53篇 |
1990年 | 41篇 |
1989年 | 51篇 |
1988年 | 37篇 |
1987年 | 18篇 |
1986年 | 16篇 |
1985年 | 28篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1969年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有7648条查询结果,搜索用时 15 毫秒
21.
Identifying sets of key players in a social network 总被引:3,自引:0,他引:3
A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection
of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG.
KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network
by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or
fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for
solving either generic problem, and therefore new measures are presented.
Stephen P. Borgatti is Professor of Organization Studies at the Carroll School of Management, Boston College. His research is focused on social
networks, social cognition and knowledge management. He is also interested in the application of social network analysis to
the solution of managerial problems. 相似文献
22.
Nick Peatfield 《Archive for Mathematical Logic》2006,45(6):739-768
Following the introduction and preliminary investigations of analytic Zariski structures in Peatfield and Zilber (Ann pure Appl Logic 132:125–180, 2005) an example of an analytic Zariski structure extending an algebraically closed field is provided. The example is constructed using Hrushovski’s method of free amalgamation, and a topology is introduced in which we can verify the analytic Zariski axioms. 相似文献
23.
利用Liapunov函数方法,结合积分不等式技巧,分析了时滞细胞神经网络的平衡点存在的唯一性和全局指数稳定性,保证时滞细胞神经网络全局指数稳定的一个新的充分判据被得到.所得判据比已有文献具有更少的限制,为实际应用提供了方便. 相似文献
24.
This article proves the existence of singular directions of value distribution theory for some transcendental holomorphic curves in the n-dimensional complex projective space Pn(C). An example is given to complement these results. 相似文献
25.
二维光电位置敏感器件的非线性修正 总被引:13,自引:2,他引:11
根据二维光电位置敏感器件 (PSD)的工作原理 ,分析了影响PSD线性度的主要因素 ,提出了一种用神经网络对PSD进行非线性修正的方法。以PSD的输入输出数据对作为样本训练的神经网络 ,利用神经网络所具有地能够以任意精度逼近非线性函数的能力 ,实现PSD的输出与实际光点位置之间的映射 ,在神经网络的输出端得到线性响应。该方法的优点是不需要很大的数据存储量即可得到很好的修正效果。结果表明 ,修正后的PSD能在较宽的位置范围内输出高线性度的信号 相似文献
26.
27.
现代优化计算方法在蛋白质结构预测中的应用 总被引:2,自引:1,他引:1
现代优化计算方法在蛋白质结构预测中占有重要地位.简要地介绍了模拟退火算法,遗传算法,人工神经网络和图论算法在蛋白质结构预测中的应用.对国内外近年来应用这些算法,特别是在蛋白质构象搜索问题中,解决蛋白质结构预测的研究作了回顾,并分析、比较了这几种算法的效果和特点. 相似文献
28.
Huseyin Ince 《Computational Management Science》2006,3(2):161-174
The nature of the financial time series is complex, continuous interchange of stochastic and deterministic regimes. Therefore,
it is difficult to forecast with parametric techniques. Instead of parametric models, we propose three techniques and compare
with each other. Neural networks and support vector regression (SVR) are two universally approximators. They are data-driven
non parametric models. ARCH/GARCH models are also investigated. Our assumption is that the future value of Istanbul Stock
Exchange 100 index daily return depends on the financial indicators although there is no known parametric model to explain
this relationship. This relationship comes from the technical analysis. Comparison shows that the multi layer perceptron networks
overperform the SVR and time series model (GARCH). 相似文献
29.
This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can
be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck
links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue,
(ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point
in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic
has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before
the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding
tail probabilities decay exponentially, as is shown by a large-deviations analysis.
F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless. 相似文献
30.
Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems. 相似文献