Machine gaming in Sydney clubs: characteristics of the supporting resident populations

This research provided background for surveys and interviews in later stages of a 3 part project. It aimed to identify, from secondary research, sociodemographic characteristics which tend to support registered clubs and their machine gaming activities in the Sydney Statistical Division. Using multiple methods including Pearson's Product Moment correlation, Principal Components factor analysis, and stepwise regression, the study profiled Sydney populations which spend highly on gaming machines. The most important sociodemographic predictors of Sydney statistical local areas where per capita gaming machine expenditure is high are large proportions of the adult resident population who were born in Malta, Greece, Lebanon, China, Italy, Vietnam, Yugoslavia, India or the Philippines; have no vocational or tertiary qualifications; or are unemployed.     

Semi-online scheduling with “end of sequence” information

We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing time. Moreover, the last job is marked, and thus it is known for every new job whether it is the final job of the sequence. We explore this model on two uniformly related machines, that is, two machines with possibly different speeds. Two objectives are considered, maximizing the minimum completion time and minimizing the maximum completion time (makespan). Let s be the speed ratio between the two machines, we consider the competitive ratios which are possible to achieve for the two problems as functions of s. We present algorithms for different values of s and lower bounds on the competitive ratio. The proposed algorithms are best possible for a wide range of values of s. For the overall competitive ratio, we show tight bounds of ϕ + 1 ≈ 2.618 for the first problem, and upper and lower bounds of 1.5 and 1.46557 for the second problem. The authors would like to dedicate this paper to the memory of our colleague and friend Yong He who passed away in August 2005 after struggling with illness. D. Ye: Research was supported in part by NSFC (10601048).     

基于柔性资源约束的前摄性项目调度优化研究

不确定环境中，项目进度计划鲁棒性的高低直接影响项目能否顺利实施。本文研究了具有随机活动工期的柔性资源约束下的前摄性项目调度优化问题，目标是在柔性资源和项目工期的约束下，借助对活动开始时间合理的进行安排进而得到拥有最大鲁棒性的进度计划。首先对研究问题进行界定；随后构建优化模型，并根据问题NP-hard属性和模型特点设计了双层嵌套禁忌搜索启发式算法，通过内外两层交互搜索寻找满意解；最后通过一个实际案例对本文研究进行说明，并分析关键参数对进度计划鲁棒性的影响，得到如下结论：相对于资源无柔性情况下的项目进度计划而言，资源具备柔性后得到的项目进度计划的鲁棒性更高，具有更强的抗干扰能力，能够保证项目稳定执行；同时，项目进度计划鲁棒性分别随着项目工期的延长、资源可用量的增加或资源柔性的提高而上升。     

基于浊度检测的洗衣机废水自动回收装置的设计

为回收再利用洗衣机在洗涤过程中所排的废水，设计了洗衣机废水自动回收装置，装置由浊度传感器、液位开关、水用电磁阀、潜水泵、水箱等构成。该装置可自动识别废水污浊程度，从而决定是否回收储存起来。经简易处理的回收废水类似于q-水，可用于马桶及地面的冲洗，这对于水资源的节约利用、绿色住宅建筑设施设计具有一定的参考意义，同时也具有一定的经济效益。     

再生核支持向量机在非线性系统中的应用

为了提高非线性系统辨识的精度,提出用Walsh函数作为空间V0的尺度函数,构造出L2(R)空间的正交规范序列。结合小波多分辨分析,将Hilbert空间分为一系列子空间,并由可分Hilbert空间与L2(R)的等价性,利用内积同构的线性算子,可以把V0子空间的尺度函数折算为Hilbert空间的子空间V0的尺度函数,构造出新的Walsh序列再生核。通过仿真实验,与传统的RBF核函数、高斯核函数等比较,该尺度再生核函数具有更高的辨识精度,较少支持向量数目,充分体现了支持向量机较好的推广性能。     

浅谈机械制造工艺学之教学

机械制造工艺学课是机械类专业的专业基础课,具有较强的实践性。教师应根据这门课的特点和要求,钻研教材内容,合理安排教学,激发学生的学习积极性,提高教学质量。     

求解作业车间调度问题的一种自适应遗传算法

针对作业车间调度问题,提出了最小化空闲时间的处理过程及其变异算子,设计了一种自适应遗传算法.该算法根据个体的特征确定交叉和变异次数,并根据种群特征不断修正种群.经典的调度基准问题测试表明:自适应措施能够有效保持种群的多样性,可以采用非常小的种群规模;最小化空闲时间的变异算子缩小了算法的搜索空间,大大提高了搜索效率.     

具有超前或延误损失的单机排序问题

在变换条件下对于JIT准时生产制排序问题中的一种特殊情况──排序问题中只含超前损失和延误损失，得到最优序列的一些条件。     

QA95—630型钢坯剪切机焊接机身的有限元分析

建立了ＱＡ９５－６３０型钢坯剪切机焊接机身的力学模型，利用有限元分析软件Ｓｕｐｅｒ－ＳＡＰ对机身进行网格划分和有限元分析，输出应力数表、位移数表、等应力线图和等位移线图等结果，以帮助设计人员对机身进行校核、改进或重新设计。     

一种非周期软实时系统的缓冲设计方法

研究了任务的到达时间和执行时间均不确定的非周期软实时系统,采用排队论的分析方法,非周期软实时系统被看成是典型的随机离散事件动态系统,并被模型化为一个M/M/1/H混合制排队系统,讨论了抛弃率、截止时间错过率和平均截止时间超过量等三种性能指标,并在此基础上进行了缓冲容量的最优设计。性能分析表明缓冲设计方法能有效地改善系统的性能。