This paper is focused to the designing, implementing and benchmarking the data cluster based on the CEPH [1] technology. The main point of this paper is aimed to the implementation with geographically separated nodes. These nodes, store points of distributed data cluster, is in different location and on different subnets. Realized test show the dependency of number of concurrent clients connected to the cluster and cluster read/write bandwidth. These test show the potential limits of the developed solution.
{"title":"The Performance of the Data-Cluster Based on the CEPH Platform with Geographically Separated Nodes","authors":"David Malaník, Roman Jaek","doi":"10.1109/MCSI.2014.16","DOIUrl":"https://doi.org/10.1109/MCSI.2014.16","url":null,"abstract":"This paper is focused to the designing, implementing and benchmarking the data cluster based on the CEPH [1] technology. The main point of this paper is aimed to the implementation with geographically separated nodes. These nodes, store points of distributed data cluster, is in different location and on different subnets. Realized test show the dependency of number of concurrent clients connected to the cluster and cluster read/write bandwidth. These test show the potential limits of the developed solution.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116232519","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 our a previous work we have dealt with the generating function construction for representing the general term of a sequence as a moment like integral where a generating function takes the role of a weight function. We have assumed therein that the each pair of sequence elements satisfy a first order homogeneous linear recursion with variant coefficients. Then we have tried to construct ODE (s) whose solutions under appropriate boundary conditions give the generating function uniquely if the recursion is accompanied by an appropriate initial condition. We could have been able to achieve the goal and discussed the solutions and their behaviors in certain level of details. This work aims almost the same thing as the previous work but this time not via an ODE, instead, an integral equation.
{"title":"Fine Tuning Points of Generating Function Construction in Integral Form for Linear Recursions","authors":"Bahar Yolcu, M. Demiralp","doi":"10.1109/MCSI.2014.31","DOIUrl":"https://doi.org/10.1109/MCSI.2014.31","url":null,"abstract":"In our a previous work we have dealt with the generating function construction for representing the general term of a sequence as a moment like integral where a generating function takes the role of a weight function. We have assumed therein that the each pair of sequence elements satisfy a first order homogeneous linear recursion with variant coefficients. Then we have tried to construct ODE (s) whose solutions under appropriate boundary conditions give the generating function uniquely if the recursion is accompanied by an appropriate initial condition. We could have been able to achieve the goal and discussed the solutions and their behaviors in certain level of details. This work aims almost the same thing as the previous work but this time not via an ODE, instead, an integral equation.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809230","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}
The requirements for production and learning process quality are different in various manufacturing, business and educational organizations. A new approach to fit these requirements and evaluate the closeness of realistic (actual) quality of production or learning processes (based on quality indicators of output or scores of examination tests) is proposed in the paper. The technique uses the strictly defined approximation procedures and allows users automatically evaluate of closeness of actual quality level when changing quality requirements.
{"title":"On One Approach to Evaluation of Quality Level in Manufacturing, Business and Education","authors":"Ahmet Demir, I. Rodonaia, Irina Milnikova","doi":"10.1109/MCSI.2014.10","DOIUrl":"https://doi.org/10.1109/MCSI.2014.10","url":null,"abstract":"The requirements for production and learning process quality are different in various manufacturing, business and educational organizations. A new approach to fit these requirements and evaluate the closeness of realistic (actual) quality of production or learning processes (based on quality indicators of output or scores of examination tests) is proposed in the paper. The technique uses the strictly defined approximation procedures and allows users automatically evaluate of closeness of actual quality level when changing quality requirements.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115050719","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 the field of agent communications uncertainty and vagueness in the message content and in the achievable results play a primordial role when two agents (human or artificial) communicate. Even though the importance of vagueness and uncertainty has been recognized long ago, only recently mechanisms related to the communications' semantics that allow a practical approach have been designed; more specifically, the development of tools such as agent programming languages and frameworks, which is a field of intensive research. On the other hand, recent theoretical ideas, drawn from situation semantics theory and the works of Sutton on semantic information, support this work. This paper applies these ideas to the field of multi-agent systems (MAS) and sketches how one can reduce the impact of vagueness and uncertainty present in the communication between software agents by means of context information, collaboration and basic reinforcement learning using a language designed for agent communication: the Sematic Agent Programming Language (S-APL).
{"title":"Use of a Semantic Language to Reduce the Indeterminacy in Agents Communication","authors":"Horacio Paggi, Michael Cochez","doi":"10.1109/MCSI.2014.64","DOIUrl":"https://doi.org/10.1109/MCSI.2014.64","url":null,"abstract":"In the field of agent communications uncertainty and vagueness in the message content and in the achievable results play a primordial role when two agents (human or artificial) communicate. Even though the importance of vagueness and uncertainty has been recognized long ago, only recently mechanisms related to the communications' semantics that allow a practical approach have been designed; more specifically, the development of tools such as agent programming languages and frameworks, which is a field of intensive research. On the other hand, recent theoretical ideas, drawn from situation semantics theory and the works of Sutton on semantic information, support this work. This paper applies these ideas to the field of multi-agent systems (MAS) and sketches how one can reduce the impact of vagueness and uncertainty present in the communication between software agents by means of context information, collaboration and basic reinforcement learning using a language designed for agent communication: the Sematic Agent Programming Language (S-APL).","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123652184","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}
Short Tandem Repeats (STRs) in DNA sequences are associated with regulatory mechanisms. Existing tools for recognizing STRs, involve computational intensive string processing methods expecting parameters like pattern, pattern size or reference. This paper proposes ab initio, signal processing approach involving Wavelet Transformations, for detecting perfect, imperfect and interrupted STR regions.
{"title":"Recognizing Short Tandem Repeat Regions in Genomic Sequences Using Wavelet","authors":"Mamta C. Padole","doi":"10.1109/MCSI.2014.50","DOIUrl":"https://doi.org/10.1109/MCSI.2014.50","url":null,"abstract":"Short Tandem Repeats (STRs) in DNA sequences are associated with regulatory mechanisms. Existing tools for recognizing STRs, involve computational intensive string processing methods expecting parameters like pattern, pattern size or reference. This paper proposes ab initio, signal processing approach involving Wavelet Transformations, for detecting perfect, imperfect and interrupted STR regions.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125195074","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 work focuses on the folding and rank issues for the denumerable infinite vector foldings to denumerable semi infinite matrices. The vector to be folded is assumed to have denumerably infinite number of elements while the produced matrix is assumed to be composed of a finite number of rows and denumerably infinite number of columns as we have done in some other works of us. The vector folding operation locates the elements of the given vector to the available positions of the target matrix. However, this action is not unique and different patterns for the element locating procedure can be used to get different resulting matrices whose ranks may differ from case to case. This work involves certain discussions about the pattern definitions via element permutations and their effects on the resulting matrix rank.
{"title":"Relations between the Permutations and the Matrix Norm in Denumerable Infinite Vector Folding to Semi-denumerable Infinite Matrices","authors":"M. Demiralp","doi":"10.1109/MCSI.2014.32","DOIUrl":"https://doi.org/10.1109/MCSI.2014.32","url":null,"abstract":"This work focuses on the folding and rank issues for the denumerable infinite vector foldings to denumerable semi infinite matrices. The vector to be folded is assumed to have denumerably infinite number of elements while the produced matrix is assumed to be composed of a finite number of rows and denumerably infinite number of columns as we have done in some other works of us. The vector folding operation locates the elements of the given vector to the available positions of the target matrix. However, this action is not unique and different patterns for the element locating procedure can be used to get different resulting matrices whose ranks may differ from case to case. This work involves certain discussions about the pattern definitions via element permutations and their effects on the resulting matrix rank.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478478","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}
There is an increasing demand for indoor navigation and localization systems along with increasing popularity of location based services in last years. The paper presents our work in progress for locating indoor objects based on signal fusion. The location is based on two signals: RSSI (Received Signal Strength Indication) and video camera. This paper presents a vision-based system for human detection and tracking in indoor environment using a single static camera. However its accuracy depends on calibration methods and additional sensors. Most of related works used very complex approach of calibration. In this paper actual position is calculated by simple algorithm with fast computing time.
{"title":"Indoor Location and Idetification of Objects with Video Survillance System and WiFi Module","authors":"D. Grzechca, Tomasz Wrobel, Patryk Bielecki","doi":"10.1109/MCSI.2014.52","DOIUrl":"https://doi.org/10.1109/MCSI.2014.52","url":null,"abstract":"There is an increasing demand for indoor navigation and localization systems along with increasing popularity of location based services in last years. The paper presents our work in progress for locating indoor objects based on signal fusion. The location is based on two signals: RSSI (Received Signal Strength Indication) and video camera. This paper presents a vision-based system for human detection and tracking in indoor environment using a single static camera. However its accuracy depends on calibration methods and additional sensors. Most of related works used very complex approach of calibration. In this paper actual position is calculated by simple algorithm with fast computing time.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131013025","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}
Milan Schomig, David Neuhauser, Ralf Seidler, H. M. Bucker
In the design of fast arithmetic circuits, the two's complement number representation can be alternatively replaced by a signed digit number representation. Compared to standard full adders used in two's complement arithmetic, signed digit adder cells offer the potential for improved performance. Designing an efficient signed digit adder cell leads to the problem of analyzing 2 to the power of 44 truth tables originating from different signed digit encodings. Since different digit encodings can produce identical truth tables, it is favorable to reduce this large number of truth tables by identifying identical ones. We introduce a novel approach for the solution of this problem using the MapReduce programming model. We take a step towards solving this problem using three different implementations of MapReduce (Hadoop, Disco, and MR-MPI) and compare their performance on an Opteron-based cluster using up to 64 physical cores.
{"title":"Benchmarking Different MapReduce Implementations for Computer-Aided Hardware Development","authors":"Milan Schomig, David Neuhauser, Ralf Seidler, H. M. Bucker","doi":"10.1109/MCSI.2014.57","DOIUrl":"https://doi.org/10.1109/MCSI.2014.57","url":null,"abstract":"In the design of fast arithmetic circuits, the two's complement number representation can be alternatively replaced by a signed digit number representation. Compared to standard full adders used in two's complement arithmetic, signed digit adder cells offer the potential for improved performance. Designing an efficient signed digit adder cell leads to the problem of analyzing 2 to the power of 44 truth tables originating from different signed digit encodings. Since different digit encodings can produce identical truth tables, it is favorable to reduce this large number of truth tables by identifying identical ones. We introduce a novel approach for the solution of this problem using the MapReduce programming model. We take a step towards solving this problem using three different implementations of MapReduce (Hadoop, Disco, and MR-MPI) and compare their performance on an Opteron-based cluster using up to 64 physical cores.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122247644","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 work presents an application of the artificial neural networks (ANN) in the prediction of the time series of the weekly wholesales of bottled propane gas (13 kg. Bottles). For this purpose several networks with different topologies were built. In order to reduce the error of the predictions, many schemas of ensembles were applied. Additionally, given the scarce data available, it was mandatory to minimize the input dimensionality of the networks and to do this, with a rational and systematic approach, considerations about stochastic dynamical systems were made and the Deyle and Sugihara's theorems for nonlinear state space reconstruction as long the generalizations of the Takens-Mañé's theorem for non-deterministic systems were used.
{"title":"A Neural Networks Based Model for the Prediction of the Bottled Propane Gas Sales","authors":"Horacio Paggi, F. Robledo","doi":"10.1109/MCSI.2014.56","DOIUrl":"https://doi.org/10.1109/MCSI.2014.56","url":null,"abstract":"This work presents an application of the artificial neural networks (ANN) in the prediction of the time series of the weekly wholesales of bottled propane gas (13 kg. Bottles). For this purpose several networks with different topologies were built. In order to reduce the error of the predictions, many schemas of ensembles were applied. Additionally, given the scarce data available, it was mandatory to minimize the input dimensionality of the networks and to do this, with a rational and systematic approach, considerations about stochastic dynamical systems were made and the Deyle and Sugihara's theorems for nonlinear state space reconstruction as long the generalizations of the Takens-Mañé's theorem for non-deterministic systems were used.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123749993","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 provides a way of skin detection in outdoor image based on multiple color space. The clustering is good in the color space YCgCr. Firstly, skin colors are projected in the color space CgCr and the fitting of distribution is carried through in order to wipe off a part of non skin color and gain the intersected image as the result of the first detection. Experimental results indicate that this fitting of distribution can have a good effect on reducing a mass of processing pixels of non skin color. Secondly, skin colors extracted in the first detection are projected in the color space GB in order to further wipe off part of the remaining non skin colors that are not reduced in the first detection by the fitting of distribution. Lastly, the relationships among the three components of every pixel of skin colors and non skin colors in the color space HSL are observed and the percentage of pixels corresponding to a certain relationship is calculated, so part of the non skin color can be further reduced based on the differences we find according to the observed relationship. Experimental results indicate that this algorithm has a good recognition effect and small amount of computation, it can be used in skin color detection in simple environment.
{"title":"Skin Color Analysis and Segmentation in Complex Outdoor Background","authors":"Hui Zhu, N. Mastorakis, X. Zhuang","doi":"10.1109/MCSI.2014.37","DOIUrl":"https://doi.org/10.1109/MCSI.2014.37","url":null,"abstract":"This paper provides a way of skin detection in outdoor image based on multiple color space. The clustering is good in the color space YCgCr. Firstly, skin colors are projected in the color space CgCr and the fitting of distribution is carried through in order to wipe off a part of non skin color and gain the intersected image as the result of the first detection. Experimental results indicate that this fitting of distribution can have a good effect on reducing a mass of processing pixels of non skin color. Secondly, skin colors extracted in the first detection are projected in the color space GB in order to further wipe off part of the remaining non skin colors that are not reduced in the first detection by the fitting of distribution. Lastly, the relationships among the three components of every pixel of skin colors and non skin colors in the color space HSL are observed and the percentage of pixels corresponding to a certain relationship is calculated, so part of the non skin color can be further reduced based on the differences we find according to the observed relationship. Experimental results indicate that this algorithm has a good recognition effect and small amount of computation, it can be used in skin color detection in simple environment.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114378586","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
扫码关注我们
求助内容：
应助结果提醒方式：