一个基于C/S的考试考场编排MIS的设计与实现

介绍了基于学分制下的考试编排管理信息系统软件的开发与实现，本系统主要实现了两届学生的考场编制，本文重点提出了学生考试时间和考场冲突的处理等几个关键技术的实现。     

基于考场编排的改进分治混洗算法研究

考场编排是日常考试管理和考务工作的一项重要工作。科学、合理、高效的编排考场,对于严肃考风考纪、提升考试的公信度有着十分重要的意义。常用考场编排系统中所采用的分治算法或者混洗算法都不能很好地将同一班级的考生位置有效的分开,直接影响考试的公平性和合理性。通过对分治算法与混洗算法的仔细研究,结合日常考场编排的要求,提出一种将分治算法与混洗算法合而为一的改进考场编排算法,并在等级考试、职业资格考试考场编排中广泛使用,经验证该算法结果稳定可靠。     

一体化摄像机在校园电子监考系统中的选择与应用

考场舞弊现象历朝历代禁而不绝，为保证考试的公平性，维护公平公正公开的人才选拔原则，电子监考产品逐渐应用于考场之上。本文将为您介绍一体化摄像机在考场中的应用。     

考场集中监控暨远程教学示范系统解决方案

近年来考试违纪作弊行为越来越隐蔽化、作弊手段也越来越技术化，为有效打击违纪舞弊行为，各地区将陆续在辖区内全国教育统一考试定点考场建立电视监控系统。本文详细介绍了如何将基于网络的第三代全数字视频监控系统产品，较好地被应用于考场集中监控暨远程教学示范上。     

“办公校园风”之十——巧用Excel排考场

学校组织考试，为了体现公平，常常将同一个年级不同班级的学生打乱编排考场，使得每一位考生前、后、左、右的座位上都不是本班同学。对于为样的考场安排，我们让Excel的函数来帮我们实现。     

考试心态调整

考试是高强度的脑力劳动，体能消耗也较大，所以在考试过程中考生容易出现一些功能性障碍。我们常称这些障碍为“考场病态”。若在考场上已经出现考场病态，这时再去懊悔是没有益处的，只有采取积极措施来消除考场病态的影响。 一、进入考场时的心态调整 当考生听到进入考场的铃声时，难免心理上紧张，所以提前做好准备很关键。物质准备是首要的，这时应再检查一次自己的所有证件及所有用具是否齐全。与物质准备相比，心理准备更为重要。有的考生一迈入考场，就会感到突如其来的紧张。针对这种情况，我们推荐两种应急方法。 １．考场放松法 …     

考场集中监控暨远程教学示范系统解决方案

针对近年来出现的考试违纪作弊行为越来越隐蔽化、作弊手段越来越技术化的现象，为有效打击违纪舞弊行为，杜绝这种丑陋恶习，按国家教委有关文件精神，各地区将陆续在辖区内全国教育统一考试定点考场建立电视监控系统。     

基于Java的考场管理系统的研究与实现

随着我国信息化技术的发展,网络考试在各种培训考试、等级考试、认证考试、专业考试等方面应用都非常广泛,且越来越呈现出其卓越的优越性,各种网上考试系统随之而产生。虽然在线考试系统的开发越来越简单,但是在考试过程中,考场管理系统的作用尤为重要,针对这种情况,本文以此探讨了现有的一些考场管理系统,着重分析了基于Java的考场管理系统,介绍了基于java的考场管理系统是如何通过thrift通信实现对考试过程的控制的,使得监考人员能够直接使用这套系统,同时介绍了基于Java的考场管理系统的开发过程的难点研究,希望借此给开发人员提供相应的经验,提高开发的效率。     

DRM技术在虚拟考场中的应用

虚拟考场是一种实现网络远程教育的必要技术。目前,虚拟考场存在着一系列安全问题,影响到考试的安全性和考试的公正性。为此,本文采用DRM技术解决虚拟考场中考生的身份验证问题和考试数据保密的问题,从而达到提高虚拟考场的公平性、安全性目的。     

电子考场 持网络利剑 踏上整合之路

近年来，随着各种高科技舞弊手段在考试中的层出不穷，电子考场在大大小小考场中逐渐得到普及。而借着网络化东风，电子考场与学校日常安防系统的整合也踏上了高速发展的道路……[编者按]     

基于改进遗传算法的浮法玻璃优化切割

浮法玻璃表面含有多种缺陷,这些缺陷的种类、数量和大小会不同程度影响玻璃质量,进而影响玻璃价格。因此在浮法玻璃优化切割过程中,应合理利用缺陷,优先规划质量较好的玻璃原片,以达到提高玻璃成品总价格的目的。针对浮法玻璃优化切割问题,以玻璃成品总价格最大为优化目标,建立该问题的数学模型,提出了一种符合浮法玻璃优化切割问题特性的遗传算法。以一个算例验证了上述模型的正确性及算法的有效性。     

Systematic planning for digital preservation: evaluating potential strategies and building preservation plans

