{"title":"Osmotic Message-Oriented Middleware for Internet of Things","authors":"Islam Gamal, H. Abdel-Galil, A. Ghalwash","doi":"10.3390/computers11040056","DOIUrl":"https://doi.org/10.3390/computers11040056","url":null,"abstract":"IoT is a trending computational concept that converts almost everything in modern life into a smart thing in various innovational and outstanding approaches. Smart homes, connected cities, autonomous vehicles, industrial automation, and smart healthcare that allows doctors to perform a patient examination and enable executing a remote surgery are now applicable through the smart connected things. Moreover, the recent IoT analytics report expects the universal number of connected IoT things to grow by 9%, to 12.3 billion operating terminals. It is expected that there will be more than 27 billion IoT live connections by 2025. In this paper, we present osmotic message-oriented middleware, introducing an end-to-end IoT platform to federate the dynamic orchestration process of resources across different heterogeneous types of devices belonging to physical and virtual infrastructures (e.g., edge, fog, and cloud layers); the orchestration process follows the osmotic computing concepts represented as the self-adaptive MAPE-K model, which maintains/adopts itself on the runtime through feedback loops from the provisioning engine, which collects the node’s hardware and software performance matrices. Accordingly, the orchestration process utilizes the optimized dynamic Hungarian algorithm to solve the MELs’ assignment problem based on the vibrant runtime provisioning data. The implemented middleware prototype is tested on both simulated and real-life environments to validate the architecture hypothesis of running an efficient, robust, elastic, and cost-efficient end-to-end osmotic IoT ecosystem, which unlocks a new implementation model for the IoT numerous domains.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129721580","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":"Trans_Proc: A Reconfigurable Processor to Implement The Linear Transformations","authors":"A. Sanyal, A. Sinha","doi":"10.4018/ijsi.303575","DOIUrl":"https://doi.org/10.4018/ijsi.303575","url":null,"abstract":"A reconfigurable transform processor is proposed and implemented here. Firstly, a brief study of processors implementing different transformations is presented. We have categorized the transform processor as the one which can implement a number of linear transforms using reconfigurability. The theoretical suitability regarding the architecture of the processor is proved by graph theory method. Then the complete architecture of the overall processor and the processing element is presented and implemented using VHDL. The complete instruction set suitable to the processor is designed. The instructions are mapped to the sequence of control signals. Generating sequence of control signals for every type of instructions would finally create a hardwired control unit for the processor which was also presented. Next the processor is fed with data to simulate it. A three-phase simulation is carried out to prove the correctness of the design. Finally the same processor with a data bus width of 32 to 512 is implemented and compared in terms of speed and size.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125114069","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":"A Study on the Relationship Between Government Regulations and Innovation Efficiency in Information and Communication Technology (ICT) Industry","authors":"Jaeho Shin, Yeongjun Kim, Chang-Gun Kim","doi":"10.4018/ijsi.301218","DOIUrl":"https://doi.org/10.4018/ijsi.301218","url":null,"abstract":"Although government regulations have a significant impact on innovation, research on the impact of government regulations on innovation efficiency has yet to be sufficiently uncovered. In this study, the effects of government regulations on innovation efficiency in ICT service industry are verified through tobit regression analysis after calculating innovation efficiency by DEA. Government policies are divided into 11 categories, and two different innovation efficiencies are calculated as the innovation process is divided into two stages: R&D efficiency and commercialization efficiency. The results prove that “regulations for small and medium-sized business” and “financial market regulation and separation of banking and commerce” have negatively effects on R&D efficiency.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114434940","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":"Accurate and Language Agnostic Code Clone Detection by Measuring Edit Distance of ANTLR Parse Tree","authors":"Sanjay B. Ankali, L. Parthiban","doi":"10.4018/ijsi.297915","DOIUrl":"https://doi.org/10.4018/ijsi.297915","url":null,"abstract":"In spite of significant research done in the past 3 decades introducing more than 250 clone detection tools/ techniques for finding the same language clones, there exists no single framework to detect and classify all 4 basic types of clones with great accuracy (precision and recall). In this paper, we propose an accurate and language agnostic technique to classify 4 types of clones. The method first generates an ANTLR parse tree for the input program file using freely available ANTLR grammar files then finds the edit distance between the two parse trees using the Levenshtein distance algorithm and converts the edit distance into similarity using. We obtained 100% precision and recall in detecting type 1 & 2 clone types and achieve 98.50 and 98.12 respectively for type 3 and 4 clone types for our datasets containing microprograms of C, CPP, and Java. This paper provides evidence that the Levenshtein distance on ANTLR parse tree is the good choice to build a complete and accurate software clone detector and act as proper validation tools to detect code plagiarism.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129212168","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":"An Empirical Study on Continuous Usage Intention of Food Delivery Apps","authors":"D. Jo, Seul-Ki Lee","doi":"10.4018/ijsi.309723","DOIUrl":"https://doi.org/10.4018/ijsi.309723","url":null,"abstract":"In with the spread of COVID-19, the use of technology-based services that minimize face-to-face is increasing. In this context, the food delivery app (FDA) is characterized by minimizing face-to-face contact in the process of consumers ordering and receiving food. Therefore, the purpose of this study is to find out the mechanism that affects the intention of continuous use based on PAM for FDA users. The study sample selected residents of Korea who were over 20 years of age and used the FDA at least once in the past three months. Data collection was carried out for about one month from January 18 to February 12, 2020. Structural equation model analysis was conducted using 261 of the collected data. The results are expected to add depth to the research field related to the app-based O2O service area, and to be used as data that can contribute to the establishment of platform business strategies.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123829656","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":"Bio-Inspired Multi-Level Hybrid Crypto System","authors":"K. Padmapriya, P. Eric","doi":"10.4018/ijsi.301223","DOIUrl":"https://doi.org/10.4018/ijsi.301223","url":null,"abstract":"Research in information Security is very much essential as there is an increase in data breach. DNA cryptography is one of the invention in the field of data security which provides hope for an unbreakable algorithm. This paper presents a multi-level hybrid crypto system based on DNA cryptography and DNA steganography. The proposed method uses a DNA sequence from publicly available DNA data base as a onetime pad. Initially plaintext is converted into DNA form of cipher text and then using central dogma of molecular biology concept DNA strings are converted into amino acid codes which represents the protein form of data. The crux of the algorithm lies on the one-time pad used for encryption process. The proposed system combines the advantages of DNA cryptography, DNA steganography and one time pad. Security analysis shows that proposed method is strong enough to resist brute force attacks as well as cryptanalytic attacks.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124157368","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}
Tarun Jain, Rishabh Jain, Shivaji Ray Chaudhuri, Shreyes Upadhyay, Arjun Singh, V. Verma, Aditya Sinha
{"title":"Detection of Sexually Harassing Tweets in Hindi Using Deep Learning Methods","authors":"Tarun Jain, Rishabh Jain, Shivaji Ray Chaudhuri, Shreyes Upadhyay, Arjun Singh, V. Verma, Aditya Sinha","doi":"10.4018/ijsi.309110","DOIUrl":"https://doi.org/10.4018/ijsi.309110","url":null,"abstract":"In the modern era, social networking platforms play a vital role in day-to-day life. It is used by personalities, bureaucrats, and common people alike. It provides a platform for everyone to express their opinions, share their experiences with their family, friends, and the world. The advent of such platforms has completely changed the outlook of the world. Sexual harassment has been a problem for a long time, but with the advancement in technology, some users have taken the harassment to the digital level. It is common these days to find users posting derogatory remarks, uploading sensual and private content of others in order to sexually harass them. This is not all. Some targeted audience might even take some wrong steps. This article presents a way to detect such derogatory and harassing remarks using Twitter as a database. The classification part is done with the help of two deep learning models, and at the end, the performance of both models is evaluated on various parameters.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"43 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120878237","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":"A Survey of Digital Image Watermarking Techniques in Spatial, Transform, and Hybrid Domains","authors":"K. Prabha, I. S. Sam","doi":"10.4018/ijsi.309113","DOIUrl":"https://doi.org/10.4018/ijsi.309113","url":null,"abstract":"In this digital era, the vast development of multimedia environments and information technology creates a need for protecting digital content from unauthorized access. Digital watermarking is a universally accepted technique for tackling the issues in the field of multimedia security and information rights management. Several appropriate image watermarking processes have been designed to secure the digital content. An efficient watermarking technique should maintain the tradeoff among imperceptibility, robustness, embedding capacity, and security. Primarily, this paper presents the classifications and applications of digital image watermarking techniques. The discussion comprises the spatial, transform, and hybrid image watermarking methods as well as its comparison with the different schemes. The contribution of this article will be beneficial to the academicians for gaining deep knowledge about image watermarking schemes.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"12 46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131384223","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":"The SOF Programming Paradigm: A Sequence of Pure Functions","authors":"A. Bossard","doi":"10.4018/ijsi.309965","DOIUrl":"https://doi.org/10.4018/ijsi.309965","url":null,"abstract":"Out of the four main programming paradigms, it is widely considered that functional programming is the most promising. The programming languages that implement the functional paradigm generally do so either in a pure manner, such as Haskell, or by providing a multi-paradigm programming solution, such as most Lisp dialects, in order to allow side effects, which are proscribed under the former (pure) model. Nevertheless, tracking the execution steps of such a functional program remains challenging for the programmer. In this paper, the author addresses this issue by proposing a novel programming paradigm that combines the imperative programming approach based on a sequence of instructions with the pure function approach of functional programming, the objective being to retain the advantages of both strategies. This proposal is named “sequence of functions” (SOF), and its applicability and novelty are shown hereinafter throughout various examples and experiments.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130468558","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":"Empirical Analysis of Pair Programming Using Bloom's Taxonomy and Programmer Rankers Algorithm to Improve the Software Metrics in Agile Development","authors":"W. RegisAnne, S. C. Jeeva","doi":"10.4018/ijsi.297624","DOIUrl":"https://doi.org/10.4018/ijsi.297624","url":null,"abstract":"Collaborative programming is a co-operative effort of 2 teams to n-teams to share knowledge, synergize and produce better code. Pairing, Swarming and Mobbing are the standard of agile technology which are adapted by many organizations. In this paper, software development is carried out using Pair Programming(PP) in a medium sized organization developing mobile applications using android is presented. The first method uses the Programmers Competency Matrix (PCM) based on Blooms Taxonomy to assess the skill of the programmers. Since, the pairs are chosen randomly in the PCM method, a novel algorithm is proposed to pair the programmers by Programmer Ranking Algorithm (PRA). The two proposed methods are evaluated in an organization and the results are validated. The results prove that PP definitely improves the software development process than when it is developed by individual programmers. The PRA methodology outperforms the PCM because the PRA chooses the pair wisely using the programming skills of the programmer.","PeriodicalId":396598,"journal":{"name":"Int. J. Softw. Innov.","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124229817","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}