检索结果-内蒙古大学图书馆

7th International Computing Education Research Workshop, ICER 2011

作者： Boustedt, Jonas Eckerdal, Anna McCartney, Robert Sanders, Kate Thomas, Lynda Zander, Carol Division of Technology and Environment University of Gävle Gävle Sweden Department of Information Technology Uppsala University Uppsala Sweden Department of Computer Science and Engineering University of Connecticut Storrs CT United States Mathematics and Computer Science Department Rhode Island College Providence RI United States Department of Computer Science Aberystwyth University Aberystwyth United Kingdom Computing and Software Systems University of Washington Bothell Bothell WA United States

ISBN: (纸本)9781450308298

Research has shown that most learning in the workplace takes place outside of formal training and, given the swiftly changing nature of the field, computer science graduates more than most workers, need to be able to learn computing topics outside of organized classes. In this paper we discuss students' perceptions of the difference between formal and informal learning of computing topics, based on three datasets: essays collected from a technical writing course at a single university;the results of a brainstorming exercise conducted in the same course;and semi-structured interviews conducted at six institutions in three countries. The students report strengths and weaknesses in informal learning. On the one hand, they are motivated, can choose their level of learning, can be more flexible about how they learn, and often retain the material better. On the other hand, they perceive that they may miss important aspects of a topic, learn in an ad hoc way, and have difficulty assessing their learning. © 2011 ACM.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Assessment and Support for software Capstone Projects at the Undergraduate Level: A Survey and Rubrics

Assessment and Support for Software Capstone Projects at the...

引用

Frontiers of Information Technology (FIT)

作者： Ehsan Ahmad Bilal Raza Robert Feldt School of Computer Science and Technology Northwestern Polytechnical University Xi'an China Blekinge Institute of Technology Sweden Division of Software Engineering Chalmers University of Technology Gothenburg Sweden

software engineering and computer science students conduct a capstone project during the final year of their degree programs. These projects are essential in validating that students have gained required knowledge and they can synthesize and use that knowledge to solve real world problems. However, the external requirements on educational programs often do not provide detailed guidelines for how to conduct or support these capstone projects, which may lead to variations among universities. This paper presents the results from a survey conducted at 19 different Pakistani universities of the current management practices and assessment criteria used for the capstone project courses at Undergraduate level. Based upon the results of this survey and similar work on Master Thesis capstone projects in Sweden, we present assessment rubrics for software-related undergraduate capstone projects. We also present recommendations for the continuous improvement of capstone projects.

关键词： Educational institutions software Industries computer science software engineering Guidelines Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Implementation of stepwise satisfiability checker for reactive system specifications using distributed objects technology

Computer Software

引用

computer software 2011年第4期28卷 262-281页

作者： Ando, Takahiro Miyamoto, Yuuki Hagihara, Shigeki Yonezaki, Naoki National Institute of Advanced Industrial Science and Technology Japan Software Division Hitachi Ltd. Japan Dept. of Computer Science Graduate School of Information Science and Engineering Tokyo Institute of Technology Japan

The realizability is a well known property for reactive system specification, and it shows that there exists a system which reacts properly against any environment following the specification. In system development process, we can reduce reversions if realizability for specification is verified before implementation of system. However, the verification cost is too high to verify the realizability of a real scale system specification. On the other hand, stepwise satisfiability which is a necessary condition for the realizability has been proposed. Its verification cost is less than that of realizability, and verification of the property is useful to find the incompleteness of specification. Even if the verification of stepwise satisfiability, the required cost is too high. In order to overcome this problem, this paper proposes methods of implementing the stepwise satisfiability checker using a distributed object technology on the parallel distributed environment. Then, we implement the stepwise satisfiability checker in Java based on our methods, and confirm the effectiveness of our methods by experiments. In this paper, we present our ideas and methods of the implementations for three parts of our checker. The first is how our checker compose a tableau graph on the parallel distributed environment. The second is the implementation method to determinize the distributed graph. The third is the dead end checking method for the deterministic distributed graph.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

A handwritten character recognition system based on acceleration

A handwritten character recognition system based on accelera...

引用

International Conference on Digital Content, Multimedia Technology and its Applications (IDC)

作者： Chun Yuan Shiqi Zhang Zhao Wang Information Science and Technology Division Graduate School at Shenzhen Tsinghua University Shenzhen China Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China

