Scientific progress is increasingly dependent on knowledge in computation-ready forms. In the life sciences, among others, many scientists therefore extract and structure knowledge from the literature. In a process called manual curation, they enter knowledge into spreadsheets, or into databases where it serves their and many others' research. Valuable as these curation efforts are, the range and detail of what can practically be captured and shared remains limited, because of the constraints of current curation tools. Many important contextual aspects of observations described in literature simply do not fit in the form defined by these tools, and thus cannot be captured. Here we present the design of an easy-to-use, general-purpose method and interface, that enables the precise semantic capture of virtually unlimited types of information and details, using only a minimal set of building blocks. Scientists from any discipline can use this to convert any complex knowledge into a form that is easily readable and meaningful for both humans and computers. The method VSM forms a universal and high-level language for encoding ideas, and for interacting with digital knowledge.

In Wikipedia, articles about various topics can be created and edited independently in each language version. Therefore, quality of information about the same topic depends on language. Any interested user can improve an article and that improvement may depend on popularity of the article. The goal of this study is to show what topics are best represented in different language versions of Wikipedia using results of quality assessment for over 39 million articles in 55 languages. In this paper, we also analyze how popular are selected topics among readers and authors in various languages. We used two approaches to assign articles to various topics. First, we selected 27 main multilingual categories and analyzed all their connections with sub-categories based on information extracted from over 10 million categories in 55 language versions. To classify the articles to one of the 27 main categories we took into account over 400 million links from articles to over 10 million categories and over 26 million links between categories. In the second approach we used data from DBpedia and Wikidata. We also showed how the results of the study can be used to build local and global rankings of the Wikipedia content.

Along with the Coronavirus pandemic, another crisis has manifested itself in the form of mass fear and panic phenomena, fuelled by incomplete and often inaccurate information. There is therefore a tremendous need to address and better understand COVID-19's informational crisis and gauge public sentiment, so that appropriate messaging and policy decisions can be implemented. In this research article, we identify public sentiment associated with the pandemic using Coronavirus specific Tweets and R statistical software, along with its sentiment analysis packages. We demonstrate insights into the progress of fear-sentiment over time as COVID-19 approached peak levels in the United States, using descriptive textual analytics supported by necessary textual data visualizations. Furthermore, we provide a methodological overview of two essential machine learning classification methods, in the context of textual analytics, and compare their effectiveness in classifying Coronavirus Tweets of varying lengths. We observe a strong classification accuracy of 91% for short Tweets, with the Naive Bayes method. We also observe that the logistic regression classification method provides a reasonable accuracy of 74% with shorter Tweets, and both methods showed relatively weaker performance for longer Tweets. This research provides insights into Coronavirus fear sentiment progression, and outlines associated methods, implications, limitations and opportunities.

Wikipedia is the most popular and the largest user-generated source of knowledge on the Web. Quality of the information in this encyclopedia is often questioned. Therefore, Wikipedians have developed an award system for high quality articles, which follows the specific style guidelines. Nevertheless, more than 1.2 million articles in Polish Wikipedia are unassessed. This paper considers over 100 linguistic features to determine the quality of Wikipedia articles in Polish language. We evaluate our models on 500,000 articles of Polish Wikipedia. Additionally, we discuss the importance of linguistic features for quality prediction.

VSM is a recently introduced method for entering and displaying any type of knowledge, in a form that is both semantically precise for computation and intuitive for human understanding. VSM is the combination of a new semantic model, and the design for a dedicated user interface to support it. Here we present the implementation of this user interface, as a sophisticated HTML-element, <vsm-box>, that can be embedded in any web-based curation app. We show how developers can use it for biocuration projects, customize it to particular end-user needs, and contribute to its growth. Vsm-box is open-source at https://github.com/vsmjs/vsm-box under the AGPL license, as a JavaScript (ES6) Vue.js web-component that runs in all modern web browsers. It is the capstone of the Vsmjs organization at https://github.com/vsmjs that groups its supporting modules. Extensive supplementary material on VSM and vsm-box is available at https://vsmjs.github.io.

The purpose of this article is to review a two year long implementation of an electronic health record (EHR) system at the outpatient department of a private hospital in Kathmandu, possibly a first implementation of its kind in Nepal. Procedures: The strategy designed for EHR implementation was based on Professor John P. Kotter's work on successful change management. Main findings: We found that keeping a close watch on the social dynamics affecting adoption decisions among users of the system was crucial for implementing the EHR; this was partly because the project received limited support from an erratically changing hospital leadership and lacked an EHR system suited to the needs of the users. Conclusions: The implementation described in this article is a good lesson on moving from control to drift in information systems implementation, and we hope this work will be useful to health IT professionals working in the space of digital transformation in resource-constrained environments.

In this paper, we tackle air quality forecasting by using machine learning approaches to predict the hourly concentration of air pollutants (e.g., Ozone, PM_2.5 and Sulfur Dioxide). Machine learning, as one of the most popular techniques, is able to efficiently train a model on big data by using large-scale optimization algorithms. Although there exists some works applying machine learning to air quality prediction, most of the prior studies are restricted to small scale data and simply train standard regression models (linear or non-linear) to predict the hourly air pollution concentration. In this work, we propose refined models to predict the hourly air pollution concentration based on meteorological data of previous days by formulating the prediction of 24 hours as a multi-task learning problem. It enables us to select a good model with different regularization techniques. We propose a useful regularization by enforcing the prediction models of consecutive hours to be close to each other, and compare with several typical regularizations for multi-task learning including standard Frobenius norm regularization, nuclear norm regularization, ℓ_2,1 norm regularization. Our experiments show the proposed formulations and regularization achieve better performance than existing standard regression models and existing regularizations.

Despite the fact that Wikipedia is often criticized for its poor quality, it continues to be one of the most popular knowledge base in the world. Articles in this free encyclopedia on various topics can be created and edited in about 300 different language versions independently. Our research showed that in language sensitive topics quality of information can be relatively better in the relevant language versions. However, in most cases it is difficult for the Wikipedia readers to determine the language affiliation of the described subject. Additionally, each language edition of Wikipedia can have own rules in manual assessing of the content quality. This makes automatic quality comparison of articles between various languages a challenging task. The paper presents results of relative quality and popularity assessment of over 28 million articles in 44 selected language versions. In addition, a comparative analysis of the quality and popularity of articles in some topics was conducted. The proposed method allows to find articles with information of better quality that can be used to automatically enrich other language editions of Wikipedia.

Contact tracing has become an indispensable tool of various extensive measures to control the spread of COVID-19 pandemic due to novel coronavirus. This essential tool helps to identify, isolate and quarantine the contacted persons of a COVID-19 patient. However, the existing contact tracing applications developed by various countries, health organizations to trace down the contacts after identifying a COVID-19 patient suffers from several security and privacy concerns. In this work, we have identified those security and privacy issues of several leading contact tracing applications and proposed a blockchain-based framework to overcome the major security and privacy challenges imposed by the applications. We have discussed the security and privacy measures that are achieved by the proposed framework to show the effectiveness against the security and privacy issues raised by the existing mobile contact tracing applications.

The paper demonstrates the analysis of Corona Virus Disease based on a probabilistic model. It involves a technique for classification and prediction by recognizing typical and diagnostically most important CT images features relating to Corona Virus. The main contributions of the research include predicting the probability of recurrences in no recurrence (first time detection) cases at applying our proposed approach for feature extraction. The combination of the conventional statistical and machine learning tools is applied for feature extraction from CT images through four images filters in combination with proposed composite hybrid feature extraction (CHFS). The selected features were classified by the stack hybrid classification system(SHC). Experimental study with real data demonstrates the feasibility and potential of the proposed approach for the said cause.

Blockchain technology enables a decentralized and distributed environment with no need for a central authority. Transactions are simultaneously secure and trustworthy due to the use of cryptographic principles. In recent years, blockchain technology has become very trendy and penetrated different domains, mostly due to the popularity of cryptocurrencies. One field where blockchain technology has tremendous potential is healthcare, due to the need for a more patient-centric approach to healthcare systems and to connect disparate systems and increase the accuracy of electronic healthcare records (EHRs). In this systematic review, an analysis of state-of-the-art blockchain research in the field of healthcare is conducted. The aim is to reveal the potential applications of the technology and to highlight the challenges and possible directions of blockchain research in healthcare. First, background information is discussed, followed by a description of the exact methodology used in this paper. Next, an analysis of the results is given, which includes a bibliometric overview, an analysis of gathered data and its properties, and the results of a literature quality assessment. Lastly, there is a discussion of the results from the analysis. The findings indicate that blockchain technology research in healthcare is increasing and it is mostly used for data sharing, managing health records and access control. Other scenarios are very rare. Most research is aimed at presenting novel structural designs in the form of frameworks, architectures or models. Findings also show that technical details about the used blockchain elements are not given in most of the analyzed publications and that most research does not present any prototype implementation or implementation details. Often even with a prototype implementation, no details about blockchain elements are given.

Contact tracing has become a vital tool for public health officials to effectively combat the spread of new diseases, such asthe novel coronavirus disease COVID-19. Contact tracing is not new to epidemiologist rather, it used manual or semi-manualapproaches that are incredibly time-consuming, costly and inefficient. It mostly relies on human memory while scalabilityis a significant challenge in tackling pandemics. The unprecedented health and socio-economic impacts led researchersand practitioners around the world to search for technology-based approaches for providing scalable and timely answers.Smartphones and associated digital technologies have the potential to provide a better approach due to their high level ofpenetration, coupled with mobility. While data-driven solutions are extremely powerful, the fear among citizens is thatinformation like location or proximity associated with other personal data and can be weaponised by the states to enforcesurveillance. Low adoption rate of such apps due to the lack of trust questioned the efficacy and demanded researchers tofind innovative solution for building digital-trust, and appropriately balancing privacy and accuracy of data. In this paper,we have critically reviewed such protocols and apps to identify the strength and weakness of each approach. Finally, wehave penned down our recommendations to make the future contact tracing mechanisms more universally inter-operable andprivacy-preserving.

Background: CoronaVirus Disease 2019 (COVID-19) is the main discussed topic world-wide in 2020 and at the beginning of the Italian epidemic, scientists tried to understand the virus diffusion and the epidemic curve of positive cases with controversial findings and numbers. Objectives: In this paper, a data analytics study on the diffusion of COVID-19 in Lombardy Region and Campania Region is developed in order to identify the driver that sparked the second wave in Italy Methods: Starting from all the available official data collected about the diffusion of COVID-19, we analyzed google mobility data, school data and infection data for two big regions in Italy: Lombardy Region and Campania Region, which adopted two different approaches in opening and closing schools. To reinforce our findings, we also extended the analysis to the Emilia Romagna Region. Results: The paper aims at showing how different policies adopted in school opening / closing may have on the impact on the COVID-19 spread. Conclusions: The paper shows that a clear correlation exists between the school contagion and the subsequent temporal overall contagion in a geographical area.

