Search

Author summary Conferences are great venues for disseminating algorithmic bioinformatics results, but they unfortunately do not offer an opportunity to make major revisions in the way that journals do. As a result, it is not possible for authors to fix mistakes that might be easily correctable but nevertheless can cause the paper to be rejected. As a reviewer, I wish that I had the opportunity to tell the authors, “Hey, you forgot to do this really important thing, without which it is hard to accept the paper, but if you could go back and fix it, you might have a great paper for the conference.” This lack of a back and forth can be especially problematic for first-time submitters or those from outside the field, e.g., biologists. In this article, I outline Ten Simple Rules to follow when writing an algorithmic bioinformatics conference paper to avoid having it rejected.

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. © 2019 Howison et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

The Semantic Link Network is a general semantic model for modeling the structure and the evolution of complex systems. Various semantic links play different roles in rendering the semantics of complex system. One of the basic semantic links represents cause-effect relation, which plays an important role in representation and understanding. This paper verifies the role of the Semantic Link Network in representing the core of text by investigating the contribution of cause-effect link to representing the core of scientific papers. Research carries out with the following steps: (1) Two propositions on the contribution of cause-effect link in rendering the core of paper are proposed and verified through a statistical survey, which shows that the sentences on cause-effect links cover about 65% of key words within each paper on average. (2) An algorithm based on syntactic patterns is designed for automatically extracting cause-effect link from scientific papers, which recalls about 70% of manually annotated cause-effect links on average, indicating that the result adapts to the scale of data sets. (3) The effects of cause-effect link on four schemes of incorporating cause-effect link into the existing instances of the Semantic Link Network for enhancing the summarization of scientific papers are investigated. The experiments show that the quality of the summaries is significantly improved, which verifies the role of semantic links. The significance of this research lies in two aspects: (1) it verifies that the Semantic Link Network connects the important concepts to render the core of text; and, (2) it provides an evidence for realizing content services such as summarization, recommendation and question answering based on the Semantic Link Network, and it can inspire relevant research on content computing.

Quantifying the impact of a scholarly paper is of great significance, yet the effect of geographical distance of cited papers has not been explored. In this paper, we examine 30,596 papers published in Physical Review C, and identify the relationship between citations and geographical distances between author affiliations. Subsequently, a relative citation weight is applied to assess the impact of a scholarly paper. A higher-order weighted quantum PageRank algorithm is also developed to address the behavior of multiple step citation flow. Capturing the citation dynamics with higher-order dependencies reveals the actual impact of papers, including necessary self-citations that are sometimes excluded in prior studies. Quantum PageRank is utilized in this paper to help differentiating nodes whose PageRank values are identical. Refereed/Peer-reviewed

With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs.

Research paper recommenders emerged over the last decade to ease finding publications relating to researchers' area of interest. The challenge was not just to provide researchers with very rich publications at any time, any place and in any form but to also offer the right publication to the right researcher in the right way. Several approaches exist in handling paper recommender systems. However, these approaches assumed the availability of the whole contents of the recommending papers to be freely accessible, which is not always true due to factors such as copyright restrictions. This paper presents a collaborative approach for research paper recommender system. By leveraging the advantages of collaborative filtering approach, we utilize the publicly available contextual metadata to infer the hidden associations that exist between research papers in order to personalize recommendations. The novelty of our proposed approach is that it provides personalized recommendations regardless of the research field and regardless of the user's expertise. Using a publicly available dataset, our proposed approach has recorded a significant improvement over other baseline methods in measuring both the overall performance and the ability to return relevant and useful publications at the top of the recommendation list.

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a "dying" paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing "offspring". Practically, this might be used to trace the successive published milestones of a research field., SCOPUS: ar.j, info:eu-repo/semantics/published

In this paper, a two-stage filter for removing salt-and-pepper noise using noise detector based on characteristic difference parameter and adaptive directional mean filter is proposed. The first stage firstly detects the noise corrupted pixels by combining characteristic difference parameter and gray level extreme, then develops an improved adaptive median filter to firstly restore them. The second stage introduces a restoration scheme to further restore the noise corrupted pixels, which firstly divides them into two types and then applies different restoration skills for the pixels based on the classification result. One type of pixels is restored by the mean filter and the other type of pixels is restored by the proposed adaptive directional mean filter. The new filter firstly adaptively selects the optimal filtering window and direction template, then replaces the gray level of noise corrupted pixel by the mean value of pixels on the optimal template. Experimental results show that the proposed filter outperforms many existing main filters in terms of noise suppression and detail preservation.

PurposeThe aim of the paper is to identify management practices that are characteristic for SMEs that achieve market success measured by their business performance in last their years of their operation analyze the relationships between management practices applied in small and medium-sized enterprises and their success measured by their business performance drawing on the data from 2710 SMEs operating on the Polish market.Approach/Methodology/DesignA cluster analysis was used to distinguish homogenous SME groups in view of their management practices. We examined differences between groups in terms of their business performance. The HINoV algorithm allowed six variables to be selected out of 32 management practices chosen initially for testing, with these variables providing the basis for grouping. Modal values and medians were calculated for 17 business performance measures in the three clusters produced. The subsequent analysis of those findings was focused on capturing significant differences.FindingsIn the group of 2710 Polish SMEs, it was possible to verify that there existed an association between management practices in the field of modern HRM, computer systems supporting management and the company’s economic performance, as measured by an increase in net revenue and number of customers over the last three years. In clusters where the above mentioned practices were appreciated, modal and median values of the increase reported in net revenue and number of customers were significantly higher.Practical implicationsThe research has shown that at a time marked by a shortage of highly skilled personnel one should pay particular attention to building an integrated and committed team of workers and to employee empowerment. The research has also shown that SME managers monitor only a fraction of basic business performance measures, which may prove to be a major risk to SMEs.Originality/ValuePrevious studies have been largely conducted in a fragmentary manner, i.e. they were concerned with the relationships between the application of some practices (strategic management, BPR, entrepreneurial orientation, monitoring, etc.) and selected business effectiveness measures. In this paper, the research covered SME management practices from a variety of areas which were then compared with the entrepreneurs’ assessment as to whether the company’s economic condition changed over the last three years. It is also the first attempt in post-socialist economies to identify those SME management practices that are related to better economic results.

When keystroke dynamics are used for authentication, users tend to get different levels of security due to differences in the quality of their templates. This paper addresses this issue by proposing a metric to quantify the quality of keystroke dynamic templates. That is, in behavioral biometric verification, the user’s templates are generally constructed using multiple enrolled samples to capture intra-user variation. This variation is then used to normalize the distance between a set of enrolled samples and a test sample. Then a normalized distance is compared against a predefined threshold value to derive a verification decision. As a result, the coverage area for accepted samples in the original space of vector representation is discrete. Therefore, users with the higher intra-user variation suffer higher false acceptance rates (FAR). This paper proposes a metric that can be used to reflect the verification performance of individual keystroke dynamic templates in terms of FAR. Specifically, the metric is derived from statistical information of user-specific feature variations, and it has a non-decreasing property when a new feature is added to a template. The experiments are performed based on two public keystroke dynamic datasets comprising of two main types of keystroke dynamics: constrained-text and free-text, namely the CMU keystroke dynamics dataset and the Web-Based Benchmark for keystroke dynamics dataset. Experimental results based on multiple classifiers demonstrate that the proposed metric can be a good indicator of the template’s false acceptance rate. Thus, it can be used to enhance the security of the user authentication system based on keystroke dynamics.

