Personalised news filtering and recommendation system using Chi-square statistics-based K-nearest neighbour (χ2SB-KNN) model

Recommendation problem has been extensively studied by researchers in the field of data mining, database and information retrieval. This study presents the design and realisation of an automated, personalised news recommendations system based on Chi-square statistics-based K-nearest neighbour (χ²SB-KNN) model. The proposed χ²SB-KNN model has the potential to overcome computational complexity and information overloading problems, reduces runtime and speeds up execution process through the use of critical value of χ² distribution. The proposed recommendation engine can alleviate scalability challenges through combined online pattern discovery and pattern matching for real-time recommendations. This work also showcases the development of a novel method of feature selection referred to as Data Discretisation-Based feature selection method. This is used for selecting the best features for the proposed χ²SB-KNN algorithm at the preprocessing stage of the classification procedures. The implementation of the proposed χ²SB-KNN model is achieved through the use of a developed in-house Java program on an experimental website called OUC newsreaders’ website. Finally, we compared the performance of our system with two baseline methods which are traditional Euclidean distance K-nearest neighbour and Naive Bayesian techniques. The result shows a significant improvement of our method over the baseline methods studied.     

A new when-to-schedule policy in online scheduling based on cumulative task delays

This paper proposes a new when-to-schedule policy in online scheduling, which considers timing of rescheduling based on the concept of a control limit policy and rolling schedules. Under the proposed policy, rescheduling is carried out based on a cumulative delay which can be a measure to determine suitable timing of rescheduling. Some computational experiments demonstrate the effectiveness of the proposed policy by applying it to single-machine dynamic scheduling with sequence-dependent setup times and urgent jobs, where total setups are minimized as well as rescheduling frequency. It is also demonstrated that the proposed policy can outperform typical rescheduling policies.     

A secure,real-time stock market protocol

Stock markets constitute the largest electronic commerce market in the world. The tremendous growth in trading volume and the need for fast and accurate transaction execution has made the stock market one of the most technology friendly markets. The fastest growing stock exchange, NASDAQ, is a wholly electronic stock exchange with all transactions conducted over computer networks. However, the transaction model used by NASDAQ and other electronic stock markets still borrows heavily from the older traditional models used by non-electronic stock exchanges. Two important requirements of modern day stock market transactions are: (a) customer's ability to place sophisticated transaction orders to buy/sell stock, and (b) customer's ability to detect transaction delays. Modern electronic stock exchanges lack both the ability to place newer, more sophisticated transaction orders and the ability to detect delays in transaction execution. In this paper, we propose a protocol for stock market transaction that can model a new sophisticated model for transaction orders while continuing to support traditional transaction orders. The protocol is augmented with a mechanism to detect delays in transaction execution. It is further shown that the protocol proposed is secure, atomic, anonymous, private, and incurs low overhead costs. This revised version was published online in June 2006 with corrections to the Cover Date.     

Railway crew capacity planning problem with connectivity of schedules

We study a tactical level crew capacity planning problem in railways which determines the minimum required crew size in a region while both feasibility and connectivity of schedules are maintained. We present alternative mathematical formulations which depend on network representations of the problem. A path-based formulation in the form of a set-covering problem along with a column-and-row generation algorithm is proposed. An arc-based formulation of the problem is solved with a commercial linear programming solver. The computational study illustrates the effect of schedule connectivity on crew capacity decisions and shows that arc-based formulation is a viable approach.     

Analyzing a quantitative coordination relationship

Coordination is a crucial behavior in cooperative distributed problem solving (CDPS). Analyzing coordination requires an understanding of the interplay between the agents, their problem, and their environment. The core behaviors ofdistributed coordination in CDPS systems are the coherent specification and scheduling of tasks over the set of distributed agents working on sets of interrelated problems. The complexity of, and uncertainty about, the problem interrelationships make distributed task coordination difficult. This article describes a causal model of this process that links the interrelationships, calledcoordination relationships, to the local scheduling constraints of distributed agents. Besides coordination relationships, environmental uncertainty and the lack of infinite computational resources also make distributed coordination difficult.It is not only the presence or absence of a coordination relationship that is important, but its quantitative properties: how likely is it to appear, how significant is its effect, and so on. These aspects determine the usefulness of a particular coordination relationship in the context defined by an environment, a problem to be solved, and an agent architecture. This article discusses the analysis of coordination relationships, using as an example our abstract model for thefacilitates relationship. We detail the derivation and assumptions of this model and apply it to the design of a generalized coordination module that is separate from, and interfaces cleanly with, the local scheduler of a CDPS agent. A set of simulation experiments is described that test our assumptions and design process in the coordination of a group of real-time problem-solving agents.     

精益视角下的卷烟生产调度系统优化

笔者根据从事卷烟厂生产调度的理论学习和具体实践出发,对生产调度工作进行了概括归纳,提出了生产调度系统的五大构成要素。并运用精益生产管理理念对目前烟草行业生产调度存在的问题、难题进行了剖析,同时提出了卷烟生产企业优化生产调度系统的具体策略和建议。     

基于卡尔曼滤波的运动员实时跟踪系统研究

应用计算机技术，并采用预处理算法和跟踪算法可建立基于卡尔曼滤波的运动员实时跟踪系统，用于实时分割、跟踪球场中运动着的运动员，得到其在运动场景中的各项运动参数，并进行技战术统计和分析，为教练员和运动员制定正确的运动技术方案提供决策依据。     

电网事故处理过程中的调度应急反应

文章根据一起由开关拒动引起越级跳闸的母线失压事故,分析了调度事故处理的思路、步骤及注意事项。指出调度员要对电网的整个运行状况非常熟悉,同时要掌握一定的继电保护知识作为事故判断和处理的依据,事故处理过程要做到全面、清晰、快速、准确。     

嵌入式测温系统在散粮筒仓输送系统中的开发及应用

本文介绍了嵌入式测温系统在散粮筒仓系统温度检测上的技术原理，并就如何在老港区现有散粮输送设备进行温度检测，提出了应用方案。     

EXAM SCHEDULING AND STUDENT PERFORMANCE

This paper uses data from a single School of a UK university to estimate the impact of a switch from end‐of‐semester to end‐of‐year final exams on student performance. The identification strategy exploits the fact that while the timing of final exams changed, the timing of mid‐term exams remained the same. Estimates are based on a difference‐in‐differences methodology that compares final and mid‐term exam scores after the switch, with final and mid‐term exam scores before the switch. The empirical findings suggest that the shift of final exams to the end of the academic year had a negative effect on student achievement. Many changes in higher education are often done on the basis of financial, administrative or ideological considerations, underestimating the magnitude of their effect on student learning and student performance.