Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-compl...Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-complexity K-best detection algorithms are proposed. The improved-performance K-best detection algorithm deploys minimum mean square error （MMSE） filtering of a channel matrix before QR decomposition. This algorithm can decrease the probability of excluding the optimum path and achieve better performance. The reducedcomplexity K-best detection algorithms utilize a sphere decoding method to reduce searching constellation points. Simulation results show that the improved performance K-best detection algorithm obtains a 1 dB performance gain compared to the K- best detection algorithm based on sorted QR decomposition （SQRD）. Performance loss occurs when K = 4 in reduced complexity K-best detection algorithms. When K = 8, the reduced complexity K-best detection algorithms require less computational effort compared with traditional K-best detection algorithms and achieve the same performance.展开更多
This paper introduces a simple combining technique for cooperative relay scheme which is based on a Detect-and-Forward (DEF) relay protocol. Cooperative relay schemes have been introduced in earlier works but most of ...This paper introduces a simple combining technique for cooperative relay scheme which is based on a Detect-and-Forward (DEF) relay protocol. Cooperative relay schemes have been introduced in earlier works but most of them ignore the quality of the source-relay (S-R) channel in the detection at the destination, although this channel can contribute heavily to the performance of cooperation schemes. For optimal detection, the destination has to account all possible error events at the relay as well. Here we present a Maximum Likelihood criterion (ML) at the destination which considers closed-form expressions for each symbol error rate (SER) to facilitate the detection. Computer simulations show that significant diversity gain and Packet Error Rate (PER) performance can be achieved by the proposed scheme with good tolerance to propagation errors from noisy relays. In fact, diversity gain is increased with additional relay nodes. We compare this scheme against the baseline Cooperative-Maximum Ratio Combining (C-MRC).展开更多
The performance of a distributed Neyman-Pearson detection system is considered with the decision rules of the sensors given and the decisions from different sensors being mutually independent conditioned on both hypot...The performance of a distributed Neyman-Pearson detection system is considered with the decision rules of the sensors given and the decisions from different sensors being mutually independent conditioned on both hypothese. To achieve the better performance at the fusion center for a general detection system of n 〉 3 sensor configuration, the necessary and sufficient conditions are derived by comparing the probability of detec- tion at the fusion center with that of each of the sensors, with the constraint that the probability of false alarm at the fusion center is equal to that of the sensor. The conditions are related with the performances of the sensors and using the results we can predict the performance at the fusion center of a distributed detection system and can choose appropriate sensors to construct efficient distributed detection systems.展开更多
Based on the Maximum-Likelihood (ML) criterion, this paper proposes a novel noncoherent detection algorithm for Orthogonal Multicode (OM) system in Nakagami fading channel. Some theoretical analysis and simulation res...Based on the Maximum-Likelihood (ML) criterion, this paper proposes a novel noncoherent detection algorithm for Orthogonal Multicode (OM) system in Nakagami fading channel. Some theoretical analysis and simulation results are presented. It is shown that the proposed ML algorithm is at least 0.7 dB better than the conventional Matched-Filter (MF) algorithm for uncoded systems, in both non-fading and fading channels. For the consideration of practical application, it is further simplified in complexity. Compared with the original ML algorithm, the simplified ML algorithm can provide significant reduction in complexity with small degradation in performance.展开更多
In this paper,a Joint Early Detection and Early Stopping (JEDES) approach for effectively reducing the complexity of turbo decoding with negligible performance loss is proposed. It combines the effectiveness of both e...In this paper,a Joint Early Detection and Early Stopping (JEDES) approach for effectively reducing the complexity of turbo decoding with negligible performance loss is proposed. It combines the effectiveness of both early detection and early stopping techniques. Our simulation results demon-strated that the proposed JEDES scheme based on cyclic redundancy check and trellis splicing can achieve a complexity saving of 15% to 20% at practical bit error rates over the idealized GENIE stopping scheme,which is widely accepted as the theoretically best possible early stopping scheme.展开更多
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.展开更多
A method of robust speech endpoint detection in airplane cockpit voice background is presented. Based on the analysis of background noise character, a complex Laplacian distribution model directly aiming at noisy spee...A method of robust speech endpoint detection in airplane cockpit voice background is presented. Based on the analysis of background noise character, a complex Laplacian distribution model directly aiming at noisy speech is established. Then the likelihood ratio test based on binary hypothesis test is carried out. The decision criterion of conventional maximum a posterior incorporating the inter-frame correlation leads to two separate thresholds. Speech endpoint detection decision is finally made depend on the previous frame and the observed spectrum, and the speech endpoint is searched based on the decision. Compared with the typical algorithms, the proposed method operates robust in the airplane cockpit voice background.展开更多
In this thesis, a strategy realizing the computer-aided detection (CAD) of the epileptic waves in EEG isintroduced. The expert criterion, continuous wavelet transformation, neural networks, and characteristic paramete...In this thesis, a strategy realizing the computer-aided detection (CAD) of the epileptic waves in EEG isintroduced. The expert criterion, continuous wavelet transformation, neural networks, and characteristic parametermeasuremente these modern signa1 processing weapons were synthesized togetLher to form a so-called multi-method.It was estimated that the advantages of all the powerful techniques could be exploited systematically. Therefore, theCAD’s capacities in the long-term monitoring, trCaAnent and control of epilepsy might be enhanced. In this strategy,the raw EEG signals were uniformed and the expelt criterion were applied to discard most of aItifacts in them at first,and then the signals were pre-processed by continuous wavelet transformation. Some characteristic parameters wereextracted from the raw signals and the pre-processed ones. Consequently groups of eighteen parameters were sent totrain or test BP networks. By applying this theme a correct-detection rate of 84.3% for spike and sharp waves, and88.9% for sPike and sharp slow waves were obtained. In the next step, some non-linear tools wtll also be equippedwith the CAD system.展开更多
Graph neural networks(GNNs)have shown notable success in identifying security vulnerabilities within Ethereum smart contracts by capturing structural relationships encoded in control-and data-flow graphs.Despite their...Graph neural networks(GNNs)have shown notable success in identifying security vulnerabilities within Ethereum smart contracts by capturing structural relationships encoded in control-and data-flow graphs.Despite their effectiveness,most GNN-based vulnerability detectors operate as black boxes,making their decisions difficult to interpret and thus less suitable for critical security auditing.The information bottleneck(IB)principle provides a theoretical framework for isolating task-relevant graph components.However,existing IB-based implementations often encounter unstable optimization and limited understanding of code semantics.To address these issues,we introduce ContractGIB,an interpretable graph information bottleneck framework for function-level vulnerability analysis.ContractGIB introduces three main advances.First,ContractGIB introduces an Hilbert–Schmidt Independence Criterion(HSIC)based estimator that provides stable dependence measurement.Second,it incorporates a CodeBERT semantic module to improve node representations.Third,it initializes all nodes with pretrained CodeBERT embeddings,removing the need for hand-crafted features.For each contract function,ContractGIB identifies themost informative nodes forming an instance-specific explanatory subgraph that supports the model’s prediction.Comprehensive experiments on public smart contract datasets,including ESC andVSC,demonstrate thatContractGIB achieves superior performance compared to competitive GNN baselines,while offering clearer,instance-level interpretability.展开更多
Improvement of the detection ability of quantum entanglement is one of the essential tasks in quantum computing and quantum information.Finite tight frames play a fundamental role in a wide variety of areas and,genera...Improvement of the detection ability of quantum entanglement is one of the essential tasks in quantum computing and quantum information.Finite tight frames play a fundamental role in a wide variety of areas and,generally,each application requires a specific class of frames and is closely related to quantum measurement.It is worth noting that a maximal set of complex equiangular vectors is closely related to a symmetric informationally complete measurement.Hence,our goal in this work is to propose a series of separability criteria assigned to a finite tight frame and some well-known inequalities in different quantum systems,respectively.In addition,some tighter criteria to detect entanglement for many-body quantum states are presented in arbitrary dimensions.Finally,the effectiveness of the proposed entanglement detection criteria is illustrated through some detailed examples.展开更多
基金The National High Technology Research and Develop-ment Program of China (863Program)(No.2006AA01Z264)the National Natural Science Foundation of China (No.60572072)
文摘Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-complexity K-best detection algorithms are proposed. The improved-performance K-best detection algorithm deploys minimum mean square error （MMSE） filtering of a channel matrix before QR decomposition. This algorithm can decrease the probability of excluding the optimum path and achieve better performance. The reducedcomplexity K-best detection algorithms utilize a sphere decoding method to reduce searching constellation points. Simulation results show that the improved performance K-best detection algorithm obtains a 1 dB performance gain compared to the K- best detection algorithm based on sorted QR decomposition （SQRD）. Performance loss occurs when K = 4 in reduced complexity K-best detection algorithms. When K = 8, the reduced complexity K-best detection algorithms require less computational effort compared with traditional K-best detection algorithms and achieve the same performance.
文摘This paper introduces a simple combining technique for cooperative relay scheme which is based on a Detect-and-Forward (DEF) relay protocol. Cooperative relay schemes have been introduced in earlier works but most of them ignore the quality of the source-relay (S-R) channel in the detection at the destination, although this channel can contribute heavily to the performance of cooperation schemes. For optimal detection, the destination has to account all possible error events at the relay as well. Here we present a Maximum Likelihood criterion (ML) at the destination which considers closed-form expressions for each symbol error rate (SER) to facilitate the detection. Computer simulations show that significant diversity gain and Packet Error Rate (PER) performance can be achieved by the proposed scheme with good tolerance to propagation errors from noisy relays. In fact, diversity gain is increased with additional relay nodes. We compare this scheme against the baseline Cooperative-Maximum Ratio Combining (C-MRC).
基金Sponsored by the National Natural Science Foundation of China(60232010)
文摘The performance of a distributed Neyman-Pearson detection system is considered with the decision rules of the sensors given and the decisions from different sensors being mutually independent conditioned on both hypothese. To achieve the better performance at the fusion center for a general detection system of n 〉 3 sensor configuration, the necessary and sufficient conditions are derived by comparing the probability of detec- tion at the fusion center with that of each of the sensors, with the constraint that the probability of false alarm at the fusion center is equal to that of the sensor. The conditions are related with the performances of the sensors and using the results we can predict the performance at the fusion center of a distributed detection system and can choose appropriate sensors to construct efficient distributed detection systems.
文摘Based on the Maximum-Likelihood (ML) criterion, this paper proposes a novel noncoherent detection algorithm for Orthogonal Multicode (OM) system in Nakagami fading channel. Some theoretical analysis and simulation results are presented. It is shown that the proposed ML algorithm is at least 0.7 dB better than the conventional Matched-Filter (MF) algorithm for uncoded systems, in both non-fading and fading channels. For the consideration of practical application, it is further simplified in complexity. Compared with the original ML algorithm, the simplified ML algorithm can provide significant reduction in complexity with small degradation in performance.
基金the National Natural Science Foundation of China (NSFC)the Research Grants Council of Hong Kong (RGC) joint research scheme (No.60218001/N_ HKUST617-02 and No.60272070).
文摘In this paper,a Joint Early Detection and Early Stopping (JEDES) approach for effectively reducing the complexity of turbo decoding with negligible performance loss is proposed. It combines the effectiveness of both early detection and early stopping techniques. Our simulation results demon-strated that the proposed JEDES scheme based on cyclic redundancy check and trellis splicing can achieve a complexity saving of 15% to 20% at practical bit error rates over the idealized GENIE stopping scheme,which is widely accepted as the theoretically best possible early stopping scheme.
文摘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.
文摘A method of robust speech endpoint detection in airplane cockpit voice background is presented. Based on the analysis of background noise character, a complex Laplacian distribution model directly aiming at noisy speech is established. Then the likelihood ratio test based on binary hypothesis test is carried out. The decision criterion of conventional maximum a posterior incorporating the inter-frame correlation leads to two separate thresholds. Speech endpoint detection decision is finally made depend on the previous frame and the observed spectrum, and the speech endpoint is searched based on the decision. Compared with the typical algorithms, the proposed method operates robust in the airplane cockpit voice background.
文摘In this thesis, a strategy realizing the computer-aided detection (CAD) of the epileptic waves in EEG isintroduced. The expert criterion, continuous wavelet transformation, neural networks, and characteristic parametermeasuremente these modern signa1 processing weapons were synthesized togetLher to form a so-called multi-method.It was estimated that the advantages of all the powerful techniques could be exploited systematically. Therefore, theCAD’s capacities in the long-term monitoring, trCaAnent and control of epilepsy might be enhanced. In this strategy,the raw EEG signals were uniformed and the expelt criterion were applied to discard most of aItifacts in them at first,and then the signals were pre-processed by continuous wavelet transformation. Some characteristic parameters wereextracted from the raw signals and the pre-processed ones. Consequently groups of eighteen parameters were sent totrain or test BP networks. By applying this theme a correct-detection rate of 84.3% for spike and sharp waves, and88.9% for sPike and sharp slow waves were obtained. In the next step, some non-linear tools wtll also be equippedwith the CAD system.
基金supported by the National Natural Science Foundation of China(Grant Nos.52208424,52208416,52078091,and 52108399)the Shanghai Municipal Science and Technology Major Project(Grant No.2021SHZDZX0102).
文摘Graph neural networks(GNNs)have shown notable success in identifying security vulnerabilities within Ethereum smart contracts by capturing structural relationships encoded in control-and data-flow graphs.Despite their effectiveness,most GNN-based vulnerability detectors operate as black boxes,making their decisions difficult to interpret and thus less suitable for critical security auditing.The information bottleneck(IB)principle provides a theoretical framework for isolating task-relevant graph components.However,existing IB-based implementations often encounter unstable optimization and limited understanding of code semantics.To address these issues,we introduce ContractGIB,an interpretable graph information bottleneck framework for function-level vulnerability analysis.ContractGIB introduces three main advances.First,ContractGIB introduces an Hilbert–Schmidt Independence Criterion(HSIC)based estimator that provides stable dependence measurement.Second,it incorporates a CodeBERT semantic module to improve node representations.Third,it initializes all nodes with pretrained CodeBERT embeddings,removing the need for hand-crafted features.For each contract function,ContractGIB identifies themost informative nodes forming an instance-specific explanatory subgraph that supports the model’s prediction.Comprehensive experiments on public smart contract datasets,including ESC andVSC,demonstrate thatContractGIB achieves superior performance compared to competitive GNN baselines,while offering clearer,instance-level interpretability.
基金supported by the Natural Science Foundation of Sichuan Province(Grant No.25QNJJ4066)。
文摘Improvement of the detection ability of quantum entanglement is one of the essential tasks in quantum computing and quantum information.Finite tight frames play a fundamental role in a wide variety of areas and,generally,each application requires a specific class of frames and is closely related to quantum measurement.It is worth noting that a maximal set of complex equiangular vectors is closely related to a symmetric informationally complete measurement.Hence,our goal in this work is to propose a series of separability criteria assigned to a finite tight frame and some well-known inequalities in different quantum systems,respectively.In addition,some tighter criteria to detect entanglement for many-body quantum states are presented in arbitrary dimensions.Finally,the effectiveness of the proposed entanglement detection criteria is illustrated through some detailed examples.
