Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a...Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size.展开更多
In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, ...In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, is investigated and hence put forward. The algorithm computes the areas of the outer rectangular bounds of a closed contour in different revolving angles θ by dispersing approach where 0< θ < π/2 because of the axial symmetry. It is very simple, straight forward and highly efficient. The complexity of its computing time reaches O(n·k ). Practical applications suggest its usefulness and efficiency.展开更多
Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show...Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.展开更多
The authors consider optimization methods for box constrained variational inequalities. First, the authors study the KKT-conditions problem based on the original problem. A merit function for the KKT-conditions proble...The authors consider optimization methods for box constrained variational inequalities. First, the authors study the KKT-conditions problem based on the original problem. A merit function for the KKT-conditions problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original problem is reformulated as minimization with simple constraints. Then, the authors show that any stationary point of the optimization problem is a solution of the original problem. Finally, a descent algorithm is presented for the optimization problem, and global convergence is shown.展开更多
传统的文本生成对抗方法主要采用位置置换、字符替换等方式,耗费时间较长且效果较差。针对以上问题,该文提出一种基于改进蚁群算法的对抗样本生成模型IGAS(Improved ant colony algorithm to Generate Adversarial Sample),利用蚁群算...传统的文本生成对抗方法主要采用位置置换、字符替换等方式,耗费时间较长且效果较差。针对以上问题,该文提出一种基于改进蚁群算法的对抗样本生成模型IGAS(Improved ant colony algorithm to Generate Adversarial Sample),利用蚁群算法的特点生成对抗样本,并利用类形字进行优化。首先,构建城市节点群,利用样本中的词构建城市节点群;然后对原始输入样本,利用改进的蚁群算法生成对抗样本;再针对生成结果,通过构建的中日类形字典进行字符替换,生成最终的对抗样本;最后在黑盒模式下进行对抗样本攻击实验。实验在情感分类、对话摘要生成、因果关系抽取等多种领域验证了该方法的有效性。展开更多
文摘Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size.
文摘In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, is investigated and hence put forward. The algorithm computes the areas of the outer rectangular bounds of a closed contour in different revolving angles θ by dispersing approach where 0< θ < π/2 because of the axial symmetry. It is very simple, straight forward and highly efficient. The complexity of its computing time reaches O(n·k ). Practical applications suggest its usefulness and efficiency.
基金Supported by the National Natural Science Foundation of China (60473012)
文摘Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.
基金the National Natural Science Foundation of China(No.19971002)
文摘The authors consider optimization methods for box constrained variational inequalities. First, the authors study the KKT-conditions problem based on the original problem. A merit function for the KKT-conditions problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original problem is reformulated as minimization with simple constraints. Then, the authors show that any stationary point of the optimization problem is a solution of the original problem. Finally, a descent algorithm is presented for the optimization problem, and global convergence is shown.
文摘传统的文本生成对抗方法主要采用位置置换、字符替换等方式,耗费时间较长且效果较差。针对以上问题,该文提出一种基于改进蚁群算法的对抗样本生成模型IGAS(Improved ant colony algorithm to Generate Adversarial Sample),利用蚁群算法的特点生成对抗样本,并利用类形字进行优化。首先,构建城市节点群,利用样本中的词构建城市节点群;然后对原始输入样本,利用改进的蚁群算法生成对抗样本;再针对生成结果,通过构建的中日类形字典进行字符替换,生成最终的对抗样本;最后在黑盒模式下进行对抗样本攻击实验。实验在情感分类、对话摘要生成、因果关系抽取等多种领域验证了该方法的有效性。
