全文获取类型
收费全文 | 6202篇 |
免费 | 168篇 |
国内免费 | 289篇 |
专业分类
化学 | 1433篇 |
晶体学 | 10篇 |
力学 | 744篇 |
综合类 | 29篇 |
数学 | 3214篇 |
物理学 | 1229篇 |
出版年
2024年 | 9篇 |
2023年 | 115篇 |
2022年 | 81篇 |
2021年 | 89篇 |
2020年 | 124篇 |
2019年 | 91篇 |
2018年 | 80篇 |
2017年 | 134篇 |
2016年 | 159篇 |
2015年 | 127篇 |
2014年 | 282篇 |
2013年 | 377篇 |
2012年 | 262篇 |
2011年 | 321篇 |
2010年 | 282篇 |
2009年 | 453篇 |
2008年 | 480篇 |
2007年 | 487篇 |
2006年 | 346篇 |
2005年 | 292篇 |
2004年 | 256篇 |
2003年 | 222篇 |
2002年 | 217篇 |
2001年 | 159篇 |
2000年 | 156篇 |
1999年 | 129篇 |
1998年 | 133篇 |
1997年 | 101篇 |
1996年 | 90篇 |
1995年 | 70篇 |
1994年 | 75篇 |
1993年 | 60篇 |
1992年 | 54篇 |
1991年 | 42篇 |
1990年 | 25篇 |
1989年 | 32篇 |
1988年 | 44篇 |
1987年 | 20篇 |
1986年 | 27篇 |
1985年 | 28篇 |
1984年 | 31篇 |
1983年 | 9篇 |
1982年 | 20篇 |
1981年 | 12篇 |
1980年 | 14篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 2篇 |
排序方式: 共有6659条查询结果,搜索用时 15 毫秒
81.
82.
On spanning tree problems with multiple objectives 总被引:4,自引:0,他引:4
We investigate two versions of multiple objective minimum spanning tree problems defined on a network with vectorial weights. First, we want to minimize the maximum ofQ linear objective functions taken over the set of all spanning trees (max-linear spanning tree problem, ML-ST). Secondly, we look for efficient spanning trees (multi-criteria spanning tree problem, MC-ST).Problem ML-ST is shown to be NP-complete. An exact algorithm which is based on ranking is presented. The procedure can also be used as an approximation scheme. For solving the bicriterion MC-ST, which in the worst case may have an exponential number of efficient trees, a two-phase procedure is presented. Based on the computation of extremal efficient spanning trees we use neighbourhood search to determine a sequence of solutions with the property that the distance between two consecutive solutions is less than a given accuracy.Partially supported by Deutsche Forschungsgemeinschaft and HCº Contract no. ERBCHRXCT 930087.Partially supported by Alexander von Humboldt-Stiftung. 相似文献
83.
Consider a two-station queueing network with two types of jobs: type 1 jobs visit station 1 only, while type 2 jobs visit both stations in sequence. Each station has a single server. Arrival and service processes are modeled as counting processes with controllable stochastic intensities. The problem is to control the arrival and service processes, and in particular to schedule the server in station 1 among the two job types, in order to minimize a discounted cost function over an infinite time horizon. Using a stochastic intensity control approach, we establish the optimality of a specific stationary policy, and show that its value function satisfies certain properties, which lead to a switching-curve structure. We further classify the problem into six parametric cases. Based on the structural properties of the stationary policy, we establish the optimality of some simple priority rules for three of the six cases, and develop heuristic policies for the other three cases. 相似文献
84.
We consider the minimization of a quadratic formzVz+2zq subject to the two-norm constraint z=. The problem received considerable attention in the literature, notably due to its applications to a class of trust region methods in nonlinear optimization. While the previous studies were concerned with just the global minimum of the problem, we investigate the existence of all local minima. The problem is approached via the dual Lagrangian, and the necessary and sufficient conditions for the existence of all local minima are derived. We also examine the suitability of the conventional numerical techniques used to solve the problem to a class of single-instruction multiple-data computers known as processor arrays (in our case, AMT DAP 610). Simultaneously, we introduce certain hardware-oriented multisection algorithms, showing their efficiency in the case of small to medium size problems.This research was partially supported by the National Physical Laboratories of England under Contract RTP2/155/127. 相似文献
85.
Marco Marletta 《Advances in Computational Mathematics》1994,2(2):155-184
This paper discusses the numerical solution of eigenvalue problems for Hamiltonian systems of ordinary differential equations.
Two new codes are presented which incorporate the algorithms described here; to the best of the author’s knowledge, these
are the first codes capable of solving numerically such general eigenvalue problems. One of these implements a new new method
of solving a differential equation whose solution is a unitary matrix. Both codes are fully documented and are written inPfort-verifiedFortran 77, and will be available in netlib/aicm/sl11f and netlib/aicm/sl12f. 相似文献
86.
This work investigates the detection of binary neutron stars gravitational wave based on convolutional neural network(CNN).To promote the detection performance and efficiency,we proposed a scheme based on wavelet packet(WP)decomposition and CNN.The WP decomposition is a time-frequency method and can enhance the discriminant features between gravitational wave signal and noise before detection.The CNN conducts the gravitational wave detection by learning a function mapping relation from the data under being processed to the space of detection results.This function-mapping-relation style detection scheme can detection efficiency significantly.In this work,instrument effects are con-sidered,and the noise are computed from a power spectral density(PSD)equivalent to the Advanced LIGO design sensitivity.The quantitative evaluations and comparisons with the state-of-art method matched filtering show the excellent performances for BNS gravitational wave detection.On efficiency,the current experiments show that this WP-CNN-based scheme is more than 960 times faster than the matched filtering. 相似文献
87.
This work investigates the problem of detecting gravitational wave (GW) events based on simulated damped sinusoid signals contaminated with white Gaussian noise. It is treated as a classification problem with one class for the interesting events. The proposed scheme consists of the following two successive steps: decomposing the data using a wavelet packet, representing the GW signal and noise using the derived decomposition coefficients; and determining the existence of any GW event using a convolutional neural network (CNN) with a logistic regression output layer. The characteristic of this work is its comprehensive investigations on CNN structure, detection window width, data resolution, wavelet packet decomposition and detection window overlap scheme. Extensive simulation experiments show excellent performances for reliable detection of signals with a range of GW model parameters and signal-to-noise ratios. While we use a simple waveform model in this study, we expect the method to be particularly valuable when the potential GW shapes are too complex to be characterized with a template bank. 相似文献
88.
When liquids flow in the pipelines, the onset of cavitation can be characterized by a variant of the Euler number known as the cavitation number (CN), which is based on the velocity and denoted by C in this paper. Conventionally, cavitation is considered to be induced when C ~ 1. However, experimental observations and several pipe bursts indicate that the CN may incorrectly predict the onset of cavitation. For example, when leakage occurs in the pipeline or a valve in the pipeline is opened, the resultant pressure loss generates a dynamic pressure wave with a small amplitude, which may lead to bubble formation, even though C ~ 1 is not satisfied. Hence, this paper proposes another CN based on the amplitude of the generated dynamic pressure wave, rather than the velocity, for ascertaining the onset of cavitation. The validity of the proposed CN was verified through experiments and a case study. The results indicated that the proposed CN can be effectively used for cavitation prediction induced by pressure fluctuations and for investigating phenomena such as pressure fluctuation, leakage, and corrosion in liquid pipelines, tanks, and pressure vessels, as well as the safety design of liquefied natural gas tanks and tankers. 相似文献
89.
The nature (time variation) of response magnetization m(wt) of the spin-1 Blume-Capel model in the presence of a periodically varying external magnetic field h(wt) is studied by employing the effective-field theory (EFT) with correlations as well as the Glauber-type stochastic dynamics. We determine the time variations of m(wt) and h(wt) for various temperatures, and investigate the dynamic magnetic hysteresis behavior. We also investigate the temperature dependence of the dynamic magnetization, hysteresis loop area and correlation near the transition point in order to characterize the nature (first- or second-order) of the dynamic transitions as well as obtain the dynamic phase transition temperatures. The hysteresis loops are obtained for different reduced temperatures and we find that the areas of the loops are decreasing with the increasing of the reduced temperatures. We also present the dynamic phase diagrams and compare the results of the EFT with the results of the dynamic mean-field approximation. The phase diagrams exhibit many dynamic critical points, such as tricritical (•), zero-temperature critical (Z), triple (TP) and multicritical (A) points. According to values of Hamiltonian parameters, besides the paramagnetic (P), ferromagnetic (F) fundamental phases, one coexistence or mixed phase region, (F+P) and the reentrant behavior exist in the system. The results are in good agreement with some experimental and theoretical results. 相似文献
90.
Monika Cichocka 《光谱学快报》2018,51(2):118-121
The intracellular brain pH in phosphorus magnetic resonance spectroscopy is calculated using the chemical shift between the inorganic phosphate and phosphocreatine with the Henderson–Hasselbalch equations. Researchers use various mathematical formulas that have different parameters and get various results for the same input data as a consequence. Thus, the aim of this article was to determine the mathematical formulas that allow the conversion of the pH values obtained by the most popular analysis methods to each other. To determine the relationships between pH results and the applied mathematical formula, the pH values were calculated using two algorithms for the theoretical chemical shift values. The pH results were compared with each other using the appropriate t-tests. Mathematical formulas were designed to simplify the conversion of pH values obtained by two data analysis methods to each other. The pH values with were obtained this way did not differ significantly from the pH values calculated directly from the given formula. The computed mathematical formulas will make it possible to simplify pH conversions without knowing the chemical shift between inorganic phosphate and phosphocreatine but only basing on the final pH values obtained by one of the formulas. 相似文献