Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter t...Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter than the combinatorial ones. The codes also illustrate that the conditional combinatorial lower bounds on numbers of encodingdecoding rules are not genuine ones. As an analogue of 3 dimensional case, an A 2 code from 4 dimensional finite projective spaces is constructed, which meets both the information theoretic and combinatorial lower bounds.展开更多
In this paper,we first give the definition of the Euclidean sums of linear codes,and prove that the Euclidean sums of linear codes are Euclidean dual-containing.Then we construct two new classes of optimal asymmetric ...In this paper,we first give the definition of the Euclidean sums of linear codes,and prove that the Euclidean sums of linear codes are Euclidean dual-containing.Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes,and two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of linear codes generated by Vandermonde matrices over finite fields.Moreover,these optimal asymmetric quantum errorcorrecting codes constructed in this paper are different from the ones in the literature.展开更多
The Galileo E1 open service （OS） and the global positioning system （GPS） L1C are intending to use the multiplexed binary offset carrier （MBOC） modulation in E1/L1 band, including both pilot and data components. ...The Galileo E1 open service （OS） and the global positioning system （GPS） L1C are intending to use the multiplexed binary offset carrier （MBOC） modulation in E1/L1 band, including both pilot and data components. The impact of data and pilot codes cross-correlation on the distortion of the discriminator function （i.e., the S-curve） is investigated, when only the pilot （or data） components of MBOC signals are tracked. It is shown that the modulation schemes and the receiver configuration （e.g., the correlator spacing） strongly affect the S-curve bias. In this paper, two methods are proposed to optimize the data/pilot code pairs of Galileo E1 OS and GPS L1C. The optimization goal is to obtain the minimum average S-curve bias when tracking only the pilot components a the specific correlator spacing. Figures of merit, such as S-curve bias, correlation loss and code tracking variance have been adopted for analyzing and comparing the un-optimized and optimized code pairs. Simulation results show that the optimized data/pilot code pairs could significantly mitigate the intra-channel codes cross-correlation, and then improve the code tracking performance of MBOC signals.展开更多
Topology optimization(TO),a numerical technique to find the optimalmaterial layoutwith a given design domain,has attracted interest from researchers in the field of structural optimization in recent years.For beginner...Topology optimization(TO),a numerical technique to find the optimalmaterial layoutwith a given design domain,has attracted interest from researchers in the field of structural optimization in recent years.For beginners,opensource codes are undoubtedly the best alternative to learning TO,which can elaborate the implementation of a method in detail and easily engage more people to employ and extend the method.In this paper,we present a summary of various open-source codes and related literature on TO methods,including solid isotropic material with penalization(SIMP),evolutionary method,level set method(LSM),moving morphable components/voids(MMC/MMV)methods,multiscale topology optimization method,etc.Simultaneously,we classify the codes into five levels,fromeasy to difficult,depending on their difficulty,so that beginners can get started and understand the form of code implementation more quickly.展开更多
The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction perform...The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction performance of channel coding functions as a significant way of optimizing the transmission reliability and efficiency.In this paper,the efficient estimation methods of the block error rate(BLER)performance for rate-compatible polar codes(RCPC)are proposed under several scenarios.Firstly,the BLER performance of RCPC is generally evaluated in the additive white Gaussian noise channels.That is further extended into the Rayleigh fading channel case using an equivalent estimation method.Moreover,with respect to the powerful decoder such as successive cancellation list decoding,the performance estimation is derived analytically based on the polar weight spectrum and BLER upper bounds.Theoretical evaluation and numerical simulation results show that the estimated performance can fit well the practical simulated results of RCPC under the objective conditions,verifying the validity of our proposed performance estimation methods.Furthermore,the application designs of the reliability estimation of RCPC are explored,particularly in the advantages of the signal-to-noise(SNR)estimation and throughput efficiency optimization of polar coded hybrid automatic repeat request.展开更多
Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to cont...Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to control action and a real coded genetic algorithm then proposed to produce a global optimum solution, and proves the feasibility and advantages of this algorithm with the example of a standard test function and a two collocated actuators/sensors cantilever, and comparing the results with those given in the literatures.展开更多
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional densit...A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.展开更多
The complex systems are often in the structure of multi-operating modes, and the components implementing system functions are different under different operation modes, which results in the problems that components of...The complex systems are often in the structure of multi-operating modes, and the components implementing system functions are different under different operation modes, which results in the problems that components often fail in different operating modes, faults can be only detected in specified operating modes, tests can be available in specified operating modes,and the cost and efficiency of detecting and isolating faults are different under different operating modes and isolation levels. Aiming at these problems, an optimal test selection method for fault detection and isolation in the multi-operating mode system is proposed by using the fault pair coding and rollout algorithm. Firstly,the faults in fault-test correlation matrices under different operating modes are combined to fault-pairs, which is used to construct the fault pair-test correlation matrices under different operating modes.Secondly, the final fault pair-test correlation matrix of the multioperating mode system is obtained by operating the fault pair-test correlation matrices under different operating modes. Based on the final fault pair-test correlation matrix, the necessary tests are selected by the rollout algorithm orderly. Finally, the effectiveness of the proposed method is verified by examples of the optimal test selection in the multi-operating mode system with faults isolated to different levels. The result shows that the proposed method can effectively mine the fault detection and isolation ability of tests and it is suitable for the optimal test selection of the multi-operating mode system with faults isolated to the replacement unit and specific fault.展开更多
This letter investigates a delay optimization problem in device-to-device(D2D)networks where users have pre-downloaded subfiles following a coded caching rule.Due to acquiring rest subfiles,users may suffer both recei...This letter investigates a delay optimization problem in device-to-device(D2D)networks where users have pre-downloaded subfiles following a coded caching rule.Due to acquiring rest subfiles,users may suffer both receiving and transmitting delays.To achieve the delay minimization,we first propose a delay-aware mode-selection strategy to adaptively choose multicast or D2D communications mode to reduce the receiving-caused delay.By matching these transmit modes with distinct subfile sizes,we further formulate a min-max optimization problem to minimize the delivery delay.Finally,numerical results prove that the proposed scheme outperforms existing ones in terms of both receiving and transmitting delays.展开更多
Quickly getting back the synchronism of a disturbed interconnected multi-area power system due to variations in loading condition is recognized as prominent issue related to automatic generation control(AGC).In this r...Quickly getting back the synchronism of a disturbed interconnected multi-area power system due to variations in loading condition is recognized as prominent issue related to automatic generation control(AGC).In this regard,AGC system based on fuzzy logic,i.e.,so-called FLAGC can introduce an effectual performance to suppress the dynamic oscillations of tie-line power exchanges and frequency in multi-area interconnected power system.Apart from that,simultaneous coordination scheme based on particle swarm optimization(PSO)along with real coded genetic algorithm(RCGA)is suggested to coordinate FLAGCs of the all areas.To clarify the high efficiency of aforementioned strategy,two different interconnected multi-area power systems,i.e.,three-area hydro-thermal power system and five-area thermal power system have been taken into account for relevant studies.The potency of this strategy has been thoroughly dealt with by considering the step load perturbation(SLP)in both the under study power systems.To sum up,the simulation results have plainly revealed dynamic performance of FLAGC as compared with conventional AGC(CAGC)in each power system in order to damp out the power system oscillations.展开更多
At present, there are some static code analyses and optimizations that can be applied to Concurrent C programs to improve their performance or verify their logical correctness. These analyses and optimizations are int...At present, there are some static code analyses and optimizations that can be applied to Concurrent C programs to improve their performance or verify their logical correctness. These analyses and optimizations are inter-process. In order to make their implementation easy, we propose a new method to construct an optimizing compiling system CCOC for Concurrent C. CCOC supports inter-process code analysis and optimization to Concurrent C programs and does not affect the system's portability and separate compilation of source programs. We also discuss some implementation details of CCOC briefly.展开更多
A way of resolving spreading code mismatches in blind multiuser detection with a particle swarm optimization （PSO） approach is proposed. It has been shown that the PSO algorithm incorporating the linear system of th...A way of resolving spreading code mismatches in blind multiuser detection with a particle swarm optimization （PSO） approach is proposed. It has been shown that the PSO algorithm incorporating the linear system of the decorrelating detector, which is termed as decorrelating PSO （DPSO）, can significantly improve the bit error rate （BER） and the system capacity. As the code mismatch occurs, the output BER performance is vulnerable to degradation for DPSO. With a blind decorrelating scheme, the proposed blind DPSO （BDPSO） offers more robust capabilities over existing DPSO under code mismatch scenarios.展开更多
With the convergence of mobile communication network and Internet in depth, mobile Internet is penetrating into every field of people＇s life. Smart phone bring us great convenience, but it also becomes the breeding g...With the convergence of mobile communication network and Internet in depth, mobile Internet is penetrating into every field of people＇s life. Smart phone bring us great convenience, but it also becomes the breeding ground for the spread of malicious codes. In this paper, we propose a trust transfer algorithm based on the ant colony optimization algorithm to calculate the trust degree between any two nodes in the social network. Afterwards, a defense model based on social computing is presented for mobile phone malware. The simulation results show that our trust transfer algorithm improves the computation accuracy of indirect trust value by 14.65% compared with the TidalTrust algorithm, and the patch transmission speed of our model is faster than that of others.展开更多
Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened com...Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened communication overhead,and escalated storage costs,have significantly constrained the broad-scale application of blockchain.This paper introduces a novel Encode-and CRT-based Scalability Scheme(ECSS),meticulously refined to enhance both block broadcasting and storage.Primarily,ECSS categorizes nodes into distinct domains,thereby reducing the network diameter and augmenting transmission efficiency.Secondly,ECSS streamlines block transmission through a compact block protocol and robust RS coding,which not only reduces the size of broadcasted blocks but also ensures transmission reliability.Finally,ECSS utilizes the Chinese remainder theorem,designating the block body as the compression target and mapping it to multiple modules to achieve efficient storage,thereby alleviating the storage burdens on nodes.To evaluate ECSS’s performance,we established an experimental platformand conducted comprehensive assessments.Empirical results demonstrate that ECSS attains superior network scalability and stability,reducing communication overhead by an impressive 72% and total storage costs by a substantial 63.6%.展开更多
A Gray code based gradient-free optimization(GCO)algorithm is proposed to update the parameters of parameterized quantum circuits(PQCs)in this work.Each parameter of PQCs is encoded as a binary string,named as a gene,...A Gray code based gradient-free optimization(GCO)algorithm is proposed to update the parameters of parameterized quantum circuits(PQCs)in this work.Each parameter of PQCs is encoded as a binary string,named as a gene,and a genetic-based method is adopted to select the offsprings.The individuals in the offspring are decoded in Gray code way to keep Hamming distance,and then are evaluated to obtain the best one with the lowest cost value in each iteration.The algorithm is performed iteratively for all parameters one by one until the cost value satisfies the stop condition or the number of iterations is reached.The GCO algorithm is demonstrated for classification tasks in Iris and MNIST datasets,and their performance are compared by those with the Bayesian optimization algorithm and binary code based optimization algorithm.The simulation results show that the GCO algorithm can reach high accuracies steadily for quantum classification tasks.Importantly,the GCO algorithm has a robust performance in the noise environment.展开更多
A new approach for designing the Biorthogonal Wavelet Filter Bank (BWFB) for the purpose of image compression is presented in this letter. The approach is decomposed into two steps. First, an optimal filter bank is de...A new approach for designing the Biorthogonal Wavelet Filter Bank (BWFB) for the purpose of image compression is presented in this letter. The approach is decomposed into two steps. First, an optimal filter bank is designed in theoretical sense based on Vaidyanathan’s coding gain criterion in SubBand Coding (SBC) system. Then the above filter bank is optimized based on the criterion of Peak Signal-to-Noise Ratio (PSNR) in JPEG2000 image compression system, resulting in a BWFB in practical application sense. With the approach, a series of BWFB for a specific class of applications related to image compression, such as remote sensing images, can be fast designed. Here, new 5/3 BWFB and 9/7 BWFB are presented based on the above approach for the remote sensing image compression applications. Experiments show that the two filter banks are equally performed with respect to CDF 9/7 and LT 5/3 filter in JPEG2000 standard; at the same time, the coefficients and the lifting parameters of the lifting scheme are all rational, which bring the computational advantage, and the ease for VLSI implementation.展开更多
Software systems have been employed in many fields as a means to reduce human efforts;consequently,stakeholders are interested in more updates of their capabilities.Code smells arise as one of the obstacles in the sof...Software systems have been employed in many fields as a means to reduce human efforts;consequently,stakeholders are interested in more updates of their capabilities.Code smells arise as one of the obstacles in the software industry.They are characteristics of software source code that indicate a deeper problem in design.These smells appear not only in the design but also in software implementation.Code smells introduce bugs,affect software maintainability,and lead to higher maintenance costs.Uncovering code smells can be formulated as an optimization problem of finding the best detection rules.Although researchers have recommended different techniques to improve the accuracy of code smell detection,these methods are still unstable and need to be improved.Previous research has sought only to discover a few at a time(three or five types)and did not set rules for detecting their types.Our research improves code smell detection by applying a search-based technique;we use the Whale Optimization Algorithm as a classifier to find ideal detection rules.Applying this algorithm,the Fisher criterion is utilized as a fitness function to maximize the between-class distance over the withinclass variance.The proposed framework adopts if-then detection rules during the software development life cycle.Those rules identify the types for both medium and large projects.Experiments are conducted on five open-source software projects to discover nine smell types that mostly appear in codes.The proposed detection framework has an average of 94.24%precision and 93.4%recall.These accurate values are better than other search-based algorithms of the same field.The proposed framework improves code smell detection,which increases software quality while minimizing maintenance effort,time,and cost.Additionally,the resulting classification rules are analyzed to find the software metrics that differentiate the nine code smells.展开更多
There is a big demand for increasing number of subscribers in the fourth generation mobile communication systems. However, the system performance is limited by multi-path propagations and lack of efficient power alloc...There is a big demand for increasing number of subscribers in the fourth generation mobile communication systems. However, the system performance is limited by multi-path propagations and lack of efficient power allocation algorithms in conventional wireless communication systems. Optimal resource allocation and interference cancellation issues are critical for the improvement of system performance such as throughput and transmission reliability. In this paper, a turbo coded bell lab space time system (TBLAST) with optimal power allocation techniques based on eigen mode, Newton and convex optimization method and carrier-interference-and-noise ratio (CINR) are proposed to improve link reliability and to increase throughput with reasonable computational complexity. The proposed scheme is evaluated by Monte-Carlo simulations and is shown to outperform the conventional power allocation scheme.展开更多
Variable-weight optical orthogonal code(VWOOC)has many important applications in communica tions.In this paper,we obtain several series of optimal(v,W,1,Q)OOCs for W--{3,6},{3,4,6}.
This paper describes optimization process of nozzle cup based on a device for contactless code marking to rough and contaminated surfaces--semiautomatic code marker. During tests using the CFD （computational fluid dy...This paper describes optimization process of nozzle cup based on a device for contactless code marking to rough and contaminated surfaces--semiautomatic code marker. During tests using the CFD （computational fluid dynamics） software different geometry of nozzle cups were compared by such parameters as pressure, velocity and direction of flow. Goal of digital experiments was to find sprayer nozzle geometry that can keep stream of paint in diameter of 10 mm on 10-20 mm distance. Main problem is to avoid low-pressure regions around the stream. The optimal geometry of nozzle cup is designed to get adjusted code dimensions on given distance展开更多
文摘Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter than the combinatorial ones. The codes also illustrate that the conditional combinatorial lower bounds on numbers of encodingdecoding rules are not genuine ones. As an analogue of 3 dimensional case, an A 2 code from 4 dimensional finite projective spaces is constructed, which meets both the information theoretic and combinatorial lower bounds.
基金Supported by the Scientific Research Foundation of Hubei Provincial Education Department of China(Q20174503)the National Science Foundation of Hubei Polytechnic University of China(12xjz14A and 17xjz03A)。
文摘In this paper,we first give the definition of the Euclidean sums of linear codes,and prove that the Euclidean sums of linear codes are Euclidean dual-containing.Then we construct two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of the Reed-Solomon codes,and two new classes of optimal asymmetric quantum error-correcting codes based on Euclidean sums of linear codes generated by Vandermonde matrices over finite fields.Moreover,these optimal asymmetric quantum errorcorrecting codes constructed in this paper are different from the ones in the literature.
基金National Basic Research Program of China(No.2010CB731805)
文摘The Galileo E1 open service （OS） and the global positioning system （GPS） L1C are intending to use the multiplexed binary offset carrier （MBOC） modulation in E1/L1 band, including both pilot and data components. The impact of data and pilot codes cross-correlation on the distortion of the discriminator function （i.e., the S-curve） is investigated, when only the pilot （or data） components of MBOC signals are tracked. It is shown that the modulation schemes and the receiver configuration （e.g., the correlator spacing） strongly affect the S-curve bias. In this paper, two methods are proposed to optimize the data/pilot code pairs of Galileo E1 OS and GPS L1C. The optimization goal is to obtain the minimum average S-curve bias when tracking only the pilot components a the specific correlator spacing. Figures of merit, such as S-curve bias, correlation loss and code tracking variance have been adopted for analyzing and comparing the un-optimized and optimized code pairs. Simulation results show that the optimized data/pilot code pairs could significantly mitigate the intra-channel codes cross-correlation, and then improve the code tracking performance of MBOC signals.
基金supported by the National Key R&D Program of China[Grant Number 2020YFB1708300]the National Natural Science Foundation of China[Grant Number 52075184].
文摘Topology optimization(TO),a numerical technique to find the optimalmaterial layoutwith a given design domain,has attracted interest from researchers in the field of structural optimization in recent years.For beginners,opensource codes are undoubtedly the best alternative to learning TO,which can elaborate the implementation of a method in detail and easily engage more people to employ and extend the method.In this paper,we present a summary of various open-source codes and related literature on TO methods,including solid isotropic material with penalization(SIMP),evolutionary method,level set method(LSM),moving morphable components/voids(MMC/MMV)methods,multiscale topology optimization method,etc.Simultaneously,we classify the codes into five levels,fromeasy to difficult,depending on their difficulty,so that beginners can get started and understand the form of code implementation more quickly.
基金supported by National Natural Science Foundation of China(No.62201596)Research Planning Project of National University of Defense Technology(ZK22-45).
文摘The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction performance of channel coding functions as a significant way of optimizing the transmission reliability and efficiency.In this paper,the efficient estimation methods of the block error rate(BLER)performance for rate-compatible polar codes(RCPC)are proposed under several scenarios.Firstly,the BLER performance of RCPC is generally evaluated in the additive white Gaussian noise channels.That is further extended into the Rayleigh fading channel case using an equivalent estimation method.Moreover,with respect to the powerful decoder such as successive cancellation list decoding,the performance estimation is derived analytically based on the polar weight spectrum and BLER upper bounds.Theoretical evaluation and numerical simulation results show that the estimated performance can fit well the practical simulated results of RCPC under the objective conditions,verifying the validity of our proposed performance estimation methods.Furthermore,the application designs of the reliability estimation of RCPC are explored,particularly in the advantages of the signal-to-noise(SNR)estimation and throughput efficiency optimization of polar coded hybrid automatic repeat request.
文摘Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to control action and a real coded genetic algorithm then proposed to produce a global optimum solution, and proves the feasibility and advantages of this algorithm with the example of a standard test function and a two collocated actuators/sensors cantilever, and comparing the results with those given in the literatures.
基金Leading Academic Discipline Project of Shanghai Municipal Education Commission,China(No.J51801)Shanghai Second Polytechnic University Foundation,China(No.QD209008)Leading Academic Discipline Project of Shanghai Second Polytechnic University,China(No.XXKZD1302)
文摘A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.
基金supported by the Natural Science Foundation of Shannxi Province(2017JQ5016)the Joint Laboratory for Sea Measurement and Control of Aircraft(DOM2016OF011)
文摘The complex systems are often in the structure of multi-operating modes, and the components implementing system functions are different under different operation modes, which results in the problems that components often fail in different operating modes, faults can be only detected in specified operating modes, tests can be available in specified operating modes,and the cost and efficiency of detecting and isolating faults are different under different operating modes and isolation levels. Aiming at these problems, an optimal test selection method for fault detection and isolation in the multi-operating mode system is proposed by using the fault pair coding and rollout algorithm. Firstly,the faults in fault-test correlation matrices under different operating modes are combined to fault-pairs, which is used to construct the fault pair-test correlation matrices under different operating modes.Secondly, the final fault pair-test correlation matrix of the multioperating mode system is obtained by operating the fault pair-test correlation matrices under different operating modes. Based on the final fault pair-test correlation matrix, the necessary tests are selected by the rollout algorithm orderly. Finally, the effectiveness of the proposed method is verified by examples of the optimal test selection in the multi-operating mode system with faults isolated to different levels. The result shows that the proposed method can effectively mine the fault detection and isolation ability of tests and it is suitable for the optimal test selection of the multi-operating mode system with faults isolated to the replacement unit and specific fault.
基金partly supported by the National Natural Science Foundation of China (No.61601334,61601509)
文摘This letter investigates a delay optimization problem in device-to-device(D2D)networks where users have pre-downloaded subfiles following a coded caching rule.Due to acquiring rest subfiles,users may suffer both receiving and transmitting delays.To achieve the delay minimization,we first propose a delay-aware mode-selection strategy to adaptively choose multicast or D2D communications mode to reduce the receiving-caused delay.By matching these transmit modes with distinct subfile sizes,we further formulate a min-max optimization problem to minimize the delivery delay.Finally,numerical results prove that the proposed scheme outperforms existing ones in terms of both receiving and transmitting delays.
文摘Quickly getting back the synchronism of a disturbed interconnected multi-area power system due to variations in loading condition is recognized as prominent issue related to automatic generation control(AGC).In this regard,AGC system based on fuzzy logic,i.e.,so-called FLAGC can introduce an effectual performance to suppress the dynamic oscillations of tie-line power exchanges and frequency in multi-area interconnected power system.Apart from that,simultaneous coordination scheme based on particle swarm optimization(PSO)along with real coded genetic algorithm(RCGA)is suggested to coordinate FLAGCs of the all areas.To clarify the high efficiency of aforementioned strategy,two different interconnected multi-area power systems,i.e.,three-area hydro-thermal power system and five-area thermal power system have been taken into account for relevant studies.The potency of this strategy has been thoroughly dealt with by considering the step load perturbation(SLP)in both the under study power systems.To sum up,the simulation results have plainly revealed dynamic performance of FLAGC as compared with conventional AGC(CAGC)in each power system in order to damp out the power system oscillations.
文摘At present, there are some static code analyses and optimizations that can be applied to Concurrent C programs to improve their performance or verify their logical correctness. These analyses and optimizations are inter-process. In order to make their implementation easy, we propose a new method to construct an optimizing compiling system CCOC for Concurrent C. CCOC supports inter-process code analysis and optimization to Concurrent C programs and does not affect the system's portability and separate compilation of source programs. We also discuss some implementation details of CCOC briefly.
基金supported by the NSC under Grant No.NSC 101-2221-E-275-007
文摘A way of resolving spreading code mismatches in blind multiuser detection with a particle swarm optimization （PSO） approach is proposed. It has been shown that the PSO algorithm incorporating the linear system of the decorrelating detector, which is termed as decorrelating PSO （DPSO）, can significantly improve the bit error rate （BER） and the system capacity. As the code mismatch occurs, the output BER performance is vulnerable to degradation for DPSO. With a blind decorrelating scheme, the proposed blind DPSO （BDPSO） offers more robust capabilities over existing DPSO under code mismatch scenarios.
基金Supported by the National Natural Science Foundation of China(91438117)the Funding of Shanghai Key Laboratory of Financial Information Technology(2015)
文摘With the convergence of mobile communication network and Internet in depth, mobile Internet is penetrating into every field of people＇s life. Smart phone bring us great convenience, but it also becomes the breeding ground for the spread of malicious codes. In this paper, we propose a trust transfer algorithm based on the ant colony optimization algorithm to calculate the trust degree between any two nodes in the social network. Afterwards, a defense model based on social computing is presented for mobile phone malware. The simulation results show that our trust transfer algorithm improves the computation accuracy of indirect trust value by 14.65% compared with the TidalTrust algorithm, and the patch transmission speed of our model is faster than that of others.
文摘Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened communication overhead,and escalated storage costs,have significantly constrained the broad-scale application of blockchain.This paper introduces a novel Encode-and CRT-based Scalability Scheme(ECSS),meticulously refined to enhance both block broadcasting and storage.Primarily,ECSS categorizes nodes into distinct domains,thereby reducing the network diameter and augmenting transmission efficiency.Secondly,ECSS streamlines block transmission through a compact block protocol and robust RS coding,which not only reduces the size of broadcasted blocks but also ensures transmission reliability.Finally,ECSS utilizes the Chinese remainder theorem,designating the block body as the compression target and mapping it to multiple modules to achieve efficient storage,thereby alleviating the storage burdens on nodes.To evaluate ECSS’s performance,we established an experimental platformand conducted comprehensive assessments.Empirical results demonstrate that ECSS attains superior network scalability and stability,reducing communication overhead by an impressive 72% and total storage costs by a substantial 63.6%.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.61871234 and 62375140)Postgraduate Research&Practice Innovation Program of Jiangsu Province(Grant No.KYCX190900).
文摘A Gray code based gradient-free optimization(GCO)algorithm is proposed to update the parameters of parameterized quantum circuits(PQCs)in this work.Each parameter of PQCs is encoded as a binary string,named as a gene,and a genetic-based method is adopted to select the offsprings.The individuals in the offspring are decoded in Gray code way to keep Hamming distance,and then are evaluated to obtain the best one with the lowest cost value in each iteration.The algorithm is performed iteratively for all parameters one by one until the cost value satisfies the stop condition or the number of iterations is reached.The GCO algorithm is demonstrated for classification tasks in Iris and MNIST datasets,and their performance are compared by those with the Bayesian optimization algorithm and binary code based optimization algorithm.The simulation results show that the GCO algorithm can reach high accuracies steadily for quantum classification tasks.Importantly,the GCO algorithm has a robust performance in the noise environment.
基金Supported by the National Natural Science Foundation of China (No.60021302, No.60635050 and No.60405004).
文摘A new approach for designing the Biorthogonal Wavelet Filter Bank (BWFB) for the purpose of image compression is presented in this letter. The approach is decomposed into two steps. First, an optimal filter bank is designed in theoretical sense based on Vaidyanathan’s coding gain criterion in SubBand Coding (SBC) system. Then the above filter bank is optimized based on the criterion of Peak Signal-to-Noise Ratio (PSNR) in JPEG2000 image compression system, resulting in a BWFB in practical application sense. With the approach, a series of BWFB for a specific class of applications related to image compression, such as remote sensing images, can be fast designed. Here, new 5/3 BWFB and 9/7 BWFB are presented based on the above approach for the remote sensing image compression applications. Experiments show that the two filter banks are equally performed with respect to CDF 9/7 and LT 5/3 filter in JPEG2000 standard; at the same time, the coefficients and the lifting parameters of the lifting scheme are all rational, which bring the computational advantage, and the ease for VLSI implementation.
文摘Software systems have been employed in many fields as a means to reduce human efforts;consequently,stakeholders are interested in more updates of their capabilities.Code smells arise as one of the obstacles in the software industry.They are characteristics of software source code that indicate a deeper problem in design.These smells appear not only in the design but also in software implementation.Code smells introduce bugs,affect software maintainability,and lead to higher maintenance costs.Uncovering code smells can be formulated as an optimization problem of finding the best detection rules.Although researchers have recommended different techniques to improve the accuracy of code smell detection,these methods are still unstable and need to be improved.Previous research has sought only to discover a few at a time(three or five types)and did not set rules for detecting their types.Our research improves code smell detection by applying a search-based technique;we use the Whale Optimization Algorithm as a classifier to find ideal detection rules.Applying this algorithm,the Fisher criterion is utilized as a fitness function to maximize the between-class distance over the withinclass variance.The proposed framework adopts if-then detection rules during the software development life cycle.Those rules identify the types for both medium and large projects.Experiments are conducted on five open-source software projects to discover nine smell types that mostly appear in codes.The proposed detection framework has an average of 94.24%precision and 93.4%recall.These accurate values are better than other search-based algorithms of the same field.The proposed framework improves code smell detection,which increases software quality while minimizing maintenance effort,time,and cost.Additionally,the resulting classification rules are analyzed to find the software metrics that differentiate the nine code smells.
文摘There is a big demand for increasing number of subscribers in the fourth generation mobile communication systems. However, the system performance is limited by multi-path propagations and lack of efficient power allocation algorithms in conventional wireless communication systems. Optimal resource allocation and interference cancellation issues are critical for the improvement of system performance such as throughput and transmission reliability. In this paper, a turbo coded bell lab space time system (TBLAST) with optimal power allocation techniques based on eigen mode, Newton and convex optimization method and carrier-interference-and-noise ratio (CINR) are proposed to improve link reliability and to increase throughput with reasonable computational complexity. The proposed scheme is evaluated by Monte-Carlo simulations and is shown to outperform the conventional power allocation scheme.
基金supported by the scientific research foundation of Xingjian College of Science and Liberal Arts,Guangxi University(Grant No.2015ZKLX03)the Guangxi higher education reform project(GrantNo.2013JGA421)the scientific research foundation of Xingjian College of Science and LiberalArts,Guangxi University(Grant No.2014JGLX02)
文摘Variable-weight optical orthogonal code(VWOOC)has many important applications in communica tions.In this paper,we obtain several series of optimal(v,W,1,Q)OOCs for W--{3,6},{3,4,6}.
文摘This paper describes optimization process of nozzle cup based on a device for contactless code marking to rough and contaminated surfaces--semiautomatic code marker. During tests using the CFD （computational fluid dynamics） software different geometry of nozzle cups were compared by such parameters as pressure, velocity and direction of flow. Goal of digital experiments was to find sprayer nozzle geometry that can keep stream of paint in diameter of 10 mm on 10-20 mm distance. Main problem is to avoid low-pressure regions around the stream. The optimal geometry of nozzle cup is designed to get adjusted code dimensions on given distance
