Large-scale video compression: recent advances and challenges

The evolution of social network and multimedia technologies encourage more and more people to generate and upload visual information, which leads to the generation of large-scale video data. Therefore, preeminent compression technologies are highly desired to facilitate the storage and transmission of these tremendous video data for a wide variety of applications. In this paper, a systematic review of the recent advances for large-scale video compression (LSVC) is presented. Specifically, fast video coding algorithms and effective models to improve video compression efficiency are introduced in detail, since coding complexity and compression efficiency are two important factors to evaluate video coding approaches. Finally, the challenges and future research trends for LSVC are discussed.     

浅谈网页制作课程的技巧

很多学校的计算机专业设有网页制作课程.通过网页制作课程,学生了解了网页制作的过程和应用,为将来的网页制作工作打下了良好的基础.本文作者就网页制作的意义展开论述,简要的阐述了网页制作课程中运用任务驱动法、集中教学法、项目教学法以及分组合作学习法加强网页制作课程的技巧性.     

基于流量预测的Ad hoc网络入侵检测方案

Ad hoc网络具有无线传输的介质、动态改变的拓扑、缺乏监督等特点,为解决其安全防御问题,提出并实现了基于网络流量预测的Ad hoc入侵检测系统。该系统主要包括节点检测和响应系统两个部分,网络中的节点采用节点检测引擎对网络流量进行预测,根据原始流量与预测流量的差值来判断目标节点的恶意性,并据此做出路由调整。实验结果表明,该系统具有较高的检测率和较低的误警率。     

基于DWSPSO的软件测试数据自动生成

针对软件结构测试数据的自动生成提出了一种动态改变惯性权重的简化粒子群算法(DWSPSO)。该算法舍弃了粒子速度这个参数,并通过粒子群中所有粒子适应度的整体变化跟踪粒子群的状态。在每次迭代时,算法可根据粒子的适应度变化动态改变惯性权重,从而使算法具有动态自适应性全局搜索与局部搜索能力。实验结果表明,该算法在测试数据的自动生成上,优于基本的粒子群算法以及惯性权值线性递减粒子群算法(LDWPSO)。     

H-Bézier曲线的降多阶逼近

国内外对参数曲线降阶,尤其是对Bézier曲线降阶的研究已渐趋成熟,但尚缺少对超越曲线降阶的研究.为此以能精确表示指数曲线、悬链线等超越曲线的H-Bézier曲线为载体,运用H-Bézier曲线的升阶公式,结合广义逆矩阵理论给出了H-Bézier曲线一次降多阶的逼近方法;同时估计了降阶的误差界,并建立了与Bézier曲线降阶的关系.实验结果表明,采用该方法可取得较好的逼近效果,有效地丰富了H-Bézier曲线的理论体系.     

语义信息与CRF结合的汉语功能块自动识别

为了构建汉语功能块自动识别系统,该文利用条件随机域模型对经过正确词语切分和词性标注处理的汉语句子进行功能块边界识别和功能信息标注处理,通过在特征提取阶段优化组合丰富的上下文特征,得到功能块识别的精确率、召回率和F1-measure值分别为85.84%、85.07%和85.45%。在此基础上,该文引入由词义聚合关系将汉语单词组织起来的《同义词词林》作为语义资源,把其中的语义信息作为特征加入到功能块的识别过程,缓解了数据稀疏以及歧义问题对识别结果造成的影响,使得上述三个性能指标分别提高到86.21%、85.31%和85.76%。     

On optimization of expertise matching with various constraints

This paper studies the problem of expertise matching with various constraints. Expertise matching, which aims to find the alignment between experts and queries, is a common problem in many applications such as conference paper-reviewer assignment, product-reviewer alignment, and product-endorser matching. Most existing methods formalize this problem as an information-retrieval problem and focus on finding a set of experts for each query independently. However, in real-world systems, various constraints are often needed to be considered. For example, in order to review a paper, it is desirable that there is at least one senior reviewer to guide the reviewing process. An important question is: “Can we design a framework to efficiently find the optimal solution for expertise matching under various constraints?” This paper explores such an approach by formulating the expertise matching problem in a constraint-based optimization framework. In the proposed framework, the problem of expertise matching is linked to a convex cost flow problem, which guarantees an optimal solution under various constraints. We also present an online matching algorithm to support incorporating user feedbacks in real time. The proposed approach has been evaluated on two different genres of expertise matching problems, namely conference paper-reviewer assignment and teacher-course assignment. Experimental results validate the effectiveness of the proposed approach. Based on the proposed method, we have also developed an online system for paper-reviewer suggestions, which has been used for paper-reviewer assignment in a top conference and feedbacks from the conference organizers are very positive.     

Group search optimizer based optimal location and capacity of distributed generations

This paper presents a novel efficient population-based heuristic approach for optimal location and capacity of distributed generations (DGs) in distribution networks, with the objectives of minimization of fuel cost, power loss reduction, and voltage profile improvement. The approach employs an improved group search optimizer (iGSO) proposed in this paper by incorporating particle swarm optimization (PSO) into group search optimizer (GSO) for optimal setting of DGs. The proposed approach is executed on a networked distribution system—the IEEE 14-bus test system for different objectives. The results are also compared to those that executed by basic GSO algorithm and PSO algorithm on the same test system. The results show the effectiveness and promising applications of the proposed approach in optimal location and capacity of DGs.     

基于层次树模型的Deep Web数据提取方法

网络在成为信息查询和发布平台的同时,海量的信息隐藏在查询受限的Web数据库中,使得人们无法有效地获取这些高质量的数据记录.传统的Deep Web搜索研究主要集中在通过关键字接口获取Web数据库内容.但是,由于Deep Web具有多属性和top-k的特点,基于关键字的方法具有固有的缺点,这就为Deep Web查询和检索带来了挑战.为了解决这个问题,提出了一种基于层次树的Deep Web数据获取方法,该方法可以无重复和完整地提取Web数据库中的数据记录.该方法首先把Web数据库模型化为一棵层次树,Deep Web数据获取问题就转化为树的遍历问题.其次,对树中的属性排序,缩小遍历空间;同时,利用基于属性值相关度的启发规则指导遍历过程提高遍历效率.最后,在本地模拟数据库和真实Web数据库上的大量实验证明,这种方法可以达到很好的覆盖度和较高的提取效率.     

面向无人驾驶地图更新的安全信任管理方案

地图的实时性和准确性在无人驾驶车辆导航中发挥着重要作用。基于卫星图像的数字地图能够保证地图中道路信息的准确性,但是根据相关路况信息进行实时更新时,由于车辆用户数较多且来源复杂,因此无法确保数据的安全性和可靠性。提出一种基于区块链的认证与信任管理方案。利用无证书签名技术实现车辆的匿名认证,保证车辆身份的可验证性和不可否认性。设计基于区块链的信任管理机制,通过存储在区块链上的历史信任值计算路况消息的可信度,同时将可靠的路况信息发送给地图更新服务器,根据车辆提供信息的真实与否更新车辆信誉值,实现车辆信誉的同步与更新。从计算开销、通信开销和信任管理功能等方面验证了该方案的有效性。仿真结果表明,该方案具有较高的地图更新效率和防骗能力,能够确保数据来源的安全性和可靠性,为无人驾驶车辆提供实时路况更新服务。