首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1165篇
  免费   59篇
  国内免费   25篇
化学   983篇
晶体学   8篇
力学   14篇
数学   90篇
物理学   154篇
  2024年   1篇
  2023年   13篇
  2022年   46篇
  2021年   49篇
  2020年   77篇
  2019年   75篇
  2018年   107篇
  2017年   76篇
  2016年   80篇
  2015年   57篇
  2014年   90篇
  2013年   119篇
  2012年   98篇
  2011年   77篇
  2010年   55篇
  2009年   45篇
  2008年   57篇
  2007年   43篇
  2006年   19篇
  2005年   20篇
  2004年   12篇
  2003年   12篇
  2002年   3篇
  2001年   5篇
  2000年   1篇
  1999年   2篇
  1998年   2篇
  1997年   3篇
  1996年   1篇
  1995年   1篇
  1994年   1篇
  1990年   1篇
  1976年   1篇
排序方式: 共有1249条查询结果,搜索用时 15 毫秒
91.
We consider a new and general online resource allocation problem, where the goal is to maximize a function of a positive semidefinite (PSD) matrix with a scalar budget constraint. The problem data arrives online, and the algorithm needs to make an irrevocable decision at each step. Of particular interest are classic experiment design problems in the online setting, with the algorithm deciding whether to allocate budget to each experiment as new experiments become available sequentially. We analyze two greedy primal-dual algorithms and provide bounds on their competitive ratios. Our analysis relies on a smooth surrogate of the objective function that needs to satisfy a new diminishing returns (PSD-DR) property (that its gradient is order-reversing with respect to the PSD cone). Using the representation for monotone maps on the PSD cone given by Löwner’s theorem, we obtain a convex parametrization of the family of functions satisfying PSD-DR. We then formulate a convex optimization problem to directly optimize our competitive ratio bound over this set. This design problem can be solved offline before the data start arriving. The online algorithm that uses the designed smoothing is tailored to the given cost function, and enjoys a competitive ratio at least as good as our optimized bound. We provide examples of computing the smooth surrogate for D-optimal and A-optimal experiment design, and demonstrate the performance of the custom-designed algorithm.  相似文献   
92.
93.
A graph is strongly even‐cycle decomposable if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several fundamental composition operations that preserve the property of being Eulerian also yield strongly even‐cycle decomposable graphs. As an easy application of our theorems, we give an exact characterization of the set of strongly even‐cycle decomposable cographs.  相似文献   
94.
We compare the performances of two different numerical methods to solve the equatorial shallow water equations in a background meridional shear: A coarse-resolution Galerkin-truncation-based method and a finite-volume method, for the case of an equatorial Rossby wave. In the presence of the barotropic shear, the Rossby wave quickly loses its energy through shear interaction and excites other equatorially trapped waves despite the fact that the PDE system is linear. The two methods handle this sudden energy exchange across scales very differently. While the finite volume converges statistically to a coherent large-scale solution, the Galerkin truncation method results in large-scale and slow oscillations where energy is bumped back and forth within the resolved-scale spectrum, involving higher-order equatorial wave modes heavily depending on numerical resolution, that is, the number of Galerkin basis functions. The addition of an artificial viscosity for the coarse-resolution Galerkin method heavily damps the energy oscillations without significantly changing its transient dynamics. This provides an example of interaction across scales where the resolution of scales that are apparently not representative of the statistical solution are important for the transient dynamics. Therefore, non-linear interactions of equatorially trapped waves may provide an interesting test bed for the validation of climate model dynamical cores.  相似文献   
95.
This paper develops a Bregman operator splitting algorithm with variable stepsize (BOSVS) for solving problems of the form $\min\{\phi(Bu) +1/2\|Au-f\|_{2}^{2}\}$ , where ? may be nonsmooth. The original Bregman Operator Splitting (BOS) algorithm employed a fixed stepsize, while BOSVS uses a line search to achieve better efficiency. These schemes are applicable to total variation (TV)-based image reconstruction. The stepsize rule starts with a Barzilai-Borwein (BB) step, and increases the nominal step until a termination condition is satisfied. The stepsize rule is related to the scheme used in SpaRSA (Sparse Reconstruction by Separable Approximation). Global convergence of the proposed BOSVS algorithm to a solution of the optimization problem is established. BOSVS is compared with other operator splitting schemes using partially parallel magnetic resonance image reconstruction problems. The experimental results indicate that the proposed BOSVS algorithm is more efficient than the BOS algorithm and another split Bregman Barzilai-Borwein algorithm known as SBB.  相似文献   
96.
In Iran, high school graduates enter university after taking a very difficult entrance exam called the Konkoor. Therefore, only the top-performing students are admitted by universities to continue their bachelor's education in statistics. Surprisingly, statistically, most of such students fall into the following categories: (1) do not succeed in their education despite their excellent performance on the Konkoor and in high school; (2) graduate with a grade point average (GPA) that is considerably lower than their high school GPA; (3) continue their master's education in majors other than statistics and (4) try to find jobs unrelated to statistics. This article employs the well-known and powerful statistical technique, the Bayesian structural equation modelling (SEM), to study the academic success of recent graduates who have studied statistics at Shahid Beheshti University in Iran. This research: (i) considered academic success as a latent variable, which was measured by GPA and other academic success (see below) of students in the target population; (ii) employed the Bayesian SEM, which works properly for small sample sizes and ordinal variables; (iii), which is taken from the literature, developed five main factors that affected academic success and (iv) considered several standard psychological tests and measured characteristics such as ‘self-esteem’ and ‘anxiety’. We then study the impact of such factors on the academic success of the target population. Six factors that positively impact student academic success were identified in the following order of relative impact (from greatest to least): ‘Teaching–Evaluation’, ‘Learner’, ‘Environment’, ‘Family’, ‘Curriculum’ and ‘Teaching Knowledge’. Particularly, influential variables within each factor have also been noted.  相似文献   
97.
Let G be a finite group and cs(G) be the set of conjugacy class sizes of G. In 1987, J. G. Thompson conjectured that, if G is a finite group with Z(G) = 1 and M is a nonabelian simple group satisfying that cs(G) = cs(M), then G ? M. This conjecture has been proved for Suzuki groups in [5 Guiyun, C. (1996). On Thompson's conjecture. J. Algebra 185(1):184193.[Crossref], [Web of Science ®] [Google Scholar]]. In this article, we improve this result by proving that, if G is a finite group such that cs(G) = cs(Sz(q)), for q = 22m+1, then G ? Sz(q) × A, where A is abelian. We avoid using classification of finite simple groups in our proofs.  相似文献   
98.
Mutual Information (MI) is an important dependency measure between random variables, due to its tight connection with information theory. It has numerous applications, both in theory and practice. However, when employed in practice, it is often necessary to estimate the MI from available data. There are several methods to approximate the MI, but arguably one of the simplest and most widespread techniques is the histogram-based approach. This paper suggests the use of fuzzy partitioning for the histogram-based MI estimation. It uses a general form of fuzzy membership functions, which includes the class of crisp membership functions as a special case. It is accordingly shown that the average absolute error of the fuzzy-histogram method is less than that of the naïve histogram method. Moreover, the accuracy of our technique is comparable, and in some cases superior to the accuracy of the Kernel density estimation (KDE) method, which is one of the best MI estimation methods. Furthermore, the computational cost of our technique is significantly less than that of the KDE. The new estimation method is investigated from different aspects, such as average error, bias and variance. Moreover, we explore the usefulness of the fuzzy-histogram MI estimator in a real-world bioinformatics application. Our experiments show that, in contrast to the naïve histogram MI estimator, the fuzzy-histogram MI estimator is able to reveal all dependencies between the gene-expression data.  相似文献   
99.
100.
Colloidal ZnS quantum dots (QDs) are prepared by passing H2S gas through a solution of Zn(CH3COO)2 in acetonitrile. Photophysical properties are investigated using UV?CVisible and photoluminescence (PL) spectroscopy. The spectrum shows an absorption shoulder at 271 nm representing a band gap of 4.6 eV. The doping of ZnS QDs with Co, Cu, and a mixture of Co and Cu not only increased the band gap to 0.2 eV but also turns these otherwise colorless QDs to blue in color due to cobalt, and green due to Cu. The observed emission in the visible region suggests that the dopants may have induced additional excited states to the ZnS QDs. This absorbance in the visible region can be utilized in the optoelectronic applications.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号