High utility itemsets refer to the sets of items with high like profit in a database, and efficient mining plays crucial role many real-life applications is an important research issue data area. To identify itemsets, most existing algorithms first generate candidate by overestimating their utilities, subsequently compute exact utilities these candidates. These incur problem that very large number candidates are generated, but found out be not after computed. In this paper, we propose...

High utility itemsets can reveal combinations of items that have a high profit, expense, or importance. Mining in database with <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> generally results huge search space, composed notation="LaTeX">$2^{n}$</tex-math></inline-formula> itemsets, and heavy calculations for the explored itemsets. Previous algorithms using prefix tree structures perform two phases, namely candidate generation testing. To avoid generating...

Frequent itemset mining is a fundamental problem in data area because frequent itemsets have been extensively used reasoning, classifying, clustering, and so on. To mine itemsets, previous algorithms based on prefix tree structure to construct many trees, which very time-consuming. In this paper, we propose novel algorithm called DPT (Dynamic Prefix Tree) uses only one tree. We first introduce the concept of post-conditional database an itemset, analyze distribution itemset's representing...

Abstract Background Processing raw DNA sequence data is an especially challenging task for relatively small laboratories and core facilities that produce as many 5000 or more sequences per week from multiple projects in widely differing species. To meet this challenge, we have developed the flexible, scalable, automated processing package described here. Results MAGIC-SPP a consisting of Oracle 9i relational database, Perl pipeline, user interfaces implemented either JavaServer Pages (JSP)...

Preparing for an accreditation visit is generally viewed as a huge ask. The new guidelines Information Technology (IT) suggest that should not be discrete event. With emphasis on outcomes, assessment, and continuous improvement, the seek to encourage IT departments look at process; iteration of data collection, analysis, change. To end, Department Clayton State University has developed prototype system maps department's outcomes course objectives ABET-CAC's IT. Student assignments are mapped...

By using solutions of an ordinary differential equation, auxiliary equation method is described to seek exact variable-coefficient KdV-MKdV equation. As a result, more new nontravelling solutions, which include soliton combined triangular periodic Jacobi elliptic function and for the are obtained. It shown that considered provides very effective, convenient, powerful mathematical tool solving many other nonlinear partial equations with variable coefficients in physics.

Video shot boundary detection, which segments a video by detecting boundaries between camera shots, is usually the first and important step for content-based retrieval. This paper investigates methods are effective in abrupt transitions gradual transitions, respectively, proposes an integration scheme to combine their results, aiming detect both types of transitions.

We studied issues in FPS game development such as expressive play, and character states management, rending scene, maps world, online team communication, weapon management game, multi-enemy rendering. In order to increase reusability, maintainability, quality of adapt evolutionary process, we explored on how apply design patterns handle with development. Although some are discussed, other might suitable well because programming so complicated separate each pattern independently.

High utility itemsets (HUIs) are sets of items with high utility, like profit, in a database. Efficient mining is an important problem the data area. Many algorithms adopt two-phase framework. They first generate set candidate by roughly overestimating utilities all database, and subsequently compute exact each to identify HUIs. Therefore, major costs these come from generation computation. Previous works mainly focus on how reduce number candidates, without dedicating much attention...

Information hiding is a technology aimed at the secure of important information into digital documents or media. In this paper, new approach proposed for gray scale images. The performed in two stages. first stage, binary bits sequence are shuffled and encoded with set integer keys system one-dimensional logistic mappings. second resulting embedded values selected pixels given image. A dynamic programming method utilized to select that minimize difference between cover image corresponding...

One of the main difficulties in solving many-objective optimization is lack selection pressure. For an problem, its purpose to obtain a nondominated solution set with better convergence and diversity. In this paper, two estimation methods are proposed convert problem into simple bi-objective that is, diversity methods, so as greatly improve probability certain dominance relation between solutions, then increase Based on new evolutionary algorithm, termed ABOEA, proposed. method, we use...

Abstract In the present study, we deal with space–time fractional KdV–MKdV equation and Konopelchenko–Dubrovsky in sense of conformable derivative. By means extend \left(\tfrac{G^{\prime} }{G}\right) -expansion method, many exact solutions are obtained, which include hyperbolic function solutions, trigonometric rational solutions. The results show that method is an efficient technique for solving nonlinear partial equations. We also provide some graphical representations to demonstrate...

We analyzed common game design patterns such as enemy, weapon, communication, and creative control well social interaction explored that are applicable to these patterns. The reusability, maintainability, quality of development supposed be improved is able adapt constant changing evolutionary building process. Although some discussed, other might suitable because programming too complicated separate apply each pattern independently.