搜索结果: 46-60 共查到“知识库 离散数学”相关记录173条 . 查询时间(2.636 秒)
针对一类具有输入时滞的时变离散系统, 研究其预见控制问题. 利用差分算子的性质, 对系统的输入时滞项和目标信号进行差分处理, 构造包含目标信号但不含时滞的扩大误差系统. 基于最优控制和预见控制的相关理论, 得到了扩大误差系统带有预见前馈补偿的控制器. 进一步, 利用矩阵分解方法, 将高阶Riccati 方程进行降阶处理, 从而得到原时滞系统的预见控制器. 最后通过仿真实例验证了所提出方法的有效性.
马氏利率的离散时间风险模型的破产概率
离散时间风险模型 马氏链 破产概率 利率
font style='font-size:12px;'>
2014/1/9
研究一类保费和理赔额均为随机变量、利率为马氏链的离散时间风险模型的破产概率，推出了有限时间和最终时间破产概率的递归方程，并用归纳法得到最终时间破产概率的上界估计.
关于一个半离散非齐次核的逆向Hilbert型不等式
半离散 Hilbert不等式 Holder不等式 等价式
font style='font-size:12px;'>
2014/1/9
应用权函数方法及实分析技巧，给出一个新的带有最佳常数因子的半离散非齐次核的逆向Hilbert型不等式，同时给出它的带有最佳常数因子的等价式.
基于离散Morse方法的分类规则研究
离散Morse函数 离散梯度向量域 分类规则
font style='font-size:12px;'>
2014/6/20
随着离散Morse方法的出现和发展，其应用也越来越广泛，主要领域有拓扑学、计算机图形学和几何建模等。分类规则挖掘则是通过对训练样本数据集的学习构造分类规则的过程，是数据挖掘、知识发现的一个重要方面。分类规则挖掘的实质是希望得到高准确性、有趣的和易于理解的分类规则。本文利用离散Morse方法构造分类器，从大量数据中选出人们感兴趣的有用信息。首先综述了数据挖掘和离散Morse方法的相关理论知识，描述了...
证明了, 若连通图\,$G$\,不是二部图, 则其最小\,$Q$\,-特征值\,$q(G)\geqslant \frac{1}{n(D+1)}$, 其中\,$D$\,是\,$G$\,的直径. 另外, 还给出了图\,$G$\,的最小\,$Q$-特征值与其子图的最小\,$Q$\,-特征值之间的关系.
基于离散非线性指数趋近律的变结构控制
离散变结构控制 抖振 鲁棒性 指数趋近律
font style='font-size:12px;'>
2014/4/11
针对传统趋近律抖振大、趋近速度不快的缺陷,提出了一种新的离散趋近律。通过在指数趋近律切换项系数中加入非线性函数,实现了切换项系数随运动点到切换面的距离从大到小逐步变化,加快了趋近速度并降低了抖振,间接提高了系统鲁棒性。仿真结果证明,离散非线性指数趋近律具有良好的趋近品质,对确定性系统和不确定系统都有良好的控制效果。
IDENTIFYING THE SUCCESSIVE BLUMENTHAL–GETOOR INDICES OF A DISCRETELY OBSERVED PROCESS
IDENTIFYING THE SUCCESSIVE BLUMENTHAL–GETOOR INDICES A DISCRETELY OBSERVED PROCESS
font style='font-size:12px;'>
2014/3/13
This paper studies the identification of the Lévy jump measure of a discretely-sampled semimartingale. We define successive Blumenthal–Getoor indices of jump activity, and show that the leading index ...
The Set of Solutions of Random XORSAT Formulae
Random XORSAT Formulae Discrete Mathematics Probability
font style='font-size:12px;'>
2011/10/9
Abstract: The XOR-satisfiability (XORSAT) problem requires finding an assignment of n Boolean variables that satisfies m exclusive OR (XOR) clauses, whereby each clause constrains a subset of the vari...
On spanning maximum k-edge-colorable subgraphs
maximum k-edge-colorable subgraphs Discrete Mathematics
font style='font-size:12px;'>
2011/10/9
Abstract: A subgraph $H$ of a graph $G$ is called spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is $k$-edge-colorable and contains as man...
Applications of Derandomization Theory in Coding
Derandomization theory randomness extractors pseudorandomness wiretap channels group testing error-correcting codes
font style='font-size:12px;'>
2011/10/9
Abstract: Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial...
Conditioned Poisson distributions and the concentration of chromatic numbers
Random graph chromatic number second moment method categorical data twoway tables Poisson counts
font style='font-size:12px;'>
2011/10/9
Abstract: The paper provides a simpler method for proving a delicate inequality that was used by Achlioptis and Naor to establish asymptotic concentration for chromatic numbers of Erdos-Renyi random g...
Locally monotone Boolean and pseudo-Boolean functions
Boolean function pseudo-Boolean function local monotonicity discrete partial derivative join and meet derivatives
font style='font-size:12px;'>
2011/9/29
Abstract: We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if each of its partial derivatives keep...
Integral Value Transformations: A Class of Discrete Dynamical Systems
Discrete Dynamical Systems Topological Dynamics integral value Transformations
font style='font-size:12px;'>
2011/9/29
Abstract: Here the Integral Value Transformations (IVTs) are considered to be Discrete Dynamical System map in the space\mathbb{N}_(0). In this paper, the dynamics of IVTs is deciphered through the li...
Extended formulations for polygons
Extended formulations polygons
font style='font-size:12px;'>
2011/9/29
Abstract: The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$-gons in the...
Sequential vibrational resonance in multistable systems
multistable system vibrational resonance signal amplification
font style='font-size:12px;'>
2011/7/6
The phenomenon of sequential vibrational resonance existed in a multistable system that is excited by both high- and low-frequency signals is reported. By the method of direct separation of motions, t...