Deep learning is an emerging area of machine learning (ML) research. It comprises multiple hidden layers of artificial neural networks. The deep learn- ing methodology applies nonlinear transformations and model abstractions of high level in large databases. The recent advancements in deep learning architec- tures within numerous fields have already provided significant contributions in artificial intelligence. This article presents a state of the art survey on the contri- butions and the novel applications of deep learning. The following review chron- ologically presents how and in what major applications deep learning algorithms have been utilized. Furthermore, the superior and beneficial of the deep learning methodology and its hierarchy in layers and nonlinear operations are presented and compared with the more conventional algorithms in the common applica- tions. The state of the art survey further provides a general overview on the novel concept and the ever-increasing advantages and popularity of deep learning.

This paper presents an upcoming nonvolatile memories (NVM) overview. Non-volatile memory devices are electrically programmable and erasable to store charge in a location within the device and to retain that charge when voltage supply from the device is disconnected. The non-volatile memory is typically a semiconductor memory comprising thousands of individual transistors configured on a substrate to form a matrix of rows and columns of memory cells. Non-volatile memories are used in digital computing devices for the storage of data. In this paper we have given introduction including a brief survey on upcoming NVM's such as FeRAM, MRAM, CBRAM, PRAM, SONOS, RRAM, Racetrack memory and NRAM. In future Non-volatile memory may eliminate the need for comparatively slow forms of secondary storage systems, which include hard disks.

Recently, the medical image processing is extensively used in several areas. In earlier detection and treatment of these diseases is very helpful to find out the abnormality issues in that image. Here there are number of methods available for segmentation to detect the lung nodule of computer tomography (CT) image. The main result of this paper, the earlier detection of lung nodules using Pre-processing techniques of top-hat transform, median and adaptive bilateral filter was compared both filtering methods and proved the adaptive bilateral filter is suitable method for CT images. The proposed segmentation technique uses novel strip method and the image is split into number of strips 3, 4, 5 and 6. A marker- watershed method based on PSO and Fuzzy C-mean Clustering method was proposed method. Firstly, the input image was reduced noise reduction and smoothing and the filter image is using strips method and then the image is segmented by marker watershed method. Secondly, the enhanced PSO technique was used to locate the better accurate value of the clustering centers of Fuzzy C-mean Clustering. Final stage, with the accurate value of centers and the enhanced target function and the small region of the segmented object was clustered by Fuzzy C-mean. In segmentation algorithm presented in this paper gives 95% of accuracy rate to detect lung nodules when strip count is 5.

Cloud Computing is a promising and emerging technology that is rapidly being adopted by many IT companies due to a number of benefits that it provides, such as large storage space, low investment cost, virtualization, resource sharing, etc. Users are able to store a vast amount of data and information in the cloud and access it from anywhere, anytime on a pay-per-use basis. Since many users are able to share the data and the resources stored in the cloud, there arises a need to provide access to the data to only those users who are authorized to access it. This can be done through access control schemes which allow the authenticated and authorized users to access the data and deny access to unauthorized users. In this paper, a comprehensive review of all the existing access control schemes has been discussed along with analysis. Keywords: role-based access control, attribute-based access control, attribute-based encryption

We describe a dataset that contains job description published on a popular online website in the information and technology sector. As the website focus mainly on United Kingdom based jobs, the data have a specific focus on this country. It contains 11.501 job vacancies and 13 related meta data information. The dataset is suitable for HR analysis using machine learning techniques such as natural language processing and neural networks.

Historic expeditions are events that are flavored by exploratory, scientific, military or geographic characteristics. Such events are often documented in literature, journey notes or personal diaries. A typical historic expedition involves multiple site visits and their descriptions contain spatiotemporal and attributive contexts. Expeditions involve movements in space that can be represented by triplet features (location, time and description). However, such features are implicit and innate parts of textual documents. Extracting the geospatial information from these documents requires understanding the contextualized entities in the text. To this end, we developed a semi-automated framework that has multiple Information Retrieval and Natural Language Processing components to extract the spatiotemporal information from a two-volumes historic expedition gazetteer. Our framework has three basic components, namely, the Text Preprocessor, the Gazetteer Processing Machine and the JAPE (Java Annotation Pattern Engine) Transducer. We used the Brazilian Ornithological Gazetteer as an experimental dataset and extracted the spatial and temporal entities from entries that refer to three expeditioners’ site visits and mapped the trajectory of each expedition using the extracted information. Finally, one of the mapped trajectories was manually compared with a historical reference map of that expedition to assess the reliability of our framework. The reference map was manually prepared in previous research work by others.

Recently emerging data-driven citizen sciences need to harness increasing amount of massive data with varying quality. This paper develops essential theoretical frameworks and example models and examine its computational complexity for interactive data-driven citizen science within the context of guided self-organization. We first define a conceptual model that incorporates quality of observation in terms of accuracy and reproducibility, ranging between subjectivity, inter-subjectivity, and objectivity. Next, we examine the database's algebraic and topological structure in relation to informational complexity measures, and evaluate its computational complexities with respect to exhaustive optimization. Conjectures of criticality are obtained on self-organizing processes of observation and dynamical model development. Example analysis is demonstrated with the use of biodiversity assessment database, the process that inevitably involves human subjectivity for the management in open complex systems.

Visualizing geo-spatial data embedded into a three-dimensional terrain is challenging. The problem becomes even more complex when uncertainty information needs to be presented as well. This paper addresses the question of how to visually communicate all three aspects: the 3D terrain, the geo-spatial data, and the data-associated uncertainty. We argue that visualizing all aspects with a high degree of detail will likely exceed the visual budget. Therefore, we propose a visualization strategy based on prioritizing a selected aspect and presenting the remaining two with less detail. We discuss various design options that allow us to obtain differently prioritized visual representations. Our approach has been implemented as a tool for rapid visualization prototyping in the context of avionics applications. Practical solutions are described for a use case related to the visualization of 3D terrain and uncertain weather data.

Cyber Physical Systems (CPS) is the integration of computation and physical process that makes a complete system such as the physical components, networked systems, embedded computers and software and linking together of devices and sensors for information sharing. Cyber Physical Systems are Smart Systems that comprises of the merging and integration of Industry Control Systems, Critical Infrastructures, Internet of Things (IoT) and Embedded Systems. Major industries such as the Chemical and Industrial Plants, Aviation Systems, National Grid, the Stock Exchange, Military Systems, and others depends heavily on these Cyber Physical Systems for financial and economic growth. The benefits of CPS nationally and globally are in the areas of Manufacturing, Energy, Transport, Healthcare and Communication. Cyber Physical Systems incorporates Physical systems, Digital systems and Human elements on network infrastructures to provide interactive systems. However, these three key components the Physical systems, Digital systems and Human elements may have inherent threats and vulnerabilities on them that may run the risk of being compromise, exploited, attacked or hacked. Cybercriminals in their quest to bring down these systems and may cause disruption of services either for fame, revenge, political motive, economic war, cyber terrorism and cyber war. The study seeks to review the risks that are associated with these three key components Physical systems, Digital systems and Human elements. The study considered four main risk mitigation goals for this purpose, and these are Business Value, Organizational Requirements, Threat Agent and Impact based on the review results. We used Analytical Hierarchical Process (AHP) to determine the relative importance of these goals that contributes to developing cybercrime and rich in CPS. For the results, the prioritized goals are then used to assess the risks using a semi-quantitative approach to determine the net threat level.

This paper aims to develop a hierarchical risk assessment model using the newly-developed evidential reasoning (ER) rule, which constitutes a generic conjunctive probabilistic reasoning process. In this paper, we first provide a brief introduction to the basics of the ER rule and emphasize the strengths for representing and aggregating uncertain information from multiple experts and sources. Further, we discuss the key steps of developing the hierarchical risk assessment framework systematically, including (1) formulation of risk assessment hierarchy, (2) representation of both qualitative and quantitative information, (3) elicitation of attribute weights and information reliabilities, (4) aggregation of assessment information using the ER rule and (5) quantification and ranking of risks using utility-based transformation. The proposed hierarchical risk assessment framework can potentially be implemented to various complex and uncertain systems. A case study on the fire/explosion risk assessment of marine vessels demonstrates the applicability of the proposed risk assessment model.

This paper is an attempt to present a COVID-19 prediction model for India. Lockdown plays an important role in the arrest of community spread of the disease. This was evident from the study of other countries such as Russia, Belgium and Germany, where peak cases were recorded within a month of the imposition of lockdown, that it showed an immediate positive effect. However, in India, even after 65 days of lockdown, there is no decrease in the number of daily new cases reported. There were many models prepared for India and almost all of them were proven wrong by the increase in the number of cases. The model in this paper is prepared using the COVID-19 trend in other countries, population density and the pandemic bell curve. Based on the available data until 24^th May 2020, two scenarios have been presented. In one, the peak shall be obtained when the number of daily new cases per million reaches 190 and in the second when the daily new cases per million reach 724. One model predicts the number of cases to reach 1 million by mid-July 2020. The other model predicts the number of cases to peak by mid-July with the total cases reaching 20 million. The predicted cases were compared with the actual cases recorded for the period 25^th May to 11^th June 2020. It was observed that the actual values matched quite reasonably with the predicted values.

In the current age of the Fourth Industrial Revolution ($4IR$ or Industry $4.0$), the digital world has a wealth of data, such as Internet of Things (IoT) data, cybersecurity data, mobile data, business data, social media data, health data, etc. To intelligently analyze these data and develop the corresponding real-world applications, the knowledge of artificial intelligence (AI), particularly, machine learning (ML) is the key. Various types of machine learning algorithms such as supervised, unsupervised, semi-supervised, and reinforcement learning exist in the area. Besides, the deep learning, which is part of a broader family of machine learning methods, can intelligently analyze the data on a large scale. In this paper, we present a comprehensive view on these machine learning algorithms that can be applied to enhance the intelligence and the capabilities of an application. Thus, this study's key contribution is explaining the principles of different machine learning techniques and their applicability in various real-world applications areas, such as cybersecurity, smart cities, healthcare, business, agriculture, and many more. We also highlight the challenges and potential research directions based on our study. Overall, this paper aims to serve as a reference point for not only the application developers but also the decision-makers and researchers in various real-world application areas, particularly from the technical point of view.

