由于序列模式挖掘需要花费大量计算时间,并需要占用大量存储空间.减少计算量、节省存储空间开销成为序列模式挖掘的关键.因PrefixSpan算法不产生候选,而适当应用Bitmap数据结构可避免重复扫描数据库,基于此,本文提出了BM-PrefixSpan算法...由于序列模式挖掘需要花费大量计算时间,并需要占用大量存储空间.减少计算量、节省存储空间开销成为序列模式挖掘的关键.因PrefixSpan算法不产生候选,而适当应用Bitmap数据结构可避免重复扫描数据库,基于此,本文提出了BM-PrefixSpan算法,用于序列模式挖掘,设计并构造了PFPBM(Prefix of First Position on BitMap)表用于记录序列中的每个项在位图中第1次出现的位置.实验结果表明,BM-PrefixSpan算法综合了PrefixSpan和SPAM算法的优点,能够更快、更好地挖掘出序列模式.展开更多
In this paper, an improved algorithm, named STC-I, is proposed for Chinese Web page clustering based on Chinese language characteristics, which adopts a new unit choice principle and a novel suffix tree construction p...In this paper, an improved algorithm, named STC-I, is proposed for Chinese Web page clustering based on Chinese language characteristics, which adopts a new unit choice principle and a novel suffix tree construction policy. The experimental results show that the new algorithm keeps advantages of STC, and is better than STC in precision and speed when they are used to cluster Chinese Web page. Key words clustering - suffix tree - Web mining CLC number TP 311 Foundation item: Supported by the National Information Industry Development Foundation of ChinaBiography: YANG Jian-wu (1973-), male, Ph. D, research direction: information retrieval and text mining.展开更多
Conventional OFDM transmission system uses a fixed-length Cyclic Prefix to counteract Inter-Symbol Inter- ferences (ISI) caused by channel delay spreading under wireless mobile environment. This may cause considerabl...Conventional OFDM transmission system uses a fixed-length Cyclic Prefix to counteract Inter-Symbol Inter- ferences (ISI) caused by channel delay spreading under wireless mobile environment. This may cause considerable per- formance deterioration when the CP length is less than the channel RMS delay spread, or may decrease the system power and spectrum efficiency when it is much larger. A novel Orthogonal Frequency Division Multiplexing (OFDM) transmission scheme is proposed in this paper to adapt the CP length to the variation of channel delay spread. AOFDM-VCPL utilizes the preamble or pilot sub-carriers of each OFDM packet to estimate the channel RMS delay spread; and then uses a criterion to calculate the CP length , which finally affects the OFDM transmitter. As illustrated in the simulation section, by deploying this scheme in a typical wireless environment, the system can transmit at data rate 11.5 Mb/s higher than conventional non-adaptive system while gaining a 0.65 dB power saving at the same BER performance.展开更多
OFDM is a promising technique for high data rate transmission and the channel estimation is very important for implementation of OFDM. In this paper, cyclic prefix (CP) can be used as a source of channel information w...OFDM is a promising technique for high data rate transmission and the channel estimation is very important for implementation of OFDM. In this paper, cyclic prefix (CP) can be used as a source of channel information which is originally used to reduce inter symbol interference (ISI). Based on this CP observation, we propose two cross coupled dual Kalman filters to track the channel variations without additional training sequences. One Kalman filter AR parameter estimation and another for fading channel estimation.展开更多
With the increasing maritime activities,a great demand of wide-area maritime digital data services is needed.Therefore,Narrowband Internet of Things(NB-IoT)that can provide wide coverage has been expected as an applic...With the increasing maritime activities,a great demand of wide-area maritime digital data services is needed.Therefore,Narrowband Internet of Things(NB-IoT)that can provide wide coverage has been expected as an application for maritime communication networks(MCNS).In this paper,we aim to enhance the spectral efficiency in NB-IoT by reducing the cyclic prefix(CP)overhead in random access signal without causing interference.The key point of the proposed scheme is the symbols transmitted for multiple times repeatedly in NB-IoT.Specifically,all CP are removed and multi-path fading effect is eliminated by using a repeated symbol to cover the disturbed symbol to construct a circular convolution structure of the channel with the same effect as adding CP.In addition,a single-tap equalization is still appropriate.To validate the effectiveness of the proposed scheme,simulation results are carried out with respect to the bit error ratio(BER).展开更多
The present paper is aimed to testify that the richness and abundance of English vocabulary is closely related to prefixes. Through the analysis of prefixes such as mal-and mis-, a better understanding of word formati...The present paper is aimed to testify that the richness and abundance of English vocabulary is closely related to prefixes. Through the analysis of prefixes such as mal-and mis-, a better understanding of word formation from the perspective of semantic factors and functional factors as well as morphology factors will be obtained.展开更多
Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which...Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which decreases the number of memory operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm.展开更多
Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,bu...Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.展开更多
In this paper, a Turbo aided Cyclic Prefix (CP) reconstruction scheme, termed Turbo- CPR, is proposed for Single-Carrier systems with Frequency-Domain Equalization (SC-FDE) that employ insufficient CP in the transmitt...In this paper, a Turbo aided Cyclic Prefix (CP) reconstruction scheme, termed Turbo- CPR, is proposed for Single-Carrier systems with Frequency-Domain Equalization (SC-FDE) that employ insufficient CP in the transmitter. In Turbo-CPR, the decoder output is incorporated in the process of equalization, i.e. Turbo equalizer is employed. It is shown in the simulation results that Turbo-CPR not only recovers the performance loss due to insufficiency of CP, but also provides extra gains over the lower bound of performance for conventional CP reconstruction schemes.展开更多
文摘由于序列模式挖掘需要花费大量计算时间,并需要占用大量存储空间.减少计算量、节省存储空间开销成为序列模式挖掘的关键.因PrefixSpan算法不产生候选,而适当应用Bitmap数据结构可避免重复扫描数据库,基于此,本文提出了BM-PrefixSpan算法,用于序列模式挖掘,设计并构造了PFPBM(Prefix of First Position on BitMap)表用于记录序列中的每个项在位图中第1次出现的位置.实验结果表明,BM-PrefixSpan算法综合了PrefixSpan和SPAM算法的优点,能够更快、更好地挖掘出序列模式.
文摘In this paper, an improved algorithm, named STC-I, is proposed for Chinese Web page clustering based on Chinese language characteristics, which adopts a new unit choice principle and a novel suffix tree construction policy. The experimental results show that the new algorithm keeps advantages of STC, and is better than STC in precision and speed when they are used to cluster Chinese Web page. Key words clustering - suffix tree - Web mining CLC number TP 311 Foundation item: Supported by the National Information Industry Development Foundation of ChinaBiography: YANG Jian-wu (1973-), male, Ph. D, research direction: information retrieval and text mining.
基金Project supported by the National Natural Science Foundation ofChina (No. 60002003) and the Hi-Tech Research and Develop-ment Program (863) of China (No. 2002AA123044)
文摘Conventional OFDM transmission system uses a fixed-length Cyclic Prefix to counteract Inter-Symbol Inter- ferences (ISI) caused by channel delay spreading under wireless mobile environment. This may cause considerable per- formance deterioration when the CP length is less than the channel RMS delay spread, or may decrease the system power and spectrum efficiency when it is much larger. A novel Orthogonal Frequency Division Multiplexing (OFDM) transmission scheme is proposed in this paper to adapt the CP length to the variation of channel delay spread. AOFDM-VCPL utilizes the preamble or pilot sub-carriers of each OFDM packet to estimate the channel RMS delay spread; and then uses a criterion to calculate the CP length , which finally affects the OFDM transmitter. As illustrated in the simulation section, by deploying this scheme in a typical wireless environment, the system can transmit at data rate 11.5 Mb/s higher than conventional non-adaptive system while gaining a 0.65 dB power saving at the same BER performance.
文摘OFDM is a promising technique for high data rate transmission and the channel estimation is very important for implementation of OFDM. In this paper, cyclic prefix (CP) can be used as a source of channel information which is originally used to reduce inter symbol interference (ISI). Based on this CP observation, we propose two cross coupled dual Kalman filters to track the channel variations without additional training sequences. One Kalman filter AR parameter estimation and another for fading channel estimation.
文摘With the increasing maritime activities,a great demand of wide-area maritime digital data services is needed.Therefore,Narrowband Internet of Things(NB-IoT)that can provide wide coverage has been expected as an application for maritime communication networks(MCNS).In this paper,we aim to enhance the spectral efficiency in NB-IoT by reducing the cyclic prefix(CP)overhead in random access signal without causing interference.The key point of the proposed scheme is the symbols transmitted for multiple times repeatedly in NB-IoT.Specifically,all CP are removed and multi-path fading effect is eliminated by using a repeated symbol to cover the disturbed symbol to construct a circular convolution structure of the channel with the same effect as adding CP.In addition,a single-tap equalization is still appropriate.To validate the effectiveness of the proposed scheme,simulation results are carried out with respect to the bit error ratio(BER).
文摘The present paper is aimed to testify that the richness and abundance of English vocabulary is closely related to prefixes. Through the analysis of prefixes such as mal-and mis-, a better understanding of word formation from the perspective of semantic factors and functional factors as well as morphology factors will be obtained.
基金supported by the National Natural Science Foundation of China(6050203260672068).
文摘Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which decreases the number of memory operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm.
基金Sponsored by the National Natural Science Foundation of China(60372042)
文摘Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.
文摘In this paper, a Turbo aided Cyclic Prefix (CP) reconstruction scheme, termed Turbo- CPR, is proposed for Single-Carrier systems with Frequency-Domain Equalization (SC-FDE) that employ insufficient CP in the transmitter. In Turbo-CPR, the decoder output is incorporated in the process of equalization, i.e. Turbo equalizer is employed. It is shown in the simulation results that Turbo-CPR not only recovers the performance loss due to insufficiency of CP, but also provides extra gains over the lower bound of performance for conventional CP reconstruction schemes.
