Constructing a Non-Negative Low Rank and Sparse Graph with Data-Adaptive Features

This paper aims at constructing a good graph for discovering intrinsic data structures in a semi-supervised learning setting. Firstly, we propose to build a non-negative low-rank and sparse (referred to as NNLRS) graph for the given data representation. Specifically, the weights of edges in the graph are obtained by seeking a nonnegative low-rank and sparse matrix that represents each data sample as a linear combination of others. The so-obtained NNLRS-graph can capture both the global mixture of subspaces structure (by the low rankness) and the locally linear structure (by the sparseness) of the data, hence is both generative and discriminative. Secondly, as good features are extremely important for constructing a good graph, we propose to learn the data embedding matrix and construct the graph jointly within one framework, which is termed as NNLRS with embedded features (referred to as NNLRS-EF). Extensive experiments on three publicly available datasets demonstrate that the proposed method outperforms the state-of-the-art graph construction method by a large margin for both semi-supervised classification and discriminative analysis, which verifies the effectiveness of our proposed method

Simultaneous slack budgeting and retiming for synchronous circuits optimization

Abstract- With the challenges of growing functionality and scaling chip size, the possible performance improvements should be considered in the earlier IC design stages, which gives more freedom to the later optimization. Potential slack as an effective metric of possible performance improvements is considered in this work which, as far as we known, is the first work that maximizes the potential slack by retiming for synchronous sequential circuit. A simultaneous slack budgeting and incremental retiming algorithm is proposed for maximizing potential slack. The overall slack budget is optimized by relocating the FFs iteratively with the MIS-based slack estimation. Compared with the potential slack of a well-known min-period retiming, our algorithm improves potential slack averagely 19.6 % without degrading the circuit performance in reasonable runtime. Furthermore, at the expense of a small amount of timing performance, 0.52 % and 2.08%, the potential slack is increased averagely by 19.89 % and 28.16 % separately, which give a hint of the tradeoff between the timing performance and the slack budget.

A Coupled Model for Solution Flow and Bioleaching Reaction Based on the Evolution of Heap Pore Structure

Based on the basic seepage law, equations have been derived to descript the solution flow within the copper ore heap which is treated as anisotropy porous media. The relationship between heap permeability and pore ratio has been revealed. Given the consideration of cover pressure and particle dissolution, pore evolution model has been set up. The pore evolution mechanism, due to the process of dissolution, precipitation, blockage, collapse, and caking, has been investigated. The comprehensive model for pore evolution and solution flow under the effect of solute transport and leaching reaction has been established. A trapezoidal heap was calculated, and the estimated results show that permeability decreases with the decreasing of pore ratio. Therefore, the permeability of the heap with small particles is relatively low because of its low pore ratio. Furthermore, permeability and height are found to be the two main factors influencing the solution flow

Target localization based on bistatic T/R pair selection in GNSS-based multistatic radar system

To cope with the increasingly complex electromagnetic environment, multistatic radar systems, especially the passive multistatic radar, are becoming a trend of future radar development due to their advantages in anti-electronic jam, anti-destruction properties, and no electromagnetic pollution. However, one problem with this multi-source network is that it brings a huge amount of information and leads to considerable computational load. Aiming at the problem, this paper introduces the idea of selecting external illuminators in the multistatic passive radar system. Its essence is to optimize the configuration of multistatic T/R pairs. Based on this, this paper respectively proposes two multi-source optimization algorithms from the perspective of resolution unit and resolution capability, the Covariance Matrix Fusion Method and Convex Hull Optimization Method, and then uses a Global Navigation Satellite System (GNSS) as an external illuminator to verify the algorithms. The experimental results show that the two optimization methods significantly improve the accuracy of multistatic positioning, and obtain a more reasonable use of system resources. To evaluate the algorithm performance under large number of transmitting/receiving stations, further simulation was conducted, in which a combination of the two algorithms were applied and the combined algorithm has shown its effectiveness in minimize the computational load and retain the target localization precision at the same time