全文获取类型
收费全文 | 8787篇 |
免费 | 1040篇 |
国内免费 | 816篇 |
专业分类
化学 | 746篇 |
晶体学 | 24篇 |
力学 | 789篇 |
综合类 | 163篇 |
数学 | 6444篇 |
物理学 | 2477篇 |
出版年
2024年 | 8篇 |
2023年 | 80篇 |
2022年 | 100篇 |
2021年 | 145篇 |
2020年 | 205篇 |
2019年 | 213篇 |
2018年 | 213篇 |
2017年 | 269篇 |
2016年 | 262篇 |
2015年 | 213篇 |
2014年 | 352篇 |
2013年 | 791篇 |
2012年 | 405篇 |
2011年 | 457篇 |
2010年 | 424篇 |
2009年 | 550篇 |
2008年 | 571篇 |
2007年 | 580篇 |
2006年 | 590篇 |
2005年 | 497篇 |
2004年 | 419篇 |
2003年 | 387篇 |
2002年 | 394篇 |
2001年 | 340篇 |
2000年 | 297篇 |
1999年 | 290篇 |
1998年 | 248篇 |
1997年 | 194篇 |
1996年 | 184篇 |
1995年 | 116篇 |
1994年 | 123篇 |
1993年 | 87篇 |
1992年 | 68篇 |
1991年 | 63篇 |
1990年 | 59篇 |
1989年 | 37篇 |
1988年 | 53篇 |
1987年 | 32篇 |
1986年 | 33篇 |
1985年 | 46篇 |
1984年 | 43篇 |
1983年 | 22篇 |
1982年 | 37篇 |
1981年 | 23篇 |
1980年 | 24篇 |
1979年 | 26篇 |
1978年 | 17篇 |
1977年 | 16篇 |
1976年 | 9篇 |
1974年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
玻尔兹曼方程作为空气动理学中最基本的方程之一,是连接微观牛顿力学和宏观连续介质力学的重要桥梁.该方程描述了一个由大量粒子组成的复杂系统的非平衡态时间演化:除了基本的输运项,其最重要的特性是粒子间的相互碰撞由一个高维,非局部且非线性的积分算子来描述,从而给玻尔兹曼方程的数值求解带来非常大的挑战.在过去的二十年间,基于傅里叶级数的谱方法成为了数值求解玻尔兹曼方程的一种很受欢迎且有效的确定性算法.这主要归功于谱方法的高精度及它可以被快速傅里叶变换加速的特质.本文将回顾玻尔兹曼方程的傅里叶谱方法,具体包括方法的导出,稳定性和收敛性分析,快速算法,以及在一大类基于碰撞的空气动理学方程中的推广. 相似文献
2.
Dariusz Marek Adam Domaski Joanna Domaska Jakub Szygua Tadeusz Czachrski Jerzy Klamka 《Entropy (Basel, Switzerland)》2021,23(5)
In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature. 相似文献
3.
4.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice. 相似文献
5.
《Mathematical Methods in the Applied Sciences》2018,41(14):5691-5710
We consider a 2 time scale nonlinear system of ordinary differential equations. The small parameter of the system is the ratio ϵ of the time scales. We search for an approximation involving only the slow time unknowns and valid uniformly for all times at order O(ϵ2). A classical approach to study these problems is Tikhonov's singular perturbation theorem. We develop an approach leading to a higher order approximation using the renormalization group (RG) method. We apply it in 2 steps. In the first step, we show that the RG method allows for approximation of the fast time variables by their RG expansion taken at the slow time unknowns. Next, we study the slow time equations, where the fast time unknowns are replaced by their RG expansion. This allows to rigorously show the second order uniform error estimate. Our result is a higher order extension of Hoppensteadt's work on the Tikhonov singular perturbation theorem for infinite times. The proposed procedure is suitable for problems from applications, and it is computationally less demanding than the classical Vasil'eva‐O'Malley expansion. We apply the developed method to a mathematical model of stem cell dynamics. 相似文献
6.
Zi-Han Li Yuan-Qi Zhai Dr. Wei-Peng Chen Dr. You-Song Ding Prof. Dr. Yan-Zhen Zheng 《Chemistry (Weinheim an der Bergstrasse, Germany)》2019,25(71):16219-16224
Eight-coordinated DyIII centres with D6h symmetry are expected to act as high-performance single-molecule magnets (SMMs) due to the simultaneous fulfilment of magnetic axiality and a high coordination number (a requisite for air stability). But the experimental realization is challenging due to the requirement of six coordinating atoms in the equatorial plane of the hexagonal bipyramid; this is usually too crowded for the central DyIII ion. Here a hexaaza macrocyclic Schiff base ligand and finetuned axial alkoxide/phenol-type ligands are used to show that a family of hexagonal bipyramidal DyIII complexes can be isolated. Among them, three complexes possess nearly perfect D6h local symmetry. The highest effective magnetic reversal barrier is found at 1338(3) K and an open hysteresis temperature of 6 K at the field sweeping rate of 1.2 mT s−1; this represents a new record for D6h SMMs. 相似文献
7.
Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models. 相似文献
8.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
9.
10.