刘邦施行过楚爵制己有实证

刘邦施行过楚爵制己有实证朱绍侯二十级军功爵制是秦汉政权共行的爵位制度。《汉书》卷十九《百官公卿表》有明确的记载：“爵一级曰公士、二上造、三簪、四不更、五大夫、六官大夫、七公大夫、八公乘、九五大夫、十左庶长、十一右庶长、十二左更、十三中更、十四右更、十...     

塑料注射机节能问题的研究与探讨

本文针对 XS—ZY—125型塑料注射成型机,分析了现行通用的双联泵供油液压系统耗能大的原因。介绍了压力流量补偿负荷传感液压系统在注射机上应用的基本原理。通过应用上述两种液压系统分别驱动同一台注射机的生产运行对比试验和能耗测试分析,证明压力流量补偿负荷传感液压系统具有十分显著的节能效果。通过经济效益估算分析,指出进一步开发压力流量补偿负荷传感液压系统在注射机上的应用,不仅具有十分显著的经济效益,而且具有很大的社会效益。     

A Tighter Extra-Resource Analysis of Online Deadline Scheduling

This paper is concerned with online algorithms for scheduling jobs with deadlines on a single processor. It has been known for long that unless the system is underloaded, no online scheduling algorithm can be 1-competitive, i.e., matching the performance of the optimal offline algorithm. Nevertheless, recent work has revealed that some online algorithms using a moderately faster processor (or extra processors) can guarantee very competitive performance Kalyanasundaram and Pruhs, 2000 or even be 1-competitive Koo et al., 2002; Lam and To, 2001. This paper takes a further step to investigate online scheduling algorithms with an even higher performance guarantee (i.e., better than 1-competitive algorithms) and in particular, presents an extra-resource analysis of the earliest-deadline-first strategy (EDF) with respect to such a higher performance guarantee.A preliminary version of this paper has been accepted by The Australian Theory Symposium on Computing, 2004.This research was supported in part by Hong Kong RGC Grant HKU-7024/01E.     

基于SVM的Web日志挖掘及潜在客户发现

潜在的客户资源是商家未来的利润来源,发现了潜在的客户就可以制定相应的商业决策,并进行有针对性的客户关系管理。使用SVM方法对Web日志文件进行挖掘,以发现站点访问者中潜在客户的共同行为模式,并将其分为不同级别的目标客户群。同时,通过试验4种不同比例的训练样本,研究了非对称数据对分类结果的影响,以期获得较优的模型。     

Scheduling Truck Arrivals at an Air Cargo Terminal

We consider the scheduling of truck arrivals at an air cargo terminal. By coordinating arrivals of cargo delivery trucks with outbound flight departure schedules, some of the shipments can be transferred directly to the departing flights, while others will be stored at the terminal's storage facility and incur extra handling and storage costs. The objective is to obtain a feasible schedule so as to minimize the total cost of operations. We formulate the problem as a time‐indexed integer program and show that, even with limited number of unloading docks at the terminal, the problem is non‐trivial (NP‐hard in the strong sense). Our solution method includes an exact solution procedure to determine an optimal unloading sequence for the shipments carried by each truck, together with a Lagrangian relaxation‐based heuristic for assigning trucks to truck docks and determining truck arrival times. We conducted computational experiments to test the performance of our solution method. Computational results show that our method can generate near‐optimal solutions efficiently. Our simulation results indicate that the scheduling approach proposed in this paper has the potential to generate significant cost savings over a first‐come, first‐served approach currently used at the air cargo terminal that we observed.     

Intelligent Procedures for Intra‐Day Updating of Call Center Agent Schedules

For nearly all call centers, agent schedules are typically created several days or weeks before the time that agents report to work. After schedules are created, call center resource managers receive additional information that can affect forecasted workload and resource availability. In particular, there is significant evidence, both among practitioners and in the research literature, suggesting that actual call arrival volumes early in a scheduling period (typically an individual day or week) can provide valuable information about the call arrival pattern later in the same scheduling period. In this paper, we develop a flexible and powerful heuristic framework for managers to make intra‐day resource adjustment decisions that take into account updated call forecasts, updated agent requirements, existing agent schedules, agents' schedule flexibility, and associated incremental labor costs. We demonstrate the value of this methodology in managing the trade‐off between labor costs and service levels to best meet variable rates of demand for service, using data from an actual call center.     

印刷烫金机走纸控制器的软硬件设计

介绍了印刷烫金机走纸控制器软硬件的设计方案,该控制器选用低栅压导通的功率场效应管作为步进电机驱动,控制CPU采用AVR单片机.控制器具有走纸长度设置、电机启停低速而运行高速、走纸完毕声光提示、设置参数掉电保护等功能.     

The German Administrative Record Census – An object identification problem

Summary: The next German census will be an Administrative Record Census. Data from several administrative registers about persons will be merged. Object identification has to be applied, since no unique identification number exists in the registers. We present a two–step procedure. We briefly discuss questions like correctness and completeness of the Administrative Record Census. Then we focus on the object identification problem, that can be perceived as a special classification problem. Pairs of records are to be classified as matched or not matched. To achieve computational efficiency a preselection technique of pairs is applied. Our approach is illustrated with a database containing a large set of consumer addresses.*This work was partially supported by the Berlin–Brandenburg Graduate School in Distributed Information Systems (DFG grant no. GRK 316). The authors thank Michael Fürnrohr for previewing the paper. We would like to thank also for the helpful comments of an anonymous reviewer.