Search

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

We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three pre-defined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields., Comment: 18 pages, 9 figures

The soybean cyst nematode (SCN), Heterodera glycines, is the most damaging pathogen of soybeans in the United States. To assess the severity of nematode infestations in the field, SCN egg population densities are determined. Cysts (dead females) of the nematode must be extracted from soil samples and then ground to extract the eggs within. Sucrose centrifugation commonly is used to separate debris from suspensions of extracted nematode eggs. We present a method using OptiPrep as a density gradient medium with improved separation and recovery of extracted eggs compared to the sucrose centrifugation technique. Also, computerized methods were developed to automate the identification and counting of nematode eggs from the processed samples. In one approach, a high-resolution scanner was used to take static images of extracted eggs and debris on filter papers, and a deep learning network was trained to identify and count the eggs among the debris. In the second approach, a lensless imaging setup was developed using off-the-shelf components, and the processed egg samples were passed through a microfluidic flow chip made from double-sided adhesive tape. Holographic videos were recorded of the passing eggs and debris, and the videos were reconstructed and processed by custom software program to obtain egg counts. The performance of the software programs for egg counting was characterized with SCN-infested soil collected from two farms, and the results using these methods were compared with those obtained through manual counting.

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.

Quantifying and comparing the scientific output of researchers has become critical for governments, funding agencies and universities. Comparison by reputation and direct assessment of contributions to the field is no longer possible, as the number of scientists increases and traditional definitions about scientific fields become blurred. The h-index is often used for comparing scientists, but has several well-documented shortcomings. In this paper, we introduce a new index for measuring and comparing the publication records of scientists: the pagerank-index (symbolised as π). The index uses a version of pagerank algorithm and the citation networks of papers in its computation, and is fundamentally different from the existing variants of h-index because it considers not only the number of citations but also the actual impact of each citation. We adapt two approaches to demonstrate the utility of the new index. Firstly, we use a simulation model of a community of authors, whereby we create various ‘groups’ of authors which are different from each other in inherent publication habits, to show that the pagerank-index is fairer than the existing indices in three distinct scenarios: (i) when authors try to ‘massage’ their index by publishing papers in low-quality outlets primarily to self-cite other papers (ii) when authors collaborate in large groups in order to obtain more authorships (iii) when authors spend most of their time in producing genuine but low quality publications that would massage their index. Secondly, we undertake two real world case studies: (i) the evolving author community of quantum game theory, as defined by Google Scholar (ii) a snapshot of the high energy physics (HEP) theory research community in arXiv. In both case studies, we find that the list of top authors vary very significantly when h-index and pagerank-index are used for comparison. We show that in both cases, authors who have collaborated in large groups and/or published less impactful papers tend to be comparatively favoured by the h-index, whereas the pagerank-index highlights authors who have made a relatively small number of definitive contributions, or written papers which served to highlight the link between diverse disciplines, or typically worked in smaller groups. Thus, we argue that the pagerank-index is an inherently fairer and more nuanced metric to quantify the publication records of scientists compared to existing measures.

In this paper, a digital 3D model which allows for visualisation in three dimensions and interactive manipulation is explored as a tool to help us understand the structural morphology and elucidate the functions of morphological structures of fragile microorganisms which defy live studies. We developed a deformable generic 3D model of haptoral anchor of dactylogyridean monogeneans that can subsequently be deformed into different desired anchor shapes by using direct manipulation deformation technique. We used point primitives to construct the rectangular building blocks to develop our deformable 3D model. Point primitives are manually marked on a 2D illustration of an anchor on a Cartesian graph paper and a set of Cartesian coordinates for each point primitive is manually extracted from the graph paper. A Python script is then written in Blender to construct 3D rectangular building blocks based on the Cartesian coordinates. The rectangular building blocks are stacked on top or by the side of each other following their respective Cartesian coordinates of point primitive. More point primitives are added at the sites in the 3D model where more structural variations are likely to occur, in order to generate complex anchor structures. We used Catmull-Clark subdivision surface modifier to smoothen the surface and edge of the generic 3D model to obtain a smoother and more natural 3D shape and antialiasing option to reduce the jagged edges of the 3D model. This deformable generic 3D model can be deformed into different desired 3D anchor shapes through direct manipulation deformation technique by aligning the vertices (pilot points) of the newly developed deformable generic 3D model onto the 2D illustrations of the desired shapes and moving the vertices until the desire 3D shapes are formed. In this generic 3D model all the vertices present are deployed for displacement during deformation.

