International Journal of Applied Mathematics and Computer Sciences最新文献

筛选
英文 中文
Robust observer design for Sugeno systems with incremental quadratic nonlinearity in the consequent 带增量二次非线性的Sugeno系统鲁棒观测器设计
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0053
H. Moodi, M. Farrokhi
{"title":"Robust observer design for Sugeno systems with incremental quadratic nonlinearity in the consequent","authors":"H. Moodi, M. Farrokhi","doi":"10.2478/amcs-2013-0053","DOIUrl":"https://doi.org/10.2478/amcs-2013-0053","url":null,"abstract":"Abstract This paper is concerned with observer design for nonlinear systems that are modeled by T-S fuzzy systems containing parametric and nonparametric uncertainties. Unlike most Sugeno models, the proposed method contains nonlinear functions in the consequent part of the fuzzy IF-THEN rules. This will allow modeling a wider class of systems with smaller modeling errors. The consequent part of each rule contains a linear part plus a nonlinear term, which has an incremental quadratic constraint. This constraint relaxes the conservativeness introduced by other regular constraints for nonlinearities such as the Lipschitz conditions. To further reduce the conservativeness, a nonlinear injection term is added to the observer dynamics. Simulation examples show the effectiveness of the proposed method compared with the existing techniques reported in well-established journals.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131966843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Application of the partitioning method to specific Toeplitz matrices 分划方法在特定Toeplitz矩阵中的应用
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0061
P. Stanimirović, M. Miladinovic, I. Stojanovic, S. Miljkovic
{"title":"Application of the partitioning method to specific Toeplitz matrices","authors":"P. Stanimirović, M. Miladinovic, I. Stojanovic, S. Miljkovic","doi":"10.2478/amcs-2013-0061","DOIUrl":"https://doi.org/10.2478/amcs-2013-0061","url":null,"abstract":"Abstract We propose an adaptation of the partitioning method for determination of theMoore-Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method is a significant reduction in the computational time required to calculate the Moore-Penrose inverse of specific Toeplitz matrices of an arbitrary size. The method is implemented in MATLAB, and illustrative examples are presented.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121929042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A method of constructing the frame of a directed graph 构造有向图框架的一种方法
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0062
Ichiro Hofuku, K. Oshima
{"title":"A method of constructing the frame of a directed graph","authors":"Ichiro Hofuku, K. Oshima","doi":"10.2478/amcs-2013-0062","DOIUrl":"https://doi.org/10.2478/amcs-2013-0062","url":null,"abstract":"Abstract In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The WorldWideWeb can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125188104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A verified method for solving piecewise smooth initial value problems 一种求解分段光滑初值问题的验证方法
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0055
E. Auer, S. Kiel, A. Rauh
{"title":"A verified method for solving piecewise smooth initial value problems","authors":"E. Auer, S. Kiel, A. Rauh","doi":"10.2478/amcs-2013-0055","DOIUrl":"https://doi.org/10.2478/amcs-2013-0055","url":null,"abstract":"Abstract In many applications, there is a need to choose mathematical models that depend on non-smooth functions. The task of simulation becomes especially difficult if such functions appear on the right-hand side of an initial value problem. Moreover, solution processes from usual numerics are sensitive to roundoff errors so that verified analysis might be more useful if a guarantee of correctness is required or if the system model is influenced by uncertainty. In this paper, we provide a short overview of possibilities to formulate non-smooth problems and point out connections between the traditional non-smooth theory and interval analysis. Moreover, we summarize already existing verified methods for solving initial value problems with non-smooth (in fact, even not absolutely continuous) right-hand sides and propose a way of handling a certain practically relevant subclass of such systems. We implement the approach for the solver VALENCIA-IVP by introducing into it a specialized template for enclosing the first-order derivatives of non-smooth functions. We demonstrate the applicability of our technique using a mechanical system model with friction and hysteresis. We conclude the paper by giving a perspective on future research directions in this area.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122231987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A practical application of kernel-based fuzzy discriminant analysis 基于核的模糊判别分析的实际应用
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0066
Jianqiang Gao, L. Fan, Li Li, Lizhong Xu
{"title":"A practical application of kernel-based fuzzy discriminant analysis","authors":"Jianqiang Gao, L. Fan, Li Li, Lizhong Xu","doi":"10.2478/amcs-2013-0066","DOIUrl":"https://doi.org/10.2478/amcs-2013-0066","url":null,"abstract":"Abstract A novel method for feature extraction and recognition called Kernel Fuzzy Discriminant Analysis (KFDA) is proposed in this paper to deal with recognition problems, e.g., for images. The KFDA method is obtained by combining the advantages of fuzzy methods and a kernel trick. Based on the orthogonal-triangular decomposition of a matrix and Singular Value Decomposition (SVD), two different variants, KFDA/QR and KFDA/SVD, of KFDA are obtained. In the proposed method, the membership degree is incorporated into the definition of between-class and within-class scatter matrices to get fuzzy between-class and within-class scatter matrices. The membership degree is obtained by combining the measures of features of samples data. In addition, the effects of employing different measures is investigated from a pure mathematical point of view, and the t-test statistical method is used for comparing the robustness of the learning algorithm. Experimental results on ORL and FERET face databases show that KFDA/QR and KFDA/SVD are more effective and feasible than Fuzzy Discriminant Analysis (FDA) and Kernel Discriminant Analysis (KDA) in terms of the mean correct recognition rate.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Learning the naive Bayes classifier with optimization models 学习朴素贝叶斯分类器的优化模型
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0059
S. Taheri, M. Mammadov
{"title":"Learning the naive Bayes classifier with optimization models","authors":"S. Taheri, M. Mammadov","doi":"10.2478/amcs-2013-0059","DOIUrl":"https://doi.org/10.2478/amcs-2013-0059","url":null,"abstract":"Abstract Naive Bayes is among the simplest probabilistic classifiers. It often performs surprisingly well in many real world applications, despite the strong assumption that all features are conditionally independent given the class. In the learning process of this classifier with the known structure, class probabilities and conditional probabilities are calculated using training data, and then values of these probabilities are used to classify new observations. In this paper, we introduce three novel optimization models for the naive Bayes classifier where both class probabilities and conditional probabilities are considered as variables. The values of these variables are found by solving the corresponding optimization problems. Numerical experiments are conducted on several real world binary classification data sets, where continuous features are discretized by applying three different methods. The performances of these models are compared with the naive Bayes classifier, tree augmented naive Bayes, the SVM, C4.5 and the nearest neighbor classifier. The obtained results demonstrate that the proposed models can significantly improve the performance of the naive Bayes classifier, yet at the same time maintain its simple structure.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132725469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 116
Comparison of speaker dependent and speaker independent emotion recognition 依赖说话人与独立说话人情绪识别的比较
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0060
John S. Rybka, A. Janicki
{"title":"Comparison of speaker dependent and speaker independent emotion recognition","authors":"John S. Rybka, A. Janicki","doi":"10.2478/amcs-2013-0060","DOIUrl":"https://doi.org/10.2478/amcs-2013-0060","url":null,"abstract":"Abstract This paper describes a study of emotion recognition based on speech analysis. The introduction to the theory contains a review of emotion inventories used in various studies of emotion recognition as well as the speech corpora applied, methods of speech parametrization, and the most commonly employed classification algorithms. In the current study the EMO-DB speech corpus and three selected classifiers, the k-Nearest Neighbor (k-NN), the Artificial Neural Network (ANN) and Support Vector Machines (SVMs), were used in experiments. SVMs turned out to provide the best classification accuracy of 75.44% in the speaker dependent mode, that is, when speech samples from the same speaker were included in the training corpus. Various speaker dependent and speaker independent configurations were analyzed and compared. Emotion recognition in speaker dependent conditions usually yielded higher accuracy results than a similar but speaker independent configuration. The improvement was especially well observed if the base recognition ratio of a given speaker was low. Happiness and anger, as well as boredom and neutrality, proved to be the pairs of emotions most often confused.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131021251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Exact boundary controllability of coupled hyperbolic equations 耦合双曲型方程的精确边界可控性
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0052
S. Avdonin, A. C. Rivero, L. Teresa
{"title":"Exact boundary controllability of coupled hyperbolic equations","authors":"S. Avdonin, A. C. Rivero, L. Teresa","doi":"10.2478/amcs-2013-0052","DOIUrl":"https://doi.org/10.2478/amcs-2013-0052","url":null,"abstract":"Abstract We study the exact boundary controllability of two coupled one dimensional wave equations with a control acting only in one equation. The problem is transformed into a moment problem. This framework has been used in control theory of distributed parameter systems since the classical works of A.G. Butkovsky, H.O. Fattorini and D.L. Russell in the late 1960s to the early 1970s. We use recent results on the Riesz basis property of exponential divided differences.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127816872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Cooperative driving at isolated intersections based on the optimal minimization of the maximum exit time 基于最大出口时间最优最小化的孤立交叉口协同驾驶
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0058
Jia Wu, A. Abbas-Turki, Florent Perronnet
{"title":"Cooperative driving at isolated intersections based on the optimal minimization of the maximum exit time","authors":"Jia Wu, A. Abbas-Turki, Florent Perronnet","doi":"10.2478/amcs-2013-0058","DOIUrl":"https://doi.org/10.2478/amcs-2013-0058","url":null,"abstract":"Abstract Traditional traffic control systems based on traffic light have achieved a great success in reducing the average delay of vehicles or in improving the traffic capacity. The main idea of these systems is based on the optimization of the cycle time, the phase sequence, and the phase duration. The right-of-ways are assigned to vehicles of one or several movements for a specific time. With the emergence of cooperative driving, an innovative traffic control concept, Autonomous Intersection Management (AIM), has emerged. In the framework of AIM, the right-of-way is customized on the measurement of the vehicle state and the traffic control turns to determine the passing sequence of vehicles. Since each vehicle is considered individually, AIM faces a combinatorial optimization problem. This paper proposes a dynamic programming algorithm to find its optimal solution in polynomial time. Experimental results obtained by simulation show that the proper arrangement of the vehicle passing sequence can greatly improve traffic efficiency at intersections.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130163068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Using a graph grammar system in the finite element method 在有限元法中使用图语法系统
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0063
B. Strug, A. Paszyńska, M. Paszyński, E. Grabska
{"title":"Using a graph grammar system in the finite element method","authors":"B. Strug, A. Paszyńska, M. Paszyński, E. Grabska","doi":"10.2478/amcs-2013-0063","DOIUrl":"https://doi.org/10.2478/amcs-2013-0063","url":null,"abstract":"Abstract The paper presents a system of Composite Graph Grammars (CGGs)modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values to element nodes and perform h- and p-adaptations. The CGG system is illustrated with an example from the domain of geophysics.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126770331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信