In this paper,a new optimizing model has been designed to the linear programming model for time-cost trade-off in networks by using the characters of network construction. The model cuts down nearly the half number of...In this paper,a new optimizing model has been designed to the linear programming model for time-cost trade-off in networks by using the characters of network construction. The model cuts down nearly the half number of constraints then enlarges the extent of the application to network optindzation.展开更多
Block principle and pattern classification component analysis （BPCA） is a recently developed technique in computer vision In this paper, we propose a robust and sparse BPCA with Lp-norm, referred to as BPCALp-S, whi...Block principle and pattern classification component analysis （BPCA） is a recently developed technique in computer vision In this paper, we propose a robust and sparse BPCA with Lp-norm, referred to as BPCALp-S, which inherits the robustness of BPCA-L1 due to the employment of adjustable Lp-norm. In order to perform a sparse modelling, the elastic net is integrated into the objective function. An iterative algorithm which extracts feature vectors one by one greedily is elaborately designed. The monotonicity of the proposed iterative procedure is theoretically guaranteed. Experiments of image classification and reconstruction on several benchmark sets show the effectiveness of the proposed approach.展开更多
In this paper, we build the Linear Programming (LP) model, factor analysis model and return on investment model to measure the investment amount and which year to invest of each selected schools. We firstly analyze th...In this paper, we build the Linear Programming (LP) model, factor analysis model and return on investment model to measure the investment amount and which year to invest of each selected schools. We firstly analyze the indicators from attached files, and select effective indexes to choose schools donated. Then we select 17 indexes out after preprocessing all the indices. Secondly, we extract 1064 schools by MATLAB which is the Potential Candidate Schools from the table of attached files;we extract 10 common factors of these schools by factor analysis. After calculation, we rank the universities and select the top 100. We calculate the Return on Investment (ROI) based on these 17 indexes. Thirdly, we figure out the investment amount by conducting LP model through MATLAB. According to the property of schools, we calculate the annual limit investment and the mount of investment of each school. Fourthly, we determine which year to invest by ROI model which is operated by LINGO. In order to achieve optimal investment strategy and not duplication of investment, for five years, starting July 2016, we assume that the time duration that the organization’s money should be provided is one year, and the school return to the Good grant Foundation only one year. Then we can get the investment amount per school, the return on that investment, and which years to invest. Fifthly, by changing parameter, the sensitivity analysis is conducted for our models. The result indicates that our models are feasible and robust. Finally, we evaluate our models, and point out the strengths and weakness. Through previous analysis, we can find that our models can be applied to many fields, which have a relatively high generalization.展开更多
文摘In this paper,a new optimizing model has been designed to the linear programming model for time-cost trade-off in networks by using the characters of network construction. The model cuts down nearly the half number of constraints then enlarges the extent of the application to network optindzation.
基金the National Natural Science Foundation of China(No.61572033)the Natural Science Foundation of Education Department of Anhui Province of China(No.KJ2015ZD08)the Higher Education Promotion Plan of Anhui Province of China(No.TSKJ2015B14)
文摘Block principle and pattern classification component analysis （BPCA） is a recently developed technique in computer vision In this paper, we propose a robust and sparse BPCA with Lp-norm, referred to as BPCALp-S, which inherits the robustness of BPCA-L1 due to the employment of adjustable Lp-norm. In order to perform a sparse modelling, the elastic net is integrated into the objective function. An iterative algorithm which extracts feature vectors one by one greedily is elaborately designed. The monotonicity of the proposed iterative procedure is theoretically guaranteed. Experiments of image classification and reconstruction on several benchmark sets show the effectiveness of the proposed approach.
文摘In this paper, we build the Linear Programming (LP) model, factor analysis model and return on investment model to measure the investment amount and which year to invest of each selected schools. We firstly analyze the indicators from attached files, and select effective indexes to choose schools donated. Then we select 17 indexes out after preprocessing all the indices. Secondly, we extract 1064 schools by MATLAB which is the Potential Candidate Schools from the table of attached files;we extract 10 common factors of these schools by factor analysis. After calculation, we rank the universities and select the top 100. We calculate the Return on Investment (ROI) based on these 17 indexes. Thirdly, we figure out the investment amount by conducting LP model through MATLAB. According to the property of schools, we calculate the annual limit investment and the mount of investment of each school. Fourthly, we determine which year to invest by ROI model which is operated by LINGO. In order to achieve optimal investment strategy and not duplication of investment, for five years, starting July 2016, we assume that the time duration that the organization’s money should be provided is one year, and the school return to the Good grant Foundation only one year. Then we can get the investment amount per school, the return on that investment, and which years to invest. Fifthly, by changing parameter, the sensitivity analysis is conducted for our models. The result indicates that our models are feasible and robust. Finally, we evaluate our models, and point out the strengths and weakness. Through previous analysis, we can find that our models can be applied to many fields, which have a relatively high generalization.