Environmentally Degradable Parameter ((Ed)K) is of importance in the describing of biodegradability of environmentally biodegradable polymers (BDPs). In this study, a concept (Ed)K was introduced. A test procedure of using the ISO 14852 method and detecting the evolved carbon dioxide as an analytical parameter was developed, and the calculated (Ed)K was used as an indicator for the ultimate biodegradability of materials. Starch and polyethylene used as reference materials were defined as the (Ed)K values of 100 and 0, respectively. Natural soil samples were inoculated into bioreactors, followed by determining the rates of biodegradation of the reference materials and 15 commercial BDPs over a 2-week test period. Finally, a formula was deduced to calculate the value of (Ed)K for each material. The (Ed)K values of the tested materials have a positive correlation to their biodegradation rates in the simulated soil environment, and they indicated the relative biodegradation rate of each material among all the tested materials. Therefore, the (Ed)K was shown to be a reliable indicator for quantitatively evaluating the potential biodegradability of BDPs in the natural environment.

The COVID-19 pandemic has exposed the vulnerability of healthcare services worldwide, raising the need to develop novel tools to provide rapid and cost-effective screening and diagnosis. Clinical reports indicated that COVID-19 infection may cause cardiac injury, and electrocardiograms (ECG) may serve as a diagnostic biomarker for COVID-19. This study aims to utilize ECG signals to detect COVID-19 automatically. We propose a novel method to extract ECG signals from ECG paper records, which are then fed into a one-dimensional convolution neural network (1D-CNN) to learn and diagnose the disease. To evaluate the quality of digitized signals, R peaks in the paper-based ECG images are labeled. Afterward, RR intervals calculated from each image are compared to RR intervals of the corresponding digitized signal. Experiments on the COVID-19 ECG images dataset demonstrate that the proposed digitization method is able to capture correctly the original signals, with a mean absolute error of 28.11 ms. Our proposed 1D-CNN model, which is trained on the digitized ECG signals, allows identifying individuals with COVID-19 and other subjects accurately, with classification accuracies of 98.42%, 95.63%, and 98.50% for classifying COVID-19 vs. Normal, COVID-19 vs. Abnormal Heartbeats, and COVID-19 vs. other classes, respectively. Furthermore, the proposed method also achieves a high-level of performance for the multi-classification task. Our findings indicate that a deep learning system trained on digitized ECG signals can serve as a potential tool for diagnosing COVID-19., Accepted with minor revision by Plos One

Recommendation algorithms save a lot of valuable time for people to get the information they are interested in. However, the feature calculation and extraction process of each machine learning or deep learning recommendation algorithm are different, so how to obtain various features with different dimensions, i.e., how to integrate the advantages of each model and improve the model inference efficiency, becomes the focus of this paper. In this paper, a better deep learning model is obtained by integrating several cutting-edge deep learning models. Meanwhile, to make the integrated learning model converge better and faster, the parameters of the integrated module are initialized, constraints are imposed, and a new activation function is designed for better integration of the sub-models. Finally, the integrated large model is distilled for knowledge distillation, which greatly reduces the number of model parameters and improves the model inference efficiency.

Resource allocation problem is one of key issues in the field of revenue management. The traditional models usually rely on some restrictive assumptions about demand information or arrival process, which is sometimes out of line with reality. To overcome this shortcoming, the method of competitive analysis of online algorithms, which eliminates the need for the assumptions on demand and arrivals, is adopted to deal with the quantity-based revenue management problem. The current model in this paper considers two downgrade compatible levels of resources. Given the capacities and fares of both levels of resources, the objective is to accept appropriate customers and assign them to appropriate resources so as to maximize revenues. Compared with the existing literature, this paper generalizes the concerned resource allocation problem by considering multiple fares for each level of resources. From the perspective of online algorithms and competitive analysis, both an upper bound and an optimal online strategy are derived in this paper.

Choice tests are a standard method to determine preferences in bio-assays, e.g. for food types and food additives such as bait attractants and toxicants. Choice between food additives can be determined only when the food substrate is sufficiently homogeneous. This is difficult to achieve for wood eating organisms as wood is a highly variable biological material, even within a tree species due to the age of the tree (e.g. sapwood vs. heartwood), and components therein (sugar, starch, cellulose and lignin). The current practice to minimise variation is to use wood from the same tree, yet the variation can still be large and the quantity of wood from one tree may be insufficient. We used wood samples of identical volume from multiple sources, measured three physical properties (dry weight, moisture absorption and reflected light intensity), then ranked and clustered the samples using fuzzy c-means clustering. A reverse analysis of the clustered samples found a high correlation between their physical properties and their source of origin. This suggested approach allows a quantifiable, consistent, repeatable, simple and quick method to maximize control over similarity of wood used in choice tests. © 2014 Oberst et al.