This paper presents a review of cloud application architectures and its evolution. It reports observations being made during the course of a research project that tackled the problem to transfer cloud applications between different cloud infrastructures. As a side effect we learned a lot about commonalities and differences from plenty of different cloud applications which might be of value for cloud software engineers and architects. Throughout the course of the research project we analyzed industrial cloud standards, performed systematic mapping studies of cloud-native application related research papers, performed action research activities in cloud engineering projects, modeled a cloud application reference model, and performed software and domain specific language engineering activities. Two major (and sometimes overlooked) trends can be identified. First, cloud computing and its related application architecture evolution can be seen as a steady process to optimize resource utilization in cloud computing. Second, this resource utilization improvements resulted over time in an architectural evolution how cloud applications are being build and deployed. A shift from monolithic servce-oriented architectures (SOA), via independently deployable microservices towards so called serverless architectures is observable. Especially serverless architectures are more decentralized and distributed, and make more intentional use of independently provided services. In other words, a decentralizing trend in cloud application architectures is observable that emphasizes decentralized architectures known from former peer-to-peer based approaches. That is astonishing because with the rise of cloud computing (and its centralized service provisioning concept) the research interest in peer-to-peer based approaches (and its decentralizing philosophy) decreased. But this seems to change. Cloud computing could head into future of more decentralized and more meshed services.

IoT is a new communication paradigm that gains a very high importance in the past few years. This communication paradigm supports various heterogeneous applications in many fields and with the dramatic increase of the number of sensor devices, it becomes a demand. Designing IoT networks faces many challenges that include security, massive traffic, high availability, high reliability and energy constraints. Thus, new communication technologies and paradigms should be deployed for IoT networks to overcome these challenges and achieve high system performance. Distributed computing techniques (e.g. fog and MEC), software defined networking (SDN), network virtualization and blockchain are common recent paradigms that should be deployed for IoT networks, either combined or individually, to achieve the main requirements of the IoT networks at a high system performance. Fog computing is a form of edge computing that has been developed to provide the computing capabilities (e.g. storage and processing) at the edge of the access network. Employing Fog computing in IoT networks, as an intermediate layer between IoT devices and the remote cloud, becomes a demand to make use of the edge computing benefits. In this work, we provide a framework for the IoT system structure that employs an edge computing layer of Fog nodes controlled and managed by SDN network with the blockchain technology to achieve a high level of security for latency sensitive IoT applications. The proposed system employs SDN network with distributed controllers and distributed OpenFlow switches; these switches are enabled with limited computing and processing capabilities. Furthermore, a data offloading algorithm is developed to allocate different processing and computing tasks to the distributed OpenFlow switches with available resources. Moreover, a traffic model is proposed to model and analyze the traffic among different parts of the network. The proposed work achieves various benefits to the IoT network, such as the latency reduction, security improvement and high efficiency of resources utilization. The proposed algorithm is simulated and also the proposed system is experimentally tested over a developed testbed to validate the proposed structure. Experimental results show that the proposed system achieves higher efficiency in terms of latency, security and resource utilization.

The dark proteome as we define it, is the part of the proteome where 3D structure has not been observed either by homology modeling or by experimental characterization in the protein universe. From the 550.116 proteins available in Swiss-Prot (as of July 2016) 43.2% of the Eukarya universe and 49.2% of the Virus universe are part of the dark proteome. In Bacteria and Archaea, the percentage of the dark proteome presence is significantly less, with 12.6% and 13.3% respectively. In this work, we present the map of the dark proteome in Human and in other model organisms. The most significant result is that around 40%- 50% of the proteome of these organisms are still in the dark, where the higher percentages belong to higher eukaryotes (mouse and human organisms). Due to the amount of darkness present in the human organism being more than 50%, deeper studies were made, including the identification of ‘dark’ genes that are responsible for the production of the so-called dark proteins, as well as, the identification of the ‘dark’ organs where dark proteins are over represented, namely heart, cervical mucosa and natural killer cells. This is a step forward in the direction of the human dark proteome.

Modern companies accumulate a vast amount of customer data that can be used for creating a personalized experience. Analyzing this data is difficult and most business intelligence tools cannot cope with the volume of the data. One example is churn prediction, where the cost of retaining existing customers is less than acquiring new ones. Several data mining and machine learning approaches can be used, but there is still little information about the different algorithm settings to be used when the dataset doesn't fit into a single computer memory. Because of the difficulties of applying feature selection techniques at a large scale, Incremental Probabilistic Component Analysis (IPCA) is proposed as a data preprocessing technique. Also, we present a new approach to large scale churn prediction problems based on the mini-batch Stochastic Gradient Decent (SGD) algorithm. Compared to other techniques, the new method facilitates training with large data volumes using a small memory footprint while achieving good prediction results.

Blockchain technology has become one of the most popular technologies for maintaining digital transactions. From the foundation of Bitcoin to the now predominant smart contract, blockchain technology promises to induce a shift in thought about digital transactions in many fields, such as energy, healthcare, Internet of Things, cybersecurity, financial services and the supply chain. Despite blockchain technology offers many cryptography advantages such as immutability, digital signature and hashing; it has suffered from several critical cybersecurity threats and vulnerabilities. In this paper, we build upon the previous studies on vulnerabilities and investigates over 60 real cybersecurity incidents that have been happening on the blockchain networks between 2009 and 2019. We categorise those incidents against the key cybersecurity vulnerabilities in blockchain technologies; and have developed a taxonomy that captures five types of cybersecurity threats and vulnerabilities based on five main players in blockchain. The outcome of this research prompted concerns and research direction in developing countermeasures to alleviate these risks.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

Venoms that drip from the fangs of snakes are incredibly complex chemical cocktails of compounds, with different proteins and enzymes, including a large variety of toxins like myotoxins, cardiotoxins, hemotoxins, and neurotoxins and their countless combinations. In addition to their use in the treatment of snake bites in humans, they have numerous therapeutic and medicinal applications. Potential use of snake venom includes excessive bleeding, stroke, neurological disorders, cancer, diabetes and aging. Therefore, a proper understanding of snake venom toxin and facilitating their use is of utmost importance. In this paper, we describe a novel database, called SVDB, for storage, dissemination and analysis of snake venom and toxins related information. SVDB has autonomous links to NCBI databases to pull relevant information both on-demand and asynchronous ways to facilitate data integration. SVDB includes authentic, non-redundant, up-to-date scientific information on literature, sequences, structures, small molecules, taxonomy and many more. SVDB portal also provides external links to tools like BLAST, CLUSTAL, Swiss-model, phylogeny and other toxin related resources. The architecture of SVDB information fetching, linking and structuring is unique and can be implemented to any domain specific generic data collection pipeline through the NCBI. The database is publicly available at https://www.snakevenomdb.org.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

Multimodality requires integration of heterogeneous transportation data to construct a broad view of the transportation network. Many new transportation services are emerging with being isolated from previously existing networks. This lead them to publish their data sources to the web -- according to Linked Data Principles -- in order to gain visibility. Our interest is to use these data to construct an extended transportation network that links these new services to existing ones. The main problems we tackle in this article fall in the categories of automatic schema matching and data interlinking. We propose an approach that uses web services as mediators to help in automatically detect geospatial properties and map them between two different schemas. On the other hand, we propose a new interlinking approach that enables user to define rich semantic links between datasets in a flexible and customizable way.

The futures market plays a significant role in hedging and speculating by investors. Although various models and instruments are developed for real-time trading, it is difficult to realize profit by processing and trading a vast amount of real-time data. This study proposes a real-time index futures trading strategy that uses the pattern of KOSPI 200 index futures time series data. We construct a pattern matching trading system (PMTS) based on a dynamic time warping algorithm that recognizes patterns of market data movement in the morning and determines the afternoon's clearing strategy. We adopt 13 and 27 representative patterns and conduct simulations with various ranges of parameters to find optimal ones. Our experimental results show that the PMTS provides stable and effective trading strategies with relatively low trading frequencies. Investor communities that have sustained financial markets are able to make more efficient investments by using the PMTS. In this sense, the system developed in this paper is a sustainable investment technique and helps financial markets achieve efficient sustainability.

In this paper I take the book by Michel Serres “Thumbelina” as the occasion for a reflection on the conceptual basis of knowledge management, as it was built by Ikujiro Noanka and co-workers. The direct access to knowledge that Thumbelina practices together with her peers is, in fact, for me, a god observation point to bring the reflection of Nonaka further, towards the discovery of a new understanding of knowledge and knowing processes. If the digital revolution is third step after writing and printing, in the soft changes in the relations between human beings and knowledge, then it poses in an urgent manner the problem to deepen our understanding of what knowledge and intelligence are and to change our practice at the education level and to design new digital tools to support our knowledge management processes.

At present, medical institutes generally use EMR to record patient's condition, including diagnostic information, procedures performed and treatment results. EMR has been recognized as a valuable resource for large scale analysis. However, EMR has the characteristics of diversity, incompleteness, redundancy and privacy, which make it difficult to carry out data mining and analysis directly. Therefore, it is necessary to preprocess the source data in order to improve data quality and improve the data mining results. Different types of data require different processing technologies. Most structured data commonly needs classic preprocessing technologies, including data cleansing, data integration, data transformation and data reduction. For semi-structured or unstructured data, such as medical text, containing more health information, it requires more complex and challenging processing methods. The task of information extraction for medical texts mainly includes NER (Named Entity Recognition) and RE (Relation Extraction). In this paper, we introduce the process of EMR processing, including data collection, data preprocessing, data mining, evaluation and knowledge application, analyze the current status of the key technologies, such as data preprocessing and data mining, and provide an overview of the application domains and prospects of EMR mining technologies. Finally, we summarize the existing problems in the research of EMR mining, and review the development trends.

Cloud computing refers to applications delivered as services over the Internet. Cloud systems employ policies that are inherently dynamic in nature and that depend on temporal conditions defined in terms of external events, such as the measurement of bandwidth, use of hosts, intrusion detection or specific time events. In this paper, we investigate an optimized resource management scheme named v-Mapper. The basic premise of v-Mapper is to exploit application-awareness concepts using software-defined networking (SDN) features. This paper makes three key contributions to the field: (1) We propose a virtual machine (VM) placement scheme that can effectively mitigate the VM placement issues for data-intensive applications; (2) We propose a validation scheme that will ensure that a service is entertained only if there are sufficient resources available for its execution and (3) We present a scheduling policy that aims to eliminate network load constraints. An evaluation was carried out with various benchmarks and demonstrated that v-Mapper shows improved performance over other state-of-the-art approaches in terms of average task completion time, service delay time and bandwidth utilization. Given the growing importance of supporting large-scale data processing and analysis in datacentres, the v-Mapper system has the potential to make a positive impact in improving datacentre performance in the future.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

