发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
From the slit-island method to the Ising model: Analysis of irregular grayscale objects 从裂岛法到伊辛模型:不规则灰度目标的分析
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2014-03-01 DOI: 10.2478/amcs-2014-0004
P. Mazurek, Dorota Oszutowska-Mazurek
{"title":"From the slit-island method to the Ising model: Analysis of irregular grayscale objects","authors":"P. Mazurek, Dorota Oszutowska-Mazurek","doi":"10.2478/amcs-2014-0004","DOIUrl":"https://doi.org/10.2478/amcs-2014-0004","url":null,"abstract":"Abstract The Slit Island Method (SIM) is a technique for the estimation of the fractal dimension of an object by determining the area- perimeter relations for successive slits. The SIM could be applied for image analysis of irregular grayscale objects and their classification using the fractal dimension. It is known that this technique is not functional in some cases. It is emphasized in this paper that for specific objects a negative or an infinite fractal dimension could be obtained. The transformation of the input image data from unipolar to bipolar gives a possibility of reformulated image analysis using the Ising model context. The polynomial approximation of the obtained area-perimeter curve allows object classification. The proposed technique is applied to the images of cervical cell nuclei (Papanicolaou smears) for the preclassification of the correct and atypical cells.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681141","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}
引用次数: 22
Cross-task code reuse in genetic programming applied to visual learning 遗传编程中跨任务代码重用在视觉学习中的应用
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2014-03-01 DOI: 10.2478/amcs-2014-0014
Wojciech Jaśkowski, K. Krawiec, Bartosz Wieloch
{"title":"Cross-task code reuse in genetic programming applied to visual learning","authors":"Wojciech Jaśkowski, K. Krawiec, Bartosz Wieloch","doi":"10.2478/amcs-2014-0014","DOIUrl":"https://doi.org/10.2478/amcs-2014-0014","url":null,"abstract":"Abstract We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic material from other evolutionary runs. In the experimental part, we compare the performance of the extended approach to the basic method on a real-world task of handwritten character recognition, and conclude that code reuse leads to better results in terms of fitness and recognition accuracy. Detailed analysis of the crossbred genetic material shows also that code reuse is most profitable when the recognized objects exhibit visual similarity.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131149389","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}
引用次数: 14
An efficient eigenspace updating scheme for high-dimensional systems 一种高效的高维系统特征空间更新方案
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2014-03-01 DOI: 10.2478/amcs-2014-0010
Simon Gangl, D. Mongus, B. Žalik
{"title":"An efficient eigenspace updating scheme for high-dimensional systems","authors":"Simon Gangl, D. Mongus, B. Žalik","doi":"10.2478/amcs-2014-0010","DOIUrl":"https://doi.org/10.2478/amcs-2014-0010","url":null,"abstract":"Abstract Systems based on principal component analysis have developed from exploratory data analysis in the past to current data processing applications which encode and decode vectors of data using a changing projection space (eigenspace). Linear systems, which need to be solved to obtain a constantly updated eigenspace, have increased significantly in their dimensions during this evolution. The basic scheme used for updating the eigenspace, however, has remained basically the same: (re)computing the eigenspace whenever the error exceeds a predefined threshold. In this paper we propose a computationally efficient eigenspace updating scheme, which specifically supports high-dimensional systems from any domain. The key principle is a prior selection of the vectors used to update the eigenspace in combination with an optimized eigenspace computation. The presented theoretical analysis proves the superior reconstruction capability of the introduced scheme, and further provides an estimate of the achievable compression ratios.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122862354","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 new lightweight method for security risk assessment based on fuzzy cognitive maps 一种基于模糊认知图的安全风险评估新方法
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2014-03-01 DOI: 10.2478/amcs-2014-0016
P. Szwed, Pawel Skrzynski
{"title":"A new lightweight method for security risk assessment based on fuzzy cognitive maps","authors":"P. Szwed, Pawel Skrzynski","doi":"10.2478/amcs-2014-0016","DOIUrl":"https://doi.org/10.2478/amcs-2014-0016","url":null,"abstract":"Abstract For contemporary software systems, security is considered to be a key quality factor and the analysis of IT security risk becomes an indispensable stage during software deployment. However, performing risk assessment according to methodologies and standards issued for the public sector or large institutions can be too costly and time consuming. Current business practice tends to circumvent risk assessment by defining sets of standard safeguards and applying them to all developed systems. This leads to a substantial gap: threats are not re-evaluated for particular systems and the selection of security functions is not based on risk models. This paper discusses a new lightweight risk assessment method aimed at filling this gap. In this proposal, Fuzzy Cognitive Maps (FCMs) are used to capture dependencies between assets, and FCM-based reasoning is performed to calculate risks. An application of the method is studied using an example of an e-health system providing remote telemonitoring, data storage and teleconsultation services. Lessons learned indicate that the proposed method is an efficient and low-cost approach, giving instantaneous feedback and enabling reasoning on the effectiveness of the security system.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132404322","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}
引用次数: 40
An algorithm for reducing the dimension and size of a sample for data exploration procedures 一种算法，用于减少数据探索程序中样本的维数和大小
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2014-03-01 DOI: 10.2478/amcs-2014-0011
P. Kulczycki, S. Lukasik
{"title":"An algorithm for reducing the dimension and size of a sample for data exploration procedures","authors":"P. Kulczycki, S. Lukasik","doi":"10.2478/amcs-2014-0011","DOIUrl":"https://doi.org/10.2478/amcs-2014-0011","url":null,"abstract":"Abstract The paper deals with the issue of reducing the dimension and size of a data set (random sample) for exploratory data analysis procedures. The concept of the algorithm investigated here is based on linear transformation to a space of a smaller dimension, while retaining as much as possible the same distances between particular elements. Elements of the transformation matrix are computed using the metaheuristics of parallel fast simulated annealing. Moreover, elimination of or a decrease in importance is performed on those data set elements which have undergone a significant change in location in relation to the others. The presented method can have universal application in a wide range of data exploration problems, offering flexible customization, possibility of use in a dynamic data environment, and comparable or better performance with regards to the principal component analysis. Its positive features were verified in detail for the domain’s fundamental tasks of clustering, classification and detection of atypical elements (outliers).","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124379577","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}
引用次数: 21
Minimum energy control of positive continuous-time linear systems with bounded inputs 输入有界正连续线性系统的最小能量控制
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0054
T. Kaczorek
{"title":"Minimum energy control of positive continuous-time linear systems with bounded inputs","authors":"T. Kaczorek","doi":"10.2478/amcs-2013-0054","DOIUrl":"https://doi.org/10.2478/amcs-2013-0054","url":null,"abstract":"Abstract The minimum energy control problem for positive continuous-time linear systems with bounded inputs is formulated and solved. Sufficient conditions for the existence of a solution to the problem are established. A procedure for solving the problem is proposed and illustrated with a numerical example.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"13 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":"124837028","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}
引用次数: 23
Graphics processing units in acceleration of bandwidth selection for kernel density estimation 图形处理单元在加速带宽选择核密度估计
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0065
W. Andrzejewski, A. Gramacki, J. Gramacki
{"title":"Graphics processing units in acceleration of bandwidth selection for kernel density estimation","authors":"W. Andrzejewski, A. Gramacki, J. Gramacki","doi":"10.2478/amcs-2013-0065","DOIUrl":"https://doi.org/10.2478/amcs-2013-0065","url":null,"abstract":"Abstract The Probability Density Function (PDF) is a key concept in statistics. Constructing the most adequate PDF from the observed data is still an important and interesting scientific problem, especially for large datasets. PDFs are often estimated using nonparametric data-driven methods. One of the most popular nonparametric method is the Kernel Density Estimator (KDE). However, a very serious drawback of using KDEs is the large number of calculations required to compute them, especially to find the optimal bandwidth parameter. In this paper we investigate the possibility of utilizing Graphics Processing Units (GPUs) to accelerate the finding of the bandwidth. The contribution of this paper is threefold: (a) we propose algorithmic optimization to one of bandwidth finding algorithms, (b) we propose efficient GPU versions of three bandwidth finding algorithms and (c) we experimentally compare three of our GPU implementations with the ones which utilize only CPUs. Our experiments show orders of magnitude improvements over CPU implementations of classical algorithms.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"18 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":"123732714","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}
引用次数: 20
On the dynamics of a vaccination model with multiple transmission ways 具有多种传播途径的疫苗接种模型动力学
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0057
Shu Liao, Weiming Yang
{"title":"On the dynamics of a vaccination model with multiple transmission ways","authors":"Shu Liao, Weiming Yang","doi":"10.2478/amcs-2013-0057","DOIUrl":"https://doi.org/10.2478/amcs-2013-0057","url":null,"abstract":"Abstract In this paper, we present a vaccination model with multiple transmission ways and derive the control reproduction number. The stability analysis of both the disease-free and endemic equilibria is carried out, and bifurcation theory is applied to explore a variety of dynamics of this model. In addition, we present numerical simulations to verify the model predictions. Mathematical results suggest that vaccination is helpful for disease control by decreasing the control reproduction number below unity.","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":"123957452","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}
引用次数: 10
Evolutionary optimization of interval mathematics-based design of a TSK fuzzy controller for anti-sway crane control 基于区间数学的TSK模糊控制器抗摇起重机控制的进化优化设计
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0056
J. Smoczek
{"title":"Evolutionary optimization of interval mathematics-based design of a TSK fuzzy controller for anti-sway crane control","authors":"J. Smoczek","doi":"10.2478/amcs-2013-0056","DOIUrl":"https://doi.org/10.2478/amcs-2013-0056","url":null,"abstract":"Abstract A hybrid method combining an evolutionary search strategy, interval mathematics and pole assignment-based closed-loop control synthesis is proposed to design a robust TSK fuzzy controller. The design objective is to minimize the number of linear controllers associated with rule conclusions and tune the triangular-shaped membership function parameters of a fuzzy controller to satisfy stability and desired dynamic performances in the presence of system parameter variation. The robust performance objective function is derived based on an interval Diophantine equation. Thus, the objective of a fuzzy logic-based control scheme is to place all the closed-loop control system characteristic polynomial coefficients within desired intervals. The reproduction process in the proposed Evolutionary Algorithm (EA) is based on the arithmetical crossover, uniform and non-uniform mutation along with gene deletion/insertion mutation ensuring a diversity of genomes sizes, as well as a diversity in the parameter space of membership functions. The proposed algorithm was implemented to design a fuzzy logic-based anti-sway crane control system taking into consideration the rope length and the mass of a payload variation. The results of experiments conducted using the EA for different conditions assumed for system parameter intervals and desired closed-loop system performances are compared with results achieved using the iterative procedure which is also described in the paper.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"25 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":"125131020","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}
引用次数: 18
Evolutionary algorithms and fuzzy sets for discovering temporal rules 时间规则发现的进化算法和模糊集
International Journal of Applied Mathematics and Computer Sciences Pub Date : 2013-12-01 DOI: 10.2478/amcs-2013-0064
Stephen G. Matthews, M. Gongora, A. Hopgood
{"title":"Evolutionary algorithms and fuzzy sets for discovering temporal rules","authors":"Stephen G. Matthews, M. Gongora, A. Hopgood","doi":"10.2478/amcs-2013-0064","DOIUrl":"https://doi.org/10.2478/amcs-2013-0064","url":null,"abstract":"Abstract A novel method is presented for mining fuzzy association rules that have a temporal pattern. Our proposed method contributes towards discovering temporal patterns that could otherwise be lost from defining the membership functions before the mining process. The novelty of this research lies in exploring the composition of fuzzy and temporal association rules, and using a multi-objective evolutionary algorithm combined with iterative rule learning to mine many rules. Temporal patterns are augmented into a dataset to analyse the method’s ability in a controlled experiment. It is shown that the method is capable of discovering temporal patterns, and the effect of Boolean itemset support on the efficacy of discovering temporal fuzzy association rules is presented.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"17 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":"127913416","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}
引用次数: 13
首页 上一页 下一页 尾页
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学术官方微信