When aerial cameras get aerial remote sensing images, the defocus will occur because of reasons such as air pressure, temperature and ground elevation changes, resulting in different image sharpness of continual aerial remote sensing images. Nowadays, the rapidly developing feature matching algorithm will rapidly reduce the registration rate between images with different image sharpness. Therefore, in order to enable aerial cameras to get image sharpness parameters according to the locations of aerial image feature points with inconsistent sharpness, this paper proposes a feature matching algorithm between aerial images with different sharpness by using DEM data and multiple constraints. In this paper, the feature matching range is extended according to the modified aerial imaging model and the nonlinear soft margin support vector machine. Then the relative moving speed and its variation of the feature points in the image are obtained by using the extended L-k optical flow, and finally the epipolar geometric constraint is introduced. To locate the feature points is obtained under multiple constraints, there is no need to calculate the feature point descriptors, and some mismatched point pairs are corrected, which improves the matching efficiency and precision. The experimental results show the feature matching precision of this algorithm is more than 90%, and the running time and matching precision can meet various application needs of aerial cameras.

In the field of surface electromyography (sEMG) gesture recognition, how to improve recognition accuracy has been a research hotspot. The rapid development of deep learning provides a new solution to this problem. At present, the main applications of deep learning for sEMG gesture feature extraction are based on convolutional neural network (CNN) structures to capture spatial morphological information of the multichannel sEMG or based on long short-term memory network (LSTM) to extract time-dependent information of the single-channel sEMG. However, there are few methods to comprehensively consider the distribution area of the sEMG signal acquisition electrode sensor and the arrangement of the sEMG signal morphological features and electrode spatial features. In this paper, a novel multi-stream feature fusion network (MSFF-Net) model is proposed for sEMG gesture recognition. The model adopts a divide-and-conquer strategy to learn the relationship between different muscle regions and specific gestures. Firstly, a multi-stream convolutional neural network (Multi-stream CNN) and a convolutional block attention module integrated with a resblock (ResCBAM) are used to extract multi-dimensional spatial features from signal morphology, electrode space, and feature map space. Then the learned multi-view depth features are fused by a view aggregation network consisting of an early fusion network and a late fusion network. The results of all subjects and gesture movement validation experiments in the sEMG signal acquired from 12 sensors provided by NinaPro’s DB2 and DB4 sub-databases show that the proposed model in this paper has better performance in terms of gesture recognition accuracy compared with the existing models.

Immersive projection display system is widely adopted in virtual reality and various exhibition halls. How to maintain high display quality in an immersive projection environment with uneven illumination and the color deviation caused by the inter-reflection of light is still a challenging task. In this paper, we innovatively propose a deep learning-based radiation compensation for an L-shaped projector-camera system. This method employs complex reflection phenomena to simulate the light transport processing in an L-shaped environment, we also designed a Dark-Channel Enhanced-Compensation Net (DECNet) which composed of a convolutional neural network called Compensation Net, a DarkChannelNet and another subnet (such as sensing network) aiming at achieving high-quality reproduction of projected display images. The final output of DECNet is the compensation image to be projected. It is always a critical problem to establish appropriate evaluation and analysis indexes throughout the research of light pollution compensation algorithms. In this paper, PSNR, SSIM, and RMSE are proposed to quantitatively analyze the image quality. The experimental results show that this method has certain advantages in reducing the inter-reflection of the projection plane. And our method could also well replace the traditional process using the backlight transmission matrix. It can be concluded to a certain that this method can be extended to other more complex projection environments with strong scalability and inclusiveness.

This paper offers a comprehensive analysis model for android malware. The model presents the essential factors affecting the analysis results of android malware that are vision-based. Current android malware analysis and solutions might consider one or some of these factors while building their malware predictive systems. However, this paper comprehensively highlights these factors and their impacts through a deep empirical study. The study comprises 22 CNN (Convolutional Neural Network) algorithms, 21 of them are well-known, and one proposed algorithm. Additionally, several types of files are considered before converting them to images, and two benchmark android malware datasets are utilized. Finally, comprehensive evaluation metrics are measured to assess the produced predictive models from the security and complexity perspectives. Consequently, guiding researchers and developers to plan and build efficient malware analysis systems that meet their requirements and resources. The results reveal that some factors might significantly impact the performance of the malware analysis solution. For example, from a security perspective, the accuracy, F1-score, precision, and recall are improved by 131.29%, 236.44%, 192%, and 131.29%, respectively, when changing one factor and fixing all other factors under study. Similar results are observed in the case of complexity assessment, including testing time, CPU usage, storage size, and pre-processing speed, proving the importance of the proposed android malware analysis model.

An electronic transition-based bare bones particle swarm optimization (ETBBPSO) algorithm is proposed in this paper. The ETBBPSO is designed to present high precision results for high dimensional single-objective optimization problems. Particles in the ETBBPSO are divided into different orbits. A transition operator is proposed to enhance the global search ability of ETBBPSO. The transition behavior of particles gives the swarm more chance to escape from local minimums. In addition, an orbit merge operator is proposed in this paper. An orbit with low search ability will be merged by an orbit with high search ability. Extensive experiments with CEC2014 and CEC2020 are evaluated with ETBBPSO. Four famous population-based algorithms are also selected in the control group. Experimental results prove that ETBBPSO can present high precision results for high dimensional single-objective optimization problems.

