物联网技术专业课程体系探索

论述物联网专业设置的必要性和可行性,探讨物联网技术专业的人才培养目标,研究物联网技术专业的课程体系结构,以期研究工作有助于为即将开设该专业的学校提供参考。     

生态课堂教学模式在VB程序设计的应用初探

本文运用生态学的理论和方法研究VB程序设计课堂中存在的问题,从多个角度对VB课堂进行深入探讨,力求从生态学的视角解读VB程序设计课堂,揭示其课堂中的失衡现象,进而构建VB程序设计生态课堂,将生态平衡的理念融入VB程序设计课堂教学中。     

模式在程序设计教学中的应用

基于模式的程序设计教学方法是有益的尝试。本文分析客观存在于程序设计教学中的模式,并以算法实现级模式、程序构建级模式为例,探讨模式在程序设计教学中的应用,从思维工具、知识关联、教学效用三个方面总结这种教学新思维对于提高教学效率的作用。     

案例—任务驱动模式的计算机程序语言教学探究

案例—任务驱动式教学是将案例和任务驱动教学有机结合的一种新教学方法,该方法目前在计算机程序语言教学中正处于探索和尝试阶段。本文针对传统计算机程序语言教学的不足,分析研究了案例—任务驱动式教学运用于计算机程序语言课程教学的可行性和实施策略,形成了计算机程序语言案例—任务驱动教学模式。     

网络工程专业“双主线”教学体系构建

以天津工程师范学院网络工程专业为例,就专业人才培养方案的专业定位、理论及实践教学体系构建进行探讨,提出就业方向决定人才培养目标的自底向上的教学体系。同时,针对网络工程专业的发展,在教学体系中确定软硬两条主线以保证学生在专业知识上由浅入深的学习。     

Matrix games with interval data

The conventional game theory is concerned with how rational individuals make decisions when they are faced with known payoffs. In the real world, sometimes the payoffs are not known and have to be estimated, and sometimes the payoffs are only approximately known. This paper develops a solution method for the two-person zero-sum game where the payoffs are imprecise and are represented by interval data. Since the payoffs are imprecise, the value of the game should be imprecise as well. A pair of two-level mathematical programs is formulated to obtain the upper bound and lower bound of the value of the game. Based on the duality theorem and by applying a variable substitution technique, the pair of two-level mathematical programs is transformed to a pair of ordinary one-level linear programs. Solving the pair of linear programs produces the interval of the value of the game. It is shown that the two players in the game have the same upper bound and lower bound for the value of the imprecise game. An example illustrates the whole idea and sheds some light on imprecise game.     

基于函数签名的控制流监控方法

针对恶意篡改程序控制流攻击方式,提出一种监控程序控制流完整性的方法。对程序源代码进行扫描,以函数作为识别程序行为的基本粒子,利用函数调用执行的序列信息,建立表现程序原意的行为轨迹模型,利用该模型在运行期监控程序的执行流程。实验结果表明,该方法对篡改控制流的攻击起到了很好的防御作用。     

Polymorphic bytecode instrumentation

Bytecode instrumentation is a widely used technique to implement aspect weaving and dynamic analyses in virtual machines such as the Java virtual machine. Aspect weavers and other instrumentations are usually developed independently and combining them often requires significant engineering effort, if at all possible. In this article, we present polymorphic bytecode instrumentation(PBI), a simple but effective technique that allows dynamic dispatch amongst several, possibly independent instrumentations. PBI enables complete bytecode coverage, that is, any method with a bytecode representation can be instrumented. We illustrate further benefits of PBI with three case studies. First, we describe how PBI can be used to implement a comprehensive profiler of inter‐procedural and intra‐procedural control flow. Second, we provide an implementation of execution levels for AspectJ, which avoids infinite regression and unwanted interference between aspects. Third, we present a framework for adaptive dynamic analysis, where the analysis to be performed can be changed at runtime by the user. We assess the overhead introduced by PBI and provide thorough performance evaluations of PBI in all three case studies. We show that pure Java profilers like JP2 can, thanks to PBI, produce accurate execution profiles by covering all code, including the core Java libraries. We then demonstrate that PBI‐based execution levels are much faster than control flow pointcuts to avoid interference between aspects and that their efficient integration in a practical aspect language is possible. Finally, we report that PBI enables adaptive dynamic analysis tools that are more reactive to user inputs than existing tools that rely on dynamic aspect‐oriented programming with runtime weaving. These experiments position PBI as a widely applicable and practical approach for combining bytecode instrumentations. © 2015 The Authors. Software: Practice and Experience Published by John Wiley & Sons Ltd.     

An integer program and a hybrid genetic algorithm for the university timetabling problem

The university timetabling problem (UTP) has been studied by numerous research groups for decades. In addition to addressing hard and soft constraints, we extend the UTP by considering consecutiveness and periodicity constraints of multi-session lectures, which are common in many eastern Asian universities. Because schedulers can decide the consecutiveness and periodicity constraints for the multi-session lectures within a limited ratio, we consider these novel decision variables in our model. We develop a mixed integer linear program for the UTP. For the analysis, we convert the UTP into the three-dimensional container packing problem (3DCPP) and create a hybrid genetic algorithm (HGA), which has been shown to be efficient in solving the 3DCPP. We also develop a tabu search algorithm based on the existing UTP literature and compare the findings with that of our HGA. The results show that our HGA obtains a better solution than the tabu search algorithm in a reasonable amount of time.     

基于VisualC语言的学生信息管理系统

利用MicrosoftVisualC作为集成开发程序,开发一个具有信息录入、信息查询、排序、信息修改等基本功能,学生信息管理系统。