 首页 | 本学科首页 官方微博 | 高级检索

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 收费全文 451篇 国内免费 23篇 完全免费 4篇
 数学 478篇
 2019年 1篇 2018年 7篇 2017年 6篇 2016年 2篇 2015年 11篇 2014年 5篇 2013年 54篇 2012年 19篇 2011年 13篇 2010年 16篇 2009年 17篇 2008年 22篇 2007年 21篇 2006年 24篇 2005年 20篇 2004年 13篇 2003年 25篇 2002年 13篇 2001年 11篇 2000年 17篇 1999年 11篇 1998年 8篇 1997年 6篇 1996年 11篇 1995年 4篇 1994年 11篇 1993年 14篇 1992年 8篇 1991年 10篇 1990年 9篇 1989年 7篇 1988年 10篇 1987年 4篇 1986年 5篇 1985年 2篇 1984年 12篇 1983年 2篇 1982年 4篇 1981年 4篇 1980年 6篇 1979年 4篇 1978年 4篇 1976年 4篇 1975年 1篇

1.
Tilting modules of finite projective dimension   总被引：17，自引：0，他引：17
2.
A mean-absolute deviation-skewness portfolio optimization model   总被引：10，自引：0，他引：10
It is assumed in the standard portfolio analysis that an investor is risk averse and that his utility is a function of the mean and variance of the rate of the return of the portfolio or can be approximated as such. It turns out, however, that the third moment (skewness) plays an important role if the distribution of the rate of return of assets is asymmetric around the mean. In particular, an investor would prefer a portfolio with larger third moment if the mean and variance are the same. In this paper, we propose a practical scheme to obtain a portfolio with a large third moment under the constraints on the first and second moment. The problem we need to solve is a linear programming problem, so that a large scale model can be optimized without difficulty. It is demonstrated that this model generates a portfolio with a large third moment very quickly.Presently at Mitsubishi Trust Bank Co., Ltd.  相似文献
3.
The network flow theory and algorithms have been developed on the assumption that each arc flow is controllable and we freely raise and reduce it. We however consider in this paper the situation where we are not able or allowed to reduce the given arc flow. Then we may end up with a maximal flow depending on the initial flow as well as the way of augmentation. Therefore the minimum of the flow values that are attained by maximal flows will play an important role to see how inefficiently the network can be utilized. We formulate this problem as an optimization over the efficient set of a multicriteria program, propose an algorithm, prove its finite convergence, and report on some computational experiments.  相似文献
4.
In this paper, we develop a branch-and-bound algorithm for maximizing a sum of p (slant2) linear ratios on a polytope. The problem is embedded into a 2p-dimensional space, in which a concave polyhedral function overestimating the optimal value is constructed for the bounding operation. The branching operation is carried out in a p-dimensional space, in a way similar to the usual rectangular branch-and-bound method. We discuss the convergence properties and report some computational results.  相似文献
5.
We analyze a discrete-time, single-server queueing system in which the length of each service period is limited. The server takes a vacation when the limit expires or the queue empties, whichever occurs first. In the former case, the preempted service is resumed after the vacation without loss or creation of any work. This system models the transmission of message frames from a station on timed-token local-area networks (for example, FDDI and IEEE 802.4 token bus). We study the process of the unfinished work and the joint process of the queue size and the remaining service time. By using the technique of discrete Fourier transforms to determine some unknown functions in the governing equations, we numerically obtain exact mean waiting times.A part of the work of H. Takagi was done while he was with IBM Research, Tokyo Research Laboratory.  相似文献
6.
We consider submodular programs which are problems of minimizing submodular functions on distributive lattices with or without constraints. We define a convex (or concave) conjugate function of a submodular (or supermodular) function and show a Fenchel-type min-max theorem for submodular and supermodular functions. We also define a subgradient of a submodular function and derive a necessary and sufficient condition for a feasible solution of a submodular program to be optimal, which is a counterpart of the Karush-Kuhn-Tucker condition for convex programs. This work is supported by the Alexander von Humboldt fellowship (1982/83), West Germany.  相似文献
7.
We estimate the marginal density function of a long-range dependent linear process by the kernel estimator. We assume the innovations are i.i.d. Then it is known that the term of the sample mean is dominant in the MISE of the kernel density estimator when the dependence is beyond some level which depends on the bandwidth and that the MISE has asymptotically the same form as for i.i.d. observations when the dependence is below the level. We call the latter the case where the dependence is not very strong and focus on it in this paper. We show that the asymptotic distribution of the kernel density estimator is the same as for i.i.d. observations and the effect of long-range dependence does not appear. In addition we describe some results for weakly dependent linear processes.  相似文献
8.
9.
Log-fractional stable processes   总被引：1，自引：0，他引：1
The first problem attacked in this paper is answering the question whether all 1/-self-similar -stable processes with stationary increments are -stable motions. The answer is yes for = 2, no for 1<2 and unknown for 0<<1. We single out the log-fractional stable processes for 1<2, different from -stable motions for ≠2. They can be regarded as the limit of fractional stable processes as the exponent in the kernel tends to 0. The paper ends with a limit theorem for partial sum processes of moving averages of iid random variables in the domain of attraction of a strictly stable law, with log-fractional stable processes as limits in law. The conditions involve de Haan's class Π of slowly varying functions.  相似文献
10.
Let (Xi,Y i) be a set of observations form a stationary -mixing process and (x) be the conditional -th quantile of Y given X = x. Several authors considered nonparametric estimation of (x) in the i.i.d. setting. Assuming the smoothness of FF(x), we estimate it by local polynomial fitting and prove the asymptotic normality and the uniform convergence.  相似文献