基于情感分析和LDA主题模型的协同过滤推荐算法

协同过滤推荐算法通常基于物品或用户的相似度来实现个性化推荐,但是数据的稀疏性往往导致推荐精度不理想。大多数传统推荐算法仅考虑用户对物品的总体评分,而忽略了评论文本中用户对物品各个属性面的偏好。该文提出一种基于情感分析的推荐算法SACF(reviews sentiment analysis for collaborative filtering),该算法在经典的协同过滤推荐算法的基础上,考虑评论文本对相似度计算的影响。SACF算法利用LDA主题模型挖掘物品潜在的K个属性面,通过用户在各个属性面上的情感偏好计算用户相似度,从而构建推荐模型。基于京东网上评论数据集的实验结果表明,SACF算法不但可以有效地改善传统协同过滤推荐算法中数据稀疏性的问题,而且提高了推荐系统的精度。     

CropStraw Fire Remote Sensing Monitoring and Its Algorithm Implementation

in order to obtain the information and achieve the effective control of crop straw fire spatial distribution in Central China Region.The MODIS L1B remote sensing datasets during 2014 for the main data source in this article,and combined with land use data,the farmland of Central China Region was taken as study region.Based on the enhanced contextual fire remote sensing detection algorithm,and make full use of the theoretical knowledge of quantitative remote sensing and Geospatial Data Abstraction Library (GDAL)and other technical means,to achieve the crop straw fire recognition in Central China Region.Using Ministry of Environmental Protection of the People’s Republic of China release the daily newspaper of crop straw fire in China and the standard fire products (MYD14)of MODIS for the comparative analysis of the quantitative and spatial.The results indicate that the algorithmof this paper can achieve crop straw fire remote sensing monitoring of this study region effectively,and the parameters can be adjusted in real time based on the characteristic of the study region,and improve the automation and working efficiency of crop straw fire monitoring.     

基于分层递阶商空间链的图连通性研究

图连通性的判定对于路径规划中任意两点间路径相通性判断以及连通块的划分都具有重要意义。从节点的边连通关系着手分析图的结构层次,通过构建图的分层递阶商空间链,分析不同层次商空间链中各节点分布情况,得出新的图连通性判定方法。与以往各判定方法相比,该方法具有易实现、效率高的优点,不仅能有效地判定图是否连通,还能确定图的连通分支数以及哪些节点位于同一连通分支中。     

Android系统 Root权限获取与检测

Android是一个基于Linux多用户多进程操作系统,在这个系统中,应用程序（或者系统的部分）会在自己的进程中运行。系统和应用之间的安全性通过Linux的Sandbox（沙盒机制）在进程级别来强制实现的,比如会给应用程序分配user ID和Group ID。在Android系统中Root拥有最高权限,如果成为Root用户就可以实现破解。本文介绍了Android的安全机制和常用的Android获取Root权限的方法,以及如何检测Android是否被Root。     

服务器虚拟化在数字化校园建设中的应用

在高校数字化校园的建设过程中,有三个重要的问题需要解决。第一,随着应用系统地不断增加,相应地对服务器的需求日益增长。第二,应用系统的高可靠运行至关重要。第三,计算机硬件资源的统一调度、共享、管理。随着虚拟化技术的发展,这些问题得到了很好的解决。服务器虚拟化方法可以在一台服务器上虚拟多台计算机,从而可以降低服务器的采购、管理和维护成本,提高应用系统的高可靠性和资源的利用率。     

ASP.NET课程教学的回顾、思考与探索

ASP.NET是与计算机相关专业的专业课程,但微软的产品更新换代非常快,以至许多教科书根本没有跟上技术的步伐。在教学中老师也总是觉得自己的知识是落后的。结合自己的教学经验,结合ASP.NET教学中遇到的问题,并探索和改革课程某些内容的教学方式,力求让学生学到更新、更全面的ASP.NET技术知识。     

基于DSP的壁纸印刷花纹涂层厚度在线检测

在壁纸生产过程中,尤其是在花纹印刷过程中,有效地在线测量花纹涂层厚度,对于减少壁纸生产的次品率和提高生产效率至关重要。本课题针对壁纸印刷花纹涂层厚度在线检测问题进行了研究,利用激光传感器测厚原理,基于TI公司生产的TMS320F2812DSP芯片为硬件核心处理器,完成了花纹涂层厚度的非接触在线测量。     

电路虚拟维修关键技术研究

利用3ds max建立三维模型,为虚拟维修提供操作对象;利用OrCAD建立电路仿真模型,为虚拟维修提供数据支撑;在EON Studio建立的虚拟场景中设置虚拟维修操作,并通过VB平台将电路仿真结果发送至虚拟场景中,实现对电子设备电路仿真结果的实时读取,为电子装备维修训练提供强有力的技术手段.     

Reachability and stabilization of discrete-time affine systems with disturbances

This paper studies the fundamental problems: whether an affine system affected by additive disturbances is robustly transferable from a source set (simplex) to a target set (polytope) and whether it is robustly stabilizable with its state constrained in a simplex. First, a necessary and sufficient condition is derived for the existence of affine feedback control that solves the robust reachability problem. Further investigation is provided for two situations relying on whether the union of the source set and the target set is convex or non-convex. For the former one, a necessary and sufficient condition is obtained in the form of linear inequalities, while for the latter, several computationally feasible sufficient conditions are found. Second, we show that robust stabilization subject to a state constraint is equivalent to find a feasible solution to a linear equation. Once it is known that either of the problems has a solution by checking the derived conditions, design of control laws is then straightforward.     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.