首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
First, we systematize earlier results on the global stability of the model of population growth. Second, we investigate the effect of delay on the asymptotic behavior when the nonlinearity f is a unimodal function. Our results can be applied to several population models [Elements of Mathematical Ecology, 2001 [7]; Appl. Anal. 43 (1992) 109-124; Math. Comput. Modelling, in press; Funkt. Biol. Med. 256 (1982) 156-164; Math. Comput. Modelling 35 (2002) 719-731; Mat. Stos. 6 (1976) 25-40] because the function f does not need to be monotone or differentiable. Specifically, our results generalize earlier result of [Delay Differential Equations with Applications in Population Dynamics, 1993], since our function f may not be differentiable.  相似文献   

2.
The growth rate of partial maxima for iid. random variables is considered with respect to subsequences. The results show that in a certain class of random variables only the maximal growth rate is connected with the growth of the subsequence.  相似文献   

3.
4.
The buyer in a seller-first offer bargaining situation use deception to cause the seller to arrive at an inaccurate subjective probability distribution of the buyer's position. The effects on the optimal behavior of the seller and on the payoffs to the two parties are examined.  相似文献   

5.
We classify sets Z of points in the projective plane, for which the difference between the minimal degrees of curves containing 2Z and Z respectively is small.  相似文献   

6.
Lower bounds on the probability of a union obtained by applying optimal bounds to subsets of events can provide excellent bounds. Comparisons are made with bounds obtained by linear programming and in the cases considered, the best bound is obtained with a subset that contains no redundant events contributing to the union. It is shown that redundant events may increase or decrease the value of a lower bound but surprisingly even removal of a non-redundant event can increase the bound.  相似文献   

7.
The paper studies an oligopolistic equilibrium model of financial agents who aim to share their random endowments. The risk-sharing securities and their prices are endogenously determined as the outcome of a strategic game played among all the participating agents. In the complete-market setting, each agent’s set of strategic choices consists of the security payoffs and the pricing kernel that are consistent with the optimal-sharing rules; while in the incomplete setting, agents respond via demand functions on a vector of given tradeable securities. It is shown that at the (Nash) risk-sharing equilibrium, the sharing securities are suboptimal, since agents submit for sharing different risk exposures than their true endowments. On the other hand, the Nash equilibrium prices stay unaffected by the game only in the special case of agents with the same risk aversion. In addition, agents with sufficiently lower risk aversion act as predatory traders, since they absorb utility surplus from the high risk averse agents and reduce the efficiency of sharing. The main results of the paper also hold under the generalized models that allow the presence of noise traders and heterogeneity in agents’ beliefs.  相似文献   

8.
In this article, we develop a simple model for the effect of gossip spread on social network structure. We define gossip as information passed between two individuals A and B about a third individual C which affects the strengths of all three relationships: it strengthens A‐B and weakens both B‐C and A‐C. We find, in both an analytic derivation and model simulations, that if gossip does not spread beyond simple triads, it destroys them but if gossip propagates through large dense clusters, it strengthens them. Additionally, our simulations show that the effect of gossip on network metrics (clustering coefficient, average‐path‐length, and sum‐of‐strengths) varies with network structure and average‐node‐degree. © 2010 Wiley Periodicals, Inc. Complexity 16: 39‐47, 2011  相似文献   

9.
We discuss the relationship between the frequency and the growth of H-harmonic functions on the Heisenberg group.Precisely,we prove that an H-harmonic function must be a polynomial if its frequency is globally bounded.Moreover,we show that a class of H-harmonic functions are homogeneous polynomials provided that the frequency of such a function is equal to some constant.  相似文献   

10.
Let A be a matrix in r×r such that Re(z) > −1/2 for all the eigenvalues of A and let {πn(A,1/2) (x)} be the normalized sequence of Laguerre matrix polynomials associated with A. In this paper, it is proved that πn(A,1/2) (x) = O(n(A)/2lnr−1(n)) and πn+1(A,1/2) (x) − πn(A,1/2) (x) = O(n((A)−1)/2lnr−1(n)) uniformly on bounded intervals, where (A) = max{Re(z); z eigenvalue of A}.  相似文献   

11.
The purpose of this note is to study initial sequences of 0–dimensional subschemes of Hirzebruch surfaces and classify subschemes whose initial sequence has the minimal possible growth.  相似文献   

12.
Economical and environmental issues are the main driving forces for the development of closed-loop supply chains. This paper examines the impact of environmental issues on long-term behaviour of a single product supply chain with product recovery. The environmental issues examined are the firm's `green image' effect on customer demand, the take back obligation imposed by legislation, and the state campaigns for proper disposal of used products. The behaviour of the system is analyzed through a dynamic simulation model based on the principles of the system dynamics (SD) methodology. This model includes all major inventories of new, used and recovered products and the flows among them. Inventory levels and flow rates are linked through differential equations. The dynamic model provides an experimental simulation tool, which can be used to evaluate the effect of environmental issues on long-term decision making in collection and remanufacturing activities and on product demand. Numerical analysis illustrates the potential uses of the methodology.  相似文献   

