半平面上的Dirichlet级数的$(p,q)(R)$级和$(p,q)(R)$下级

讨论半平面上的Dirichlet级数的(p,q)(R)级,(p,q)(R)下级和正规(p,q)(R)级及它们之间的联系,并讨论了(p,q)(R)级,(p,q)(R)下级与级数的指数之间的关系.     

关于Kadec性质

证明了Banach空间若有性质（La)则具有Kedec性质．     

时滞差分系统基于两种测度的有界性

本文利用勒茹米辛型条件和向后差分算子获得一些定理可以确保时滞差分系统为(ho,h)一致有界(一致有界且最终有界,一致有界且一致最终有界).在所得到的定理中,对△V的限制较弱,便于应用.     

Efficiency of purchasing and selling agents in markets with quality uncertainty: The case of illicit drug transactions

Since Akerlof’s theory of lemons, economists have viewed quality uncertainty as an informational advantage for sellers. Drawing on frontier techniques, we propose in this paper a simple method for measuring inefficiency of both sellers and buyers in markets for goods with different levels of quality. We apply a non-parametric robust double-frontier framework to the case of illicit substance markets, which suffer from imperfect information about drug quality for purchasers and to a lesser extent for sellers. We use unique data on cannabis and cocaine transactions collected in France that include information about price, quantity exchanged and purity. We find that transactional inefficiency does not really benefit either dealers or purchasers. Furthermore, information influences the performance of agents during market transactions.     

线性混合效应模型预测值关于白噪声偏离的敏感性分析

本文应用Banerjee和Magnus于1999年提出的局部敏感性分析方法讨论了线性混合效应模型中预测值关于误差项白噪声偏离的敏感性问题,提出了敏感性度量统计量,并在AR(1)和MA(1)误差项条件下数值模拟了这些统计量的表现.结果表明,预测值在AR(1)和MA(1)误差项下一般都不具有明显的敏感性;特别是在MA(1)下预测值对误差项的白噪声偏离通常具有很好的稳健性.     

GM(1,1)模型适用域讨论及模型的改进

在已有灰色系统理论的基础上,讨论了GM(1,1)模型的适用域,明确界定了GM(1,1)模型的有效区域和禁区,并提出了GM(1,1)模型的一种改进形式——离散灰色预测DGM(1,1)模型.通过对我国经济增长的实证分析说明了该模型的有效性和可靠性.研究结果表明,提出的DGM(1,1)模型可作为灰色预测的一种精确模型,因此,为我国经济增长预测提供了一种新的方法,对当前我国经济的理性增长具有重要的指导意义.     

SUPER (SUB)-MIL AND UNIFORM INTEGRABILITY

In this paper, the following results have been proved: (i) If ( Xn,Fn ) is a uniformly integrable super(sub)-Mil, then (X.) lower (upper)-semiconverges (a. s. ) to an integrable random variable; (ii) If (Xn,Fn) is a uniformly integrable adapted sequence, then that (Xn) lower(upper)-semiconverges (a. s. ) is equivalent to that (Xn,Fn)is a super(sub)-Mil; and (iii) If (Xn,Fn) is a super(sub)-Mil of class (c-)((c+)), then (Xn) is lower(upper)-semiconvergent (a. s, ).     

(h,ψ)-不变广义凸函数的若干性质与(h,ψ)-不变广义凸多目标规划的最优性及对偶性

研究了Ben-Tal广义代数运算的若干性质,引进了(h,ψ)-不变广义凸函数的概念,讨论了(h,ψ)-不变广义凸函数的若干性质,给出了(h,ψ)-不变广义凸半无限多目标规划取得有效解(或弱有效解)的充分条件,建立了(h,ψ)-不变广义凸多目标规划的Lagrange对偶理论.     

论连通和单连通可裂G2的Aq(λ)的酉性

设G为一连通,单连通的G2型可裂实李群,K为G的最大紧致子群,g为G的李代数的复化,Aq(λ)为Knappp[7]中的定义(g,K)-模.(MAN,σ,ν)表示由[7]中猜测方法确定的Aq(λ)的自然不可约分量的Langlands参数.本文确定了当λ位于弱好区域外时,哪些Langlands商J(MAN,σ,v)为酉的.     

Criterions for detecting the existence of the exponential dichotomies in the asymptotic behavior of the solutions of variational equations

