首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3159篇
  免费   301篇
  国内免费   134篇
化学   62篇
力学   37篇
综合类   26篇
数学   848篇
物理学   268篇
无线电   2353篇
  2024年   7篇
  2023年   20篇
  2022年   44篇
  2021年   77篇
  2020年   68篇
  2019年   64篇
  2018年   51篇
  2017年   99篇
  2016年   129篇
  2015年   124篇
  2014年   189篇
  2013年   201篇
  2012年   211篇
  2011年   217篇
  2010年   170篇
  2009年   202篇
  2008年   206篇
  2007年   222篇
  2006年   237篇
  2005年   198篇
  2004年   145篇
  2003年   135篇
  2002年   117篇
  2001年   78篇
  2000年   57篇
  1999年   53篇
  1998年   51篇
  1997年   41篇
  1996年   37篇
  1995年   36篇
  1994年   13篇
  1993年   11篇
  1992年   14篇
  1991年   8篇
  1990年   8篇
  1989年   6篇
  1988年   3篇
  1987年   3篇
  1986年   3篇
  1985年   7篇
  1984年   7篇
  1983年   1篇
  1982年   5篇
  1981年   5篇
  1980年   5篇
  1979年   2篇
  1978年   2篇
  1977年   2篇
  1976年   1篇
  1973年   2篇
排序方式: 共有3594条查询结果,搜索用时 672 毫秒
1.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost.  相似文献   
2.
With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.  相似文献   
3.
通过对解决GSM移动通信网络热点区域话务拥塞问题的研究,提出了利用可控功分器实现智能动态网络资源的分配,解决不同种类的话务拥塞问题,并着重讨论了该系统目前的成功运用及前景。  相似文献   
4.
CMOS光接收机主放大器设计   总被引:1,自引:0,他引:1  
利用CMOS工艺设计一种用于SDH STM 4速率级(622 Mb/s)光纤用户网的光接收机放大电路。此电路由输入/输出缓冲、主放大单元、偏置补偿电路4部分组成。通过直接耦合技术提高增益,降低功耗;利用有源电感负载提高系统带宽。采用商用SmartSpice电路仿真软件和CSMC HJ 0.6μm工艺参数对该电路进行仿真。结果表明,该电路在5 V工作电压下中频增益为81 dB,3 dB带宽为470 MHz。  相似文献   
5.
介绍了宽动态变化范围的新型可变增益放大器RF2607的特性、功能,给出了利用RF2607设计无线局域网(WLAN)通信中自动增益控制部分的实用电路.  相似文献   
6.
介绍了互联网通信技术的特点、应用和发展,提出了一些新的方法,解决了互联网通信过程中的信息访问资源浪费、信息阻塞和信道负担增加的问题。  相似文献   
7.
10~40Gb/s OEIC光接收机前端的最新研究进展   总被引:1,自引:0,他引:1  
基于OEIC光接收机前端的集成方式和前放电路形式介绍了OEIC光接收机前端的最新研究进展.  相似文献   
8.
介绍了可靠性设计过程涉及的质量控制成本的解决方法,通过对最有可能影响可靠性的电路设计、元器件选用等方面的分析,介绍了在降低可靠性设计成本的基础下更好地解决可靠性问题的一些方法。  相似文献   
9.
Aliprantis  C.D.  Cornet  B.  Tourky  R. 《Positivity》2002,6(3):205-241
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.  相似文献   
10.
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号