全文获取类型
收费全文 | 712篇 |
免费 | 106篇 |
国内免费 | 21篇 |
专业分类
化学 | 34篇 |
力学 | 11篇 |
综合类 | 14篇 |
数学 | 334篇 |
物理学 | 184篇 |
无线电 | 262篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 12篇 |
2021年 | 17篇 |
2020年 | 20篇 |
2019年 | 14篇 |
2018年 | 19篇 |
2017年 | 22篇 |
2016年 | 23篇 |
2015年 | 29篇 |
2014年 | 52篇 |
2013年 | 65篇 |
2012年 | 58篇 |
2011年 | 38篇 |
2010年 | 58篇 |
2009年 | 52篇 |
2008年 | 63篇 |
2007年 | 42篇 |
2006年 | 40篇 |
2005年 | 25篇 |
2004年 | 30篇 |
2003年 | 32篇 |
2002年 | 22篇 |
2001年 | 12篇 |
2000年 | 28篇 |
1999年 | 13篇 |
1998年 | 18篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有839条查询结果,搜索用时 68 毫秒
111.
In the present paper, we consider a kind of semi-Markov risk model (SMRM) with constant interest force and heavy-tailed claims, in which the claim rates and sizes are conditionally independent, both fluctuating according to the state of the risk business. First, we derive a matrix integro-differential equation satisfied by the survival probabilities. Second, we analyze the asymptotic behaviors of ruin probabilities in a two-state SMRM with special claim amounts. It is shown that the asymptotic behaviors of ruin probabilities depend only on the state 2 with heavy-tailed claim amounts, not on the state 1 with exponential claim sizes. 相似文献
112.
113.
114.
Anomaly detection and location in crowded scenes have attracted a lot of attention in computer vision research community recently due to the increased applications of intelligent surveillance improve security in public. We propose a novel parallel spatial-temporal convolution neural networks model to detect and localize the abnormal behavior in video surveillance. Our approach contains two main steps. Firstly, considering the typical position of camera and the large number of background information, we introduce a novel spatial-temporal cuboid of interest detection method with varied-size cell structure and optical flow algorithm. Then, we use the parallel 3D convolution neural networks to describe the same behavior in different temporal-lengths. That step ensures that the most of behavior information in cuboids could be captured, also insures the reduction of information unrelated to the major behavior. The evaluation results on benchmark datasets show the superiority of our method compared to the state-of-the-art methods. 相似文献
115.
A novel organizing scheme of single topic user group based on trust chain model in social network
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Meizi Li Yang Xiang Bo Zhang Fazhuan Wei Qianqian Song 《International Journal of Communication Systems》2018,31(1)
Social network sites (SNS) presently face the task of grouping users into small subsets within themselves. In this study, an organizing scheme for single‐topic user groups is proposed for facilitating user sharing and communicating under common interests. The main rationales of the proposed scheme are (1) only an influential single topic is selected through its impact evaluation to attract users; (2) only the users having high degree of interest, explicit or implicit, on the topic should be grouped; and (3) trustworthy relationships among users are taken into consideration to enlarge the scale of user group. The proposed organizing scheme comprises 3 features: topic impact evaluation, interest degree measurement, and trust chain‐based organizing. The main structure of our proposed scheme is (1) an overview of the proposed scheme and its formal related definitions; (2) a topic impact evaluation method, ie, an importance evaluation and a popularity calculation; (3) a user interest degree measurement method, ie, explicit and implicit interest evaluation with dynamic factors included; (4) a trust chain calculation method based on the topology features of the trust chain; (5) an organizing algorithm for single topic user group, and finally, some experimental results and discussions to illustrate the effectiveness and feasibility of our scheme. 相似文献
116.
117.
在电路设计中,简单电路可以用手稿或一些办公室软件来实现,但对于复杂电路来说,则需要使用专业的EDA辅助设计软件来完成,如电路原理图(Sch)与印制电路板(PCB)文件的制作等设计工作。随着电子技术的不断创新,各种新型器件层见迭出,电路变得也越来越繁杂,传统设计方法已无法完成高密度设计要求。本文以FPGA实验教学开发板的电路进行设计为例,通过使用AltiumDesigner(以下简称AD)15这款辅助设计软件进行电路设计,不仅可以增加学生学习乐趣,还能提高动手能力,为毕业以后从事同专业工作夯实基础。 相似文献
118.
With the advancement in wireless technology and portable devices, smart phones have become one of the belongings of human being. People share their data online, but it has limitations due to transmission range and mobility. Yet opportunistic mobile social network enables users to share data online even if there is no connected path between source and destination. The widespread use of mobile phones equipped with WiFi, Bluetooth, and several other components and contact opportunities among humans bridge the gap between internet available and nonavailable area. In this paper, we have proposed a new routing approach which utilizes both spatial and temporal attributes of user such as probability to meet a particular location and remaining intercontact time between two nodes to select better relay nodes. Generally, users visit different locations such as sports stadium and mall, with varying probability. Users with similar interest form group, and each user has different intercontact time with other users according to their point of interest and visiting pattern. By utilizing multiattributes, different forwarding strategies have been devised for both inter and intragroup routing. The proposed work “point of interest (PoI)‐based routing” is implemented in Opportunistic Network Environment simulator, and the performance is analysed in terms of delivery rate, latency, overhead, goodput, and energy consumed. The simulation results show that PoI diminishes 23% of overhead and yields 24% improvement in goodput over the state‐of‐the‐art protocol. Thus, the simulation results reveal that our proposed work provides the balance between routing performance and resource consumption. 相似文献
119.
WUXIONGWEI XUWENSHENG CHENSHUPING 《高校应用数学学报(英文版)》1998,13(1):68-76
In this paper, optimal investment and consumption decisions for an optimal choiceproblem in infinite borizon are considered, for an investor who has available a bank account anda stock whose price is a log normal diffusion. The bank pays at an interest rate r for any de-posit, and takes at a larger rate / for any loan. As in the paper of Xu Wensheng and ChenShuping in JAMS(B), where an analogous problem in finite horizon is studied, optimal strategies are obtained via Hamilton-Jacobi-Bellman (ladE) equation which is derived from dynamic c1-programming principle. For the specific HARA case, i.e. U(t,c)=e^-βtc^1-R/1-R, this paper getsthe optimal consumption and optimal investment in the form of c^‘1 =β -^-g/Rwi and π^‘1= b -- γ / Rσ^2wr, with γ1,=max{γ,min{γ‘,b--Rσ^2‘} },^-g=(1--R)[γ (b-γ)^2/2Rσ^2]. This result coincides with the classical one under condition γ‘ ≡γ. 相似文献
120.
针对现在网络上泛滥的垃圾邮件问题,本文结合主动学习方法和否定选择算法提出了一种二类文本分类方法:主动否定学习算法.根据用户少量标注建立双向兴趣集,利用否定选择算法的自体异常检测机制改善主动学习中的采样策略,并将双向兴趣集作为检测器,新增样本集作为自体集,对两者进行异常匹配.本文算法与在线垃圾邮件快速识别方法、增强差异性的半监督协同分类算法、垃圾邮件过滤方法、基于人工高免疫的多层垃圾邮件过滤算法和在线主动多领域学习方法在六个常用邮件语料集上进行了分析比较,结果表明本文算法具有较高的准确率、召回率、分类精度,和较低的用户标注负担.使用用户个性喜好转换为双向兴趣特征的方式有助于提高算法的分类能力;利用异常检测匹配选取未知类别特征的方式,有效地降低了用户标注负担. 相似文献