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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

328 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

271 篇 工学
- 250 篇 计算机科学与技术...
- 182 篇 软件工程
- 39 篇 信息与通信工程
- 20 篇 生物工程
- 15 篇 控制科学与工程
- 15 篇 生物医学工程（可授...
- 13 篇 动力工程及工程热...
- 13 篇 电气工程
- 12 篇 电子科学与技术（可...
- 11 篇 建筑学
- 8 篇 环境科学与工程（可...
- 7 篇 土木工程
- 6 篇 机械工程
- 5 篇 材料科学与工程（可...
- 5 篇 化学工程与技术
- 4 篇 力学（可授工学、理...
79 篇 理学
- 49 篇 数学
- 21 篇 生物学
- 8 篇 物理学
- 8 篇 系统科学
- 7 篇 统计学（可授理学、...
- 4 篇 化学
64 篇 管理学
- 38 篇 图书情报与档案管...
- 29 篇 管理科学与工程(可...
- 21 篇 工商管理
26 篇 教育学
- 26 篇 教育学
13 篇 法学
- 10 篇 社会学
7 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
5 篇 经济学
- 5 篇 应用经济学
4 篇 农学
2 篇 军事学

主题

23 篇 mobile computing
14 篇 students
14 篇 cloud computing
7 篇 distributed comp...
6 篇 curricula
6 篇 ubiquitous compu...
5 篇 edge computing
5 篇 education comput...
4 篇 quantum computin...
4 篇 recommender syst...
4 篇 virtual machine
3 篇 genes
3 篇 bandwidth
3 篇 grid computing
3 篇 computer applica...
3 篇 computing power
3 篇 flash memory
3 篇 semantics
3 篇 genetic algorith...
3 篇 virtualization

机构

8 篇 school of comput...
5 篇 school of comput...
4 篇 department of co...
3 篇 school of comput...
3 篇 school of comput...
3 篇 school of comput...
2 篇 university of be...
2 篇 key laboratory o...
2 篇 school of comput...
2 篇 department of co...
2 篇 university of co...
2 篇 the hong kong po...
2 篇 marquette univer...
2 篇 dept. of compute...
2 篇 computing instit...
2 篇 institute of com...
2 篇 school of comput...
2 篇 university of ut...
2 篇 college of compu...
2 篇 kyungpook nation...

作者

6 篇 hong jiman
5 篇 hung chih-cheng
5 篇 song enmin
4 篇 zulkernine moham...
4 篇 cho yookun
4 篇 liu hong
3 篇 chan stephen c.f...
3 篇 kim bongjae
3 篇 varadharajan vij...
3 篇 zambonelli franc...
3 篇 ngai grace
2 篇 cassel lillian n...
2 篇 kühn eva
2 篇 sheikh iqbal aha...
2 篇 van langeveld ma...
2 篇 weldemariam komm...
2 篇 liu ling
2 篇 tancer martin
2 篇 mayer wolfgang
2 篇 ni lijun

语言

334 篇 英文

检索条件"任意字段=Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing"

共 334 条记录，以下是271-280 订阅

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

详细简洁

排序：

CS1 students speak: Advice for students by students 09

CS1 students speak: Advice for students by students

引用

40th acm Technical symposium on Computer Science Education, SIGCSE 2009

作者： Hanks, Brian Murphy, Laurie Simon, Beth McCauley, Renée Zander, Carol Computer Science Info. Sys. Fort Lewis College Durango CO 81301 United States Comp. Sci. and Comp. Eng. Pacific Lutheran University Tacoma WA 98447 United States Comp. Science and Engineering U. of California San Diego San Diego CA 92093 United States Computer Science College of Charleston Charleston SC 29424 United States Computing and Software Sys. U. of Washington Bothell Bothell WA 98011 United States

ISBN: (纸本)9781605585048

We collected advice on how to succeed at learning to program from 164 CS1 students at 3 institutions during a "saying is believing" intervention designed to encourage a growth mindset. More students gave general advice (63%) than programming-specific (23%) or attitudinal advice (34%), despite being prompted to encourage future students to develop a growth mindset toward programming. Advice categories and quotes offer educators insights into student beliefs and practices and suggest a framework for considering how best to advise students. We discuss the implications of students offering advice to other students and provide a handout of representative advice intended for distribution to students in introductory programming courses. © 2009 acm.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Real-time flash memory storage with Janus-FTL 12

Real-time flash memory storage with Janus-FTL

引用

27th Annual acm symposium on applied computing, SAC 2012

作者： Lee, Jongmin Kim, Ahreum Park, Moonju Choi, Jongmoo Lee, Donghee Noh, Sam H. School of Computer Science University of Seoul Seoul Korea Republic of School of Computing Soongsil University Seoul Korea Republic of Dept. of Computer Science and Engineering University of Incheon Incheon Korea Republic of School of Computer Science and Engineering Dankook University Yongin Korea Republic of School of Computer and Information Engineering Hongik University Seoul Korea Republic of

ISBN: (纸本)9781450308571

Janus-FTL, a recently proposed Flash Translation Layer (FTL) software layer for flash memory storage, has the potential to reduce the worst case write time of flash memory storage by keeping hot data in the page mapping area and cold data in the block mapping area. In this paper, we present the design of the real-time Janus-FTL that guarantees worst case garbage collection cost and write response time. In the proposed FTL, each task needs to decide whether to place its data either in the page mapping area or the block mapping area. A naive optimal placement algorithm, which minimizes the worst case write time, has O(2N) time complexity for N tasks. We propose an algorithm reducing the time complexity from O(2N) to O(N log N). through experiments, we verify that the real-time Janus-FTL reduces the worst case write time and, as a result, accommodates more real-time tasks than the previous state-of-the-art realtime page mapping FTL. © 2012 acm.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

ISCA 2013 - 40th Annual International symposium on Computer Architecture, Conference proceedings

ISCA 2013 - 40th Annual International Symposium on Computer ...

引用

40th Annual International symposium on Computer Architecture, ISCA 2013

ISBN: (纸本)9781450320795

the proceedings contain 56 papers. the topics discussed include: continuous real-world inputs can open up alternative accelerator designs;convolution engine: balancing efficiency and flexibility in specialized computing;thin servers with smart pipes: designing SoC accelerators for memcached;understanding and mitigating refresh overheads in high-density DDR4 DRAM systems;ArchShield: architectural framework for assisting DRAM scaling by tolerating high error-rates;agile, efficient virtualization power management with low-latency server power states;improving virtualization in the presence of software managed translation lookaside buffers;microarchitectural mechanisms to exploit value structure in SIMT architectures;trigerred instructions: a control paradigm for spatially-programmed architectures;quantum rotations: a case study in static and dynamic machine-code generation for quantum computers;and DNA-based molecular architecture with spatially localized components.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Developing authentic problem solving skills in introductory computing classes 09

Developing authentic problem solving skills in introductory ...

引用

40th acm Technical symposium on Computer Science Education, SIGCSE 2009

作者： Falkner, Katrina Palmer, Edward School of Computer Science University of Adelaide Adelaide Australia Centre for Learning and Professional Development University of Adelaide Adelaide Australia

ISBN: (纸本)9781605585048

the ability to solve problems is the key to developing software, and it is an ability that can be difficult to learn. Introductory Computer Science students are often taught syntax and semantics, along with simple problems designed to develop logical, structured thinking, but authentic problem-solving skills are rarely developed at these early stages. In this paper we describe an approach to introductory computer science education that addresses student engagement through integrating cooperative learning techniques and authentic problem solving processes throughout each aspect of the curriculum. Over a period of 4 years, the introductory computer science course at the University of Adelaide has been modified to support a cooperative learning style. A three-stage methodology has been implemented in place of traditional lectures to achieve this. the process focuses on observing the application of programming techniques, observing problem solving techniques and then applying cooperative problem solving exercises in the classroom. the results from this change in teaching methodology have been an increase in attendance rates at lectures and practical sessions as well as improved learning outcomes as measured by exam results. Student experience surveys show students have greater motivation for learning and believe they have a better understanding of concepts since the changes have occurred. © 2009 acm.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

An I/O scheduler based on fine-grained access patterns to improve SSD performance and lifespan 14

An I/O scheduler based on fine-grained access patterns to im...

引用

29th Annual acm symposium on applied computing, SAC 2014

作者： Wang, Mingyang Hu, Yiming Department of Electrical Engineering and Computing Systems University of Cincinnati Cincinnati OH 45221 United States

ISBN: (纸本)9781450324694

Although the many benefits delivered by Solid State Disks (SSDs), they also pose some unique and serious challenges to I/O and file system designers. Unlike HDDs and other memory devices, SSDs cannot perform in-place updates. A block has to be erased before it can be re-written. Moreover, the costs of different SSD operations are highly asymmetric. A write operation in an SSD is an order of magnitude slower than a read operation, and an erase operation is in turn an order of magnitude slower than a write. Moreover, a block can endure only a limited number of erasures before it wears out. Most SSDs employ a log-structured Flash-Translation-Layer (FTL) to solve the not-in-place update problem. the unique operations of the FTLs, together with the asymmetric overheads of different operations, imply that many traditional solutions optimized for HDDs do not work well for SSDs. For example, sequential writes that are not perfectly aligned to the flash block boundary, may reduce performance and increase wearing overhead. In this paper, we proposed a novel I/O scheduler which is based on fine-grained access patterns in a per-process per-stream manner. these patterns are used to guide a set of novel scheduling policies, including pre-alignment, inner-padding, write merging, merging-and-splitting, to improve the write performance of SSDs that adopt log-structured FTLs. Simulation results show that these policies can improve write performance by up to 60%. Moreover, the schemes reduce SSD erasure cycle by up to 64%, which is directly translated to a major improvement on the lifespan of SSDs. Copyright 2014 acm.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Malware detection based on mining API calls 10

Malware detection based on mining API calls

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Sami, Ashkan Yadegari, Babak Rahimi, Hossein Peiravian, Naser Hashemi, Sattar Hamze, Ali CSE and IT Department Shiraz University Shiraz Iran Soft-Computing Laboratory Shiraz University Shiraz Iran APA Malware Research and Education Center Shiraz University Iran

ISBN: (纸本)9781605586380

Financial loss due to malware nearly doubles every two years. For instance in 2006, malware caused near 33.5 Million GBP direct financial losses only to member organizations of banks in UK. Recent malware cannot be detected by traditional signature based anti-malware tools due to their polymorphic and/or metamorphic nature. Malware detection based on its immutable characteristics has been a recent industrial practice. the datasets are not public. thus the results are not reproducible and conducting research in academic setting is difficult. In this work, we not only have improved a recent method of malware detection based on mining Application Programming Interface (API) calls significantly, but also have created the first public dataset to promote malware research. Our technique first reads API call sets used in a collection of Portable Executable (PE) files, then generates a set of discriminative and domain interpretable features. these features are then used to train a classifier to detect unseen malware. We have achieved detection rate of 99.7% while keeping accuracy as high as 98.3%. Our method improved state of the art technology in several aspects: accuracy by 5.24%, detection rate by 2.51% and false alarm rate was decreased from 19.86% to 1.51%. this project's data and source code can be found at http://***/~sami/malware. © 2010 acm.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

AAGC: An efficient associativity-aware garbage collection scheme for hybrid FTLs 12

AAGC: An efficient associativity-aware garbage collection sc...

引用

27th Annual acm symposium on applied computing, SAC 2012

作者： Kim, Bongjae Park, Minkyu Jeon, Cheol Sung, Chang Oan Cho, Yookun Hong, Jiman Kim, Kyoung Woo School of Computer Science and Engineering Seoul National University Seoul Korea Republic of Department of Computer Engineering Konkuk University Chungbuk Korea Republic of Computer Science Department Indiana University Southeast United States School of Computing Soongsil University Seoul Korea Republic of School of Energy and Resources University College London United Kingdom

ISBN: (纸本)9781450308571

NAND ash memory has many advantages such as low-power consumption, shock-resistance, and non-volatility. For these reasons, NAND ash memory is used for data storage purposes in mobile, personal and even enterprise computer systems. When we use NAND ash memory as a means of data storage, it requires a garbage collection procedure due to its erase-before-write characteristic. the efficiency of this garbage collection is an important issue because it affects the performance of the NAND ash memory. In this paper, we propose an efficient garbage collection scheme that can be combined with previous hybrid FTLs. Our garbage collection scheme considers the associativity of the blocks when selecting a victim block. the proposed scheme effectively reduces the number of time-consuming block erasures. Our trace-driven simulation results show that the proposed garbage collection scheme can reduce the number of block erasures by as much as 14%. It can also reduce the average response time and maximum response time by nearly 10% and 70%, respectively. © 2012 acm.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Filling the gap in programming instruction: A text-enhanced graphical programming environment for junior high students 09

Filling the gap in programming instruction: A text-enhanced ...

引用

40th acm Technical symposium on Computer Science Education, SIGCSE 2009

作者： Cheung, Joey C.Y. Ngai, Grace Chan, Stephen C.F. Lau, Winnie W.Y. Department of Computing Hong Kong Polytechnic University Hung Hom Hong Kong

ISBN: (纸本)9781605585048

To address the unique demands and challenges of educational computing, various kinds of environments, including graphics-rich and textual environments, have been proposed for use in introductory courses to provide students with a rich and interesting learning environment. In our experience, students in Grade 7 and younger respond best to the graphics environments while senior high school students prefer a conventional textual programming environment. Clearly, this leaves a gap at Grade 11-13, with students often on the one hand finding the graphics-based environments too limited and on the other finding the textual environments too difficult. In this paper, we propose a text-enhanced graphical programming environment which is innovative and interactive, and designed for junior high students with no programming experience. this environment allows students to design their own creative stories or programs. they build their programs using drag-and-drop iconic blocks, but unlike other, similar icon-based programming languages, they are also presented with the syntax of the actual program they are constructing in real-time. Once a particular icon block has been dropped in the programming area, the syntax statements corresponding to that block is immediately generated and presented to the user. the environment also allows them to modify the code without any limitations. Our results show that our textual-graphical hybrid environment has a positive impact on the learning experience of the students. © 2009 acm.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

A novel segmentation method for convex lesions based on dynamic programming with local intra-class variance 12

A novel segmentation method for convex lesions based on dyna...

引用

27th Annual acm symposium on applied computing, SAC 2012

作者： Yu, Mali Huang, Qiliang Jin, Renchao Song, Enmin Liu, Hong Hung, Chih-Cheng School of Computer Science Huazhong University of Science and Technology Wuhan China Key Laboratory of Education Ministry for Image Processing and Intelligent Control Wuhan Hubei China Radiology Department Second People's Hospital of Nanning Nanning China School of Computing and Software Engineering Southern Polytechnic State University GA United States

ISBN: (纸本)9781450308571

Lesion segmentation plays an important role in medical image processing and analysis. there exist several successful dynamic programming (DP) based segmentation methods for general images. In those methods, the gradient is used as an important factor in the cost function to attract the contours to the boundaries. Since medical images have their characteristics such as low contrast, blurred edges and high noises, the gradient operator cannot work well enough to achieve a satisfactory performance for boundary detection. We define the local intra-class variance and combine it with the dynamic programming method to replace the traditional gradient operation. Experiments on synthetic and X-ray images are carried out and the results are compared with Canny and fast multilevel fuzzy edge detection (FMFED) algorithms. It is demonstrated that the proposed method performs better on medical images with low contrast, blurred edges and high noises. In addition, 483 regions of interest of mammograms randomly extracted from DDSM of the University of South Florida are used to compare our proposed method with the plane-fitting and dynamic programming method (PFDP), and the normalized cut segmentation method (Ncut). the results demonstrate that our method is more accurate and robust than PFDP and Ncut. © 2012 acm.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

An improved K-view algorithm for image texture classification using new characteristic views selection methods 10

An improved K-view algorithm for image texture classificatio...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Lan, Yihua Liu, Hong Song, Enmin Hung, Chih-Cheng School of Computer Science Huazhong University of Science and Technology Wuhan China School of Computing and Software Engineering Southern Polytechnic State University GA United States

ISBN: (纸本)9781605586380

Image texture classification plays an important role in the computer processing of images. Many methods including the Gray Level Co-Occurrence (GLCO), Local Binary Patterns and K-View algorithms for image texture classification have been proposed. there exist several variations of the K-view algorithms. Among them, the K-View algorithm using rotation-invariant features can produce higher classification accuracy;however, the algorithm is not stable. this paper presents an improved K-View Algorithm using new characteristic views selection methods. We propose three different methods for selecting characteristic views. the first method chooses characteristic views based on the interval of minimum mean gray level and maximum mean gray level of all views in the primitive set and then randomly select the same number of views in each sub-interval. the second method divides the sorted interval with equal sub-interval and then select one view randomly in each sub-interval. the third method chooses views in an equal distance starting from the minimum gray level in the sorted list. Experimental results show that the proposed characteristic views selection methods improve the performance of the K-View algorithms. this improved K-View algorithm is more robust and accurate compared with the results of the previous K-View algorithms. © 2010 acm.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共34页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：