"Public legal information from all countries and international institutions is part of the common heritage of humanity. Maximizing access to this information promotes justice and the rule of law". In accordance with the aforementioned declaration on Free Access to Law by Legal information institutes of the world, a plethora of legal information is available through the Internet, while the provision of legal information has never before been easier. Given that law is accessed by a much wider group of people, the majority of whom are not legally trained or qualified, diversification techniques, should be employed in the context of legal information retrieval, as to increase user satisfaction. We address diversification of results in legal search by adopting several state of the art methods from the web search, network analysis and text summarization domains. We provide an exhaustive evaluation of the methods, using a standard data set from the Common Law domain that we subjectively annotated with relevance judgments for this purpose. Our results i) reveal that users receive broader insights across the results they get from a legal information retrieval system, ii) demonstrate that web search diversification techniques outperform other approaches (e.g., summarization-based, graph-based methods) in the context of legal diversification and iii) offer balance boundaries between reinforcing relevant documents or sampling the information space around the legal query.

Face verification for unrestricted faces in the wild is a challenging task. This paper proposes a method based on two deep convolutional neural networks(CNN) for face verification. In this work, we explore to use identification signal to supervise one CNN and the combination of semi-verification and identification to train the other one. In order to estimate semi-verification loss at a low computation cost, a circle, which is composed of all faces, is used for selecting face pairs from pairwise samples. In the process of face normalization, we propose to use different landmarks of faces to solve the problems caused by poses. And the final face representation is formed by the concatenating feature of each deep CNN after PCA reduction. What's more, each feature is a combination of multi-scale representations through making use of auxiliary classifiers. For the final verification, we only adopt the face representation of one region and one resolution of a face jointing Joint Bayesian classifier. Experiments show that our method can extract effective face representation with a small training dataset and our algorithm achieves 99.71% verification accuracy on LFW dataset.

On 25 May 2018, the General Data Protection Regulation (GDPR)Article 17, the Right to Erasure (‘Right to be Forgotten’) came into force making it vital for organisations to identify, locate and delete all Personally Identifiable Information (PII) where a valid request is received from a data subject to erase their PII and the contractual period has expired. This must be done without undue delay and the organisation must be able to demonstrate reasonable measures were taken. Failure to comply may incur significant fines, not to mention impact to reputation. Many organisations do not understand their data, and the complexity of a hybrid cloud infrastructure means they do not have the resources to undertake this task. The variety of available tools are quite often unsuitable as they involve restructuring so there is one centralised data repository. This research aims to demonstrate compliance with GDPR’s Article 17 Right to Erasure (‘Right to be Forgotten’) is achievable in a Hybrid cloud environment by following a list of recommendations. However, 100% retrieval, 100% of time will not be possible, but we show that small organisations running an ad-hoc Hybrid cloud environment can demonstrate that reasonable measures were taken to be Right to Erasure (‘Right to be Forgotten’) compliant.

Electronic health records (EHRs) are becoming a vital source of data for healthcare quality improvement, research, and operations. However, much of the most valuable information contained in EHRs remains buried in unstructured text. The field of clinical text mining has advanced rapidly in recent years, transitioning from rule-based approaches to machine learning and, more recently, deep learning. With new methods come new challenges, however, especially for those new to the field. This review provides an overview of clinical text mining for those who are encountering it for the first time (e.g. physician researchers, operational analytics teams, machine learning scientists from other domains). While not a comprehensive survey, it describes the state of the art, with a particular focus on new tasks and methods developed over the past few years. It also identifies key barriers between these remarkable technical advances and the practical realities of implementation at health systems and in industry.

This study examines the evolution of the two-factor authentication method and its adaptability to the online education system. Two-factor authentication is a security measure used especially in areas where information such as banking is valuable. Parallel to technological developments, it has developed as much as daily. It aims to take security one step forward because it is composed of two phases. Today, banking, IOT devices, public transport tickets and many other areas are used. Two-factor authentication methods against security attacks in the field of information are also being updated. In recent years, new technologies such as biometric (iris pattern, retinal pattern, etc.) or behavioral biometry (location tracking, walking information, touch speed etc.) were studied. Instead of physically studying somewhere like going to a course in modern society, online trainings become more advantageous. Most of these online trainings are given certificates such as participation certificate, success certificate, etc. The main problem here is whether the person who is being certified is true. In the study conducted in line with these details, there is a proposal for the application of the Mimic Control Method with Sound Intensity (MCMSI) method for on-line training by examining the two-factor authentication techniques up to the day.

In this brief paper a quantum algorithm to calculate the Hamming distance of two binary strings of equal length (or messages in theory information) is presented. The algorithm calculates the Hamming weight of two binary strings in one query of an oracle. To calculate the hamming distance of these two strings we only have to calculate the Hamming weight of the xor operation of both strings. To test the algorithms the quantum computer prototype that IBM has given open access to on the cloud has been used to test the results.

The quantization error (QE) from Self-Organizing Map (SOM) output after learning is exploited in this studies. SOM learning is applied on time series of spatial contrast images with variable relative amount of white and dark pixel contents, as in monochromatic medical images or satellite images. It is proven that the QE from the SOM output after learning provides a reliable indicator of potentially critical changes in images across time. The QE increases linearly with the variability in spatial contrast contents of images across time when contrast intensity is kept constant. The hitherto unsuspected capacity of this metric to capture even the smallest changes in large bodies of image time series after using ultra-fast SOM learning is illustrated on examples from SOM learning studies on computer generated images, MRI image time series, and satellite image time series. Linear trend analysis of the changes in QE as a function of the time an image of a given series was taken gives proof of the statistical reliability of this metric as an indicator of local change. It is shown that the QE is correlated with significant clinical, demographic, and environmental data from the same reference time period during which test image series were recorded. The findings show that the QE from SOM, which is easily implemented and requires computation times no longer than a few minutes for a given image series of 20 to 25, is useful for a fast analysis of whole series of image data when the goal is to provide an instant statistical decision relative to change/no change between images.

Presently, smartphones support a large range of applications, many of which require high computing power. This presents a problem because smartphones offer limited computing power, storage, and energy. Fortunately, Cloud computing (CC) is rapidly becoming known as the state of the art technology in the computer world. CC allows users to use unlimited dynamic resources when necessary. Mobile Cloud Computing (MCC) is integration into a mobile environment of the concept of cloud computing which eliminates barriers to the performance of mobile devices. The demand for mobile cloud applications and mobile user services is strong. This gives MCC a great opportunity to do business and research. However, security problems are a major obstacle to the adaptability of mobile cloud computing. This study presents the definitions of Cloud Computing, Mobile Computing (MC) and Mobile Cloud Computing including the architecture and applications of MCC. Furthermore, it discusses the challenges and opportunities faced in MCC.

The concept of ‘big data’ has been widely discussed, and its value has been illuminated throughout a variety of domains. To quickly mine potential values and alleviate the ever-increasing volume of information, machine learning is playing an increasingly important role and faces more challenges than ever. Because few studies exist regarding how to modify machine learning techniques to accommodate big data environments, we provide a comprehensive overview of the history of the evolution of big data, the foundations of machine learning, and the bottlenecks and trends of machine learning in the big data era. More specifically, based on learning principals, we discuss regularization to enhance generalization. The challenges of quality in big data are reduced to the curse of dimensionality, class imbalances, concept drift and label noise, and the underlying reasons and mainstream methodologies to address these challenges are introduced. Learning model development has been driven by domain specifics, dataset complexities, and the presence or absence of human involvement. In this paper, we propose a robust learning paradigm by aggregating the aforementioned factors. Over the next few decades, we believe that these perspectives will lead to novel ideas and encourage more studies aimed at incorporating knowledge and establishing data-driven learning systems that involve both data quality considerations and human interactions.

Motivated by the #Metoo movement, we explore in this paper people’s perception of female bullying at workplace. We looked at #workplacebullying and found that 1) people were split between identifying the prevalence of workplace bullying against female and the view that such bullying simply does not exist and is a nuisance, 2) The tweets also showed the existence of psychological effects of cyberbullying, and 3) the tweets showed many intervention techniques that can minimize the effects of such bullying. We further explored the top three recurring hashtags mentioned under the #workplacebullying and found that the three top hashtags were #sexism, #feminism and #equality. Our results showed that the above hashtags represent the positive and negative approach to workplace bullying i.e. #feminism hashtag was mostly used by people who denied that workplace bullying against females exist while # sexism was mentioned as the prime cause by people who agree that such bullying exist. #equality overwhelmingly comprises of techniques to minimize workplace bullying against females.

Aiming at the problems that are poor generalization performance, low retrieval accuracy and large time consumption of existing content-based image retrieval system, the hierarchical image retrieval method based on multi feature fusion is proposed in this paper. The retrieval accuracy rates on Corel5K, UKbeach and Holidays are 68.23(Top 1), 3.73(N-S) and 88.20(mAp), respectively. The experimental results show that the method proposed in this paper can effectively improve the deficiency of single feature retrieval and save time significantly in the premise of a small amount of loss of accuracy.

With the rapid spread of built-in GPS handheld smart devices, the trajectory data from GPS sensors has grown explosively. Trajectory data has spatio-temporal characteristics and rich information. Using trajectory data processing techniques can mine the patterns of human activities and the moving patterns of vehicles in the intelligent transportation systems. A trajectory similarity measure is one of the most important issues in trajectory data mining (clustering, classification, frequent pattern mining, etc.). Unfortunately, the main similarity measure algorithms with the trajectory data have been found to be inaccurate, highly sensitive of sampling methods, and have low robustness for the noise data. To solve the above problems, three distances and their corresponding computation methods are proposed in this paper. The point-segment distance can decrease the sensitivity of the point sampling methods. The prediction distance optimizes the temporal distance with the features of trajectory data. The segment-segment distance introduces the trajectory shape factor into the similarity measurement to improve the accuracy. The three kinds of distance are integrated with the traditional dynamic time warping algorithm (DTW) algorithm to propose a new segment–based dynamic time warping algorithm (SDTW). The experimental results show that the SDTW algorithm can exhibit about 57%, 86%, and 31% better accuracy than the longest common subsequence algorithm (LCSS), and edit distance on real sequence algorithm (EDR) , and DTW, respectively, and that the sensitivity to the noise data is lower than that those algorithms.

