A soft computing approach for privacy requirements engineering: The PriS framework

Soft computing continuously gains interest in many fields of academic and industrial domain; among the most notable characteristics for using soft computing methodological tools is the ability to handle with vague and imprecise data in decision making processes. Similar conditions are often encountered in requirements engineering. In this paper, we introduce the PriS approach, a security and privacy requirements engineering framework which aims at incorporating privacy requirements early in the system development process. Specifically, PriS provides a set of concepts for modelling privacy requirements in the organisation domain and a systematic way-of-working for translating these requirements into system models. The conceptual model of PriS uses a goal hierarchy structure. Every privacy requirement is either applied or not on every goal. To this end every privacy requirement is a variable that can take two values [0,1] on every goal meaning that the requirements constraints the goal (value 1) or not (value 0). Following this way of working PriS ends up suggesting a number of implementation techniques based on the privacy requirements constraining the respective goals. Taking into account that the mapping of privacy variables to a crisp set consisting of two values [0,1] is constraining, we extend also the PriS framework so as to be able to address the degree of participation of every privacy requirement towards achieving the generic goal of privacy. Therefore, we propose a fuzzification of privacy variables that maps the expression of the degree of participation of each privacy variable to the [0,1] interval. We also present a mathematical framework that allows the concurrent management of combined independent preferences towards the necessity of a privacy measure; among the advantages of the presented extended framework is the scalability of the approach in such a way that the results are not limited by the number of independent opinions or by the number of factors considered while reasoning for a specific selection of privacy measures.     

一种典型的刷流量黑客攻击现象分析

利用控制“肉鸡”方式刷流量的黑客攻击现象日益频发,本文通过一典型案例,分析该作案手法的特点。     

大型煤炭建工集团管理信息系统

介绍了中平能化建工集团管理信息系统的总体设计方案、网络及软件平台架构、子系统功能模块组成等。该系统采用智能客户端网络架构和万向接口平台技术,实现了建工企业的全部专用功能以及各个子系统之间的信息交互,使得各机构之间能够有效地协同运作。     

以校企合作教育运行机制培养计算机工程型人才

目前的校企合作普遍存在企业积极性不高、规模难以扩大、合作难以持久的状况,根本原因是学校还没有真正建立起能够服务于企业并能规范运作的校企合作教育运行保障机制。本文结合西安邮电学院培养计算机工程型人才的教学改革实践,对校企合作教育运行机制的形成条件、保障作用及内容构成等进行了探讨。     

谈计算机专业工程型与应用型人才培养

依据"高等学校计算机科学与技术专业发展战略研究报告暨专业规范关于计算机专业人才培养模式的指导意见",针对洛阳理工学院自身特点,文章讨论计算机学科课程教学模式改革途径、青年教师培养模式、建立工程实践能力培养基地方案,设计了专业课程与实践项目对接、科技创新项目开发过程资源管理、开发实验室预约为一体的工程实践管理软件平台,为培养计算机专业工程型与应用型人才进行了有益的探索与研究。     

独立学院软件工程特色专业建设探索

独立学院在经历快速发展后,为了能更好地形成自身的办学特色,必须要加强专业建设。文章主要阐述集美大学诚毅学院如何通过校企合作,建设软件工程特色专业,推进教学内容和课程体系的改革、师资队伍建设、推行新的教学方法和手段,完善人才创新和实践能力培养体系。     

高性能机群计算本科教学研究

针对目前高性能机群人才需求旺盛而高校对高性能机群计算知识普及不够的现状,以培养工程实践性机群系统管理人员为目标,阐述面向高校计算机专业本科生开设高性能机群计算课程的教学目标;并进行课程设计,包括教学内容及教材选取、课时安排以及教学方法设计。北京工业大学的教学实践表明,上述课程设计取得了较好的教学成效。     

基于FFT图像差值在轮胎印痕识别中的研究

轮胎印痕识别对交通事故的现场勘测及事后侦查有着十分重要的作用.介绍了轮胎印痕识别在交通肇事逃逸案侦破中的具体应用,研究了基于FFT的图像差值原理,提出了基于FFT图像差值算法的轮胎印痕识别方法,并分析了具体的试验数据,结果显示,该方法有利于提高轮胎印痕识别的成功率,为快速查找肇事逃逸车辆提供了理论基础和科学依据.     

经济型补偿柜调试仪

介绍了一种使用三相工频电源,利用2个小功率变压器和若干开关组成的补偿柜调试仪,与传统继保仪相比具有极高的经济性,能够较好地满足补偿柜的调试需要。     

Patch layout from feature graphs

The structuring of surface meshes is a labor intensive task in reverse engineering. For example, in CAD, scanned triangle meshes must be divided into characteristic/uniform patches to enable conversion into high-level spline surfaces. Typical industrial techniques, like rolling ball blends, are very labor intensive.We provide a novel, robust and quick algorithm for the automatic generation of a patch layout based on a topology consistent feature graph. The graph separates the surface along feature lines into functional and geometric building blocks. Our algorithm then thickens the edges of the feature graph and forms new regions with low varying curvature. Further, these new regions-so-called fillets and node patches-will have highly smooth boundary curves, making the algorithm an ideal preprocessor for a subsequent spline fitting algorithm.