Reversible data hiding in encrypted images(RDH-EI)enables the concealment of secret data within ciphertext images while preserving the ability to fully recover both the original image and the hidden message.However,ex...Reversible data hiding in encrypted images(RDH-EI)enables the concealment of secret data within ciphertext images while preserving the ability to fully recover both the original image and the hidden message.However,existing RDH-EI schemes based on vacating room after encryption(VRAE)suffer from limited embedding capacity.To address this issue,we propose a method based on arithmetic coding and dual prediction for encrypted images.First,the original image is encrypted with a chunked modulus and permutation.Then,using the upper-left corner pixel of each subblock as a reference,adaptive MSB prediction and difference prediction are employed to predict the remaining pixels within the subblock.The resulting label map is then compressed via arithmetic coding to vacate the embedding space for the secret message.Finally,the separable operations of the original image restoration and secret message extraction can be performed on the basis of the type of key possessed.The experimental results demonstrate that the proposed algorithm not only successfully extracts the secret information but also recovers the original image without any loss.Furthermore,it effectively enhances the embedding capacity by fully utilizing the correlation between adjacent pixels while ensuring the security of the image.展开更多
In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, c...In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.展开更多
Test data compression and test resource partitioning （TRP） are essential to reduce the amount of test data in system-on-chip testing. A novel variable-to-variable-length compression codes is designed as advanced fre...Test data compression and test resource partitioning （TRP） are essential to reduce the amount of test data in system-on-chip testing. A novel variable-to-variable-length compression codes is designed as advanced fre- quency-directed run-length （AFDR） codes. Different [rom frequency-directed run-length （FDR） codes, AFDR encodes both 0- and 1-runs and uses the same codes to the equal length runs. It also modifies the codes for 00 and 11 to improve the compression performance. Experimental results for ISCAS 89 benchmark circuits show that AFDR codes achieve higher compression ratio than FDR and other compression codes.展开更多
This paper presents a new test data compression/decompression method for SoC testing,called hybrid run length codes. The method makes a full analysis of the factors which influence test parameters：compression ratio,t...This paper presents a new test data compression/decompression method for SoC testing,called hybrid run length codes. The method makes a full analysis of the factors which influence test parameters：compression ratio,test application time, and area overhead. To improve the compression ratio, the new method is based on variable-to-variable run length codes,and a novel algorithm is proposed to reorder the test vectors and fill the unspecified bits in the pre-processing step. With a novel on-chip decoder, low test application time and low area overhead are obtained by hybrid run length codes. Finally, an experimental comparison on ISCAS 89 benchmark circuits validates the proposed method展开更多
This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an S...This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an SWIPT-aware energy harvesting(EH) relay. We present a power splitting(PS)-based two-way relaying(PS-TWR) protocol by employing the PS receiver architecture. To explore the system sum rate limit with data rate fairness, an optimization problem under total power constraint is formulated. Then, some explicit solutions are derived for the problem. Numerical results show that due to the path loss effect on energy transfer, with the same total available power, PS-TWR losses some system performance compared with traditional non-EH two-way relaying, where at relatively low and relatively high signalto-noise ratio(SNR), the performance loss is relatively small. Another observation is that, in relatively high SNR regime, PS-TWR outperforms time switching-based two-way relaying(TS-TWR) while in relatively low SNR regime TS-TWR outperforms PS-TWR. It is also shown that with individual available power at the two sources, PS-TWR outperforms TS-TWR in both relatively low and high SNR regimes.展开更多
Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is...Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is proposed in this article.Additionally,in order to achieve an optimal BLER performance of UDCG-SVC,a problem to optimize the coding gain of UDCG-based superimposed constellation is formulated.Given the energy of rotation constellations in UDCG,this problem is solved by converting it into finding the maximized minimum Euclidean distance of the superimposed constellation.Simulation results demonstrate the validness of our derivation.We also find that the proposed UDCGSVC has better BLER performance compared to other SVC schemes,especially under the high order modulation scenarios.展开更多
In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of inform...In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of information technology.A matrix decoding method is proposed in this paper.The method is a universal data reconstruction scheme for erasure codes over binary fields.Besides a pre-judgment that whether errors can be recovered,the method can rebuild sectors of loss data on a fault-tolerant storage system constructed by erasure codes for disk errors.Data reconstruction process of the new method has simple and clear steps,so it is beneficial for implementation of computer codes.And more,it can be applied to other non-binary fields easily,so it is expected that the method has an extensive application in the future.展开更多
The requirements of data coding in multimedia applications are presented, the current technique of coding and relative standards is introduced, then the work that have been doing is presented, i.e. the wavelet-based c...The requirements of data coding in multimedia applications are presented, the current technique of coding and relative standards is introduced, then the work that have been doing is presented, i.e. the wavelet-based coding method and the VE (Visual Entropy)-based coding method. The experiment results prove that these methods have gained a better perceptual quality of a reconstructed image and a lower bit rate. Their performance evaluations are better than JPEG (Joint Photographic Experts Group) coding. Finally, the future topics of study are put forward.展开更多
Long noncoding RNAs （IncRNAs） have been increasingly implicated in a variety of human diseases, including autoimmune disease （Wu et al., 2015）, neurodegenerative diseases （Wapinski and Chang, 2011） and cancer （...Long noncoding RNAs （IncRNAs） have been increasingly implicated in a variety of human diseases, including autoimmune disease （Wu et al., 2015）, neurodegenerative diseases （Wapinski and Chang, 2011） and cancer （Huarte, 2015）. Due to recent advances in next-generation sequencing technologies, tens of thousands of lncRNAs have been identified and annotated, a number of them have been proven to be functional in diverse biological processes through various mechanisms.展开更多
Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploit...Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques.展开更多
Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data sy...Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.展开更多
UAV data link has been considered as an important part of UAV communication system, through which the UAV could communicate with warships. However, constant coding and modulation scheme that UAV adopts does not make f...UAV data link has been considered as an important part of UAV communication system, through which the UAV could communicate with warships. However, constant coding and modulation scheme that UAV adopts does not make full use of the channel capacity when UAV communicates with warships in a good channel environment. In order to improve channel capacity and spectral efficiency, adaptive coded modulation technology is studied. Based on maritime channel model, SNR estimation technology and adaptive threshold determination technology, the simulation of UAV data link communication is carried out in this paper. Theoretic analysis and simulation results show that according to changes in maritime channel state, UAV can dynamically adjust the adaptive coded modulation scheme on the condition of meeting target Bit-Error-Rate (BER), the maximum amount of data transfer is non-adaptive systems three times.展开更多
This paper presents a reversible data hiding(RDH)method,which is designed by combining histogram modification(HM)with run-level coding in H.264/advanced video coding(AVC).In this scheme,the run-level is changed for em...This paper presents a reversible data hiding(RDH)method,which is designed by combining histogram modification(HM)with run-level coding in H.264/advanced video coding(AVC).In this scheme,the run-level is changed for embedding data into H.264/AVC video sequences.In order to guarantee the reversibility of the proposed scheme,the last nonzero quantized discrete cosine transform(DCT)coefficients in embeddable 4×4 blocks are shifted by the technology of histogram modification.The proposed scheme is realized after quantization and before entropy coding of H.264/AVC compression standard.Therefore,the embedded information can be correctly extracted at the decoding side.Peak-signal-noise-to-ratio(PSNR)and Structure similarity index(SSIM),embedding payload and bit-rate variation are exploited to measure the performance of the proposed scheme.Experimental results have shown that the proposed scheme leads to less SSIM variation and bit-rate increase.展开更多
System-on-a-chips with intellectual property cores need a large volume of data for testing. The large volume of test data requires a large testing time and test data memory. Therefore new techniques are needed to opti...System-on-a-chips with intellectual property cores need a large volume of data for testing. The large volume of test data requires a large testing time and test data memory. Therefore new techniques are needed to optimize the test data volume, decrease the testing time, and conquer the ATE memory limitation for SOC designs. This paper presents a new compression method of testing for intellectual property core-based system-on-chip. The proposed method is based on new split- data variable length (SDV) codes that are designed using the split-options along with identification bits in a string of test data. This paper analyses the reduction of test data volume, testing time, run time, size of memory required in ATE and improvement of compression ratio. Experimental results for ISCAS 85 and ISCAS 89 Benchmark circuits show that SDV codes outperform other compression methods with the best compression ratio for test data compression. The decompression architecture for SDV codes is also presented for decoding the implementations of compressed bits. The proposed scheme shows that SDV codes are accessible to any of the variations in the input test data stream.展开更多
By analyzing and comparing the current application status and advantages and disadvantages of domestic and foreign artificial material mechanical equipment classification coding systems,and conducting a comparative st...By analyzing and comparing the current application status and advantages and disadvantages of domestic and foreign artificial material mechanical equipment classification coding systems,and conducting a comparative study of the existing coding system standards in different regions of the country,a coding data model suitable for big data research needs is proposed based on the current national standard for artificial material mechanical equipment classification coding.This model achieves a horizontal connection of characteristics and a vertical penetration of attribute values for construction materials and machinery through forward automatic coding calculation and reverse automatic decoding.This coding scheme and calculation model can also establish a database file for the coding and unit price of construction materials and machinery,forming a complete big data model for construction material coding unit prices.This provides foundational support for calculating and analyzing big data related to construction material unit prices,real-time information prices,market prices,and various comprehensive prices,thus contributing to the formation of cost-related big data.展开更多
Objective: to study and try to apply Internet medical technology to clinical nursing work, so as to improve clinical nursing service. Methods: a total of 100 patients in Department of general surgery and Department of...Objective: to study and try to apply Internet medical technology to clinical nursing work, so as to improve clinical nursing service. Methods: a total of 100 patients in Department of general surgery and Department of orthopedics were collected. The data of temperature, blood pressure, pulse and respiration were collected and uploaded to the cloud database. Make the website QR code as the only identification mark of the patient. The QR code corresponds to the home page of the patient's vital signs browsing, and automatically refresh the home page to search the real-time vital signs data in the cloud. The QR code is posted on the bedside card for scanning or forwarding. Then investigate the satisfaction of family members and medical staff. Results: to realize the integration of Internet technology and clinical nursing service, and make the patient's condition information public to the family members, so as to explore a new model of clinical nursing based on Internet technology.展开更多
This paper introduces a new RAID 6 expanding method HCS, which is facing the circumstance of big data. HCS expands H-Code manner RAID 6. Two key techniques are used to avoid parity blocks’ recalculating.The first one...This paper introduces a new RAID 6 expanding method HCS, which is facing the circumstance of big data. HCS expands H-Code manner RAID 6. Two key techniques are used to avoid parity blocks’ recalculating.The first one is anti-diagonal data blocks’ selection, and the other one is horizontal data migration. These two techniques ensure the data blocks are retained in the same verification zone, that is horizontal verification zone and anti-diagonal verification zone. Experimental results showed that, compared with SDM, which is also a fast expansion method, HCS can reduce 3.6% expansion time and promote 4.62% performance under four traces.展开更多
In this paper,a novel secret data-driven carrier-free(semi structural formula)visual secret sharing(VSS)scheme with(2,2)threshold based on the error correction blocks of QR codes is investigated.The proposed scheme is...In this paper,a novel secret data-driven carrier-free(semi structural formula)visual secret sharing(VSS)scheme with(2,2)threshold based on the error correction blocks of QR codes is investigated.The proposed scheme is to search two QR codes that altered to satisfy the secret sharing modules in the error correction mechanism from the large datasets of QR codes according to the secret image,which is to embed the secret image into QR codes based on carrier-free secret sharing.The size of secret image is the same or closest with the region from the coordinate of(7,7)to the lower right corner of QR codes.In this way,we can find the QR codes combination of embedding secret information maximization with secret data-driven based on Big data search.Each output share is a valid QR code which can be decoded correctly utilizing a QR code reader and it may reduce the likelihood of attracting the attention of potential attackers.The proposed scheme can reveal secret image visually with the abilities of stacking and XOR decryptions.The secret image can be recovered by human visual system(HVS)without any computation based on stacking.On the other hand,if the light-weight computation device is available,the secret image can be lossless revealed based on XOR operation.In addition,QR codes could assist alignment for VSS recovery.The experimental results show the effectiveness of our scheme.展开更多
With the rapid expansion of multimedia data,protecting digital information has become increasingly critical.Reversible data hiding offers an effective solution by allowing sensitive information to be embedded in multi...With the rapid expansion of multimedia data,protecting digital information has become increasingly critical.Reversible data hiding offers an effective solution by allowing sensitive information to be embedded in multimedia files while enabling full recovery of the original data after extraction.Audio,as a vital medium in communication,entertainment,and information sharing,demands the same level of security as images.However,embedding data in encrypted audio poses unique challenges due to the trade-offs between security,data integrity,and embedding capacity.This paper presents a novel interpolation-based reversible data hiding algorithm for encrypted audio that achieves scalable embedding capacity.By increasing sample density through interpolation,embedding opportunities are significantly enhanced while maintaining encryption throughout the process.The method further integrates multiple most significant bit(multi-MSB)prediction and Huffman coding to optimize compression and embedding efficiency.Experimental results on standard audio datasets demonstrate the proposed algorithm’s ability to embed up to 12.47 bits per sample with over 9.26 bits per sample available for pure embedding capacity,while preserving full reversibility.These results confirm the method’s suitability for secure applications that demand high embedding capacity and perfect reconstruction of original audio.This work advances reversible data hiding in encrypted audio by offering a secure,efficient,and fully reversible data hiding framework.展开更多
基金supported by the Provincial Colleges Quality Project of Anhui Prov-ince(2020xsxxkc047)the National Undergraduate Innovation and Entrepreneurship Training Program(2023103570289).
文摘Reversible data hiding in encrypted images(RDH-EI)enables the concealment of secret data within ciphertext images while preserving the ability to fully recover both the original image and the hidden message.However,existing RDH-EI schemes based on vacating room after encryption(VRAE)suffer from limited embedding capacity.To address this issue,we propose a method based on arithmetic coding and dual prediction for encrypted images.First,the original image is encrypted with a chunked modulus and permutation.Then,using the upper-left corner pixel of each subblock as a reference,adaptive MSB prediction and difference prediction are employed to predict the remaining pixels within the subblock.The resulting label map is then compressed via arithmetic coding to vacate the embedding space for the secret message.Finally,the separable operations of the original image restoration and secret message extraction can be performed on the basis of the type of key possessed.The experimental results demonstrate that the proposed algorithm not only successfully extracts the secret information but also recovers the original image without any loss.Furthermore,it effectively enhances the embedding capacity by fully utilizing the correlation between adjacent pixels while ensuring the security of the image.
文摘In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.
基金Supported by the National Natural Science Foundation of China(61076019,61106018)the Aeronautical Science Foundation of China(20115552031)+3 种基金the China Postdoctoral Science Foundation(20100481134)the Jiangsu Province Key Technology R&D Program(BE2010003)the Nanjing University of Aeronautics and Astronautics Research Funding(NS2010115)the Nanjing University of Aeronatics and Astronautics Initial Funding for Talented Faculty(1004-YAH10027)~~
文摘Test data compression and test resource partitioning （TRP） are essential to reduce the amount of test data in system-on-chip testing. A novel variable-to-variable-length compression codes is designed as advanced fre- quency-directed run-length （AFDR） codes. Different [rom frequency-directed run-length （FDR） codes, AFDR encodes both 0- and 1-runs and uses the same codes to the equal length runs. It also modifies the codes for 00 and 11 to improve the compression performance. Experimental results for ISCAS 89 benchmark circuits show that AFDR codes achieve higher compression ratio than FDR and other compression codes.
文摘This paper presents a new test data compression/decompression method for SoC testing,called hybrid run length codes. The method makes a full analysis of the factors which influence test parameters：compression ratio,test application time, and area overhead. To improve the compression ratio, the new method is based on variable-to-variable run length codes,and a novel algorithm is proposed to reorder the test vectors and fill the unspecified bits in the pre-processing step. With a novel on-chip decoder, low test application time and low area overhead are obtained by hybrid run length codes. Finally, an experimental comparison on ISCAS 89 benchmark circuits validates the proposed method
基金supported by the National Natural Science Foundation of China ( No . 61602034 )the Beijing Natural Science Foundation (No. 4162049)+2 种基金the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University (No. 2014D03)the Fundamental Research Funds for the Central Universities Beijing Jiaotong University (No. 2016JBM015)the NationalHigh Technology Research and Development Program of China (863 Program) (No. 2015AA015702)
文摘This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an SWIPT-aware energy harvesting(EH) relay. We present a power splitting(PS)-based two-way relaying(PS-TWR) protocol by employing the PS receiver architecture. To explore the system sum rate limit with data rate fairness, an optimization problem under total power constraint is formulated. Then, some explicit solutions are derived for the problem. Numerical results show that due to the path loss effect on energy transfer, with the same total available power, PS-TWR losses some system performance compared with traditional non-EH two-way relaying, where at relatively low and relatively high signalto-noise ratio(SNR), the performance loss is relatively small. Another observation is that, in relatively high SNR regime, PS-TWR outperforms time switching-based two-way relaying(TS-TWR) while in relatively low SNR regime TS-TWR outperforms PS-TWR. It is also shown that with individual available power at the two sources, PS-TWR outperforms TS-TWR in both relatively low and high SNR regimes.
基金supported by the National Science Fundation of China(NSFC)under grant 62001423the Henan Provincial Key Research,Development and Promotion Project under grant 212102210175the Henan Provincial Key Scientific Research Project for College and University under grant 21A510011.
文摘Sparse vector coding(SVC)is emerging as a potential technology for short packet communications.To further improve the block error rate(BLER)performance,a uniquely decomposable constellation group-based SVC(UDCG-SVC)is proposed in this article.Additionally,in order to achieve an optimal BLER performance of UDCG-SVC,a problem to optimize the coding gain of UDCG-based superimposed constellation is formulated.Given the energy of rotation constellations in UDCG,this problem is solved by converting it into finding the maximized minimum Euclidean distance of the superimposed constellation.Simulation results demonstrate the validness of our derivation.We also find that the proposed UDCGSVC has better BLER performance compared to other SVC schemes,especially under the high order modulation scenarios.
基金supported by the National Natural Science Foundation of China under Grant No.61501064Sichuan Provincial Science and Technology Project under Grant No.2016GZ0122
文摘In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of information technology.A matrix decoding method is proposed in this paper.The method is a universal data reconstruction scheme for erasure codes over binary fields.Besides a pre-judgment that whether errors can be recovered,the method can rebuild sectors of loss data on a fault-tolerant storage system constructed by erasure codes for disk errors.Data reconstruction process of the new method has simple and clear steps,so it is beneficial for implementation of computer codes.And more,it can be applied to other non-binary fields easily,so it is expected that the method has an extensive application in the future.
文摘The requirements of data coding in multimedia applications are presented, the current technique of coding and relative standards is introduced, then the work that have been doing is presented, i.e. the wavelet-based coding method and the VE (Visual Entropy)-based coding method. The experiment results prove that these methods have gained a better perceptual quality of a reconstructed image and a lower bit rate. Their performance evaluations are better than JPEG (Joint Photographic Experts Group) coding. Finally, the future topics of study are put forward.
基金supported by grants from the National Key R&D Program of China (2017YFA0106700)National Natural Science Foundation of China (81772614, U1611261, 81772586 and 81602461)+3 种基金China Postdoctoral Science Foundation (2017M610573)Young Elite Scientists Sponsorship Program by CAST (2017QNRC001)Guangdong Province Universities and Colleges Pearl River Scholar Funded Scheme (2017, to J. Zheng)Fundamental Research Funds for the Central Universities (SYSU:17ykzd32)
文摘Long noncoding RNAs （IncRNAs） have been increasingly implicated in a variety of human diseases, including autoimmune disease （Wu et al., 2015）, neurodegenerative diseases （Wapinski and Chang, 2011） and cancer （Huarte, 2015）. Due to recent advances in next-generation sequencing technologies, tens of thousands of lncRNAs have been identified and annotated, a number of them have been proven to be functional in diverse biological processes through various mechanisms.
基金supported by China 973 Program(2014CB340303)NSFC(No.61170238,60903190)National 863 Program(2013AA01A601)
文摘Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques.
基金This work is financially supported by Beijing Municipal Natural Science Foundation(No.L202012)the Open Research Project of the State Key Laboratory of Media Convergence and Communication,Communication University of China(No.SKLMCC2020KF008)the Fundamental Research Funds for the Central Universities(No.2020RC05).
文摘Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.
文摘UAV data link has been considered as an important part of UAV communication system, through which the UAV could communicate with warships. However, constant coding and modulation scheme that UAV adopts does not make full use of the channel capacity when UAV communicates with warships in a good channel environment. In order to improve channel capacity and spectral efficiency, adaptive coded modulation technology is studied. Based on maritime channel model, SNR estimation technology and adaptive threshold determination technology, the simulation of UAV data link communication is carried out in this paper. Theoretic analysis and simulation results show that according to changes in maritime channel state, UAV can dynamically adjust the adaptive coded modulation scheme on the condition of meeting target Bit-Error-Rate (BER), the maximum amount of data transfer is non-adaptive systems three times.
基金This work was supported by the National Natural Science Foundation of China(NSFC)under the grant No.61972269the Fundamental Research Funds for the Central Universities under the grant No.YJ201881Doctoral Innovation Fund Program of Southwest Jiaotong University under the grant No.DCX201824.
文摘This paper presents a reversible data hiding(RDH)method,which is designed by combining histogram modification(HM)with run-level coding in H.264/advanced video coding(AVC).In this scheme,the run-level is changed for embedding data into H.264/AVC video sequences.In order to guarantee the reversibility of the proposed scheme,the last nonzero quantized discrete cosine transform(DCT)coefficients in embeddable 4×4 blocks are shifted by the technology of histogram modification.The proposed scheme is realized after quantization and before entropy coding of H.264/AVC compression standard.Therefore,the embedded information can be correctly extracted at the decoding side.Peak-signal-noise-to-ratio(PSNR)and Structure similarity index(SSIM),embedding payload and bit-rate variation are exploited to measure the performance of the proposed scheme.Experimental results have shown that the proposed scheme leads to less SSIM variation and bit-rate increase.
文摘System-on-a-chips with intellectual property cores need a large volume of data for testing. The large volume of test data requires a large testing time and test data memory. Therefore new techniques are needed to optimize the test data volume, decrease the testing time, and conquer the ATE memory limitation for SOC designs. This paper presents a new compression method of testing for intellectual property core-based system-on-chip. The proposed method is based on new split- data variable length (SDV) codes that are designed using the split-options along with identification bits in a string of test data. This paper analyses the reduction of test data volume, testing time, run time, size of memory required in ATE and improvement of compression ratio. Experimental results for ISCAS 85 and ISCAS 89 Benchmark circuits show that SDV codes outperform other compression methods with the best compression ratio for test data compression. The decompression architecture for SDV codes is also presented for decoding the implementations of compressed bits. The proposed scheme shows that SDV codes are accessible to any of the variations in the input test data stream.
基金Research project of the Construction Department of Hubei Province(Project No.2023-64).
文摘By analyzing and comparing the current application status and advantages and disadvantages of domestic and foreign artificial material mechanical equipment classification coding systems,and conducting a comparative study of the existing coding system standards in different regions of the country,a coding data model suitable for big data research needs is proposed based on the current national standard for artificial material mechanical equipment classification coding.This model achieves a horizontal connection of characteristics and a vertical penetration of attribute values for construction materials and machinery through forward automatic coding calculation and reverse automatic decoding.This coding scheme and calculation model can also establish a database file for the coding and unit price of construction materials and machinery,forming a complete big data model for construction material coding unit prices.This provides foundational support for calculating and analyzing big data related to construction material unit prices,real-time information prices,market prices,and various comprehensive prices,thus contributing to the formation of cost-related big data.
文摘Objective: to study and try to apply Internet medical technology to clinical nursing work, so as to improve clinical nursing service. Methods: a total of 100 patients in Department of general surgery and Department of orthopedics were collected. The data of temperature, blood pressure, pulse and respiration were collected and uploaded to the cloud database. Make the website QR code as the only identification mark of the patient. The QR code corresponds to the home page of the patient's vital signs browsing, and automatically refresh the home page to search the real-time vital signs data in the cloud. The QR code is posted on the bedside card for scanning or forwarding. Then investigate the satisfaction of family members and medical staff. Results: to realize the integration of Internet technology and clinical nursing service, and make the patient's condition information public to the family members, so as to explore a new model of clinical nursing based on Internet technology.
文摘This paper introduces a new RAID 6 expanding method HCS, which is facing the circumstance of big data. HCS expands H-Code manner RAID 6. Two key techniques are used to avoid parity blocks’ recalculating.The first one is anti-diagonal data blocks’ selection, and the other one is horizontal data migration. These two techniques ensure the data blocks are retained in the same verification zone, that is horizontal verification zone and anti-diagonal verification zone. Experimental results showed that, compared with SDM, which is also a fast expansion method, HCS can reduce 3.6% expansion time and promote 4.62% performance under four traces.
文摘In this paper,a novel secret data-driven carrier-free(semi structural formula)visual secret sharing(VSS)scheme with(2,2)threshold based on the error correction blocks of QR codes is investigated.The proposed scheme is to search two QR codes that altered to satisfy the secret sharing modules in the error correction mechanism from the large datasets of QR codes according to the secret image,which is to embed the secret image into QR codes based on carrier-free secret sharing.The size of secret image is the same or closest with the region from the coordinate of(7,7)to the lower right corner of QR codes.In this way,we can find the QR codes combination of embedding secret information maximization with secret data-driven based on Big data search.Each output share is a valid QR code which can be decoded correctly utilizing a QR code reader and it may reduce the likelihood of attracting the attention of potential attackers.The proposed scheme can reveal secret image visually with the abilities of stacking and XOR decryptions.The secret image can be recovered by human visual system(HVS)without any computation based on stacking.On the other hand,if the light-weight computation device is available,the secret image can be lossless revealed based on XOR operation.In addition,QR codes could assist alignment for VSS recovery.The experimental results show the effectiveness of our scheme.
基金funded by theNational Science and Technology Council of Taiwan under the grant number NSTC 113-2221-E-035-058.
文摘With the rapid expansion of multimedia data,protecting digital information has become increasingly critical.Reversible data hiding offers an effective solution by allowing sensitive information to be embedded in multimedia files while enabling full recovery of the original data after extraction.Audio,as a vital medium in communication,entertainment,and information sharing,demands the same level of security as images.However,embedding data in encrypted audio poses unique challenges due to the trade-offs between security,data integrity,and embedding capacity.This paper presents a novel interpolation-based reversible data hiding algorithm for encrypted audio that achieves scalable embedding capacity.By increasing sample density through interpolation,embedding opportunities are significantly enhanced while maintaining encryption throughout the process.The method further integrates multiple most significant bit(multi-MSB)prediction and Huffman coding to optimize compression and embedding efficiency.Experimental results on standard audio datasets demonstrate the proposed algorithm’s ability to embed up to 12.47 bits per sample with over 9.26 bits per sample available for pure embedding capacity,while preserving full reversibility.These results confirm the method’s suitability for secure applications that demand high embedding capacity and perfect reconstruction of original audio.This work advances reversible data hiding in encrypted audio by offering a secure,efficient,and fully reversible data hiding framework.
