一种基于粗糙集理论的快速并行属性约简算法

将并行计算的思想融入基于粗糙集理论的快速属性约简中,提出了一种基于粗糙集理论的快速并行属性约简算法.该算法在保证约简结果是Pawlak约简的情况下,将属性约简任务划分到多个处理器中同时处理,从而大大提高了属性约简的效率.仿真实验结果说明了该算法的高效性.     

基于MPI的FDTD并行算法及其优化策略

由高性能PC机通过网络互联构成的集群(COW)并行计算系统上应用基于消息传递(Message Passing)的方式实现FDTD的并行算法,获得了足够的加速比,有效地解决了传统的FDTD方法计算电大尺寸目标电磁散射问题时的不足.通过区域分割,各个子区域在边界处与其相邻的子区域进行场值的数据传递,从而实现了FDTD算法的并行化.利用并行FDTD方法研究了电磁波的介质层的散射,结果表明并行算法和串行计算结果的一致性,并有效提高计算效率.最后还给出了对算法进行通信隐藏的优化方法,进一步提高了并行计算的效率.     

信息系统及其综合集成技术

信息与信息系统无处不在,信息化已成为当今的时代特征。本文通过对这一时代特征的透视,首先阐明计算机信息系统的切确含义和基本结构;然后指出,为适应信息世界的不断变化和发展,一体化信息系统所需的综合集成是柔性的,并揭示支持随需应变的若干敏捷软件技术;进而就相关的平台软件,包括基础中间件和各类应用集成中间件,以及领域应用框架进行分类并作必要诠释;最后讨论信息系统的发展趋势和云计算等若干热点问题。     

Optimum design of long-span suspension bridges considering aeroelastic and kinematic constraints

Cable supported bridges are wind prone structures. Therefore, their aerodynamic behaviour must be studied in depth in order to guarantee their safe performance. In the last decades important achievements have been reached in the study of bridges under wind-induced actions. On the other hand, non-conventional design techniques such as sensitivity analysis or optimum design have not been applied although they have proved their feasibility in the automobile or aeronautic industries. The aim of this research work is to demonstrate how non-conventional design techniques can help designers when dealing with long span bridges considering their aeroelastic behaviour. In that respect, the comprehensive analytical optimum design problem formulation is presented. In the application example the optimum design of the challenging Messina Strait Bridge is carried out. The chosen initial design has been the year 2002 design proposal. Up to a 33% deck material saving has been obtained after finishing the optimization process.     

信息与计算科学专业实践教学体系的探索与优化

信息与计算科学专业是联系数学与信息科学的一门新兴专业,目前很多学校开设了这个专业,很多学校已具有较完善的理论课程,但实践教学体系尚不完善,对学生的创新能力培养非常不利。我们经过多年的积淀,并结合专业培养目标,对信息与计算科学专业的实践教学体系进行探索与优化。     

数字媒体综述及计算人才培养思路

本文参照电子商务的概述方式,对数字媒体进行了思考;分析了数字媒体与数字艺术的区别,讨论了为什么要研究数字媒体;总结了数字媒体特点、类型、起源和发展,提出进行数字媒体研究的方法;最后再参考IEEE的CC2005课程体系,提出了涵盖数字媒体的计算人才培养思路。     

一般院校信息与计算科学专业人才培养模式研究

文章通过对信息与计算科学专业与计算机科学专业进行比较分析,提出了信息与计算科学专业的改革思想与培养方案,制定相应的理论教学课程体系和实践教学体系。本文的研究成果,将对一般高等院校信息与计算科学专业建设及其课程建设,具有一定的指导意义。     

A survey on privacy inference attacks and defenses in cloud-based Deep Neural Network

Deep Neural Network (DNN), one of the most powerful machine learning algorithms, is increasingly leveraged to overcome the bottleneck of effectively exploring and analyzing massive data to boost advanced scientific development. It is not a surprise that cloud computing providers offer the cloud-based DNN as an out-of-the-box service. Though there are some benefits from the cloud-based DNN, the interaction mechanism among two or multiple entities in the cloud inevitably induces new privacy risks. This survey presents the most recent findings of privacy attacks and defenses appeared in cloud-based neural network services. We systematically and thoroughly review privacy attacks and defenses in the pipeline of cloud-based DNN service, i.e., data manipulation, training, and prediction. In particular, a new theory, called cloud-based ML privacy game, is extracted from the recently published literature to provide a deep understanding of state-of-the-art research. Finally, the challenges and future work are presented to help researchers to continue to push forward the competitions between privacy attackers and defenders.     

Container-Based Internet of Vehicles Edge Application Migration Mechanism

Internet of Vehicles (IoV) applications integrating with edge computing will significantly drive the growth of IoV. However, the contradiction between the high-speed mobility of vehicles, the delay sensitivity of corresponding IoV applications and the limited coverage and resource capacity of distributed edge servers will pose challenges to the service continuity and stability of IoV applications. IoV application migration is a promising solution that can be supported by application containerization, a technology forseamless cross-edge-server application migration without user perception. Therefore, this paper proposes the container-based IoV edge application migration mechanism, consisting of three parts. The first is the migration trigger determination algorithm for cross-border migration and service degradation migration, respectively, based on trajectory prediction and traffic awareness to improve the determination accuracy. The second is the migration target decision calculation model for minimizing the average migration time and maximizing the average service time to reduce migration times and improve the stability and adaptability of migration decisions. The third is the migration decision algorithm based on the improved artificial bee colony algorithm to avoid local optimal migration decisions. Simulation results show that the proposed migration mechanism can reduce migration times, reduce average migration time, improve average service time and enhance the stability and adaptability of IoV application services.     

A characterization of (regular) circular languages generated by monotone complete splicing systems

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for monotone complete systems, which are finite circular splicing systems with rules of a simpler form. We show that a circular language L is generated by a monotone complete system if and only if the set Lin(L) of all words corresponding to L is a pure unitary language generated by a set closed under the conjugacy relation. The class of pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G. Rozenberg in 1983, as a subclass of the class of context-free languages, together with a characterization of regular pure unitary languages by means of a decidable property. As a direct consequence, we characterize (regular) circular languages generated by monotone complete systems. We can also decide whether the language generated by a monotone complete system is regular. Finally, we point out that monotone complete systems have the same computational power as finite simple systems, an easy type of circular splicing system defined in the literature from the very beginning, when only one rule of a specific type is allowed. From our results on monotone complete systems, it follows that finite simple systems generate a class of languages containing non-regular languages, showing the incorrectness of a longstanding result on simple systems.