计算机信息技术课程教学质量保证体系的建立与实践

为提高教学质量,借鉴ISO9000企业贯标与认证的思想,根据教育部相关指导文件的要求,建立了计算机信息技术课程教学质量保证体系,并依据该体系的要求,在课程的教材、题库、教学手段和方法以及考试方式等方面加强了建设与改进。     

非缘身认知科学的计算表征范式——基于学科基础和范式建构的考察与分析

非缘身认知科学计算表征范式是哲学认识论的当代延续,它有其间接和直接的哲学渊源。从学科基础来看,形式逻辑学、人工智能、认知心理学、生成语言学和神经科学等学科用经验研究方法为非缘身认知科学建构化提供了计算表征思想,从而使认知科学在建制化下形成心智数字计算主义表征和心智联结主义计算表征研究范式。这些研究范式在拓展科学哲学研究空间,为哲学进行跨学科研究提供发展机遇等方面具有重要认知意义作用。     

计算机绘图课程教学实践及创新建议

针对计算机绘图课程学时少内容多的矛盾 ,按照大纲要求 ,在教学中注重调整教材结构 ,改进教学方法 ,强化实际操作 ,增加实例训练 ,优化学时分配 ,培养学生动手能力 ,提高教学质量 ,对教学内容及教学方法提出合理化建议     

基于学科竞赛平台的文化创意设计人才培养——以中国大学生计算机设计大赛为例

当今社会,艺术繁荣与经济发展的直接联系集中体现在文化创意产业的兴起,这是一种强调主体文化或文化因素依靠个人（团队）通过技术、创意和产业化的方式开发、营销知识产权的行业。指导文化创意设计专业学生参加中国大学生计算机设计大赛的经历,对培养适应我国经济社会发展需要的新时期文化创意设计人才的实践探索提供了帮助。     

高校《计算机文化基础》课程教学改革探讨

文章结合计算机教学工作中的经验和高校计算机教学中存在的实际问题,通过分析当前高校计算机基础教育面临的形势和《计算机文化基础》课程教学中存在的问题,提出了《计算机文化基础》课程教学改革的思路。     

WINDOWS系统的维护技术概述

介绍了瑞星杀毒软件在实际应用中遇到问题的一些解决方法。说明了使用GHOST技术进行操作系统的备份和快速恢复的操作步骤与方法,指出运用WINDOWS维护技术可以延长操作系统的维护周期,提高工作效率。     

计算机编目查重浅析

论述了查重在图书编目中的重要作用,本文结合工作实践,举例说明在计算机编目中利用题名、责任者、ISBN号、主题词进行查重的优缺点及改进的方法。     

A SIMULATION OF THE EFFECTS OF ALTERNATIVE RULE SYSTEMS FOR JAI ALAI*

The inequities of the present system of rules in jai alai are documented on the basis of empirical information and theoretical results from a Monte Carlo simulation model. Some suggestions are made for changing the rules in order to make the game more equitable for both players and bettors. The simulation model is used to compare the effectiveness of the suggested rules with that of the present rules.     

Exact and heuristic algorithms for solving the generalized minimum filter placement problem

We consider a problem of placing route-based filters in a communication network to limit the number of forged address attacks to a prescribed level. Nodes in the network communicate by exchanging packets along arcs, and the originating node embeds the origin and destination addresses within each packet that it sends. In the absence of a validation mechanism, one node can send packets to another node using a forged origin address to launch an attack against that node. Route-based filters can be established at various nodes on the communication network to protect against these attacks. A route-based filter examines each packet arriving at a node, and determines whether or not the origin address could be legitimate, based on the arc on which the packet arrives, the routing information, and possibly the destination. The problem we consider seeks to find a minimum cardinality subset of nodes to filter so that the prescribed level of security is achieved. We formulate a mixed-integer programming model for the problem and derive valid inequalities for this model by identifying polynomially-solvable subgraphs of the communication network. We also present three heuristics for solving the filter placement problem and evaluate their performance against the optimal solution provided by the mixed-integer programming model. The authors gratefully acknowledge the comments of two anonymous referees, whose input led to an improved version of this paper. Dr. Smith gratefully acknowledges the support of the Office of Naval Research under Grant #N00014-03-1-0510 and the Defense Advanced Research Projects Agency under Grant #N66001-01-1-8925.