Clean一般环的几个结果

证明了一般环I是Clean一般环当且仅当I上的形式幂级数一般环I[[x]]是Clean一般环;一般环I上的多项式环I[x]是Clean一般环当且仅当I是诣零的.引入了强Clean一般环的概念,它是强Clean环的推广.并证明了强π-正则的一般环是强Clean一般环.     

Some New Results on the Eigenvector Centrality

In this article we establish new results on the components of the principal eigenvector in an undirected graph. Those results are particularly significant in relation to the concept of centrality in social networks. In particular degree centrality and eigenvector centrality are compared. We find further conditions, based on the spectral radius, on which nodes with highest degree centrality are also the most eigencentral.     

Some new results on least square values for TU games

In this paper we present some new results concerning the least square family of values for TU games. We first examine the stability of these values from a dynamic point of view and propose a reinteropretation of them from the standpoint of the propernsity to disrupt approach. In the second part the family of individually rational least square (IRLS) values is introduced and an alternative kernel-like formulation of them is provided. Finally we describe a natural and simple algorithm for calculating any IRLS value of a game. We gratefully acknowledge financial support from the Basque Government (Project PI95/101) and from the D.G.E.S. of the Ministerio de Educatión y Cultura (Project PB96-0247).     

Some General Results on Equilibrium Prices in Large Random Exchange Economies

In this paper we are concerned with a model of a Walrasian exchange economy in which the preferences and endowments of the agents are random. Stochastic interaction among the agents is formally described in terms of dependency neighborhoods. The main result concerns a characterization of the distribution of market-clearing equilibrium prices in a large economy. The paper establishes conditions for asymptotic normality of appropriately normalized equilibrium prices.     

Some Results for Large Closed Queueing Networks with and without Bottleneck: Up- and Down-Crossings Approach

The paper provides the up- and down-crossing method to study the asymptotic behavior of queue-length and waiting time in closed Jackson-type queueing networks. These queueing networks consist of central node (hub) and k single-server satellite stations. The case of infinite server hub with exponentially distributed service times is considered in the first section to demonstrate the up- and down-crossing approach to such kind of problems and help to understand the readers the main idea of the method. The main results of the paper are related to the case of single-server hub with generally distributed service times depending on queue-length. Assuming that the first k–1 satellite nodes operate in light usage regime, we consider three cases concerning the kth satellite node. They are the light usage regime and limiting cases for the moderate usage regime and heavy usage regime. The results related to light usage regime show that, as the number of customers in network increases to infinity, the network is decomposed to independent single-server queueing systems. In the limiting cases of moderate usage regime, the diffusion approximations of queue-length and waiting time processes are obtained. In the case of heavy usage regime it is shown that the joint limiting non-stationary queue-lengths distribution at the first k–1 satellite nodes is represented in the product form and coincides with the product of stationary GI/M/1 queue-length distributions with parameters depending on time.     

一类具混合时滞随机神经网络稳定性的推广与应用

将一类具有混合时滞随机神经网络均方渐近稳定的判据推广到不确定神经网络的鲁棒稳定性,所导出的判据都表示为线性矩阵不等式(LMI)的形式,可通过使用一些标准的数值方法求解.最后给出了一个简单的例子说明所提出的判定条件的有效性和可应用性.     

具有时滞的抑制细胞神经网络的周期解的存在性和全局指数稳定性

By using the Leray-Schauder fixed point theorem,differential inequality techniques and constructing suitable Lyapunov functional,several sufficient conditions are obtained for the existence and global exponential stability of periodic solutions for general shunting inhibitory cellular neural networks with delays.Some new results are obtained and some previously known results are improved.An example is employed to illustrate our feasible results.     

基于动态定价的再制造商主导的多周期多目标产品回收网络设计

假设回收商和制造/再制造商为独立理性的决策者,并共同构建回收网络,且制造/再制造商在两者的博弈中处于主导地位。另考虑废旧品回收率是回收价格的线性函数,结合回收定价与回收网络设计,建立基于动态定价的回收网络双层规划模型,上层规划为制造/再制造商进行再制造工厂的选址,确定回收补贴价格,下层规划为回收商进行回收中心的选址,确定废旧品的回收价格。通过建立模型求解算法,并给出算例论证模型的有效性。     

Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks

We present a parametric approach for solving fixed-charge problems first sketched in Glover (1994). Our implementation is specialized to handle the most prominently occurring types of fixed-charge problems, which arise in the area of network applications. The network models treated by our method include the most general members of the network flow class, consisting of generalized networks that accommodate flows with gains and losses. Our new parametric method is evaluated by reference to transportation networks, which are the network structures most extensively examined, and for which the most thorough comparative testing has been performed. The test set of fixed-charge transportation problems used in our study constitutes the most comprehensive randomly generated collection available in the literature. Computational comparisons reveal that our approach performs exceedingly well. On a set of a dozen small problems we obtain ten solutions that match or beat solutions found by CPLEX 9.0 and that beat the solutions found by the previously best heuristic on 11 out of 12 problems. On a more challenging set of 120 larger problems we uniformly obtain solutions superior to those found by CPLEX 9.0 and, in 114 out of 120 instances, superior to those found by the previously best approach. At the same time, our method finds these solutions while on average consuming 100 to 250 times less CPU time than CPLEX 9.0 and a roughly equivalent amount of CPU time as taken by the previously best method.     