Global warming has seriously affected the local climate characteristics of cities, resulting in the frequent occurrence of urban waterlogging with severe economic losses and casualties. Aiming to improve the effectiveness of disaster emergency management, we propose a novel emergency decision model embedding similarity algorithms of heterogeneous multi-attribute based on case-based reasoning. First, this paper establishes a multi-dimensional attribute system of urban waterlogging catastrophes cases based on the Wuli-Shili-Renli theory. Due to the heterogeneity of attributes of waterlogging cases, different algorithms to measure the attribute similarity are designed for crisp symbols, crisp numbers, interval numbers, fuzzy linguistic variables, and hesitant fuzzy linguistic term sets. Then, this paper combines the best-worst method with the maximal deviation method for a more reasonable weight allocation of attributes. Finally, the hybrid similarity between the historical and the target cases is obtained by aggregating attribute similarities via the weighted method. According to the given threshold value, a similar historical case set is built whose emergency measures are used to provide the reference for the target case. Additionally, a case of urban waterlogging emergency is conducted to demonstrate the applicability and effectiveness of the proposed model, which exploits historical experiences and retrieves the optimal scheme for the current disaster emergency with heterogeneous multi attributes. Consequently, the proposed model solves the problem of diverse data types to satisfy the needs of case presentation and retrieval. Compared with the existing model, it can better realize the multi-dimensional expression and fast matching of the cases.

In this paper, we discuss a multi-period portfolio optimization problem based on uncertainty theory and prospect theory. We propose an uncertain multi-period portfolio selection model, in which the return utility and risk of investment are measured by prospect theory utility function and uncertain semivariance. More realistically, the influence of transaction costs and bankruptcy of investor are also considered. Moreover, to solve the portfolio model, this paper designs a new artificial bee colony algorithm by combining sine cosine search method. Finally, a numerical experiment is presented to demonstrate the proposed model and the effectiveness of the designed algorithm.

This paper aims to explore several ways to construct a scientific and comprehensive early warning system (EWS) for local government debt risk in China. In order to achieve this goal, this paper studies the local government debt risk from multiple perspectives, i.e., individual risk, contagion risk, static risk and dynamic risk. Firstly, taking China’s 30 provinces over the period of 2010~ 2018 as a sample, this paper establishes early warning indicators for individual risk of local government debt, and uses the network model to establish early warning indicators for contagion risk of local government debt. Then, this paper applies the criteria importance though intercrieria correlation (CRITIC) method and coefficient of variation method to obtain the proxy variable Ⅰ, which combines the above two risks. Secondly, based on the proxy variable Ⅰ, both the Markov-switching autoregressive (MS-AR) model and coefficient of variation method are used to obtain the proxy variable Ⅱ, which comprehensively considers the individual risk, contagion risk, static risk and dynamic risk of local government debt. Finally, machine learning algorithms are adopted to generalize the EWS designed in this paper. The results show that: (1) From different perspectives of local government debt risk, the list of provinces that require early warning is different; (2) The support vector machines can well generalize our EWS.

To better prevent the potential risks in Internet-based Supply Chain Financing (SCF) products, this paper optimizes and evaluates the Internet-based SCF-oriented Credit Risk Evaluation (CRE) method. Firstly, this paper summarizes 12 risk factors of SCF business, establishes a Risk Assessment Index System (RAIS) with good consistency and stability; then, the principles of Backpropagation (BP) Neural Network (NN) is expounded together with Support Vector Machines (SVM) and Genetic Algorithm (GA) model. Consequently, a CRE model is implemented by the NN tools in MATLAB based on the collection of multiple groups of SCF-oriented risk assessment samples. Subsequently, the assessment samples are trained and tested. Finally, the SCF-oriented CRE model is proposed and verified. The results show that the BP-GA model has presented high prediction consistency with the actual classification. According to the comparison of classification results of SVM, BP model, and BP-GA model, the classification accuracy of test samples of the proposed Internet-based SCF-oriented CRE system using BP-GA model reaches 97.19%; the Type I and Type II error rate of the CRE system based on BP-GA model is 7.2% and 14.21%, respectively. Therefore, a suitable SCF-oriented CRE method is put forward for China’s commercial banks along with scientific and feasible suggestions to manage SCF-oriented credit risks more reasonably and effectively.