13.
We consider the formula size complexity of boolean functions over the base consisting of ∧, ∨, and ¬ gates. In 1961 Subbotovskaya proved that, for any boolean function on n variables, setting all but a randomly chosen ?n variables to randomly chosen constants, reduces the expected complexity of the induced function by at least a factor. This fact was used by Subbotovskaya to derive a lower bound of Ω(n1.5) for the formula size of the parity function, and more recently by Andreev who exhibited at lower bound of ΩC(n2.5/logO(1)(n)) for a function in P. We present the first improvement of Subbotovskaya's result, showing that the expected formual complexity of a function restricted as above is at most an O(?γ) franction of its original complexity, for This allows us to give an improved lower bound of Ω(n2.556…) for Andreev's function. At the time of discovery, this was the best formula lower bound known for any function in NP. © 1993 John Wiley & Sons, Inc.  相似文献   

14.
Studies in mathematics education often point to the necessity for students to engage in more cognitively demanding activities than just solving tasks by applying given solution methods. Previous studies have shown that students that engage in creative mathematically founded reasoning to construct a solution method, perform significantly better in follow up tests than students that are given a solution method and engage in algorithmic reasoning. However, teachers and textbooks, at least occasionally, provide explanations together with an algorithmic method, and this could possibly be more efficient than creative reasoning. In this study, three matched groups practiced with either creative, algorithmic, or explained algorithmic tasks. The main finding was that students that practiced with creative tasks did, outperform the students that practiced with explained algorithmic tasks in a post-test, despite a much lower practice score. The two groups that got a solution method presented, performed similarly in both practice and post-test, even though one group got an explanation to the given solution method. Additionally, there were some differences between the groups in which variables predicted the post-test score.  相似文献   

15.
Long memory in the sequence of interarrival times is known to have a large impact on queue performance. We used a factorial simulation experiment to relate four performance measures to degree of long memory, server utilization, number of customers, and their interactions.  相似文献   

16.
We investigate the effect of the ordering of the unknowns on the convergence of the preconditioned conjugate gradient method. We examine a wide range of ordering methods including nested dissection, minimum degree, and red-black and consider preconditionings without fill-in. We show empirically that there can be a significant difference in the number of iterations required by the conjugate gradient method and suggest reasons for this marked difference in performance.We also consider the effect of orderings when an incomplete factorization which allows some fill-in is performed. We consider the effect of automatically controlling the sparsity of the incomplete factorization through drop tolerances and level of fill-in.  相似文献   

17.
We investigate the effect of buoyancy on the upper-branch linearstability characteristics of an accelerating boundary-layerflow. The presence of a large thermal buoyancy force significantlyalters the stability structure. As the factor G (which is relatedto the Grashof number of the flow, and defined in Section 2)becomes large and positive, the flow structure becomes two layeredand disturbances are governed by the Taylor-Goldstein equation.The resulting inviscid modes are unstable for a large componentof the wavenumber spectrum, with the result that buoyancy isstrongly destabilizing. Restabilization is encountered at sufficientlylarge wavenumbers. For G large and negative the flow structureis again two layered Disturbances to the basic flow are nowgoverned by the steady Taylor—Goldstein equation in themajority of the boundary layer, coupled with a viscous walllayer. The resulting eigenvalue problem is identical to thatfound for the corresponding case of lower-branch Tollmien—Schlichtingwaves, thus suggesting that the neutral curve eventually becomesclosed in this limit.  相似文献   

18.
We present a stylized model for analyzing the effect of product variety on supply-chain performance for a supply chain with a single manufacturer and multiple retailers. The manufacturer produces multiple products on a shared resource with limited capacity and the effect of changeovers on supply-chain cost is due primarily to setup time rather than setup cost. We show that the expected replenishment lead time and the retailers' costs are concave increasing in product variety and that the increase is asymptotically linear. Thus, if setup times are significant, the effect of product variety on cost is substantially greater than that suggested by the risk-pooling literature for perfectly flexible manufacturing processes, where the cost increases proportionally to the square root of product variety. We demonstrate that disregarding the effect of product variety on lead time can lead to poor decisions and can lead companies to offer product variety that is greater than optimal. The results of our analysis enable decision-makers to quantify the effect of product variety on supply-chain performance and thus to determine the optimal product variety to offer. The results can also be used to evaluate how changes in the manufacturing process, the supply-chain structure, and the customer demand rate can improve the performance of supply chains with high product variety.  相似文献   

19.
20.
We consider an M/M/1 queueing system with a single queue scalper who makes profit by selling his position in the queue. The equilibrium purchasing strategies of customers under observable case (with double-threshold strategy) and unobservable case (with mixed strategy) are derived. The profits of the queue scalper are obtained under two information levels. Numerical experiments suggest that the queue scalper is better off with unobservable case when the system is too congested or the operating cost is too low.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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