let $d$ be an integral domain and $star$ a semistar operation stable and of finite type on it. we define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong s-domains. as an application, we give new characterizations of $star$-quasi-pr"{u}fer domains and um$t$ domains in terms of dimension ine...

Let m,n, d, e be fixed positive integers such that m = 2n, e = (n, d) = (m, d), 1 ≤ k ≤ n e . Let s be a fixed maximum-length binary sequence of length 2−1. For 0 ≤ j < k, let sj be the circular decimation of s with decimation factor 2 n e +1. Then s, s1, · · · , sk−1 are maximum-length binary sequences of length 2 − 1, while s0 is a maximum-length binary sequence of length 2−1. Let C be the F2...

Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Nain...

cold start is one of the main challenges in recommender systems. solving sparsechallenge of cold start users is hard. more cold start users and items are new. sine many general methods for recommender systems has over fittingon cold start users and items, so recommendation to new users and items is important and hard duty. in this work to overcome sparse problem, we present a new method for rec...