The deep neural network is used to establish a neural network model to solve the problems of low accuracy and poor accuracy of traditional algorithms in screening differentially expressed genes and function prediction during the walnut endocarp hardening stage. The paper walnut is used as the research object to analyze the biological information of paper walnut. The changes of lignin deposition during endocarp hardening from 50 days to 90 days are observed by microscope. Then, the Convolutional Neural Network (CNN) and Long and Short-term Memory (LSTM) network model are adopted to construct an expression gene screening and function prediction model. Then, the transcriptome and proteome sequencing and biological information of walnut endocarp samples at 50, 57, 78, and 90 days after flowering are analyzed and taken as the training data set of the CNN + LSTM model. The experimental results demonstrate that the endocarp of paper walnut began to harden at 57 days, and the endocarp tissue on the hardened inner side also began to stain. This indicates that the endocarp hardened laterally from outside to inside. The screening and prediction results show that the CNN + LSTM model’s highest accuracy can reach 0.9264. The Accuracy, Precision, Recall, and F1-score of the CNN + LSTM model are better than the traditional machine learning algorithm. Moreover, the Receiver Operating Curve (ROC) area enclosed by the CNN + LSTM model and coordinate axis is the largest, and the Area Under Curve (AUC) value is 0.9796. The comparison of ROC and AUC proves that the CNN + LSTM model is better than the traditional algorithm for screening differentially expressed genes and function prediction in the walnut endocarp hardening stage. Using deep learning to predict expressed genes’ function accurately can reduce the breeding cost and significantly improve the yield and quality of crops. This research provides scientific guidance for the scientific breeding of paper walnut.

Pathological examination is the gold standard for breast cancer diagnosis. The recognition of histopathological images of breast cancer has attracted a lot of attention in the field of medical image processing. In this paper, on the base of the Bioimaging 2015 dataset, a two-stage nuclei segmentation strategy, that is, a method of watershed segmentation based on histopathological images after stain separation, is proposed to make the dataset recognized to be the carcinoma and non-carcinoma recognition. Firstly, stain separation is performed on breast cancer histopathological images. Then the marker-based watershed segmentation method is used for images obtained from stain separation to achieve the nuclei segmentation target. Next, the completed local binary pattern is used to extract texture features from the nuclei regions (images after nuclei segmentation), and color features were extracted by using the color auto-correlation method on the stain-separated images. Finally, the two kinds of features were fused and the support vector machine was used for carcinoma and non-carcinoma recognition. The experimental results show that the two-stage nuclei segmentation strategy proposed in this paper has significant advantages in the recognition of carcinoma and non-carcinoma on breast cancer histopathological images, and the recognition accuracy arrives at 91.67%. The proposed method is also applied to the ICIAR 2018 dataset to realize the automatic recognition of carcinoma and non-carcinoma, and the recognition accuracy arrives at 92.50%.

The present work aims to find the optimal solution of Nash Equilibrium (NE) in the traditional Game Theory (GT) applied to water resources allocation. Innovatively, this paper introduces Particle Swarm Optimization (PSO) into GT to propose a cooperative game model to solve the NE problem. Firstly, the basic theory of the PSO algorithm and cooperative game model is described. Secondly, the PSO-based cooperative game model is explained. Finally, the PSO-based cooperative game model is compared with the Genetic Algorithm (GA) to test the performance. Besides taking the countries in Lancang Mekong River Basin as the research object, this paper discusses each country’s water consumption and economic benefits under different cooperation patterns. Then, a series of improvement measures and suggestions are put forward accordingly. The results show that the average server occupancy time of the PSO-based cooperative game model is 78.46% lower than that of GA, and the average waiting time is 79.24% lower than that of the GA. Thus, the model reported here has higher computational efficiency and excellent performance than the GA and is more suitable for the current study. In addition, the multi-country cooperation mode can obtain more economic benefits than the independent water resource development mode. This model can quickly find the optimal combination of 16 cooperation modes and has guiding significance for maximizing the benefits of cross-border water Resource Utilization. This research can provide necessary technical support to solve the possible contradictions and conflicts between cross-border river basin countries and build harmonious international relations.

Software Test Case Prioritization (TCP) is an effective approach for regression testing to tackle time and budget constraints. The major benefit of TCP is to save time through the prioritization of important test cases first. Existing TCP techniques can be categorized as value-neutral and value-based approaches. In a value-based fashion, the cost of test cases and severity of faults are considered whereas, in a value-neutral fashion these are not considered. The value-neutral fashion is dominant over value-based fashion, and it assumes that all test cases have equal cost and all software faults have equal severity. But this assumption rarely holds in practice. Therefore, value-neutral TCP techniques are prone to produce unsatisfactory results. To overcome this research gap, a paradigm shift is required from value-neutral to value-based TCP techniques. Currently, very limited work is done in a value-based fashion and to the best of the authors’ knowledge, no comprehensive review of value-based cost-cognizant TCP techniques is available in the literature. To address this problem, a systematic literature review (SLR) of value-based cost-cognizant TCP techniques is presented in this paper. The core objective of this study is to combine the overall knowledge related to value-based cost-cognizant TCP techniques and to highlight some open research problems of this domain. Initially, 165 papers were reviewed from the prominent research repositories. Among these 165 papers, 21 papers were selected by using defined inclusion/exclusion criteria and quality assessment procedures. The established questions are answered through a thorough analysis of the selected papers by comparing their research contributions in terms of the algorithm used, the performance evaluation metric, and the results validation method used. Total 12 papers used an algorithm for their technique but 9 papers didn’t use any algorithm. Particle Swarm Optimization (PSO) Algorithm is dominantly used. For results validation, 4 methods are used including, Empirical study, Experiment, Case study, and Industrial case study. The experiment method is dominantly used. Total 6 performance evaluation metrics are used and the APFDc metric is dominantly used. This SLR yields that value-orientation and cost cognition are vital in the TCP process to achieve its intended goals and there is great research potential in this research domain.

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.

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.

