搜索结果: 106-120 共查到“知识库 计算数学其他学科”相关记录162条 . 查询时间(0.843 秒)
等式约束优化的投影拟牛顿法的非单调依赖域算法
非单调技术 非线性等式约束优化 投影拟牛顿法 非单调依赖域算法
2009/1/12
提供了分解投影拟牛顿法结合非单调信赖域算法求解非线性等式约束优化问题。在合理的条件下，证明了算法的整体收敛性，通过引进二阶矫正步克服了MARATOS效应，使算法保持了局部超线性收敛速度
非光滑单值优化的非单调线搜索方法
非单调线搜索技术 单值优化 非线性无约束极小化 收敛性
2008/12/12
提供了非光滑单值优化的非单调线搜索方法，基于线性规划的对偶定理，目标函数的方向导数可以表示成线性规划问题，这在实际计算非单调线搜索子问题时是非常重要的，在合理的条件下，证明了 法的整体收敛性和局部超线性收敛速率。
离散时间线性系统结构稳定的综合及在拉降装置上的应用
拉降装置 离散时间 线性系统结构
2008/12/12
迄今为至关于带干扰的结构稳定线性调节器的设计,大都是在连续时间系统上讨论的。本文作者已将连续系统的主要结果推广于离散时间的情况。本文结合一个具体工程对象,讨论了如何应用上述结果。被控制的对象是在海上作业的拉降装置。拉降过程要求确保缆绳的张力平稳,使直升飞机降落时飞行员感觉平稳。并安全地在甲板上着陆。图一是拉降示意
U--6%Nb二元合金凝固过程中显微组织与显微偏析的模拟
U--6%Nb二元合金 凝固过程 显微组织 显微偏析
2008/12/10
本文针对以往元胞自动机方法中对固相分数计算模型进行了改进，根据相图计算将固液界面区域内固相分数表示为一个一元二次方程，这种方法不需假设界面的位置和形状，使得模型的物理意义更加明确。利用这种方法模拟了U-6%Nb二元合金的凝固组织和显微偏析，模拟结果表明最初形核部位的Nb溶质浓度最高，随着凝固的不断进行，晶核中心部位Nb 溶质浓度不断下降。当凝固要结束的时候，晶粒边界就会形成贫Nb晶界，Nb溶质浓度...
On the complexity of non-unique probe selection
Non-unique probe selection Separable matrices DP-complete P
2012/12/3
We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the minimal d?separable matrix problem is...
Counting Method for Multi-party Computation over Non-abelian Groups
Multiparty Passive Adversary Non-Abelian Groups Graph Coloring Neighbor-Avoiding Walk Random Walk
2012/12/3
In the Crypto’07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. The function to be computed is fG(x1, . . . , xn) := x1 · . . . · xn whe...
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Multiparty Computation Passive Adversary Non-Abelian Groups Graph Coloring Percolation Theory
2012/12/3
Recently, Desmedt et al. studied the problem of achieving secure nparty computation over non-Abelian groups. They considered the passive adversary model and they assumed that the parties were only all...
BSGI: An Effective Algorithm towards Stronger l-Diversity
Privacy preservation BSGI k-anonymity l-diversity UniqueDistinct l-diversity 3535
2012/12/3
To reduce the risk of privacy disclosure during personal data publishing, the approach of anonymization is widely employed. On this topic, current
studies mainly focus on two directions: (1)developin...
Holographic Algorithms With Unsymmetric Signatures
Holographic Algorithms Unsymmetric Signatures
2012/11/30
Holographic algorithms were introduced by Valiant as a new methodology to derive polynomial time algorithms. Here information
and computation are represented by exponential sums using the so-called s...
BSGI: An Effective Algorithm towards Stronger l-Diversity
Privacy preservation BSGI, k-anonymity l-diversity Unique-Distinct l-diversity.
2012/11/30
To reduce the risk of privacy disclosure during personal data publishing, the approach of anonymization is widely employed. On this topic, current studies mainly focus on two directions: (1)developing...
With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-pr...
With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round protocol for privacy-pr...
Holographic Algorithms With Unsymmetric Signatures
Holographic Algorithms Unsymmetric Signatures
2012/11/30
Holographic algorithms were introduced by Valiant as a new methodology to derive polynomial time algorithms. Here information and computation are represented by exponential sums using the so-called si...
More Efficient Algorithms for Closest String and Substring Problems
More Efficient Algorithms Closest Strings Substring Problems
2012/11/30
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been exten...