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

2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)最新文献

筛选
英文 中文
Using the Committee Machine Method to Forecasting on the FOREX 使用委员会机器方法预测外汇
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.59
O. Nikonov, M. Medvedeva, F. Chernavin
{"title":"Using the Committee Machine Method to Forecasting on the FOREX","authors":"O. Nikonov, M. Medvedeva, F. Chernavin","doi":"10.1109/MCSI.2015.59","DOIUrl":"https://doi.org/10.1109/MCSI.2015.59","url":null,"abstract":"In the paper we consider a particular case of a neural network - a committee method. The described approach was first introduced in the paper by Ablow, C. M. and Kaylor, D. J [1]. Then further development of the committee machine methods have been carried out by Yekaterinburg pattern recognition school in the Institute of Mathematics and Mechanics, Russian Academy of Sciences. Nowadays theory of committee machine structures is based on results of Mazurov, Vl. D. and Hachay M. Yu. [2],[3]. In the presentation we describe the generalized p-committee construction and its application to the simplest case with two possible solutions: the course of one currency to another either grows, or falls. The problem of forecasting EUR/USD exchange rate on FOREX is studied by committee machine methods. Objective is to determine a direction of the course in 10 min. interval range. Another issues related to committee methods are considered in the paper [4].","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":"128702198","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}
引用次数: 7
A Secure and Auditable Cryptographic-Based e-Voting Scheme 一个安全且可审计的基于密码学的电子投票方案
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.16
M. Mursi, G. Assassa, A. Abdelhafez, Kareem M. AboSamra
{"title":"A Secure and Auditable Cryptographic-Based e-Voting Scheme","authors":"M. Mursi, G. Assassa, A. Abdelhafez, Kareem M. AboSamra","doi":"10.1109/MCSI.2015.16","DOIUrl":"https://doi.org/10.1109/MCSI.2015.16","url":null,"abstract":"A new cryptographic electronic voting scheme based on public key cryptosystem is proposed. The new scheme is proposed to replace the conventional voting methods that are widely used in most developing countries such as Egypt. The proposed e-voting scheme is based on the concept of Prêt à Voter, a paper ballot e-voting scheme. The proposed scheme uses paper ballots, due to its familiarity among the public, but with strong encryption protocols that provides enhanced level of ballot secrecy, verifiability and voter privacy. The proposed e-voting scheme eliminates the need for anonymous channels to anonymize the votes in Mixnet based schemes, yet provides the same level of security and anonymity but with less system complexity. For Egypt case, it is concluded that the replacement of paper-based voting by cryptographic electronic voting to conduct large scale elections is feasible.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"41 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":"123416311","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}
引用次数: 7
A Unified Approach to Use of Coprocessors of Various Types for Solving Global Optimization Problems 使用不同类型协处理器求解全局优化问题的统一方法
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.18
V. Gergel
{"title":"A Unified Approach to Use of Coprocessors of Various Types for Solving Global Optimization Problems","authors":"V. Gergel","doi":"10.1109/MCSI.2015.18","DOIUrl":"https://doi.org/10.1109/MCSI.2015.18","url":null,"abstract":"The paper offers a unified approach to use of accelerators of various types by the example of parallel global search algorithms. In the developed general scheme, the implementation elements depending on specific types of accelerators are encapsulated in a limited number of procedures, which allows to largely reduce expenses and time for software development. The offered scheme was tested on Intel Xeon Phi accelerators and general purpose GPUs. Speedup of the global optimization algorithm using accelerators compared to using CPU only is experimentally confirmed. Computational experiments are carried out using a set of a several hundred of multidimensional multiextremal problems.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"52 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":"125688378","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}
引用次数: 12
Computation of Periodic Solutions in Differential Systems of First Order 一阶微分系统周期解的计算
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.25
J. F. Navarro
{"title":"Computation of Periodic Solutions in Differential Systems of First Order","authors":"J. F. Navarro","doi":"10.1109/MCSI.2015.25","DOIUrl":"https://doi.org/10.1109/MCSI.2015.25","url":null,"abstract":"The aim of this work is to present a new symbolic computation tool as well as a symbolic algorithm to compute periodic solutions in systems of differential equations of first order via an adaptation of the Poincaré - Lindstedt technique.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"27 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":"123942021","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
Recognition System Based on DTW and DAS Beamforming 基于DTW和DAS波束形成的识别系统
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.49
M. Papez, K. Vlcek
{"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}
引用次数: 0
Considerations on weak linear spaces 关于弱线性空间的若干考虑
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.26
Dan-Mircea Bors, A. Croitoru, N. Mastorakis
{"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}
引用次数: 0
The Design of Permutation Codes via a Specialized Maximum Clique Algorithm 基于专用最大团算法的排列码设计
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.54
R. Montemanni, János Barta, Derek H. Smith
{"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}
引用次数: 7
Identification of Solar Cell Parameters with Firefly Algorithm 用萤火虫算法辨识太阳能电池参数
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.37
M. Louzazni, A. Craciunescu, E. Aroudam, A. Dumitrache
{"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}
引用次数: 12
M-Band Wavelet Based Pseudo Quantum Watermarking 基于m波段小波的伪量子水印
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.41
Tong Liu, Xuan Xu, Xiaodi Wang
{"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}
引用次数: 4
A Multi-objective Optimization Model for Alloy Addition in BOS Process Based on ESN and Modified MOPSO 基于回声状态网络和改进MOPSO的BOS工艺合金添加多目标优化模型
2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI) Pub Date : 2015-08-17 DOI: 10.1109/MCSI.2015.15
Min Han, Yong-qin He, Jun Wang
{"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}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信