This paper introduces anenhanced MSM(Mutual Subspace Method) methodology for gait recognition, to provide robustness to variations in walking speed. Theenhanced MSM (eMSM)methodology expands and adapts the MSM, commonly used for face recognition, which is a static/physiological biometric, to gait recognition, which is a dynamic/behavioral biometrics. To address the loss of accuracy during calculation of the covariance matrix in the PCA step of MSM, we use a 2D PCA-based mutual subspace. Furhtermore, to enhance the discrimination capability, we rotate images over a number of angles, which enables us to extract richer gait features to then be fused by a boosting method. The eMSM methodology is evaluated on existing data sets which provide variable walking speed, i.e. CASIA-C and OU-ISIR gait databases, and it is shown to outperform state-of-the art methods. While the enhancement to MSM discussed in this paper uses combinations of 2D-PCA, rotation, boosting, other combinations of operations may also be advantageous.

Transmission lines are most prone to faults in the transmission system, so high-precision fault diagnosis is very important for quick troubleshooting. There are some problems in current intelligent fault diagnosis research methods, such as difficulty in extracting fault features accurately, low fault recognition accuracy and poor fault tolerance. In order to solve these problems, this paper proposes an intelligent fault diagnosis method for high voltage direct current transmission lines (HVDC) based on Gramian angular difference field (GADF) domain and improved convolutional neural network (VGG16). This method first performs variational modal decomposition (VMD) on the original fault voltage signal, and then uses the correlation coefficient method to select the appropriate intrinsic mode function (IMF) component, and converts it into a two-dimensional image using the Gramian Angular Difference Field(GADF). Finally, the improved VGG16 network is used to extract and classify fault features adaptively to realize fault diagnosis. In order to improve the performance of the VGG16 fault diagnosis model, batch normalization, dense connection and global average pooling techniques are introduced. The comparative experimental results show that the model proposed in this paper can further identify fault features and has a high fault diagnosis accuracy. In addition, the method is not affected by fault type, transitional resistance and fault distance, has good anti-interference ability, strong fault tolerance, and has great potential in practical applications.

In order to further improve the accuracy of the video-based behavior recognition method, an effective behavior recognition method in the video session using convolutional neural network is proposed. Specifically, by adding the target detection phase before the behavior recognition algorithm, the body region in the video can be accurately extracted to reduce the interference of redundant and unnecessary background noises, and at the same time, the inappropriate images can be replaced, which has reached the role of balance background trade-off, and finally, the neural network can learn the human behavior information with emphasis. By adding fragmentation and stochastic sampling, the long-time time-domain modeling of the whole video session can be established, so that the model can obtain video-level expression ability. Finally, the improved loss function is used for behavior recognition to solve the problem of classification difficulty and possible sample imbalance. In addition, we conducted the hyperparametric experiment, the ablation experiment and the contrast experiment on different open source and benchmark datasets. Compared with other commonly used behavior recognition algorithms, the experimental results verify the effectiveness of the proposed method. In addition, the related deep learning-based methods used in behavior recognition are reviewed at the beginning of this paper, and the challenges in behavior recognition and future research directions are prospected at the end of this paper, which will undoubtedly play a double role in the work of later researchers.

Varieties of raisins are diverse, and different varieties have different nutritional properties and commercial value. In this paper, we propose a method to identify different varieties of raisins by combining near-infrared (NIR) spectroscopy and machine learning algorithms. The direct averaging of the spectra taken for each sample may reduce the experimental data and affect the extraction of spectral features, thus limiting the classification results, due to the different substances of grape skins and flesh. Therefore, this experiment proposes a method to fuse the spectral features of pulp and peel. In this experiment, principal component analysis (PCA) was used to extract baseline corrected features, and linear models of k-nearest neighbor (KNN) and linear discriminant analysis (LDA) and nonlinear models of back propagation (BP), support vector machine with genetic algorithm (GA-SVM), grid search-support vector machine (GS-SVM) and particle swarm optimization with support vector machine (PSO- SVM) coupling were used to classify. This paper compared the results of four experiments using only skin spectrum, only flesh spectrum, average spectrum of skin and flesh, and their spectral feature fusion. The experimental results showed that the accuracy and Macro-F1 score after spectral feature fusion were higher than the other three experiments, and GS-SVM had the highest accuracy and Macro-F1 score of 94.44%. The results showed that feature fusion can improve the performance of both linear and nonlinear models. This may provide a new strategy for acquiring spectral data and improving model performance in the future. The code is available at https://github.com/L-ain/Source.