In this paper, an handwritten character recognition system based on acceleration is presented. The character recognition system using a 3-dimensional (3D) accelerometer, includes three procedures: original signal detection, signal processing (preprocessing and quantization) and recognition/classification. In quantization procedure, Trajectory Orientation (TO) and Curve Feature (CF) are adopted and compared. In recognition procedure, Fully-connected Hidden Markov Model (HMM) and Left-Right HMM are both implemented and compared. The system, in the recognition of 10 Arabic numerals, achieves the Correct Rate(CR) of 99.05% and the Total Correct Rate (TCR) of 94.76%.

关键词： Hidden Markov models Acceleration Accelerometers Feature extraction Character recognition Trajectory Quantization

来源：评论

学校读者我要写书评

暂无评论

Optimizing Energy through Parabola Based Routing in Underwater Sensor Networks

Optimizing Energy through Parabola Based Routing in Underwat...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Sanjay K. Dhurandher Mohammad S. Obaidat Siddharth Goel Abhishek Gupta CAITFS Division of Information Technology Netaji Subhas Institute of Technology University of Delhi New Delhi India Department of Computer Science & Software Engineering Monmouth University NJ USA

This paper looks into the problems faced by Underwater Sensor Networks (UWSNs), with regard to energy optimization and efficient data delivery. A new algorithm is proposed which uses the properties of a "Parabola" in order to transmit data packets from source to destination. The scheme is called the "Parabola-based Routing"(PBR) algorithm. The algorithm is adaptive, and transmits packets in hop-by-hop fashion. Each node in the scenario is aware of its location in the form of its Cartesian coordinates. These coordinates help the nodes in the formation of the parabola for packet sending, as well as in knowing the location of other nodes. The best suited node is selected every time so as to maintain low probability of data transmission failure and optimum energy consumption thereby, using greedy approach every time in selecting the node for packet transmission. In order, to maintain the packet delivery ratio, a hop-by-hop "acknowledgement process" has also been devised. We have validated the efficiency of our algorithm through simulation analysis. The simulation results indicate a better performance of PBR over DSR in both mobile and static scenarios.

关键词： Peer to peer computing Routing Relays Algorithm design and analysis Mobile communication Routing protocols Monitoring

来源：评论

学校读者我要写书评

暂无评论

Message Security in Multi-Path Ad Hoc Networks Using a Neural Network-Based Cipher

Message Security in Multi-Path Ad Hoc Networks Using a Neura...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Che-Yu Liu Isaac Woungang Han-Chieh Chao Sanjay K. Dhurandher Ting-Yun Chi Mohammad S. Obaidat Institute of Computer Science & Information Engineering National I-lan University Taiwan Department of Computer Science Ryerson University Toronto ONT Canada Division of Information Technology Netaji Subhas Institute of Technology University of Delhi India Department of Computer Science and Software Engineering Monmouth University West Long Branch NJ USA

Securing the transfer of data in mobile ad hoc networks (MANETs) is still a challenging issue. This paper proposes a method for providing message security in MANETs when nodes cooperate in routing. Our approach combines a trust-based multipath routing scheme and a real-time recurrent neural network-based (RRNN) cipher (yielding our so-called TR-RRNN scheme) to deal with the issues underlying message confidentiality, integrity, and access control. Simulation experiments using QualNet were conducted, showing that the proposed scheme is much more secured compared to the traditional multi-path routing algorithms and a recently proposed message security scheme for MANETs (our so- called Original Trust-based Multi-path Routing scheme (OTMR)). The route selection time and trust compromise are used as the performance criteria.

关键词： Peer to peer computing Routing Ad hoc networks Mobile computing Routing protocols Encryption

来源：评论

学校读者我要写书评

暂无评论

Automatic Dent-landmark Detection in 3-D CBCT Dental Volumes

Automatic Dent-landmark Detection in 3-D CBCT Dental Volumes

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society

作者： Erkang Cheng Jinwu Chen Jie Yang Huiyang Deng Yi Wu Vasileios Megalooikonomou Bryce Gable Haibin Ling Center for Data Analytics & Biomedical Informatics Computer & Information Science Department Temple University Division of Oral and Maxillofacial Radiology School of Dentistry Temple University College of Computer and Software Nanjing University of Information Science & Technology Data Engineering Laboratory Temple University

ISBN: (纸本)9781424441211

