{"title":"Banking Services and Distribution Channels – Evolution and Prospects","authors":"Ł. Murowaniecki","doi":"10.1515/jacsm-2015-0012","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0012","url":null,"abstract":"Abstract The article presents the process of evolution of banking services and banking distribution channels. It deals with the history and identifies main factors that affecting the change. In the following discussion, it presents phenomena that affect the future appearance of banking. These include changes in the economic and technological environment.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"11 1","pages":"105 - 115"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824554","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":"Performance Analysis of Vertical Handoff Metrics Using Variance Based Algorithms","authors":"A. Bijwe, Dethe C.G","doi":"10.1515/jacsm-2015-0008","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0008","url":null,"abstract":"Abstract Vertical handover is the evolving concept in 4G for seamless communication between heterogeneous networks. In this paper, our main objective is to analyze handover between two WLAN, two Wimax, two UMTS networks. The vertical handover decision is taken based on the variance based algorithm, which calculates the variance of parameters such as delay, jitter, bandwidth and packet loss for various above mentioned networks and the network with most of the parameters with minimum variance is selected. This algorithm is also compared with other algorithms such as MEW (Multiplicative experiment weighting), SAW (Simple Additive Weighting), TOPOSIS (Technique for order preference by similarity to ideal solution) and GRA (Grey Relational Analysis). These algorithms are appropriate for different traffic classes. Simulation results for proposed variance based algorithm in Matlab is discussed and compared with other Multiple attribute decision making algorithm basis of bandwidth; jitter, delay etc. are discussed in the paper. It can be seen that the proposed variance algorithm gives less packet delay than all the algorithms, Jitter is also is least than all the other algorithms.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"7 1","pages":"33 - 42"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824905","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":"Numerical Simulations for Solving Fuzzy Fractional Differential Equations by Max-Min Improved Euler Methods","authors":"N. A. Khan, O. A. Razzaq, Fatima Riaz","doi":"10.1515/jacsm-2015-0010","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0010","url":null,"abstract":"Abstract In this paper, an extension is introduced into Max-Min Improved Euler methods for solving initial value problems of fuzzy fractional differential equations (FFDEs). Two modified fractional Euler type methods have been proposed and investigated to obtain numerical solutions of linear and nonlinear FFDEs. The proposed algorithms are tested on various illustrative examples. Exact values are also simulated to compare and discuss the closeness and accuracy of approximations so obtained. Comparatively, tables and graphs results reveal the complete reliability, efficiency and accuracy of the proposed methods.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"7 1","pages":"53 - 83"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824953","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":"Application of Numerical Laplace Inversion Methods in Chemical Engineering with Maple®","authors":"M. Wójcik, M. Szukiewicz, P. Kowalik","doi":"10.1515/jacsm-2015-0006","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0006","url":null,"abstract":"Abstract In this paper, the procedure of choice of the effective numerical inversion method of Laplace transform for solving of the mathematical model of gas flow was shown. Two inversion methods are evaluated in this work: the Gaver-Stehfest method, and the Dubner and Abate method. The numerical tests has been made using test functions. Based on the test results the fast and accurate method was selected and applied for modeling of the gas flow. The Gaver-Stehfest method has proven the most effective. The model was developed using the computer algebra system Maple®. Implementation of the methods were done by authors.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"7 1","pages":"15 - 5"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824133","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}
J. S. Shyam Mohan, P. Shanmugapriya, Bhamidipati Vinay Pawan Kumar
{"title":"The Big Data Mining Approach for Finding top rated URL","authors":"J. S. Shyam Mohan, P. Shanmugapriya, Bhamidipati Vinay Pawan Kumar","doi":"10.1515/jacsm-2015-0007","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0007","url":null,"abstract":"Abstract Finding out the widely used URL’s from online shopping sites for any particular category is a difficult task as there are many heterogeneous and multi-dimensional data set which depends on various factors. Traditional data mining methods are limited to homogenous data source, so they fail to sufficiently consider the characteristics of heterogeneous data. This paper presents a consistent Big Data mining search which performs analytics on text data to find the top rated URL’s. Though many heuristic search methods are available, our proposed method solves the problem of searching compared with traditional methods in data mining. The sample results are obtained in optimal time and are compared with other methods which is effective and efficient.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"215 1","pages":"17 - 32"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0007","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824893","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":"Design and Analysis of EDF Scheduling Algorithm for a Chosen Network Traffic Problem: Implementation and Simulation Analysis","authors":"Jude Ighodaro","doi":"10.1515/jacsm-2015-0009","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0009","url":null,"abstract":"Abstract Workstations, CPU etc are in a period of transition, moving from a relatively slow network links and data oriented services to a high set fibre optic services and more diverse services. As such many of the hard and soft real time will not only demand high bandwidth but also a predictable and guarantee Quality of Service (QoS) along side, which is not offered in a best effort network (BE). The provision and terms of (QoS) to real-time applications is a key issue in promising broadband packet switched networks and network of other sorts. Applications such as voice and video typically require QoS guarantees in terms of end-to-end data transfer delays. Supporting the diverse and of course, heterogeneous delay requirements of applications with widely varying characteristics requires packet scheduling schemes more sophisticated than First-In-First-Out (FIFO) at each switch in the network(2) are one of most accepted examples of such scheduling schemes. This points to the convincing need for a QoS, which apportion a high network utilization to be realized. In this paper, we focus on the EDF scheduling scheme, since it is known to provide the optimal delay performance (2), in the deterministic environment, and can for this reason be expected to perform well in the real time setting as well. The large amount of bandwidth as promised by the future network also offer the integration of real time applications, hard or soft.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"7 1","pages":"43 - 52"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824914","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":"Interpolation Of Data Gaps Of SLC-Off Landsat ETM+ Images Using Algorithm Based On The Differential Operators","authors":"Raghvendra Singh, P. Prasad","doi":"10.1515/jacsm-2015-0001","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0001","url":null,"abstract":"Abstract The scan-line corrector (SLC) of the Landsat 7 Enhanced Thematic Mapper Plus (ETM+) sensor failed in May 2003, and this abnormal functioning of SLC resulted in about 22% of the pixels per scene without being scanned. By filling the un-scanned gap by a good technique will help in more use of ETM+ data for many scientific applications. While there have been a number of approaches developed to fill in the data gaps in ETM+ imagery, each method has shortcomings, especially they require SLC-on (images acquired before SLC-off anomaly) imagery for the same location to fill the gaps in SLC-off (images acquired after SLC anomaly) image. To overcome such shortcomings this study proposes an alternative interpolation method based on the partial derivative. This case study shows that this technique is very much useful to interpolate the missing pixel values in the SLC-off ETM+ data.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"100 - 93"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824512","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":"Application Of Strain Gauges In Measurements Of Strain Distribution In Complex Objects","authors":"Piotr Tutak","doi":"10.1515/jacsm-2015-0004","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0004","url":null,"abstract":"Abstract This article presents an application of strain gauges in measurements of strain which occurs in charge air cooler during the thermal cycle test. The work shows the main idea of measuring system based on strain gauges and important aspects that should be considered when performing measurement. In this article there has been also presented construction and principle operation of a strain gauge measurement system.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"135 - 145"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824085","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":"Least Support Orthogonal Matching Pursuit Algorithm With Prior Information","authors":"Israa Tawfic, S. Kayhan","doi":"10.1515/jacsm-2015-0003","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0003","url":null,"abstract":"Abstract This paper proposes a new fast matching pursuit technique named Partially Known Least Support Orthogonal Matching Pursuit (PKLS-OMP) which utilizes partially known support as a prior knowledge to reconstruct sparse signals from a limited number of its linear projections. The PKLS-OMP algorithm chooses optimum least part of the support at each iteration without need to test each candidate independently and incorporates prior signal information in the recovery process. We also derive sufficient condition for stable sparse signal recovery with the partially known support. Result shows that inclusion of prior information weakens the condition on the sensing matrices and needs fewer samples for successful reconstruction. Numerical experiments demonstrate that PKLS-OMP performs well compared to existing algorithms both in terms of reconstruction performance and execution time.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"111 - 134"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jacsm-2015-0003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824073","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":"AnnoGene: RESTful Web Service For Annotating Genomic Features","authors":"A. Tomski, M. Piechota, R. Przewłocki","doi":"10.1515/jacsm-2015-0002","DOIUrl":"https://doi.org/10.1515/jacsm-2015-0002","url":null,"abstract":"Abstract Modern high-throughput sequencing techniques generate a constantly increasing amount of genomic data from eukaryotes. The main problem is quickly identifying the data that may provide information about the nature of intracellular processes, such as the targeting of transcription factor-binding sites. Typically, thousands of peaks or signals are found across the genome and the nearby genes must be annotated. We introduce AnnoGene - a web service for annotating genomic features. AnnoGene was implemented in a representational state transfer (REST) architectural style. The program searches for the gene nearest to the center of a genomic position. Subsequently, the location and annotationsof the gene are shown. The tool can be downloaded and run on a local computer, but it was designed to be a web service. AnnoGene is freely available through a web browser. Moreover, our paper covers examples of the REST clients written in the Python, R and Java programming languages. AnnoGene only requires genomic positions from the user. Even when annotating several thousand positions, the output is typically ready in a few seconds. Moreover, this tool supports Seqinspector – a web tool for finding regulators of the genes.","PeriodicalId":89404,"journal":{"name":"Journal of Applied Computer Science Methods","volume":"6 1","pages":"101 - 110"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66824065","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}