全文获取类型
收费全文 | 148480篇 |
免费 | 12441篇 |
国内免费 | 13617篇 |
专业分类
化学 | 74993篇 |
晶体学 | 1201篇 |
力学 | 3025篇 |
综合类 | 1123篇 |
数学 | 14809篇 |
物理学 | 24004篇 |
无线电 | 55383篇 |
出版年
2024年 | 315篇 |
2023年 | 1480篇 |
2022年 | 2914篇 |
2021年 | 3533篇 |
2020年 | 3992篇 |
2019年 | 3402篇 |
2018年 | 3110篇 |
2017年 | 4737篇 |
2016年 | 5008篇 |
2015年 | 5160篇 |
2014年 | 7198篇 |
2013年 | 10262篇 |
2012年 | 10506篇 |
2011年 | 9410篇 |
2010年 | 7461篇 |
2009年 | 9014篇 |
2008年 | 9586篇 |
2007年 | 10160篇 |
2006年 | 9267篇 |
2005年 | 7848篇 |
2004年 | 7177篇 |
2003年 | 6147篇 |
2002年 | 6722篇 |
2001年 | 4315篇 |
2000年 | 3829篇 |
1999年 | 3390篇 |
1998年 | 2969篇 |
1997年 | 2416篇 |
1996年 | 2079篇 |
1995年 | 1913篇 |
1994年 | 1613篇 |
1993年 | 1300篇 |
1992年 | 1152篇 |
1991年 | 803篇 |
1990年 | 653篇 |
1989年 | 574篇 |
1988年 | 421篇 |
1987年 | 317篇 |
1986年 | 302篇 |
1985年 | 245篇 |
1984年 | 255篇 |
1983年 | 145篇 |
1982年 | 218篇 |
1981年 | 186篇 |
1980年 | 197篇 |
1979年 | 187篇 |
1978年 | 169篇 |
1977年 | 128篇 |
1976年 | 109篇 |
1973年 | 67篇 |
排序方式: 共有10000条查询结果,搜索用时 343 毫秒
941.
Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem 总被引:2,自引:0,他引:2
In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size. 相似文献
942.
LaurieWallace 《世界电信》2002,15(3):51-53
为了构筑第三代无线网络,人们需要对现有基础设施进行彻底改造,包括网络的发射基站。配置在无线基站中的新型数字控制功率放大器能够改善频谱利用率和功率效率,从而提高系统容量。PMC-Sierra公司的数字控制功率放大器采用了数字校正信号处理器(DCSP)以及自适应控制处理器和补偿估值器(ACPCE),该放大器可改善无线基础设施的可靠性,同时降低系统成本、规模及复杂性。 相似文献
943.
P. Ravirajan S.A. Haque J.R. Durrant D.D.C. Bradley J. Nelson 《Advanced functional materials》2005,15(4):609-618
We report a study of the effects of polymer optoelectronic properties on the performance of photovoltaic devices consisting of nanocrystalline TiO2 and a conjugated polymer. Three different poly(2‐methoxy‐5‐(2′‐ethylhexoxy)‐1,4‐phenylenevinylene) (MEH‐PPV)‐based polymers and a fluorene–bithiophene copolymer are compared. We use photoluminescence quenching, time‐of‐flight mobility measurements, and optical spectroscopy to characterize the exciton‐transport, charge‐transport, and light‐harvesting properties, respectively, of the polymers, and correlate these material properties with photovoltaic‐device performance. We find that photocurrent is primarily limited by the photogeneration rate and by the quality of the interfaces, rather than by hole transport in the polymer. We have also studied the photovoltaic performance of these TiO2/polymer devices as a function of the fabrication route and device design. Including a dip‐coating step before spin‐coating the polymer leads to excellent polymer penetration into highly structured TiO2 networks, as was confirmed through transient optical measurements of the photoinduced charge‐transfer yield and recombination kinetics. Device performance is further improved for all material combinations studied, by introducing a layer of poly(ethylene dioxythiophene) (PEDOT) doped with poly(styrene sulfonic acid) (PSS) under the top contact. Optimized devices incorporating the additional dip‐coated and PEDOT:PSS layers produced a short‐circuit current density of about 1 mA cm–2, a fill factor of 0.50, and an open‐circuit voltage of 0.86 V under simulated AM 1.5 illumination (100 mW cm–2, 1 sun). The corresponding power conversion efficiency under 1 sun was ≥ 0.4 %. 相似文献
944.
945.
This paper examines the performance of Commodity Trading Advisors (CTAs) using fixed and variable benchmarking models. In
order to avoid the troublesome passive and active commodity and managed futures benchmarks (indices) when examining the performance
of CTAs, we innovate by using data envelopment analysis (DEA). Because this alternative class has non-linear returns due to
long/short positions, and derivatives (i.e., dynamic trading strategies), DEA can alleviate the problems usually associated
with these indices. The effectiveness of using benchmarking models in a DEA setting will provide investors with an alternative
technique in assessing the performance and identifying efficient CTAs. 相似文献
946.
氨酪酸(am inobutyric acid),化学名称为γ-氨基丁酸。本品在体内与血氨结合生成尿毒排出体外,有降低血氨及促进大脑新陈代谢的作用,能够增强葡萄糖磷酸酯化酶的活性,利于脑细胞功能的恢复。主要用于脑卒中后遗症、脑动脉硬化症、头部外伤后以及一氧化碳中毒所致昏迷的辅助治疗 相似文献
947.
948.
Aryl substituted α-carbonyl bromo-alkynes undergo facile cyclizations to the corresponding substituted 4-methylene-tetrahydrofurans using indium(I) iodide in acetonitrile under sonication in high yields. The reaction is predicted to proceed via a radical process initiated by InI and a plausible radical pathway is suggested. 相似文献
949.
950.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献