{"title":"Optimizing the Enterprise Search","authors":"Juris Rats","doi":"10.1109/MCSI.2017.20","DOIUrl":"https://doi.org/10.1109/MCSI.2017.20","url":null,"abstract":"NoSQL solutions are used for search in large data volumes of unstructured data, mostly for the search of the public data. The problem is how to use the technology for effective search of enterprise data where users access rights apply. The search mechanism has to be organized in a way to work fast on a large volume of data to return only the results a user has access to. An objective of our research is to create such a search mechanism. We evaluate several types and brands of NoSQL databases and select the most appropriate for the solution of the problem on hand. We use a polyglot persistence model that advocates to use several technologies inside a solution to profit from the strength of each. The solution we created uses an SQL database for the input and maintenance of the current data and a NoSQL Elasticsearch database for the search and retrieval of data. We created a methodology as well to evaluate the performance of the solution (and a search mechanism in particular). The evaluation results on a 1 million document database show that the data requests of a flow generated by 2000 user base are processed in 0.14 seconds in average. The evaluation tests are performed on a one node Elasticsearch database on a commodity server hence the proposed solution should be regarded as an effective way to handle search of enterprise data.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130395019","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}
{"title":"Local Fractional Operator on Quadratic Riccati Differential Equation with Variable Coefficients","authors":"S. Edeki, G. O. Akinlabi, R. Borkor","doi":"10.1109/MCSI.2017.38","DOIUrl":"https://doi.org/10.1109/MCSI.2017.38","url":null,"abstract":"In this paper, approximate-analytical solutions of time-fractional Riccati differential equations (TFRDEs) with variable coefficients are considered via the application of local fractional operator (LFO) in the sense of Caputo derivative. The proposed semi-analytical technique is built on the basis of the standard Differential Transform Method (DTM). The approximate solutions are provided in the form of convergent series. This shows that the solution technique is very efficient, and reliable; as it does not require much computational work, even without given up accuracy.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126246373","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}
X. Zhuang, N. Mastorakis, S. Kaminaris, Jieru Chi, Hanping Wang
{"title":"Image Analysis by Discrete Relative Vector Field","authors":"X. Zhuang, N. Mastorakis, S. Kaminaris, Jieru Chi, Hanping Wang","doi":"10.1109/MCSI.2017.15","DOIUrl":"https://doi.org/10.1109/MCSI.2017.15","url":null,"abstract":"A novel method of relative vector field is proposed for gray-scale image analysis by imitating the electro-static field. It extends the mathematical form of electro-static field by introducing the item of gray-scale difference, which represents the local difference between adjacent image points. The local image regions can be segmented based on the relative vector field with a proposed region-growing method, and practical image segmentation can be archived by merging primitive regions. The experimental results prove the effectiveness of the proposed method.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124046794","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}
{"title":"Designing Model for Calculating the Amount of Cyber Risk Insurance","authors":"K. Piromsopa, Tomás Klíma, Lukáš Pavlík","doi":"10.1109/MCSI.2017.41","DOIUrl":"https://doi.org/10.1109/MCSI.2017.41","url":null,"abstract":"In the last few years, rising sophistication and impact of cyberattacks has led companies to reassessment of their approach to risk management. Many of them admitted that they are not able to successfully prevent these attacks and they tried to find other ways to mitigate the risk. One of the possible solutions can be a cybersecurity insurance that enables companies to transfer the risk connected with a security breach to an insurance company. Basic problem is then how the cost of insurance should be calculated and how to assess the level of client’s IT security controls and related risk. Unlike traditional insurance that derives the premium from target value and statistical models, the cyber insurance should take into account other factors. In this article, authors propose scoring model for cyber insurance that is based on the results of internal and external audits and compliance with mandatory and voluntary standards.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"127 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114004590","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. Poulos, S. Papavlasopoulos, Petros A Kostagiolas, S. Kapidakis
{"title":"Prediction of the Popularity from Google Trends Using Stationary Control: The Case of STM Publishers","authors":"M. Poulos, S. Papavlasopoulos, Petros A Kostagiolas, S. Kapidakis","doi":"10.1109/MCSI.2017.62","DOIUrl":"https://doi.org/10.1109/MCSI.2017.62","url":null,"abstract":"Time series on search queries for five (5) of the most popular publishing houses are extracted through Google Trends and analyzed. These include popularity trends for Springer, Elsevier, Sage, Wiley and Emerald. The stationarity feature of the time series is established and some preliminary inferences are drawn. Through this analysis the online behavior of scholars around the world towards the STM publishers is initially revealed; while the STM publishers included in the analysis have been grouped into two distinct popularity clusters.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116292733","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}
{"title":"RBF Approximation of Big Data Sets with Large Span of Data","authors":"V. Skala","doi":"10.1109/MCSI.2017.44","DOIUrl":"https://doi.org/10.1109/MCSI.2017.44","url":null,"abstract":"This contribution presents a new analysis of properties of the Radial Bases Functions (RBF) interpolation and approximation related to data sets with a large data span. The RBF is a convenient method for scattered d-dimensional interpolation and approximation, e.g. for solution of partial differential equations (PDE) etc. The RBF method leads to a solution of linear system of equations and computational complexity of solution is nearly independent of a dimensionality of a problem solved. However, the RBF methods are usually applied for small data sets with a small span of geometric coordinates. In this paper, we show influence of polynomial reproduction mostly used in RBF interpolation and approximation methods in the context of large span data sets. The experiments made proved expected theoretical results.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850633","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}
{"title":"Mathematical Modeling of Drill Strings Nonlinear Vibrations Taking into Account a Friction Forces","authors":"L. Khajiyeva, Aliya Umbetkulova","doi":"10.1109/MCSI.2017.59","DOIUrl":"https://doi.org/10.1109/MCSI.2017.59","url":null,"abstract":"In this work the nonlinear transverse vibrations of a drill string taking into account a frictional forces was studied. This forces are arising between the string and the borehole, between the drilling tool and the borehole at longitudinal feed during drilling. Solution of the model is obtained by the Bubnov-Galerkin method in the third approximation. Comparative analysis of the models with and without consideration the friction force is carried out, and the significance of application of the governing equations taking into account damping forces is shown. Drill strings with various parameters of length, material, external compressive force, and coefficient of friction are investigated. The resonant phenomenon is also investigated. The amplitude-frequency characteristics of the first and the third harmonic resonance are constructed. As a result of the research, the energy of the basic resonance is transferred to the third harmonic resonance. This fact confirms the appearance of resonance at higher frequencies in nonlinear systems with a stiff characteristic.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129781814","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}
Krasimir Tonchev, N. Neshov, A. Manolova, V. Poulkov
{"title":"Expression Recognition Using Sparse Selection of log-Gabor Facial Features","authors":"Krasimir Tonchev, N. Neshov, A. Manolova, V. Poulkov","doi":"10.1109/MCSI.2017.11","DOIUrl":"https://doi.org/10.1109/MCSI.2017.11","url":null,"abstract":"Automated expression recognition is a contemporary research field estimating human expressions from image or video data using computer algorithms combined with machine learning. This work proposes an algorithm for expression recognition including a feature extraction algorithm, consisting of log- Gabor filters followed by a feature selection based on sparse approximation of graph embedding. The classification is done on the selected features and is implemented using the Support Vector Machines classifier with radial basis kernel function. The algorithm is tested on the posed facial expressions image database Cohn-Kanade and provides competitive results compared to the state of the art.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130503746","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. Chmielewski, Damian Frąszczak, Marcin Kukielka, Dawid Bugajewski
{"title":"The Architectural Software Concepts Implemented in Distributed High Resolution Constructive Simulation Environment SymSG Border Tactics, Supporting Polish Border Guard Computer Assisted Exercises","authors":"M. Chmielewski, Damian Frąszczak, Marcin Kukielka, Dawid Bugajewski","doi":"10.1109/MCSI.2017.50","DOIUrl":"https://doi.org/10.1109/MCSI.2017.50","url":null,"abstract":"This paper presents main concepts of SymSG Border Tactics simulation software facilitating specialised tool for operational training of Polish Border Guard officers. The constructive simulator integrates two separate environments a simulator with supplemented GIS module and imitated SWK system which serves as Command&Control application used by Polish Border Guard. Each and every system’s training station hosts a constructive simulator integrated with SWK imitation serving as a reporting console supplementing trainee with realworld UI for registering and managing operational data. Simulation environment delivers a set of applications (duty reporting, communication, map modules) and a constructive simulator which performs realistic scenario gaming process. The architecture of the system integrates many implementation technologies JavaSE, .NET and integration methods involving inmemory data grid solution, message queues, webservices depending on the component integration requirements. The paper is a critical analysis and a case study of project’s achievements describing the evolution of the architecture, it’s refinement process and finally the summary of lessons learned. The work describes key components of the constructive simulator environment aiming at GIS, simulation algorithms, event-based simulation engine, operational graphics mechanisms, distributed data sharing components, speech and messaging module. Implemented and deployed simulation software is currently undergoing operational tests.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128507422","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}
{"title":"DeepMBS: Prediction of Protein Metal Binding-Site Using Deep Learning Networks","authors":"Ismail Haberal, H. Oğul","doi":"10.1109/MCSI.2017.13","DOIUrl":"https://doi.org/10.1109/MCSI.2017.13","url":null,"abstract":"The tertiary structure of a protein indicates what vital function that protein fulfills in the cell. Prediction of the metal binding comformation of a protein from its sequence is a crucial step in predicting its tertiary structure. In this study, a computational method was developed for predicting the binding of Histidine and Cysteine to metals. We propose a deep convolutional neural network architecture, DeepMBS, to predict protein metal binding sites. To our knowledge, this study is the first realization of deep learning idea for the problem of predicting metal binding site. The method allows automatic extraction of complex interactions between important features using only sequence information by utilizing PAM120 scoring matrix. Features were extracted from protein sequences obtained from the Protein Data Bank and deep convolutional neural network was applied to these features. According to experimental results on a benchmark dataset, metal binding states can be predicted with 82% recall and 79% precision. These results show that a better performance can be achived with deep learning approach compared with previous studies on the same dataset.","PeriodicalId":113351,"journal":{"name":"2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122274271","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}