{"title":"A British Multi-Access System on an IBM System/360 Computer","authors":"I. Pyle","doi":"10.32474/ctcsa.2019.01.000120","DOIUrl":"https://doi.org/10.32474/ctcsa.2019.01.000120","url":null,"abstract":"Following the success of the Compatible Time-Sharing System [1], and its brilliant exploitation in Project MAC at MIT (now the MIT Computer Science and Artificial Intelligence Laboratory, CSAIL), many institutions began making similar systems. Among the British ones were a multi-access extension for the supervisor for the Titan computer at Cambridge [2], COTAN [3-4] at Culham on an English Electric KDF-9, KOS [5] at the University of Kent at Canterbury on an Elliott 4130, and HUW at Harwell on an IBM System/360 computer, the subject of this paper. Harwell Users’ Workshop HUW was set up to provide interactive facilities for computer users at A.E.R.E Harwell. HUW was designed in 1965, following the author’s sabbatical visit to Project MAC.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129255968","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 of an Economic Model for Protectively Sharing Biomedical Data","authors":"Adebayo Ot","doi":"10.32474/ctcsa.2019.01.000117","DOIUrl":"https://doi.org/10.32474/ctcsa.2019.01.000117","url":null,"abstract":"Frequency (MAF) and regression coefficients can lead to privacy concerns [5]. This understanding has led various groups removing statistical data from public databases into access-controlled format. Though such protections help preserve privacy, they also have adverse effects on access to useful dataset for medical research. The medical community is at a crossroad; how can researchers access medical data to data to save lives and still ensure the privacy of the individuals involved in the datasets. An effective model for genomic data dissemination can be achieved through an approach based on game theory to account for adversarial behaviors and capabilities. The proposed approach has already been used to analyze the reidentification risk and proven effective in some risk inherent domains, such as airport security and coast guard patrols [6]. Methodologies are borrowed from game theory to develop an effective, measurable protections for genomic data sharing. This method accounts for adversarial behavior to balance risks against utility more effectively compared with traditional approaches. Abstract Sharing medical data (such as genomic) can lead to important discoveries in healthcare, but researches have shown that links between de-identified data and named persons are sometimes reestablished by users with malicious intents. Traditional approaches to curb this menace rely data use agreements, suppression and noise adding to protect the privacy of individual in the dataset, but this reduces utility of the data. Therefore, this paper proposed an economic game theoretic model design for quantifiable protections of genomic data. The model can be developed to find solution for sharing summary statistics under an economically motivated recipient’s (adversary) inference attack. The framework incorporates four main participants: Data Owners, Certified Institution (CI), Sharer and Researchers (Recipients). The data Sharer and Researcher (who are the players) are economically motivated.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130055992","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":"Optimized Path Planning in Reinforcement Learning by Backtracking","authors":"Morteza Kiadi, Qing Tan, J. Villar","doi":"10.32474/CTCSA.2019.01.000116","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000116","url":null,"abstract":"There exist many solutions to the maze pathfinding problem\u0000for more than three decays. The problem is referred to as maze\u0000pathfinding, maze navigation, micro mouse and indoor robot\u0000pathfinding","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123339637","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":"Complex Neural Fuzzy Prediction Using Multi-Swarm Continuous Ant Colony Optimization","authors":"Chunshien Li, W. Weng","doi":"10.32474/CTCSA.2019.01.000115","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000115","url":null,"abstract":"Prediction of time series is one of major research subjects in data science. This paper proposes a novel approach to the problem of multiple-target prediction. The proposed approach is mainly composed of three parts: the complex neuro-fuzzy system (CNFS) built by using complex fuzzy sets, the two-stage feature selection method for multiple targets, and the hybrid machine learning method that uses the multi-swarm continuous ant colony optimization (MCACO) and the recursive least squares estimation (RLSE). The CNFS predictive model is responsible for prediction after training. During the training of the model, the parameters are updated by the MCACO method and the RLSE method where the two methods work cooperatively to become one machine learning procedure. For the predictive model, complex fuzzy sets (CFSs) are with complex-valued membership degrees within the unit disk of the complex plane, useful to the non-linear mapping ability of the CNFS model for multiple target prediction. This CFS property is contrast to real-valued membership degrees in the unit interval [0,1] of traditional fuzzy sets. The two-stage feature selection applies to select significant features to be the inputs to the model for multiple target prediction. Experiments using real world data sets obtained from stock markets for the prediction of multiple targets have been conducted. With the results and performance comparison, the proposed approach has shown outstanding performance over other compared methods.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133458622","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":"About the new internal symmetries of the Lattice ZN","authors":"A. Kornyushkin","doi":"10.32474/CTCSA.2019.01.000114","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000114","url":null,"abstract":"A large (apparently, infinite!) number of internal symmetries of\u0000the lattice ZN is identified.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132898123","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":"Canonically Open, Quasi-Desargues Paths","authors":"O. Akman, U. Steiner, O. Taylor, B Heaviside","doi":"10.32474/CTCSA.2019.01.000113","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000113","url":null,"abstract":"We wish to extend the results of [5-6] to right-Eratosthenes,\u0000partially ultra-Sylvester, ultra-stable lines. A useful survey of the\u0000subject can be found in [7].","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121064961","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":"New Multilevel Architecture of Secured Supercomputers","authors":"As Molyakov","doi":"10.32474/CTCSA.2019.01.000112","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000112","url":null,"abstract":"The priority task is to provide mechanisms for fast backup,\u0000“mirroring” of critical processes. Otherwise, a deliberate attack\u0000or an unintentional failure will lead to the loss of huge arrays\u0000of important data necessary for solving engineering and\u0000information and analytical tasks.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126566640","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 Data Collection and Visualization System for Smart Buildings","authors":"Xinzhou Wei, Astrid Frank","doi":"10.32474/CTCSA.2019.01.000111","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000111","url":null,"abstract":"Wireless sensor network (WSN) is a very important part of the\u0000Internet of Things (IoT) [1]. It is composed of several thousands of\u0000sensor nodes which are capable of sensing, actuating and relaying\u0000the collected information.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126674534","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":"Mini Overview of Key Issues in Routing for OSPF MANETs","authors":"Alamgir Naushad, Muhammad Tanveer, A. Khan","doi":"10.32474/CTCSA.2019.01.000109","DOIUrl":"https://doi.org/10.32474/CTCSA.2019.01.000109","url":null,"abstract":"Open Shortest Path First (OSPF) is a well known and prominent Internet Protocol (IP) for network routing. By deploying a link state routing (LSR) algorithm OSPF comes under the category of interior gateway routing protocols. In today’s wireless ad hoc Internet, the current routing domain needs to maintain a peak level of service accessibility and availability, thus OSPF must be extended to the wireless ad hoc network for maximizing routing performance in the network by taking into account key routing issues, i.e., optimal Hello Interval, efficient flooding schemes, optimizing the traffic engineering related issues, optimum adjacency creations, connectivity factors, reducing control overhead, and QoS and security challenges. In addition, OSPF is very effective in its adoption of handling the network bandwidth utilization, therefore, wireless capacity planning is of utmost importance for today’s Internet with the possible presence of wireless infrastructure. Improving routing stability in OSPF MANET under topology change(s) due to variation in link connectivity becomes a very demanding challenge for the research community. Given a fascinating volume of review for literature and unavoidable importance relating to OSPF extension to MANETs, there has still persist a need to highlight key issues related with routing in OSPF MANET.","PeriodicalId":303860,"journal":{"name":"Current Trends in Computer Sciences & Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129557108","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}