首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   231篇
  免费   23篇
  国内免费   22篇
化学   5篇
力学   2篇
综合类   4篇
数学   250篇
物理学   15篇
  2024年   1篇
  2023年   4篇
  2022年   10篇
  2021年   1篇
  2020年   5篇
  2019年   10篇
  2018年   9篇
  2017年   9篇
  2016年   14篇
  2015年   5篇
  2014年   10篇
  2013年   26篇
  2012年   8篇
  2011年   6篇
  2010年   14篇
  2009年   14篇
  2008年   18篇
  2007年   13篇
  2006年   16篇
  2005年   15篇
  2004年   12篇
  2003年   9篇
  2002年   15篇
  2001年   3篇
  2000年   3篇
  1999年   2篇
  1998年   4篇
  1997年   5篇
  1996年   4篇
  1995年   2篇
  1994年   2篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
  1988年   1篇
  1987年   1篇
  1980年   1篇
  1969年   1篇
排序方式: 共有276条查询结果,搜索用时 15 毫秒
1.
2.
Signed graphs for portfolio analysis in risk management   总被引:1,自引:0,他引:1  
We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable.  相似文献   
3.
The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ k = E k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.  相似文献   
4.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.  相似文献   
5.
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.  相似文献   
6.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
7.
We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity.  相似文献   
8.
The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.  相似文献   
9.
10.
我国AB股双重上市公司经营业绩变化的实证分析   总被引:1,自引:0,他引:1  
本文以46家在上海和深圳同时上市AB股的公司的样本,分析了公司实行双重上市前1年及其后4年的经营业绩的变化趋势以及股权结构和上市顺序对它的影响。研究表明,双重上市当年及其后4年经营业绩显著下降;股权结构和上市顺序对公司经营业绩影响明显。最后,文章提出了改善AB股公司经营业绩的对策建议。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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