全文获取类型
收费全文 | 759篇 |
免费 | 47篇 |
国内免费 | 28篇 |
专业分类
化学 | 103篇 |
晶体学 | 1篇 |
力学 | 41篇 |
综合类 | 18篇 |
数学 | 606篇 |
物理学 | 65篇 |
出版年
2023年 | 6篇 |
2022年 | 8篇 |
2021年 | 16篇 |
2020年 | 13篇 |
2019年 | 22篇 |
2018年 | 20篇 |
2017年 | 19篇 |
2016年 | 22篇 |
2015年 | 13篇 |
2014年 | 27篇 |
2013年 | 52篇 |
2012年 | 36篇 |
2011年 | 27篇 |
2010年 | 26篇 |
2009年 | 39篇 |
2008年 | 43篇 |
2007年 | 33篇 |
2006年 | 41篇 |
2005年 | 29篇 |
2004年 | 25篇 |
2003年 | 25篇 |
2002年 | 20篇 |
2001年 | 23篇 |
2000年 | 24篇 |
1999年 | 23篇 |
1998年 | 22篇 |
1997年 | 12篇 |
1996年 | 15篇 |
1995年 | 7篇 |
1994年 | 11篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 13篇 |
1990年 | 11篇 |
1989年 | 4篇 |
1988年 | 15篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 13篇 |
1976年 | 6篇 |
1974年 | 4篇 |
1971年 | 1篇 |
排序方式: 共有834条查询结果,搜索用时 31 毫秒
61.
Nergiz KasimbeyliTugba Sarac Refail Kasimbeyli 《Journal of Computational and Applied Mathematics》2011,235(16):4663-4674
This paper considers a one-dimensional cutting stock and assortment problem. One of the main difficulties in formulating and solving these kinds of problems is the use of the set of cutting patterns as a parameter set in the mathematical model. Since the total number of cutting patterns to be generated may be very huge, both the generation and the use of such a set lead to computational difficulties in solution process. The purpose of this paper is therefore to develop a mathematical model without the use of cutting patterns as model parameters. We propose a new, two-objective linear integer programming model in the form of simultaneous minimization of two contradicting objectives related to the total trim loss amount and the total number of different lengths of stock rolls to be maintained as inventory, in order to fulfill a given set of cutting orders. The model does not require pre-specification of cutting patterns. We suggest a special heuristic algorithm for solving the presented model. The superiority of both the mathematical model and the solution approach is demonstrated on test problems. 相似文献
62.
63.
A viscosity method for a hierarchical fixed point solving variational inequality problems is presented. The method is used to solve variational inequalities, where the involved mappings are non-expansive. Solutions are sought in the set of the fixed points of another non-expansive mapping. As applications, we use the results to study problems of the monotone variational inequality, the convex programming, the hierarchical minimization, and the quadratic minimization over fixed point sets. 相似文献
64.
We propose a model that optimizes enterprise investments in cybersecurity using expected utility theory. The model allows computing (a) investment in self‐defense to reduce the risk of security breaches, (b) investment in cyber insurance to transfer the residual risk to insurance companies, and (c) investment in forensic readiness to make the insured firms capable of generating provable insurance claims about security breaches. A three‐phase–based model of vulnerability rate evolution over time is proposed and used to estimate the different planned security expenditures throughout the investment horizon. At the starting time of investment, a decision maker invests to cover the existing risk of breach and periodically spends to cover the additional risk observed due to the release of new vulnerabilities. In this work, the intermediate tranches are determined while considering three different attitudes of decision makers, namely, optimistic, pessimistic, and realistic. An analysis is conducted to assess the performance of the proposed models. 相似文献
65.
Aaron J. Molstad Adam J. Rothman 《Journal of computational and graphical statistics》2019,28(1):11-22
We propose a penalized likelihood method to fit the linear discriminant analysis model when the predictor is matrix valued. We simultaneously estimate the means and the precision matrix, which we assume has a Kronecker product decomposition. Our penalties encourage pairs of response category mean matrix estimators to have equal entries and also encourage zeros in the precision matrix estimator. To compute our estimators, we use a blockwise coordinate descent algorithm. To update the optimization variables corresponding to response category mean matrices, we use an alternating minimization algorithm that takes advantage of the Kronecker structure of the precision matrix. We show that our method can outperform relevant competitors in classification, even when our modeling assumptions are violated. We analyze three real datasets to demonstrate our method’s applicability. Supplementary materials, including an R package implementing our method, are available online. 相似文献
66.
A new multi-start algorithm for global unconstrained minimization is presented in which the search trajectories are derived from the equation of motion of a particle in a conservative force field, where the function to be minimized represents the potential energy. The trajectories are modified to increase the probability of convergence to a comparatively low local minimum, thus increasing the region of convergence of the global minimum. A Bayesian argument is adopted by which, under mild assumptions, the confidence level that the global minimum has been attained may be computed. When applied to standard and other test functions, the algorithm never failed to yield the global minimum.The first author wishes to thank Prof. M. Levitt of the Department of Chemical Physics of the Weizmann Institute of Science for suggesting this line of research and also Drs. T. B. Scheffler and E. A. Evangelidis for fruitful discussions regarding Conjecture 2.1. He also acknowledges the exchange agreement award received from the National Council for Research and Development in Israel and the Council for Scientific and Industrial Research in South Africa, which made possible the visit to the Weizmann Institute where this work was initiated. 相似文献
67.
Nonlinear complementarity as unconstrained optimization 总被引:8,自引:0,他引:8
C. Kanzow 《Journal of Optimization Theory and Applications》1996,88(1):139-155
Several methods for solving the nonlinear complementarity problem (NCP) are developed. These methods are generalizations of the recently proposed algorithms of Mangasarian and Solodov (Ref. 1) and are based on an unconstrianed minimization formulation of the nonlinear complementarity problem. It is shown that, under certain assumptions, any stationary point of the unconstrained objective function is already a solution of NCP. In particulr, these assumptions are satisfied by the mangasarian and Soolodov implicit Lagranian functioin. Furthermore, a special Newton-type method is suggested, and conditions for its local quadratic convergence are given. Finally, some preliminary numerical results are presented.The author would like to thank Dr. Oswald Knoth (Leipzig) for pointing out that the equivalence of Lemma 2.2. is not true for complementarity problems which have no solutions. He is also grateful to the anonymous referencees for their helpful comments. 相似文献
68.
最小风险证券组合的结构分析和迭代算法 总被引:1,自引:0,他引:1
本文分析了最小风险组合证券投资的结构特征,并提出了一种组合证券风险最小化的迭代算法,证明了其收敛性.该算法操作简单,且易于处理不允许卖空情况下的证券组合问题. 相似文献
69.
On the Positivity of the Coefficients of a Certain Polynomial Defined by Two Positive Definite Matrices 总被引:1,自引:0,他引:1
It is shown that the polynomialp(t) = Tr[(A+tB)m]has positive coefficients when m = 6 and A and B are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior, general results. This problem arises from a conjecture raised by Bessis, Moussa, and Villani in connection with a long-standing problem in theoretical physics. The full conjecture, as shown recently by Lieb and Seiringer, is equivalent to p(t) having positive coefficients for any m and any two n-by-n positive definite matrices. We show that, generally, the question in the real case reduces to that of singular A and B, and this is a key part of our proof. 相似文献
70.
We consider the problem of finding solutions of systems of monotone equations. The Newton-type algorithm proposed in Ref. 1 has a very nice global convergence property in that the whole sequence of iterates generated by this algorithm converges to a solution, if it exists. Superlinear convergence of this algorithm is obtained under a standard nonsingularity assumption. The nonsingularity condition implies that the problem has a unique solution; thus, for a problem with more than one solution, such a nonsingularity condition cannot hold. In this paper, we show that the superlinear convergence of this algorithm still holds under a local error-bound assumption that is weaker than the standard nonsingularity condition. The local error-bound condition may hold even for problems with nonunique solutions. As an application, we obtain a Newton algorithm with very nice global and superlinear convergence for the minimum norm solution of linear programs.This research was supported by the Singapore-MIT Alliance and the Australian Research Council. 相似文献