他山之石可以攻玉——从美国普渡大学计算机技术系职业技术教育谈起

本文介绍了美国普渡大学计算机职业技术教育教学计划、从事职教的计算机技术系的任务,由此分析了国内高职院校计算机专科办学的教学计划及办学的方向性问题,提出了几点建议。

新疆财经学院计算机科学与技术系

计算机科学与技术系（简称计算机系）成立于2000年底，2001年开始招收计算机科学与技术本科学生，在短短的5年间实现了超常规、跨越式的发展，在高质量地完成学科建设、专业与课程建设、师资队伍建设等阶段性任务的同时，在教学、科研和再项工作中取得了可喜的成绩。

计算机信息技术在图书馆管理中的应用

随着信息技术在生产生活各个领域的广泛运用,在图书馆中当前信息技术也得到了广泛地运用。图书馆在管理工作中也深刻地认识到,提升图书馆信息化管理水平,将是新时期图书馆发展的重要方向。从这个背景来说,要想提升图书馆的服务管理水平,就要着重研究信息技术在图书馆中的应用,这样将计算机信息技术在图书馆管理中的价值作用充分地发挥出来。

漫谈智能建筑若干问题——清华大学计算机科学与技术系张公忠教授访谈

清华大学计算机科学与技术系张公忠教授是中国建筑业协会智能建筑专业委员会专家工作组副主任。张教授曾承担过许多国家级重大科技攻关项目的研制工作，获得过国家科技进步奖和多次部委级奖励，还荣获过国务院三委一部联合表扬奖状，近四。

创建生态学校 打造文明校园——云南省玉溪工业财贸学校生态文明教育纪实

云南省玉溪工业财贸学校创办于1978年,经过30多年的发展,已发展成为培养财经类和工科类的高素质技能型人才的国家级重点中等职业学校。学校占地面积407亩,在校生达10000人,教职工600余人。学校下设机电技术系、财经系、计算机技术系、汽车技术系、数控技术系和建筑与生物工程系6个教学系,开设6大专业群40多个专业。一直以来,学校将生态文明教育作为一项常规性的工作来抓。2012年学校就成立了由校长任组长,

Adaptive XML to relational mapping: an integrated approach

Storing and querying XML (eXtensible Markup Language) data in relational form can exploit various services offered by modern relational database management systems (RDBMSs). Due to structural complexity of XML, there are many equivalent relational mapping schemes for the same XML data and queries. In this paper, we propose the adaptive XML to relational mapping (AX2RM) system, which considers finding optimal XML to relational (X2R) mapping as four separate but correlated procedures: logical database design, data scale estimation, workload transformation, and physical database design. We view the whole process as an autonomic computing problem and formalize the adaptive X2R mapping problem. Search spaces for each procedure are investigated individually, and five approaches for finding the optimal mapping are studied. We propose an integrated approach with greedy pruning (IT-GP), which views the mapping procedures as a whole and exploits heuristic rules in each procedure to prune impossible mappings as early as possible. Evaluation of these approaches shows the validity and high efficiency of IT-GP.

A Fault Detection and Isolation Scheme Based on Parity Space Method for Discrete Time-delay System

A Fault detection and isolation(FDI)scheme for discrete time-delay system is proposed in this paper,which can not only detect but also isolate the faults.A time delay operator is introduced to resolve the problem brought by the time-delay system.The design and computation for the FDI system is carried by computer math tool Maple,which can easily deal with the symbolic computation.Residuals in the form of parity space can be deduced from the recursion of the system equations.Further more,a generalized residual set is created using the freedom of the parity space redundancy.Thus,both fault detection and fault isolation have been accomplished.The proposed method has been verified by a numerical example.

A Co-Point Mapping-Based Approach to Drivable Area Detection for Self-Driving Cars

The randomness and complexity of urban traffic scenes make it a difficult task for self-driving cars to detect drivable areas, Inspired by human driving behaviors, we propose a novel method of drivable area detection for self-driving cars based on fusing pixel information from a monocular camera with spatial information from a light detection and ranging （LIDAR） scanner, Similar to the bijection of collineation, a new concept called co-point mapping, which is a bijection that maps points from the LIDAR scanner to points on the edge of the image segmentation, is introduced in the proposed method, Our method posi- tions candidate drivable areas through self-learning models based on the initial drivable areas that are obtained by fusing obstacle information with superpixels, In addition, a fusion of four features is applied in order to achieve a more robust performance, In particular, a feature called drivable degree （DD） is pro- posed to characterize the drivable degree of the LIDAR points, After the initial drivable area is characterized by the features obtained through self-learning, a Bayesian framework is utilized to calculate the final probability map of the drivable area, Our approach introduces no common hypothesis and requires no training steps; yet it yields a state-of-art performance when tested on the ROAD-KITTI benchmark, Experimental results demonstrate that the proposed method is a general and efficient approach for detecting drivable area,

A Secure Trust Model for P2P Systems Based on Trusted Computing

