全文获取类型
收费全文 | 1276篇 |
免费 | 69篇 |
国内免费 | 1篇 |
专业分类
化学 | 690篇 |
晶体学 | 2篇 |
力学 | 65篇 |
数学 | 207篇 |
物理学 | 274篇 |
无线电 | 108篇 |
出版年
2024年 | 1篇 |
2023年 | 24篇 |
2022年 | 47篇 |
2021年 | 70篇 |
2020年 | 50篇 |
2019年 | 52篇 |
2018年 | 46篇 |
2017年 | 31篇 |
2016年 | 75篇 |
2015年 | 63篇 |
2014年 | 43篇 |
2013年 | 85篇 |
2012年 | 108篇 |
2011年 | 120篇 |
2010年 | 56篇 |
2009年 | 40篇 |
2008年 | 69篇 |
2007年 | 68篇 |
2006年 | 73篇 |
2005年 | 48篇 |
2004年 | 47篇 |
2003年 | 46篇 |
2002年 | 19篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1932年 | 1篇 |
1912年 | 1篇 |
1903年 | 1篇 |
1877年 | 1篇 |
排序方式: 共有1346条查询结果,搜索用时 31 毫秒
121.
122.
Hierarchically Structured Magnetic Nanoconstructs with Enhanced Relaxivity and Cooperative Tumor Accumulation 下载免费PDF全文
Ayrat Gizzatov Jaehong Key Santosh Aryal Jeyarama Ananta Antonio Cervadoro Anna Lisa Palange Matteo Fasano Cinzia Stigliano Meng Zhong Daniele Di Mascolo Adem Guven Eliodoro Chiavazzo Pietro Asinari Xuewu Liu Mauro Ferrari Lon J. Wilson Paolo Decuzzi 《Advanced functional materials》2014,24(29):4584-4594
Iron oxide nanoparticles are formidable multifunctional systems capable of contrast enhancement in magnetic resonance imaging, guidance under remote fields, heat generation, and biodegradation. Yet, this potential is underutilized in that each function manifests at different nanoparticle sizes. Here, sub‐micrometer discoidal magnetic nanoconstructs are realized by confining 5 nm ultra‐small super‐paramagnetic iron oxide nanoparticles (USPIOs) within two different mesoporous structures, made out of silicon and polymers. These nanoconstructs exhibit transversal relaxivities up to ≈10 times (r 2 ≈ 835 mm ?1 s?1) higher than conventional USPIOs and, under external magnetic fields, collectively cooperate to amplify tumor accumulation. The boost in r 2 relaxivity arises from the formation of mesoscopic USPIO clusters within the porous matrix, inducing a local reduction in water molecule mobility as demonstrated via molecular dynamics simulations. The cooperative accumulation under static magnetic field derives from the large amount of iron that can be loaded per nanoconstuct (up to ≈65 fg) and the consequential generation of significant inter‐particle magnetic dipole interactions. In tumor bearing mice, the silicon‐based nanoconstructs provide MRI contrast enhancement at much smaller doses of iron (≈0.5 mg of Fe kg?1 animal) as compared to current practice. 相似文献
123.
124.
We consider Maxwell’s equations with periodic coefficients as it is usually done for the modeling of photonic crystals. Using Bloch/Floquet theory, the problem reduces in a standard way to a modification of the Maxwell cavity eigenproblem with periodic boundary conditions. Following [8], a modification of edge finite elements is considered for the approximation of the band gap. The method can be used with meshes of tetrahedrons or parallelepipeds. A rigorous analysis of convergence is presented, together with some preliminary numerical results in 2D, which fully confirm the robustness of the method. The analysis uses well established results on the discrete compactness for edge elements, together with new sharper interpolation estimates. 相似文献
125.
126.
We present an original detailed theoretical modeling of guided-wave noncollinear acoustooptic (AO) interaction produced by a multifrequency surface acoustic wave (SAW) in planar guided-wave structures. The modeling of the multifrequency AO interaction is based on a modified version of the coupled-mode theory. The first- and third-order diffraction efficiency and optimum dynamic range of the Bragg cell have been calculated as a function of acoustic power, acoustic radiofrequency, and optical waveguide parameters in Y-cut Ti:LiNbO3 planar waveguides. Polynomial approximations, describing the first and third order diffraction efficiency versus normalized acoustic power in the cases of two- and three-frequency interactions, are derived and presented for the first time for arbitrarily large RF signals 相似文献
127.
128.
Pierre Bonami Gérard Cornuéjols Sanjeeb Dash Matteo Fischetti Andrea Lodi 《Mathematical Programming》2008,113(2):241-257
Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure integer linear program (ILP) often
gives a surprisingly tight approximation of the integer hull. They optimize over the first Chvátal closure by modeling the
Chvátal–Gomory (CG) separation problem as a mixed integer linear program (MILP) which is then solved by a general- purpose
MILP solver. Unfortunately, this approach does not extend immediately to the Gomory mixed integer (GMI) closure of an MILP,
since the GMI separation problem involves the solution of a nonlinear mixed integer program or a parametric MILP. In this
paper we introduce a projected version of the CG cuts, and study their practical effectiveness for MILP problems. The idea
is to project first the linear programming relaxation of the MILP at hand onto the space of the integer variables, and then
to derive Chvátal–Gomory cuts for the projected polyhedron. Though theoretically dominated by GMI cuts, projected CG cuts
have the advantage of producing a separation model very similar to the one introduced by Fischetti and Lodi, which can typically
be solved in a reasonable amount of computing time.
Gérard Cornuéjols was supported in part by NSF grant DMI-0352885, ONR grant N00014-03-1-0188, and ANR grant BLAN 06-1-138894.
Matteo Fischetti was supported in part by the EU projects ADONET (contract n. MRTN-CT-2003-504438) and ARRIVAL (contract n.
FP6-021235-2). Andrea Lodi was supported in part by the EU projects ADONET (contract n. MRTN-CT-2003-504438) and ARRIVAL (contract
n. FP6-021235-2). 相似文献
129.
In this paper, new lower bounds for the asymmetric travelling salesman problem are presented, based on spanning arborescences. The new bounds are combined in an additive procedure whose theoretical performance is compared with that of the Balas and Christofides procedure (1981). Both procedures have been imbedded in a simple branch and bound algorithm and experimentally evaluated on hard test problems. 相似文献
130.