全文获取类型
收费全文 | 49038篇 |
免费 | 3351篇 |
国内免费 | 2392篇 |
专业分类
化学 | 23237篇 |
晶体学 | 230篇 |
力学 | 3403篇 |
综合类 | 854篇 |
数学 | 15865篇 |
物理学 | 11192篇 |
出版年
2023年 | 370篇 |
2022年 | 936篇 |
2021年 | 1875篇 |
2020年 | 1017篇 |
2019年 | 1120篇 |
2018年 | 871篇 |
2017年 | 1053篇 |
2016年 | 1278篇 |
2015年 | 1169篇 |
2014年 | 1770篇 |
2013年 | 2896篇 |
2012年 | 2062篇 |
2011年 | 2159篇 |
2010年 | 2061篇 |
2009年 | 2569篇 |
2008年 | 2682篇 |
2007年 | 2964篇 |
2006年 | 2304篇 |
2005年 | 1619篇 |
2004年 | 1465篇 |
2003年 | 1538篇 |
2002年 | 3926篇 |
2001年 | 1598篇 |
2000年 | 1151篇 |
1999年 | 936篇 |
1998年 | 951篇 |
1997年 | 759篇 |
1996年 | 759篇 |
1995年 | 728篇 |
1994年 | 677篇 |
1993年 | 699篇 |
1992年 | 671篇 |
1991年 | 464篇 |
1990年 | 400篇 |
1989年 | 339篇 |
1988年 | 340篇 |
1987年 | 251篇 |
1986年 | 251篇 |
1985年 | 394篇 |
1984年 | 295篇 |
1983年 | 166篇 |
1982年 | 321篇 |
1981年 | 493篇 |
1980年 | 454篇 |
1979年 | 506篇 |
1978年 | 396篇 |
1977年 | 316篇 |
1976年 | 264篇 |
1974年 | 81篇 |
1973年 | 154篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
Pb8FeIIFeF24 is triclinic: a = 20.118(3) Å, b = 5.597(1) Å, c = 9.440(2) Å, α = 89.75(2)°, β = 105.79(2)°, α = 89.38(2)°, Z = 2. The structure is solved in the unconventional space group C1 , from X-ray single crystal data using 1 641 independent reflections (R = 0.048, Rw = 0.051). It is built up from the stacking of two subnetworks along the a axis: fluorite-like [Pb8F10]n6n+ layers and infinite dimetallic [FeIIFeF14]n6n? double-chains of corner-sharing octahedra running along the b axis. 相似文献
972.
P. Torline G. du Plessis N. Schnautz J. C. Thompson 《Journal of separation science》1979,2(10):613-616
A detailed method for the routine preparation of glass capillary columns is presented. The method consists of coating a glass tube with quartz powder prior to pulling the tube into a capillary. The inner surface of the capillary consists of an even distribution of quartz particles fused to the walls. This surface has been found readily deactivated by standard procedures and ideal for the preparation of thick-film glass capillary columns. The method has been thoroughly tested in two independent laboratories to ensure that the procedures described are reproducible. 相似文献
973.
Extrapolated Smoothing Descent Algorithm for Constrained Nonconvex and Nonsmooth Composite Problems*
In this paper, the authors propose a novel smoothing descent type algorithm with extrapolation for solving a class of constrained nonsmooth and nonconvex problems,where the nonconvex term is possibly nonsmooth. Their algorithm adopts the proximal gradient algorithm with extrapolation and a safe-guarding policy to minimize the smoothed objective function for better practical and theoretical performance. Moreover, the algorithm uses a easily checking rule to update the smoothing parameter to ensure that any accumulation point of the generated sequence is an (affine-scaled) Clarke stationary point of the original nonsmooth and nonconvex problem. Their experimental results indicate the effectiveness of the proposed algorithm. 相似文献
974.
《Journal of Pure and Applied Algebra》2022,226(12):107144
We consider parametric optimization problems from an algebraic viewpoint. The idea is to find all of the critical points of an objective function thereby determining a global optimum. For generic parameters (data) in the objective function the number of critical points remains constant. This number is known as the algebraic degree of an optimization problem. In this article, we go further by considering the inverse problem of finding parameters of the objective function so it gives rise to critical points exhibiting a special structure. For example if the critical point is in the singular locus, has some symmetry, or satisfies some other algebraic property. Our main result is a theorem describing such parameters. 相似文献
975.
《Operations Research Letters》2022,50(4):399-406
We consider the problem faced by an online service platform that matches suppliers with consumers. Unlike traditional matching models, which treat them as passive participants, we allow both sides of the market to exercise their choices. To model this setting, we introduce a two-sided assortment optimization model wherein each participant's choice is modeled using a multinomial logit choice function, and the platform's objective is to maximize its expected revenue. We first show that the problem is NP-hard even when the number of suppliers is limited to two and provide a mixed-integer linear programming formulation. Next, we discuss two simple greedy heuristics and argue that these can lead to arbitrarily bad solutions. We then develop relaxations that provide upper and lower bounds and investigate the tightness of these relaxations by obtaining parametric approximation guarantees. Finally, we present numerical results on synthetic data demonstrating the practical utility of these relaxations. 相似文献
976.
《Operations Research Letters》2022,50(6):655-659
In finite graphs, greedy algorithms are used to find minimum spanning trees (MinST) and maximum spanning trees (MaxST). In infinite graphs, we illustrate a general class of problems where a greedy approach discovers a MaxST while a MinST may be unreachable. Our algorithm is a natural extension of Prim's to infinite graphs with summable and strictly positive edge weights, producing a sequence of finite trees that converge to a MaxST. 相似文献
977.
Lamination Design Optimization for Continuous Fiber Reinforced Composites of Variable Thicknesses北大核心CSCD 下载免费PDF全文
由于具备高的比强度、比刚度,利用连续纤维增强复合材料代替传统金属材料以实现结构轻量化正受到设计者们的广泛关注。然而,结构的复杂性给复合材料的铺层设计与优化带来了很大的挑战。针对航空用复合材料铺层设计约束多的问题,通过逐步构建设计变量准确表达结构的铺层信息。基于经典遗传算法框架,结合各设计变量特点,定义了铺层优化算法中的遗传算子,通过引入“修复”策略保证了每一代解都能满足设计约束,分布在可行域区间内。最后利用精英保留策略提高了算法的局部寻优能力,可以降低复杂复合材料结构铺层设计的计算成本。通过解决经典benchmark问题并与已有优化结果的比较,验证了前述铺层优化算法的全局、局部寻优能力,为工程实际中的复合材料铺层设计优化提供了理论支撑。 相似文献
978.
979.
本文研究滚装码头混合泊位分配和劳动力分配的联合调度优化问题。首先,考虑潮汐时间窗约束、装卸劳动力约束、泊位缆桩分布约束以及泊位不规则布局因素,建立以最小化船舶总服务时间为目标的混合整数规划模型。其次,采用内外嵌套算法设计策略,提出求解该类问题的组合算法。其中,外层是多种群并行进化的遗传算法,生成多种船舶计划顺序,内层为基于规则的启发式算法,用于计算给定计划顺序的目标函数值。然后,基于实际运营数据,生成多组不同规模的算例进行全面数值实验,结果表明所提出的算法可在10分钟内求解包含50艘船、100个泊段的算例。最后,开展基于真实滚装码头运营实例的案例分析,对所提模型和算法在实际码头调度问题中的适用性与高效性进行验证。 相似文献
980.