It is now well understood that the 1 minimization algorithm is able to recover sparse signals from incomplete measurements [2], [1], [3] and sharp recoverable sparsity thresholds have also been obtained for the 1 minimization algorithm. However, even though iterative reweighted 1 minimization algorithms or related algorithms have been empirically observed to boost the recoverable sparsity thres...

It is now well understood that the l1 minimization algorithm is able to recover sparse signals from incomplete measurements [2], [1], [3] and sharp recoverable sparsity thresholds have also been obtained for the l1 minimization algorithm. However, even though iterative reweighted l1 minimization algorithms or related algorithms have been empirically observed to boost the recoverable sparsity th...

In this paper, we present an analysis expression of p∗(A, b) such that the unique solution to l0-minimization also can be the unique solution to lp-minimization for any 0 < p < p ∗(A, b). Furthermore, the main contribution of this paper isn’t only the analysis expressed of such p∗(A, b) but also its proof. Finally, we display the results of two examples to confirm the validity of our conclusion...

background and objectives: hospitals usually generate large amounts of hazardous waste. if not managed properly, hospital waste can pose threats to public safety and damage the environment. waste minimization is a waste management approach that focuses on reducing the amount and toxicity of hazardous wastes. this study pursues a two-fold purpose: 1) to gain insight into hospital waste minimizat...

Grain segmentation on 3D superalloy images provides superalloy’s micro-structures, based on which many physical and mechanical properties can be evaluated. This is a challenging problem in senses of (1) the number of grains in a superalloy sample could be thousands or even more; (2) the intensity within a grain may not be homogeneous; and (3) superalloy images usually contains carbides and nois...

We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u v requires an exponential number of states. We also show some conditions for the words u and v which ensure a quadratic upper bound on the state size of u v. Moreover, switching only two letters within one of u or v is enough to trigger the change from quadratic to...

We study large-scale classification problems in changing environments where a small part of the dataset is modified, and the effect of the data modification must be quickly incorporated into the classifier. When the entire dataset is large, even if the amount of the data modification is fairly small, the computational cost of re-training the classifier would be prohibitively large. In this pape...

Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which belong to that cluster. In this paper, we present an algorithm which produces planar drawings of clustered graphs in a convention known as orthogonal grid rectangular clust...