全文获取类型
收费全文 | 749篇 |
免费 | 106篇 |
国内免费 | 27篇 |
专业分类
化学 | 50篇 |
晶体学 | 8篇 |
力学 | 22篇 |
综合类 | 7篇 |
数学 | 194篇 |
物理学 | 98篇 |
无线电 | 503篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 22篇 |
2021年 | 26篇 |
2020年 | 17篇 |
2019年 | 29篇 |
2018年 | 26篇 |
2017年 | 29篇 |
2016年 | 27篇 |
2015年 | 37篇 |
2014年 | 60篇 |
2013年 | 48篇 |
2012年 | 58篇 |
2011年 | 58篇 |
2010年 | 50篇 |
2009年 | 38篇 |
2008年 | 49篇 |
2007年 | 45篇 |
2006年 | 45篇 |
2005年 | 37篇 |
2004年 | 38篇 |
2003年 | 30篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 12篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1991年 | 3篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1979年 | 3篇 |
1974年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有882条查询结果,搜索用时 578 毫秒
111.
Joan P. Hutchinson 《Journal of Graph Theory》2008,59(1):59-74
We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that (resp., ) can be L‐list‐colored (except when the graph is K3 with identical 2‐lists). These results are best possible for each condition in the hypotheses and bounds. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 59–74, 2008 相似文献
112.
Jan Hladký Daniel Kráal Jean‐Sébastien Sereni Michael Stiebitz 《Journal of Graph Theory》2008,59(3):229-238
The measurable list chromatic number of a graph G is the smallest number ξ such that if each vertex v of G is assigned a set L(v) of measure ξ in a fixed atomless measure space, then there exist sets such that each c(v) has measure one and for every pair of adjacent vertices v and v'. We provide a simpler proof of a measurable generalization of Hall's theorem due to Hilton and Johnson [J Graph Theory 54 (2007), 179–193] and show that the measurable list chromatic number of a finite graph G is equal to its fractional chromatic number. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 229–238, 2008 相似文献
113.
An additive-free Watts type bath containing micron- and nano-SiC particles (1 μm and 20 nm respectively), as well as ultrafine-WC
particles (200 nm), was used for the production of pure Ni and nickel matrix composite electrocoatings under both direct and
pulse current conditions. Moreover, nickel nanocrystalline deposits were obtained from a Watts type bath containing small
amounts of 2-butyne-1,4-diol, in order to investigate the combined advantages of additives and pulse technique on the properties
of the deposits. The influence of the variable electrolysis parameters, the particle size and the organic additive concentration
on the surface morphology, the structure and properties of the deposits were discussed. It has been proved that the application
of pulse electrodeposition affects drastically the structural characteristics and properties of the deposits and under well-defined
conditions could lead to the preparation of nanostructured materials with improved mechanical properties.
Published in Russian in Elektrokhimiya, 2008, Vol. 44, No. 6, pp. 802–811.
The text was submitted by the authors in English. 相似文献
114.
实时监控分布在企业内部网络集群系统上的各类作业的提交、运行及完成归档情况,是现代企业信息化管理的重要内容。本文提出并设计了一个基于分布式集群环境下的作业流监控系统,采用客户端/服务器(Client/Server,C/S)结构,客户端进行作业流的设计、提交及图形化显示,对作业从提交到返回执行结果的全过程进行控制;服务器端采用集群网络环境下的负载平衡策略,将作业分配到某台主机上进行实时处理,并将处理结果返回到客户端。经过实际企业应用测试,表明该系统能够较好的完成各类作业在异构集群计算机上的整个生命周期的智能监控任务。 相似文献
115.
116.
117.
为了提高复杂背景下红外目标跟踪的准确性和鲁棒 性,提出了紧耦合粒子滤波(PF)与均值漂移(mean shift)的红外目标跟踪方法。在PF框 架下,利用一组5参数集(中心横坐标、中心纵坐标、宽度、高度以及倾斜角)作为状 态变量表 征随机的粒子样本;然后使用自适应均值漂移作为一种迭代模式寻找过程,对随机粒子样本 进行重新分配,使粒子向目标 状态的最大后验核密度估计方向移动,同时利用迭代过程中的Bhattacharyya系数对粒子的 权值进行更新;最后利用重新分配 后的加权粒子集合实现对红外目标的跟踪。实现结果表明,与一般的PF相比,本文方法能有 效减少所需粒子数(N=15),进而降 低跟踪耗时;与现有的PF与均值漂移相结合的方法相比,本文方法在耗费时间 仅增加14%的代价上,使跟踪误差大大降低(约 为原误差的1/3至1/4),准确性和鲁棒性得到显著提高;本文方法能够实现在复杂背景下稳 健准确地跟踪红外目标。 相似文献
118.
SGDD: self‐managed grid‐based data dissemination protocol for mobile sink in wireless sensor network
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Mohammad Reza Majma Sanaz Almassi Hamid Shokrzadeh 《International Journal of Communication Systems》2016,29(5):959-976
The reduction of energy consumption in order to increase network lifetime is one of the most major challenges in the design of wireless sensor networks. During data dissemination, the sensors that are located in the sink's neighborhood are responsible to relay data to the other nodes; hence, their energy is exhausted expeditiously. Therefore, the idea of utilizing mobile sinks can be so advantageous to decrease energy consumption during data dissemination process. In this paper, we propose self‐managed grid‐based data disseminating protocol for mobile sink in wireless sensor networks by using the idea of constructing a virtual grid. In self‐managed grid‐based data disseminating protocol, sink and nodes map their geographical position to a virtual location. In order to increase the performance, we have employed a cell head for each grid cell. Cell heads are selected based on two parameters, centralization and residual energy. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update, which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and determining an optimal size for grid cells, energy consumption is decreased, which leads to increasing network lifetime. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
119.
120.
Many evolving video services and applications for intelligent security systems require reliable transmission of high quality
video to diverse clients over heterogeneous networks using available system resources. Scalable video coding (SVC) is one
of the emerging video compression technologies with such potential capabilities. Advances in lifting-based motion-compensated
temporal filtering (MCTF) have enabled highly efficient and flexible spatial, temporal, signal-to-noise ratio (SNR), and complexity
scalability to be realized over a wide range of bit rates. In this paper, we present an algorithm to improve the update step
of MCTF, which serves as an important informative step for the coding performance of SVC. A novel update-step algorithm, which
takes advantage of the chrominance information of the video sequence and the correlation of the motion vectors (MVs) of the
neighboring blocks as well as the correlation of the derived update MVs in the low-pass frames, is proposed to improve update
step of MCTF by (1) computing correct update motion information, (2) generating correct amount of energy contained in the
high-pass frames. Experimental results show that the proposed algorithm can significantly improve the quality of the reconstructed
video sequence in visual quality.
相似文献
Xiaokang YangEmail: |