Some Existence Results for Vector Quasivariational Inequalities Involving Multifunctions and Applications to Traffic Equilibrium Problems

Some existence results for vector quasivariational inequalities with multifunctions in Banach spaces are derived by employing the KKM-Fan theorem. In particular, we generalize a result by Lin, Yang and Yao, and avoid monotonicity assumptions. We also consider a new quasivariational inequality problem and propose notions of weak and strong equilibria while applying the results to traffic network problems.     

A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance

There are potential advantages in formulating the routing problems in modern multiservice networks as multiple objective problems. This paper presents a novel hierarchical bi-level multiobjective dynamic routing model for multiservice networks. It is based on a bi-objective shortest path algorithm, with dynamically adapted soft-constraints, to compute alternative paths for each node pair and on a heuristic to synchronously select alternative routing plans for the network in a dynamic alternative routing context. It is a routing method which periodically changes alternative paths as a function of periodic updates of certain QoS related parameters obtained from real-time measurements. The performance of the proposed routing method is compared with two reference dynamic routing methods namely RTNR and DAR by means of a discrete-event simulator.A previous short version of this work was presented at INOC’03 (International Network Optimisation Conference). Work partially supported by programme POSI of the III EC programme cosponsored by FEDER and national funds.     

Experimental Results on Using General Disjunctions in Branch-and-Bound for General-Integer Linear Programs

Typical implementations of branch-and-bound for integer linear programs choose to branch on single variables. In this paper we explore the use of general disjunctions for branching when solving linear programs with general-integer variables. We give computational results that show that the size of the enumeration tree can be greatly reduced by branching on such disjunctions rather than on single variables.     

二元序列的自相关函数和游程的一些结果

给出了二元周期序列的自相关性质与其游程性质之间的关系,作为一个应用,我们给出了周期为1 2的零自相关窗大于等于6的所有序列.     

Symmetry Results for Positive Solutions of Some Elliptic Equations on Manifolds

We adapt the method of moving planes in order to obtainsymmetry results for positive solutions of some elliptic equations onmanifolds, in the case where our problem satisfies certain symmetryhypothesis. We also obtain monotonicity results using the slidingmethod.     

关于次序统计量广义TTT序的几个结果

研究了次序统计量在广义TTT变换序(TTT变换序)和剩余财富序下的性质. 讨论了寿命分布类NBUT在增凹变换下的封闭性以及NWUT寿命分布在次序统计量下的特征.     

Some Results for Classical Risk Process with Stochastic Return on Investments

In this paper, we discuss the classical risk process with stochastic return on investment. We prove some properties of the ruin probability, the supremum distribution before ruin and the surplus distribution at the time of ruin and derive the integro-differential equations satisfied by these distributions respectively.     

Some Limit Results for Transient Subsequence of Brownian Motion on Line

Ｌｅｔ {Ｗ(ｔ) ,0≤ｔ<∞ }ｂｅａｓｔａｎｄａｒｄ ,ｏｎｅ ｄｉｍｅｎｓｉｏｎａｌＢｒｏｗｎｉａｎｍｏｔｉｏｎｏｎ (Ω ,Ｆ ,Ｐ) .Ｉｔｉｓｗｅｌｌｋｎｏｗｎｔｈａｔ -∞ =ｌｉｍｉｎｆｔ→∞ Ｗ(ｔ) <ｌｉｍｓｕｐｔ→∞ Ｗ(ｔ) =∞ａｎｄａｃｃｏｒｄｉｎｇｔｏＫａｈａｎｃｅ ([1 ] ,Ｔｈｅｏｒｅｍ1 ,Ｃｈａｐｔｅｒ 1 2 ) ,ｉｆａｓｅｑｕｅｎｃｅ {ｔｎ,ｎ≥ 1 )ｓａｔｉｓｆｉｅｓ∑∞ｎ=11ｔｎ<∞ ,ｔｈｅｎｌｉｍｎ→∞ Ｗ(ｔｎ) =∞ａ .ｓ.Ｗｅｃａｌｌｔｈｅｓｅｑｕｅｎｃｅ {Ｗ (ｔｎ) ,ｎ≥ 1 }ａｔｒａｎｓｉｅｎｔ…     

网络最短的最优解集结构

The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions set on the shortest paths is studied in this paper. First,the conditions of having unique shortest path between two distinguished vertices s and t in a network G are discussed;Second,the structural properties of 2-transformation graph (?) on the shortest-paths for G are presented heavily.     

Results on Uniqueness Problem for Meromorphic Mappings Sharing Moving Hyperplanes in General Position Under More General and Weak Conditions

The aim of the paper is to deal with the algebraic dependence and uniqueness problem for meromorphic mappings by using the new second main theorem with different weights involved the truncated counting functions, and some interesting uniqueness results are obtained under more general and weak conditions where the moving hyperplanes in general position are partly shared by mappings from Cⁿ into P^N(C), which can be seen as the improvements of previous well-known results.     

Chasing robbers on random graphs: Zigzag theorem

In this paper, we study the vertex pursuit game of Cops and Robbers where cops try to capture a robber on the vertices of the graph. The minimum number of cops required to win on a given graph G is the cop number of G. We present asymptotic results for the game of Cops and Robber played on a random graph G(n,p) for a wide range of p = p(n). It has been shown that the cop number as a function of an average degree forms an intriguing zigzag shape. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010