In this paper,we mainly investigate the dynamical properties of entire solutions of complex differential equations.With some conditions on coefficients,we prove that the set of common limiting directions of Julia sets...In this paper,we mainly investigate the dynamical properties of entire solutions of complex differential equations.With some conditions on coefficients,we prove that the set of common limiting directions of Julia sets of solutions,their derivatives and their primitives must have a definite range of measure.展开更多
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..
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.
This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary an...This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary and sufficient optimality conditions are established for Henig proper and strong minimal solutions respectively in generalized preinvex vector optimization problems.展开更多
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.展开更多
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.展开更多
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.展开更多
One of the most common image processing tasks involves the removal of noise from images. Noise can be introduced during image capture, during transmission, or during storage. For design purposes, noise sources are fre...One of the most common image processing tasks involves the removal of noise from images. Noise can be introduced during image capture, during transmission, or during storage. For design purposes, noise sources are frequently approximated by random variables with a known probability distribution. One common noise model corrupts a signal by introducing impulses. And the surface of the image disturbed by impulse noise displays many peaks or vales. According to the characteristic of impulse noise, a novel algorithm is proposed to the detection of impulse noise point from images based on directional derivatives. First, the theory of calculus on directional derivatives is introduced in detail. Then it is applied to the field of image to removing noise with the discrete form derived from its continuous mathematical model. And a number of contrasting simulations illustrate that our algorithm not only can preserve the structure information while removing impulse noise but also can mostly save the gray value of the pixels undisturbed by noise. In addition, the comparisons of the filtering performance for removing impulse noise are analyzed in detail in the case of different noise densities, and also show that the algorithm suggested outperforms the conventional filter algorithms such as mean filter, median filter and so on in speed and impulse noise reduction, especially in random-valued impulse noise reduction. So it is a very good alternative to the existing schemes.展开更多
The growth of entire functions under the q-difference operators is studied inthis paper, and then some properties of Julia set of entire functions under the higher orderq-difference operators are obtained.
Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new ...Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed.展开更多
The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space wit...The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space without degrading image quality. Compression is required whenever the data handled is huge they may be required to sent or transmitted and also stored. The New Edge Directed Interpolation (NEDI)-based lifting Discrete Wavelet Transfrom (DWT) scheme with modified Set Partitioning In Hierarchical Trees (MSPIHT) algorithm is proposed in this paper. The NEDI algorithm gives good visual quality image particularly at edges. The main objective of this paper is to be preserving the edges while performing image compression which is a challenging task. The NEDI with lifting DWT has achieved 99.18% energy level in the low frequency ranges which has 1.07% higher than 5/3 Wavelet decomposition and 0.94% higher than traditional DWT. To implement this NEDI with Lifting DWT along with MSPIHT algorithm which gives higher Peak Signal to Noise Ratio (PSNR) value and minimum Mean Square Error (MSE) and hence better image quality. The experimental results proved that the proposed method gives better PSNR value (39.40 dB for rate 0.9 bpp without arithmetic coding) and minimum MSE value is 7.4.展开更多
基金supported by Shanghai Center for Mathematical Sci-ences,China Scholarship Council(201206105015)National Science Foundation of China(11171119,11001057,11571049)Natural Science Foundation of Guangdong Province in China(2014A030313422)
文摘In this paper,we mainly investigate the dynamical properties of entire solutions of complex differential equations.With some conditions on coefficients,we prove that the set of common limiting directions of Julia sets of solutions,their derivatives and their primitives must have a definite range of measure.
文摘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 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.
文摘This note studies the optimality conditions of vector optimization problems involving generalized convexity in locally convex spaces. Based upon the concept of Dini set-valued directional derivatives, the necessary and sufficient optimality conditions are established for Henig proper and strong minimal solutions respectively in generalized preinvex vector optimization problems.
文摘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.
基金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 (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.
基金Supported by National Natural Science Foundation of China( 60672072 60832003)Zhejiang Provincial Natural Science Foundation of China(Y106505)
文摘One of the most common image processing tasks involves the removal of noise from images. Noise can be introduced during image capture, during transmission, or during storage. For design purposes, noise sources are frequently approximated by random variables with a known probability distribution. One common noise model corrupts a signal by introducing impulses. And the surface of the image disturbed by impulse noise displays many peaks or vales. According to the characteristic of impulse noise, a novel algorithm is proposed to the detection of impulse noise point from images based on directional derivatives. First, the theory of calculus on directional derivatives is introduced in detail. Then it is applied to the field of image to removing noise with the discrete form derived from its continuous mathematical model. And a number of contrasting simulations illustrate that our algorithm not only can preserve the structure information while removing impulse noise but also can mostly save the gray value of the pixels undisturbed by noise. In addition, the comparisons of the filtering performance for removing impulse noise are analyzed in detail in the case of different noise densities, and also show that the algorithm suggested outperforms the conventional filter algorithms such as mean filter, median filter and so on in speed and impulse noise reduction, especially in random-valued impulse noise reduction. So it is a very good alternative to the existing schemes.
基金supported by the National Natural Science Foundation of China(11571049,11101048)
文摘The growth of entire functions under the q-difference operators is studied inthis paper, and then some properties of Julia set of entire functions under the higher orderq-difference operators are obtained.
基金supported by the Key Foundation of Southwest University for Nationalities(09NZD001).
文摘Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed.
文摘The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space without degrading image quality. Compression is required whenever the data handled is huge they may be required to sent or transmitted and also stored. The New Edge Directed Interpolation (NEDI)-based lifting Discrete Wavelet Transfrom (DWT) scheme with modified Set Partitioning In Hierarchical Trees (MSPIHT) algorithm is proposed in this paper. The NEDI algorithm gives good visual quality image particularly at edges. The main objective of this paper is to be preserving the edges while performing image compression which is a challenging task. The NEDI with lifting DWT has achieved 99.18% energy level in the low frequency ranges which has 1.07% higher than 5/3 Wavelet decomposition and 0.94% higher than traditional DWT. To implement this NEDI with Lifting DWT along with MSPIHT algorithm which gives higher Peak Signal to Noise Ratio (PSNR) value and minimum Mean Square Error (MSE) and hence better image quality. The experimental results proved that the proposed method gives better PSNR value (39.40 dB for rate 0.9 bpp without arithmetic coding) and minimum MSE value is 7.4.