共查询到20条相似文献，搜索用时 250 毫秒
1.
给出一种求解在长波近似条件下水波问题所对应的哈密顿系统的辛几何算法.首先将生成函数法推广至无穷维哈密顿系统;然后,基于无穷维系统自身的哈密顿函数,而不是其有限维近似系统的哈密顿函数,构造辛差分格式;最后,用空间离散的辛格式实现仿真计算.与非辛算法相比,该辛算法在长时间仿真中能给出稳定的数值结果.与传统的求解无穷维哈密顿系统的辛几何算法相比,该算法计算效率更高,其仿真结果更准确. 相似文献
2.
本文针对在一个给定的再生核Hilbert空间中函数的一种分段线性插值方法,讨论此插值函数的逼近性,通过数值算例,表明该逼近方法是可行的。 相似文献
3.
本文利用统计翻译模型计算单词之间的语义相似度,并将此语义信息嵌入至核函数,实现了一个基于语义核函数的问句检索系统,利用语义核函数计算问句之间的语义相似度。通过在真实问答对数据上进行的实验,表明基于语义核函数的问句检索模型的效果优于传统的相似度计算模型,可以提高问句语义匹配准确率,具有一定的实用性。 相似文献
4.
5.
6.
讨论了单输入单输出ARMAX系统在非高斯噪声环境下的参数估计问题。提出了一种基于M估计理论的系统参数动态递推辨识算法,利用函数逼近原理以及矩阵等价变换知识,给出了算法的详细推导过程,分析了M估计用于系统建模的原理,给出了适合在线计算的参数估计递推算法。最后进行了数值仿真,结果表明本文提出的算法具有较强的抗噪能力和良好的收敛性。 相似文献
7.
李刚成 《科技成果管理与研究》2009,(6):49-51
本文提出了基于核Fisher判别分析的滚动轴承故障诊断方法。该方法利用非线性核函数将数据从原始空间映射到高维特征空间,在高维特征空间中利用Fisher判别分析方法提取最优的Fisher特征矢量和判别矢量来实现滚动轴承的状态监控与故障诊断。试验结果表明,核Fisher判别分析方法能很好地识别滚动轴承的故障模式。 相似文献
8.
利用再生核Hilbert空间H(Ka)[a,b]中一种插值函数,给出数值算例,并与其他方法相比较,表明该插值方法实用有效。 相似文献
9.
自然界中存在的许多现象具有分形特征,传统的Euclid 空间对具有分形特征的自然界形态仿真具有一定困难.对此可以用分形插值来拟合自然界形态.分形插值函数是由迭代函数系统(IFS)实现的.通过离散的数据点构成分形插值函数,可以证明分形插值函数是这个IFS唯一的吸引子.利用MATLAB矩阵运算与图形绘制功能,实现离散数据点的分形插值拟合.试验结果表明.该算法具有简捷直观的特点. 相似文献
10.
11.
Web性能测试与预测 总被引：6，自引：0，他引：6
讨论了Web应用的性能测试方法和测试工具,并在一个Web应用的实例中给出了运用这些工具和方法的测试过程,以及对测试结果的分析.设计了一种基于转导推理的预测算法,基于有限的历史测试数据,对系统的性能进行预测,并取得了接近实测的预测效果.还根据测试结果简要分析了对Web应用性能进行优化的一般方法. 相似文献
12.
压缩感知理论是利用信号的稀疏性,采用重构算法通过少量的观测值就可以实现对该信号的精确重构。SL0（Smoothed l0）算法是基于l0范数的稀疏信号重构算法,通过控制参数逐步逼近最优解。针对平滑函数的选取问题,文章提出一种新的平滑函数序列近似l0范数,实现稀疏信号的精确重构。仿真结果表明,在相同实验条件下文章算法较传统算法有着较高的重构概率。 相似文献
13.
This paper presents a new method for the performance evaluation of bit decoding algorithms. The method is based on estimating the probability density function (pdf) of the bit log likelihood ratio (LLR) by using an exponential model. It is widely known that the pdf of the bit LLR is close to the normal density. The proposed approach takes advantage of this property to present an efficient algorithm for the pdf estimation. The moment matching method is combined with the maximum entropy principle to estimate the underlying parameters. We present a simple method for computing the probabilities of the point estimates for the estimated parameters, as well as for the bit error rate. The corresponding results are used to compute the number of samples that are required for a given precision of the estimated values. It is demonstrated that this method requires significantly fewer samples as compared to the conventional Monte-Carlo simulation. 相似文献
14.
《Information processing & management》2016,52(2):217-257
Transductive classification is a useful way to classify texts when labeled training examples are insufficient. Several algorithms to perform transductive classification considering text collections represented in a vector space model have been proposed. However, the use of these algorithms is unfeasible in practical applications due to the independence assumption among instances or terms and the drawbacks of these algorithms. Network-based algorithms come up to avoid the drawbacks of the algorithms based on vector space model and to improve transductive classification. Networks are mostly used for label propagation, in which some labeled objects propagate their labels to other objects through the network connections. Bipartite networks are useful to represent text collections as networks and perform label propagation. The generation of this type of network avoids requirements such as collections with hyperlinks or citations, computation of similarities among all texts in the collection, as well as the setup of a number of parameters. In a bipartite heterogeneous network, objects correspond to documents and terms, and the connections are given by the occurrences of terms in documents. The label propagation is performed from documents to terms and then from terms to documents iteratively. Nevertheless, instead of using terms just as means of label propagation, in this article we propose the use of the bipartite network structure to define the relevance scores of terms for classes through an optimization process and then propagate these relevance scores to define labels for unlabeled documents. The new document labels are used to redefine the relevance scores of terms which consequently redefine the labels of unlabeled documents in an iterative process. We demonstrated that the proposed approach surpasses the algorithms for transductive classification based on vector space model or networks. Moreover, we demonstrated that the proposed algorithm effectively makes use of unlabeled documents to improve classification and it is faster than other transductive algorithms. 相似文献
15.
16.
Tao Qin Xu-Dong Zhang Ming-Feng Tsai De-Sheng Wang Tie-Yan Liu Hang Li 《Information processing & management》2008
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since originally the methods were not developed for this task, their loss functions do not directly link to the criteria used in the evaluation of ranking. Specifically, the loss functions are defined on the level of documents or document pairs, in contrast to the fact that the evaluation criteria are defined on the level of queries. Therefore, minimizing the loss functions does not necessarily imply enhancing ranking performances. To solve this problem, we propose using query-level loss functions in learning of ranking functions. We discuss the basic properties that a query-level loss function should have and propose a query-level loss function based on the cosine similarity between a ranking list and the corresponding ground truth. We further design a coordinate descent algorithm, referred to as RankCosine, which utilizes the proposed loss function to create a generalized additive ranking model. We also discuss whether the loss functions of existing ranking algorithms can be extended to query-level. Experimental results on the datasets of TREC web track, OHSUMED, and a commercial web search engine show that with the use of the proposed query-level loss function we can significantly improve ranking accuracies. Furthermore, we found that it is difficult to extend the document-level loss functions to query-level loss functions. 相似文献
17.
Juha Karvanen 《Journal of The Franklin Institute》2004,341(5):401-418
This paper introduces blind separation methods that are based on minimization of mutual information. Direct minimization of mutual information leads to estimating functions that change on every iteration of separating algorithm unlike in the maximum likelihood approach employing fixed non-linearity. We propose objective functions for source separation that are comprised of a symmetric and an asymmetric part. This allows for separating signals that may have skewed distributions. The optimal weighting between the symmetric and the asymmetric part is determined from the data based on an efficacy measure. The performance of the proposed objective functions is studied in cases where some source signals may be asymmetrically distributed. The capability of adapting to different type of source distributions is demonstrated in simulations. 相似文献
18.
A. Sharifi M. Aliyari Shoorehdeli M. Teshnehlab 《Journal of The Franklin Institute》2012,349(1):162-183
Rotary kiln is the central and the most complex component of cement production process. It is used to convert calcineous raw meal into cement clinkers, which plays a key role in quality and quantity of the final produced cement. This system has complex nonlinear dynamic equations that have not been completely worked out yet. In conventional modeling procedure, a large number of the involved parameters are crossed out and an approximation model is presented instead. Therefore, the performance of the obtained model is very important and an inaccurate model may cause many problems for designing a controller. This study presents hierarchical wavelet TS-type fuzzy inference system (HWFIS) for identification of cement rotary kiln. In the proposed method, wavelet fuzzy inference system (WFIS) with two input variables is used as sub-model in a hierarchical structure and gradient descent (GD) algorithm is chosen for training parameters of antecedent and conclusion parts of sub-models. The results show that the proposed method has higher performance in comparison with the other models. The data collected from Saveh White Cement Company is used in our simulations. 相似文献
19.
Topic models are widely used for thematic structure discovery in text. But traditional topic models often require dedicated inference procedures for specific tasks at hand. Also, they are not designed to generate word-level semantic representations. To address the limitations, we propose a neural topic modeling approach based on the Generative Adversarial Nets (GANs), called Adversarial-neural Topic Model (ATM) in this paper. To our best knowledge, this work is the first attempt to use adversarial training for topic modeling. The proposed ATM models topics with dirichlet prior and employs a generator network to capture the semantic patterns among latent topics. Meanwhile, the generator could also produce word-level semantic representations. Besides, to illustrate the feasibility of porting ATM to tasks other than topic modeling, we apply ATM for open domain event extraction. To validate the effectiveness of the proposed ATM, two topic modeling benchmark corpora and an event dataset are employed in the experiments. Our experimental results on benchmark corpora show that ATM generates more coherence topics (considering five topic coherence measures), outperforming a number of competitive baselines. Moreover, the experiments on event dataset also validate that the proposed approach is able to extract meaningful events from news articles. 相似文献
20.
《Journal of The Franklin Institute》2022,359(8):3692-3716
This paper considers a nonsmooth constrained distributed convex optimization over multi-agent systems. Each agent in the multi-agent system only has access to the information of its objective function and constraint, and cooperatively minimizes the global objective function, which is composed of the sum of local objective functions. A novel continuous-time algorithm is proposed to solve the distributed optimization problem and effectively characterize the appropriate gain of the penalty function. It should be noted that the proposed algorithm is based on an adaptive strategy to avoid introducing the primal-dual variables and estimating the related exact penalty parameters. Additional, it is demonstrated that the state solution of the proposed algorithm achieves consensus and converges to an optimal solution of the optimization problem. Finally, numerical simulations are given and the proposed algorithm is applied to solve the optimal placement problem and energy consumption problem. 相似文献