clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. the aim of clustering is to collect data points. in this paper, a cultural algorithm (ca) is presented to optimize partition with n objects into k clusters. the ca is one of the effective methods for searching into the problem space in order to find a n...

Abstract We review the materials science applications of nested sampling (NS) method, which was originally conceived for calculating evidence in Bayesian inference. describe how NS can be adapted to sample potential energy surface (PES) atomistic systems, providing a straightforward approximation partition function and allowing evaluation thermodynamic variables at arbitrary temperatures. After...

Recently, using modular forms and Smoot’s Mathematica implementation of Radu’s algorithm for proving partition congruences, Merca proved the following two congruences: all \(n\ge 0,\)$$\begin{aligned} A(9n+5)&\equiv 0 \pmod {3}, \\ A(27n+26)&\equiv {3}. \end{aligned}$$Here, A(n) is closely related to function which counts number cubic partitions, partitions wherein even parts are allowed appear...

Abstract 360-degree videos have become increasingly popular with the application of virtual reality (VR) technology. To encode such kind ultra-high resolution, an efficient and real-time video encoder becomes a key requirement. The Versatile Video Coding (VVC) standard has good coding performance. However, it pretty high computational complexity which increasing cost videos. Among them, decisio...

Incremental expressions are important in materialized view maintenance, query optimization, and constraint checking. In this paper, we derive incremental expressions for the nest and unnest operators in nested relations. The expressions are derived for both general nested relations using set operators for updating relations and for partition-normal form (PNF) relations using extended set operat...

In this paper we compare nested dissection orderings obtained by diierent graph bisection heuristics. In the context of parallel sparse matrix factorization the quality of an ordering is not only determined by its ll reducing capability, but also depends on the dif-culty with which a balanced mapping of the load onto the processors of the parallel computer can be found. Our analysis shows that ...

The goal of this thesis is to design and implement an efficient facility to enforce the nesting and the partial ordering requirements of transactions in S-Store [1], the world’s first streaming OLTP engine for real-time applications. We first compare and contrast different approaches to enforce these requirements, and conclude that nested transaction stands out both in terms of data integrity g...