A number of approaches have been proposed for the problem of digital preservation, and the number of tools offering solutions is steadily increasing. However, the decision making procedures are still largely ad-hoc actions. Especially, the process of selecting the most suitable preservation action tool as one of the key issues in preservation planning has not been sufficiently standardised in practice. The Open Archival Information Systems (OAIS) model and corresponding criteria catalogues for trustworthy repositories specify requirements that such a process should fulfill, but do not provide concrete guidance. This article describes a systematic approach for evaluating potential alternatives for preservation actions and building thoroughly defined, accountable preservation plans for keeping digital content alive over time. In this approach, preservation planners empirically evaluate potential action components in a controlled environment and select the most suitable one with respect to the particular requirements of a given setting. The method follows a variation of utility analysis to support multi-criteria decision making procedures in digital preservation planning. The selection procedure leads to well-documented, well-argued and transparent decisions that can be reproduced and revisited at a later point of time. We describe the context and foundation of the approach, discuss the definition of a preservation plan and describe the components that we consider necessary to constitute a solid and complete preservation plan. We then describe a repeatable workflow for accountable decision making in preservation planning. We analyse and discuss experiences in applying this workflow in case studies. We further set the approach in relation to the OAIS model and show how it supports criteria for trustworthy repositories. Finally, we present a planning tool supporting the workflow and point out directions for future research.     

Evolutionary algorithm for advanced process planning and scheduling in a multi-plant

Integration of process planning and scheduling is one of the most important functions to support flexible planning in a multi-plant. The planning and scheduling are actually interrelated and should be solved simultaneously. In this paper, we propose an advanced process planning and scheduling model for the multi-plant. The objective of the model is to decide the schedules for minimizing makespan and operation sequences with machine selections considering precedence constraints, flexible sequences, and alternative machines. The problem is formulated as a mathematical model, and an evolutionary algorithm is developed to solve the model. Numerous experiments are carried out to demonstrate the efficiency of the proposed approach.     

Hybrid knowledge model of process planning and its green extension

The green process planning model was a necessary research field of the green manufacturing, which has drawn increasing attention from many scholars. This study proposes a multi-method [Backus–Naur Form (BNF) frame, binary tree,production rules, and objective-oriented methodology] hybrid frame model of process planning and reasoning mechanism. In this model, the hierarchical BNF frame was applied to modeling the structure of parts, the stages of process decisions and the existing green process indicators set. Then, two “procedure” programs were designed for the information exchange among the above models. This green-process planning model was proposed based on the traditional intelligent process planning model and was intended to introduce an overall (compared with the traditional partial green-process planning model) green-process decision mode. In the last section of this paper, a case study of the green-process planning for a stepped shaft is provided along with a number of essential knowledge models to illustrate the feasibility of this hybrid knowledge model.     

A sensor planning system for automated headlamp lens inspection

Usually, the automated systems for quality control based on computer vision have been centered on the design of algorithms for detecting different types of defects. Nevertheless, the issues related to planning suitable sensor poses for the inspection task have received less attention. In addition, the applications where a vision sensor can only sample a portion of a part from a single viewpoint, the sensor planning problem becomes critically important. This is the case of the automated inspection of vehicle headlamp lens, that due to its geometry and dimensions, requires multiple sensor poses to observe the whole part. Moreover, the customer requirements that define the maximum defect size should also be taken into account in the inspection process.This paper presents a vision sensor planning system applied to the quality control of headlamp lenses. The system uses the lens CAD, a vision sensor model and the customer requirements, included through a fuzzy approach, to achieve an optimal set of viewpoints. To compute the number and distribution of the viewpoints, a genetic algorithm is used. Experimental results demonstrate the effectiveness of the sensor planning system on commercial lenses.     

Conflict resolution in collaborative planning dialogs

In a collaborative planning environment in which the agents are autonomous and heterogeneous, it is inevitable that discrepancies in the agents' beliefs result in conflicts during the planning process. In such cases, it is important that the agents engage in collaborative negotiation to resolve the detected conflicts in order to determine what should constitute their shared plan of actions and shared beliefs. This paper presents a plan-based model for conflict detection and resolution in collaborative planning dialogs. Our model specifies how a collaborative system should detect conflicts that arise between the system and its user during the planning process. If the detected conflicts warrant resolution, our model initiates collaborative negotiation in an attempt to resolve the conflicts in the agent's beliefs. In addition, when multiple conflicts arise, our model identifies and addresses the most effective aspect in its pursuit of conflict resolution. Furthermore, by capturing the collaborative planning process in a recursive Propose–Evaluate–Modify cycle of actions, our model is capable of handling embedded negotiation during conflict resolution.     

Power-form demand and cost functions in inventory lot size models

This paper presents a continuous-time inventory model with known time-varying demand and carrying cost functions. Backlogs are prohibited, replenishments are assumed to be instantaneous and the planning horizon is finite. The problem is to find the optimal number and schedule of replenishments, i.e. the time intervals between consecutive orders, which minimizes total carrying and replenishment costs throughout the planning horizon.First, a necessary and sufficient condition on the optimal replenishment times is derived for general demand and carrying cost functions when the number of replenishments is fixed. Then, a complete solution (optimal number and schedule of replenishments) is given for the case of power-form demand and carrying cost functions. The asymptotic properties of the solution as the planning horizon tends to infinity are also investigated. The model lends itself to a tractable parametric analysis, and generalizes several special cases already known in the literature.     

Hierarchical production planning with flexibility in agroalimentary environment: a case study

In this paper we address to the planning problem in the agroalimentary domain. In such industry, several specific constraints should be taken into account for planning task such as the constraints of interdependencies between the products and variable production modes. Furthermore, we present the relationship between two large fields as the production hierarchical planning and the flexibility. Especially, we show that the flexibility planning should be made a priori and then integrated in the hierarchical planning process. Indeed, we have established a mathematical model according to different production levels. While taking into account real capacities of the shop and the interdependencies between the products, the results of our formulation are satisfactory in terms of quality of solution and time requirements. It??s shown that our model is able to reach all optimal solutions for all treated models and for all system levels.