首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   55875篇
  免费   12168篇
  国内免费   1487篇
化学   49010篇
晶体学   462篇
力学   806篇
数学   3004篇
物理学   5275篇
无线电   10973篇
  2023年   225篇
  2022年   194篇
  2021年   617篇
  2020年   2031篇
  2019年   3400篇
  2018年   1699篇
  2017年   1255篇
  2016年   4355篇
  2015年   4380篇
  2014年   4462篇
  2013年   5420篇
  2012年   4385篇
  2011年   3758篇
  2010年   3872篇
  2009年   3903篇
  2008年   3682篇
  2007年   2974篇
  2006年   2555篇
  2005年   2662篇
  2004年   2274篇
  2003年   2013篇
  2002年   2676篇
  2001年   1833篇
  2000年   1699篇
  1999年   694篇
  1998年   276篇
  1997年   278篇
  1996年   251篇
  1995年   191篇
  1994年   171篇
  1993年   134篇
  1992年   151篇
  1991年   102篇
  1990年   115篇
  1989年   87篇
  1988年   69篇
  1987年   49篇
  1986年   37篇
  1985年   64篇
  1984年   50篇
  1983年   43篇
  1982年   47篇
  1981年   34篇
  1980年   27篇
  1979年   31篇
  1978年   36篇
  1977年   33篇
  1976年   31篇
  1975年   24篇
  1970年   22篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
92.
With the advent of IP technologies and the tremendous growth in data traffic, the wireless industry is evolving its core networks toward IP technology. Enabling wireless Internet access is one of the upcoming challenges for mobile radio network operators. The General Packet Radio Service is the packet-switched extension of GSM and was developed to facilitate access to IP-based services better than existing circuit-switched services provided by GSM. We illustrate how a visited mobile subscriber on a GPRS/UMTS network can access his/her home network via the gateway GPRS support node (GGSN). We also propose some implementation ideas on wireless Internet access for a remote mobile subscriber based on a GPRS/UMTS network  相似文献   
93.
94.
Highly efficient orange and green emission from single‐layered solid‐state light‐emitting electrochemical cells based on cationic transition‐metal complexes [Ir(ppy)2sb]PF6 and [Ir(dFppy)2sb]PF6 (where ppy is 2‐phenylpyridine, dFppy is 2‐(2,4‐difluorophenyl)pyridine, and sb is 4,5‐diaza‐9,9′‐spirobifluorene) is reported. Photoluminescence measurements show highly retained quantum yields for [Ir(ppy)2sb]PF6 and [Ir(dFppy)2 sb]PF6 in neat films (compared with quantum yields of these complexes dispersed in m‐bis(N‐carbazolyl)benzene films). The spiroconfigured sb ligands effectively enhance the steric hindrance of the complexes and reduce the self‐quenching effect. The devices that use single‐layered neat films of [Ir(ppy)2sb]PF6 and [Ir(dFppy)2sb]PF6 achieve high peak external quantum efficiencies and power efficiencies of 7.1 % and 22.6 lm W–1) at 2.5 V, and 7.1 % and 26.2 lm W–1 at 2.8 V, respectively. These efficiencies are among the highest reported for solid‐state light‐emitting electrochemical cells, and indicate that cationic transition‐metal complexes containing ligands with good steric hindrance are excellent candidates for highly efficient solid‐state electrochemical cells.  相似文献   
95.
A novel and direct method for the synthesis of α-halocarbonyl compounds using sequential treatment of carbonyl compounds with [hydroxy(tosyloxy)iodo]benzene followed by magnesium halides under solvent-free microwave irradiation conditions is described.  相似文献   
96.
Existing location-based routing protocols are not versatile enough for a large-scale ad hoc environment to simultaneously meet all of the requirements of scalability, bandwidth efficiency, energy efficiency, and quality-of-service routing. To remedy this deficiency, we propose an optimal tradeoff approach that: 1) constructs a hybrid routing protocol by combining well-known location-update schemes (i.e., proactive location updates within nodes' local regions and a distributed location service), and 2) derives its optimal configuration, in terms of location-update thresholds (both distance and time-based), to minimize the overall routing overhead. We also build a route-discovery scheme based on an Internet-like architecture, i.e., first querying the location of a destination, then applying a series of local-region routing until finding a complete route by aggregating the thus-found partial routes. To find the optimal thresholds for the hybrid protocol, we derive the costs associated with both location updates and route discovery as a function of location-update thresholds, assuming a random mobility model and a general distribution for route request arrivals. The problem of minimizing the total cost is then cast into a distributed optimization problem. We first prove that the total cost is a convex function of the thresholds, and then derive the optimal thresholds. Finally, we show, via simulation, that our analysis results indeed capture the real behavior.  相似文献   
97.
Network direct attached storage (NDAS) is a network storage architecture that allows direct attachment of existing ATA/ATAPI devices to Ethernet without a separate server. Unlike other architectures such as NAS, SAN, and USB mass storage, no server computer intervenes between the storage and the client hosts. We describe an NDAS disk controller (NDC) amenable to low-cost single-chip implementation that processes a simplified L3/L4 protocol and converts commands between ATA/ATAPI and Ethernet, while the remaining complex tasks are performed by remote hosts. Unlike NAS architectures that use TCP/IP, NDAS uses a TCP-like lean protocol that lends itself well to high-performance hardware realization. Thanks to the simple NDAS architecture and protocol, an NDC implemented on a single 4 mm /spl times/ 4 mm chip in 0.18 /spl mu/m CMOS technology achieves a maximum throughput of 55 Mbytes/s on gigabit Ethernet, which is comparable to that of a high-performance disk locally attached to a host computer.  相似文献   
98.
We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original (in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.  相似文献   
99.
100.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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