The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Graph pattern mining is an important part of the emerging social network science, and the research of the maximum clique problem is one of the most important research branches. In the big data environment, the mass of nodes and complexity of edges in the graph set a higher requirement on the speed and accuracy of the maximum clique (MCP) study. In this paper, we present a parallel graph partitioning...
We consider the problem of simplifying the artificial bee colony (ABC) algorithm and study the mechanism that actually contributes to its outstanding performance. Based on the collective behaviors of honey bee colony, ABC algorithm is one of the most effective algorithms solving numeric optimization problem. It simulates the collective behavior of honey bee colony with a set of behavioral rules observed...
Nowadays, the issues such as the thin algorithm, attack sensitivity, narrow applications restrict the development of text watermark technology. This paper purposes to coordinate multi-watermarking algorithms to work collaboratively by polymorphism watermarking algorithm. We extract the relevant classification characteristics and discuss the defining polymorphism watermarking algorithm, and focus on...
This paper proposes a research framework for graphic digital text Watermarking algorithms and methods. We summarized graphic text watermarking after a brief review of digital text watermarking, and propose the research framework that consists of 8 levels, such as pixel, line, etymon, character, row, paragraph, page, and chapter. According to the embedding methods, each level is divided into three...
Three typical algorithms, which are the radix-2 Fast Fourier Transformation (FFT) Algorithm, improved Discrete Fourier Transformation (DFT) algorithm, and Goertzel algorithm, are employed to decode the sub-audio signal of CTCSS. The practical consideration of implementation of the three algorithms with reasonable modification is discussed in this paper. We illustrate the decoding performance of these...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.