Set （ k, n ）-Exactly covering problem

<正> With the (k,n) -threshold scheme of secret sharing in the field of information security technology asan application background,the concept of set ( k,n)-exact cover is presented in this paper.It is a modificationof the original concept of set covering problem.It is also different from the concept of exact coverdefined by J.E.Hopcroft.Some properties of ( k,n) -exact cover are investigated;a sufficient conditionfor a set to be ( k,n ) -exactly coverable is given.It follows that a feasible assignment scheme of a set forthe (k,n) -exact cover is obtained if this set satisfies the sufficient condition.     

A NEW METHOD FOR SUPPORTING ENTERPRISE IN THE FORMULATION OF ITS MERGER STRATEGICS

This paper discusses the influences of experience effect and market growth rate on the formulation of enterprise merger strategies; develops a new model for technically analysing and evaluating enterprise merger strategies by combining the progromming tool in market share theory-experience curve; and the key factor reflecting external enviornment-market growth rate, to provide scientific support when an enterprise decides to make its merger strategies.