基于牛顿迭代法的二次规划程序，采用VC平台，适合解决大容量稀疏矩阵的优化问题-Newton iterative method based on the quadratic programming procedures using VC platform, suitable for solving large sparse matrix capacity optimization
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001456s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.102139s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001348s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001979s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001312s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003677s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001161s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003281s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016076s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001560s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 112851 [ RunTime:0.001615s ]
