Distributed generators now is widely used in electrical power networks, in some cases it works seasonally, and some types works at special weather conditions like photo voltaic systems and wind energy, and due to this...Distributed generators now is widely used in electrical power networks, in some cases it works seasonally, and some types works at special weather conditions like photo voltaic systems and wind energy, and due to this continuous changes in generation condition, the fault current level in network will be affected, this changes in fault current level will affect in the coordination between protection relays and to keep the coordination at right way, an adaptive protection system is required that can adaptive its setting according to generation changes, the fault current level in each case is evaluated using ETAP software, and the required relay setting in each case is also evaluated using Grey Wolf Optimizer (GWO) algorithm, and to select suitable setting which required in each condition, to select the active setting group of protection relay according to generation capacity, central protection unite can be used, and to improve protection stability and minimizing relays tripping time, a proposed method for selecting suitable backup relay is used, which leads to decrease relays tripping time and increase system stability, output settings for relays in all cases achieved our constrains.展开更多
As the risk of malware is sharply increasing in Android platform,Android malware detection has become an important research topic.Existing works have demonstrated that required permissions of Android applications are ...As the risk of malware is sharply increasing in Android platform,Android malware detection has become an important research topic.Existing works have demonstrated that required permissions of Android applications are valuable for malware analysis,but how to exploit those permission patterns for malware detection remains an open issue.In this paper,we introduce the contrasting permission patterns to characterize the essential differences between malwares and clean applications from the permission aspect Then a framework based on contrasting permission patterns is presented for Android malware detection.According to the proposed framework,an ensemble classifier,Enclamald,is further developed to detect whether an application is potentially malicious.Every contrasting permission pattern is acting as a weak classifier in Enclamald,and the weighted predictions of involved weak classifiers are aggregated to the final result.Experiments on real-world applications validate that the proposed Enclamald classifier outperforms commonly used classifiers for Android Malware Detection.展开更多
Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-roug...Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.展开更多
By using cone-directed contingent derivatives, the unified necessary and sufficient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set-valued optimization.
Let f be an entire solution of the Tumura-Clunie type non-linear delay differential equation.We mainly investigate the dynamical properties of Julia sets of f,and the lower bound estimates of the measure of related li...Let f be an entire solution of the Tumura-Clunie type non-linear delay differential equation.We mainly investigate the dynamical properties of Julia sets of f,and the lower bound estimates of the measure of related limiting directions is verified.展开更多
A set in Rd is called regular if its Hausdorff dimension coincides with its upper box counting dimension. It is proved that a random graph-directed self-similar set is regular a.e..
To improve the yield of Diwangcai and explore its best cultivation way,direct seeding and seedling transplanting of Diwangcai were contrasted. The results showed that cumulative annual yield of Diwangcai by seedling t...To improve the yield of Diwangcai and explore its best cultivation way,direct seeding and seedling transplanting of Diwangcai were contrasted. The results showed that cumulative annual yield of Diwangcai by seedling transplanting was 16% higher than that by direct seeding.展开更多
Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding propert...Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.展开更多
Medical ultrasound contrast imaging is a powerful modality undergoing successive developments in the last decade to date Lately, pulse inversion has been used in both ultrasound tissue harmonic and contrast imaging. H...Medical ultrasound contrast imaging is a powerful modality undergoing successive developments in the last decade to date Lately, pulse inversion has been used in both ultrasound tissue harmonic and contrast imaging. However, there was a tradeoff between resolution and penetration. Chirp excitations partially solved the tradeoff, but the chirp setting parameters were not optimized. The present work proposes for the first time combining chirp inversion with ultrasound contrast imaging, with the motivation to improve the contrast, by automatically optimizing the setting parameters of chirp excitation, it is thus an optimal command problem. Linear chirps, 5 μm diameter microbubbles and gradient ascent algorithm were simulated to optimize the chirp setting parameters. Simulations exhibited a gain of 5 dB by automatic optimization of chirp inversion relative to pulse inversion. The automatic optimization process was quite fast. Combining chirp inversion with ultrasound contrast imaging led to a maximum backscattered power permitting high contrast outcomes and optimum parameters.展开更多
Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table correspondin...Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table corresponding to the cycles and spanning trees of the directed graph is first explored.An algorithm is then derived to find a minimum spanning table corresponding to a minimum spanning tree in the directed graph.Finally,how to use the algorithm to find the optimal expansion of competence set and related problems are discussed.展开更多
文摘Distributed generators now is widely used in electrical power networks, in some cases it works seasonally, and some types works at special weather conditions like photo voltaic systems and wind energy, and due to this continuous changes in generation condition, the fault current level in network will be affected, this changes in fault current level will affect in the coordination between protection relays and to keep the coordination at right way, an adaptive protection system is required that can adaptive its setting according to generation changes, the fault current level in each case is evaluated using ETAP software, and the required relay setting in each case is also evaluated using Grey Wolf Optimizer (GWO) algorithm, and to select suitable setting which required in each condition, to select the active setting group of protection relay according to generation capacity, central protection unite can be used, and to improve protection stability and minimizing relays tripping time, a proposed method for selecting suitable backup relay is used, which leads to decrease relays tripping time and increase system stability, output settings for relays in all cases achieved our constrains.
基金This work was supported by Deakin Cyber Security Research Cluster National Natural Science Foundation of China under Grant Nos. 61304067 and 61202211 +1 种基金 Guangxi Key Laboratory of Trusted Software No. kx201325 the Fundamental Research Funds for the Central Universities under Grant No 31541311314.
文摘As the risk of malware is sharply increasing in Android platform,Android malware detection has become an important research topic.Existing works have demonstrated that required permissions of Android applications are valuable for malware analysis,but how to exploit those permission patterns for malware detection remains an open issue.In this paper,we introduce the contrasting permission patterns to characterize the essential differences between malwares and clean applications from the permission aspect Then a framework based on contrasting permission patterns is presented for Android malware detection.According to the proposed framework,an ensemble classifier,Enclamald,is further developed to detect whether an application is potentially malicious.Every contrasting permission pattern is acting as a weak classifier in Enclamald,and the weighted predictions of involved weak classifiers are aggregated to the final result.Experiments on real-world applications validate that the proposed Enclamald classifier outperforms commonly used classifiers for Android Malware Detection.
基金Supported by the Nature Science Foundation of Henan Province(0511012700).
文摘Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.
基金Supported by the National Natural Science Foundation of China (10571035)
文摘By using cone-directed contingent derivatives, the unified necessary and sufficient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set-valued optimization.
基金supported by the National Natural Science Foundation of China(12171050,12071047)the Fundamental Research Funds for the Central Universities(500421126)。
文摘Let f be an entire solution of the Tumura-Clunie type non-linear delay differential equation.We mainly investigate the dynamical properties of Julia sets of f,and the lower bound estimates of the measure of related limiting directions is verified.
文摘A set in Rd is called regular if its Hausdorff dimension coincides with its upper box counting dimension. It is proved that a random graph-directed self-similar set is regular a.e..
基金Supported by Dazhou Bast Comprehensive Test Station Program of National Bast Fiber Industry Technical System(CARS-16S17)
文摘To improve the yield of Diwangcai and explore its best cultivation way,direct seeding and seedling transplanting of Diwangcai were contrasted. The results showed that cumulative annual yield of Diwangcai by seedling transplanting was 16% higher than that by direct seeding.
基金supported by the National Natural Science Foundation of China (60364001,70461001)the Hainan Provincial Natural Science Foundation of China (807054)Hainan Provincial Education Office Foundation (HJ 2008-56)
文摘Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.
文摘Medical ultrasound contrast imaging is a powerful modality undergoing successive developments in the last decade to date Lately, pulse inversion has been used in both ultrasound tissue harmonic and contrast imaging. However, there was a tradeoff between resolution and penetration. Chirp excitations partially solved the tradeoff, but the chirp setting parameters were not optimized. The present work proposes for the first time combining chirp inversion with ultrasound contrast imaging, with the motivation to improve the contrast, by automatically optimizing the setting parameters of chirp excitation, it is thus an optimal command problem. Linear chirps, 5 μm diameter microbubbles and gradient ascent algorithm were simulated to optimize the chirp setting parameters. Simulations exhibited a gain of 5 dB by automatic optimization of chirp inversion relative to pulse inversion. The automatic optimization process was quite fast. Combining chirp inversion with ultrasound contrast imaging led to a maximum backscattered power permitting high contrast outcomes and optimum parameters.
基金Supported by National Natural Science Foundation of China(No.79870 0 30 )
文摘Each directed graph with the asymmetric costs defined over its arcs,can be represented by a table,which we call an expansion table.The basic properties of cycles and spanning tables of the expansion table corresponding to the cycles and spanning trees of the directed graph is first explored.An algorithm is then derived to find a minimum spanning table corresponding to a minimum spanning tree in the directed graph.Finally,how to use the algorithm to find the optimal expansion of competence set and related problems are discussed.