The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineeri...The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineering. Combining the integration character of one-phase regressive filter with the iterative formula of inverse matrix,an STMV iterative algorithm is proposed. The computational cost of the iterative algorithm is reduced approximately to be 2/M times of the original one when there are M sensors,and is more advantaged for the realization of the algorithm in real time. Simulation results show that the STMV iterative algorithm can preserve the characters of STMV on high azimuth resolution and weak target detection while the computational cost reduced sharply. The analysis on sea trial data proves that the proposed algorithm can estimate each target's azimuth even when the source powers differ in large scales or their bearings are very approximate.展开更多
The inter-cycle correlation of fission source distributions(FSDs)in the Monte Carlo power iteration process results in variance underestimation of tallied physical quantities,especially in large local tallies.This stu...The inter-cycle correlation of fission source distributions(FSDs)in the Monte Carlo power iteration process results in variance underestimation of tallied physical quantities,especially in large local tallies.This study provides a mesh-free semiquantitative variance underestimation elimination method to obtain a credible confidence interval for the tallied results.This method comprises two procedures:Estimation and Elimination.The FSD inter-cycle correlation length is estimated in the Estimation procedure using the Sliced Wasserstein distance algorithm.The batch method was then used in the elimination procedure.The FSD inter-cycle correlation length was proved to be the optimum batch length to eliminate the variance underestimation problem.We exemplified this method using the OECD sphere array model and 3D PWR BEAVRS model.The results showed that the average variance underestimation ratios of local tallies declined from 37 to 87%to within±5%in these models.展开更多
General active contour algorithm, which uses the intensity of the image, has been used to actively segment objects. Because the objects have a similar intensity but different colors, it is difficult to segment any obj...General active contour algorithm, which uses the intensity of the image, has been used to actively segment objects. Because the objects have a similar intensity but different colors, it is difficult to segment any object from the others, Moreover, this algodthm can only be used in the simple environment since it is very sensitive to noise. In tinter to solve these problems. This paper proposes an extended active contour algorithm based on a color variance. In complex images, the color variance energy as the image energy is introduced into the general active contour algorithm. Experimental results show that the proposed active contour algorithm is very effective in various environments.展开更多
As modern weapons and equipment undergo increasing levels of informatization,intelligence,and networking,the topology and traffic characteristics of battlefield data networks built with tactical data links are becomin...As modern weapons and equipment undergo increasing levels of informatization,intelligence,and networking,the topology and traffic characteristics of battlefield data networks built with tactical data links are becoming progressively complex.In this paper,we employ a traffic matrix to model the tactical data link network.We propose a method that utilizes the Maximum Variance Unfolding(MVU)algorithm to conduct nonlinear dimensionality reduction analysis on high-dimensional open network traffic matrix datasets.This approach introduces novel ideas and methods for future applications,including traffic prediction and anomaly analysis in real battlefield network environments.展开更多
Seismic coherence is used to detect discontinuities in underground media. However, strata with steeply dipping structures often produce false low coherence estimates and thus incorrect discontinuity characterization r...Seismic coherence is used to detect discontinuities in underground media. However, strata with steeply dipping structures often produce false low coherence estimates and thus incorrect discontinuity characterization results. It is important to eliminate or reduce the effect of dipping on coherence estimates. To solve this problem, time-domain dip scanning is typically used to improve estimation of coherence in areas with steeply dipping structures. However, the accuracy of the time-domain estimation of dip is limited by the sampling interval. In contrast, the spectrum amplitude is not affected by the time delays in adjacent seismic traces caused by dipping structures. We propose a coherency algorithm that uses the spectral amplitudes of seismic traces within a predefined analysis window to construct the covariance matrix. The coherency estimates with the proposed algorithm is defined as the ratio between the dominant the constructed covariance matrix. Thus, we eigenvalue and the sum of all eigenvalues of eliminate the effect of dipping structures on coherency estimates. In addition, because different frequency bands of spectral amplitudes are used to estimate coherency, the proposed algorithm has multiscale features. Low frequencies are effective for characterizing large-scale faults, whereas high frequencies are better in characterizing small-scale faults. Application to synthetic and real seismic data show that the proposed algorithm can eliminate the effect of dip and produce better coherence estimates than conventional coherency algorithms in areas with steeply dipping structures.展开更多
Coherent diffractive imaging （CDI） is a lensless imaging technique and can achieve a resolution beyond the Rayleigh or Abbe limit. The ptychographical iterative engine （PIE） is a CDI phase retrieval algorithm that...Coherent diffractive imaging （CDI） is a lensless imaging technique and can achieve a resolution beyond the Rayleigh or Abbe limit. The ptychographical iterative engine （PIE） is a CDI phase retrieval algorithm that uses multiple diffraction patterns obtained through the scan of a localized illumination on the specimen, which has been demonstrated successfully at optical and X-ray wavelengths. In this paper, a general PIE algorithm （gPIE） is presented and demonstrated with an He-Ne laser light diffraction dataset. This algorithm not only permits the removal of the accurate model of the illumination function in PIE, but also provides improved convergence speed and retrieval quality.展开更多
To security support large-scale intelligent applications,distributed machine learning based on blockchain is an intuitive solution scheme.However,the distributed machine learning is difficult to train due to that the ...To security support large-scale intelligent applications,distributed machine learning based on blockchain is an intuitive solution scheme.However,the distributed machine learning is difficult to train due to that the corresponding optimization solver algorithms converge slowly,which highly demand on computing and memory resources.To overcome the challenges,we propose a distributed computing framework for L-BFGS optimization algorithm based on variance reduction method,which is a lightweight,few additional cost and parallelized scheme for the model training process.To validate the claims,we have conducted several experiments on multiple classical datasets.Results show that our proposed computing framework can steadily accelerate the training process of solver in either local mode or distributed mode.展开更多
This paper presents a new method for detection of edges in digital angiographic images. It is found that variances of local regions across edges of images are statistically different from that of those where no edge i...This paper presents a new method for detection of edges in digital angiographic images. It is found that variances of local regions across edges of images are statistically different from that of those where no edge is crossed. This difference can be utilized for the detection of edges of angiographic images. An algorithm based on local variance is proposed. As a result, the edge-detection algorithm is not sensitive to noise and low-level textures of images. A computer program based on the new algorithm has been developed and used by several hospitals.展开更多
Quantum coherence plays a central role in Grover’s search algorithm.We study the Tsallis relative a entropy of coherence dynamics of the evolved state in Grover’s search algorithm.We prove that the Tsallis relative ...Quantum coherence plays a central role in Grover’s search algorithm.We study the Tsallis relative a entropy of coherence dynamics of the evolved state in Grover’s search algorithm.We prove that the Tsallis relative a entropy of coherence decreases with the increase of the success probability,and derive the complementarity relations between the coherence and the success probability.We show that the operator coherence of the first H■relies on the size of the database N,the success probability and the target states.Moreover,we illustrate the relationships between coherence and entanglement of the superposition state of targets,as well as the production and deletion of coherence in Grover iterations.展开更多
In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Gen...In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Generalized Orthogonal Matching Pursuit(GOMP)algorithms for solving this problem,we propose the Piecewise Generalized Orthogonal Matching Pursuit(PGOMP)algorithm,by considering the mixed-decaying sparse signals as piecewise sparse signals with two components containing nonzero entries with different decay factors.The algorithm incorporates piecewise selection and deletion to retain the most significant entries according to the sparsity of each component.We provide a theoretical analysis based on the mutual coherence of the measurement matrix and the decay factors of the nonzero entries,establishing a sufficient condition for the PGOMP algorithm to select at least two correct indices in each iteration.Numerical simulations and an image decomposition experiment demonstrate that the proposed algorithm significantly improves the support recovery probability by effectively matching piecewise sparsity with decay factors.展开更多
Active distribution network(ADN)planning is crucial for achieving a cost-effective transition to modern power systems,yet it poses significant challenges as the system scale increases.The advent of quantum computing o...Active distribution network(ADN)planning is crucial for achieving a cost-effective transition to modern power systems,yet it poses significant challenges as the system scale increases.The advent of quantum computing offers a transformative approach to solve ADN planning.To fully leverage the potential of quantum computing,this paper proposes a photonic quantum acceleration algorithm.First,a quantum-accelerated framework for ADN planning is proposed on the basis of coherent photonic quantum computers.The ADN planning model is then formulated and decomposed into discrete master problems and continuous subproblems to facilitate the quantum optimization process.The photonic quantum-embedded adaptive alternating direction method of multipliers(PQA-ADMM)algorithm is subsequently proposed to equivalently map the discrete master problem onto a quantum-interpretable model,enabling its deployment on a photonic quantum computer.Finally,a comparative analysis with various solvers,including Gurobi,demonstrates that the proposed PQA-ADMM algorithm achieves significant speedup on the modified IEEE 33-node and IEEE 123-node systems,highlighting its effectiveness.展开更多
To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole con...To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole configuration self tuning control algorithm, were proposed. The former can make the variance of the output minimum while the latter can make dynamic behavior satisfying. The stability of the two schemes was analyzed. Simulations of them show that the acceleration in the vertical direction has been reduced greatly. The purpose of reducing vibration is realized. The two schemes can reduce the vibration in the suspension and have some practicability.展开更多
A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates...A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates and the other contains the remaining coordinates. Three inequalities based on the characteristics of the sums and variances of a vector and its two subvectors were introduced to reject those codewords which are impossible to be the nearest codeword. The simulation results show that the proposed algorithm is faster than the improved equal average eaual variance nearest neighbor search (EENNS) algorithm.展开更多
Coherent beam combining of two fibre amplifier chains with a total power of 260 W in a compact system using the stochastic parallel gradient descent （SPGD） algorithm is demonstrated. A 150 MHz linewidth fibre laser ...Coherent beam combining of two fibre amplifier chains with a total power of 260 W in a compact system using the stochastic parallel gradient descent （SPGD） algorithm is demonstrated. A 150 MHz linewidth fibre laser is built and introduced for high-power amplification to mitigate stimulated Brillouin scattering （SBS）. Compact high-power amplifier chains are built with low power all-fibre system and high-power bulk free-optics fibre amplifiers. When the total power is about 260 W, active phase-locking of two high-power amplifiers is demonstrated using the SPGD algorithm. In closed-loop, the power in the main lobe increases 1.68 times, the visibility is increased from 0 to 0.62, and the phase residual error is less than λ/10.展开更多
An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the...An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the data stream computationally intense.This paper proposes a new algorithm based on the propagator method for wideband coherent sources that eliminates eigen-decomposition in order to reduce the computational burden.Data from simulations and lake trials showed that the new algorithm is valid:it resolves coherent sources,breaks left/right ambiguity,and allows inter element spacing to exceed a half-wavelength.展开更多
This paper presented a novel method on designing redundant dictionary from known orthogonal functions. Usual way of discretization of continuous functions is uniform sampling. Our experiments show that dividing the fu...This paper presented a novel method on designing redundant dictionary from known orthogonal functions. Usual way of discretization of continuous functions is uniform sampling. Our experiments show that dividing the function definition interval with non-uniform measure makes the redundant dictionary sparser and it is suitable for image denoising via sparse and redundant dictionary. In this case the problem is to find an appropriate measure in order to make each atom of dictionary. It has shown that in sparse approximation context, incoherent dictionary is suitable for sparse approximation method. According to this fact we define some optimization problems to find the best parameter of distribution measure (in our study normal distribution). For better convergence to optimum point we used Genetic Algorithm (GA) with enough diversity on initial population. We show the effect of this type of dictionary design on exact sparse recovery support. Our results also show the advantage of this design method on image denoising task.展开更多
Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift...Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach： Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features：（1） the ancestors should be more representative than the descendants,（2） the semantic meaning along the ancestor-descendant paths needs to be coherent,（3） the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and（4） tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings： The proposed algorithm has been compared with a well-established solution Heymann Tag Tree（HTT）. The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project（ODP） classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations： A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications： The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value： Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold：（1） an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and（2） the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.展开更多
Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show...Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.展开更多
文摘The steered covariance matrix(STCM) and its inverse matrix should be calculated in each beam for steered minimum variance(STMV) . The inverse matrix needs complex computation and restricts its application in engineering. Combining the integration character of one-phase regressive filter with the iterative formula of inverse matrix,an STMV iterative algorithm is proposed. The computational cost of the iterative algorithm is reduced approximately to be 2/M times of the original one when there are M sensors,and is more advantaged for the realization of the algorithm in real time. Simulation results show that the STMV iterative algorithm can preserve the characters of STMV on high azimuth resolution and weak target detection while the computational cost reduced sharply. The analysis on sea trial data proves that the proposed algorithm can estimate each target's azimuth even when the source powers differ in large scales or their bearings are very approximate.
基金supported by China Nuclear Power Engineering Co.,Ltd.Scientific Research Project(No.KY22104)the fellowship of China Postdoctoral Science Foundation(No.2022M721793).
文摘The inter-cycle correlation of fission source distributions(FSDs)in the Monte Carlo power iteration process results in variance underestimation of tallied physical quantities,especially in large local tallies.This study provides a mesh-free semiquantitative variance underestimation elimination method to obtain a credible confidence interval for the tallied results.This method comprises two procedures:Estimation and Elimination.The FSD inter-cycle correlation length is estimated in the Estimation procedure using the Sliced Wasserstein distance algorithm.The batch method was then used in the elimination procedure.The FSD inter-cycle correlation length was proved to be the optimum batch length to eliminate the variance underestimation problem.We exemplified this method using the OECD sphere array model and 3D PWR BEAVRS model.The results showed that the average variance underestimation ratios of local tallies declined from 37 to 87%to within±5%in these models.
基金supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD),the MKE(The Ministry of knowledge Economy,Korea)the ITRC(Information Technology Research Center)support program(NIPA-2009-(C1090-0902-0007))
文摘General active contour algorithm, which uses the intensity of the image, has been used to actively segment objects. Because the objects have a similar intensity but different colors, it is difficult to segment any object from the others, Moreover, this algodthm can only be used in the simple environment since it is very sensitive to noise. In tinter to solve these problems. This paper proposes an extended active contour algorithm based on a color variance. In complex images, the color variance energy as the image energy is introduced into the general active contour algorithm. Experimental results show that the proposed active contour algorithm is very effective in various environments.
文摘As modern weapons and equipment undergo increasing levels of informatization,intelligence,and networking,the topology and traffic characteristics of battlefield data networks built with tactical data links are becoming progressively complex.In this paper,we employ a traffic matrix to model the tactical data link network.We propose a method that utilizes the Maximum Variance Unfolding(MVU)algorithm to conduct nonlinear dimensionality reduction analysis on high-dimensional open network traffic matrix datasets.This approach introduces novel ideas and methods for future applications,including traffic prediction and anomaly analysis in real battlefield network environments.
基金sponsored by National Key S&T Project of China(No.2011ZX05004-003)the Research Program of RIPED(No.101002kt0b52135)
文摘Seismic coherence is used to detect discontinuities in underground media. However, strata with steeply dipping structures often produce false low coherence estimates and thus incorrect discontinuity characterization results. It is important to eliminate or reduce the effect of dipping on coherence estimates. To solve this problem, time-domain dip scanning is typically used to improve estimation of coherence in areas with steeply dipping structures. However, the accuracy of the time-domain estimation of dip is limited by the sampling interval. In contrast, the spectrum amplitude is not affected by the time delays in adjacent seismic traces caused by dipping structures. We propose a coherency algorithm that uses the spectral amplitudes of seismic traces within a predefined analysis window to construct the covariance matrix. The coherency estimates with the proposed algorithm is defined as the ratio between the dominant the constructed covariance matrix. Thus, we eigenvalue and the sum of all eigenvalues of eliminate the effect of dipping structures on coherency estimates. In addition, because different frequency bands of spectral amplitudes are used to estimate coherency, the proposed algorithm has multiscale features. Low frequencies are effective for characterizing large-scale faults, whereas high frequencies are better in characterizing small-scale faults. Application to synthetic and real seismic data show that the proposed algorithm can eliminate the effect of dip and produce better coherence estimates than conventional coherency algorithms in areas with steeply dipping structures.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11179009 and 50875013)the Beijing Municipal Natural Science Foundation, China (Grant No. 4102036)the Beijing NOVA Program, China (Grant No. 2009A09)
文摘Coherent diffractive imaging （CDI） is a lensless imaging technique and can achieve a resolution beyond the Rayleigh or Abbe limit. The ptychographical iterative engine （PIE） is a CDI phase retrieval algorithm that uses multiple diffraction patterns obtained through the scan of a localized illumination on the specimen, which has been demonstrated successfully at optical and X-ray wavelengths. In this paper, a general PIE algorithm （gPIE） is presented and demonstrated with an He-Ne laser light diffraction dataset. This algorithm not only permits the removal of the accurate model of the illumination function in PIE, but also provides improved convergence speed and retrieval quality.
基金partly supported by National Key Basic Research Program of China(2016YFB1000100)partly supported by National Natural Science Foundation of China(NO.61402490)。
文摘To security support large-scale intelligent applications,distributed machine learning based on blockchain is an intuitive solution scheme.However,the distributed machine learning is difficult to train due to that the corresponding optimization solver algorithms converge slowly,which highly demand on computing and memory resources.To overcome the challenges,we propose a distributed computing framework for L-BFGS optimization algorithm based on variance reduction method,which is a lightweight,few additional cost and parallelized scheme for the model training process.To validate the claims,we have conducted several experiments on multiple classical datasets.Results show that our proposed computing framework can steadily accelerate the training process of solver in either local mode or distributed mode.
文摘This paper presents a new method for detection of edges in digital angiographic images. It is found that variances of local regions across edges of images are statistically different from that of those where no edge is crossed. This difference can be utilized for the detection of edges of angiographic images. An algorithm based on local variance is proposed. As a result, the edge-detection algorithm is not sensitive to noise and low-level textures of images. A computer program based on the new algorithm has been developed and used by several hospitals.
基金supported by the National Natural Science Foundation of China(Grant Nos.12161056,12075159,12171044)Beijing Natural Science Foundation(Grant No.Z190005)the Academician Innovation Platform of Hainan Province。
文摘Quantum coherence plays a central role in Grover’s search algorithm.We study the Tsallis relative a entropy of coherence dynamics of the evolved state in Grover’s search algorithm.We prove that the Tsallis relative a entropy of coherence decreases with the increase of the success probability,and derive the complementarity relations between the coherence and the success probability.We show that the operator coherence of the first H■relies on the size of the database N,the success probability and the target states.Moreover,we illustrate the relationships between coherence and entanglement of the superposition state of targets,as well as the production and deletion of coherence in Grover iterations.
基金Supported by the National Key R&D Program of China(Grant No.2023YFA1009200)the National Natural Science Foundation of China(Grant Nos.12271079+1 种基金12494552)the Fundamental Research Funds for the Central Universities of China(Grant No.DUT24LAB127)。
文摘In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Generalized Orthogonal Matching Pursuit(GOMP)algorithms for solving this problem,we propose the Piecewise Generalized Orthogonal Matching Pursuit(PGOMP)algorithm,by considering the mixed-decaying sparse signals as piecewise sparse signals with two components containing nonzero entries with different decay factors.The algorithm incorporates piecewise selection and deletion to retain the most significant entries according to the sparsity of each component.We provide a theoretical analysis based on the mutual coherence of the measurement matrix and the decay factors of the nonzero entries,establishing a sufficient condition for the PGOMP algorithm to select at least two correct indices in each iteration.Numerical simulations and an image decomposition experiment demonstrate that the proposed algorithm significantly improves the support recovery probability by effectively matching piecewise sparsity with decay factors.
基金supported in part by the National Natural Science Foundation of China under Grant 52307134the Fundamental Research Funds for the Central Universities(xzy012025022)。
文摘Active distribution network(ADN)planning is crucial for achieving a cost-effective transition to modern power systems,yet it poses significant challenges as the system scale increases.The advent of quantum computing offers a transformative approach to solve ADN planning.To fully leverage the potential of quantum computing,this paper proposes a photonic quantum acceleration algorithm.First,a quantum-accelerated framework for ADN planning is proposed on the basis of coherent photonic quantum computers.The ADN planning model is then formulated and decomposed into discrete master problems and continuous subproblems to facilitate the quantum optimization process.The photonic quantum-embedded adaptive alternating direction method of multipliers(PQA-ADMM)algorithm is subsequently proposed to equivalently map the discrete master problem onto a quantum-interpretable model,enabling its deployment on a photonic quantum computer.Finally,a comparative analysis with various solvers,including Gurobi,demonstrates that the proposed PQA-ADMM algorithm achieves significant speedup on the modified IEEE 33-node and IEEE 123-node systems,highlighting its effectiveness.
文摘To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole configuration self tuning control algorithm, were proposed. The former can make the variance of the output minimum while the latter can make dynamic behavior satisfying. The stability of the two schemes was analyzed. Simulations of them show that the acceleration in the vertical direction has been reduced greatly. The purpose of reducing vibration is realized. The two schemes can reduce the vibration in the suspension and have some practicability.
文摘A fast encoding algorithm was presented which made full use of two characteristics of a vector, its sum and variance. In this paper, a vector was separated into two subvectors, one is the first half of the coordinates and the other contains the remaining coordinates. Three inequalities based on the characteristics of the sums and variances of a vector and its two subvectors were introduced to reject those codewords which are impossible to be the nearest codeword. The simulation results show that the proposed algorithm is faster than the improved equal average eaual variance nearest neighbor search (EENNS) algorithm.
基金supported by the Innovation Foundation for Graduates in National University of Defense Technology,China(Grant No.B080702)
文摘Coherent beam combining of two fibre amplifier chains with a total power of 260 W in a compact system using the stochastic parallel gradient descent （SPGD） algorithm is demonstrated. A 150 MHz linewidth fibre laser is built and introduced for high-power amplification to mitigate stimulated Brillouin scattering （SBS）. Compact high-power amplifier chains are built with low power all-fibre system and high-power bulk free-optics fibre amplifiers. When the total power is about 260 W, active phase-locking of two high-power amplifiers is demonstrated using the SPGD algorithm. In closed-loop, the power in the main lobe increases 1.68 times, the visibility is increased from 0 to 0.62, and the phase residual error is less than λ/10.
基金the National 863 Plan Project of Ministry of Science and Technology of China under Grant No.2006AA09Z234
文摘An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the data stream computationally intense.This paper proposes a new algorithm based on the propagator method for wideband coherent sources that eliminates eigen-decomposition in order to reduce the computational burden.Data from simulations and lake trials showed that the new algorithm is valid:it resolves coherent sources,breaks left/right ambiguity,and allows inter element spacing to exceed a half-wavelength.
文摘This paper presented a novel method on designing redundant dictionary from known orthogonal functions. Usual way of discretization of continuous functions is uniform sampling. Our experiments show that dividing the function definition interval with non-uniform measure makes the redundant dictionary sparser and it is suitable for image denoising via sparse and redundant dictionary. In this case the problem is to find an appropriate measure in order to make each atom of dictionary. It has shown that in sparse approximation context, incoherent dictionary is suitable for sparse approximation method. According to this fact we define some optimization problems to find the best parameter of distribution measure (in our study normal distribution). For better convergence to optimum point we used Genetic Algorithm (GA) with enough diversity on initial population. We show the effect of this type of dictionary design on exact sparse recovery support. Our results also show the advantage of this design method on image denoising task.
基金funded by the National Natural Science Foundation of China(Grand No.:70903008)supported by COGS Lab in School of Government,Beijing Normal University
文摘Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach： Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features：（1） the ancestors should be more representative than the descendants,（2） the semantic meaning along the ancestor-descendant paths needs to be coherent,（3） the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and（4） tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings： The proposed algorithm has been compared with a well-established solution Heymann Tag Tree（HTT）. The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project（ODP） classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations： A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications： The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value： Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold：（1） an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and（2） the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.
基金Supported by the National Natural Science Foundation of China (60473012)
文摘Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.
