In this article a recognition system of isolated sequences based on noise filtration by microphone array is described. The configuration of microphone array has an important issue for clarification of beamformer spatial filtration. Beamforming is a method for processing microphone array data to produce images that represent the distribution of the acoustic source strength. Recognition systems are based on classification systems pattern. In these systems, sounds or sequences of sounds, such as phonemes, groups of phonemes, or words are modeled by distinct classes. The goal of the recognition system is to estimate the correct sequence of classes, sounds, that make up the incoming utterance and hence, the sounds that were reproduced. In particular, many new distance measures between time series have been introduced. The recognition system based on time series analysis, where the Dynamic time warping algorithm based on spatial filtration preprocessing is discussed.
{"title":"Recognition System Based on DTW and DAS Beamforming","authors":"M. Papez, K. Vlcek","doi":"10.1109/MCSI.2015.49","DOIUrl":"https://doi.org/10.1109/MCSI.2015.49","url":null,"abstract":"In this article a recognition system of isolated sequences based on noise filtration by microphone array is described. The configuration of microphone array has an important issue for clarification of beamformer spatial filtration. Beamforming is a method for processing microphone array data to produce images that represent the distribution of the acoustic source strength. Recognition systems are based on classification systems pattern. In these systems, sounds or sequences of sounds, such as phonemes, groups of phonemes, or words are modeled by distinct classes. The goal of the recognition system is to estimate the correct sequence of classes, sounds, that make up the incoming utterance and hence, the sounds that were reproduced. In particular, many new distance measures between time series have been introduced. The recognition system based on time series analysis, where the Dynamic time warping algorithm based on spatial filtration preprocessing is discussed.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129789495","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}
We present different properties of weak linear spaces and subspaces. Some examples, comparative results and properties of a weak norm are also established.
给出了弱线性空间及其子空间的不同性质。给出了一个弱模的一些算例、比较结果和性质。
{"title":"Considerations on weak linear spaces","authors":"Dan-Mircea Bors, A. Croitoru, N. Mastorakis","doi":"10.1109/MCSI.2015.26","DOIUrl":"https://doi.org/10.1109/MCSI.2015.26","url":null,"abstract":"We present different properties of weak linear spaces and subspaces. Some examples, comparative results and properties of a weak norm are also established.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125270738","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}
Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.
{"title":"The Design of Permutation Codes via a Specialized Maximum Clique Algorithm","authors":"R. Montemanni, János Barta, Derek H. Smith","doi":"10.1109/MCSI.2015.54","DOIUrl":"https://doi.org/10.1109/MCSI.2015.54","url":null,"abstract":"Permutation codes have received considerable interest in recent years, motivated by some real-world applications. These applications take advantage of their robustness against transmission errors and noise. The problem addressed in this study is the construction of the largest possible permutation codes with a specified length and minimum Hamming distance. In this paper the problem is modelled in terms of maximum cliques and it is shown how a classic branch and bound method for maximum cliques can specialized for the design of permutation codes. This leads to a much faster technique. Experimental results support this claim.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121354932","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}
M. Louzazni, A. Craciunescu, E. Aroudam, A. Dumitrache
Due to the non-linearity, multivariable and multimodal features of current-voltage of solar cell models, the conventional methods are incapable to estimating the parameters of solar cell with high accuracy. Recently, the bio-inspired algorithms have attracted the attention. The firefly algorithm is nature-inspired stochastic optimization algorithm is among the most powerful algorithms in solving modern global optimization for nonlinear and complex system, based on the flashing patterns and behavior of fireflies swarm. In this paper, a firefly algorithm is proposed to extract the parameters of single diode model solar cell from experimental I-V characteristics. The results obtained by firefly algorithm are quite promising and outperform those found by the other methods.
{"title":"Identification of Solar Cell Parameters with Firefly Algorithm","authors":"M. Louzazni, A. Craciunescu, E. Aroudam, A. Dumitrache","doi":"10.1109/MCSI.2015.37","DOIUrl":"https://doi.org/10.1109/MCSI.2015.37","url":null,"abstract":"Due to the non-linearity, multivariable and multimodal features of current-voltage of solar cell models, the conventional methods are incapable to estimating the parameters of solar cell with high accuracy. Recently, the bio-inspired algorithms have attracted the attention. The firefly algorithm is nature-inspired stochastic optimization algorithm is among the most powerful algorithms in solving modern global optimization for nonlinear and complex system, based on the flashing patterns and behavior of fireflies swarm. In this paper, a firefly algorithm is proposed to extract the parameters of single diode model solar cell from experimental I-V characteristics. The results obtained by firefly algorithm are quite promising and outperform those found by the other methods.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"9 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133529256","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}
Computational methods derived from digital signal processing are playing a significant role in the security and copyrights of audio, video, and visual arts. In light of the quantum computing, the corresponding algorithms are becoming a new research direction in today's high-technology world. The nature of quantum computer guarantees the security of quantum data, so a safe and effective quantum watermarking algorithm is in demand. Quantum watermarking is the technique that embeds the invisible quantum signal into quantum multimedia data for copyright protection. Different from most traditional algorithms, we propose new algorithms which apply a quantum or a pseudo quantum watermarking in M-band wavelet domain. Assured by the Heisenberg uncertainty principle and quantum no-cloning theorem, the security of quantum watermark can reach a very high-level standard. In other words, these watermarking algorithms can defeat nearly all attackers, no matter using classical computer or quantum computer.
{"title":"M-Band Wavelet Based Pseudo Quantum Watermarking","authors":"Tong Liu, Xuan Xu, Xiaodi Wang","doi":"10.1109/MCSI.2015.41","DOIUrl":"https://doi.org/10.1109/MCSI.2015.41","url":null,"abstract":"Computational methods derived from digital signal processing are playing a significant role in the security and copyrights of audio, video, and visual arts. In light of the quantum computing, the corresponding algorithms are becoming a new research direction in today's high-technology world. The nature of quantum computer guarantees the security of quantum data, so a safe and effective quantum watermarking algorithm is in demand. Quantum watermarking is the technique that embeds the invisible quantum signal into quantum multimedia data for copyright protection. Different from most traditional algorithms, we propose new algorithms which apply a quantum or a pseudo quantum watermarking in M-band wavelet domain. Assured by the Heisenberg uncertainty principle and quantum no-cloning theorem, the security of quantum watermark can reach a very high-level standard. In other words, these watermarking algorithms can defeat nearly all attackers, no matter using classical computer or quantum computer.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129378579","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}
This paper proposed a multi-objective optimization model to calculate the optimum adding amount of alloy during the process of basic oxygen steelmaking (BOS). In this model, one objective is the total costs of the alloys, and another objective is the total error of element contents. In order to establish the second objective, an echo state network (ESN) is adopted to predict the element contents. A modified multi-objective particle swarm optimization algorithm which has a chaos random mutation operator with Gaussian function proportions, called GMOPSO, is proposed to solve the alloy addition multi-objective optimization problem. Simulation results on practical data of BOS show that the costs optimized are lower than the actual costs, and the error of the element contents meets the demand for the steel products.
{"title":"A Multi-objective Optimization Model for Alloy Addition in BOS Process Based on ESN and Modified MOPSO","authors":"Min Han, Yong-qin He, Jun Wang","doi":"10.1109/MCSI.2015.15","DOIUrl":"https://doi.org/10.1109/MCSI.2015.15","url":null,"abstract":"This paper proposed a multi-objective optimization model to calculate the optimum adding amount of alloy during the process of basic oxygen steelmaking (BOS). In this model, one objective is the total costs of the alloys, and another objective is the total error of element contents. In order to establish the second objective, an echo state network (ESN) is adopted to predict the element contents. A modified multi-objective particle swarm optimization algorithm which has a chaos random mutation operator with Gaussian function proportions, called GMOPSO, is proposed to solve the alloy addition multi-objective optimization problem. Simulation results on practical data of BOS show that the costs optimized are lower than the actual costs, and the error of the element contents meets the demand for the steel products.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124119768","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}
In this paper, we propose an approach to generate Virtual Geospatial Environments (VGE) using data provided by Geographic Information System (GIS). The resulting VGE provides a spatial representation of the real world for visualization and simulation purposes. Conventional VGE approaches are generally built upon a grid-based spatial representation, raising the well-known problems of the lack of accuracy of localized data and the difficulty to merge data with multiple semantics. Our approach overcomes these limits by using a precise spatial decomposition technique that relies on a graph-based topological model. Moreover, our approach integrates, merges, and propagates semantics associated with GIS data including when these later spatially overlap. We illustrate this model with an application which extracts geographic, topologic and semantic data from standard GIS files, and allows a user to navigate and retrieve information from the computed VGE.
{"title":"Integration of GIS Data for Visualization of Virtual Geospatial Environments","authors":"M. Mekni","doi":"10.1109/MCSI.2015.39","DOIUrl":"https://doi.org/10.1109/MCSI.2015.39","url":null,"abstract":"In this paper, we propose an approach to generate Virtual Geospatial Environments (VGE) using data provided by Geographic Information System (GIS). The resulting VGE provides a spatial representation of the real world for visualization and simulation purposes. Conventional VGE approaches are generally built upon a grid-based spatial representation, raising the well-known problems of the lack of accuracy of localized data and the difficulty to merge data with multiple semantics. Our approach overcomes these limits by using a precise spatial decomposition technique that relies on a graph-based topological model. Moreover, our approach integrates, merges, and propagates semantics associated with GIS data including when these later spatially overlap. We illustrate this model with an application which extracts geographic, topologic and semantic data from standard GIS files, and allows a user to navigate and retrieve information from the computed VGE.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129753878","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}
This paper proposes a Genetic Programming representation and algorithm that can be used for control system design. The proposed Genetic Programming algorithm named Block Diagram Oriented Genetic Programming BDOGP. The characteristics of the tree structure and the used genetic operations of the proposed algorithm are illustrated here in detail. A new numeric constant mutation operation is added to the algorithm to strengthen the search for optimal parameters of the BDOGP solutions. The proposed BDOGP is used as an automated method to synthesize the block diagram of a deadbeat controller for discrete control system. The important BDOGP steps and remarks, which perform the solution, are presented. The simulation results show that the comparison between the GP solution and the conventional state-space one indicates the validity and accuracy of the solution obtained by BDOGP.
{"title":"Design of a Discrete Deadbeat Controller Based on Block Diagram Oriented Genetic Programming","authors":"Rami A. Maher, M. J. Mohamed","doi":"10.1109/MCSI.2015.27","DOIUrl":"https://doi.org/10.1109/MCSI.2015.27","url":null,"abstract":"This paper proposes a Genetic Programming representation and algorithm that can be used for control system design. The proposed Genetic Programming algorithm named Block Diagram Oriented Genetic Programming BDOGP. The characteristics of the tree structure and the used genetic operations of the proposed algorithm are illustrated here in detail. A new numeric constant mutation operation is added to the algorithm to strengthen the search for optimal parameters of the BDOGP solutions. The proposed BDOGP is used as an automated method to synthesize the block diagram of a deadbeat controller for discrete control system. The important BDOGP steps and remarks, which perform the solution, are presented. The simulation results show that the comparison between the GP solution and the conventional state-space one indicates the validity and accuracy of the solution obtained by BDOGP.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128150026","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}
In order to meet the requirements of writing and reading data of rendering applications it need to provide a managed system of distributed data. In the existing management system such as HDFS, it provides a distributed file system of high fault tolerance and reliability for Hadoop. But it stores all the files in the disk and can not adapt to manage system of memory data. Memcache as the cache software of the web server is widely used because of its efficient speed of IO and sophisticated technologies of memory management. However the files stored in memcache are small files. Therefore it can't process big files well. Designed management system of memory data solves the problem of storage of big files efficiently by the use of shared memory pool. At the same time it also solves the problem of conflicts of data access by the use of double layer locked mechanism.
{"title":"Memory Data Management System for Rendering Applications","authors":"Ran Zheng, Qing Liu, Hai Jin","doi":"10.1109/MCSI.2015.42","DOIUrl":"https://doi.org/10.1109/MCSI.2015.42","url":null,"abstract":"In order to meet the requirements of writing and reading data of rendering applications it need to provide a managed system of distributed data. In the existing management system such as HDFS, it provides a distributed file system of high fault tolerance and reliability for Hadoop. But it stores all the files in the disk and can not adapt to manage system of memory data. Memcache as the cache software of the web server is widely used because of its efficient speed of IO and sophisticated technologies of memory management. However the files stored in memcache are small files. Therefore it can't process big files well. Designed management system of memory data solves the problem of storage of big files efficiently by the use of shared memory pool. At the same time it also solves the problem of conflicts of data access by the use of double layer locked mechanism.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121376220","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}
Hydrodynamics (inviscid fluid and irrotational flow) of rigid bodies with three mutually perpendicular plans of symmetry (orthotropic shapes) moving in confined media (wall, channel etc.) is analyzed by applying Lamé's functions and ellipsoidal harmonics. Towards this goal, a general numerical scheme for computing ellipsoidal harmonics of arbitrary order and degree is presented. In order to demonstrate the versatility of the method, which maybe is useful in many practical applications in mathematical physics, we chose to analytically address here the case of a tri-axial rigid ellipsoidal vessel moving steadily near a rigid wall or along the center of a two-dimensional channel. Free-surface effects are ignored and we are mainly interested in determining the dependence of the hydrodynamic added-mass coefficient and the asymmetric pressure (suction) force exerted on the body due to external flow disturbances such as nearby planar boundaries or flow producing mechanisms (singularities) simulating for example a propulsive system.
{"title":"Hydrodynamics of Orthotropic Shapes Utilizing Ellipsoidal Harmonics","authors":"I. Chatjigeorgiou, G. Dassios, T. Miloh","doi":"10.1109/MCSI.2015.36","DOIUrl":"https://doi.org/10.1109/MCSI.2015.36","url":null,"abstract":"Hydrodynamics (inviscid fluid and irrotational flow) of rigid bodies with three mutually perpendicular plans of symmetry (orthotropic shapes) moving in confined media (wall, channel etc.) is analyzed by applying Lamé's functions and ellipsoidal harmonics. Towards this goal, a general numerical scheme for computing ellipsoidal harmonics of arbitrary order and degree is presented. In order to demonstrate the versatility of the method, which maybe is useful in many practical applications in mathematical physics, we chose to analytically address here the case of a tri-axial rigid ellipsoidal vessel moving steadily near a rigid wall or along the center of a two-dimensional channel. Free-surface effects are ignored and we are mainly interested in determining the dependence of the hydrodynamic added-mass coefficient and the asymmetric pressure (suction) force exerted on the body due to external flow disturbances such as nearby planar boundaries or flow producing mechanisms (singularities) simulating for example a propulsive system.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133671405","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：