COURSE TIMETABLING AT A TUNISIAN UNIVERSITY： A CASE STUDY

This paper deals with the Course Timetabling Problem at an institution in a Tunisian University. We introduce a heuristic procedure to construct a feasible timetable for all lectures and tutorials taken by different groups of each sub-section of any section. We describe the timetabling problem using a list of all specific hard and soft constraints. We formulate the problem as a set of linear constraints using two sets of binary variables corresponding to lectures and tutorials, respectively. This heuristic is illustrated with real data for a sub-section of the Faculty of Economics and Management Sciences of Sfax in Tunisia, and the resulting timetables are compared with those generated manually. The results of another full section have confirmed the good quality of the proposed heuristic when compared with the hand made solution.     

关于Poisson方程的双三次正交样条配置的快速直接求解

对矩形城上的Ｐｏｉｓｓｏｎ方程，利用双三次正交作条配置，给出了结果线代数方程组的快速直接求解方法．对区域的Ｎ×Ｎ一致分划，使用矩阵分解技术，本文方法的计算量为Ｏ（Ｎ２ｌｏｇＮ），并且易于并行实现．处理过程可推广到更一般的椭圆问题．     

混沌交织器的实现

Turbo码以其优异的纠错性能已成为当前正在开发的第三代移动通信系统的物理层关键技术标准 ,其中交织器的设计对Turbo码系统性能产生重要影响。从实际应用出发 ,在数字混沌序列定点生成方法的基础上 ,结合混沌交织器设计原理 ,提出了混沌交织器的实现算法和两种硬件实现方案。该技术实现方案对将混沌交织技术应用于未来数字通信系统具有重要的现实意义