We prove that the admissibility of any pair of vector-valued Schäffer function spaces (satisfying a very general technical condition) implies the existence of a “no past” exponential dichotomy for an exponentially bounded, strongly continuous cocycle (over a semiflow). Roughly speaking the class of Schäffer function spaces consists in all function spaces which are invariant under the right-shift and therefore our approach addresses most of the possible pairs of admissible spaces. Complete characterizations for the exponential dichotomy of cocycles are also obtained. Moreover, we involve a concept of a “no past” exponential dichotomy for cocycles weaker than the classical concept defined by Sacker and Sell (1994) in [23]. Our definition of exponential dichotomy follows partially the definition given by Chow and Leiva (1996) in [4] in the sense that we allow the unstable subspace to have infinite dimension. The main difference is that we do not assume a priori that the cocycle is invertible on the unstable space (actually we do not even assume that the unstable space is invariant under the cocycle). Thus we generalize some known results due to O. Perron (1930) [14], J. Daleckij and M. Krein (1974) [7], J.L. Massera and J.J. Schäffer (1966) [11], N. van Minh, F. Räbiger and R. Schnaubelt (1998) [26].     

随机时间剩余寿命的分布类性质

得出了随机时间剩余寿命XY的随机比较性质和矩不等式．当Y是指数分布时求出了XY的故障率的界．     

Observer-based fault detection for networked control systems with network Quality of Services

This paper addresses the problem of the fault detection for linear time-invariant systems over data networks with limited network Quality of Services (QoS). An integrated index _ηk${\eta }_k$, which related with data dropout, network-induced delay and error sequence, is presented to described the non-ideal QoS, the probabilistic switching between different _ηk${\eta }_k$ is assumed to obey a homogeneous Markovian chain. Then by view of the augmented matrices approach, the fault detection error dynamic systems are transferred to Markov jumping systems (MJSs). With the developed model and using the bounded real lemma (BRL) for MJSs, an _H∞$H_{\infty }$ observer-based fault detection filter is established in terms of linear matrix inequalities (LMIs) to guarantee that the error between the residual and the weighted faults is made as small as possible. A simulation example is provided to show the effectiveness of the present methods.     

Why are enterprise resource planning systems indispensable to supply chain management?

Supply chain design is becoming a core competency, and the enterprise resource planning (ERP) system is expected to be an integral component of supply chain management (SCM). Installing an ERP system is, however, expensive and risky. IT managers must decide how to use their limited resources and invest in the right product. Can an ERP system directly improve SCM competency? This study proposes a conceptual framework featuring the ERP benefits and SCM competencies, and examines the impacts of the former on the latter. The results confirm the operational, managerial, and strategic benefits of ERP for the SCM competencies, but not the IT infrastructure and organizational benefits as significant predictors of them. Moreover, more than 80% of respondents think it necessary to first adopt an ERP system as the backbone of company operations before deploying other enterprise systems (ES), such as the SCM system.     

Constructions of Z-optimal Type-II quadriphase Z-complementary pairs

Investigating (periodic) and design sequences with good correlation properties have numerous applications in communications. Research on designing sequence pairs with good correlation properties started in the early 1950's thanks to M.J. Golay. Ideally, one of our ultimate aims in this context is to design a set of sequences whose out-of-phase auto-correlation magnitudes and cross-correlation magnitudes are very small, preferably zero. The so-called Z-complementary pair (ZCP) is one of the suitable candidates. A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums (AACSs) for time-shifts within a certain region, called zero correlation zone (ZCZ). ZCPs have been widely used in different communication systems and are closely related with almost difference families, which are useful in studying partially balanced incomplete block design. Despite remarkable progress in designing ZCPs, only a few constructions of quadriphase ZCPs (QZCPs) have been reported in the literature up to now. Aiming to reducing this gap, we explore in this article several methods to design such sequences. More specifically, we propose a recursive construction based on the concatenation of sequences aimed to design Type-II QZCPs. Also, based on Turyn's construction method, we present another new Type-II QZCPs. The proposed constructions lead to Z-optimal Type-II even-length QZCPs (E-QZCPs) and Type-II odd-length QZCPs (O-QZCPs) with large ZCZ widths. Finally, we derive upper bounds for the peak-to-mean envelope-power ratio (PMEPR) of the proposed ZCPs. It turns out that our constructions lead to ZCPs with low PMEPR. These characteristics allow our QZCPs to be seen as promising for practical uses in some modern communication systems.     

基于EB和TB的混合及双混合随机补货策略