Orthodontic craniometric landmarks provide critical information in oral and maxillofacial imaging diagnosis and treatment planning. The Dent-landmark, defined as the odontoid process of the epistropheus, is one of the key landmarks to construct the midsagittal reference plane. In this paper, we propose a learning-based approach to automatically detect the Dent-landmark in the 3D cone-beam computed tomography (CBCT) dental data. Specifically, a detector is learned using the random forest with sampled context features. Furthermore, we use spacial prior to build a constrained search space other than use the full three dimensional space. The proposed method has been evaluated on a dataset containing 73 CBCT dental volumes and yields promising results.

关键词： Three dimensional displays Training Context Feature extraction Vegetation Dentistry Testing

来源：评论

学校读者我要写书评

暂无评论

Faster rule induction algorithms using rough set theory

Faster rule induction algorithms using rough set theory

引用

IEEE Recent Advances in Intelligent Computational Systems (RAICS)

作者： B K Tripathy K Kumaran M Sumaithri T Swathi D Shobana School of Computer Science & Engineering VIT University vallore Tamilnadu INDIA School of Information Technology & Engineering Vit university Vallore tamilnadu INDIA LAPG Samsung India Software Operation Bangalore Karnataka India LAPG Samsung India Software Operations Bangalore Karnataka INDIA Retail Division Tata Consultancy Services Chennai Tamilnadu INDIA

This paper presents an improved version of a simple rule induction algorithm known as ELEM. Compared to LEM1[5], LEM2[5], the new algorithm, ELEM, is faster as it requires fewer operations in its rule generation process. The results obtained have demonstrated the strong performance of the algorithm. The numerical experimental results demonstrate that the method of rule induction proposed in this paper is feasible. The key idea of this paper is that we compare the performance of LEM1 and ELEM for classification on landslide data sets and show the difference in computation speed and accuracy. And the results obtained are tested using artificial intelligence system. In this paper, we focus on basic concepts and an implementation of our methodology and the comparative results. From the results it is clearly found that ELEM algorithms can also be used incremental and in knowledge-based search process.

关键词： Finite element methods Algorithm design and analysis Approximation methods Educational institutions Set theory Databases Data mining

来源：评论

学校读者我要写书评

暂无评论

Robust L_(2) - L_(infinity) Consensus Control of the Second-order Multi-agent Systems with Time-delay

Robust L_(2) - L_(infinity) Consensus Control of the Second-...

引用

IEEE Conference on Decision and Control

作者： Yan Cui Yingmin Jia Junping Du Fashan Yu Seventh Research Division and the Department of Systems and Control Beihang University Beijing 100191 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo 454000 Henan China

ISBN: (纸本)9781612848006

Robust L_(2) - L_(infinity) consensus control is studied for the second-order multi-agent systems with external disturbances and parameter uncertainties. By defining an appropriate controlled output, the consensus problem of the systems is transformed into a normal L_(2) - L_(infinity) control problem, and distributed state feedback protocols with time-delay are proposed. Sufficient conditions are established for the convergence to consensus of the network under fixed or switching topology. Numerical simulations are provided to demonstrate the effectiveness of our theoretical results.

关键词： Topology Europe

来源：评论

学校读者我要写书评

暂无评论

Collision Avoidance Maneuver Design Based on Equidistance Interpolation

Collision Avoidance Maneuver Design Based on Equidistance In...

引用

IEEE Conference on Decision and Control

作者： Yongqiang Qi Yingmin Jia Junping Du Fashan Yu Seventh Research Division and the Department of Systems and Control Beihang University (BUAA) Beijing 100191 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo 454000 Henan China

ISBN: (纸本)9781612848006

This paper deals with the active collision avoidance maneuver for the chaser along the specified trajectory, and presents a maneuver approach with constant thrust. Using the 3D stereo vision measurement, The relative position parameters of the target spacecraft for analyzing the collision possibility are obtained by using the vision measurement and the target maneuver positions are calculated through the equidistance interpolation method. The working times of thrusters in three axes can be respectively computed by the time series analysis method. In particular, the perturbation and fuel consumption are addressed during the computation of working time. Furthermore, the acceleration sequences and the corresponding working time series can be employed to determine a switching control law for the active collision avoidance maneuver. The simulation results show that the switch control law can effectively guarantee the chaser moving along the specified trajectory.

关键词： Constant thrust Vision measurement Switch control law The specified trajectory Equidistance interpolation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：