The understanding of various health-oriented vital sign data generated from body sensor networks (BSN) and discovery of the association between the generated parameters is an important task that may assist and promote important decision making in healthcare. For example, in a smart home scenario where the occupants’ health status is continuously monitored remotely, it is essential to provide required assistance when an unusual or critical situation is detected in their vital sign data. In this paper, we present an efficient approach to mine the incomplete (partial) periodic patterns obtained from BSN data. In addition, we employ a correlation test on the generated patterns and introduce the productive-associated partial periodic frequent patterns as the set of correlated partial periodical frequent items. The combination of these measures has the advantage of empowering healthcare providers and patients for quality of diagnosis, and also for better treatment and smart care, especially for the elderly people at smart home. We developed an efficient algorithm named PPFP-Growth (Productive Periodic Frequent Pattern growth) to discover all productive associated partial periodic patterns using these measures. PPFP-Growth is efficient, and the productiveness measure removes uncorrelated periodic items. An experimental evaluation on synthetic and real datasets shows the efficiency of the proposed PPFP-Growth algorithm, and can filter a huge number of partial periodic patterns to reveal only the correlated ones.

As the geolocation capabilities of smartphones continue to improve, developers have continued to create more innovative applications that rely on this location information for their primary function. This can be seen with Niantic's release of Pokémon GO, which is a massively multiplayer online role playing and augmented reality game. This game became immensely popular within just a few days of its release. However, it also had the propensity to be a distraction to drivers resulting in numerous accidents, and was used to as a tool by armed robbers to lure unsuspecting users into secluded areas. This facilitates a need for forensic investigators to be able to analyze the data within the application in order to determine if it may have been involved in these incidents. Because this application is new, limited research has been conducted regarding the artifacts that can be recovered from the application. In this paper, we aim to fill the gaps within the current research by assessing what forensically relevant information may be recovered from the application, and understanding the circumstances behind the creation of this information. Our research focuses primarily on the artifacts generated by the Upsight analytics platform, those contained within the bundles directory, and the Pokémon Go Plus accessory. Moreover, we present our new application specific analysis tool that is capable of extracting forensic artifacts from a backup of the Android application, and presenting them to an investigator in an easily readable format. This analysis tool exceeds the capabilities of UFED Physical Analyzer in processing Pokémon GO application data.

This paper identifies a criterion for choosing the largest set of rejected hypotheses in high-dimensional data analysis where Multiple Hypothesis testing is used in exploratory research to identify significant associations among many variables. The method neither requires predetermined thresholds for level of significance, nor uses presumed thresholds for false discovery rate. The upper limit for number of rejected hypotheses is determined by finding maximum difference between expected true hypotheses and false hypotheses among all possible sets of rejected hypotheses. Methods of choosing a reasonable number of rejected hypotheses and application to non-parametric analysis of ordinal survey data are presented.

Classification algorithms are very widely used algorithms for the study of various categories of data located in multiple databases that have real-world implementations. The main purpose of this research work is to identify the efficiency of classification algorithms in the study of breast cancer analysis. Mortality rate of women increases due to frequent cases of breast cancer. The conventional method of diagnosing breast cancer is time consuming and hence research works are being carried out in multiple dimensions to address this issue. In this research work, Google colab, an excellent environment for Python coders, is used as a tool to implement machine learning algorithms for predicting the type of cancer. The performance of machine learning algorithms is analyzed based on the accuracy obtained from various classification models such as logistic regression, K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Naïve Bayes, Decision Tree and Random forest. Experiments show that these classifiers work well for the classification of breast cancers with accuracy>90% and the logistic regression stood top with an accuracy of 98.5%. Also implementation using Google colab made the task very easier without spending hours of installation of environment and supporting libraries which we used to do earlier.

Alzheimer's disease (AD) detection acting as an essential role in global health care due to misdiagnosis and sharing many clinical sets with other types of dementia, and costly monitoring the progression of the disease over time by magnetic reasoning imaging (MRI) with consideration of human error in manual reading. This paper goal a comparative study on the performance of data mining techniques on two datasets of Clinical and Neuroimaging Tests with AD. Our proposed model in the first stage, Apply clinical medical dataset to a composite hybrid feature selection (CHFS), for extract new features to select the best features due to eliminating obscures features, In parallel with Apply a novel hybrid feature extraction of three batch edge detection algorithm and texture from MRI images dataset and optimized with fuzzy 64-bin histogram. In the second stage, we applied a clinical dataset to a stacked hybrid classification(SHC) model to combine Jrip and random forest classifiers with six model evaluations as meta-classifier individually to improve the prediction of clinical diagnosis. At the same stage of improving the classification accuracy of neuroimaging (MRI) dataset images by applying a convolution neural network (CNN) in comparison with traditional classifiers, running on extracted features from images. The authors have collected the clinical dataset of 426 subjects with (1229 potential patient sample) from oasis.org and (MRI) dataset from a benchmark kaggle.com with a total of around ~5000 images each segregated into the severity of Alzheimer's. The datasets evaluated using an explorer set of weka data mining software for the analysis purpose. The experimental show that the proposed model of ‏(CHFS) feature extraction ‏ lead to effectively reduced the false-negative rate with a relatively high overall accuracy with a stack hybrid classification of support vector machine (SVM) as meta-classifier of 96.50% compared to 68.83% of the previous result on a clinical dataset, Besides a compared model of CNN classification on MRI images dataset of 80.21%. The results showed the superiority of our CHFS model in predicting Alzheimer's disease more accurately with the clinical medical dataset in early-stage compared with the neuroimaging (MRI) dataset. The results of the proposed model were able to predict with accurately classify Alzheimer's clinical samples at a low cost in comparison with the MRI-CNN images model at the early stage and get a good indicator for high classification rate for MRI images when applying our proposed model of SHC.

An approach to the assessment of probabilistic inference is described which quantifies the performance on the probability scale. From both information and Bayesian theory, the central tendency of an inference is proven to be the geometric mean of the probabilities reported for the actual outcome and is referred to as the “Accuracy.” Upper and lower error bars on the accuracy are provided by the arithmetic mean and the -2/3 mean. The arithmetic is called the “Decisiveness” due to its similarity with the cost of a decision and the -2/3 mean is called the “Robustness”, due to its sensitivity to outlier errors. Visualization of inference performance is facilitated by plotting the reported model probabilities versus the histogram calculated source probabilities. The visualization of the calibration between model and source is summarized on both axes by the arithmetic, geometric, and -2/3 means. From information theory, the performance of the inference is related to the cross-entropy between the model and source distribution. Just as cross-entropy is the sum of the entropy and the divergence; the accuracy of a model can be decomposed into a component due to the source uncertainty and the divergence between the source and model. Translated to the probability domain these quantities are plotted as the average model probability versus the average source probability. The divergence probability is the average model probability divided by the average source probability. When an inference is over/under-confident, the arithmetic mean of the model increases/decreases, while the -2/3 mean decreases/increases, respectively.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

The Coronavirus pandemic has created complex challenges and adverse circumstances. This research discovers public sentiment amidst problematic socioeconomic consequences of the lockdown, and explores ensuing four potential sentiment associated scenarios. The severity and brutality of COVID-19 have led to the development of extreme feelings, and emotional and mental healthcare challenges. This research identifies emotional consequences - the presence of extreme fear, confusion and volatile sentiments, mixed along with trust and anticipation. It is necessary to gauge dominant public sentiment trends for effective decisions and policies. This study analyzes public sentiment using Twitter Data, time-aligned to COVID-19, to identify dominant sentiment trends associated with the push to 'reopen' the economy. Present research uses textual analytics methodologies to analyze public sentiment support for two potential divergent scenarios - an early opening and a delayed opening, and consequences of each. Present research concludes on the basis of exploratory textual analytics and textual data visualization, that Tweets data from American Twitter users shows more trust sentiment support, than fear, for reopening the US economy. With additional validation, this could present a valuable time sensitive opportunity for state governments, the federal government, corporations and societal leaders to guide the nation into a successful new normal future.

This paper develops Bayesian inference in reliability of a class of scale mixtures of log-normal failure time (SMLNFT) models with stochastic (or uncertain) constraint in their reliability measures. The class is comprehensive and includes existing failure time (FT) models (such as log-normal, log-Cauchy, and log-logistic FT models) as well as new models that are robust in terms of heavy-tailed FT observations. Since classical frequency approaches to reliability analysis based on the SMLNFT model with stochastic constraint are intractable, the Bayesian method is pursued utilizing a Markov chain Monte Carlo (MCMC) sampling based approach. This paper introduces a two-stage maximum entropy (MaxEnt) prior, which elicits a priori uncertain constraint and develops Bayesian hierarchical SMLNFT model by using the prior. The paper also proposes an MCMC method for Bayesian inference in the SMLNFT model reliability and calls attention to properties of the MaxEnt prior that are useful for method development. Finally, two data sets are used to illustrate how the proposed methodology works.

We describe an efficient and cost effective data access mechanism for Sentinel-1 TOPS 1 mode bursts. Our data access mechanism enables burst-based data access and processing, thereby 2 eliminating ESA’s Sentinel-1 SLC data packaging conventions as a bottleneck to large scale processing. 3 Pipeline throughput is now determined by available compute resources and efficiency of the analysis 4 algorithms. For targeted infrastructure monitoring studies, we are able to generate coregistered, 5 geocoded stacks of SLCs for any AOI in the world in a few minutes. In addition, we describe our 6 global scale radar backscatter and interferometric products and associated pipeline design decisions 7 that ensure geolocation consistency across the suite of derived products from Sentinel-1 data. Finally, 8 we discuss the benefits and limitations of working with geocoded SAR SLC data.

Software analysis, debugging, and reverse engineering have a crucial impact in today’s software industry. Efficient and stealthy debuggers are especially relevant for malware analysis. However, existing debugging platforms fail to address a transparent, effective, and high-performance low-level debugger due to their detectable fingerprints, complexity, and implementation restrictions. In this paper, we present HyperDbg, a new hypervisor-assisted debugger for high-performance and stealthy debugging of user and kernel applications. To accomplish this, HyperDbg relies on state-of-the-art hardware features available in today’s CPUs, such as VT-x and extended page tables. In contrast to other widely used existing debuggers, we design HyperDbg using a custom hypervisor, making it independent of OS functionality or API. We propose hardware-based instruction-level emulation and OS-level API hooking via extended page tables to increase the stealthiness. Our results of the dynamic analysis of 10,853 malware samples show that HyperDbg’s stealthiness allows debugging on average 22% and 26% more samples than WinDbg and x64dbg, respectively. Moreover, in contrast to existing debuggers, HyperDbg is not detected by any of the 13 tested packers and protectors. We improve the performance over other debuggers by deploying a VMX-compatible script engine, eliminating unnecessary context switches. Our experiment on three concrete debugging scenarios shows that compared to WinDbg as the only kernel debugger, HyperDbg performs step-in, conditional breaks, and syscall recording, 2.98x, 1319x, and 2018x faster, respectively. We finally show real-world applications, such as a 0-day analysis, structure reconstruction for reverse engineering, software performance analysis, and code-coverage analysis.

