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.     

Solving the irregular strip packing problem via guided local search for overlap minimization

The irregular strip-packing problem (ISP) requires a given set of non-convex polygons to be placed without overlap within a rectangular container having a fixed width and a variable length, which is to be minimized. As a core sub-problem to solve ISP, we consider an overlap minimization problem (OMP) whose objective is to place all polygons into a container with given width and length so that the total amount of overlap between polygons is made as small as possible. We propose to use directional penetration depths to measure the amount of overlap between a pair of polygons, and present an efficient algorithm to find a position with the minimum overlap for each polygon when it is translated in a specified direction. Based on this, we develop a local search algorithm for OMP that translates a polygon in horizontal and vertical directions alternately. Then we incorporate it in our algorithm for OMP, which is a variant of the guided local search algorithm. Computational results show that our algorithm improves the best-known values of some well-known benchmark instances.     

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

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

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作为集成开发程序,开发一个具有信息录入、信息查询、排序、信息修改等基本功能,学生信息管理系统。     

渔业信息服务软件源程序版本控制

版本控制在软件开发中具有重要的作用,随着渔业信息服务软件的模块数量和规模不断扩大,利用版本控制技术管理源程序显得愈加重要。介绍了渔业信息软件开发过程中,利用Subversion版本控制系统进行源程序管理的方法。     

基于积件思想的高职计算机课程项目式教学探索——以C语言程序设计为例

基于积件思想,对五年制高职计算机课程项目式教学进行探索,以C语言程序设计为例研究分析,并组建C语言程序设计课程知识点积件库,编写高职C语言程序设计课程项目式校本教材,分析C语言程序设计课程教学项目“阶梯电价计费”.并借助开源平台Moodle实现了教学项目的应用.     

PETOOL: MATLAB-based one-way and two-way split-step parabolic equation tool for radiowave propagation over variable terrain

A MATLAB-based one-way and two-way split-step parabolic equation software tool (PETOOL) has been developed with a user-friendly graphical user interface (GUI) for the analysis and visualization of radio-wave propagation over variable terrain and through homogeneous and inhomogeneous atmosphere. The tool has a unique feature over existing one-way parabolic equation (PE)-based codes, because it utilizes the two-way split-step parabolic equation (SSPE) approach with wide-angle propagator, which is a recursive forward–backward algorithm to incorporate both forward and backward waves into the solution in the presence of variable terrain. First, the formulation of the classical one-way SSPE and the relatively-novel two-way SSPE is presented, with particular emphasis on their capabilities and the limitations. Next, the structure and the GUI capabilities of the PETOOL software tool are discussed in detail. The calibration of PETOOL is performed and demonstrated via analytical comparisons and/or representative canonical tests performed against the Geometric Optic (GO) + Uniform Theory of Diffraction (UTD). The tool can be used for research and/or educational purposes to investigate the effects of a variety of user-defined terrain and range-dependent refractivity profiles in electromagnetic wave propagation.

Program summary

Program title: PETOOL (Parabolic Equation Toolbox)Catalogue identifier: AEJS_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJS_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 143 349No. of bytes in distributed program, including test data, etc.: 23 280 251Distribution format: tar.gzProgramming language: MATLAB (MathWorks Inc.) 2010a. Partial Differential Toolbox and Curve Fitting Toolbox requiredComputer: PCOperating system: Windows XP and VistaClassification: 10Nature of problem: Simulation of radio-wave propagation over variable terrain on the Earth?s surface, and through homogeneous and inhomogeneous atmosphere.Solution method: The program implements one-way and two-way Split-Step Parabolic Equation (SSPE) algorithm, with wide-angle propagator. The SSPE is, in general, an initial-value problem starting from a reference range (typically from an antenna), and marching out in range by obtaining the field along the vertical direction at each range step, through the use of step-by-step Fourier transformations. The two-way algorithm incorporates the backward-propagating waves into the standard one-way SSPE by utilizing an iterative forward–backward scheme for modeling multipath effects over a staircase-approximated terrain.Unusual features: This is the first software package implementing a recursive forward–backward SSPE algorithm to account for the multipath effects during radio-wave propagation, and enabling the user to easily analyze and visualize the results of the two-way propagation with GUI capabilities.Running time: Problem dependent. Typically, it is about 1.5 ms (for conducting ground) and 4 ms (for lossy ground) per range step for a vertical field profile of vector length 1500, on Intel Core 2 Duo 1.6 GHz with 2 GB RAM under Windows Vista.     

XML基础上的多媒体数据技术研究

数据的转换与传输技术是DMB EPG前端系统的核心技术。通过深入研究DMB EPG的协议、技术背景和工作原理,探讨了DMB EPG前端系统的数据转换技术,并设计实现了基于XML的DMB EPG数据转换技术,即提出了一种基于Schema模式的数据转换方法。