在分销系统中,对库存补货策略进行科学管理与控制是一直是学者们研究的热点之一,学术界始终没有有效提高三个传统库存补货策略运作效率的有效方法.在两个传统补货策略(EB(echelon-based),TB(time-based))策略的基础上,从减少EB和TB策略的极端情况角度,提出了混合策略1(HBl,Hybrid Based Policy1)和混合策略2(HB2,Hybrid Based Policy2),并将HB1和HB2的优点结合起来形成双混合策略(RH,Re-Hybrid Policy).数值试验表明,HB1、HB2对EB、TB的总成本费用比率有不同程度的改善,同时RH能有效改善HB1、HB2的总成本费用比率.     

A stochastic multiscale model for electricity generation capacity expansion

Long-term planning for electric power systems, or capacity expansion, has traditionally been modeled using simplified models or heuristics to approximate the short-term dynamics. However, current trends such as increasing penetration of intermittent renewable generation and increased demand response requires a coupling of both the long and short term dynamics. We present an efficient method for coupling multiple temporal scales using the framework of singular perturbation theory for the control of Markov processes in continuous time. We show that the uncertainties that exist in many energy planning problems, in particular load demand uncertainty and uncertainties in generation availability, can be captured with a multiscale model. We then use a dimensionality reduction technique, which is valid if the scale separation present in the model is large enough, to derive a computationally tractable model. We show that both wind data and electricity demand data do exhibit sufficient scale separation. A numerical example using real data and a finite difference approximation of the Hamilton–Jacobi–Bellman equation is used to illustrate the proposed method. We compare the results of our approximate model with those of the exact model. We also show that the proposed approximation outperforms a commonly used heuristic used in capacity expansion models.     

抛物型方程在变动区域中的Galarkin有限元法及其对Stefan问题的应用

文中叙述了具变系数抛物型方程在变动区域中的有限元半离散格式和全离散θ格式,给出了误差界和稳定性结果,并应用于求解Stefan问题。     

Fuzzy classifier identification using decision tree and multiobjective evolutionary algorithms

This paper presents a hybrid method for identification of Pareto-optimal fuzzy classifiers (FCs). In contrast to many existing methods, the initial population for multiobjective evolutionary algorithms (MOEAs) is neither created randomly nor a priori knowledge is required. Instead, it is created by the proposed two-step initialization method. First, a decision tree (DT) created by C4.5 algorithm is transformed into an FC. Therefore, relevant variables are selected and initial partition of input space is performed. Then, the rest of the population is created by randomly replacing some parameters of the initial FC, such that, the initial population is widely spread. That improves the convergence of MOEAs into the correct Pareto front. The initial population is optimized by NSGA-II algorithm and a set of Pareto-optimal FCs representing the trade-off between accuracy and interpretability is obtained. The method does not require any a priori knowledge of the number of fuzzy sets, distribution of fuzzy sets or the number of relevant variables. They are all determined by it. Performance of the obtained FCs is validated by six benchmark data sets from the literature. The obtained results are compared to a recently published paper [H. Ishibuchi, Y. Nojima, Analysis of interpretability-accuracy tradeoff of fuzzy systems by multiobjective fuzzy genetics-based machine learning, International Journal of Approximate Reasoning 44 (1) (2007) 4–31] and the benefits of our method are clearly shown.     

OSCILLATION OF CERTAIN SECOND ORDER DIFFERENCE EQUATIONS

1IntroductionConsiderasec0nd0rderdifferenceequationwherethef0rwarddifference0perat0rAisdefinedbyAx.=xn 1-x.,{ri}2',isarealp0sitivesequence,ffN(n0)xR-Risc0ntinuousinxERf0reverynEN(no),xf(n,x)>Oforx/0,nEN(n0 1),N(s)isdefinedbyN(s)={s,s l,'-},seN(n0).Byasolution0f(E)wemeanarealsequence{I.}7',satisfying(E).Asolutionof(E)iscal1edn0n0scil1at0ry,ifitiseventua1lypositive0rnegative,otherwiseitiscalledoscillat0ry.Eq.(E)isca1led0scil1atoryifa11so1utions-of(E)are0scillat0ry.Definiti0n1Thefuncti…     

Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques

A GPS network can be defined as a set of stations, co-ordinated by a series of sessions formed by placing receivers on the stations. This paper shows how to search for the best order in which to observe these sessions giving the cheapest schedule. The complexity of observing GPS networks increases with their size and become highly difficult to solve effectively. To obtain good methods to solve this problem a new area of research is implemented. This area is based on developed heuristic techniques that provide an optimal or near optimal solution for large networks. Comparing their outcome in terms of solution quality and computational effort proves the performance of the developed techniques.