This paper proposes a crack recognition method based on high-resolution line array cameras and adaptive lifting algorithm. By defining the crack rate, this algorithm calculates the ratio of the crack area to the area of the entire collected image to characterize the damage extent of the current section. The algorithm first uses image preprocessing to reduce the image noise, then uses histogram equalization to enhance the feature of the crack region, divides the whole image into multiple sub-blocks, and extracts region features in the sub-block. At the same time, this algorithm defines related feature descriptors, and constructs weak classifiers according to each feature descriptor, and converts the weak classifiers into strong classifiers by using an adaptive lifting algorithm. Finally, this algorithm realizes the division of the crack regions. Experimental results show that the proposed algorithm can meet the actual needs and is better than other classical algorithms.

Websites and applications use personalisation services to profile their users, collect their patterns and activities and eventually use this data to provide tailored suggestions. User preferences and social interactions are therefore aggregated and analysed. Every time a user publishes a new post or creates a link with another entity, either another user, or some on-line resource, new information is added to the user profile. Exposing private data does not only reveal information about single users' preferences, increasing their privacy risk, but can expose more about their network that single actors intended. This mechanism is self-evident on \emph{social networks} where users receive suggestions based on their friends' activity. We propose an information theoretic approach to measure the differential update of the anonymity risk for time-varying user profiles. This expresses how privacy is affected when new content is posted and how much third party services get to know about the users when a new activity is shared. We use real Facebook data to show how our model can be applied on a real world scenario.

Regulators require financial institutions to estimate counterparty default risks from liquid CDS quotes for the valuation and risk management of OTC derivatives. However, the vast majority of counterparties do not have liquid CDS quotes and need proxy CDS rates. Existing methods cannot account for counterparty-specific default risks; we propose to construct proxy CDS rates by associating to illiquid counterparty liquid CDS Proxy based on Machine Learning Techniques. After testing 156 classifiers from 8 most popular classifier families, we found that some classifiers achieve highly satisfactory accuracy rates. Furthermore, we have rank-ordered the performances and investigated performance variations amongst and within the 8 classifier families. This paper is, to the best of our knowledge, the first systematic study of CDS Proxy construction by Machine Learning techniques, and the first systematic classifier comparison study based entirely on financial market data. Its findings both confirm and contrast existing classifier performance literature. Given the typically highly correlated nature of financial data, we investigated the impact of correlation on classifier performance. The techniques used in this paper should be of interest for financial institutions seeking a CDS Proxy method, and can serve for proxy construction for other financial variables. Some directions for future research are indicated.

Wireless communication has proliferated due to the colossal augmentation of smart phones, mobile phones, tablets and laptops etc. Multimedia applications such as live videos, audios, still images, animated graphics and live communications all requires accompaniments of quality of service (QoS) as well as reliable end-to-end transfer of data. Information about the availability of resources in channel is must in order to improve the QoS. QoS can be determined in terms of capacity of channel, available bandwidth (ABW), and bulk transfer capacity (BTC). Bandwidth availability is a key check for improving the QoS in a network. The performance of a multimedia application is directly affected by the bandwidth availability. One of the most important QoS characteristic is ABW at a wireless route and it can be demarcated as least unused capacity of links instituting a network route. Since now there have been many bandwidth estimation techniques are available in the literature to increase the network performance. Bandwidth estimation techniques have been arranged into three leading classifications: i) Active probing bandwidth estimation techniques, ii) Passive bandwidth estimation technique and iii) Model based bandwidth estimation techniques. Each of these techniques are briefly discussed in this paper.

We describe a multi-resolution approach for audio classification and illustrate its application to the open data set for environmental sound classification. The proposed approach utilizes a multi-resolution based ensemble consisting of targeted feature extraction of approximation (coarse scale) and detail (fine scale) portions of the signal under the action of multiple transforms. This is paired with an automatic machine learning engine for algorithm and parameter selection and the LSTM algorithm, capable of mapping several sequences of features to a predicted class membership probability distribution. Initial results show an improvement in multi-class classification accuracy.

The digital world has a wealth of data, such as Internet of Things (IoT) data, business data, health data, mobile data, urban data, security data, and many more, in the current age of the Fourth Industrial Revolution (Industry 4.0 or 4IR). Extracting knowledge or useful insights from these data can be used for smart decision-making in various applications domains. In the area of data science, advanced analytics methods including machine learning modeling can provide actionable insights or deeper knowledge about data, which makes the computing process automatic and smart. In this paper, we present a comprehensive view on "Data Science'' including various types of advanced analytics methods that can be applied to enhance the intelligence and capabilities of an application through smart decision-making in different scenarios. We also discuss and summarize ten potential real-world application domains including business, healthcare, cybersecurity, urban and rural data science, and so on by taking into account data-driven smart computing and decision making. Based on this, we finally highlight the challenges and potential research directions within the scope of our study. Overall, this paper aims to serve as a reference point on data science and advanced analytics to the researchers and decision-makers as well as application developers, particularly from the data-driven solution point of view for real-world problems.

Short Message Service (SMS) is becoming the secure medium of communication due to large-scale global coverage, reliability, and power efficiency. As person--to--person (P2P) messaging is less secure than application-to-person (A2P) messaging, anyone can send a message, leading to the attack. Attackers mistreat this opportunity to spread malicious content, perform harmful activities, and abuse other people, commonly known as spam. Moreover, such messages can waste a lot of time, and important messages are sometimes overlooked. As a result, accurate spam detection in SMS and its computational time are burning issues. In this paper, we conduct six different experiments to detect SMS spam from the dataset of 5574 messages using machine learning classifiers such as Multinomial Naïve Bayes (MNB) and Support Vector Machine (SVM), considering variations of \textit{Term Frequency-- Inverse Document Frequency (TF--IDF)} features for exploring the trade-off among accuracy, F1-score and computational time. The experiments achieve the best result of the accuracy of 98.50\%, F1--score of 98\%, and area under roc curve (AUC) of 0.97 for multinomial naïve bayes classifier with TF--IDF after stemming.

It is very difficult to accurately divide farmland and woodland in Gaofen 2 (GF-2) remote sensing image, because their single plant coverage is very small, and their spectra are very similar. The ratio of spatial resolution and one plant’s coverage area must be fully taken into account when designing the Convolutional Neural Network structure for extracting them from GF-2 image. We establish a Convolutional Encode Neural Networks model (CENN), The first layer has two sets of convolution kernels to learn the characteristics of farmland and woodland respectively, while the second layer is the encoder to encode the characteristics by transfer function, which can map the results to the corresponding category number. In the training stage, samples of farmland, woodland, and other categories are categorically used to train CENN, as soon as training is accomplished, CENN would acquire enough ability to accurately extract farmland and woodland from remote sensing images. The final extraction result is obtained by implementing per-pixel segmentation of images used to train the CENN. CENN is compared and analyzed with others such as Deep Belief Network (DBN), Full Convolutional Network (FCN), Deeplab Model. The results of experiments show that CENN can more accurately mine the characteristics of farmland and woodland, and it achieves its goal of extracting farmland and woodland with high precision from GF-2 images.

The mitigation of NLOS (non-line-of-sight) propagation conditions is one of main challenges in wireless signals based indoor localization. When RFID localization technology is applied in applications, RSS fluctuates frequently due to the shade and multipath effect of RF signal, which could result in localization inaccuracy. In particularly, when tags carriers are walking in LOS (line-of-sight) and NLOS hybrid environment, great attenuation of RSS will happen, which would result in great location deviation. The paper proposes an IMU-assisted (Inertial Measurement Unit) RFID based indoor localization in LOS/NLOS hybrid environment. The proposed method includes three improvements over previous RSS based positioning methods: IMU aided RSS filtering, IMU aided LOS/NLOS distinguishing and IMU aided LOS/NLOS environment switching. Also, CRLB (Cramér-Rao Low Bound) is calculated to prove theoretically that indoor positioning accuracy for proposed method in LOS/NLOS mixed environment is higher than position precision of only use RSS information. Simulation and experiments are conducted to show that proposed method can reduce the mean positioning error to around 3 meters without site survey.

Implications of the novel usage adoption of the internet of things in various sectors of works and life are researched and documented at pace. This is related to the overall high rate at which new technologies are adopted in modern society. Healthcare is a vital aspect of everyday activities and as such overlaps with the increasingly important role played by use of the internet and associated technologies. The purpose of this review article is to draw attention to the potential social, ethical, legal and professional limitations to using IoT in the context of healthcare. The social and ethical aspects in particular, focus on IoT usage in care of the elderly with relevant case studies as reference.

Human detection from Unmanned Aerial Vehicles (UAV) is gaining popularity in the field of disaster management, crowd counting, people monitoring. Real time human detection from UAV is a challenging task, because of many constraints involved. This study proposes a system for real time detection of humans on videos captured from UAVs addressing three of these constraints namely, flying height, computation time and scale of viewing. The proposed method integrated an android application with a binary classifier based on Haar-features to automatically detect human / non-human class from UAV images. The video frames were parsed and detected humans from image frames were geo-localized and visualized on Google Earth. The performance was evaluated for geo-localization accuracy, computation time and detection accuracy, considering human coverage – pixel size relationship for various heights and scale factor. Based on flying height - human size relationship and tradeoff between detection accuracy vs computation time, the study came up with optimal parameters for OpenCV’s cv2.cascadeClassifier. detectMultiScale function. This paper establishes a strong ground for further research relating to real time human detection from UAV.

Personal health data is acquired, processed, stored, and accessed using a variety of different devices, applications, and services. These are often complex and highly connected. Therefore, use or misuse of the data is hard to detect for people, if they are not capable to understand the trace (i.e., the provenance) of that data. We present a visualization technique for personal health data provenance using comics strips. Each strip of the comic represents a certain activity, such as entering data using a smartphone application, storing or retrieving data on a cloud service, or generating a diagram from the data. The comic strips are generated automatically using recorded provenance graphs. The easy-to-understand comics enable all people to notice crucial points regarding their data such as, for example, privacy violations.

The mutual information between the state of a neural network and the state of the external world represents the amount of information stored in the neural network that is associated with the external world. In contrast, the surprise of the sensory input indicates the unpredictability of the current input. In other words, this is a measure of inference ability, and an upper bound of the surprise is known as the variational free energy. According to the free-energy principle (FEP), a neural network continuously minimizes the free energy to perceive the external world. For the survival of animals, inference ability is considered to be more important than simply memorized information. In this study, the free energy is shown to represent the gap between the amount of information stored in the neural network and that available for inference. This concept involves both the FEP and the infomax principle, and will be a useful measure for quantifying the amount of information available for inference.