In this paper, a dynamic update algorithm of double scrambling-DNA row and column closed loop based on chaotic system is proposed. The classical scrambling and diffusion structure are used in the whole process. In the scrambling stage, a new pixel reconstruction method is proposed by combining the Hilbert curve with Knuth-Durstenfeld shuffle algorithm to overcome the shortcoming of nearby storage of Hilbert curve. This method reconstructs the pixel matrix of one-dimensional vector according to the Hilbert curve coding method, and achieves good scrambling effect, while reducing its time complexity and space complexity. In the diffusion stage, combining the plaintext row, the ciphertext row and the key row, and taking advantage of the parallel computing power and high storage density of the DNA encoding, the existing block diffusion operation is improved, and the two-round diffusion of the DNA encoding is proposed. When the last line of ciphertext is generated, the first line of ciphertext is updated and the closed-loop dynamic update of the encryption system is realized. Finally, SHA-256 is used to give the secret key and calculate the initial value of the chaotic system. The simulation results show that the “double scrambling-DNA row and column closed loop dynamic” update algorithm proposed in this paper can effectively improve the efficiency of information transmission and have high security.

This paper proposes a new method for low-light image enhancement with balancing image brightness and preserving image details, this method can improve the brightness and contrast of low-light images while maintaining image details. Traditional histogram equalization methods often lead to excessive enhancement and loss of details, thereby resulting in an unclear and unnatural appearance. In this method, the image is processed bidirectionally. On the one hand, the image is processed by double histogram equalization with double automatic platform method based on improved cuckoo search (CS) algorithm, where the image histogram is segmented firstly, and the platform limit is selected according to the histogram statistics and improved CS technology. Then, the sub-histograms are clipped by two platforms and carried out the histogram equalization respectively. Finally, an image with balanced brightness and good contrast can be obtained. On the other hand, the main structure of the image is extracted based on the total variation model, and the image mask with all the texture details is made by removing the main structure of the image. Eventually, the final enhanced image is obtained by adding the mask with texture details to the image with balanced brightness and good contrast. Compared with the existing methods, the proposed algorithm significantly enhances the visual effect of the low-light images, based on human subjective evaluation and objective evaluation indices. Experimental results show that the proposed method in this paper is better than the existing methods.

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.

Sleep staging is the basis of sleep evaluation and a key step in the diagnosis of sleep-related diseases. Despite being useful, the existing sleep staging methods have several disadvantages, such as relying on artificial feature extraction, failing to recognize temporal sequence patterns in the long-term associated data, and reaching the accuracy upper limit of sleep staging. Hence, this paper proposes an automatic Electroencephalogram (EEG) sleep signal staging model, which based on Multi-scale Attention Residual Nets (MAResnet) and Bidirectional Gated Recurrent Unit (BiGRU). The proposed model is based on the residual neural network in deep learning. Compared with the traditional residual learning module, the proposed model additionally uses the improved channel and spatial feature attention units and convolution kernels of different sizes in parallel at the same position. Thus, multiscale feature extraction of the EEG sleep signals and residual learning of the neural networks is performed to avoid network degradation. Finally, BiGRU is used to determine the dependence between the sleep stages and to realize the automatic learning of sleep data staging features and sleep cycle extraction. According to the experiment, the classification accuracy and kappa coefficient of the proposed method on sleep-EDF data set are 84.24% and 0.78, which are respectively 0.24% and 0.21 higher than the traditional residual net. At the same time, this paper also verified the proposed method on UCD and SHHS data sets, and the figure of classification accuracy is 79.34% and 81.6%, respectively. Compared to related existing studies, the recognition accuracy is significantly improved, which validates the effectiveness and generalization performance of the proposed method.

