The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classificati...The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classification were significantly greater at 4 weeks after treatment (P 〈 0.01), which suggested that motor imaginary-based brain-computer interface technology improved balance and walking in stroke patients.展开更多
Controls, especially effficiency controls on dynamical processes, have become major challenges in many complex systems. We study an important dynamical process, random walk, due to its wide range of applications for m...Controls, especially effficiency controls on dynamical processes, have become major challenges in many complex systems. We study an important dynamical process, random walk, due to its wide range of applications for modeling the transporting or searching process. For lack of control methods for random walks in various structures, a control technique is presented for a class of weighted treelike scale-free networks with a deep trap at a hub node. The weighted networks are obtained from original models by introducing a weight parameter. We compute analytically the mean first passage time (MFPT) as an indicator for quantitatively measurinM the et^ciency of the random walk process. The results show that the MFPT increases exponentially with the network size, and the exponent varies with the weight parameter. The MFPT, therefore, can be controlled by the weight parameter to behave superlinearly, linearly, or sublinearly with the system size. This work provides further useful insights into controllinM eftlciency in scale-free complex networks.展开更多
Previous studies have demonstrated that hand shadows may activate the motor cortex associated with the mirror neuron system in human brain. However, there is no evidence of activity of the human mirror neuron system d...Previous studies have demonstrated that hand shadows may activate the motor cortex associated with the mirror neuron system in human brain. However, there is no evidence of activity of the human mirror neuron system during the observation of intransitive movements by shadows and line drawings of hands. This study examined the suppression of electroencephalography mu waves (8-13 Hz) induced by observation of stimuli in 18 healthy students. Three stimuli were used: real hand actions, hand shadow actions and actions made by line drawings of hands. The results showed significant desynchronization of the mu rhythm ("mu suppression") across the sensodmotor cortex (recorded at C3, Cz and C4), the frontal cortex (recorded at F3, Fz and F4) and the central and right posterior parietal cortex (recorded at Pz and P4) under all three conditions. Our experimental findings suggest that the observation of "impoverished hand actions", such as intransitive movements of shadows and line drawings of hands, is able to activate widespread cortical areas related to the putative human mirror neuron system.展开更多
Partial Multi-label Learning(PML)deals with the ambiguity where each instance is annotated with a set of candidate labels,and only a subset of which is valid.While existing PML methods focus primarily on label disambi...Partial Multi-label Learning(PML)deals with the ambiguity where each instance is annotated with a set of candidate labels,and only a subset of which is valid.While existing PML methods focus primarily on label disambiguation,they often rely on the assumption of a clean feature space.However,in real-world applications,data are frequently plagued by the co-existence of label noise and feature noise,referred to as the dual noise challenge.Consequently,model robustness degrades substantially.To address this,we propose a framework named Ranking-Consistent Correntropy-based subspace learning for Partial Multi-label Learning(RCC-PML).Unlike existing dual noise PML methods that operate in the input space,our work introduces a subspace learning framework,where robust representation and semantic ranking are jointly optimized to enforce cross-space consistency.Specifically,we leverage the Maximum Correntropy Criterion(MCC)to construct robust scatter matrices,effectively suppressing heavy-tailed feature noise.To tackle label ambiguity,a ranking-consistent constraint is introduced to encourage a reasonable margin between ground-truth and false-positive labels in the projected subspace.Furthermore,we incorporate dualgraph regularization to preserve both the local manifold structure via anchor embedding and global semantic consistency.Finally,L2,1-norm regularization is imposed on the projection matrix to perform adaptive feature selection.Extensive experiments on benchmark datasets demonstrate that the proposed method significantly outperforms state-of-the-art algorithms,particularly in heavy-tailed environments.展开更多
This paper presents a hybrid ensemble classifier combined synthetic minority oversampling technique(SMOTE),random search(RS)hyper-parameters optimization algorithm and gradient boosting tree(GBT)to achieve efficient a...This paper presents a hybrid ensemble classifier combined synthetic minority oversampling technique(SMOTE),random search(RS)hyper-parameters optimization algorithm and gradient boosting tree(GBT)to achieve efficient and accurate rock trace identification.A thirteen-dimensional database consisting of basic,vector,and discontinuity features is established from image samples.All data points are classified as either‘‘trace”or‘‘non-trace”to divide the ultimate results into candidate trace samples.It is found that the SMOTE technology can effectively improve classification performance by recommending an optimized imbalance ratio of 1:5 to 1:4.Then,sixteen classifiers generated from four basic machine learning(ML)models are applied for performance comparison.The results reveal that the proposed RS-SMOTE-GBT classifier outperforms the other fifteen hybrid ML algorithms for both trace and nontrace classifications.Finally,discussions on feature importance,generalization ability and classification error are conducted for the proposed classifier.The experimental results indicate that more critical features affecting the trace classification are primarily from the discontinuity features.Besides,cleaning up the sedimentary pumice and reducing the area of fractured rock contribute to improving the overall classification performance.The proposed method provides a new alternative approach for the identification of 3D rock trace.展开更多
This paper presents a novel integrated method for interactive characterization of fracture spacing in rock tunnel sections.The main procedure includes four steps:(1)Automatic extraction of fracture traces,(2)digitizat...This paper presents a novel integrated method for interactive characterization of fracture spacing in rock tunnel sections.The main procedure includes four steps:(1)Automatic extraction of fracture traces,(2)digitization of trace maps,(3)disconnection and grouping of traces,and(4)interactive measurement of fracture set spacing,total spacing,and surface rock quality designation(S-RQD)value.To evaluate the performance of the proposed method,sample images were obtained by employing a photogrammetrybased scheme in tunnel faces.Experiments were then conducted to determine the optimal parameter values(i.e.distance threshold,angle threshold,and number of fracture trace grouping)for characterizing rock fracture spacing.By applying the identified optimal parameters involved in the model,the proposed method could lead to excellent qualitative results to a new tunnel face.To perform a quantitative analysis,three methods(i.e.field,straightening,and the proposed method)were employed in the same study and comparisons were made.The proposed method agrees well with the field measurement in terms of the maximum and average values of measured spacing distribution.Overall,the proposed method has reasonably good accuracy and interactive advantage for estimating the ultimate fracture spacing and S-RQD.It can be a possible extension of existing methods for fracture spacing characterization for two-dimensional(2D)rock tunnel faces.展开更多
Three-way concept analysis is an important tool for information processing,and rule acquisition is one of the research hotspots of three-way concept analysis.However,compared with three-way concept lattices,three-way ...Three-way concept analysis is an important tool for information processing,and rule acquisition is one of the research hotspots of three-way concept analysis.However,compared with three-way concept lattices,three-way semi-concept lattices have three-way operators with weaker constraints,which can generate more concepts.In this article,the problem of rule acquisition for three-way semi-concept lattices is discussed in general.The authors construct the finer relation of three-way semi-concept lattices,and propose a method of rule acquisition for three-way semi-concept lattices.The authors also discuss the set of decision rules and the relationships of decision rules among object-induced three-way semi-concept lattices,object-induced three-way concept lattices,classical concept lattices and semi-concept lattices.Finally,examples are provided to illustrate the validity of our conclusions.展开更多
Classical radial basis function network(RBFN)is widely used to process the non-linear separable data sets with the introduction of activation functions.However,the setting of parameters for activation functions is ran...Classical radial basis function network(RBFN)is widely used to process the non-linear separable data sets with the introduction of activation functions.However,the setting of parameters for activation functions is random and the distribution of patterns is not taken into account.To process this issue,some scholars introduce the kernel clustering into the RBFN so that the clustering results are related to the parameters about activation functions.On the base of the original kernel clustering,this study further discusses the influence of kernel clustering on an RBFN when the setting of kernel clustering is changing.The changing involves different kernel-clustering ways[bubble sort(BS)and escape nearest outlier(ENO)],multiple kernel-clustering criteria(static and dynamic)etc.Experimental results validate that with the consideration of distribution of patterns and the changes of setting of kernel clustering,the performance of an RBFN is improved and is more feasible for corresponding data sets.Moreover,though BS always costs more time than ENO,it still brings more feasible clustering results.Furthermore,dynamic criterion always cost much more time than static one,but kernel number derived from dynamic criterion is fewer than the one from static.展开更多
MicroRNAs(miRNAs)are small noncoding RNAs of 19-24 nt and play important roles in post-transcriptional regulation of gene expression(Baek et al.,2008;Zhou et al.,2011)and various biological processes including gro...MicroRNAs(miRNAs)are small noncoding RNAs of 19-24 nt and play important roles in post-transcriptional regulation of gene expression(Baek et al.,2008;Zhou et al.,2011)and various biological processes including growth,展开更多
A rough set,first described by Polish computer scientist Zdzis?aw Pawlak,is a formal approximation of a crisp set,and it is now known as a new mathematical tool to process vague concepts.They are used for machine lear...A rough set,first described by Polish computer scientist Zdzis?aw Pawlak,is a formal approximation of a crisp set,and it is now known as a new mathematical tool to process vague concepts.They are used for machine learning,knowledge discovery,feature selection,etc.,and are applied to artificial intelligence,medical informatics,civil engineering,Kansei engineering,decision science,business administration,and so on.Especially,research on data mining using rough sets is widely spreading,and the obtained association rules are applied to the characterisation of data and decision support.展开更多
Petri net is an important tool to model and analyze concurrent systems,but Petri net models are frequently large and complex,and difficult to understand and modify.Slicing is a technique to remove unnecessary parts wi...Petri net is an important tool to model and analyze concurrent systems,but Petri net models are frequently large and complex,and difficult to understand and modify.Slicing is a technique to remove unnecessary parts with respect to a criterion for analyzing programs,and has been widely used in specification level for model reduction,but researches on slicing of Petri nets are still limited.According to the idea of program slicing,this paper extends slicing technologies of Petri nets to four kinds of slices,including backward static slice,backward dynamic slice,forward static slice and forward dynamic slice.Based on the structure properties,the algorithms of obtaining two kinds of static slice are constructed.Then,a new method of slicing backward dynamic slice is proposed based on local reachability graph which can locally reflect the dynamic properties of Petri nets.At last,forward dynamic slice can be obtained through the reachability marking graph under a special marking.The algorithms can be used to reduce the size of Petri net,which can provide the basic technical support for simplifying the complexity of formal verification and analysis.展开更多
Fault injection plays a critical role in the verification of fault-tolerant mechanism, software testing and dependability benchmarking for computer systems. In this paper, according to the characteristics of software ...Fault injection plays a critical role in the verification of fault-tolerant mechanism, software testing and dependability benchmarking for computer systems. In this paper, according to the characteristics of software faults, we propose a new fault injection design pattern based on the PIN framework provided by Intel Company, and develop a PIN-based dynamic software fault injection system (PDSFIS). Faults can be injected by PDSF1S without the source code of target applications under assessment, nor does the injection process involve interruption or software traps. Experimental assessment results of an Apache web server obtained by the dependability benchmarking are presented to demonstrate the potentials of PDSFIS.展开更多
Fairness is one kind of the requirements in QoS of grid services. It is also important to optimize the allocation of grid resources and keep the overall stability of grid systems. At present, more and more economic mo...Fairness is one kind of the requirements in QoS of grid services. It is also important to optimize the allocation of grid resources and keep the overall stability of grid systems. At present, more and more economic models are applied to the grid resource management. In this paper, the fairness of grid resource allocation based on multicommodity market model is studied. Some definitions and criteria of the fairness are presented, and the fairness mechanisms of grid resource allocation are also proposed.展开更多
A modified cuckoo search(CS) algorithm is proposed to solve economic dispatch(ED) problems that have nonconvex, non-continuous or non-linear solution spaces considering valve-point effects, prohibited operating zones,...A modified cuckoo search(CS) algorithm is proposed to solve economic dispatch(ED) problems that have nonconvex, non-continuous or non-linear solution spaces considering valve-point effects, prohibited operating zones, transmission losses and ramp rate limits. Comparing with the traditional cuckoo search algorithm, we propose a self-adaptive step size and some neighbor-study strategies to enhance search performance.Moreover, an improved lambda iteration strategy is used to generate new solutions. To show the superiority of the proposed algorithm over several classic algorithms, four systems with different benchmarks are tested. The results show its efficiency to solve economic dispatch problems, especially for large-scale systems.展开更多
The rapid development of location-based social networks(LBSNs) provides people with an opportunity of better understanding their mobility behavior which enables them to decide their next location.For example,it can he...The rapid development of location-based social networks(LBSNs) provides people with an opportunity of better understanding their mobility behavior which enables them to decide their next location.For example,it can help travelers to choose where to go next,or recommend salesmen the most potential places to deliver advertisements or sell products.In this paper,a method for recommending points of interest(POIs)is proposed based on a collaborative tensor factorization(CTF)technique.Firstly,a generalized objective function is constructed for collaboratively factorizing a tensor with several feature matrices.Secondly,a 3-mode tensor is used to model all users' check-in behaviors,and three feature matrices are extracted to characterize the time distribution,category distribution and POI correlation,respectively.Thirdly,each user's preference to a POI at a specific time can be estimated by using CTF.In order to further improve the recommendation accuracy,PCTF(Partitionbased CTF) is proposed to fill the missing entries of a tensor after clustering its every mode.Experiments on a real checkin database show that the proposed method can provide more accurate location recommendation.展开更多
Interactions between chromatin segments play a large role in functional genomic assays and developments in genomic interaction detection methods have shown interacting topological domains within the genome. Among thes...Interactions between chromatin segments play a large role in functional genomic assays and developments in genomic interaction detection methods have shown interacting topological domains within the genome. Among these methods, Hi-C plays a key role. Here, we present the Genome Interaction Tools and Resources(GITAR), a software to perform a comprehensive Hi-C data analysis, including data preprocessing, normalization, and visualization, as well as analysis of topologically-associated domains(TADs). GITAR is composed of two main modules:(1)HiCtool, a Python library to process and visualize Hi-C data, including TAD analysis; and(2)processed data library, a large collection of human and mouse datasets processed using HiCtool.HiCtool leads the user step-by-step through a pipeline, which goes from the raw Hi-C data to the computation, visualization, and optimized storage of intra-chromosomal contact matrices and TAD coordinates. A large collection of standardized processed data allows the users to compare different datasets in a consistent way, while saving time to obtain data for visualization or additional analyses. More importantly, GITAR enables users without any programming or bioinformatic expertise to work with Hi-C data. GITAR is publicly available at http://gffzz58c71b6d4fe44514hpno9buvbxcbc6pwx.ffgz.tsg.suse.edu.cn as an open-source software.展开更多
There are growing concerns surrounding the data security of social networks because large amount of user information and sensitive data are collected. Differential privacy is an effective method for privacy protection...There are growing concerns surrounding the data security of social networks because large amount of user information and sensitive data are collected. Differential privacy is an effective method for privacy protection that can provide rigorous and quantitative protection. Concerning the application of differential privacy in social networks,this paper analyzes current trends of research and provides some background information including privacy protection standards and noise mechanisms.Focusing on the privacy protection of social network data publishing,a graph-publishing model is designed to provide differential privacy in social networks via three steps: Firstly,according to the features of social network where two nodes that possess certain common properties are associated with a higher probability,a raw graph is divided into several disconnected sub-graphs,and correspondingly dense adjacent matrixes and the number of bridges are obtained. Secondly,taking the advantage of quad-trees,dense region exploration of the adjacent matrixes is conducted. Finally,using an exponential mechanism and leaf nodes of quad-trees,an adjacent matrix of the sanitized graph is reconstructed. In addition,a set of experiments is conducted to evaluate its feasibility,availability and strengths using three analysis techniques: degree distribution,shortest path,and clustering coefficients.展开更多
Ensemble techniques train a set of component classifiers and then combine their predictions to classify new patterns.Bagging is one of the most popular ensemble techniques for improving weak classifiers.However,it is ...Ensemble techniques train a set of component classifiers and then combine their predictions to classify new patterns.Bagging is one of the most popular ensemble techniques for improving weak classifiers.However,it is hard to deploy in many real applications because of the large memory requirement and high computation cost to store and vote the predictions of component classifiers.Rough set theory is a formal mathematical tool to deal with incomplete or imprecise information,which has attracted a lot of attention from theory and application fields.In this paper,a novel rough sets based method is proposed to prune the classifiers obtained from bagging ensemble and select a subset of the component classifiers for aggregation.Experiment results show that the proposed method not only decreases the number of component classifiers but also obtains acceptable performance.展开更多
Geographic routing has been introduced in mobile ad hoc networks and sensor networks. But its per-formance suffers greatly from mobility-induced location errors that can cause Lost Link (LLNK) and LOOP problems. Thu...Geographic routing has been introduced in mobile ad hoc networks and sensor networks. But its per-formance suffers greatly from mobility-induced location errors that can cause Lost Link (LLNK) and LOOP problems. Thus various mobility prediction algorithms have been proposed to mitigate the errors, but sometimes their prediction errors are substantial. A novel mobility prediction technique that incorpo-rates both mobile positioning information and road topology knowledge was presented. Furthermore, the performance of the scheme was evaluated via simulations, along with two other schemes, namely, Linear Velocity Prediction (LVP) and Weighted Velocity Prediction (WVP) for comparison purpose. The results of simulation under Manhattan mobility model show that the proposed scheme could track the movement of a node well and hence provide noticeable improvement over LVP and MVP.展开更多
基金the National Natural Science Foundation of China,No.60970062the Shanghai Pujiang Program,No.09PJ1410200
摘要The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classification were significantly greater at 4 weeks after treatment (P 〈 0.01), which suggested that motor imaginary-based brain-computer interface technology improved balance and walking in stroke patients.
基金Supported by the National Natural Science Foundation of China under Grant Nos 61173118,61373036 and 61272254
摘要Controls, especially effficiency controls on dynamical processes, have become major challenges in many complex systems. We study an important dynamical process, random walk, due to its wide range of applications for modeling the transporting or searching process. For lack of control methods for random walks in various structures, a control technique is presented for a class of weighted treelike scale-free networks with a deep trap at a hub node. The weighted networks are obtained from original models by introducing a weight parameter. We compute analytically the mean first passage time (MFPT) as an indicator for quantitatively measurinM the et^ciency of the random walk process. The results show that the MFPT increases exponentially with the network size, and the exponent varies with the weight parameter. The MFPT, therefore, can be controlled by the weight parameter to behave superlinearly, linearly, or sublinearly with the system size. This work provides further useful insights into controllinM eftlciency in scale-free complex networks.
基金supported by the grants from the National Natural Science Foundation of China,No.60775019,60970062 and 61173116the Research Fund for the Doctoral Program of Higher Education of China,No.201100702110014
摘要Previous studies have demonstrated that hand shadows may activate the motor cortex associated with the mirror neuron system in human brain. However, there is no evidence of activity of the human mirror neuron system during the observation of intransitive movements by shadows and line drawings of hands. This study examined the suppression of electroencephalography mu waves (8-13 Hz) induced by observation of stimuli in 18 healthy students. Three stimuli were used: real hand actions, hand shadow actions and actions made by line drawings of hands. The results showed significant desynchronization of the mu rhythm ("mu suppression") across the sensodmotor cortex (recorded at C3, Cz and C4), the frontal cortex (recorded at F3, Fz and F4) and the central and right posterior parietal cortex (recorded at Pz and P4) under all three conditions. Our experimental findings suggest that the observation of "impoverished hand actions", such as intransitive movements of shadows and line drawings of hands, is able to activate widespread cortical areas related to the putative human mirror neuron system.
基金supported by National Natural Science Foundation of China(Grant 62506223)。
摘要Partial Multi-label Learning(PML)deals with the ambiguity where each instance is annotated with a set of candidate labels,and only a subset of which is valid.While existing PML methods focus primarily on label disambiguation,they often rely on the assumption of a clean feature space.However,in real-world applications,data are frequently plagued by the co-existence of label noise and feature noise,referred to as the dual noise challenge.Consequently,model robustness degrades substantially.To address this,we propose a framework named Ranking-Consistent Correntropy-based subspace learning for Partial Multi-label Learning(RCC-PML).Unlike existing dual noise PML methods that operate in the input space,our work introduces a subspace learning framework,where robust representation and semantic ranking are jointly optimized to enforce cross-space consistency.Specifically,we leverage the Maximum Correntropy Criterion(MCC)to construct robust scatter matrices,effectively suppressing heavy-tailed feature noise.To tackle label ambiguity,a ranking-consistent constraint is introduced to encourage a reasonable margin between ground-truth and false-positive labels in the projected subspace.Furthermore,we incorporate dualgraph regularization to preserve both the local manifold structure via anchor embedding and global semantic consistency.Finally,L2,1-norm regularization is imposed on the projection matrix to perform adaptive feature selection.Extensive experiments on benchmark datasets demonstrate that the proposed method significantly outperforms state-of-the-art algorithms,particularly in heavy-tailed environments.
基金supported by Key innovation team program of innovation talents promotion plan by MOST of China(No.2016RA4059)Natural Science Foundation Committee Program of China(No.51778474)Science and Technology Project of Yunnan Provincial Transportation Department(No.25 of 2018)。
摘要This paper presents a hybrid ensemble classifier combined synthetic minority oversampling technique(SMOTE),random search(RS)hyper-parameters optimization algorithm and gradient boosting tree(GBT)to achieve efficient and accurate rock trace identification.A thirteen-dimensional database consisting of basic,vector,and discontinuity features is established from image samples.All data points are classified as either‘‘trace”or‘‘non-trace”to divide the ultimate results into candidate trace samples.It is found that the SMOTE technology can effectively improve classification performance by recommending an optimized imbalance ratio of 1:5 to 1:4.Then,sixteen classifiers generated from four basic machine learning(ML)models are applied for performance comparison.The results reveal that the proposed RS-SMOTE-GBT classifier outperforms the other fifteen hybrid ML algorithms for both trace and nontrace classifications.Finally,discussions on feature importance,generalization ability and classification error are conducted for the proposed classifier.The experimental results indicate that more critical features affecting the trace classification are primarily from the discontinuity features.Besides,cleaning up the sedimentary pumice and reducing the area of fractured rock contribute to improving the overall classification performance.The proposed method provides a new alternative approach for the identification of 3D rock trace.
基金supported by Key Innovation Team Program of Innovation Talents Promotion Plan by Ministry of Science and Technology(MOST)of China(Grant No.2016RA4059)Science and Technology Project of Yunnan Provincial Transportation Department(Grant No.25 of 2018)Shanghai Science and Technology Committee Program(Grant No.20dz1202200).
摘要This paper presents a novel integrated method for interactive characterization of fracture spacing in rock tunnel sections.The main procedure includes four steps:(1)Automatic extraction of fracture traces,(2)digitization of trace maps,(3)disconnection and grouping of traces,and(4)interactive measurement of fracture set spacing,total spacing,and surface rock quality designation(S-RQD)value.To evaluate the performance of the proposed method,sample images were obtained by employing a photogrammetrybased scheme in tunnel faces.Experiments were then conducted to determine the optimal parameter values(i.e.distance threshold,angle threshold,and number of fracture trace grouping)for characterizing rock fracture spacing.By applying the identified optimal parameters involved in the model,the proposed method could lead to excellent qualitative results to a new tunnel face.To perform a quantitative analysis,three methods(i.e.field,straightening,and the proposed method)were employed in the same study and comparisons were made.The proposed method agrees well with the field measurement in terms of the maximum and average values of measured spacing distribution.Overall,the proposed method has reasonably good accuracy and interactive advantage for estimating the ultimate fracture spacing and S-RQD.It can be a possible extension of existing methods for fracture spacing characterization for two-dimensional(2D)rock tunnel faces.
基金Central University Basic Research Fund of China,Grant/Award Number:FWNX04Ningxia Natural Science Foundation,Grant/Award Number:2021AAC03203National Natural Science Foundation of China,Grant/Award Number:61662001。
摘要Three-way concept analysis is an important tool for information processing,and rule acquisition is one of the research hotspots of three-way concept analysis.However,compared with three-way concept lattices,three-way semi-concept lattices have three-way operators with weaker constraints,which can generate more concepts.In this article,the problem of rule acquisition for three-way semi-concept lattices is discussed in general.The authors construct the finer relation of three-way semi-concept lattices,and propose a method of rule acquisition for three-way semi-concept lattices.The authors also discuss the set of decision rules and the relationships of decision rules among object-induced three-way semi-concept lattices,object-induced three-way concept lattices,classical concept lattices and semi-concept lattices.Finally,examples are provided to illustrate the validity of our conclusions.
基金This work was sponsored by the‘Chenguang Program’supported by the Shanghai Education Development Foundation and Shanghai Municipal Education Commission under Grant no.18CG54.Furthermore,this work was also supported by the National Natural Science Foundation of China(CN)under Grant nos.61602296 and 61673301the Natural Science Foundation of Shanghai(CN)under Grant no.16ZR1414500+1 种基金Project funded by the China Postdoctoral Science Foundation under Grant no.2019M651576the National Key R&D Program of China(Grant no.213).
摘要Classical radial basis function network(RBFN)is widely used to process the non-linear separable data sets with the introduction of activation functions.However,the setting of parameters for activation functions is random and the distribution of patterns is not taken into account.To process this issue,some scholars introduce the kernel clustering into the RBFN so that the clustering results are related to the parameters about activation functions.On the base of the original kernel clustering,this study further discusses the influence of kernel clustering on an RBFN when the setting of kernel clustering is changing.The changing involves different kernel-clustering ways[bubble sort(BS)and escape nearest outlier(ENO)],multiple kernel-clustering criteria(static and dynamic)etc.Experimental results validate that with the consideration of distribution of patterns and the changes of setting of kernel clustering,the performance of an RBFN is improved and is more feasible for corresponding data sets.Moreover,though BS always costs more time than ENO,it still brings more feasible clustering results.Furthermore,dynamic criterion always cost much more time than static one,but kernel number derived from dynamic criterion is fewer than the one from static.
基金partly supported by the National Natural Science Foundation of China(Nos.61572363,91530321 and 61602347)the Natural Science Foundation of Shanghai(No.17ZR1445600)City University of Hong Kong(No.7004707)
摘要MicroRNAs(miRNAs)are small noncoding RNAs of 19-24 nt and play important roles in post-transcriptional regulation of gene expression(Baek et al.,2008;Zhou et al.,2011)and various biological processes including growth,
摘要A rough set,first described by Polish computer scientist Zdzis?aw Pawlak,is a formal approximation of a crisp set,and it is now known as a new mathematical tool to process vague concepts.They are used for machine learning,knowledge discovery,feature selection,etc.,and are applied to artificial intelligence,medical informatics,civil engineering,Kansei engineering,decision science,business administration,and so on.Especially,research on data mining using rough sets is widely spreading,and the obtained association rules are applied to the characterisation of data and decision support.
基金Supported by the National Natural Science Foundation of China(No.90818023)the National Basic Research Program of China(No.2010CB328101)+2 种基金Shanghai Science&Technology Research Plan(No.09JC1414200,09510701300)"Dawn"Program of Shanghai Education Commission,Program for Changjiang Scholars and Innovative Research Team in University(PCSIRT),National Major Projects of Scienceand Technology(No.2009ZX01036-001-002:part 5)Natural Science Foundation of Educational Government of Anhui Province(No.KJ2011A086)
摘要Petri net is an important tool to model and analyze concurrent systems,but Petri net models are frequently large and complex,and difficult to understand and modify.Slicing is a technique to remove unnecessary parts with respect to a criterion for analyzing programs,and has been widely used in specification level for model reduction,but researches on slicing of Petri nets are still limited.According to the idea of program slicing,this paper extends slicing technologies of Petri nets to four kinds of slices,including backward static slice,backward dynamic slice,forward static slice and forward dynamic slice.Based on the structure properties,the algorithms of obtaining two kinds of static slice are constructed.Then,a new method of slicing backward dynamic slice is proposed based on local reachability graph which can locally reflect the dynamic properties of Petri nets.At last,forward dynamic slice can be obtained through the reachability marking graph under a special marking.The algorithms can be used to reduce the size of Petri net,which can provide the basic technical support for simplifying the complexity of formal verification and analysis.
摘要Fault injection plays a critical role in the verification of fault-tolerant mechanism, software testing and dependability benchmarking for computer systems. In this paper, according to the characteristics of software faults, we propose a new fault injection design pattern based on the PIN framework provided by Intel Company, and develop a PIN-based dynamic software fault injection system (PDSFIS). Faults can be injected by PDSF1S without the source code of target applications under assessment, nor does the injection process involve interruption or software traps. Experimental assessment results of an Apache web server obtained by the dependability benchmarking are presented to demonstrate the potentials of PDSFIS.
基金This work is supported by the 863 High-Tcch Project (No. 2004AA104340), the National Natural Science Foundation of China (No. 60173026) and SEC E-Institute: Shanghai High Institutions Grid (No. 200301-1).
摘要Fairness is one kind of the requirements in QoS of grid services. It is also important to optimize the allocation of grid resources and keep the overall stability of grid systems. At present, more and more economic models are applied to the grid resource management. In this paper, the fairness of grid resource allocation based on multicommodity market model is studied. Some definitions and criteria of the fairness are presented, and the fairness mechanisms of grid resource allocation are also proposed.
基金supported in part by the National Key Research and Development Program of China(2017YFB0306400)in part by the National Natural Science Foundation of China(61573089,71472080,71301066)Liaoning Province Dr.Research Foundation of China(20175032)
摘要A modified cuckoo search(CS) algorithm is proposed to solve economic dispatch(ED) problems that have nonconvex, non-continuous or non-linear solution spaces considering valve-point effects, prohibited operating zones, transmission losses and ramp rate limits. Comparing with the traditional cuckoo search algorithm, we propose a self-adaptive step size and some neighbor-study strategies to enhance search performance.Moreover, an improved lambda iteration strategy is used to generate new solutions. To show the superiority of the proposed algorithm over several classic algorithms, four systems with different benchmarks are tested. The results show its efficiency to solve economic dispatch problems, especially for large-scale systems.
基金supported in part by the National Nature Science Foundation of China(91218301,61572360)the Basic Research Projects of People's Public Security University of China(2016JKF01316)Shanghai Shuguang Program(15SG18)
摘要The rapid development of location-based social networks(LBSNs) provides people with an opportunity of better understanding their mobility behavior which enables them to decide their next location.For example,it can help travelers to choose where to go next,or recommend salesmen the most potential places to deliver advertisements or sell products.In this paper,a method for recommending points of interest(POIs)is proposed based on a collaborative tensor factorization(CTF)technique.Firstly,a generalized objective function is constructed for collaboratively factorizing a tensor with several feature matrices.Secondly,a 3-mode tensor is used to model all users' check-in behaviors,and three feature matrices are extracted to characterize the time distribution,category distribution and POI correlation,respectively.Thirdly,each user's preference to a POI at a specific time can be estimated by using CTF.In order to further improve the recommendation accuracy,PCTF(Partitionbased CTF) is proposed to fill the missing entries of a tensor after clustering its every mode.Experiments on a real checkin database show that the proposed method can provide more accurate location recommendation.
基金supported by the National Institutes of Health,United States(Grant Nos.U01CA200147 and DP1HD087990)awarded to SZ
摘要Interactions between chromatin segments play a large role in functional genomic assays and developments in genomic interaction detection methods have shown interacting topological domains within the genome. Among these methods, Hi-C plays a key role. Here, we present the Genome Interaction Tools and Resources(GITAR), a software to perform a comprehensive Hi-C data analysis, including data preprocessing, normalization, and visualization, as well as analysis of topologically-associated domains(TADs). GITAR is composed of two main modules:(1)HiCtool, a Python library to process and visualize Hi-C data, including TAD analysis; and(2)processed data library, a large collection of human and mouse datasets processed using HiCtool.HiCtool leads the user step-by-step through a pipeline, which goes from the raw Hi-C data to the computation, visualization, and optimized storage of intra-chromosomal contact matrices and TAD coordinates. A large collection of standardized processed data allows the users to compare different datasets in a consistent way, while saving time to obtain data for visualization or additional analyses. More importantly, GITAR enables users without any programming or bioinformatic expertise to work with Hi-C data. GITAR is publicly available at http://gffzz58c71b6d4fe44514hpno9buvbxcbc6pwx.ffgz.tsg.suse.edu.cn as an open-source software.
基金Supported by the National Natural Science Foundation of China(No.61105047)the National High Technology Research and Development Program of China(No.2015IM030300)+1 种基金the Science and Technology Committee of Shanghai Support Project(No.14JC1405800)the Project of the Central Universities Fundamental Research of Tongji University
摘要There are growing concerns surrounding the data security of social networks because large amount of user information and sensitive data are collected. Differential privacy is an effective method for privacy protection that can provide rigorous and quantitative protection. Concerning the application of differential privacy in social networks,this paper analyzes current trends of research and provides some background information including privacy protection standards and noise mechanisms.Focusing on the privacy protection of social network data publishing,a graph-publishing model is designed to provide differential privacy in social networks via three steps: Firstly,according to the features of social network where two nodes that possess certain common properties are associated with a higher probability,a raw graph is divided into several disconnected sub-graphs,and correspondingly dense adjacent matrixes and the number of bridges are obtained. Secondly,taking the advantage of quad-trees,dense region exploration of the adjacent matrixes is conducted. Finally,using an exponential mechanism and leaf nodes of quad-trees,an adjacent matrix of the sanitized graph is reconstructed. In addition,a set of experiments is conducted to evaluate its feasibility,availability and strengths using three analysis techniques: degree distribution,shortest path,and clustering coefficients.
基金Supported by the National Natural Science Foundation of China(Granted No.60775036 and No.60475019)the Ph.D.programs Foundation of Ministry of Education of China(No.20060247039)
摘要Ensemble techniques train a set of component classifiers and then combine their predictions to classify new patterns.Bagging is one of the most popular ensemble techniques for improving weak classifiers.However,it is hard to deploy in many real applications because of the large memory requirement and high computation cost to store and vote the predictions of component classifiers.Rough set theory is a formal mathematical tool to deal with incomplete or imprecise information,which has attracted a lot of attention from theory and application fields.In this paper,a novel rough sets based method is proposed to prune the classifiers obtained from bagging ensemble and select a subset of the component classifiers for aggregation.Experiment results show that the proposed method not only decreases the number of component classifiers but also obtains acceptable performance.
摘要Geographic routing has been introduced in mobile ad hoc networks and sensor networks. But its per-formance suffers greatly from mobility-induced location errors that can cause Lost Link (LLNK) and LOOP problems. Thus various mobility prediction algorithms have been proposed to mitigate the errors, but sometimes their prediction errors are substantial. A novel mobility prediction technique that incorpo-rates both mobile positioning information and road topology knowledge was presented. Furthermore, the performance of the scheme was evaluated via simulations, along with two other schemes, namely, Linear Velocity Prediction (LVP) and Weighted Velocity Prediction (WVP) for comparison purpose. The results of simulation under Manhattan mobility model show that the proposed scheme could track the movement of a node well and hence provide noticeable improvement over LVP and MVP.