In era of ever-expanding data and knowledge, we lack a centralized system that maps all the faculties to their research works. This problem has not been addressed in the past and it becomes challenging for students to connect with the right faculty of their domain. Since we have so many colleges and faculties this lies in the category of big data problem. In this paper, we present a model which works on the distributed computing environment to tackle big data. The proposed model uses apache spark as an execution engine and hive as database. The results are visualized with the help of Tableau that is connected to Apache Hive to achieve distributed computing.

Social recommendation is almost as the integration of the business platform and social platform, and gradually become a top in recommendation system. Social recommendation algorithm solves the problem of cold start and data sparseness for traditional commodity, while the internal structure of the relationship graph in social relations has not been fully excavated. This paper proposes two models of Micro Relation Transfer Model and Macro Relation Transfer Model of social relations, and applies the social relations transfer models into the social recommendation system. A relationship graph is built from the relationship between customers on the Internet. Micro Relation Transfer Model establishes the transfer activation function by calculating the relationship between the two customers using the similarity of interests set. Micro Relation Transfer Model spreads the relationship of friends by calculating the proportion of common neighbors held by the customer's social relations. In order to effectively control the transmission range and effect of social relations graph, we introduce pruning algorithm based on Monte Carlo Decision Tree convergence algorithm. The experimental results show that SRRTC algorithm enhances the success rate and stability significantly.

The majority of E-commerce transactions reveal private information such as customers' identities, order contents, and payment information during the transaction. Other personal information such as health conditions, religion, and even ethnicity may be also deduced. Even when deploying electronic cryptocurrencies such as Bitcoin, anonymity cannot be fully guaranteed. Also, many anonymous payment schemes suffer from possible double spending circumstances. E-commerce privacy is basically a difficult problem as it involves parties with concurring interests. Three major e-commerce requirements are highly difficult to resolve: anonymous purchase, anonymous delivery, and anonymous payment. This work presents a possible e-commerce system addressing all three anonymity requirements for electronic-items business on open networks. The system offers anonymous entities authentication mechanisms up to completing a fair anonymous e-commerce transaction. The system is based on deploying a physically clone-resistant hardware token for each relevant involved party. The tokens are made clone-resistant by accommodating a Secret Unknown Cipher (SUC) in each hardware-token as a digital PUF-like identity. A set of novel generic system-setups for units, protocols and e-commerce schemes is introduced. The proposed anonymization is basically attained by virtually-replacing relevant e-commerce entities by low-cost, unique and clone-resistant tokens/units using SUCs. The units act as trustable anonymous, authenticated and non-replaceable entities monitored by their acting users.

Configurable process models are frequently used to represent business workflows and other discrete event systems among different branches of large organizations: they unify commonalities shared by all branches and describe their differences, at the same time. The configuration of such models is usually done manually, which is challenging. On the one hand, when the number of configurable nodes in the configurable process model grows, the size of the search space increases exponentially. On the other hand, the person performing the configuration may lack the holistic perspective to make the right choice for all configurable nodes at the same time, since choices influence each other. Nowadays, information systems that support the execution of business processes create event data reflecting how processes are performed. In this article, we propose three strategies (based on exhaustive search, genetic algorithms, and greedy heuristic) that use event data to automatically derive a process model from a configurable process model that better represents the characteristics of the process in a specific branch. These strategies have been implemented in our proposed framework, and tested in both business-like event logs as recorded in a higher educational ERP system, and a real case scenario involving a set of Dutch municipalities.

Environmental policy involving citizen science (CS) is of growing interest. In support of this open data stream, validation or quality assessment of the CS data and their appropriate usage for evidence-based policy making, needs a flexible and easily adaptable data curation process ensuring transparency. Addressing these needs, this paper describes an approach for automatic quality assurance as proposed by the Citizen OBservatory WEB (COBWEB) FP7 project. This approach is based upon a workflow composition that combines different quality controls, each belonging to seven categories or ‘pillars’. Each pillar focuses on a specific dimension in the types of reasoning algorithms for CS data qualification. These pillars attribute values to a range of quality elements belonging to three complementary quality models. Additional data from various sources, such as Earth Observation (EO) data, are often included as part of the inputs of quality controls within the pillars. However, qualified CS data can also contribute to the validation of EO data. Therefore, the question of validation can be considered as ‘two sides of the same coin’. Based on an invasive species CS study, concerning Fallopia japonica (Japanese knotweed), the paper discusses the flexibility and usefulness of qualifying CS data, either when using an EO data for the validation within the quality assurance process, or validating an EO data product that describes the risk of occurrence of the plant. Both validation paths are found to be improved by quality assurance of the CS data. Addressing the reliability of CS open data, issues and limitations of the role of quality assurance for validation, due to the quality of secondary data used within the automatic workflow, are described, e.g. error propagation, paving the route to improvements in the approach.

One of the most important factors impacting quality of content in Wikipedia is presence of credible sources. By following references readers can verify facts or find more details about described topic. A Wikipedia article can be edited independently in any of over 300 languages, even by anonymous users, therefore information about the same topic may be inconsistent. This also applies to use of references in different language versions of a particular article, so the same statement can have different sources. In this paper we analyzed over 40 million articles from the 55 most developed language versions of Wikipedia to extract information about nearly 200 million references and find the most popular and reliable sources. We presented 10 models for the assessment of the popularity and reliability of the sources based on analysis of meta information about the references in Wikipedia articles, page views and authors of the articles. Using DBpedia and Wikidata we automatically identified the alignment of the sources to a specific domain. Additionally, we analyzed the changes of popularity and reliability in time and identified growth leaders in each considered months. The results can be used for quality improvements of the content in different languages versions of Wikipedia.

Management of demand and capacity for airport operation is important. The effect of capacity setting on slot adjustment, maximum adjustment and flight delay has been extensively investigated and discussed in previous slot adjustment models. But its effect on characteristics of flight waves has not been studied deeply. At present, in order to resolve the problem that Linear Integer Programming (LIP) is limited in slot allocation due to its fast dimension growth and large memory consumption, the general practice is to optimize the slot application according to data-splitting technology. However, the relationship among data splitting method, capacity setting and characteristics of slot wave has not been investigated in detail, which limits the application of LIP in slot allocation. Through the detailed analysis and testing, we found that the waveform and amplitude of slot wave can be controlled and designed by appropriate virtual capacity settings, while the number of capacity constraints and the computing time is reduced by adopting appropriate data feeding method. Our research also provides clues for further research on the construction of the flight waves for airlines operating at specific airports in order to establish direct or indirect connectivity, and increase hit rate by using our approaches.

Currently, most middleware application developers have two choices when designing or implementing API services: They can either stick with REST or explore the emerging GraphQL technology. Although REST is widely considered the standard method for API development, GraphQL is believed to overcome the main drawbacks of REST, especially data fetching issues. Yet, doubts remain as there are no experimental studies with convincing results to evaluate the performance of the two services. In this paper, we propose a research methodology to evaluate the performance of REST and GraphQL API services, which includes two main contributions. The first contribution is that the performance evaluation of the two services is conducted in the real operation of a massive and intensively accessible management information system. The second contribution is the fair and independent performance evaluation results obtained for both API services. The performance evaluation was studied using basic measures of QoS, including response time, throughput, CPU load, and memory usage. The results show that REST is still faster in response time and throughput, while GraphQL is very efficient in resource utilization, i.e., CPU load and memory utilization. Therefore, GraphQL is the right choice when data requirements change frequently and resource utilization is the most important consideration. REST is used when some data is frequently accessed called by multiple requests.

As technology evolves, our digital footprint keeps increasing. Now, everything we do is largely related to us being online, connected and logged. Therefore, if someone’s online data is exposed, then their life will be compromised. This is called identity theft and in this era of technology, it has become one of the most serious forms of crime. When someone’s data is compromised, there is a huge chance of harming the person financially, morally and socially. New technology and the knowledge gap it creates when it first comes out is perfect for identity thieves to exploit. If we are not cautious, our future will be very different than what we dream of due to the very technology created to make it better. Hence, we need to understand the technology, identify the loopholes and educate ourselves to avoid being held captive by our digital footprint.

Load balancing, energy efficiency and fault tolerance are among the most important data dissemination issues in Wireless Sensor Networks (WSNs). In order to successfully cope with the mentioned issues, two main approaches (namely, Data-centric Storage and Distributed Data Storage) have been proposed in the literature. Both approaches suffer from data loss due to memory and/or energy depletion in the storage nodes. Even though several techniques have been proposed so far to overcome the mentioned problems, the proposed solutions typically focus on one issue at a time. In this paper, we integrate the Data-centric Storage (DCS) features into Distributed Data Storage (DDS) mechanisms and present a novel approach, denoted as Collaborative Memory and Energy Management (CoMEM), to overcome both problems and bring memory and energy efficiency to the data loss mechanism of WSNs. We also propose analytical and simulation frameworks for performance evaluation. Our results show that the proposed method outperforms existing approaches in various WSN scenarios.

Over the last decade the blockchain technology has emerged to provide solutions to the complexity and privacy challenges of using distributed databases. It reduces the cost for customers by eliminating intermediaries and builds the trust in peer-to-peer communications. Over this time, the concept of blockchain has shifted greatly due to its potential in business growth for enterprises and the rapidly evolving applications in a collaborative smart cities' ecosystem, healthcare, and governance. Many platforms, with different architectures and consensus protocols, have been introduced. Consequently, it becomes challenging for an application developer to choose the right platform. Furthermore, blockchain has misaligned with the goals for efficient green collaborative digital ecosystem. Therefore, it becomes critical to address this gap and to build new frameworks to align blockchain with those goals. In this paper, we discuss the evolution of blockchain architecture and consensus protocols, bringing a retrospective analysis and discussing the rationale of the evolution of the various architectures and protocols, as well as capturing the assumptions conducting to their development and contributions to building collaborative applications. We introduce a classification of those architectures helping developers to choose a suitable platform for applications and providing insights for future research directions in the field to build new frameworks.

Prediction of stock groups values has always been attractive and challenging for shareholders. This paper concentrates on the future prediction of stock market groups. Four groups named diversified financials, petroleum, non-metallic minerals and basic metals from Tehran stock exchange are chosen for experimental evaluations. Data are collected for the groups based on ten years of historical records. The values predictions are created for 1, 2, 5, 10, 15, 20 and 30 days in advance. The machine learning algorithms utilized for prediction of future values of stock market groups. We employed Decision Tree, Bagging, Random Forest, Adaptive Boosting (Adaboost), Gradient Boosting and eXtreme Gradient Boosting (XGBoost), and Artificial neural network (ANN), Recurrent Neural Network (RNN) and Long short-term memory (LSTM). Ten technical indicators are selected as the inputs into each of the prediction models. Finally, the result of predictions is presented for each technique based on three metrics. Among all algorithms used in this paper, LSTM shows more accurate results with the highest model fitting ability. Also, for tree_based models, there is often an intense competition between Adaboost, Gradient Boosting and XGBoost.

