In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally conv...In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions.展开更多
An improved Euclidean geometry approach to design quasi-cyclic （QC） Low-density parity-check （LDPC） codes with high-rate and low error floor is presented. The constructed QC-LDPC codes with high-rate have lower er...An improved Euclidean geometry approach to design quasi-cyclic （QC） Low-density parity-check （LDPC） codes with high-rate and low error floor is presented. The constructed QC-LDPC codes with high-rate have lower error floor than the original codes. The distribution of the minimum weight codeword is analyzed, and a sufficient existence condition of the minimum weight codeword is found. Simulations show that a lot of QC-LDPC codes with lower error floor can be designed by reducing the number of the minimum weight codewords satisfying this sufficient condition.展开更多
Radar high-resolution range profile （HRRP） has received intensive attention from the radar automatic target recognition （RATR） community. Usually, since the initial phase of a complex HRRP is strongly sensitive to...Radar high-resolution range profile （HRRP） has received intensive attention from the radar automatic target recognition （RATR） community. Usually, since the initial phase of a complex HRRP is strongly sensitive to target position variation, which is referred to as the initial phase sensitivity in this paper, only the amplitude information in the complex HRRP, called the real HRRP in this paper, is used for RATR, whereas the phase information is discarded. However, the remaining phase information except for initial phases in the complex HRRP also contains valuable target discriminant information. This paper proposes a novel feature extraction method for the complex HRRP. The extracted complex feature vector, referred to as the complex feature vector with difference phases, contains the difference phase information between range cells but no initial phase information in the complex HRRR According to the scattering center model, the physical mechanism of the proposed complex feature vector is similar to that of the real HRRP, except for reserving some phase information independent of the initial phase in the complex HRRP. The recognition algorithms, frame-template establishment methods and preprocessing methods used in the real HRRP-based RATR can also be applied to the proposed complex feature vector-based RATR. Moreover, the components in the complex feature vector with difference phases approximate to follow Gaussian distribution, which make it simple to perform the statistical recognition by such complex feature vector. The recognition experiments based on measured data show that the proposed complex feature vector can obtain better recognition performance than the real HRRP if only the cell interval parameters are properly selected.展开更多
This paper presents a classifier named kernel-based nonlinear representor (KNR) for optimal representation of pattern features. Adopting the Gaussian kernel, with the kernel width adaptively estimated by a simple tech...This paper presents a classifier named kernel-based nonlinear representor (KNR) for optimal representation of pattern features. Adopting the Gaussian kernel, with the kernel width adaptively estimated by a simple technique, it is applied to eigenface classification. Experimental results on the ORL face database show that it improves performance by around 6 points, in classification rate, over the Euclidean distance classifier.展开更多
We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a...We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a comparison between non-recursion and a deterministic Markov process, proving that the Markov process is twice as efficient.展开更多
In mathematics, space encompasses various structured sets such as Euclidean, metric, or vector space. This article introduces temporal space—a novel concept independent of traditional spatial dimensions and frames of...In mathematics, space encompasses various structured sets such as Euclidean, metric, or vector space. This article introduces temporal space—a novel concept independent of traditional spatial dimensions and frames of reference, accommodating multiple object-oriented durations in a dynamical system. The novelty of building temporal space using finite geometry is rooted in recent advancements in the theory of relationalism which utilizes Euclidean geometry, set theory, dimensional analysis, and a causal signal system. Multiple independent and co-existing cyclic durations are measurable as a network of finite one-dimensional timelines. The work aligns with Leibniz’s comments on relational measures of duration with the addition of using discrete cyclic relational events that define these finite temporal spaces, applicable to quantum and classical physics. Ancient formulas have symmetry along with divisional and subdivisional orders of operations that create discrete and ordered temporal geometric elements. Elements have cyclically conserved symmetry but unique cyclic dimensional quantities applicable for anchoring temporal equivalence relations in linear time. We present both fixed equivalences and expanded periods of temporal space offering a non-Greek calendar methodology consistent with ancient global timekeeping descriptions. Novel applications of Euclid’s division algorithm and Cantor’s pairing function introduce a novel paired function equation. The mathematical description of finite temporal space within relationalism theory offers an alternative discrete geometric methodology for examining ancient timekeeping with new hypotheses for Egyptian calendars.展开更多
One hundred and sixty-eight genotypes of cotton from the same growing region were used as a germplasm group to study the validity of different genetic distances in constructing cotton core subset. Mixed linear model a...One hundred and sixty-eight genotypes of cotton from the same growing region were used as a germplasm group to study the validity of different genetic distances in constructing cotton core subset. Mixed linear model approach was employed to unbiasedly predict genotypic values of 20 traits for eliminating the environmental effect. Six commonly used genetic distances(Euclidean,standardized Euclidean,Mahalanobis,city block,cosine and correlation distances) combining four commonly used hierarchical cluster methods(single distance,complete distance,unweighted pair-group average and Ward's methods) were used in the least distance stepwise sampling(LDSS) method for constructing different core subsets. The analyses of variance(ANOVA) of different evaluating parameters showed that the validities of cosine and correlation distances were inferior to those of Euclidean,standardized Euclidean,Mahalanobis and city block distances. Standardized Euclidean distance was slightly more effective than Euclidean,Mahalanobis and city block distances. The principal analysis validated standardized Euclidean distance in the course of constructing practical core subsets. The covariance matrix of accessions might be ill-conditioned when Mahalanobis distance was used to calculate genetic distance at low sampling percentages,which led to bias in small-sized core subset construction. The standardized Euclidean distance is recommended in core subset construction with LDSS method.展开更多
In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation(HMT) of structuring elements and t...In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation(HMT) of structuring elements and the set operators. It first produces the EDM image with no more than 4 passes through an image of any kinds, and then the ridge image is extracted by applying a turn-on scheme and performing a rain-fall elimination to accelerate the processing. The one-pixel wide skeleton is finally acquired by carrying out the HMTs of two structure elements and the SUBTRACT and OR operations. Experimental results obtained by practical applications are also presented.展开更多
In response to the challenges posed by insufficient real-time performance and suboptimal matching accuracy of traditional feature matching algorithms within automotive panoramic surround view systems,this paper has pr...In response to the challenges posed by insufficient real-time performance and suboptimal matching accuracy of traditional feature matching algorithms within automotive panoramic surround view systems,this paper has proposed a high-performance dimension reduction parallel matching algorithm that integrates Principal Component Analysis(PCA)and Dual-Heap Filtering(DHF).The algorithm employs PCA to map the feature points into the lower-dimensional space and employs the square of Euclidean distance for feature matching,which significantly reduces computational complexity.To ensure the accuracy of feature matching,the algorithm utilizes Dual-Heap Filtering to filter and refine matched point pairs.To further enhance matching speed and make optimal use of computational resources,the algorithm introduces a multi-core parallel matching strategy,greatly elevating the efficiency of feature matching.Compared to Scale-Invariant Feature Transform(SIFT)and Speeded Up Robust Features(SURF),the proposed algorithm reduces matching time by 77%to 80%and concurrently enhances matching accuracy by 5%to 15%.Experimental results demonstrate that the proposed algorithmexhibits outstanding real-time matching performance and accuracy,effectivelymeeting the feature-matching requirements of automotive panoramic surround view systems.展开更多
In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung n...In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this article.Adescription is provided of the scoring function,accuracy function and operational laws of the log q-rung VS.The algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming distance.Additionally,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify conceptualization.We chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile amnesia.Natural numbers q are used to express the results of the models.To demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.展开更多
Let a:=(a_(1),...,a_(n))2[1,∞)^(n),p∈(0,1),andα:=1/p-1.For any x∈R^(n)and t∈[0,∞),letΦ_(p)(x,t):={t/1+(t[x]_(a)^(ν))^(1-p)if να■N,t/1+(t[x]_(a)^(ν))^(1-p)[log(e+|x|a)]^(p)if να∈N,let where [·]a:=1+...Let a:=(a_(1),...,a_(n))2[1,∞)^(n),p∈(0,1),andα:=1/p-1.For any x∈R^(n)and t∈[0,∞),letΦ_(p)(x,t):={t/1+(t[x]_(a)^(ν))^(1-p)if να■N,t/1+(t[x]_(a)^(ν))^(1-p)[log(e+|x|a)]^(p)if να∈N,let where [·]a:=1+|·|a,|·|a denotes the anisotropic quasi-homogeneous norm with respect to a,and ν:=a_(1)+…+a_(n).Let H_(a)^(p)(R^(n)),L_(a)^(a)(R^(n)),and H_(a)^(Φ_(p))(R^(n))be,respectively,the anisotropic Hardy space,the anisotropic Campanato space,and the anisotropic Musielak-Orlicz Hardy space associated with Φ_(p) on R^(n).In this article,via first establishing the wavelet characterization of anisotropic Campanato spaces,we prove that for any f∈H_(a)^(p)(R^(n))and g∈L_(a)^(a)(R^(n)),the product of f and g can be decomposed into S(f,g)+T(f,g) in the sense of tempered distributions,where S is a bilinear operator bounded from H_(a)^(p)(R^(n))*L_(a)^(a)(R^(Φ_(p))) to L^(1)(R^(n)) and T is a bilinear operator bounded from H_(a)^(p)(R^(n))*L_(a)^(a)(R^(n)) to H_(a)^(Φ_(p))(R^(n)) .Moreover,this bilinear decomposition is sharp in the dual sense that any y■H_(a)^(Φ_(p))(R^(n)) that fits into the above bilinear decomposition should satisfy(L^(1)(R^(n))+y)*=(L^(1)(R^(n)+H_(a)^(Φ_(p))(R^(n))*.As applications,for any non-constant b∈L_(a)^(a)(R^(n)) and any sublinear operator T satisfying some mild bounded assumptions,we find the largest subspace of H_(a)^(p)(R^(n)),denoted by H_(a,b)^(p)(R^(n)),such that the commutator [b,T] is bounded from H_(a,b)^(p)(R^(n))to L^(1)(R^(n)).In addition,when T is an anisotropic CalderónZygmund operator,the boundedness of [b,T] from H_(a,b)^(p)(R^(n))to L^(1)(R^(n))(or to H_(a)^(1)(R^(n)) is also presented.The key of their proofs is the wavelet characterization of function spaces under consideration.展开更多
Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods...Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching solutions.To address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED problem.The proposed algorithm first stores non-dominated optimal solutions found so far into an archive.Then,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index method.This mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant emissions.Moreover,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto solutions.To this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching solutions.The proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance indicators.Also,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED methods.Finally,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs and pollution emissions simultaneously,compared 展开更多
Distance relays are prone to symmetrical power swing phenomenon.To mitigate this issue,a dynamic threshold-supported algorithm is proposed.A single logic is not supposed to be secure for all cases.Thus,a supervisory a...Distance relays are prone to symmetrical power swing phenomenon.To mitigate this issue,a dynamic threshold-supported algorithm is proposed.A single logic is not supposed to be secure for all cases.Thus,a supervisory algorithm,as proposed in this study,can aid in the improvement of the immunity of the relay during swing cases and be sensitive to symmetrical faults.In the developed stages,a three-phase power signal was used and processed in two different steps:(i)extraction of the effective intrinsic mode function(IMF)selected from the Kurtosis analysis using the wavelet synchro-squeezing transform,and(ii)estimation of the average Euclidean distance index using the absolute values of the decomposed IMF’s.The adaptive threshold facilitated resistance to swing situations.At the onset of a symmetrical fault,the proposed algorithm efficiently discriminated among events using a dynamic threshold.The IEEE 39-bus test system and Indian Eastern Power Grid networks were modelled using PSCAD software,and cases were generated to test the efficacy of the method.The impact of the proposed method on a large-scale wind farm was also evaluated.A comparative analysis with other existing methods revealed the security and dependability of the proposed method.展开更多
In this paper, we have introduced the concepts of pseudomonotonicity properties for nonlinear transformations defined on Euclidean Jordan algebras. The implications between this property and other P-properties have be...In this paper, we have introduced the concepts of pseudomonotonicity properties for nonlinear transformations defined on Euclidean Jordan algebras. The implications between this property and other P-properties have been studied. More importantly, we have solved the solvability problem of the nonlinear pseudomonotone complementarity problems over symmetric cones.展开更多
We consider stable representations of non-Dynkin quivers with respect to a central charge.These attract a lot of interest in mathematics and physics since they can be identified with so-called BPS states.Another motiv...We consider stable representations of non-Dynkin quivers with respect to a central charge.These attract a lot of interest in mathematics and physics since they can be identified with so-called BPS states.Another motivation is the work of Dimitrov et al.on the phases of stable representations of the generalized Kronecker quiver.One aim is to explain for general Euclidean and wild quivers the behavior of phases of stable representations well known in some examples.In addition,we study especially the behavior of preinjective,postprojective and regular indecomposable modules.We show that the existence of a stable representation with self-extensions implies the existence of infinitely many stables without self-extensions for rigid central charges.In this case the phases of the stable representations approach one or two limit points.In particular,the phases are not dense in two arcs.The category of representations of acyclic quivers is a special case of rigid Abelian categories which show this behavior for rigid central charges.展开更多
The study delves into the expanding role of network platforms in our daily lives, encompassing various mediums like blogs, forums, online chats, and prominent social media platforms such as Facebook, Twitter, and Inst...The study delves into the expanding role of network platforms in our daily lives, encompassing various mediums like blogs, forums, online chats, and prominent social media platforms such as Facebook, Twitter, and Instagram. While these platforms offer avenues for self-expression and community support, they concurrently harbor negative impacts, fostering antisocial behaviors like phishing, impersonation, hate speech, cyberbullying, cyberstalking, cyberterrorism, fake news propagation, spamming, and fraud. Notably, individuals also leverage these platforms to connect with authorities and seek aid during disasters. The overarching objective of this research is to address the dual nature of network platforms by proposing innovative methodologies aimed at enhancing their positive aspects and mitigating their negative repercussions. To achieve this, the study introduces a weight learning method grounded in multi-linear attribute ranking. This approach serves to evaluate the significance of attribute combinations across all feature spaces. Additionally, a novel clustering method based on tensors is proposed to elevate the quality of clustering while effectively distinguishing selected features. The methodology incorporates a weighted average similarity matrix and optionally integrates weighted Euclidean distance, contributing to a more nuanced understanding of attribute importance. The analysis of the proposed methods yields significant findings. The weight learning method proves instrumental in discerning the importance of attribute combinations, shedding light on key aspects within feature spaces. Simultaneously, the clustering method based on tensors exhibits improved efficacy in enhancing clustering quality and feature distinction. This not only advances our understanding of attribute importance but also paves the way for more nuanced data analysis methodologies. In conclusion, this research underscores the pivotal role of network platforms in contemporary society, emphasizing their potential for both positive contr展开更多
基金supported by National Natural Science Foundation of China (Grant Nos. 10571134, 10671010)Natural Science Foundation of Tianjin (Grant No. 07JCYBJC05200)
文摘In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions.
基金supported by the Scientific Research Program Funded by Shaanxi Provincial Education Department (11JK1007)the Program for Young Teachers in Xi’an University of Posts and Telecommunications (0001286)the National Basic Research Program of China (2012CB328300)
文摘An improved Euclidean geometry approach to design quasi-cyclic （QC） Low-density parity-check （LDPC） codes with high-rate and low error floor is presented. The constructed QC-LDPC codes with high-rate have lower error floor than the original codes. The distribution of the minimum weight codeword is analyzed, and a sufficient existence condition of the minimum weight codeword is found. Simulations show that a lot of QC-LDPC codes with lower error floor can be designed by reducing the number of the minimum weight codewords satisfying this sufficient condition.
基金the National Natural Science Foundation of China(Grant No.60302009)the National Defense Advanced Research Foundation of China(Grant No.413070501)
文摘Radar high-resolution range profile （HRRP） has received intensive attention from the radar automatic target recognition （RATR） community. Usually, since the initial phase of a complex HRRP is strongly sensitive to target position variation, which is referred to as the initial phase sensitivity in this paper, only the amplitude information in the complex HRRP, called the real HRRP in this paper, is used for RATR, whereas the phase information is discarded. However, the remaining phase information except for initial phases in the complex HRRP also contains valuable target discriminant information. This paper proposes a novel feature extraction method for the complex HRRP. The extracted complex feature vector, referred to as the complex feature vector with difference phases, contains the difference phase information between range cells but no initial phase information in the complex HRRR According to the scattering center model, the physical mechanism of the proposed complex feature vector is similar to that of the real HRRP, except for reserving some phase information independent of the initial phase in the complex HRRP. The recognition algorithms, frame-template establishment methods and preprocessing methods used in the real HRRP-based RATR can also be applied to the proposed complex feature vector-based RATR. Moreover, the components in the complex feature vector with difference phases approximate to follow Gaussian distribution, which make it simple to perform the statistical recognition by such complex feature vector. The recognition experiments based on measured data show that the proposed complex feature vector can obtain better recognition performance than the real HRRP if only the cell interval parameters are properly selected.
文摘This paper presents a classifier named kernel-based nonlinear representor (KNR) for optimal representation of pattern features. Adopting the Gaussian kernel, with the kernel width adaptively estimated by a simple technique, it is applied to eigenface classification. Experimental results on the ORL face database show that it improves performance by around 6 points, in classification rate, over the Euclidean distance classifier.
文摘We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a comparison between non-recursion and a deterministic Markov process, proving that the Markov process is twice as efficient.
文摘In mathematics, space encompasses various structured sets such as Euclidean, metric, or vector space. This article introduces temporal space—a novel concept independent of traditional spatial dimensions and frames of reference, accommodating multiple object-oriented durations in a dynamical system. The novelty of building temporal space using finite geometry is rooted in recent advancements in the theory of relationalism which utilizes Euclidean geometry, set theory, dimensional analysis, and a causal signal system. Multiple independent and co-existing cyclic durations are measurable as a network of finite one-dimensional timelines. The work aligns with Leibniz’s comments on relational measures of duration with the addition of using discrete cyclic relational events that define these finite temporal spaces, applicable to quantum and classical physics. Ancient formulas have symmetry along with divisional and subdivisional orders of operations that create discrete and ordered temporal geometric elements. Elements have cyclically conserved symmetry but unique cyclic dimensional quantities applicable for anchoring temporal equivalence relations in linear time. We present both fixed equivalences and expanded periods of temporal space offering a non-Greek calendar methodology consistent with ancient global timekeeping descriptions. Novel applications of Euclid’s division algorithm and Cantor’s pairing function introduce a novel paired function equation. The mathematical description of finite temporal space within relationalism theory offers an alternative discrete geometric methodology for examining ancient timekeeping with new hypotheses for Egyptian calendars.
基金Project supported by the National Natural Science Foundation of China (No. 30270759)the Cooperation Project in Science and Technology between China and Poland Governments (No. 32-38)the Scientific Research Foundation for Doctors in Shandong Academy of Agricultural Sciences (No. [2007]20), China
文摘One hundred and sixty-eight genotypes of cotton from the same growing region were used as a germplasm group to study the validity of different genetic distances in constructing cotton core subset. Mixed linear model approach was employed to unbiasedly predict genotypic values of 20 traits for eliminating the environmental effect. Six commonly used genetic distances(Euclidean,standardized Euclidean,Mahalanobis,city block,cosine and correlation distances) combining four commonly used hierarchical cluster methods(single distance,complete distance,unweighted pair-group average and Ward's methods) were used in the least distance stepwise sampling(LDSS) method for constructing different core subsets. The analyses of variance(ANOVA) of different evaluating parameters showed that the validities of cosine and correlation distances were inferior to those of Euclidean,standardized Euclidean,Mahalanobis and city block distances. Standardized Euclidean distance was slightly more effective than Euclidean,Mahalanobis and city block distances. The principal analysis validated standardized Euclidean distance in the course of constructing practical core subsets. The covariance matrix of accessions might be ill-conditioned when Mahalanobis distance was used to calculate genetic distance at low sampling percentages,which led to bias in small-sized core subset construction. The standardized Euclidean distance is recommended in core subset construction with LDSS method.
文摘In this letter a new skeletonization algorithm is proposed. It combines techniques of fast construction of Euclidean Distance Maps(EDMs), ridge extraction, Hit-or-Miss Transformation(HMT) of structuring elements and the set operators. It first produces the EDM image with no more than 4 passes through an image of any kinds, and then the ridge image is extracted by applying a turn-on scheme and performing a rain-fall elimination to accelerate the processing. The one-pixel wide skeleton is finally acquired by carrying out the HMTs of two structure elements and the SUBTRACT and OR operations. Experimental results obtained by practical applications are also presented.
基金the National Natural Science Foundation of China(61803206)the Key R&D Program of Jiangsu Province(BE2022053-2)the Nanjing Forestry University Youth Science and Technology Innovation Fund(CX2018004)for partly funding this project.
文摘In response to the challenges posed by insufficient real-time performance and suboptimal matching accuracy of traditional feature matching algorithms within automotive panoramic surround view systems,this paper has proposed a high-performance dimension reduction parallel matching algorithm that integrates Principal Component Analysis(PCA)and Dual-Heap Filtering(DHF).The algorithm employs PCA to map the feature points into the lower-dimensional space and employs the square of Euclidean distance for feature matching,which significantly reduces computational complexity.To ensure the accuracy of feature matching,the algorithm utilizes Dual-Heap Filtering to filter and refine matched point pairs.To further enhance matching speed and make optimal use of computational resources,the algorithm introduces a multi-core parallel matching strategy,greatly elevating the efficiency of feature matching.Compared to Scale-Invariant Feature Transform(SIFT)and Speeded Up Robust Features(SURF),the proposed algorithm reduces matching time by 77%to 80%and concurrently enhances matching accuracy by 5%to 15%.Experimental results demonstrate that the proposed algorithmexhibits outstanding real-time matching performance and accuracy,effectivelymeeting the feature-matching requirements of automotive panoramic surround view systems.
基金supported by the National Research Foundation of Korea(NRF)Grant funded by the Korea government(MSIT)(No.RS-2023-00218176)Korea Institute for Advancement of Technology(KIAT)Grant funded by the Korea government(MOTIE)(P0012724)The Competency Development Program for Industry Specialist)and the Soonchunhyang University Research Fund.
文摘In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this article.Adescription is provided of the scoring function,accuracy function and operational laws of the log q-rung VS.The algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming distance.Additionally,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify conceptualization.We chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile amnesia.Natural numbers q are used to express the results of the models.To demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.
基金supported by National Natural Science Foundation of China(Grant Nos.12001527,11971058 and 12071197)the Natural Science Foundation of Jiangsu Province(Grant No.BK20200647)the Postdoctoral Science Foundation of China(Grant No.2021M693422)。
文摘Let a:=(a_(1),...,a_(n))2[1,∞)^(n),p∈(0,1),andα:=1/p-1.For any x∈R^(n)and t∈[0,∞),letΦ_(p)(x,t):={t/1+(t[x]_(a)^(ν))^(1-p)if να■N,t/1+(t[x]_(a)^(ν))^(1-p)[log(e+|x|a)]^(p)if να∈N,let where [·]a:=1+|·|a,|·|a denotes the anisotropic quasi-homogeneous norm with respect to a,and ν:=a_(1)+…+a_(n).Let H_(a)^(p)(R^(n)),L_(a)^(a)(R^(n)),and H_(a)^(Φ_(p))(R^(n))be,respectively,the anisotropic Hardy space,the anisotropic Campanato space,and the anisotropic Musielak-Orlicz Hardy space associated with Φ_(p) on R^(n).In this article,via first establishing the wavelet characterization of anisotropic Campanato spaces,we prove that for any f∈H_(a)^(p)(R^(n))and g∈L_(a)^(a)(R^(n)),the product of f and g can be decomposed into S(f,g)+T(f,g) in the sense of tempered distributions,where S is a bilinear operator bounded from H_(a)^(p)(R^(n))*L_(a)^(a)(R^(Φ_(p))) to L^(1)(R^(n)) and T is a bilinear operator bounded from H_(a)^(p)(R^(n))*L_(a)^(a)(R^(n)) to H_(a)^(Φ_(p))(R^(n)) .Moreover,this bilinear decomposition is sharp in the dual sense that any y■H_(a)^(Φ_(p))(R^(n)) that fits into the above bilinear decomposition should satisfy(L^(1)(R^(n))+y)*=(L^(1)(R^(n)+H_(a)^(Φ_(p))(R^(n))*.As applications,for any non-constant b∈L_(a)^(a)(R^(n)) and any sublinear operator T satisfying some mild bounded assumptions,we find the largest subspace of H_(a)^(p)(R^(n)),denoted by H_(a,b)^(p)(R^(n)),such that the commutator [b,T] is bounded from H_(a,b)^(p)(R^(n))to L^(1)(R^(n)).In addition,when T is an anisotropic CalderónZygmund operator,the boundedness of [b,T] from H_(a,b)^(p)(R^(n))to L^(1)(R^(n))(or to H_(a)^(1)(R^(n)) is also presented.The key of their proofs is the wavelet characterization of function spaces under consideration.
基金supported by the National Natural Science Foundation of China under Grant No.61802328,61972333,and 61771415.
文摘Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching solutions.To address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED problem.The proposed algorithm first stores non-dominated optimal solutions found so far into an archive.Then,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index method.This mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant emissions.Moreover,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto solutions.To this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching solutions.The proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance indicators.Also,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED methods.Finally,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs and pollution emissions simultaneously,compared
文摘Distance relays are prone to symmetrical power swing phenomenon.To mitigate this issue,a dynamic threshold-supported algorithm is proposed.A single logic is not supposed to be secure for all cases.Thus,a supervisory algorithm,as proposed in this study,can aid in the improvement of the immunity of the relay during swing cases and be sensitive to symmetrical faults.In the developed stages,a three-phase power signal was used and processed in two different steps:(i)extraction of the effective intrinsic mode function(IMF)selected from the Kurtosis analysis using the wavelet synchro-squeezing transform,and(ii)estimation of the average Euclidean distance index using the absolute values of the decomposed IMF’s.The adaptive threshold facilitated resistance to swing situations.At the onset of a symmetrical fault,the proposed algorithm efficiently discriminated among events using a dynamic threshold.The IEEE 39-bus test system and Indian Eastern Power Grid networks were modelled using PSCAD software,and cases were generated to test the efficacy of the method.The impact of the proposed method on a large-scale wind farm was also evaluated.A comparative analysis with other existing methods revealed the security and dependability of the proposed method.
基金supported by the Natural Science Basic Research Program of Shaanxi (Program No. 2023-JCYB-048)the National Natural Science Foundation of China (Program No. 11601406)。
文摘In this paper, we have introduced the concepts of pseudomonotonicity properties for nonlinear transformations defined on Euclidean Jordan algebras. The implications between this property and other P-properties have been studied. More importantly, we have solved the solvability problem of the nonlinear pseudomonotone complementarity problems over symmetric cones.
文摘We consider stable representations of non-Dynkin quivers with respect to a central charge.These attract a lot of interest in mathematics and physics since they can be identified with so-called BPS states.Another motivation is the work of Dimitrov et al.on the phases of stable representations of the generalized Kronecker quiver.One aim is to explain for general Euclidean and wild quivers the behavior of phases of stable representations well known in some examples.In addition,we study especially the behavior of preinjective,postprojective and regular indecomposable modules.We show that the existence of a stable representation with self-extensions implies the existence of infinitely many stables without self-extensions for rigid central charges.In this case the phases of the stable representations approach one or two limit points.In particular,the phases are not dense in two arcs.The category of representations of acyclic quivers is a special case of rigid Abelian categories which show this behavior for rigid central charges.
基金sponsored by the National Natural Science Foundation of P.R.China(Nos.62102194 and 62102196)Six Talent Peaks Project of Jiangsu Province(No.RJFW-111)Postgraduate Research and Practice Innovation Program of Jiangsu Province(Nos.KYCX23_1087 and KYCX22_1027).
文摘The study delves into the expanding role of network platforms in our daily lives, encompassing various mediums like blogs, forums, online chats, and prominent social media platforms such as Facebook, Twitter, and Instagram. While these platforms offer avenues for self-expression and community support, they concurrently harbor negative impacts, fostering antisocial behaviors like phishing, impersonation, hate speech, cyberbullying, cyberstalking, cyberterrorism, fake news propagation, spamming, and fraud. Notably, individuals also leverage these platforms to connect with authorities and seek aid during disasters. The overarching objective of this research is to address the dual nature of network platforms by proposing innovative methodologies aimed at enhancing their positive aspects and mitigating their negative repercussions. To achieve this, the study introduces a weight learning method grounded in multi-linear attribute ranking. This approach serves to evaluate the significance of attribute combinations across all feature spaces. Additionally, a novel clustering method based on tensors is proposed to elevate the quality of clustering while effectively distinguishing selected features. The methodology incorporates a weighted average similarity matrix and optionally integrates weighted Euclidean distance, contributing to a more nuanced understanding of attribute importance. The analysis of the proposed methods yields significant findings. The weight learning method proves instrumental in discerning the importance of attribute combinations, shedding light on key aspects within feature spaces. Simultaneously, the clustering method based on tensors exhibits improved efficacy in enhancing clustering quality and feature distinction. This not only advances our understanding of attribute importance but also paves the way for more nuanced data analysis methodologies. In conclusion, this research underscores the pivotal role of network platforms in contemporary society, emphasizing their potential for both positive contr