Trust is one of the most important security requirements in the design and implementation of peer-to-peer （P2P） systems. In an environment where peers＇ identity privacy is important, it may conflict with trustworthiness that is based on the knowledge related to the peer＇s identity, while identity privacy is usually achieved by hiding such knowledge. A trust model based on trusted computing （TC） technology was proposed to enhance the identity privacy of peers during the trustworthiness evaluation process between peers from different groups. The simulation results show that, the model can be implemented in an efficient way, and when the degree of anonymity within group （DAWG） is up to 0.6 and the percentage of malicious peers is up to 70%7 the service selection failure rate is less than 0.15.

Topology-aware Overlay Multicast over IP Multicast Networks

Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.

A 4TH ORDER FULLY INTEGRATED ACTIVE RC COMPLEX FILTER WITH NOVEL AUTOMATIC TUNING SYSTEMS

This letter introduces a 4th order active RC complex filter with 1.SMHz center frequency and 1MHz bandwidth. The total harmonic distortion of the filter is less than -60dB and the image rejection ratio is greater than 60dB. A novel technique is also proposed in this letter to automatically adjust the variation of the time constant. The advantages of the proposed method are its high precision and simplicity. Using 5bits control words, the tuning error is less than ±1.6%.

Minimizing of the only-insertion insdel systems

A more recent branch of natural computing is DNA computing. At the theoretical level, DNA computing is powerful. This is due to the fact that DNA structure and processing suggest a series of new data structures and operations, and to the fact of the massive parallelism. The insertion-deletion system （insdel system） is a DNA computing model based on two genetic operations： insertion and deletion which, working together, are very powerful, leading to characterizations of recursively enumerable lan- guages. When designing an insdel computer, it is natural to try to keep the underlying model as simple as possible. One idea is to use either only insertion operations or only deletion operations. By helping with a weak coding and a morphism, the family INS4^7DEL0^0 is equal to the family of recursively enumerable languages. It is an open problem proposed by Martin-Vide et al. on whether or not the parameters 4 and 7 appearing here can be replaced by smaller numbers. In this paper, our positive answer to this question is that INS2^4DEL0^0 can also play the same role as insertion and deletion. We suppose that the INS2^4DEL0^0 may be the least only-insertion insdel system in this situation. We will give some reasons supporting this conjecture in our paper.

Multiagent reinforcement learning through merging individually learned value functions

In cooperative multiagent systems, to learn the optimal policies of multiagents is very difficult. As the numbers of states and actions increase exponentially with the number of agents, their action policies become more intractable. By learning these value functions, an agent can learn its optimal action policies for a task. If a task can be decomposed into several subtasks and the agents have learned the optimal value functions for each subtask, this knowledge can be helpful for the agents in learning the optimal action policies for the whole task when they are acting simultaneously. When merging the agents’ independently learned optimal value functions, a novel multiagent online reinforcement learning algorithm LU-Q is proposed. By applying a transformation to the individually learned value functions, the constraints on the optimal value functions of each subtask are loosened. In each learning iteration process in algorithm LU-Q, the agents’ joint action set in a state is processed. Some actions of that state are pruned from the available action set according to the defined multiagent value function in LU-Q. As the items of the available action set of each state are reduced gradually in the iteration process of LU-Q, the convergence of the value functions is accelerated. LU-Q’s effectiveness, soundness and convergence are analyzed, and the experimental results show that the learning performance of LU-Q is better than the performance of standard Q learning.

Research on Design Optimization Strategy in Virtual Product Development

Simulation and optimization are the key points of virtual product development (VPD). Traditional engineering simulation software and optimization methods are inadequate to analyze the optimization problems because of its computational inefficiency. A systematic design optimization strategy by using statistical methods and mathematical optimization technologies is proposed. This method extends the design of experiments (DOE) and the simulation metamodel technologies. Metamodels are built to in place of detailed simulation codes based on effectively DOE, and then be linked to optimization routines for fast analysis, or serve as a bridge for integrating simulation software across different domains. A design optimization of composite material structure is used to demonstrate the newly introduced methodology.

A Loosely Coupled Control Architecture Based on Agent and CORBA for Multiple Robots

With the rapid development of information technology, adopting advanced distributed computing technology to construct robot control system is becoming an effective approach gradually. This paper proposes a distributed loosely coupled software architecture based on Agent and CORBA to control multiple robots. This model provides the robot user with agent control units at the semantic level and CORBA provides function interfaces to agent at the syntax level, which shows a good adaptability, flexibility and transparence.

Design and implementation of web fast sharing platform of massive geological map

It is still a laborious work to consult massive multidisciplinary geological maps which are scattered in different geological departments,and hard to give full play to the potential application value of geological map. Along with the network,the development of communication and computer technology,especially with the Web2.0 technology arisen,provides opportunities to the web for sharing of geological maps. Web fast sharing platform of massive geological maps( WSPGM) is based on the Flex technology development,using B/S architecture,with map navigation,search,display,security and other functions of the software system. Through the map pretreatment and asynchronous communication the system can display any size of geological map,and through the range limits,rights management,sharing system and watermark logo to take effective security on geological map. On the basis of this system,with the Jilin University web sharing system of geological map,the system can greatly improve the efficiency of using geological map. for research.