Introduction Degenerative Cervical Myelopathy (DCM) is a common and disabling condition, with a relatively modest research capacity. In order to accelerate knowledge discovery, the AO Spine RECODE-DCM project has recently established the top priorities for DCM research. Uptake of these priorities within the research community will require their effective dissemination, which can be supported by identifying key opinion leaders (KOLs). In this paper, we aim to identify KOLs using artificial intelligence. We produce and explore a DCM co-authorship network, to characterise researchers’ impact within the research field. Methods Through a bibliometric analysis of 1674 scientific papers in the DCM field, a co-authorship network was created. For each author, statistics about their connections to the co-authorship network (and so the nature of their collaboration) were generated. Using these connectedness statistics, a neural network was used to predict H-Index for each author (as a proxy for research impact). The neural network was retrospectively validated on an unseen author set. Results DCM research is regionally clustered, with strong collaboration across some international borders (e.g., North America) but not others (e.g., Western Europe). In retrospective validation, the neural network achieves a correlation coefficient of 0.86 (p Discussion Analysis of the neural network shows that the nature of collaboration strongly impacts an author’s research visibility, and therefore suitability as a KOL. This also suggests greater collaboration within the DCM field could help to improve both individual research visibility and global synergy.

Grounding systems are critical in safeguarding people and equipment from power system failures. A grounding system’s principal goal is to offer the lowest impedance path for undesired fault current. Optimization of the grounding grid designs is important in satisfying the minimum cost of the grounding system and safeguarding those people who work in the surrounding area of the grounded installations. Currently, there is no systematic guidance or standard for grounding grid designs that include two-layer soil and its effects on grounding grid systems, particularly vertically layered soil. Furthermore, while numerous studies have been conducted on optimization, relatively limited study has been done on the problem of optimizing the grounding grid in two-layer soil, particularly in vertical soil structures. This paper presents the results of optimization for substation grounding systems using the Simulated Annealing (SA) algorithm in different soil conditions which conforms to the safety requirements of the grounding system. Practical features of grounding grids in various soil conditions discussed in this paper (uniform soil, two-layer horizontal soil, and two-layer vertical soil) are considered during problem formulation and solution algorithm. The proposed algorithm’s results show that the number of grid conductors in the X and Y directions (Nx and Ny), as well as vertical rods (Nr), can be optimized from initial numbers of 35% for uniform soil, 57% for horizontal two-layer soil for ρ1> ρ2, and 33% for horizontal two-layer soil for ρ1< ρ2, and 29% for vertical two-layer soil structure. In other words, the proposed technique would be able to utilize square and rectangle-shaped grounding grids with a number of grid conductors and vertical rods to be implemented in uniform, two-layer horizontal and vertical soil structure, depending on the resistivity of the soil layer.

At present, the rapier loom has gradually become the mainstream equipment in the manufacturing industry. In order to make the rapier loom realize automated production and further improve the production efficiency of the rapier loom, improve the programmability of the system, and reduce the cost of system maintenance. The thesis developed a rapier loom control system based on embedded soft PLC, and carried out experiments and applications in the field. The contribution and innovation of this paper is to develop a complete low-cost control system, and through a genetic algorithm optimized PID algorithm to complete the more effective control of the loom tension system. The embedded soft PLC system proposed in this paper reduces the overall maintenance cost of the system and improves the programmability of the system. This text carries on the systematic scheme design to the embedded soft PLC from the hardware system and the software system respectively. First, according to the actual requirements, this article designs the overall scheme of the embedded software PLC hardware system with STM32F407ZGT6 as the core. Then this article is based on the embedded soft PLC hardware platform, according to the international standard of industrial control programming, writes the embedded soft PLC low-level driver software. Secondly, this article analyzes the factors that affect the warp tension during the operation of the rapier loom, and proposes the use of genetic algorithm to optimize the warp tension control method of the traditional PID algorithm. Finally, we conducted verification tests and on-site application debugging for the entire set of rapier loom embedded soft PLC control system. We controlled the warp tension as the main experimental object. The results show that this control system effectively improves the control accuracy of the warp tension of the rapier loom and meets the actual needs of industrial applications. The whole system has a good application prospect in the warp tension control of rapier looms.

Over the last decade the availability of SNP-trait associations from genome-wide association studies has led to an array of methods for performing Mendelian randomization studies using only summary statistics. A common feature of these methods, besides their intuitive simplicity, is the ability to combine data from several sources, incorporate multiple variants and account for biases due to weak instruments and pleiotropy. With the advent of large and accessible fully-genotyped cohorts such as UK Biobank, there is now increasing interest in understanding how best to apply these well developed summary data methods to individual level data, and to explore the use of more sophisticated causal methods allowing for non-linearity and effect modification. In this paper we describe a general procedure for optimally applying any two sample summary data method using one sample data. Our procedure first performs a meta-analysis of summary data estimates that are intentionally contaminated by collider bias between the genetic instruments and unmeasured confounders, due to conditioning on the observed exposure. These estimates are then used to correct the standard observational association between an exposure and outcome. Simulations are conducted to demonstrate the method’s performance against naive applications of two sample summary data MR. We apply the approach to the UK Biobank cohort to investigate the causal role of sleep disturbance on HbA1c levels, an important determinant of diabetes. Our approach can be viewed as a generalization of Dudbridge et al. (Nat. Comm. 10: 1561), who developed a technique to adjust for index event bias when uncovering genetic predictors of disease progression based on case-only data. Our work serves to clarify that in any one sample MR analysis, it can be advantageous to estimate causal relationships by artificially inducing and then correcting for collider bias., Author summary Uncovering causal mechanisms between risk factors and disease is challenging with observational data because of unobserved confounding. Mendelian randomization offers a potential solution by replacing an individual’s observed risk factor data with an unconfounded genetic proxy measure. Over the last decade an array of methods for performing Mendelian randomization studies (MR) using publicly available summary statistics gleaned from two separate genome-wide association studies. With the advent of large and accessible fully-genotyped cohorts such as UK Biobank, there is now increasing interest in understanding how best to apply these well-developed summary data methods to individual level data. In this paper we describe a general procedure for optimally applying any summary data MR method using individual level data from one cohort study. Our approach may at first seem nonsensical: we create summary statistics that are intentionally biased by confounding. This bias can, however, be very accurately estimated, and the estimate then used to correct the results of a standard observational analysis. We apply our new way of performing an MR analysis to data from UK Biobank to investigate the causal role of sleep disturbance on HbA1c levels, an important determinant of diabetes.

Cosegmentation is a newly emerging computer vision technique used to segment an object from the background by processing multiple images at the same time. Traditional plant phenotyping analysis uses thresholding segmentation methods which result in high segmentation accuracy. Although there are proposed machine learning and deep learning algorithms for plant segmentation, predictions rely on the specific features being present in the training set. The need for a multi-featured dataset and analytics for cosegmentation becomes critical to better understand and predict plants’ responses to the environment. High-throughput phenotyping produces an abundance of data that can be leveraged to improve segmentation accuracy and plant phenotyping. This paper introduces four datasets consisting of two plant species, Buckwheat and Sunflower, each split into control and drought conditions. Each dataset has three modalities (Fluorescence, Infrared, and Visible) with 7 to 14 temporal images that are collected in a high-throughput facility at the University of Nebraska-Lincoln. The four datasets (which will be collected under the CosegPP data repository in this paper) are evaluated using three cosegmentation algorithms: Markov random fields-based, Clustering-based, and Deep learning-based cosegmentation, and one commonly used segmentation approach in plant phenotyping. The integration of CosegPP with advanced cosegmentation methods will be the latest benchmark in comparing segmentation accuracy and finding areas of improvement for cosegmentation methodology.

Gene expression profiles can be utilized in the diagnosis of critical diseases such as cancer. The selection of biomarker genes from these profiles is significant and crucial for cancer detection. This paper presents a framework proposing a two-stage multifilter hybrid model of feature selection for colon cancer classification. Colon cancer is being extremely common nowadays among other types of cancer. There is a need to find fast and an accurate method to detect the tissues, and enhance the diagnostic process and the drug discovery. This paper reports on a study whose objective has been to improve the diagnosis of cancer of the colon through a two-stage, multifilter model of feature selection. The model described deals with feature selection using a combination of Information Gain and a Genetic Algorithm. The next stage is to filter and rank the genes identified through this method using the minimum Redundancy Maximum Relevance (mRMR) technique. The final phase is to further analyze the data using correlated machine learning algorithms. This two-stage approach, which involves the selection of genes before classification techniques are used, improves success rates for the identification of cancer cells. It is found that Decision Tree, K-Nearest Neighbor, and Naïve Bayes classifiers had showed promising accurate results using the developed hybrid framework model. It is concluded that the performance of our proposed method has achieved a higher accuracy in comparison with the existing methods reported in the literatures. This study can be used as a clue to enhance treatment and drug discovery for the colon cancer cure.

The determination of the relation between a number and a numerical interval is one of the core problems in the scientific calculation of privacy protection. The calculation of the relationship between two numbers and a numerical interval to protect privacy is also the basic problem of collaborative computing. It is widely used in data queries, location search and other fields. At present, most of the solutions are still fundamentally limited to the integer level, and there are few solutions at the real number level. To solve these problems, this paper first uses Bernoulli inequality generalization and a monotonic function property to extend the solution to the real number level and designs two new protocols based on the homomorphic encryption scheme, which can not only protect the data privacy of both parties involved in the calculation, but also extend the number domain to real numbers. In addition, this paper designs a solution to the confidential cooperative determination problem between real numbers by using the sign function and homomorphism multiplication. Theoretical analysis shows that the proposed solution is safe and efficient. Finally, some extension applications based on this protocol are given.

Parkinson’s disease (PD) is a progressive neurological disorder of the central nervous system that deteriorates motor functions, while it is also accompanied by a large diversity of non-motor symptoms such as cognitive impairment and mood changes, hallucinations, and sleep disturbance. Parkinsonism is evaluated during clinical examinations and appropriate medical treatments are directed towards alleviating symptoms. Tri-axial accelerometers, gyroscopes, and magnetometers could be adopted to support clinicians in the decision-making process by objectively quantifying the patient’s condition. In this context, at-home data collections aim to capture motor function during daily living and unobstructedly assess the patients’ status and the disease’s symptoms for prolonged time periods. This review aims to collate existing literature on PD monitoring using inertial sensors while it focuses on papers with at least one free-living data capture unsupervised either directly or via videotapes. Twenty-four papers were selected at the end of the process: fourteen investigated gait impairments, eight of which focused on walking, three on turning, two on falls, and one on physical activity; ten articles on the other hand examined symptoms, including bradykinesia, tremor, dyskinesia, and motor state fluctuations in the on/off phenomenon. In summary, inertial sensors are capable of gathering data over a long period of time and have the potential to facilitate the monitoring of people with Parkinson’s, providing relevant information about their motor status. Concerning gait impairments, kinematic parameters (such as duration of gait cycle, step length, and velocity) were typically used to discern PD from healthy subjects, whereas for symptoms’ assessment, researchers were capable of achieving accuracies of over 90% in a free-living environment. Further investigations should be focused on the development of ad-hoc hardware and software capable of providing real-time feedback to clinicians and patients. In addition, features such as the wearability of the system and user comfort, set-up process, and instructions for use, need to be strongly considered in the development of wearable sensors for PD monitoring.

The growing popularity of big data analysis and cloud computing has created new big data management standards. Sometimes, programmers may interact with a number of heterogeneous data stores depending on the information they are responsible for: SQL and NoSQL data stores. Interacting with heterogeneous data models via numerous APIs and query languages imposes challenging tasks on multi-data processing developers. Indeed, complex queries concerning homogenous data structures cannot currently be performed in a declarative manner when found in single data storage applications and therefore require additional development efforts. Many models were presented in order to address complex queries Via multistore applications. Some of these models implemented a complex unified and fast model, while others’ efficiency is not good enough to solve this type of complex database queries. This paper provides an automated, fast and easy unified architecture to solve simple and complex SQL and NoSQL queries over heterogeneous data stores (CQNS). This proposed framework can be used in cloud environments or for any big data application to automatically help developers to manage basic and complicated database queries. CQNS consists of three layers: matching selector layer, processing layer, and query execution layer. The matching selector layer is the heart of this architecture in which five of the user queries are examined if they are matched with another five queries stored in a single engine stored in the architecture library. This is achieved through a proposed algorithm that directs the query to the right SQL or NoSQL database engine. Furthermore, CQNS deal with many NoSQL Databases like MongoDB, Cassandra, Riak, CouchDB, and NOE4J databases. This paper presents a spark framework that can handle both SQL and NoSQL Databases. Four scenarios’ benchmarks datasets are used to evaluate the proposed CQNS for querying different NoSQL Databases in terms of optimization process performance and query execution time. The results show that, the CQNS achieves best latency and throughput in less time among the compared systems.

Tissue engineering and gene therapy strategies offer new ways to repair permanent damage to mechanosensory hair cells (MHCs) by differentiating human Wharton’s Jelly cells (HWJCs). Conventionally, these strategies require the classification of each cell as differentiated or undifferentiated. Automated classification tools, however, may serve as a novel method to rapidly classify these cells. In this paper, images from previous work, where HWJCs were differentiated into MHC-like cells, were examined. Various cell features were extracted from these images, and those which were pertinent to classification were identified. Different machine learning models were then developed, some using all extracted data and some using only certain features. To evaluate model performance, the area under the curve (AUC) of the receiver operating characteristic curve was primarily used. This paper found that limiting algorithms to certain features consistently improved performance. The top performing model, a voting classifier model consisting of two logistic regressions, a support vector machine, and a random forest classifier, obtained an AUC of 0.9638. Ultimately, this paper illustrates the viability of a novel machine learning pipeline to automate the classification of undifferentiated and differentiated cells. In the future, this research could aid in automated strategies that determine the viability of MHC-like cells after differentiation.

Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node client-server architecture to a distributed multitier design where data processing and transmission are segregated. Software development must considerer the orchestration required to provision its core components in order to deploy the services efficiently in many independent, loosely coupled—physically and virtually interconnected—data centers spread geographically, across the globe. This network routing challenge can be modeled as a variation of the Travelling Salesman Problem (TSP). This paper proposes a new optimization algorithm for optimum route selection using Algorithmic Information Theory. The Kelly criterion for a Shannon-Bernoulli process is used to generate a reliable quantitative algorithm to find a near optimal solution tour. The algorithm is then verified by comparing the results with benchmark heuristic solutions in 3 test cases. A statistical analysis is designed to measure the significance of the results between the algorithms and the entropy function can be derived from the distribution. The tested results shown an improvement in the solution quality by producing routes with smaller length and time requirements. The quality of the results proves the flexibility of the proposed algorithm for problems with different complexities without relying in nature-inspired models such as Genetic Algorithms, Ant Colony, Cross Entropy, Neural Networks, 2opt and Simulated Annealing. The proposed algorithm can be used by applications to deploy services across large cluster of nodes by making better decision in the route design. The findings in this paper unifies critical areas in Computer Science, Mathematics and Statistics that many researchers have not explored and provided a new interpretation that advances the understanding of the role of entropy in decision problems encoded in Turing Machines.

Fin-tech is an emerging field, inspiring revolutionary innovations in the financial field. It may initiate the evolutionary episode of the financial research, where volatility forecasting is a crucial topic in finance. For forecasting volatility, GARCH model is a prevailing model, however, further improvement of the GARCH model is still challenging. In this paper, we demonstrate how Fintech can play a part in volatility forecasting by employing a metaheuristic procedure called Genetic Programming. On the basis, we are able to develop a new volatility forecasting model, which can beat GARCH family models (including GARCH, IGARCH and TGARCH models) in a significant way. Since genetic programming is an evolutionary algorithm based on the principles of natural selection, this innovative work will be a breakthrough point in the financial area. The innovation of this paper demonstrates how GP technology can be applied in the financial field, attempting to explore the volatility forecasting area from the combination of new technology and finance, known as fintech. More importantly, when the formula of volatility forecasting is unknown as we introduce a new factor, namely, the liquidity factor, we unveil that how GP method can be helpful in determining the specific volatility forecasting model format. We thereby exhibit the liquidity effects on volatility forecasting filed from the fintech perspective.

Artificial intelligence (AI) is emerging as a technology at the center of many political, economic, and societal debates. This paper formulates a new AI patent search strategy and applies this to provide a landscape analysis of AI innovation dynamics and technology evolution. The paper uses patent analyses, network analyses, and source path link count algorithms to examine AI spatial and temporal trends, cooperation features, cross-organization knowledge flow and technological routes. Results indicate a growing yet concentrated, non-collaborative and multi-path development and protection profile for AI patenting, with cross-organization knowledge flows based mainly on interorganizational knowledge citation links.

An effective traffic control strategy will improve travel reliability in urban transportation networks. Lack of coordination between vehicles, however, exacerbates congestion due mainly to frequent stops at unsignalized intersections. It is beneficial to develop a conflict-free cooperation method that collects basic safety message from multiple approaching Connected and Autonomous Vehicles (for short, CAVs) and guarantees efficient unsignalized intersection operations with safe and incident free vehicle maneuvers. This paper proposes an interspersed traffic organization method under controlled constraints. Firstly, relied on shared location technology and considered the operating characteristics of CAVs at unsignalized intersections to detect and analyze traffic conflicts to establish a right-of-way judgment model for CAVs. In order to further ensure the safety and operating efficiency of the vehicle, based on the judgment results of right-of-way judgment model, a vehicle speed guidance model is established for different traffic conditions. Taking the real city standard intersection as the experimental analysis object, through data collection and simulation experiment, the signal control method and the organization method proposed in this paper are compared and analyzed. The results showed that the traffic organization method proposed in this paper improves the operational efficiency of 46%, the average travel time is reduced by 6.54s, which is not only better than the signal control method, but also supports the development of car networking technology.

Current image encryption methods have many shortcomings for the medical image encryption with high resolution, strong correlation and large storage space, and it is difficult to obtain reliable clinically applicable medical images. Therefore, this paper proposes a medical image encryption algorithm based on a new five-dimensional three-leaf chaotic system and genetic operation. And the dynamic analysis of the phase diagram and bifurcation diagram of the five-dimensional three-leaf chaotic system selected in this paper is carried out, and NIST is used to test the randomness of its chaotic sequence. This algorithm follows the diffusion-scrambling framework, especially using the principle of DNA recombination combined with the five-dimensional three-leaf chaotic system to generate a chaotic matrix that participates in the operation. The bit-level DNA mutation operation is introduced in the diffusion, and the scrambling and diffusion effects have been further improved. Algorithm security and randomness have been enhanced. This paper evaluates the efficiency of this algorithm for medical image encryption in terms of security analysis and time performance. Security analysis is carried out from key space, information entropy, histogram, similarity between decrypted image and original image, PSNR, correlation, sensitivity, noise attack, cropping attack and so on. Perform time efficiency analysis from the perspective of time performance. The comparison between this algorithm and the experimental results obtained by some of the latest medical image encryption algorithms shows that this algorithm is superior to the existing medical image encryption algorithms to a certain extent in terms of security and time efficiency.

[EN] The paper is concerned with the consensus problem in a multi-agent system such that each agent has boundary constraints. Classical Olfati-Saber's consensus algorithm converges to the same value of the consensus variable, and all the agents reach the same value. These algorithms find an equality solution. However, what happens when this equality solution is out of the range of some of the agents? In this case, this solution is not adequate for the proposed problem. In this paper, we propose a new kind of algorithms called supportive consensus where some agents of the network can compensate for the lack of capacity of other agents to reach the average value, and so obtain an acceptable solution for the proposed problem. Supportive consensus finds an equity solution. In the rest of the paper, we define the supportive consensus, analyze and demonstrate the network's capacity to compensate out of boundaries agents, propose different supportive consensus algorithms, and finally, provide some simulations to show the performance of the proposed algorithms., The author(s) received specific funding for this work from the Valencian Research Institute for Artificial Intelligence (VRAIN) where the authors are currently working. This work is partially supported by the Spanish Government project RTI2018-095390-B-C31, GVA-CEICE project PROMETEO/2018/002, and TAILOR, a project funded by EU Horizon 2020 research and innovation programme under GA No 952215. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

International audience; This paper aims to further increase the reliability of optimal results by setting the simulation conditions to be as close as possible to the real or actual operation to create a Cyber-Physical System (CPS) view for the installation of the Fractional-Order PID (FOPID) controller. For this purpose, we consider two different sources of variability in such a CPS control model. The first source refers to the changeability of a target of the control model (multiple setpoints) because of environmental noise factors and the second source refers to an anomaly in sensors that is raised in a feedback loop. We develop a new approach to optimize two objective functions under uncertainty including signal energy control and response error control while obtaining the robustness among the source of variability with the lowest computational cost. A new hybrid surrogate-metaheuristic approach is developed using Particle Swarm Optimization (PSO) to update the Gaussian Process (GP) surrogate for a sequential improvement of the robust optimal result. The application of efficient global optimization is extended to estimate surrogate prediction error with less computational cost using a jackknife leave-one-out estimator. This paper examines the challenges of such a robust multi-objective optimization for FOPID control of a five-bar linkage robot manipulator. The results show the applicability and effectiveness of our proposed method in obtaining robustness and reliability in a CPS control system by tackling required computational efforts.

Identification of mutations of the genes that give cancer a selective advantage is an important step towards research and clinical objectives. As such, there has been a growing interest in developing methods for identification of driver genes and their temporal order within a single patient (intra-tumor) as well as across a cohort of patients (inter-tumor). In this paper, we develop a probabilistic model for tumor progression, in which the driver genes are clustered into several ordered driver pathways. We develop an efficient inference algorithm that exhibits favorable scalability to the number of genes and samples compared to a previously introduced ILP-based method. Adopting a probabilistic approach also allows principled approaches to model selection and uncertainty quantification. Using a large set of experiments on synthetic datasets, we demonstrate our superior performance compared to the ILP-based method. We also analyze two biological datasets of colorectal and glioblastoma cancers. We emphasize that while the ILP-based method puts many seemingly passenger genes in the driver pathways, our algorithm keeps focused on truly driver genes and outputs more accurate models for cancer progression., Author summary Cancer is a disease caused by the accumulation of somatic mutations in the genome. This process is mainly driven by mutations in certain genes that give the harboring cells some selective advantage. The rather few driver genes are usually masked amongst an abundance of so-called passenger mutations. Identification of the driver genes and the temporal order in which the mutations occur is of great importance towards research and clinical objectives. In this paper, we introduce a probabilistic model for cancer progression and devise an efficient inference algorithm to train the model. We show that our method scales favorably to large datasets and provides superior performance compared to an ILP-based counterpart on a wide set of synthetic data simulations. Our Bayesian approach also allows for systematic model selection and confidence quantification procedures in contrast to the previous non-probabilistic progression models. We also study two large datasets on colorectal and glioblastoma cancers and validate our inferred model in comparison to the ILP-based method.

A detailed situation awareness of the local environment is essential for safe flight in General Aviation. When operating under Visual Flight Rules, eyesight is crucial for maintaining situation awareness and objects may be overlooked. Technical solutions such as Flarm have been sought, but they only work on a basis of co-operation: obstacles without the proper equipment are invisible. Recent developments in the field of radar technology, partly empowered by the demand for sensors for autonomous cars, have improved the size and power consumption of available hardware. Today, the hardware exists to build a portable primary radar system for situation awareness. In this paper the results are presented of efforts to build the first portable primary radar for general, which has to be lightweight, cheap and have a low power consumption. The focus in this paper is on the software design of such a radar system. The physical principles of radar sensing are described, as well as the scientific steps needed to provide situation awareness. The hardware and software for the radar are both built and tested, and the results of these tests are presented. A flight experiment is performed with a small aircraft flying past a stationary radar on a small hill. It is found that the radar is capable of detecting the aircraft up to a distance of at least 3 kilometers. 3D localization is performed and the location determined by the radar was on average 46 meters away from the aircraft position as measured by satellite navigation, relative to a total distance of about 1000 meters from the radar. A low-pass filter can be applied on the raw results in order to improve the location estimation further. Future research will focus on bringing the portable radar in motion while operating.

Background As the world’s largest coal producer, China was accounted for about 46% of global coal production. Among present coal mining risks, methane gas (called gas in this paper) explosion or ignition in an underground mine remains ever-present. Although many techniques have been used, gas accidents associated with the complex elements of underground gassy mines need more robust monitoring or warning systems to identify risks. This paper aimed to determine which single method between the PCA and Entropy methods better establishes a responsive weighted indexing measurement to improve coal mining safety. Methods Qualitative and quantitative mixed research methodologies were adopted for this research, including analysis of two case studies, correlation analysis, and comparative analysis. The literature reviewed the most-used multi-criteria decision making (MCDM) methods, including subjective methods and objective methods. The advantages and disadvantages of each MCDM method were briefly discussed. One more round literature review was conducted to search publications between 2017 and 2019 in CNKI. Followed two case studies, correlation analysis and comparative analysis were then conducted. Research ethics was approved by the Shanxi Coking Coal Group Research Committee. Results The literature searched a total of 25,831publications and found that the PCA method was the predominant method adopted, and the Entropy method was the second most widely adopted method. Two weighting methods were compared using two case studies. For the comparative analysis of Case Study 1, the PCA method appeared to be more responsive than the Entropy. For Case Study 2, the Entropy method is more responsive than the PCA. As a result, both methods were adopted for different cases in the case study mine and finally deployed for user acceptance testing on 5 November 2020. Conclusions The findings and suggestions were provided as further scopes for further research. This research indicated that no single method could be adopted as the better option for establishing indexing measurement in all cases. The practical implication suggests that comparative analysis should always be conducted on each case and determine the appropriate weighting method to the relevant case. This research recommended that the PCA method was a dimension reduction technique that could be handy for identifying the critical variables or factors and effectively used in hazard, risk, and emergency assessment. The PCA method might also be well-applied for developing predicting and forecasting systems as it was sensitive to outliers. The Entropy method might be suitable for all the cases requiring the MCDM. There is also a need to conduct further research to probe the causal reasons why the PCA and Entropy methods were applied to each case and not the other way round. This research found that the Entropy method provides higher accuracy than the PCA method. This research also found that the Entropy method demonstrated to assess the weights of the higher dimension dataset was higher sensitivity than the lower dimensions. Finally, the comprehensive analysis indicates a need to explore a more responsive method for establishing a weighted indexing measurement for warning applications in hazard, risk, and emergency assessments.

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies.

Blockchain has been applied to quality control in manufacturing, but the problems of false defect detections and lack of data transparency remain. This paper proposes a framework, Blockchain Quality Controller (BCQC), to overcome these limitations while fortifying data security. BCQC utilizes blockchain and Internet-of-Things to form a peer-to-peer supervision network. This paper also proposes a consensus algorithm, Quality Defect Tolerance (QDT), to adopt blockchain for during-production quality control. Simulation results show that BCQC enhances data security and improves defect detections. Although the time taken for the quality control process increases with the number of nodes in blockchain, the application of QDT allows multiple inspections on a workpiece to be consolidated at a faster pace, effectively speeding up the entire quality control process. The BCQC and QDT can improve the quality of parts produced for mass personalization manufacturing.

Developing new methods for modelling infectious diseases outbreaks is important for monitoring transmission and developing policy. In this paper we propose using semi-mechanistic Hawkes Processes for modelling malaria transmission in near-elimination settings. Hawkes Processes are well founded mathematical methods that enable us to combine the benefits of both statistical and mechanistic models to recreate and forecast disease transmission beyond just malaria outbreak scenarios. These methods have been successfully used in numerous applications such as social media and earthquake modelling, but are not yet widespread in epidemiology. By using domain-specific knowledge, we can both recreate transmission curves for malaria in China and Eswatini and disentangle the proportion of cases which are imported from those that are community based., Author summary This paper introduces a mathematically well-founded method for infectious disease outbreaks known as Hawkes Processes. These semi-mechanistic models are relatively new to the infectious diseases toolkit and enable us to combine disease specific information such as the infectious profile with statistical rigour to recreate temporal disease transmission. We show that these methods are very suited to modelling malaria in communities close to eliminating malaria—in particular China and Eswatini—where we are able to disentangle the contribution of exogenous (external) transmission and endogenous (person-to-person) transmission. This is particularly important for developing policies when counties are approaching elimination.

Computational drug repositioning and drug-target prediction have become essential tasks in the early stage of drug discovery. In previous studies, these two tasks have often been considered separately. However, the entities studied in these two tasks (i.e., drugs, targets, and diseases) are inherently related. On one hand, drugs interact with targets in cells to modulate target activities, which in turn alter biological pathways to promote healthy functions and to treat diseases. On the other hand, both drug repositioning and drug-target prediction involve the same drug feature space, which naturally connects these two problems and the two domains (diseases and targets). By using the wisdom of the crowds, it is possible to transfer knowledge from one of the domains to the other. The existence of relationships among drug-target-disease motivates us to jointly consider drug repositioning and drug-target prediction in drug discovery. In this paper, we present a novel approach called iDrug, which seamlessly integrates drug repositioning and drug-target prediction into one coherent model via cross-network embedding. In particular, we provide a principled way to transfer knowledge from these two domains and to enhance prediction performance for both tasks. Using real-world datasets, we demonstrate that iDrug achieves superior performance on both learning tasks compared to several state-of-the-art approaches. Our code and datasets are available at: https://github.com/Case-esaC/iDrug., Author summary Traditional high-throughput techniques for drug discovery are often expensive, time-consuming, and with high failure rates. Computational drug repositioning and drug-target prediction have thus become essential tasks in the early stage drug discovery. The emergence of large-scale heterogeneous biological networks has offered unprecedented opportunities for developing machine learning approaches to identify novel drug-disease or drug-target interactions. However, most existing works focused either on the drug-disease network or on the drug-target network, thus failed to capture the inherent dependencies between these two networks. These two biological networks are naturally connected since they involve the same drug feature space. In our opinion, ignoring this rich source of information is a major shortcoming of some existing works. In this paper, we present a novel approach called iDrug, which seamlessly integrates the drug-disease network and the drug-target network into one coherent model via cross-network embedding. As a result, iDrug is able to take full usage of the knowledge within these two biological networks to better exploit new biomedical insights of drug-target-disease. Therefore, iDrug has broad applications in drug discovery.

Political redistricting is the redrawing of electoral district boundaries. It is normally undertaken to reflect population changes. The process can be abused, in what is called gerrymandering, to favor one party or interest group over another, resulting thereby in broadly undemocratic outcomes that misrepresent the views of the voters. Gerrymandering is especially vexing in the United States. This paper introduces an algorithm, with an implementation, for creating districting plans (whether for political redistricting or for other districting applications). The algorithm, Seed-Fill-Shift-Repair (SFSR), is demonstrated for Congressional redistricting in American states. SFSR is able to create thousands of valid redistricting plans, which may then be used as points of departure for public deliberation regarding how best to redistrict a given polity. The main objectives of this paper are: (i) to present SFSR in a broadly accessible form, including code that implements it and test data, so that it may be used for both civic deliberations by the public and for research purposes. (ii) to make the case for what SFSR essays to do, which is to approach redistricting, and districting generally, from a constraint satisfaction perspective and from the perspective of producing a plurality of feasible solutions that may then serve in subsequent deliberations. To further these goals, we make the code publicly available. The paper presents, for illustration purposes, a corpus of 11,206 valid redistricting plans for the Commonwealth of Pennsylvania (produced by SFSR), using the 2017 American Community Survey, along with descriptive statistics. Also, the paper presents 1,000 plans for each of the states of Arizona, Michigan, North Carolina, Pennsylvania, and Wisconsin, using the 2018 American Community Survey, along with descriptive statistics on these plans and the computations involved in their creation.

Deep learning methods are being increasingly widely used in static malware detection field because they can summarize the feature of malware and its variants that have never appeared before. But similar to the picture recognition model, the static malware detection model based on deep learning is also vulnerable to the interference of adversarial samples. When the input feature vectors of the malware detection model is based on static features of Windows PE (Portable Executable, PE) file, the model is vulnerable to gradient-based attacks. Regarding the issue above, a method of adversarial sample generation is proposed, which can summarize the blind spots of the original detection model. However, the existing malware adversarial sample generation method is not universal and low in generation efficiency due to the need for human control and difficulty in maintaining a normal file format. In response to these problems, this paper proposes a novel method of automatic adversarial samples generation based on deep reinforcement learning. Firstly, a static PE malware detection model based on deep learning called DeepDetectNet is constructed, the original AUC of which can reach 0.989. Then, an adversarial sample generation model based on reinforcement learning called RLAttackNet is implemented, which generates malware samples that can bypass DeepDetectNet. Finally, when we re-input the adversarial samples into the previously trained DeepDetectNet, the original defects of DeepDetectNet can be reinforced. Experimental results show that the RLAttackNet proposed in this paper can generate about 19.13% of malware samples bypass DeepDetectNet. When DeepDetectNet is retrained with these adversarial samples, the AUC value improves from 0.989 to 0.996 and attack success rate has a significant drop, from 19.13% to 3.1%, compared with the original model.

The UK Biobank is a very large, prospective population-based cohort study across the United Kingdom. It provides unprecedented opportunities for researchers to investigate the relationship between genotypic information and phenotypes of interest. Multiple regression methods, compared with genome-wide association studies (GWAS), have already been showed to greatly improve the prediction performance for a variety of phenotypes. In the high-dimensional settings, the lasso, since its first proposal in statistics, has been proved to be an effective method for simultaneous variable selection and estimation. However, the large-scale and ultrahigh dimension seen in the UK Biobank pose new challenges for applying the lasso method, as many existing algorithms and their implementations are not scalable to large applications. In this paper, we propose a computational framework called batch screening iterative lasso (BASIL) that can take advantage of any existing lasso solver and easily build a scalable solution for very large data, including those that are larger than the memory size. We introduce snpnet, an R package that implements the proposed algorithm on top of glmnet and optimizes for single nucleotide polymorphism (SNP) datasets. It currently supports ℓ1-penalized linear model, logistic regression, Cox model, and also extends to the elastic net with ℓ1/ℓ2 penalty. We demonstrate results on the UK Biobank dataset, where we achieve competitive predictive performance for all four phenotypes considered (height, body mass index, asthma, high cholesterol) using only a small fraction of the variants compared with other established polygenic risk score methods., Author summary With the advent and evolution of large-scale and comprehensive biobanks, there come up unprecedented opportunities for researchers to further uncover the complex landscape of human genetics. One major direction that attracts long-standing interest is the investigation of the relationships between genotypes and phenotypes. This includes but doesn’t limit to the identification of genotypes that are significantly associated with the phenotypes, and the prediction of phenotypic values based on the genotypic information. Genome-wide association studies (GWAS) is a very powerful and widely used framework for the former task, having produced a number of very impactful discoveries. However, when it comes to the latter, its performance is fairly limited by the univariate nature. To address this, multiple regression methods have been suggested to fill in the gap. That said, challenges emerge as the dimension and the size of datasets both become large nowadays. In this paper, we present a novel computational framework that enables us to solve efficiently the entire lasso or elastic-net solution path on large-scale and ultrahigh-dimensional data, and therefore make simultaneous variable selection and prediction. Our approach can build on any existing lasso solver for small or moderate-sized problems, scale it up to a big-data solution, and incorporate other extensions easily. We provide a package snpnet that extends the glmnet package in R and optimizes for large phenotype-genotype data. On the UK Biobank, we observe competitive prediction performance of the lasso and the elastic-net for all four phenotypes considered from the UK Biobank. That said, the scope of our approach goes beyond genetic studies. It can be applied to general sparse regression problems and build scalable solution for a variety of distribution families based on existing solvers.

Even if shared mobility services are encouraged by transportation policies, they remain underused and inefficient transportation modes because they struggle to find their customer base. This paper aims to estimate the potential demand for such services by focusing on individual trips and determining the number of passengers who perform similar trips. Contrary to existing papers, this study focuses on the demand without assuming any specific shared mobility system. The experiment performed on data coming from New York City conducts to cluster more than 85% of the trips. Consequently, shared mobility services such as ride-sharing can find their customer base and, at a long time, to a significantly reduce the number of cars flowing in the city. After a detailed analysis, commonalities in the clusters are identified: regular patterns from one day to the next exist in shared mobility demand. This regularity makes it possible to anticipate the potential shared mobility demand to help transportation suppliers to optimize their operations.

The Global Navigation Satellite System is vulnerable to interference signals that can potentially disable the system, because the signal strength tends to be very weak. Interference such as jamming, which disables the receiver via excessively high signal strength in the satellite navigation frequency band, and spoofing, which induces the receiver to output erroneous position and time data via signals similar to actual navigation signals, disrupt satellite navigation systems. As the threat of interference is increasing, considerable research effort has been expended in an attempt to deal with it in various ways. Spoofing attacks are especially difficult to detect. This paper deals with a technique to detect a spoofing signal and to mitigate attacks on satellite navigation systems. The satellite navigation signal is influenced by the navigation satellite itself and errors due to environmental factors, and spoofing signal detection should be well reflected in the navigation signal. Especially, in the case of mobile receivers, it is not easy to detect a spoofing signal because the exact position of the receiver cannot be known. To detect a spoofing signal, additional hardware may be required; in some cases, heterogeneous sensors, such as inertial sensors, may be used. The technique introduced in this paper effectively discriminates spoofing signals based only on receiver measurements, without the need for additional devices. It generates test statistics based on the pseudorange, which is the measured value of the receiver position, and detects spoofing signals by setting the monitoring interval according to a “sliding window”. Because the proposed method uses output data and measurements obtained from the receiver, it can be applied to general receivers at low cost.

Compared to the integer-order modeling, the fractional-order modeling can achieve higher accuracy for designing and analyzing the DC-DC power converters. However, its applications in pulse width modulation (PWM) converters are limited due to the computational complexities. In this paper, a modified fractional-order modeling methodology for DC-DC converters is proposed, and its effectiveness is verified on the fractional-order positive Luo converters. Instead of using fractional-order calculus, the proposed methodology analyzes the harmonic components of the PWM converters by utilizing the non-linear vector differential equations of the periodically time-variant system. The final solution of the state variables is composed of two parts: the steady-state solution and the transient solution. The approximate steady state solution can be obtained by using the equivalent small parameter (ESP) method and the harmonic balance theory, while the main part of the transient solution can be obtained according to the explicit Grunwald-Letnikov (GL) approximation. In addition, the influence of the fractional orders on the performance of the DC-DC converters, and on the dynamic behaviors of the fractional-orders systems are also discussed in this paper. Compared to the conventional fractional-order numerical models, the proposed model is able to present the time-domain information more precisely, which helps to better reveal and analyze the non-linear behaviors of the DC-DC converters. The effectiveness of the work is demonstrated by the simulation and experimental results of the equivalent circuits built with fractional-order components.

The rapid increase in the usage of the mobile internet has led to a great expansion of cellular data networks in order to provide better quality of service. However, the cost to expand the cellular network is high. One of the solutions to provide affordable wireless connectivity is the deployment of a WiFi access point to offload users’ data usage. Nevertheless, the frequent and inefficient handover process between the WiFi AP and cellular network, especially when the mobile device is on the go, may degrade the network performance. Mobile devices do not have the intelligence to select the optimal network to enhance the quality of service (QoS). This paper presents an enhanced handover mechanism using mobility prediction (eHMP) to assist mobile devices in the handover process so that users can experience seamless connectivity. eHMP is tested in two wireless architectures, homogeneous and heterogeneous networks. The network performance significantly improved when eHMP is used in a homogeneous network, where the network throughput increases by 106% and the rate of retransmission decreases by 85%. When eHMP is used in a heterogeneous network, the network throughput increases by 55% and the retransmission rate decreases by 75%. The findings presented in this paper reveal that mobility prediction coupled with the multipath protocol can improve the QoS for mobile devices. These results will contribute to a better understanding of how the network service provider can offload traffic to the WiFi network without experiencing performance degradation.

The lensless optical fluid microscopy is of great significance to the miniaturization, portability and low cost development of cell detection instruments. However, the resolution of the cell image collected directly is low, because the physical pixel size of the image sensor is the same order of magnitude as the cell size. To solve this problem, this paper proposes a super-resolution scanning algorithm using a dual-line array sensor and a microfluidic chip. For dual-line array sensor images, the multi-group velocity and acceleration of cells flowing through the line array sensor are calculated. Then the reconstruction model of the super-resolution image is constructed with variable acceleration. By changing the angle between the line array image sensor and the direction of cell flow, the super-resolution image scanning and reconstruction are achieved in both horizontal and vertical directions. In addition, it is necessary to study the row by row extraction algorithm for cell foreground image. In this paper, the dual-line array sensor is implemented by adjusting the acquisition window of the image sensor with a pixel size of 2.2μm. When the tilt angle is 21 degrees, the equivalent pixel size is 0.79μm, improved 2.8 times, and after de-diffraction its average size error was 3.249%. As the angle decreases, the image resolution is higher, but the amount of information is less. This super-resolution scanning algorithm can be integrated on the chip and used with a microfluidic chip to realize on-chip instrument.

This paper studies the inverse kinematics of two non-spherical wrist configurations of painting robot. The simplest analytical solution of orthogonal wrist configuration is deduced in this paper for the first time. For the oblique wrist configuration, there is no analytical solution for the configuration. So it is necessary to solve by general method, which cannot achieve high precision and high speed as analytic solution. Two general methods are optimized in this paper. Firstly, the elimination method is optimized to reduce the solving speed to 20% of the original one, and the completeness of the method is supplemented. Based on the Gauss damped least squares method, a new optimization method is proposed to improve the solving speed. The enhanced step length coefficient is introduced to conduct studies with the machine learning correlation method. It has been proved that, on the basis of ensuring the stability of motion, the number of iterations can be effectively reduced and the average number of iterations can be less than 5 times, which can effectively improve the speed of solution. In the simulation and experimental environment, it is verified.

Stock price prediction is a challenging task, but machine learning methods have recently been used successfully for this purpose. In this paper, we extract over 270 hand-crafted features (factors) inspired by technical and quantitative analysis and tested their validity on short-term mid-price movement prediction. We focus on a wrapper feature selection method using entropy, least-mean squares, and linear discriminant analysis. We also build a quantitative feature based on adaptive logistic regression for online learning, which is constantly selected first among the majority of the proposed feature selection methods. This study examines the best combination of features using high frequency limit order book data from Nasdaq Nordic. Our results suggest that sorting methods and classifiers can be used in such a way that one can reach the best performance with a combination of only very few informative features. This paper opens avenues for developing more advanced features combined with more sophisticated feature selection methods. It also provides helpful insight to market makers and traders in general by providing useful results that can be used to gain an information edge in trading.

Understanding the digital jump of bank customers is key to design strategies to bring on board and keep online users, as well as to explain the increasing competition from new providers of financial services (such as BigTech and FinTech). This paper employs a machine learning approach to examine the digitalization process of bank customers using a comprehensive consumer finance survey. By employing a set of algorithms (random forests, conditional inference trees and causal forests) this paper identities the features predicting bank customers’ digitalization process, illustrates the sequence of consumers’ decision-making actions and explores the existence of causal relationships in the digitalization process. Random forests are found to provide the highest performance–they accurately predict 88.41% of bank customers’ online banking adoption and usage decisions. We find that the adoption of digital banking services begins with information-based services (e.g., checking account balance), conditional on the awareness of the range of online services by customers, and then is followed by transactional services (e.g., online/mobile money transfer). The diversification of the use of online channels is explained by the consciousness about the range of services available and the safety perception. A certain degree of complementarity between bank and non-bank digital channels is also found. The treatment effect estimations of the causal forest algorithms confirm causality of the identified explanatory factors. These results suggest that banks should address the digital transformation of their customers by segmenting them according to their revealed preferences and offering them personalized digital services. Additionally, policymakers should promote financial digitalization, designing policies oriented towards making consumers aware of the range of online services available.

Multiscale geometric analysis (MGA) is not only characterized by multi-resolution, time-frequency localization, multidirectionality and anisotropy, but also outdoes the limitations of wavelet transform in representing high-dimensional singular data such as edges and contours. Therefore, researchers have been exploring new MGA-based image compression standards rather than the JPEG2000 standard. However, due to the difference in terms of the data structure, redundancy and decorrelation between wavelet and MGA, as well as the complexity of the coding scheme, so far, no definitive researches have been reported on the MGA-based image coding schemes. In addressing this problem, this paper proposes an image data compression approach using the hidden Markov model (HMM)/pulse-coupled neural network (PCNN) model in the contourlet domain. First, a sparse decomposition of an image was performed using a contourlet transform to obtain the coefficients that show the multiscale and multidirectional characteristics. An HMM was then adopted to establish links between coefficients in neighboring subbands of different levels and directions. An Expectation-Maximization (EM) algorithm was also adopted in training the HMM in order to estimate the state probability matrix, which maintains the same structure of the contourlet decomposition coefficients. In addition, each state probability can be classified by the PCNN based on the state probability distribution. Experimental results show that the HMM/PCNN -contourlet model proposed in this paper leads to better compression performance and offer a more flexible encoding scheme.

This paper employs a solution to the agent-guidance problem in an environment with obstacles, whose avoidance techniques have been extensively used in the last years. There is still a gap between the solution times required to obtain a trajectory and those demanded by real world applications. These usually face a tradeoff between the limited on-board processing performance and the high volume of computing operations demanded by those real-time applications. In this paper we propose a deferred decision-based technique that produces clusters used for obstacle avoidance as the agent moves in the environment, like a driver that, at night, enlightens the road ahead as her/his car moves along a highway. By considering the spatial and temporal relevance of each obstacle throughout the planning process and pruning areas that belong to the constrained domain, one may relieve the inherent computational burden of avoidance. This strategy reduces the number of operations required and increases it on demand, since a computationally heavier problem is tackled only if the simpler ones are not feasible. It consists in an improvement based solely on problem modeling, which, by example, may offer processing times in the same order of magnitude than the lower-bound given by the relaxed form of the problem.

Image encryption is an effective method for protecting private images during communication. In this paper, a novel image encryption method is proposed based on a 5D hyperchaotic system. Since a 5D hyperchaotic system can generate more complex dynamic behavior than a low-dimensional system, it is used in this paper to generate pseudorandom number sequences. The generated sequences are processed to obtain new sequences. The randomness of the new sequences is improved by recombination and rearrangement. The experimental results and theoretical analysis show that the method possesses a large key space and can resist differential attacks, statistical analysis, entropy analysis, clipping attacks and noise attacks. Therefore, it is very secure and can be used for secure communication.

We consider how a signalling system can act as an information hub by multiplexing information arising from multiple signals. We formally define multiplexing, mathematically characterise which systems can multiplex and how well they can do it. While the results of this paper are theoretical, to motivate the idea of multiplexing, we provide experimental evidence that tentatively suggests that the NF-κB transcription factor can multiplex information about changes in multiple signals. We believe that our theoretical results may resolve the apparent paradox of how a system like NF-κB that regulates cell fate and inflammatory signalling in response to diverse stimuli can appear to have the low information carrying capacity suggested by recent studies on scalar signals. In carrying out our study, we introduce new methods for the analysis of large, nonlinear stochastic dynamic models, and develop computational algorithms that facilitate the calculation of fundamental constructs of information theory such as Kullback–Leibler divergences and sensitivity matrices, and link these methods to a new theory about multiplexing information. We show that many current models such as those of the NF-κB system cannot multiplex effectively and provide models that overcome this limitation using post-transcriptional modifications., Author summary Cells use signalling systems to pass on information arising from their ever-changing environment to their processing units. These biochemical networks regulate the transmission of multiple signals within the noisy and complex cellular environment, controlling whether to turn on or off processes of cell defence, death, division, and others. The question of how they actually achieve that becomes particularly critical given that many diseases occur when signalling systems malfunction. In this paper, we develop methodology and computational tools for simulating, measuring and analysing the ability of signalling systems to transmit multi-dimensional signals. We specifically focus on the capacity of signalling systems to simultaneously transmit multiple signals, such as temperature changes, presence and concentration of cytokines, viral and bacterial pathogens or drugs, through a single noisy, dynamic signalling system. We argue that a signalling system can act as an information hub, sending information in a multiplexed fashion rather similar to the way in which telecommunications networks send multiple signals over a shared medium by combining them into one.

With the development of e-commerce, online shopping has become one of the most important consumer channels. However, the lack of government supervision, insufficient review of e-commerce platforms, illegal sales of online sellers and invalid consumer complaints have led to frequent green product quality problems during online shopping. Therefore, this paper considers that the online seller may be driven by interests, colluding with the e-commerce platform and selling low quality green product. At the same time, we introduce consumer feedback, and take the government supervision department, the online seller and the e-commerce platform as actors of the evolutionary game. In this paper, the evolutionary strategy choices of each actor were analyzed, and the influence of different factors on the evolutionary stability results was explored. Research indicates: firstly, consumer complaints play an indirect regulatory role for the online seller; secondly, the enhancement of the loss-sharing relationship between the online seller and the e-commerce platform can promote the legal operation of the two and prevent collusion; thirdly, the impact of consumer complaints on the choice of the e-commerce platform depends on the government supervision department’s penalty for the e-commerce platform; finally, the e-commerce platform establishes a reasonable reward system, which can make up for the defects of the online seller using advanced technology to avoid punishment. Our paper uses Matlab 2017 for simulation analysis and provides effective advices on how to urge the government supervision department to effectively supervise, promote the e-commerce platform to enhance review, urge the online seller to legal sale, and encourage consumers to legally defend their rights.