The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder nee...The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.展开更多
The elements of network profile are proposed.Based on the network traffic distribution model,the network profile includes the application request rate,the branch transfer probability,the ratio of application requests,...The elements of network profile are proposed.Based on the network traffic distribution model,the network profile includes the application request rate,the branch transfer probability,the ratio of application requests,and the probability distribution of the requested objects.Based on the evaluation method of network performance reliability,four simulation cases are constructed in OPNET software,and the results show the four elements of profile have impacts on the network reliability.展开更多
Though the WiMedia supports higher data rates than other WPAN technologies,a WiMedia device cannot reach other devices that are separated from it by more than 10 m,which is the typical limited transmission range of th...Though the WiMedia supports higher data rates than other WPAN technologies,a WiMedia device cannot reach other devices that are separated from it by more than 10 m,which is the typical limited transmission range of the WiMedia protocol.In this work,we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that are located out of the transmission range.The proposed routing protocol is a hybrid algorithm,which mixes the table-driven and on-demand routing algorithms,searching one or more routes according to the number of hops to a destination device.WiMedia MAC is potentially capable of learning the existence of neighbor devices by using a beacon frame.By utilizing the neighbors' information,all devices can create routing entries for devices within 2-hops periodically.For devices beyond the 2-hop range,the newly designed on-demand routing algorithm is applied to multi-hop routing.If a routing entry for a destination device is not listed in the routing table,the source device sends a request packet to 2-hop range devices which could be found in the routing table.Since every device maintains routing entries for 2-hop range devices in the routing table,the request packet is replied in advance before its arrival at the destination device.Also,to decide the optimal route for a destination device,the number of medium access slots(MASs),received signal strength indicator(RSSI)and hop count are utilized to establish a QoS-enabled routing table.We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV.The simulation results show that the proposed protocol has better throughput and lower overhead than other protocols.展开更多
A smartphone-based context-aware augmentative and alternative communication(AAC) was applied was in order to enhance the user's experience by providing simple, adaptive, and intuitive interfaces. Various potential...A smartphone-based context-aware augmentative and alternative communication(AAC) was applied was in order to enhance the user's experience by providing simple, adaptive, and intuitive interfaces. Various potential context-aware technologies and AAC usage scenarios were studied, and an efficient communication system was developed by combining smartphone's multimedia functions and its optimized sensor technologies. The experimental results show that context-awareness accuracy is achieved up to 97%.展开更多
A new method is presented for the segmentation of pulmonary parenchyma. The proposed method is based on the area calculation of different objects in the image. The main purpose of the proposed algorithm is the segment...A new method is presented for the segmentation of pulmonary parenchyma. The proposed method is based on the area calculation of different objects in the image. The main purpose of the proposed algorithm is the segment of the lungs images from the computer tomography(CT) images. The original image is binarized using the bit-plane slicing technique and among the different images the best binarized image is chosen. After binarization, the labeling is done and the area of each label is calculated from which the next level of binarized image is obtained. Then, the boundary tracing algorithm is applied to get another level of binarized image. The proposed method is able to extract lung region from the original images. The experimental results show the significance of the proposed method.展开更多
The nature of a wireless communication channel is very unpredictable. To design a good communication link, it is required to know the statistical model of the channel accurately. The average symbol error probability(A...The nature of a wireless communication channel is very unpredictable. To design a good communication link, it is required to know the statistical model of the channel accurately. The average symbol error probability(ASER) was analyzed for different modulation schemes. A unified analytical framework was presented to obtain closed-form solutions for calculating the ASER of M-ary differential phase-shift keying(M-DPSK), coherent M-ary phase-shift keying(M-PSK), and quadrature amplitude modulation(QAM) over single or multiple Nakagami-m fading channels. Moreover, the ASER was estimated and evaluated by using the maximal ratio-combining(MRC) diversity technique. Simulation results show that an error rate of the fading channel typically depends on Nakagami parameters(m), space diversity(N), and symbol rate(M). A comparison between M-PSK, M-DPSK, and M-QAM modulation schemes was shown, and the results prove that M-ary QAM(M-QAM) demonstrates better performance compared to M-DPSK and M-PSK under all fading and non-fading conditions.展开更多
Erratum to：J.Cent.South Univ.（2014）21：3811-3820DOI：10.1007/s11771-014-2366-9The original version of this article unfortunately contained three mistakes.The mistakes are corrected as follows：1）The spelling of th...Erratum to：J.Cent.South Univ.（2014）21：3811-3820DOI：10.1007/s11771-014-2366-9The original version of this article unfortunately contained three mistakes.The mistakes are corrected as follows：1）The spelling of third author is incorrect.The correct name is Jae-Young PYUN.2）The information of corresponding author is incorrect.The correct information should be Goo-Rak KWON,Professor,PhD;Tel/Fax：＋98-711-7264102;E-mail：grkwon@chosun.ac.kr展开更多
Information analysis of high dimensional data was carried out through similarity measure application. High dimensional data were considered as the a typical structure. Additionally, overlapped and non-overlapped data ...Information analysis of high dimensional data was carried out through similarity measure application. High dimensional data were considered as the a typical structure. Additionally, overlapped and non-overlapped data were introduced, and similarity measure analysis was also illustrated and compared with conventional similarity measure. As a result, overlapped data comparison was possible to present similarity with conventional similarity measure. Non-overlapped data similarity analysis provided the clue to solve the similarity of high dimensional data. Considering high dimensional data analysis was designed with consideration of neighborhoods information. Conservative and strict solutions were proposed. Proposed similarity measure was applied to express financial fraud among multi dimensional datasets. In illustrative example, financial fraud similarity with respect to age, gender, qualification and job was presented. And with the proposed similarity measure, high dimensional personal data were calculated to evaluate how similar to the financial fraud. Calculation results show that the actual fraud has rather high similarity measure compared to the average, from minimal 0.0609 to maximal 0.1667.展开更多
In modern electromagnetic environment, radar emitter signal recognition is an important research topic. On the basis of multi-resolution wavelet analysis, an adaptive radar emitter signal recognition method based on m...In modern electromagnetic environment, radar emitter signal recognition is an important research topic. On the basis of multi-resolution wavelet analysis, an adaptive radar emitter signal recognition method based on multi-scale wavelet entropy feature extraction and feature weighting was proposed. With the only priori knowledge of signal to noise ratio(SNR), the method of extracting multi-scale wavelet entropy features of wavelet coefficients from different received signals were combined with calculating uneven weight factor and stability weight factor of the extracted multi-dimensional characteristics. Radar emitter signals of different modulation types and different parameters modulated were recognized through feature weighting and feature fusion. Theoretical analysis and simulation results show that the presented algorithm has a high recognition rate. Additionally, when the SNR is greater than-4 d B, the correct recognition rate is higher than 93%. Hence, the proposed algorithm has great application value.展开更多
Energy efficiency is a primary consideration in a wireless sensor network (WSN). This is also a major parameter when designing a medium access control (MAC) protocol for WSNs. Hierarchical clustering structure is rega...Energy efficiency is a primary consideration in a wireless sensor network (WSN). This is also a major parameter when designing a medium access control (MAC) protocol for WSNs. Hierarchical clustering structure is regarded suitable for WSNs due to its good performance in energy conservation. In this work, an adequately flexible mechanism for clustering WSNs is designed, in which some creative or promotional metrics are utilized, such as cluster head selection algorithm, cluster optional reconstruction, interested data transmission, multiple path routing protocol. All these strategies were cooperated to maximize energy saving of whole system. An appropriate MAC protocol for this mechanism is proposed, by flexibly switching the status of diverse sensor nodes in different strategies. The simulation results show that the proposed MAC protocol is suitable for clustering WSNs and performs well in aspects of energy efficiency, flexibility and scalability.展开更多
Multicast technology application has been widely utilized in broadband internet. Source authentication is one of the most needs for many multicast applications transferring real-time information such as stream video a...Multicast technology application has been widely utilized in broadband internet. Source authentication is one of the most needs for many multicast applications transferring real-time information such as stream video and online news. Because multicast current services provided to the group members are changed dynamically, data transferring by a group member is not used by the recipient. In order to verify the identity of the sender who sent the packet and to make sure that the data have not been tampered, an optimized source authentication scheme has been proposed to transfer the authentication information not to the next-door packet. The proposed method for multiple packets authenticates the source with a limited number of electronic signatures. The proposed method can reduce overhead compared to the method by adding a digital signature for every packet. In addition, by sending the generated electronic signature to the first packet and the last packet, it prevents the loss of consecutive packets, as well as a source authentication can be provided in real-time services.展开更多
The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has no...The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has not considered the link capacities between edge routers and connected core routers. When a core router in a two layers’ network experiences congestion, the connected edge routers have no ability to adjust their access data rates. Thus, it is difficult to achieve the congestion control for the large scale network with many edge routers and core routers. To solve these problems, two difffserve AQM algorithms are proposed for the congestion control of multilayer network. One diffserv AQM algorithm implements fair link capacities of edge routers, and the other one implements unequal link capacities of edge routers, but it requires the core routers to have multi-queues buffers and Diffserv AQM to support. The proposed algorithms achieve the network congestion control by operating AQM parameters on the conditions of proposed three theorems for core and edge routers. The dynamic simulation results demonstrate the proposed control algorithms for core and edge routers to be valid.展开更多
Radar detection of small targets in sea clutter is a particularly demanding task because of the nonstationary characteristic of sea clutter.The track-before-detect(TBD)filter is an effective way to increase the signal...Radar detection of small targets in sea clutter is a particularly demanding task because of the nonstationary characteristic of sea clutter.The track-before-detect(TBD)filter is an effective way to increase the signal-to-clutter ratio(SCR),thus improving the detection performance of small targets in sea clutter.To cope with the nonstationary characteristic of sea clutter,an easily-implemented Bayesian TBD filter with adaptive detection threshold is proposed and a new parameter estimation method is devised which is integrated into the detection process.The detection threshold is set according to the parameter estimation result under the framework of information theory.For detection of closely spaced targets,those within the same range cell as the one under test are treated as contribution to sea clutter,and a successive elimination method is adopted to detect them.Simulation results prove the effectiveness of the proposed algorithm in detecting small targets in nonstationary sea clutter,especially closely spaced ones.展开更多
The blurred image restoration method can dramatically highlight the image details and enhance the global contrast, which is of benefit to improvement of the visual effect during practical ap- plications. This paper is...The blurred image restoration method can dramatically highlight the image details and enhance the global contrast, which is of benefit to improvement of the visual effect during practical ap- plications. This paper is based on the dark channel prior principle and aims at the prior information absent blurred image degradation situation. A lot of improvements have been made to estimate the transmission map of blurred images. Since the dark channel prior principle can effectively restore the blurred image at the cost of a large amount of computation, the total variation （TV） and image morphology transform （specifically top-hat transform and bottom- hat transform） have been introduced into the improved method. Compared with original transmission map estimation methods, the proposed method features both simplicity and accuracy. The es- timated transmission map together with the element can restore the image. Simulation results show that this method could inhibit the ill-posed problem during image restoration, meanwhile it can greatly improve the image quality and definition.展开更多
LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)...LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)k number of encoded symbols to recover the original information. The degree distribution function in the LT codes helps to generate a random graph also referred as tanner graph. The artifact of tanner graph is responsible for computational complexity and overhead in the LT codes. Intuitively, a well designed degree distribution can be used for an efficient implementation of LT codes. The degree distribution function is studied as a function of power law, and LT codes are classified into two different categories: SFLT and RLT codes. Also, two different degree distributions are proposed and analyzed for SFLT codes which guarantee optimal performance in terms of computational complexity and overhead.展开更多
A best linear unbiased estimation(BLUE)algorithm for bistatic sonar localization is proposed.The Cramer-Rao bound for bistatic sonar and the geometrical dilution of precision(GDOP)in different conditions are given.The...A best linear unbiased estimation(BLUE)algorithm for bistatic sonar localization is proposed.The Cramer-Rao bound for bistatic sonar and the geometrical dilution of precision(GDOP)in different conditions are given.The simulation results show that the location accuracy of BLUE algorithm is higher than the weighted least square method.展开更多
Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to sa...Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.展开更多
An active queue management（AQM） algorithm called MCHOKeM is presented,which is borrowed from CHOKeW that draws multi-packets at random from the buffer,the multi-packets are compared with an arriving packet and aband...An active queue management（AQM） algorithm called MCHOKeM is presented,which is borrowed from CHOKeW that draws multi-packets at random from the buffer,the multi-packets are compared with an arriving packet and abandoned if they are from the same flow.But MCHOKeM uses multiple virtual queues for different priority packets and enhances the drawing function by adjusting the maximum number of draws based on the current status of virtual queue length.The number of parameters that MCHOKeM needs to maintain is determined by the number of priority levels being supported by the router,which usually has a small limited value.In order to explain the features of MCHOKeM,an analytical model is used.A series of simulation tests to evaluate the performance are given.展开更多
基金supported by Beijing Natural Science Foundation(4102050)the National Natural Science of Foundation of China(NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.
文摘The elements of network profile are proposed.Based on the network traffic distribution model,the network profile includes the application request rate,the branch transfer probability,the ratio of application requests,and the probability distribution of the requested objects.Based on the evaluation method of network performance reliability,four simulation cases are constructed in OPNET software,and the results show the four elements of profile have impacts on the network reliability.
基金Project supported by the Second Stage of Brain Korea 21 ProjectsProject(10035236)supported by the IT_R&D Program of MKE/KEIT,Korea
文摘Though the WiMedia supports higher data rates than other WPAN technologies,a WiMedia device cannot reach other devices that are separated from it by more than 10 m,which is the typical limited transmission range of the WiMedia protocol.In this work,we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that are located out of the transmission range.The proposed routing protocol is a hybrid algorithm,which mixes the table-driven and on-demand routing algorithms,searching one or more routes according to the number of hops to a destination device.WiMedia MAC is potentially capable of learning the existence of neighbor devices by using a beacon frame.By utilizing the neighbors' information,all devices can create routing entries for devices within 2-hops periodically.For devices beyond the 2-hop range,the newly designed on-demand routing algorithm is applied to multi-hop routing.If a routing entry for a destination device is not listed in the routing table,the source device sends a request packet to 2-hop range devices which could be found in the routing table.Since every device maintains routing entries for 2-hop range devices in the routing table,the request packet is replied in advance before its arrival at the destination device.Also,to decide the optimal route for a destination device,the number of medium access slots(MASs),received signal strength indicator(RSSI)and hop count are utilized to establish a QoS-enabled routing table.We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV.The simulation results show that the proposed protocol has better throughput and lower overhead than other protocols.
基金Project supported by the Changwon National University(2013-2014),Korea
文摘A smartphone-based context-aware augmentative and alternative communication(AAC) was applied was in order to enhance the user's experience by providing simple, adaptive, and intuitive interfaces. Various potential context-aware technologies and AAC usage scenarios were studied, and an efficient communication system was developed by combining smartphone's multimedia functions and its optimized sensor technologies. The experimental results show that context-awareness accuracy is achieved up to 97%.
基金supported (in part) by research funding from Chosun University, Korea, 2013
文摘A new method is presented for the segmentation of pulmonary parenchyma. The proposed method is based on the area calculation of different objects in the image. The main purpose of the proposed algorithm is the segment of the lungs images from the computer tomography(CT) images. The original image is binarized using the bit-plane slicing technique and among the different images the best binarized image is chosen. After binarization, the labeling is done and the area of each label is calculated from which the next level of binarized image is obtained. Then, the boundary tracing algorithm is applied to get another level of binarized image. The proposed method is able to extract lung region from the original images. The experimental results show the significance of the proposed method.
基金Project supported by Research Fund Chosun University 2014,Korea
文摘The nature of a wireless communication channel is very unpredictable. To design a good communication link, it is required to know the statistical model of the channel accurately. The average symbol error probability(ASER) was analyzed for different modulation schemes. A unified analytical framework was presented to obtain closed-form solutions for calculating the ASER of M-ary differential phase-shift keying(M-DPSK), coherent M-ary phase-shift keying(M-PSK), and quadrature amplitude modulation(QAM) over single or multiple Nakagami-m fading channels. Moreover, the ASER was estimated and evaluated by using the maximal ratio-combining(MRC) diversity technique. Simulation results show that an error rate of the fading channel typically depends on Nakagami parameters(m), space diversity(N), and symbol rate(M). A comparison between M-PSK, M-DPSK, and M-QAM modulation schemes was shown, and the results prove that M-ary QAM(M-QAM) demonstrates better performance compared to M-DPSK and M-PSK under all fading and non-fading conditions.
文摘Erratum to：J.Cent.South Univ.（2014）21：3811-3820DOI：10.1007/s11771-014-2366-9The original version of this article unfortunately contained three mistakes.The mistakes are corrected as follows：1）The spelling of third author is incorrect.The correct name is Jae-Young PYUN.2）The information of corresponding author is incorrect.The correct information should be Goo-Rak KWON,Professor,PhD;Tel/Fax：＋98-711-7264102;E-mail：grkwon@chosun.ac.kr
基金Project(RDF 11-02-03)supported by the Research Development Fund of XJTLU,China
文摘Information analysis of high dimensional data was carried out through similarity measure application. High dimensional data were considered as the a typical structure. Additionally, overlapped and non-overlapped data were introduced, and similarity measure analysis was also illustrated and compared with conventional similarity measure. As a result, overlapped data comparison was possible to present similarity with conventional similarity measure. Non-overlapped data similarity analysis provided the clue to solve the similarity of high dimensional data. Considering high dimensional data analysis was designed with consideration of neighborhoods information. Conservative and strict solutions were proposed. Proposed similarity measure was applied to express financial fraud among multi dimensional datasets. In illustrative example, financial fraud similarity with respect to age, gender, qualification and job was presented. And with the proposed similarity measure, high dimensional personal data were calculated to evaluate how similar to the financial fraud. Calculation results show that the actual fraud has rather high similarity measure compared to the average, from minimal 0.0609 to maximal 0.1667.
基金Project(61301095)supported by the National Natural Science Foundation of ChinaProject(QC2012C070)supported by Heilongjiang Provincial Natural Science Foundation for the Youth,ChinaProjects(HEUCF130807,HEUCFZ1129)supported by the Fundamental Research Funds for the Central Universities of China
文摘In modern electromagnetic environment, radar emitter signal recognition is an important research topic. On the basis of multi-resolution wavelet analysis, an adaptive radar emitter signal recognition method based on multi-scale wavelet entropy feature extraction and feature weighting was proposed. With the only priori knowledge of signal to noise ratio(SNR), the method of extracting multi-scale wavelet entropy features of wavelet coefficients from different received signals were combined with calculating uneven weight factor and stability weight factor of the extracted multi-dimensional characteristics. Radar emitter signals of different modulation types and different parameters modulated were recognized through feature weighting and feature fusion. Theoretical analysis and simulation results show that the presented algorithm has a high recognition rate. Additionally, when the SNR is greater than-4 d B, the correct recognition rate is higher than 93%. Hence, the proposed algorithm has great application value.
文摘Energy efficiency is a primary consideration in a wireless sensor network (WSN). This is also a major parameter when designing a medium access control (MAC) protocol for WSNs. Hierarchical clustering structure is regarded suitable for WSNs due to its good performance in energy conservation. In this work, an adequately flexible mechanism for clustering WSNs is designed, in which some creative or promotional metrics are utilized, such as cluster head selection algorithm, cluster optional reconstruction, interested data transmission, multiple path routing protocol. All these strategies were cooperated to maximize energy saving of whole system. An appropriate MAC protocol for this mechanism is proposed, by flexibly switching the status of diverse sensor nodes in different strategies. The simulation results show that the proposed MAC protocol is suitable for clustering WSNs and performs well in aspects of energy efficiency, flexibility and scalability.
文摘Multicast technology application has been widely utilized in broadband internet. Source authentication is one of the most needs for many multicast applications transferring real-time information such as stream video and online news. Because multicast current services provided to the group members are changed dynamically, data transferring by a group member is not used by the recipient. In order to verify the identity of the sender who sent the packet and to make sure that the data have not been tampered, an optimized source authentication scheme has been proposed to transfer the authentication information not to the next-door packet. The proposed method for multiple packets authenticates the source with a limited number of electronic signatures. The proposed method can reduce overhead compared to the method by adding a digital signature for every packet. In addition, by sending the generated electronic signature to the first packet and the last packet, it prevents the loss of consecutive packets, as well as a source authentication can be provided in real-time services.
基金supported by the Beijing Natural Science Foundation (4102050)NSFC-KOSEF Joint Research Project of China and Korea(60811140343), and the CDSN, GIST.
文摘The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has not considered the link capacities between edge routers and connected core routers. When a core router in a two layers’ network experiences congestion, the connected edge routers have no ability to adjust their access data rates. Thus, it is difficult to achieve the congestion control for the large scale network with many edge routers and core routers. To solve these problems, two difffserve AQM algorithms are proposed for the congestion control of multilayer network. One diffserv AQM algorithm implements fair link capacities of edge routers, and the other one implements unequal link capacities of edge routers, but it requires the core routers to have multi-queues buffers and Diffserv AQM to support. The proposed algorithms achieve the network congestion control by operating AQM parameters on the conditions of proposed three theorems for core and edge routers. The dynamic simulation results demonstrate the proposed control algorithms for core and edge routers to be valid.
基金supported by the National Natural Science Foundation of China(61671139)。
文摘Radar detection of small targets in sea clutter is a particularly demanding task because of the nonstationary characteristic of sea clutter.The track-before-detect(TBD)filter is an effective way to increase the signal-to-clutter ratio(SCR),thus improving the detection performance of small targets in sea clutter.To cope with the nonstationary characteristic of sea clutter,an easily-implemented Bayesian TBD filter with adaptive detection threshold is proposed and a new parameter estimation method is devised which is integrated into the detection process.The detection threshold is set according to the parameter estimation result under the framework of information theory.For detection of closely spaced targets,those within the same range cell as the one under test are treated as contribution to sea clutter,and a successive elimination method is adopted to detect them.Simulation results prove the effectiveness of the proposed algorithm in detecting small targets in nonstationary sea clutter,especially closely spaced ones.
基金supported by the National Natural Science Foundation of China(61301095)the Chinese University Scientific Fund(HEUCF130807)the Chinese Defense Advanced Research Program of Science and Technology(10J3.1.6)
文摘The blurred image restoration method can dramatically highlight the image details and enhance the global contrast, which is of benefit to improvement of the visual effect during practical ap- plications. This paper is based on the dark channel prior principle and aims at the prior information absent blurred image degradation situation. A lot of improvements have been made to estimate the transmission map of blurred images. Since the dark channel prior principle can effectively restore the blurred image at the cost of a large amount of computation, the total variation （TV） and image morphology transform （specifically top-hat transform and bottom- hat transform） have been introduced into the improved method. Compared with original transmission map estimation methods, the proposed method features both simplicity and accuracy. The es- timated transmission map together with the element can restore the image. Simulation results show that this method could inhibit the ill-posed problem during image restoration, meanwhile it can greatly improve the image quality and definition.
基金supported by Research Fund Chosun Univerity,2011
文摘LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)k number of encoded symbols to recover the original information. The degree distribution function in the LT codes helps to generate a random graph also referred as tanner graph. The artifact of tanner graph is responsible for computational complexity and overhead in the LT codes. Intuitively, a well designed degree distribution can be used for an efficient implementation of LT codes. The degree distribution function is studied as a function of power law, and LT codes are classified into two different categories: SFLT and RLT codes. Also, two different degree distributions are proposed and analyzed for SFLT codes which guarantee optimal performance in terms of computational complexity and overhead.
文摘A best linear unbiased estimation(BLUE)algorithm for bistatic sonar localization is proposed.The Cramer-Rao bound for bistatic sonar and the geometrical dilution of precision(GDOP)in different conditions are given.The simulation results show that the location accuracy of BLUE algorithm is higher than the weighted least square method.
基金supported by the National Research Foundation (NRF) of Korea through contract N-14-NMIR06
文摘Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.
基金supported by the Beijing Natural Science Foundation(4102050)USFC-KOSEF Joint Research Project of China and Korea(60811140343)
文摘An active queue management（AQM） algorithm called MCHOKeM is presented,which is borrowed from CHOKeW that draws multi-packets at random from the buffer,the multi-packets are compared with an arriving packet and abandoned if they are from the same flow.But MCHOKeM uses multiple virtual queues for different priority packets and enhances the drawing function by adjusting the maximum number of draws based on the current status of virtual queue length.The number of parameters that MCHOKeM needs to maintain is determined by the number of priority levels being supported by the router,which usually has a small limited value.In order to explain the features of MCHOKeM,an analytical model is used.A series of simulation tests to evaluate the performance are given.
