首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   36271篇
  免费   5268篇
  国内免费   2592篇
化学   4991篇
晶体学   100篇
力学   4936篇
综合类   485篇
数学   10527篇
物理学   12159篇
无线电   10933篇
  2024年   99篇
  2023年   395篇
  2022年   928篇
  2021年   1013篇
  2020年   1240篇
  2019年   982篇
  2018年   967篇
  2017年   1347篇
  2016年   1653篇
  2015年   1412篇
  2014年   2220篇
  2013年   2749篇
  2012年   2302篇
  2011年   2592篇
  2010年   2103篇
  2009年   2433篇
  2008年   2324篇
  2007年   2310篇
  2006年   1940篇
  2005年   1736篇
  2004年   1583篇
  2003年   1337篇
  2002年   1228篇
  2001年   948篇
  2000年   917篇
  1999年   759篇
  1998年   682篇
  1997年   505篇
  1996年   440篇
  1995年   422篇
  1994年   376篇
  1993年   310篇
  1992年   278篇
  1991年   203篇
  1990年   183篇
  1989年   136篇
  1988年   128篇
  1987年   131篇
  1986年   109篇
  1985年   128篇
  1984年   135篇
  1983年   72篇
  1982年   97篇
  1981年   66篇
  1980年   29篇
  1979年   39篇
  1978年   30篇
  1977年   28篇
  1976年   15篇
  1973年   22篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.  相似文献   
12.
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.  相似文献   
13.
浅谈DC/DC变换器控制新方法   总被引:1,自引:0,他引:1  
文中针对DC/DC变换器的特点,在现有控制和建模方法的基础之上,对DC/DC变换器的现代控制方法进行了归纳和总结,简要讨论了其控制原理,并比较了各种现代控制方法的优缺点,最后对DC/DC变换器控制方法的发展作了一定的展望。  相似文献   
14.
郑炜 《电信科学》2003,19(1):42-47
电信企业信息化的实质就是赋予电信企业精细化的企业资源整合能力,本以此认识为出发点,通过定义基本的信息化业务元素,需求参数和基本信息处理机制,构建出带有行业共性的电信企业信息化统一模型,该模型针对目前电信企业信息化中常见的和潜在的问题提供了有效的解决措施。  相似文献   
15.
龚强 《信息技术》2006,30(1):1-4
地理空间信息网格调度技术,要比传统的高性能计算中的调度技术复杂,原因是如果将全部网格资源作为一个应用程序的调度和执行目标,必将导致通信延迟、成本昂贵、执行低效等。为此,综合考虑应用程序特性、机器特性等,研究设计了地理空间信息网格高性能调度技术中的应用程序调度模型,包括地理空间信息网格应用程序分析;资源特性分析;应用程序分解;性能预测;资源调度;机器选择;任务映射;任务调度;任务调度器和调度器管理模块。以实现为不同的应用程序匹配不同的计算资源,提高计算资源的利用率和应用程序的执行效率。  相似文献   
16.
From its foundation until 2004, ETRI has registered over 1,000 US patents. This letter analyzes the characteristics of these patents and addresses the explanatory factors affecting their citation counts. For explanatory variables, research team related variables, invention specific variables, and geographical domain related variables are suggested. Zero‐altered count data models are used to test the impact of independent variables. A key finding is that technological cumulativeness, the scale of invention, outputs in the electronic field, and the degree of dependence on the US technology domain positively affect the citation counts of ETRI‐invented US patents. The magnitude of international presence appears to negatively affect the citation counts of ETRI‐invented US patents.  相似文献   
17.
在基于MPLS的层次化移动IP网络中支持DiffServ的研究   总被引:2,自引:0,他引:2  
陈伟  邓银波  陈前斌  李云  隆克平 《通信学报》2004,25(12):102-112
MPLS支持DiffServ、流量工程,能为网络提供较好的QoS保证,而移动IP(MIP)能为移动设备提供较好的移动性支持。文章探讨了在无线接入网中MPLS和MIP结合实现DiffServ的方案,并给出了一种在基于MPLS的层次化MIP网络结构中支持DiffServ的体系结构,设计了其节点功能模型和关键协议。方案中利用了层次化结构的区域注册和重路由机制,减少了切换时延和网络的信令负荷。  相似文献   
18.
In order to describe the dynamics of the tJ model, two different families of first-order Lagrangians in terms of the generators of the Hubbard algebra are found. Such families correspond to different dynamical second-class constrained systems. The quantization is carried out by using the path-integral formalism. In this context the introduction of proper ghost fields is needed to render the model renormalizable. In each case the standard Feynman diagrammatics is obtained and the renormalized physical quantities are computed and analyzed. In the first case a nonperturbative large-N expansion is considered with the purpose of studying the generalized Hubbard model describing N-fold-degenerate correlated bands. In this case the 1/N correction to the renormalized boson propagator is computed. In the second case the perturbative Lagrangian formalism is developed and it is shown how propagators and vertices can be renormalized to each order. In particular, the renormalized ferromagnetic magnon propagator coming from our formalism is studied in details. As an example the thermal softening of the magnon frequency is computed. The antiferromagnetic case is also analyzed, and the results are confronted with previous one obtained by means of the spin-polaron theories.  相似文献   
19.
The users' interest can be mined from the web cache and can be used widely. The interest can be specialized by the two-tuple (term, weight) in the simple interest model, in which the association relations are not mined, and then the interest cannot be associated in expressing the users' interest. Based on analyzing the WWW cache model, this letter brings forward a two-dimensional interest model and gives the interrelated methods on how to store the two-dimensional interest model effectively.  相似文献   
20.
The users‘ interest can be mined from the web cache and can be used widely.The interest can be specialized by the two-tuple(term,weight) in the simple interest model,in which the association relations are not mined.and then interest cannot be associated in expressing the users‘interest.Based on analyzing the WWW cache model,this letter brings forward a twodimensional interest model and gives the interrelated methods on how to store the two-dimensional interest model effectively.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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