The bin packing problem has a wide range of applications in industry. With the upgrade of the task difficulty, the traditional 2d rectangular layout algorithm can no longer meet the needs of modern industry, such as express packing task and exoplanet ore collection task. The express or ore samples come in heterogeneous shapes so they cannot all be treated as rectangular pieces. In this paper, we propose a three-stage method called covering, corner-searching and occupying (C,S&O) to solve the two-dimensional multishape part packing problem. The objective of the packing problem variant is to ensure maximum use of the raw material and minimize the trim loss. The algorithm cannot make use of information about the sequence of future objects that are going to arrive, only knowing the shape and size of the coming one, and the coming part must be packed into the bin immediately after its arrival without buffering or readjusting. The method of C,S&O hybridizes the idea of “gold corners, silver edges and grass belly” in the Chinese game Go and the method of finding picture corners in machine vision. In the first stage, the rectangular bin and the coming part are transformed into matrix representation, and generating the position matrix that indicates possible ways of packing the part into the bin. In the second stage, the suitable layout position of the coming part is obtained using machine vision image processing technology for reference. The third stage is calculating the environment matching degree to determine the current optimal placement orientation. In order to facilitate the display of the simulation results, only three shapes of parts are considered in the simulation, rectangle, circle and triangle. The experimental results show the effectiveness of this method. Consulting the literature, it is found that this paper is the first to propose a layout method for multishape manufacturing parts.

In the paper, we proposed a deep learning-based industrial equipment detection algorithm ROMS R-CNN (Rotation Occlusion Multi-Scale Region-CNN). It can solve the problem of inaccurate detection of industrial equipment under complex working conditions such as multi-scale ratio, rotation tilt, occlusion and overlap. The method proposed in this paper first is to construct the MobileNetV2 as the feature pyramid network, and then to combine high semantic information with high resolution information solved industrial equipment detection of different scales. Secondly, a specific rotation anchor scheme is proposed, and the data set is clustered through the k-means algorithm to obtain a specific aspect ratio. Combined with the rotation angle, a rotation anchor of any direction and size is generated to solve the problem of easy tilting of industrial equipment. Finally, a Non-Maximum Suppression algorithm with penalty factors is introduced to solve the overlapping in industrial equipment detection. The experimental results in common industrial equipment detection show that this method is better than other algorithms, significantly improves the missed detection and false detection, and the mAP reaches 0.939.

In this paper, we propose methods for functional predictor selection and the estimation of smooth functional coefficients simultaneously in a scalar-on-function regression problem under high-dimensional multivariate functional data setting. In particular, we develop two methods for functional group-sparse regression under a generic Hilbert space of infinite dimension. We show the convergence of algorithms and the consistency of the estimation and the selection (oracle property) under infinite-dimensional Hilbert spaces. Simulation studies show the effectiveness of the methods in both the selection and the estimation of functional coefficients. The applications to the functional magnetic resonance imaging (fMRI) reveal the regions of the human brain related to ADHD and IQ., The R package that is developed for this paper is available at GitHub. See https://github.com/Ali-Mahzarnia/MFSGrp

Segmentation of retinal vessels is important for doctors to diagnose some diseases. The segmentation accuracy of retinal vessels can be effectively improved by using deep learning methods. However, most of the existing methods are incomplete for shallow feature extraction, and some superficial features are lost, resulting in blurred vessel boundaries and inaccurate segmentation of capillaries in the segmentation results. At the same time, the “layer-by-layer” information fusion between encoder and decoder makes the feature information extracted from the shallow layer of the network cannot be smoothly transferred to the deep layer of the network, resulting in noise in the segmentation features. In this paper, we propose the MFI-Net (Multi-resolution fusion input network) network model to alleviate the above problem to a certain extent. The multi-resolution input module in MFI-Net avoids the loss of coarse-grained feature information in the shallow layer by extracting local and global feature information in different resolutions. We have reconsidered the information fusion method between the encoder and the decoder, and used the information aggregation method to alleviate the information isolation between the shallow and deep layers of the network. MFI-Net is verified on three datasets, DRIVE, CHASE_DB1 and STARE. The experimental results show that our network is at a high level in several metrics, with F1 higher than U-Net by 2.42%, 2.46% and 1.61%, higher than R2U-Net by 1.47%, 2.22% and 0.08%, respectively. Finally, this paper proves the robustness of MFI-Net through experiments and discussions on the stability and generalization ability of MFI-Net.

The COVID-19 pandemic stimulated the interest of scientists, decision makers and the general public in short-term mortality fluctuations caused by epidemics and other natural or man-made disasters. To address this interest and provide a basis for further research, in May 2020, the Short-term Mortality Fluctuations data series was launched as a new section of the Human Mortality Database. At present, this unique data resource provides weekly mortality death counts and rates by age and sex for 38 countries and regions. The main objective of this paper is to detail the web-based application for visualizing and analyzing the excess mortality based on the Short-term Mortality Fluctuation data series. The application yields a visual representation of the database that enhances the understanding of the underlying data. Besides, it enables the users to explore data on weekly mortality and excess mortality across years and countries. The contribution of this paper is twofold. First, to describe a visualization tool that aims to facilitate research on short-term mortality fluctuations. Second, to provide a comprehensive open-source software solution for demographic data to encourage data holders to promote their datasets in a visual framework.

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.