首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3646篇
  免费   102篇
  国内免费   19篇
化学   2253篇
晶体学   24篇
力学   46篇
数学   394篇
物理学   475篇
无线电   575篇
  2023年   16篇
  2022年   24篇
  2021年   49篇
  2020年   61篇
  2019年   45篇
  2018年   60篇
  2017年   42篇
  2016年   102篇
  2015年   90篇
  2014年   133篇
  2013年   182篇
  2012年   303篇
  2011年   361篇
  2010年   226篇
  2009年   226篇
  2008年   294篇
  2007年   244篇
  2006年   223篇
  2005年   216篇
  2004年   195篇
  2003年   138篇
  2002年   78篇
  2001年   62篇
  2000年   37篇
  1999年   51篇
  1998年   20篇
  1997年   27篇
  1996年   25篇
  1995年   18篇
  1994年   15篇
  1993年   24篇
  1992年   18篇
  1991年   16篇
  1990年   9篇
  1989年   10篇
  1988年   12篇
  1987年   10篇
  1986年   6篇
  1985年   18篇
  1984年   11篇
  1983年   7篇
  1982年   4篇
  1981年   6篇
  1980年   11篇
  1979年   12篇
  1978年   5篇
  1977年   7篇
  1976年   4篇
  1974年   3篇
  1966年   3篇
排序方式: 共有3767条查询结果,搜索用时 93 毫秒
851.
A new selective method for the synthesis of nanocrystalline manganese dioxide (α-, β-, and γ-MnO2) based on the reaction of potassium permanganate with 2,4,6-triamino-1,3,5-triazine (melamine) under hydrothermal conditions has been proposed. Effect of synthesis conditions on the phase composition of the products has been revealed. A new manganese-containing phase with layered structure has been prepared.  相似文献   
852.
853.
In this paper, a novel architecture for an MQ arithmetic coder with high throughput is proposed. The architecture can process two symbols in parallel. The main characteristics are eight process elements for the prediction of probability interval A, the combination of calculation units for the code register C with the Byteout&Flush procedure, and the use of a dedicated probability estimation table to decrease the internal memory. From FPGA synthesis results, the architecture’s throughput can reach 96.60 M context symbols per second with an internal memory size of 1509 bits, which is comparable to that of other architectures and suitable for chip implementation.  相似文献   
854.
855.
Scientific applications are often not written with multiprocessing, cluster computing or grid computing in mind. This paper suggests using Python and PyCSP to structure scientific software through Communicating Sequential Processes. Three scientific applications are used to demonstrate the features of PyCSP and how networks of processes may easily be mapped into a visual representation for better understanding of the process workflow. We show that for many sequential solutions, the difficulty in implementing a parallel application is removed. The use of standard multi-threading mechanisms such as locks, conditions and monitors is completely hidden in the PyCSP library. We show the three scientific applications: kNN, stochastic minimum search and McStas to scale well on multi-processing, cluster computing and grid computing platforms using PyCSP.  相似文献   
856.
857.
858.
An azanorbornadiene bromovinyl sulfone reagent for cysteine-selective bioconjugation has been developed. Subsequent reaction with dipyridyl tetrazine leads to bond cleavage and formation of a pyrrole-linked conjugate. The latter involves ligation of the tetrazine to the azanorbornadiene-tagged protein through inverse electron demand Diels–Alder cycloaddition with subsequent double retro-Diels–Alder reactions to form a stable pyrrole linkage. The sequence of site-selective bioconjugation followed by bioorthogonal bond cleavage was efficiently employed for the labelling of three different proteins. This method benefits from easy preparation of these reagents, selectivity for cysteine, and stability after reaction with a commercial tetrazine, which has potential for the routine preparation of protein conjugates for chemical biology studies.  相似文献   
859.
With the recent increase in data disclosure, the Comprehensive Knowledge Archive Network (CKAN), which is an open-source data distribution platform, is drawing much attention. CKAN is used together with additional extensions, such as Datastore and Datapusher for data management and Harvest and DCAT for data collection. This study derives the problems of CKAN itself and Harvest Extension. First, CKAN causes two problems of data inconsistency and storage space waste for data deletion. Second, Harvest Extension causes three additional problems, namely source deletion that deletes only sources without deleting data themselves, job stop that cannot delete job during data collection, and service interruption that cannot provide service, even if data exist. Based on these observations, we propose herein an improved CKAN that provides a new deletion function solving data inconsistency and storage space waste problems. In addition, we present an improved Harvest Extension solving three problems of the legacy Harvest Extension. We verify the correctness and the usefulness of the improved CKAN and Harvest Extension functions through actual implementation and extensive experiments.  相似文献   
860.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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