Course scheduling algorithm based on improved binary cuckoo search

Course scheduling is a combinatorial optimization problem with multiple constraints. To achieve the reasonable allocation of teaching resources, all courses should be arranged under a number of specified constraints. With the increased number of courses, the solution space increases exponentially. However, the traditional methods cannot quickly find the optimal solution. In order to overcome the disadvantages of low efficiency and the possibility of high conflict in traditional course scheduling, this research study proposes a course scheduling, method based on an improved binary cuckoo search algorithm (IBCS). First of all, a multi-objective and multi-constraint mathematical model of course scheduling is established. Course scheduling involves issues, such as allocating teachers, courses, classes, classrooms and time under specific constraints. The class element is defined to represent the class and the course that the teachers will teach. Therefore, the problem of course scheduling is transformed into the process of mapping from the class element to the classroom-time pair. Six hard constraints and three soft constraints are also defined accordingly. Then, the BCS algorithm is used to search the best course scheduling scheme in the binary-encoded solution space. In order to control the convergence rate effectively and avoid falling into the local optimum, a dynamically adjustable, equilibrium coefficient is introduced. Therefore, the algorithm retains the diversity of the solutions while converging. Finally, this research study constructs the data set and carries out the simulation experiment. It also compares the IBCS algorithm in this paper with the genetic algorithm and the standard binary cuckoo search algorithm (BCS). Experimental results show that the IBCS algorithm can converge in effective time. Meanwhile, it can achieve an improved global scheduling scheme with higher stability.

     

An optimized image watermarking algorithm based on SVD and IWT

The Journal of Supercomputing - With the wide spread of image information, it is an urgent problem to protect image property rights and crack down on piracy. Watermarking algorithm is an effective...     

Internet视频监控系统网络接口设计

为设计基于Internet技术的视频监控系统,采用了PHILIPS-ARM芯片的最新内核Cotex-M3,以LPC1768处理器为核心,DP83848为以太网物理层收发器,实现了两个不同内网间穿越Symmetric型NAT网关通信;实验表明,该硬件设计为上层协议栈等软件提供了良好的支持,具有良好的稳定性和可靠性,实验效果好,满足设计要求;文中在给出了硬件设计方案的同时,着重介绍嵌入式设备接入网络的底层设计方法,并描述了软件设计过程。     

浅谈高校单片机的教学方法

根据高等教育的目标及高校学生的特征,开展单片机的教学活动,实践证明,在教学过程中选取优质项目、合理应用单片机仿真软件等的教学方法能够使得学生更好的掌握单片机软硬件知识。     

比较教学法在操作系统教学中的应用与实践

针对操作系统课程相似概念难懂、易混淆所造成知识点之间产生负迁移的问题,本文提出将位于不同层次、不同模块的相似知识点放在一起进行比较的教学方法。从课程教学内容中选择出涉及系统功能、设计技术、存储资源管理、安全保护和硬件支持等五个方面的典型相似概念、算法和技术,结合讨论式和启发式等多种教学方式,分辨其异同,分析其联系,使学生从整体上把握操作系统的结构原理和设计技术,教学实践表明其教学效果很好。     

Self-adaptive and dynamic clustering for online anomaly detection

As recent Internet threats are evolving more rapidly than ever before, one of the major challenges in designing an intrusion detection system is to provide early and accurate detection of emerging threats. In this study, a novel framework is developed for fully unsupervised training and online anomaly detection. The framework is designed so that an initial model is constructed and then it gradually evolves according to the current state of online data without any human intervention. In the framework, a self-organizing map (SOM) that is seamlessly combined with K-means clustering is transformed into an adaptive and dynamic algorithm suitable for real-time processing. The performance of the proposed approach is evaluated through experiments using the well-known KDD Cup 1999 data set and further experiments using the honeypot data recently collected from Kyoto University. It is shown that the proposed approach can significantly increase the detection rate while the false alarm rate remains low. In particular, it is capable of detecting new types of attacks at the earliest possible time.     

巧用Access实现一种条形码可自动生成的录取通知书打印报表

将一种条形码技术,结合Access数据库报表,实现一个条形码可自动生成,且具有自动套打功能的录取通知书打印报表,解决了在招生结束后短时间内完成录取通知书的制作工作,在新生报到时,工作人员只需使用扫瞄器读取通知书上的条形码信息就能迅速准确定位到学生,大幅提高了迎新的效率和准确性。     

Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms

We show that biogeography-based optimization (BBO) is a generalization of a genetic algorithm with global uniform recombination (GA/GUR). Based on the common features of BBO and GA/GUR, we use a previously-derived BBO Markov model to obtain a GA/GUR Markov model. One BBO characteristic which makes it distinctive from GA/GUR is its migration mechanism, which affects selection pressure (i.e., the probability of retaining certain features in the population from one generation to the next). We compare the BBO and GA/GUR algorithms using results from analytical Markov models and continuous optimization benchmark problems. We show that the unique selection pressure provided by BBO generally results in better optimization results for a set of standard benchmark problems. We also present comparisons between BBO and GA/GUR for combinatorial optimization problems, include the traveling salesman, the graph coloring, and the bin packing problems.     

一种智能家居远程控制系统的硬件设计

设计智能的可远程控制的家居控制系统,采用STC89C51RC、STC89C58RD和STC2052AD作为微控制器,通过nRF24L01提供的2.4 GHz无线连接,实现各部分之间的通信,以智能化控制家用电器,并通过TC35提供的SMS接口,实现了通过移动终端远程控制家里电器的功能.     

基于小波变换的广东省年降水量序列多时间尺度分析

采用Morlet小波分析广东省内26个气象站1958-2010年的年降水量周期变化得出,第一主周期为4a,第二主周期为12 a,第三主周期为7a;依据第一、第二主周期的变化趋势,预测2011-2012年、2011-2016年为年降水偏少期;通过实测数据验证得出,2011年广东省年降水量较多年平均值减小17.5％,显示小波周期分析结果具有一定合理性.