To generate a probability density function (PDF) for fitting probability distributions of real data, this study proposes a deep learning method which consists of two stages: (1) a training stage for estimating the cumulative distribution function (CDF) and (2) a performing stage for predicting the corresponding PDF. The CDFs of common probability distributions can be adopted as activation functions in the hidden layers of the proposed deep learning model for learning actual cumulative probabilities, and the differential equation of trained deep learning model can be used to estimate the PDF. To evaluate the proposed method, numerical experiments with single and mixed distributions are performed. The experimental results show that the values of both CDF and PDF can be precisely estimated by the proposed method.

In this paper, firstly, some questionable formulas and conceptual oversights of previous reduced sigma set unscented transformation (UT) methods are revised through theoretical analysis. Then the revised UT methods based Kalman filters are used in a GPS/INS tightly-coupled system. The Kalman filter flows are the kind of square-root, since the square-root unscented Kalman filters (SRUKFs) can guarantee the stability of the system. By using the reduced sigma set SRUKFs (which contain simplex sigma set square-root unscented Kalman filter (S-SRUKF), spherical simplex sigma set square-root unscented Kalman filter (SS-SRUKF) and minimum sigma set square-root unscented Kalman filter (M-SRUKF)), the computation cost is greatly saved compared with the standard SRUKF, while the accuracy of the GPS/INS tightly-coupled system still maintained. The structure of the GPS/INS tightly-coupled system is in the form of error state, and the time updates of the state and the state covariance of SRUKFs are directly estimated without using UT, thus the computational time is also greatly saved. The pseudo-satellite is introduced to aid the system when the observation information is deficient, for example, when the GPS signal is deficient in the maneuver environment. By using the pseudo-satellite, the optimal performance of the system is guaranteed. Experiment of unmanned aerial vehicle (UAV) showed that the pseudo-satellite aided mechanism worked well.

In recent years, governments applied intelligent transportation system (ITS) technique to provide several convenience services (e.g., garbage truck app) for residents. This study proposes a garbage truck fleet management system (GTFMS) and data feature selection and data clustering methods for travel time prediction. A GTFMS includes mobile devices (MD), on-board units, fleet management server, and data analysis server (DAS). When user uses MD to request the arrival time of garbage truck, DAS can perform the procedure of data feature selection and data clustering methods to analyses travel time of garbage truck. The proposed methods can cluster the records of travel time and reduce variation for the improvement of travel time prediction. After predicting travel time and arrival time, the predicted information can be sent to user’s MD. In experimental environment, the results showed that the accuracies of previous method and proposed method are 16.73% and 85.97%, respectively. Therefore, the proposed data feature selection and data clustering methods can be used to predict stop-to-stop travel time of garbage truck.

The Release of government dataset for public use can potentially strengthen the relationship between the government and its constituents. However, research shows that there are several challenges for open data effectiveness. This paper reviews current determinants and issues associated with the open government data (OGD) procedures. The review concentrates on two ends of the spectrum: First, from the perspective of the preparation by the government, focusing on the organization of traditional governmental datasets and how the recording of the data is administered. Second, from the perspective of the users, focusing on the way in which the data is released to the general public and on human-computer interaction (HCI) issues between end-user and data-consumption interfaces. Following a thorough analysis of these two opposing challenges, the paper proposes approaches to mitigate them. This review and subsequent recommendations contribute and expand current understanding of open government data effectiveness and can lead to public policy changes, development of new procedures and strategies, and ultimately improvements at both ends of the federal open data endeavor.

Recently, spam emails have become a significant problem with the expanding usage of the Internet. It is to some extend obvious to filter emails. A spam filter is a system that detects undesired and malicious emails and blocks them from getting into the users' inboxes. Spam filters check emails for something "suspicious" in terms of text, email address, header, attachments, and language. However, we have used different features such as word2vec, word n-grams, character n-grams, and a combination of variable length n-grams for comparative analysis in our proposed approach. Different machine learning models such as support vector machine (SVM), decision tree (DT), logistic regression (LR), and multinomial naïve bayes (MNB) are applied to train the extracted features. We use different evaluation metrics such as precision, recall, f1-score, and accuracy to evaluate the experimental results. Among them, SVM provides 97.6 \% of accuracy, 98.8\% of precision, and 94.9\% of f1-score using a combination of n-gram features.

This paper presents a method for a decentralised peer-to-peer software license validation system using cryptocurrency blockchain technology to ameliorate software piracy, and to provide a mechanism for software developers to protect copyrighted works. Protecting software copyright has been an issue since the late 1970's and software license validation has been a primary method employed in an attempt to minimise software piracy and protect software copyright. The method described creates an ecosystem in which the rights and privileges of participants are observed.

COVID-19 has a severe risk of spreading rapidly, the quick identification of which is essential. In this regard, chest radiology images have proven to be a practical screening approach for COVID-19 affected patients. This study proposes a deep learning-based approach using Densenet-121 to detect COVID-19 patients effectively. We have trained and tested our model on the COVIDx dataset and performed both 2-class and 3-class classification, achieving 96.49% and 93.71% accuracy, respectively. By successfully utilizing transfer learning, we achieve comparable performance to the state-of-the-art method while using 15x fewer model parameters. Moreover, we performed an interpretability analysis using Grad-CAM to highlight the most significant image regions at test time. Finally, we developed a website that takes chest radiology images as input and detects the presence of COVID-19 or pneumonia and a heatmap highlighting the infected regions. Source code for reproducing results and model weights are available.

Cognitive Computing has become somewhat of a rallying call in the technology world, with the promise of new smart services offered by industry giants like IBM and Microsoft. The recent technological advances in Artificial Intelligence (AI) have thrown into the public sphere some old questions about the relationship between machine computation and human intelligence. Much of the industry and media hype suggests that many traditional challenges have been overcome. On the contrary, our simple examples from language processing demonstrate that present day Cognitive Computing still struggles with fundamental, long-standing problems in AI. An alternative interpretation of cognitive computing is presented, following Licklider's lead in adopting man-computer symbiosis as a metaphor for designing software systems that enhance human cognitive performance. A survey of existing proposals on this view suggests a distinction between weak and strong versions of symbiosis. We propose a Strong Cognitive Symbiosis which dictates an interdependence rather than simply cooperation between human and machine functioning, and introduce new software systems which were designed for cognitive symbiosis. We conclude that strong symbiosis presents a viable new perspective for the design of cognitive computing systems.

LIFI was first introduce by Professor Harald Haas on July 2011. Light fidelity (LI-FI) may be a technology which uses light as a medium to travel from one place to a different. It uses Light like Light Emitting Diode (LED) visible radiation Communication (VLC) for data Transferring and Internet connection. LIFI may be a technique which uses light as a medium because it uses light to travel it's 20 times faster than any WIFI within the world. during this paper we speak about things like what's LIFI and the way it's better then WIFI why we want LIFI and What changes did bring LIFI in our Future LIFI. How it'll make IOT devices far better than before The Technique to implement LIFI and also the problem we face of implementation of LIFI

In recent years, online social networks have received important consideration in spatial modelling fields given the critical information that can be extracted from them for events in real time; one of the most latent issues is that regarding various natural disasters such as earthquakes. Although it is possible to retrieve data from these social networks with embedded geographic information provided by GPS, in many cases this is not possible. An alternative solution is to reconstruct specific locations using probabilistic language models, more specifically those based on Name Entity Recognition (NER), which extracts names from a user’s description about an event occurring in a specific place (e.g., a collapsed building on a specific avenue). In this work, we present a methodology to use twitter as a social sensor system for disasters. The methodology scores NER locations with a kernel density estimation function for different subtopics originating from a natural disaster and that maps them into a geographic space is proposed. The proposed methodology is evaluated with tweets related to the 2017 earthquake in Mexico.

In recent years, CPU caches have revealed themselves as one of the most powerful sources of information leakage. This information leakage affects any implementation whose memory accesses, to data or instructions, depend on sensitive information such as private keys. In most cases, side-channel cache attacks do not require any specific permission and just need access to a shared cache. This fact, combined with the spread of cloud computing, where the infrastructure is shared between different customers, have made these attacks quite popular. In this paper, we present a novel approach to exploit the information obtained from the CPU cache. First, we introduce a non-access attack that provides a 97\% reduction in the number of encryptions required to obtain a 128-bit AES key. Next, this attack is adapted and extended in what we call the encryption-by-decryption cache attack or EBD, to obtain a 256-bit AES key. When EBD is applied to AES-256, we are able to obtain the 256 bits of the key with less than 10000 encryptions. These results make EBD, to the best of our knowledge, the first practical attack on AES-256 and also demonstrate that AES-256 is only about 3 times more complex to attack than AES-128 via cache attacks. In both cases the target is the AES T-table-based implementation, and we also demonstrate that our approach works in a cross-VM scenario.

Medical health systems have been concentrating on artificial intelligence techniques for speedy diagnosis. However, the recording of health data in a standard form still requires attention so that machine learning can be more accurate and reliable by considering multiple parameters. The aim of this study is to develop a general framework for recording diagnostic data in an international standard format to facilitate auto-prediction of eye diseases. Efforts were made to ensure error-free data entry by developing a user-friendly interface. Furthermore, different machine learning algorithms were used to analyze patient data based on multiple parameters, including age, illness history, and clinical observations. This data was formatted according to structured hierarchies designed by medical experts, whereas diagnosis was made as per the ICD-10 coding developed by the American Academy of Ophthalmology. Furthermore, the system is designed to evolve through self-learning by adding new classifications for both diagnosis and symptoms. The classification results from tree-based methods demonstrated that the proposed framework performs satisfactorily given a sufficient amount of data. The random forest and decision tree algorithms predicted more accurately as compared to neural networks and the na{\"i}ve Bayes algorithm owing to structured data arrangement.

The success of a software system is highly dependent upon its quality which is a very critical aspect and is the ultimate goal to be achieved. Defect Management is the most important process in ensuring software quality, it involves defect detection, defect categorization, defect prioritization, defect removal and defect verification. The main purpose of this process is to develop and produce defect free or least defected software systems of high quality. It plays a vital role in gaining customer confidence and satisfaction which is essential for the reputation of the organization developing the system. The central objective of this study is to explain the importance of defect management and its impact on the quality of the software along with various defect management techniques to support the objective.