Buffer Overflow Probabilities for a Markov-Modulated Fluid Model

Markov modulated fluid models are widely used in modelling communications and computer systems. In the AMS (Annick, Mitra, Sohndi) model, heterogeneous, bursty sources modeled by multidimensional Markov processes are superimposed or multiplexed together to drive a fluid buffer. The performance of the system is measured by the steady state probability that the buffer exceeds a high level. The exact solution to this problem derived by AMS requires too much computation to be used on-line. Here we derive an upper bound for the above probability which is fast to compute and accurate enough for practical use.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.     

关于~*-mixing随机变量序列的强大数定律

利用任意随机变量序列的强大数定律讨论 * -mixing随机变量序列的强大数定律 ,得到了该序列的一个强极限定理 ,推广了经典的 * mixing随机变量序列的强大数定律 .同时讨论了 m相依序列和独立随机变量序列的强大数定律 .     

Catalan-like number sequences and Hausdorff moment sequences

Many well-known Catalan-like sequences turn out to be Stieltjes moment sequences (Liang et al. (2016)). However, a Stieltjes moment sequence is in general not determinate; Liang et al. suggested a further analysis about whether these moment sequences are determinate and how to obtain the associated measures. In this paper we find necessary conditions for a Catalan-like sequence to be a Hausdorff moment sequence. As a consequence, we will see that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers, are Hausdorff moment sequences. We can also identify the smallest interval including the support of the unique representing measure. Since Hausdorff moment sequences are determinate and a representing measure for above mentioned sequences are already known, we could almost complete the analysis raised by Liang et al. In addition, subsequences of Catalan-like number sequences are also considered; we will see a necessary and sufficient condition for subsequences of Stieltjes Catalan-like number sequences to be Stieltjes Catalan-like number sequences. We will also study a representing measure for a linear combination of consecutive terms in Catalan-like number sequences.     

带有阈值转换和启动时间的优先权排队

在诸如ＩＳＤＮ的通信网络中,多种信息共用一条线路,为了满足不同类型信息的服务质量要求,带有阈值转换的优先权排队系统应是一种合适的模型。本文研究单服务员、两类顾客的带有阈值转换和启动时间的优先权排队系统,首先,分别就抢占和非抢占情形讨论了具有泊松到达、服务时间和启动时间均有指数贩系统,然后就非抢占情况进上步考虑了服务时间和启动时间有一般分布的系统,求出了系统中两类顾客队长的稳态联合概率母函数,藉助这     

Cross-Correlations of Quadratic Form Sequences in Odd Characteristic

Cross-correlation functions are determined for a large class of geometric sequences based on m-sequences in odd characteristic. These sequences are shown to have low cross-correlation values in certain cases. They also have significantly higher linear spans than previously studied geometric sequences. These results show that geometric sequences are candidates for use in spread-spectrum communications systems in which cryptographic security is a factor.     

Further discrepancy bounds and an Erdös–Turán–Koksma inequality for hybrid sequences

We consider hybrid sequences, that is, sequences in a multidimensional unit cube that are composed from lower-dimensional sequences of two different types. We establish nontrivial deterministic discrepancy bounds for five kinds of hybrid sequences as well as a new version of the Erdös–Turán–Koksma inequality which is suitable for hybrid sequences.     

最佳跳频序列族的设计与分析

本文提出了基于ｐ元广义ＧＭＷ序列和ｐ元Ｋａｓａｍｉ序列构造跳频序列族的方法,证明了基于广义ＧＭＷ序列所构造的跳频序列族具有最佳Ｈａｍｍｉｎｇ相关特性,而基于Ｋａｓａｍｉ序列所构造的跳频序列族不具有最佳Ｈａｍｍｉｎｇ相关特性。     

Optimization of SVM parameters for recognition of regulatory DNA sequences

Identification and recognition of specific functionally-important DNA sequence fragments such as regulatory sequences are considered the most important problems in bioinformatics. One type of such fragments are promoters, i.e., short regulatory DNA sequences located upstream of a gene. Detection of regulatory DNA sequences is important for successful gene prediction and gene expression studies. In this paper, Support Vector Machine (SVM) is used for classification of DNA sequences and recognition of the regulatory sequences. For optimal classification, various SVM learning and kernel parameters (hyperparameters) and their optimization methods are analyzed. In a case study, optimization of the SVM hyperparameters for linear, polynomial and power series kernels is performed using a modification of the Nelder–Mead (downhill simplex) algorithm. The method allows for improving the precision of identification of the regulatory DNA sequences. The results of promoter recognition for the drosophila sequence datasets are presented.     

Characteristic sequences of non-associative algebras

Abstract

In this paper, we provide the complete characterization of integer sequences that are characteristic sequences for general non-associative algebras, i.e., we determine the set of combinatorial properties which hold for all characteristic sequences and construct corresponding algebras for integer sequences satisfying them. The obtained information on characteristic sequences is then applied to investigate the realizability problem for the length function. In particular, we determine certain segment of values which are not realizable as values of the length function.     

