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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

137 篇 会议
7 篇 期刊文献

馆藏范围

144 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

76 篇 工学
- 73 篇 计算机科学与技术...
- 70 篇 软件工程
- 7 篇 信息与通信工程
- 3 篇 控制科学与工程
- 2 篇 生物工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 电气工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
- 1 篇 网络空间安全
36 篇 理学
- 29 篇 数学
- 10 篇 系统科学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
11 篇 教育学
- 11 篇 教育学
- 1 篇 心理学(可授教育学...
8 篇 管理学
- 5 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 社会学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

20 篇 java
19 篇 logic programmin...
10 篇 java programming...
5 篇 computer program...
4 篇 teaching
4 篇 parallel program...
4 篇 students
4 篇 software
4 篇 computer program...
3 篇 programming
3 篇 software enginee...
3 篇 education
3 篇 semantics
3 篇 testing
2 篇 uml
2 篇 task-driven
2 篇 data communicati...
2 篇 distributed syst...
2 篇 constraint satis...
2 篇 software metrics

机构

3 篇 nui maynooth co....
2 篇 institute of tec...
2 篇 software school ...
2 篇 lab. for the fou...
2 篇 inria rocquencou...
1 篇 computing scienc...
1 篇 school of contin...
1 篇 inria
1 篇 deis university ...
1 篇 computing scienc...
1 篇 lehrstuhl für in...
1 篇 yaroslav-the-wis...
1 篇 université de ma...
1 篇 the queen's univ...
1 篇 distributed syst...
1 篇 natl. technical ...
1 篇 university of lo...
1 篇 institut de math...
1 篇 inria 655 av. de...
1 篇 ntt communicatio...

作者

3 篇 tom dowling
2 篇 brian nolan
2 篇 mairson harry g.
2 篇 steve counsell
2 篇 tinelli cesare
2 篇 ruet paul
2 篇 harandi mehdi
2 篇 mello p.
2 篇 youssef hassoun
2 篇 roger johnson
2 篇 colombani yves
2 篇 gendreau michel
2 篇 power john
2 篇 milano m.
2 篇 lamma e.
2 篇 pesant gilles
1 篇 laschi roberto
1 篇 van eck richard
1 篇 johansson erik
1 篇 srinivas k.

语言

144 篇 英文

检索条件"任意字段=Proceedings of the 2nd international conference on Principles and practice of programming in Java"

共 144 条记录，以下是131-140 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

21st century game design: A model and prototype for promoting scientific problem solving

21st century game design: A model and prototype for promotin...

引用

12th IASTED international conference on Computers and Advanced Technology in Education, CATE 2009

作者： Van Eck, Richard Hung, Woei Bowman, Frank Love, Sherita University of North Dakota Grand Forks ND 58202 United States

ISBN: (纸本)9780889868168

Many people are interested in developing instructional games to engage today's 21st century learners, and many others see games as a means of teaching problem solving and critical thinking, especially in math and science. However, the process required for developing a game that is both engaging and instructionally effective remains elusive. We have taken an interdisciplinary approach driven by sound theory in problem solving, game software design, instructional design, and teacher education to develop a game to teach scientific problem solving for middle school students. The game is currently in the prototype stage, with a partially playable version of the first scenario. We have also developed a series of design documents and heuristic tools for game scenario design based on existing practice in software design, instructional design, and the 3C3R problem design model [1-2]. We are also incorporating achievable AI via algorithmic programming [3] that both support learning and gaming feedback principles but which is also feasible for low budget, resource-challenged designers of serious games. It is our hope that this model can serve as an example for developing effective serious games that are engaging and able to achieve relevant learning outcomes within the real-world constraints of public education.

关键词： Education computing

来源：评论

学校读者我要写书评

暂无评论

Efficient pseudorecursive evaluation schemes for non-adaptive sparse grids 1

引用

2nd Workshop on Sparse Grids and Applications, SGA 2012

作者： Buse, Gerrit Pflüger, Dirk Jacob, Riko TU München München Germany Institute for Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany ETH Zurich Zurich Switzerland

ISBN: (数字)9783319045375

ISBN: (纸本)9783319045368

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (proceedings of the 16th ACM Symposium on principles and practice of Parallel programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (proceedings of the international conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation. © Springer international Publishing Switzerland 2014.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Measuring Inappropriate Generosity with Access Modifiers in java Systems

Measuring Inappropriate Generosity with Access Modifiers in ...

引用

Joint conference of the Int'l Workshop on and international conference on Software Process and Product Measurement Software Measurement

作者： Christian Zoller Axel Schmolitzky Software Engineering and Software Architecture Department of Informatics University of Hamburg Hamburg Germany

Every element of a software architecture, e.g. a subsystem, package, or class, should have a well-defined interface that exposes or hides its sub elements according to the principles of information hiding and encapsulation. Similar to other object-oriented programming languages, java supports defining interfaces on several levels. The accessibility of types, methods, and fields can be restricted by using access modifiers. With these modifiers, developers are able to define interfaces of packages and classes tailored for different groups of clients. However, in programming practice, types and members seem to be often declared with too generous access modifiers, i.e. they are accessible by more clients than necessary. This can lead to unwanted dependencies and software quality degradation. We developed an approach to measuring the usage of access modifiers for types and methods in java by defining two new software metrics: Inappropriate Generosity with Accessibility of Types (IGAT) and Inappropriate Generosity with Accessibility of Methods (IGAM). Furthermore, we created a tool called Access Analysis that calculates and displays these metrics. Using Access Analysis, we conducted a survey on twelve open source java projects. The results support our assumption that access modifiers are often chosen more generously than necessary. On average, around one third of all type and method access modifiers fall into this category. Especially top-level types are almost always declared as public, so that package interfaces typically expose more types than necessary. Only 2% of all investigated top-level types are encapsulated inside their package.

关键词： java Software Encapsulation programming Software metrics

来源：评论

学校读者我要写书评

暂无评论

Solving satisfiability problems using field programmable gate arrays: First results 2nd

Solving satisfiability problems using field programmable gat...

引用

2nd international conference on principles and practice of Constraint programming, CP 1996

作者： Yokoo, Makoto Suyama, Takayuki Sawada, Hiroshi NTT Communication Science Laboratories 2-2 Hikaridai Seika-cho Soraku-gun619-02 Japan

ISBN: (纸本)3540615512

This paper presents an initial report on an innovative approach for solving satisfiability problems (SAT), i.e., creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). Until quite recently, this approach was unrealistic since creating special-purpose hardware was very expensive and time consuming. However, recent advances in FPGA technologies and automatic logic synthesis technologies have enabled users to rapidly create special-purpose hardware by themselves. This approach brings a new dimension to SAT algorithms, since all constraints (clauses) can be checked simultaneously using a logic circuit. We develop a new algorithm called parallel-checking, which assigns all variable values simultaneously, and checks all constraints concurrently. Simulation results show that the order of the search tree size in this algorithm is approximately the same as that in the Davis-Putnam procedure. Then, we show how the parallel-checking algorithm can be implemented on FPGAs. Currently, actual implementation is under way. We get promising initial results which indicate that we can implement a hard random 3-SAT problem with 300 variables, and run the logic circuit at clock rates of about 1MHz, i.e., it can check one million states per second. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

DrHJ: a lightweight pedagogic IDE for Habanero java 11

DrHJ: a lightweight pedagogic IDE for Habanero Java

引用

proceedings of the 9th international conference on principles and practice of programming in java

作者： Jarred Payne Vincent Cavé Raghavan Raman Mathias Ricken Robert Cartwright Vivek Sarkar Rice University

ISBN: (纸本)9781450309356

The java language and runtime environment has had a profound worldwide impact on computer software since its introduction nearly two decades ago. It has enabled the creation of a rich ecosystem of libraries, frameworks, and tools that promises to deliver significant value for many years to come. Consequently, a wide range of Interactive Development Environments (IDEs) have emerged to increase the productivity of java programmers. They vary in functionality based on the expertise level assumed for their target user base. The Eclipse java Development Tools (JDT) project offers a rich set of power tools for experienced programmers, but can be harder for novice programmers to set up and use. In contrast, IDEs such as Drjava [2] and BlueJ [16] have been developed primarily for use in introductory programming courses.

关键词： IDE language data-race detection parallel programming

来源：评论

学校读者我要写书评

暂无评论

Exploration on Cultivating Students' Abilities Based on Python Teaching practice

Exploration on Cultivating Students' Abilities Based on Pyth...

引用

2014 2nd international conference on Teaching and Computational Science(ICTCS 2014)

作者： Xinxiu Wen Zeping Yang Zhanquan Wang Min Zhao School of Information Science and Engineering East China University of Science and Technology

Computer programming courses(C,java,C++,etc) intended for non-majors are facing a lot of problems in cultivating undergraduates' abilities of computational thinking and problem *** are frustrated with complex syntax of these languages and are confused with their practical *** the paper,our exploration on students' abilities cultivations based on Python teaching practice is *** plan,teaching method and teaching effect are presented in *** wish our research and practice could give some hint for the reform of introductory programming courses.

关键词： problem solving Python task-driven teaching method computational thinking

来源：评论

学校读者我要写书评

暂无评论

An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem 2nd

An empirical study of dynamic variable ordering heuristics f...

引用

2nd international conference on principles and practice of Constraint programming, CP 1996

作者： Gent, Ian P. MacIntyre, Ewan Prosser, Patrick Smith, Barbara M. Walsh, Toby Department of Computer Science University of Strathclyde GlasgowGl 1XH United Kingdom Division of Artificial Intelligence School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom IRST I38100 Trento and DIST GenovaI16145 Italy

ISBN: (纸本)3540615512

The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For example, in conjunction with algorithms which check forwards, the Fail-First (FF) and Brelaz (Bz) heuristics are cheap to evaluate and are generally considered to be very effective. Recent work to understand phase transitions in NP-complete problem classes enables us to compare such heuristics over a large range of different kinds of problems. Furthermore, we are now able to start to understand the reasons for the success, and therefore also the failure, of heuristics, and to introduce new heuristics which achieve the successes and avoid the failures. In this paper, we present a comparison of the Bz and FF heuristics in forward checking algorithms applied to randomly-generated binary CSP's. We also introduce new and very general heuristics and present an extensive study of these. These new heuristics are usually as good as or better than Bz and FF, and we identify problem classes where our new heuristics can be orders of magnitude better. The result is a deeper understanding of what helps heuristics to succeed or fail on hard random problems in the context of forward checking, and the identification of promising new heuristics worthy of further investigation. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Automated programming Evaluation using MERN

Automated Programming Evaluation using MERN

引用

Applied Artificial Intelligence and Computing (ICAAIC), international conference on

作者： P. Kanchanamala B. Hema Sai B. Balaji Ashutosh Panigrahi K. Srinivas A. Vishnu Vardhan Information Technology GMR Institute of Technology Rajam Andhra Pradesh India

Understanding how software works and building code has been a basic requirement for every student. programming skills vary from person to person and even from language to language. Monitoring the student performance is evident to assess and improve programming skills. Though e-learning courses have paved the way to a different structure of learning, it is way more important to practice under supervision. The proposed model aims to automate the process of lab evaluation and assessment of programming subjects in the curriculum. The basic idea is to bring the IDE of various programming languages(C, C++, Python, java, C#, goLang, JS) to construct a single platform to write code. The automated platform consists of different types of modules. Faculty module can add, modify or delete questions. According to the sections and subjects allocated, the faculty can observe the performance trends of all the students of the section in a given language. Test cases will be provided for each question. In student module, the student will be able to see all the programming subjects according to the section. Percentage, grades and marks will be provided based on the completion of test cases. Student profile demonstrates the whole details of the student. In admin module, the admin will have access to the overall website, to add faculty and student details. This project is being built using MERN stack web development. This automated tool will be very useful in assessing the students and provide accurate results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Induction principles formalized in the calculus of constructions 2nd

Induction principles formalized in the calculus of construct...

引用

2nd international Joint conference on Theory and practice of Software Development, TAPSOFT 1987

作者： Huet, Gérard INRIA France

ISBN: (纸本)9783540176602

The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2,3], Girard [12], Martin-Lof [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a substantial number of proofs demonstrating the power of expression of the formalism [9]. The Calculus of Constructions is proposed as a foundation for the design of programming environments where programs are developed consistently with formal specifications. The current paper shows how to define inductive concepts in the calculus. A very general induction schema is obtained by postulating all elements of the type of interest to belong to the standard interpretation associated with a predicate map. This is similar to the treatment of D. Park [16], but the power of expression of the formalism permits a very direct treatment, in a language that is formalized enough to be actually implemented on computer. Special instances of the induction schema specialize to Ncetherian induction and Structural induction over any algebraic type. Computational Induction is treated in an axiomatization of Domain Theory in Constructions. It is argued that the resulting principle is more powerful than LCF’s [13], since the restriction on admissibility is expressible in the object language. © 1987, Springer-Verlag Berlin Heidelberg. All rights reserved.

关键词： Parks

来源：评论

学校读者我要写书评

暂无评论

Distributed software engineering: Research and education challenges

Distributed software engineering: Research and education cha...

引用

Inaugural IEEE-IES Digital EcoSystems and Technologies conference, DEST

作者： Bertrand Meyer ETH Zurich and Eiffel Software Switzerland

Software development has undergone a major change in recent years, partly but not only as a result of the outsourcing phenomenon. Most software projects today are distributed, raising a whole slate of new issues of management, coordination, licensing, stakeholder involvement, specification, quality assurance (in particular testing) and maintenance. While there has been much discussion of the political and economic aspects of outsourcing, the technical consequences and issues of globalized software development are not completely understood. This talk presents a number of research challenges in distributed software engineering. It introduces a number of organizational and technical solutions that we have found to be efficient in industrial practice. On the educational side, it builds on our experience at ETH -- in particular our courses on "software engineering for outsourced and offshore development" and our multi-university distributed project course -- to discuss how to integrate distributed software development into the teaching of modern software engineering principles and practices.

关键词： Software engineering Software Education programming Awards activities Outsourcing Computer languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共15页 << < 6 7 8 9 10 11 12 13 14 15 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：