The distributed passive measurement is an important technology for networkbehavior research. To achieve a consistent measurement, the same packets should be sampled atdistributed measurement points. And in order to es...The distributed passive measurement is an important technology for networkbehavior research. To achieve a consistent measurement, the same packets should be sampled atdistributed measurement points. And in order to estimate the character of traffic statistics, thetraffic sample should be random in statistics. A distributed samplingmask measurement model isintroduced to tackle the difficulty of measuring the full trace of high-speed networks. The keypoint of the model is to choose some bits that are suitable to be sampling mask. In the paper, thebit entropy and bit flow entropy of IP packet headers in CERNET backbone are analyzed, and we findthat the 16 bits of identification field in IP packet header are fit to the matching field ofsampling mask. Measurement traffic also can be used to analyze the statistical character ofmeasurement sample and the randomicity of the model. At the same time the experiment resultsindicate that the model has a good sampling performance.展开更多
This paper presents a fuzzy logic approach to efficiently perform unsupervised character classification for improvement in robustness, correctness and speed of a character recognition system. The characters are first ...This paper presents a fuzzy logic approach to efficiently perform unsupervised character classification for improvement in robustness, correctness and speed of a character recognition system. The characters are first split into eight typographical categories. The classification scheme uses pattern matching to classify the characters in each category into a set of fuzzy prototypes based on a nonlinear weighted similarity function. The fuzzy unsupervised character classification, which is natural in the repre...展开更多
Because the small CACHE size of computers, the scanning speed of DFA based multi-pattern string-matching algorithms slows down rapidly especially when the number of patterns is very large. For solving such problems, w...Because the small CACHE size of computers, the scanning speed of DFA based multi-pattern string-matching algorithms slows down rapidly especially when the number of patterns is very large. For solving such problems, we cut down the scanning time of those algorithms (i.e. DFA based) by rearranging the states table and shrinking the DFA alphabet size. Both the methods can decrease the probability of large-scale random memory accessing and increase the probability of continuously memory accessing. Then the hitting rate of the CACHE is increased and the searching time of on the DFA is reduced. Shrinking the alphabet size of the DFA also reduces the storage complication. The AC++algorithm, by optimizing the Aho-Corasick (i.e. AC) algorithm using such methods, proves the theoretical analysis. And the experimentation results show that the scanning time of AC++and the storage occupied is better than that of AC in most cases and the result is much attractive when the number of patterns is very large. Because DFA is a widely used base algorithm in may string matching algorithms, such as DAWG, SBOM etc., the optimizing method discussed is significant in practice.展开更多
Power-line interference is one of the most common noises in magnetotelluric(MT)data.It usually causes distortion at the fundamental frequency and its odd harmonics,and may also affect other frequency bands.Although tr...Power-line interference is one of the most common noises in magnetotelluric(MT)data.It usually causes distortion at the fundamental frequency and its odd harmonics,and may also affect other frequency bands.Although trap circuits are designed to suppress such noise in most of the modern acquisition devices,strong interferences are still found in MT data,and the power-line interference will fluctuate with the changing of load current.The fixed trap circuits often fail to deal with it.This paper proposes an alternative scheme for power-line interference removal based on frequency-domain sparse decomposition.Firstly,the fast Fourier transform of the acquired MT signal is performed.Subsequently,a redundant dictionary is designed to match with the power-line interference which is insensitive to the useful signal.Power-line interference is separated by using the dictionary and a signal reconstruction algorithm of compressive sensing called improved orthogonal matching pursuit(IOMP).Finally,the frequency domain data are switched back to the time domain by the inverse fast Fourier transform.Simulation experiments and real data examples from Lu-Zong ore district illustrate that this scheme can effectively suppress the power-line interference and significantly improve data quality.Compared with time domain sparse decomposition,this scheme takes less time consumption and acquires better results.展开更多
The author found the text and poem writing had not always been correspondent to his personal experience through observation and reading. The poets really meant that their own poems could not express his suffering when...The author found the text and poem writing had not always been correspondent to his personal experience through observation and reading. The poets really meant that their own poems could not express his suffering when he said he had been afraid that he could not match his suffering. People often think the rich experieuce is the key to the depth of writing, but the truth is not like that. The author concluded that the content of poem shall keep certain gap with the ethic meaning through research on the experience and writing of the great poets and give an ontological questioning and then he can embody common humanity and emotion without blank teaching. A poet shall be in face of the difficulty of writing and learn to handle with the challenge of difficulty, and then the difficulty can be transferred into skill of writing,展开更多
In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can ...In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can be considered as an extention of regular grid point based matching. It avoids the shortcome of grid point based matching. For example, with this method, we can avoid low or even no texture area where errors frequently appear in cross correlaton matching. In the mean while, it makes full use of some mature techniques such as probability relaxation, image pyramid and the like which have already been successfully used in grid point matching process. Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.展开更多
The article analyzes the classical BM algorithm and an improved algorithm, and then it puts forward a new improved algorithm which called I_BM algorithm according to the characteristics of the string matching. The I_B...The article analyzes the classical BM algorithm and an improved algorithm, and then it puts forward a new improved algorithm which called I_BM algorithm according to the characteristics of the string matching. The I_BM algorithm determines the right distance according to the first character of the pattern string and the distance between the matching windows, so it fasts matching. The matching way of I_BM algorithm is from right to left. In order to verify the IBM algorithm＇ s performance, it does experiments on I_BM algorithm from two aspects of the matching times and the numbers of matching characters under the condition of the same text strings and pattem string. The experimental results show that I_BM algorithm is more quickly and more efficient because it reduces greatly the number of matching and character comparison for maximizing to skip the bad characters.展开更多
文摘The distributed passive measurement is an important technology for networkbehavior research. To achieve a consistent measurement, the same packets should be sampled atdistributed measurement points. And in order to estimate the character of traffic statistics, thetraffic sample should be random in statistics. A distributed samplingmask measurement model isintroduced to tackle the difficulty of measuring the full trace of high-speed networks. The keypoint of the model is to choose some bits that are suitable to be sampling mask. In the paper, thebit entropy and bit flow entropy of IP packet headers in CERNET backbone are analyzed, and we findthat the 16 bits of identification field in IP packet header are fit to the matching field ofsampling mask. Measurement traffic also can be used to analyze the statistical character ofmeasurement sample and the randomicity of the model. At the same time the experiment resultsindicate that the model has a good sampling performance.
文摘This paper presents a fuzzy logic approach to efficiently perform unsupervised character classification for improvement in robustness, correctness and speed of a character recognition system. The characters are first split into eight typographical categories. The classification scheme uses pattern matching to classify the characters in each category into a set of fuzzy prototypes based on a nonlinear weighted similarity function. The fuzzy unsupervised character classification, which is natural in the repre...
文摘Because the small CACHE size of computers, the scanning speed of DFA based multi-pattern string-matching algorithms slows down rapidly especially when the number of patterns is very large. For solving such problems, we cut down the scanning time of those algorithms (i.e. DFA based) by rearranging the states table and shrinking the DFA alphabet size. Both the methods can decrease the probability of large-scale random memory accessing and increase the probability of continuously memory accessing. Then the hitting rate of the CACHE is increased and the searching time of on the DFA is reduced. Shrinking the alphabet size of the DFA also reduces the storage complication. The AC++algorithm, by optimizing the Aho-Corasick (i.e. AC) algorithm using such methods, proves the theoretical analysis. And the experimentation results show that the scanning time of AC++and the storage occupied is better than that of AC in most cases and the result is much attractive when the number of patterns is very large. Because DFA is a widely used base algorithm in may string matching algorithms, such as DAWG, SBOM etc., the optimizing method discussed is significant in practice.
基金Project(2014AA06A602)supported by the National High-Tech Research and Development Program of ChinaProjects(41404111,41304098)supported by the National Natural Science Foundation of ChinaProject(2015JJ3088)supported by the Natural Science Foundation of Hunan Province,China
文摘Power-line interference is one of the most common noises in magnetotelluric(MT)data.It usually causes distortion at the fundamental frequency and its odd harmonics,and may also affect other frequency bands.Although trap circuits are designed to suppress such noise in most of the modern acquisition devices,strong interferences are still found in MT data,and the power-line interference will fluctuate with the changing of load current.The fixed trap circuits often fail to deal with it.This paper proposes an alternative scheme for power-line interference removal based on frequency-domain sparse decomposition.Firstly,the fast Fourier transform of the acquired MT signal is performed.Subsequently,a redundant dictionary is designed to match with the power-line interference which is insensitive to the useful signal.Power-line interference is separated by using the dictionary and a signal reconstruction algorithm of compressive sensing called improved orthogonal matching pursuit(IOMP).Finally,the frequency domain data are switched back to the time domain by the inverse fast Fourier transform.Simulation experiments and real data examples from Lu-Zong ore district illustrate that this scheme can effectively suppress the power-line interference and significantly improve data quality.Compared with time domain sparse decomposition,this scheme takes less time consumption and acquires better results.
文摘The author found the text and poem writing had not always been correspondent to his personal experience through observation and reading. The poets really meant that their own poems could not express his suffering when he said he had been afraid that he could not match his suffering. People often think the rich experieuce is the key to the depth of writing, but the truth is not like that. The author concluded that the content of poem shall keep certain gap with the ethic meaning through research on the experience and writing of the great poets and give an ontological questioning and then he can embody common humanity and emotion without blank teaching. A poet shall be in face of the difficulty of writing and learn to handle with the challenge of difficulty, and then the difficulty can be transferred into skill of writing,
文摘In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can be considered as an extention of regular grid point based matching. It avoids the shortcome of grid point based matching. For example, with this method, we can avoid low or even no texture area where errors frequently appear in cross correlaton matching. In the mean while, it makes full use of some mature techniques such as probability relaxation, image pyramid and the like which have already been successfully used in grid point matching process. Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.
文摘The article analyzes the classical BM algorithm and an improved algorithm, and then it puts forward a new improved algorithm which called I_BM algorithm according to the characteristics of the string matching. The I_BM algorithm determines the right distance according to the first character of the pattern string and the distance between the matching windows, so it fasts matching. The matching way of I_BM algorithm is from right to left. In order to verify the IBM algorithm＇ s performance, it does experiments on I_BM algorithm from two aspects of the matching times and the numbers of matching characters under the condition of the same text strings and pattem string. The experimental results show that I_BM algorithm is more quickly and more efficient because it reduces greatly the number of matching and character comparison for maximizing to skip the bad characters.
