全文获取类型
收费全文 | 271篇 |
免费 | 23篇 |
国内免费 | 3篇 |
专业分类
化学 | 49篇 |
力学 | 87篇 |
综合类 | 6篇 |
数学 | 67篇 |
物理学 | 88篇 |
出版年
2025年 | 1篇 |
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 15篇 |
2021年 | 18篇 |
2020年 | 4篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 11篇 |
2014年 | 11篇 |
2013年 | 18篇 |
2012年 | 18篇 |
2011年 | 12篇 |
2010年 | 13篇 |
2009年 | 9篇 |
2008年 | 13篇 |
2007年 | 16篇 |
2006年 | 11篇 |
2005年 | 6篇 |
2004年 | 12篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2001年 | 12篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1987年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有297条查询结果,搜索用时 15 毫秒
91.
Rudolf Beran 《Annals of the Institute of Statistical Mathematics》2002,54(4):900-917
Estimation of the mean function in nonparametric regression is usefully separated into estimating the means at the observed factor levels—a one-way layout problem—and interpolation between the estimated means at adjacent factor levels. Candidate penalized least squares (PLS) estimators for the mean vector of a one-way layout are expressed as shrinkage estimators relative to an orthogonal regression basis determined by the penalty matrix. The shrinkage representation of PLS suggests a larger class of candidate monotone shrinkage (MS) estimators. Adaptive PLS and MS estimators choose the shrinkage vector and penalty matrix to minimize estimated risk. The actual risks of shrinkage-adaptive estimators depend strongly upon the economy of the penalty basis in representing the unknown mean vector. Local annihilators of polynomials, among them difference operators, generate penalty bases that are economical in a range of examples. Diagnostic techniques for adaptive PLS or MS estimators include basis-economy plots and estimates of loss or risk. 相似文献
92.
G.Sh. Tsitsiashvili M.A. Osipova N.V. Koliev D. Baum 《Annals of Operations Research》2002,113(1-4):141-154
Queueing networks in random environments represent more realistic models of computer and telecommunication systems than classical product form networks. This is due to the fact that network behaviour often depends on human activities which may vary according to daytime dependent behavioural patterns as well as physiological and mental indexes. In this paper we establish a product connection theorem for Markov chains which contains some corresponding results for spatial processes as well as for queueing networks in random environment as special cases. We demonstrate how our results can be applied to construct an adequate model for wireless networks with hook up capacity. 相似文献
93.
Bayrakçeken F Telatar Z Ari F Bayrak AB 《Spectrochimica acta. Part A, Molecular and biomolecular spectroscopy》2007,67(5):1276-1280
The radicals formed in the flash photolysis of 2-methylbut-1-ene and subsequent reactions have been investigated by kinetic spectroscopy and gas liquid chromatography. Less than 10% of photo products are formed by a molecular made of fission of the excited olefin, and of the radical modes the relative probabilities of band fission, beta(CH):beta(CH):alpha(CC) are 13:1.37:1. The extinction coefficients of beta-methallyl radical measured experimentally for all the absorption bands. The decay of the beta-methallyl radical was second order. The rate constant for the beta-methallyl radical recombination experimentally measured was 2.6+/-0.3 x 10(10) l mol(-1)s(-1) at 295+/-2K. The spectrum image showing the absorption bands was examined by image processing techniques in order to improve the visual experience of each band by localizing to a specific region of interest. Experimental results illustrate how the exact location of absorption bands was clearly extracted from the spectral image and further improvements in the visual detection of absorption bands. 相似文献
94.
This paper develops a sliding-mode control with an improved nonlinear extended state observer (SMC-INESO) for the rotation system of a hydraulic roofbolter with dead-zones, uncertain gain, and disturbances, with the purpose of improving tracking performance. Firstly, the rotation system is modeled to compensate for dead-zone nonlinearity. Then, we present an improved nonlinear extended state observer to estimate disturbances of the rotation system in real time. Moreover, a proportional-integral-differential sliding-mode surface is introduced and an improved sliding-mode reaching law is designed. Based on this, a sliding-mode control law is developed. In order to eliminate the influence of estimation error and uncertain gain, we design two adaptation laws based on the sliding-mode surface and the estimated states. Finally, the effectiveness of the proposed SMC-INESO is verified through comparative simulation studies. 相似文献
95.
Brain–computer interface (BCI) technology allows people with disabilities to communicate with the physical environment. One of the most promising signals is the non-invasive electroencephalogram (EEG) signal. However, due to the non-stationary nature of EEGs, a subject’s signal may change over time, which poses a challenge for models that work across time. Recently, domain adaptive learning (DAL) has shown its superior performance in various classification tasks. In this paper, we propose a regularized reproducing kernel Hilbert space (RKHS) subspace learning algorithm with K-nearest neighbors (KNNs) as a classifier for the task of motion imagery signal classification. First, we reformulate the framework of RKHS subspace learning with a rigorous mathematical inference. Secondly, since the commonly used maximum mean difference (MMD) criterion measures the distribution variance based on the mean value only and ignores the local information of the distribution, a regularization term of source domain linear discriminant analysis (SLDA) is proposed for the first time, which reduces the variance of similar data and increases the variance of dissimilar data to optimize the distribution of source domain data. Finally, the RKHS subspace framework was constructed sparsely considering the sensitivity of the BCI data. We test the proposed algorithm in this paper, first on four standard datasets, and the experimental results show that the other baseline algorithms improve the average accuracy by 2–9% after adding SLDA. In the motion imagery classification experiments, the average accuracy of our algorithm is 3% higher than the other algorithms, demonstrating the adaptability and effectiveness of the proposed algorithm. 相似文献
96.
Zhiyong Zhou Yuanning Liu Xiaodong Zhu Shuai Liu Shaoqiang Zhang Yuanfeng Li 《Entropy (Basel, Switzerland)》2022,24(9)
Precise iris segmentation is a very important part of accurate iris recognition. Traditional iris segmentation methods require complex prior knowledge and pre- and post-processing and have limited accuracy under non-ideal conditions. Deep learning approaches outperform traditional methods. However, the limitation of a small number of labeled datasets degrades their performance drastically because of the difficulty in collecting and labeling irises. Furthermore, previous approaches ignore the large distribution gap within the non-ideal iris dataset due to illumination, motion blur, squinting eyes, etc. To address these issues, we propose a three-stage training strategy. Firstly, supervised contrastive pretraining is proposed to increase intra-class compactness and inter-class separability to obtain a good pixel classifier under a limited amount of data. Secondly, the entire network is fine-tuned using cross-entropy loss. Thirdly, an intra-dataset adversarial adaptation is proposed, which reduces the intra-dataset gap in the non-ideal situation by aligning the distribution of the hard and easy samples at the pixel class level. Our experiments show that our method improved the segmentation performance and achieved the following encouraging results: 0.44%, 1.03%, 0.66%, 0.41%, and 0.37% in the Nice1 and 96.66%, 98.72%, 93.21%, 94.28%, and 97.41% in the F1 for UBIRIS.V2, IITD, MICHE-I, CASIA-D, and CASIA-T. 相似文献
97.
Xiaorong Zheng Zhaojian Gu Caiming Liu Jiahao Jiang Zhiwei He Mingyu Gao 《Entropy (Basel, Switzerland)》2022,24(8)
Domain adaptation-based bearing fault diagnosis methods have recently received high attention. However, the extracted features in these methods fail to adequately represent fault information due to the versatility of the work scenario. Moreover, most existing adaptive methods attempt to align the feature space of domains by calculating the sum of marginal distribution distance and conditional distribution distance, without considering variable cross-domain diagnostic scenarios that provide significant cues for fault diagnosis. To address the above problems, we propose a deep convolutional multi-space dynamic distribution adaptation (DCMSDA) model, which consists of two core components: two feature extraction modules and a dynamic distribution adaptation module. Technically, a multi-space structure is proposed in the feature extraction module to fully extract fault features of the marginal distribution and conditional distribution. In addition, the dynamic distribution adaptation module utilizes different metrics to capture distribution discrepancies, as well as an adaptive coefficient to dynamically measure the alignment proportion in complex cross-domain scenarios. This study compares our method with other advanced methods, in detail. The experimental results show that the proposed method has excellent diagnosis performance and generalization performance. Furthermore, the results further demonstrate the effectiveness of each transfer module proposed in our model. 相似文献
98.
A third‐order mesh generation and adaptation method is presented for solving the steady compressible Euler equations. For interior points, a third‐order scheme is used on Cartesian and curvilinear meshes. Concerning the mesh adaptation, the method of Meakin is also extended to third order. The accuracy of the new overset mesh adaptation method is demonstrated by a grid convergence study for 2‐D inviscid model problems and results are compared with a second‐order method. Finally, the method is applied to the computation of an inviscid 3‐D flow around a hovering blade of the ONERA 7A helicopter rotor exhibiting an improvement in the wake capture. With a 7 million point mesh, the tip vortex can be followed for more than three rotor revolutions with the third‐order method. The CPU time needed for this calculation is only 3% higher than with a conventional second‐order method. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
99.
Gustavo A. Ríos Rodriguez Mario A. Storti Ezequiel J. López Sofía S. Sarraf 《International Journal of Computational Fluid Dynamics》2013,27(1):31-39
Shock waves and contact discontinuities usually appear in compressible flows, requiring a fine mesh in order to achieve an acceptable accuracy of the numerical solution. The usage of a mesh adaptation strategy is convenient as uniform refinement of the whole mesh becomes prohibitive in three-dimensional (3D) problems. An unsteady h-adaptive strategy for unstructured finite element meshes is introduced. Non-conformity of the refined mesh and a bounded decrease in the geometrical quality of the elements are some features of the refinement algorithm. A 3D extension of the well-known refinement constraint for 2D meshes is used to enforce a smooth size transition among neighbour elements with different levels of refinement. A density-based gradient indicator is used to track discontinuities. The solution procedure is partially parallelised, i.e. the inviscid flow equations are solved in parallel with a finite element SUPG formulation with shock capturing terms while the adaptation of the mesh is sequentially performed. Results are presented for a spherical blast wave driven by a point-like explosion with an initial pressure jump of 105 atmospheres. The adapted solution is compared to that computed on a fixed mesh. Also, the results provided by the theory of self-similar solutions are considered for the analysis. In this particular problem, adapting the mesh to the solution accounts for approximately 4% of the total simulation time and the refinement algorithm scales almost linearly with the size of the problem. 相似文献
100.
M. Breuß V. Dolejí A. Meister 《ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik》2006,86(6):450-463
We deal with the numerical solution of heat conduction problems featuring steep gradients. In order to solve the associated partial differential equation a finite volume technique is used and unstructured grids are employed. A discrete maximum principle for triangulations of a Delaunay type is developed. To capture thin boundary layers incorporating steep gradients an anisotropic mesh adaptation technique is implemented. Computational tests are performed for an academic problem where the exact solution is known as well as for a real world problem of a computer simulation of the thermoregulation of premature infants. 相似文献