首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   71957篇
  免费   10726篇
  国内免费   4730篇
化学   8279篇
晶体学   320篇
力学   6166篇
综合类   800篇
数学   12265篇
物理学   20072篇
无线电   39511篇
  2024年   196篇
  2023年   748篇
  2022年   1405篇
  2021年   1850篇
  2020年   2062篇
  2019年   1528篇
  2018年   1501篇
  2017年   2388篇
  2016年   2947篇
  2015年   3092篇
  2014年   5153篇
  2013年   5222篇
  2012年   5434篇
  2011年   5585篇
  2010年   4267篇
  2009年   4268篇
  2008年   4880篇
  2007年   5103篇
  2006年   4500篇
  2005年   3852篇
  2004年   3432篇
  2003年   3129篇
  2002年   2523篇
  2001年   2074篇
  2000年   1737篇
  1999年   1452篇
  1998年   1236篇
  1997年   1009篇
  1996年   847篇
  1995年   807篇
  1994年   569篇
  1993年   509篇
  1992年   392篇
  1991年   358篇
  1990年   241篇
  1989年   172篇
  1988年   191篇
  1987年   117篇
  1986年   99篇
  1985年   120篇
  1984年   74篇
  1983年   45篇
  1982年   60篇
  1981年   54篇
  1980年   38篇
  1979年   37篇
  1978年   24篇
  1977年   14篇
  1976年   16篇
  1957年   12篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
深圳市大型商场空气品质的测试与分析   总被引:3,自引:0,他引:3  
本文根据对位于深圳市不同片区的五家大型商场进行室内空气品质现场检测所得的数据,分析了这些商场的室内空气品质状况,各商场不同楼层、不同售货区的空气品质参数分布规律,以及周末、平日、不同时段室内空气品质参数的变化规律,并结合现场实际情况对其原因进行了分析。  相似文献   
2.
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.  相似文献   
3.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.  相似文献   
4.
针对有线电视系统工程建设的特点,依照《招标投标法》的规定和程序,对有线电视系统工程招标的种类、招标方式、招标工程必备的条件、标底的编制及审定、开标、评标和中标的原则进行详细介绍,对招标文件的编制进行具体说明。  相似文献   
5.
软件开发重要的是 :确定编程语言 ,代码设计 ,程序设计 ,软件试验 ,人员培训等步骤  相似文献   
6.
Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).  相似文献   
7.
AD2S80在测角系统中的应用   总被引:1,自引:0,他引:1  
DS2S80是美国AD公司生产的以鉴幅方式对感应同步器信号进行处理的专用芯片。由它与感应同步器构成的测角系统具有成本低、功耗小、所需外部元件少、可靠性好等优点。介绍了AD2S80数字转换芯片的引脚、组成测角系统的工作原理、外围电路的设计,给出了一种半量式测角系统的实现方案。  相似文献   
8.
本主要介绍基于CDMA智能网平台的一种增值业务——“位置服务”,阐述这个业务的网络结构、涉及到的技术问题和解决方案,并将这个整体思路投入到开发业务中去。  相似文献   
9.
We study the electronic states of different GaAs-AlAs Fibonacci quasi-perodic heterostructures grown along the (001) direction. We employ an empirical tight-binding Hamiltonian including spin-orbit coupling together with the surface Green function matching method. We present results for the eighth Fibonacci generation formed from different building blocks. We compare these results with those of the constituent quantum wells and with those of heterostructures containing the same number of GaAs and AlAs slabs after periodic repetition of the building blocks. No Fibonacci spectrum is found in the energy regions near the conduction and valence band edges of GaAs. A selective localization of the local density of states in the GaAs layers is found for many electronic states.  相似文献   
10.
The turbulent flow in a compound meandering channel with a rectangular cross section is one of the most complicated turbulent flows, because the flow behaviour is influenced by several kinds of forces, including centrifugal forces, pressure‐driven forces and shear stresses generated by momentum transfer between the main channel and the flood plain. Numerical analysis has been performed for the fully developed turbulent flow in a compound meandering open‐channel flow using an algebraic Reynolds stress model. The boundary‐fitted coordinate system is introduced as a method for coordinate transformation in order to set the boundary conditions along the complicated shape of the meandering open channel. The turbulence model consists of transport equations for turbulent energy and dissipation, in conjunction with an algebraic stress model based on the Reynolds stress transport equations. With reference to the pressure–strain term, we have made use of a modified pressure–strain term. The boundary condition of the fluctuating vertical velocity is set to zero not only for the free surface, but also for computational grid points next to the free surface, because experimental results have shown that the fluctuating vertical velocity approaches zero near the free surface. In order to examine the validity of the present numerical method and the turbulent model, the calculated results are compared with experimental data measured by laser Doppler anemometer. In addition, the compound meandering open channel is clarified somewhat based on the calculated results. As a result of the analysis, the present algebraic Reynolds stress model is shown to be able to reasonably predict the turbulent flow in a compound meandering open channel. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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