Sequences of functions of binomial type

The theory of binomial enumeration leads to sequences of functions of binomial type which are not polynomials. The results of Mullin-Rota for these sequences are developed and a ring structure on the set of sequences is studied.     

Hyperexpansive completion problem via alternating sequences; an application to subnormality

Truncations of completely alternating sequences are entirely characterized. The completely hyperexpansive completion problem is solved for finite sequences of (positive) numbers in terms of positivity of attached matrices. Solutions to the problem are written explicitly for sequences of two, three, four, five and six numbers. As an application, an explicit solution of the subnormal completion problem for five numbers is given.     

Performance analysis of AAL multiplexer with CBR traffic and bursty traffic

This paper models and evaluates the AAL multiplexer to analyze AAL protocol in ATM networks. We consider an AAL multiplexer in which a single periodically deterministic CBR traffic stream and several variable size bursty background traffic streams are multiplexed and one ATM cell stream goes out. We model the AAL multiplexer as aB ^X +D/D/1/K queue and analyze this queueing system. We represent various performance measures such as loss probability and waiting time in the basis of cell and packet.     

Statistical convergence in intuitionistic fuzzy n-normed linear spaces

The aim in our article is to introduce the notion of statistical convergence and statistically Cauchy sequences in intuitionistic fuzzy n-normed linear spaces. The paper shows that some properties of statistical convergence of real sequences also hold for sequences in this space. Characterization for statistically convergent and statistically Cauchy sequences is also given. Further, the concept of statistical limit points and statistical cluster points are introduced and their relation with limit points of sequences have been investigated.     

Analytical sequences of upper and lower solutions for a class of elliptic equations

Comparison arguments are applied to derive decreasing sequences of upper solutions and increasing sequences of lower solutions for a class of nonlinear elliptic equations. The monotonicity of the two sequences is proven. These polynomial sequences are obtained by applying new algorithms and solving linear differential equations. The obtained upper and lower solutions are analytic and have closed forms. Different examples are presented to explore the effectiveness of the new algorithms. The presented ideas and algorithms can be extended to deal with different classes of equations.     

��ƽ��ND���в��ֺ͵ľ�ȷ������

In this paper, by using central limit theorem of ND sequences and probability inequality, the precise asymptotics for partial sums of nonstationary ND sequences is investigated, and the same results with it under that of NA sequences are obtained.     

Cross-correlations of geometric sequences in characteristic two

Cross-correlation functions are determined for a large class of geometric sequences based on m-sequences in characteristic two. These sequences are shown to have low cross-correlation values in certain cases. They are also shown to have significantly higher linear complexities than previously studied geometric sequences. These results show that geometric sequences are candidates for use in spread-spectrum communications systems in which cryptographic security is a factor.Parts of this work were presented at the International Symposium on Information Theory, Honolulu, Hawaii, November, 1990.Project sponsored by the National Security Agency under Grant Number MDA904-91-H-0012. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon.     

DNA序列的分类模型

本文针对 DNA序列分类这个实际问题 ,提出了相应的数学模型 .为了很好的体现 DNA序列的局部性和全局性的特征 ,我们给出了衡量分类方法优劣的标准 ,即在满足一定限制条件的情况下 ,是否能充分反映序列的各方面特性 .依据我们提出的判别标准 ,单一标准的分类是无法满足要求的 .我们的方法是侧重点不同的三种方法的综合集成 .这三种方法分别体现了序列中元素出现的概率 ,序列中元素出现的周期性 ,序列所带有的信息含量 .利用这个方法 ,完成了对未知类型的人工序列及自然序列的分类工作 .最后 ,对分类模型的优缺点进行了分析 ,并就模型的推广作了讨论     

Identities on Bell polynomials and Sheffer sequences

In this paper, we study exponential partial Bell polynomials and Sheffer sequences. Two new characterizations of Sheffer sequences are presented, which indicate the relations between Sheffer sequences and Riordan arrays. Several general identities involving Bell polynomials and Sheffer sequences are established, which reduce to some elegant identities for associated sequences and cross sequences.     

Numeration of non-decreasing and non-increasing serial sequences

Finite sets of n-valued serial sequences are examined. Their structure is determined not only by restrictions on the number of series and series lengths, but also by restrictions on the series heights, which define the order number of series and their lengths, but also is limited to the series heights, by whose limitations the order of series of different heights is given. Solutions to numeration and generation problems are obtained for the following sets of sequences: non-decreasing and non-increasing sequences where the difference in heights of the neighboring series is either not smaller than a certain value or not greater than a certain value. Algorithms that assign smaller numbers to lexicographically lower sequences and smaller numbers to lexicographically higher sequences are developed.