全文获取类型
收费全文 | 13121篇 |
免费 | 1502篇 |
国内免费 | 906篇 |
专业分类
化学 | 2080篇 |
晶体学 | 21篇 |
力学 | 772篇 |
综合类 | 164篇 |
数学 | 6480篇 |
物理学 | 2327篇 |
无线电 | 3685篇 |
出版年
2024年 | 33篇 |
2023年 | 95篇 |
2022年 | 179篇 |
2021年 | 239篇 |
2020年 | 256篇 |
2019年 | 259篇 |
2018年 | 272篇 |
2017年 | 407篇 |
2016年 | 493篇 |
2015年 | 399篇 |
2014年 | 659篇 |
2013年 | 960篇 |
2012年 | 820篇 |
2011年 | 751篇 |
2010年 | 710篇 |
2009年 | 752篇 |
2008年 | 838篇 |
2007年 | 871篇 |
2006年 | 787篇 |
2005年 | 699篇 |
2004年 | 633篇 |
2003年 | 523篇 |
2002年 | 506篇 |
2001年 | 466篇 |
2000年 | 422篇 |
1999年 | 397篇 |
1998年 | 312篇 |
1997年 | 277篇 |
1996年 | 243篇 |
1995年 | 201篇 |
1994年 | 153篇 |
1993年 | 127篇 |
1992年 | 116篇 |
1991年 | 103篇 |
1990年 | 72篇 |
1989年 | 63篇 |
1988年 | 46篇 |
1987年 | 47篇 |
1986年 | 45篇 |
1985年 | 51篇 |
1984年 | 53篇 |
1983年 | 21篇 |
1982年 | 37篇 |
1981年 | 22篇 |
1980年 | 20篇 |
1979年 | 27篇 |
1978年 | 12篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
61.
In Tong-Viet's, 2012 work, the following question arose: Question. Which groups can be uniquely determined by the structure of their complex group algebras? It is proved here that some simple groups of Lie type are determined by the structure of their complex group algebras. Let p be an odd prime number and S = PSL(2, p 2). In this paper, we prove that, if M is a finite group such that S < M < Aut(S), M = ?2 × PSL(2, p 2) or M = SL(2, p 2), then M is uniquely determined by its order and some information about its character degrees. Let X 1(G) be the set of all irreducible complex character degrees of G counting multiplicities. As a consequence of our results, we prove that, if G is a finite group such that X 1(G) = X 1(M), then G ? M. This implies that M is uniquely determined by the structure of its complex group algebra. 相似文献
62.
In the highly competitive business environment of today, the cost to attract new customers is much higher than the cost required to maintain the existing ones. To keep the balance between the acquisition rate and defection rate through executing offensive and defensive marketing policies, it is required to have real time information using an efficient method to monitor customer loyalty. The relationship between customer loyalty and customer satisfaction should be kept in mind when one develops a method for loyalty monitoring. This paper presents several control charts classified in two groups based on the scale used to assess customer loyalty. In the first group of control charts, customer loyalty is considered as a binary random variable modeled by Bernoulli distribution whilst in the second group, an ordinal scale is considered to report loyalty level. Performance comparison of the proposed techniques using ARL criterion indicates that chi‐square and likelihood‐ratio control charts developed based on Pearson chi‐square statistic and ordinal logistic regression model respectively are able to rapidly detect the significant changes in loyalty behavior. To show how to apply the procedures and how to interpret their results, two illustrative synthetic cases are also explained. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
63.
A smoothing method for solving stochastic linear complementarity problems is proposed. The expected residual minimization reformulation of the problem is considered, and it is approximated by the sample average approximation (SAA). The proposed method is based on sequential solving of a sequence of smoothing problems where each of the smoothing problems is defined with its own sample average approximation. A nonmonotone line search with a variant of the Barzilai–Borwein (BB) gradient direction is used for solving each of the smoothing problems. The BB search direction is efficient and low cost, particularly suitable for nonmonotone line search procedure. The variable sample size scheme allows the sample size to vary across the iterations and the method tends to use smaller sample size far away from the solution. The key point of this strategy is a good balance between the variable sample size strategy, the smoothing sequence and nonmonotonicity. Eventually, the maximal sample size is used and the SAA problem is solved. Presented numerical results indicate that the proposed strategy reduces the overall computational cost. 相似文献
64.
《Optimization》2012,61(2):401-421
Abstract We study the efficient set X E for a multiple objective linear program by using its projection into the linear space L spanned by the independent criteria. We show that in the orthogonally complementary space of L, the efficient points form a polyhedron, while in L an efficiency-equivalent polyhedron for the projection P(X E ) of X E can be constructed by algorithms of outer and inner approximation types. These algorithms can be also used for generating all extreme points of P(X E ). Application to optimization over the efficient set for a multiple objective linear program is considered. 相似文献
65.
《Optimization》2012,61(1-4):149-162
Motivated by the successful application of mathematical programming techniques to difficult machine learning problems, we seek solutions of concave minimization problems over polyhedral sets with minimum number of nonzero components. We that if such problems have a solution, they have a vertex solution with a minimal number of zeros. This includes linear programs and general linear complementarity problems. A smooth concave exponential approximation to a step function solves the minimumsupport problem exactly for a finite value of the smoothing parameter. A fast finite linear-programming-based iterative method terminates at a stationary point, which for many important real world problems provides very useful answers. Utilizing the complementarity property of linear programs and linear complementarity problems, an upper bound on the number of nonzeros can be obtained by solving a single convex minimization problem on a polyhedral set 相似文献
66.
Linear regression (LR) is a core model in supervised machine learning performing a regression task. One can fit this model using either an analytic/closed-form formula or an iterative algorithm. Fitting it via the analytic formula becomes a problem when the number of predictors is greater than the number of samples because the closed-form solution contains a matrix inverse that is not defined when having more predictors than samples. The standard approach to solve this issue is using the Moore–Penrose inverse or the L2 regularization. We propose another solution starting from a machine learning model that, this time, is used in unsupervised learning performing a dimensionality reduction task or just a density estimation one—factor analysis (FA)—with one-dimensional latent space. The density estimation task represents our focus since, in this case, it can fit a Gaussian distribution even if the dimensionality of the data is greater than the number of samples; hence, we obtain this advantage when creating the supervised counterpart of factor analysis, which is linked to linear regression. We also create its semisupervised counterpart and then extend it to be usable with missing data. We prove an equivalence to linear regression and create experiments for each extension of the factor analysis model. The resulting algorithms are either a closed-form solution or an expectation–maximization (EM) algorithm. The latter is linked to information theory by optimizing a function containing a Kullback–Leibler (KL) divergence or the entropy of a random variable. 相似文献
67.
68.
This study applies fuzzy sets to integrate the supply chain network of an edible vegetable oils manufacturer. The proposed fuzzy multi-objective linear programming model attempts to simultaneously minimize the total transportation costs. The first part of the total transportation costs is between suppliers and silos; and rest one is between manufacturer and warehouses. The approach incorporates all operating realities and actual flow patterns at production/distribution network with reference to demands of warehouses, capacities of tin and pet packaging lines. The model has been formulated as a multi objective linear programming model where data are modeled by triangular fuzzy numbers. Finally, the developed fuzzy model is applied for the case study, compiled the results and discussed. 相似文献
69.
本文利用摄动的思想,以摄动有理曲线(曲面)的系数的无穷模作为优化目标,给出了用多项式曲线(曲面)逼近有理曲线(曲面)的一种新方法.同以前的各种方法相比,该方法不仅收敛而且具有更快的收敛速度,并且可以与细分技术相结合,得到有理曲线与曲面的整体光滑、分片多项式的逼近. 相似文献
70.
通过一阶和二阶导数讨论了带小参数的线性二阶常微分方程的初值问题.在均匀网格上得出了带常数拟合因子的指数型拟合差分格式,给出了离散最大模意义上的一阶一致收敛性.文中给出了数值结果. 相似文献