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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

325 篇 会议
10 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

266 篇 工学
- 243 篇 计算机科学与技术...
- 187 篇 软件工程
- 34 篇 信息与通信工程
- 25 篇 生物工程
- 16 篇 生物医学工程（可授...
- 15 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 电子科学与技术（可...
- 11 篇 建筑学
- 10 篇 动力工程及工程热...
- 7 篇 土木工程
- 7 篇 环境科学与工程（可...
- 6 篇 材料科学与工程（可...
- 5 篇 机械工程
- 5 篇 仪器科学与技术
- 4 篇 力学（可授工学、理...
- 4 篇 光学工程
90 篇 理学
- 57 篇 数学
- 25 篇 生物学
- 12 篇 物理学
- 12 篇 统计学（可授理学、...
- 8 篇 系统科学
- 4 篇 大气科学
63 篇 管理学
- 35 篇 图书情报与档案管...
- 30 篇 管理科学与工程(可...
- 23 篇 工商管理
11 篇 法学
- 8 篇 社会学
7 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
6 篇 经济学
- 6 篇 应用经济学
5 篇 农学
3 篇 教育学
1 篇 军事学

主题

22 篇 mobile computing
12 篇 cloud computing
7 篇 ubiquitous compu...
6 篇 quantum computin...
5 篇 distributed comp...
5 篇 edge computing
4 篇 computation theo...
4 篇 application soft...
4 篇 computer archite...
4 篇 recommender syst...
4 篇 processor schedu...
4 篇 semantics
4 篇 virtual machine
3 篇 internet of thin...
3 篇 reinforcement le...
3 篇 genes
3 篇 grid computing
3 篇 computer applica...
3 篇 energy utilizati...
3 篇 computing power

机构

8 篇 school of comput...
5 篇 school of comput...
5 篇 department of co...
3 篇 school of comput...
3 篇 school of comput...
3 篇 school of comput...
2 篇 nit calicut
2 篇 hong kong polyte...
2 篇 university of be...
2 篇 key laboratory o...
2 篇 school of comput...
2 篇 university of co...
2 篇 the hong kong po...
2 篇 marquette univer...
2 篇 dept. of compute...
2 篇 computing instit...
2 篇 institute of com...
2 篇 center for relia...
2 篇 school of comput...
2 篇 university of wa...

作者

6 篇 hong jiman
5 篇 hung chih-cheng
5 篇 song enmin
4 篇 zulkernine moham...
4 篇 cho yookun
4 篇 liu hong
3 篇 kim bongjae
3 篇 varadharajan vij...
3 篇 zambonelli franc...
3 篇 ahamed sheikh iq...
3 篇 leong hong va
3 篇 rahman ataur
2 篇 song jie
2 篇 kühn eva
2 篇 sheikh iqbal aha...
2 篇 weldemariam komm...
2 篇 mayer wolfgang
2 篇 freitas fred
2 篇 claycomb william
2 篇 yu mali

语言

335 篇 英文

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

共 335 条记录，以下是221-230 订阅

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

详细简洁

排序：

Filtering spams using the minimum description length principle 10

Filtering spams using the minimum description length princip...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Almeida, Tiago A. Yamakami, Akebo Almeida, Jurandy School of Electrical and Computer Engineering University of Campinas - UNICAMP 13083-970 Campinas SP Brazil Institute of Computing University of Campinas 13083-970 Campinas SP Brazil

ISBN: (纸本)9781605586380

Spam has become an increasingly important problem with a big economic impact in society. Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade filtering. In this paper, we present a novel approach to spam filtering based on the minimum description length principle. the proposed model is fast to construct and incrementally updateable. Additionally, we offer an analysis concerning the measurements usually employed to evaluate the quality of the anti-spam classifiers. In this sense, we present a new measure in order to provide a fairer comparison. Furthermore, we conducted an empirical experiment using six well-known, large and public databases. Finally, the results indicate that our approach outperforms the state-of-the-art spam filters. © 2010 acm.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Design and development of a real-time embedded inertial measurement unit 10

Design and development of a real-time embedded inertial meas...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Facchinetti, Tullio Savioli, Alberto Goldoni, Emanuele University of Pavia Dept. of Computer Eng. and System Science 27100 - Pavia Italy University of Pavia Dept. of Electronics 27100 - Pavia Italy

ISBN: (纸本)9781605586380

Micro-Electro-Mechanical Systems (MEMS) sensors are used nowadays in a wide range of applications, from robotics to entertainment. Recently, this technology has also been adopted to equip Inertial Measurement Units (IMUs) replacing traditional electro-mechanical sensors. In this work we present a low-cost embedded IMU which is based on a low-cost embedded microcontroller with limited resources in terms of computing power and memory. the developed software runs on the top of the ERIKA Enterprise real-time kernel to manage the computing tasks that perform sensor data sampling and processing. Low-cost MEMS accelerometers, gyroscopes and magnetometers provide the required data and a Kalman filter analyses raw values in real-time. Experimental results are obtained using a six degrees of freedom anthropomorphic manipulator to drive the IMU with accurate known trajectory, acceleration and rotation. Performances are evaluated both in terms of sensor fusion effectiveness and real-time execution. © 2010 acm.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

Inductive reasoning and semantic web search 10

Inductive reasoning and semantic web search

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： D'Amato, Claudia Esposito, Floriana Fanizzi, Nicola Fazzinga, Bettina Gottlob, Georg Lukasiewicz, thomas Dipartimento di Informatica Università di Bari Italy DEIS Università Della Calabria Italy University of Oxford United Kingdom Computing Laboratory Oxford-Man Institute of Quantitative Finance United Kingdom Computing Laboratory Institut für Informationssysteme TU Wien Austria

ISBN: (纸本)9781605586380

Extensive research activities are recently directed towards the Semantic Web as a future form of the Web. Consequently, Web search as the key technology of the Web is evolving towards some novel form of Semantic Web search. A very promising recent approach to such Semantic Web search is based on combining standard Web search with ontological background knowledge and using standard Web search engines as the main inference motor of Semantic Web search. In this paper, we propose to further enhance this approach to Semantic Web search by the use of inductive reasoning. this adds the important ability to handle inconsistencies, noise, and incompleteness, which often occur in distributed and heterogeneous environments, such as the Web. We report on a prototype implementation of the new approach and extensive experimental results. © 2010 acm.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

On processing location based top-k queries in the wireless broadcasting system 10

On processing location based top-k queries in the wireless b...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Jung, HaRim Cho, ByungKu Chung, Yon Dohn Liu, Ling Department of Computer Science and Engineering Korea University Seoul Korea Republic of College of Computing Georgia Institute of Technology United States

ISBN: (纸本)9781605586380

In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial specifications for data objects in the wireless broadcasting system. We introduce two methods for processing location based top-k queries on the broadcast stream. In the first method, the search algorithm runs on the broadcast aggregate R-tree (aR-tree). However, the aR-tree may deteriorate the search performance, especially in terms of the tuning time. With this problem in mind, we propose a novel index structure, called the bit-vector R-tree (bR-tree), which stores additional bit-vector information to facilitate processing of location based top-k queries. the search algorithm on the broadcast bR-tree is also described. Our simulation experiments demonstrate that the bR-tree method clearly outperforms the aR-tree method in terms of the tuning time, while maintaining similar or better performance in terms of the access time. © 2010 acm.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints 10

Efficient mapping and voltage islanding technique for energy...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Ghosh, Pavel Sen, Arunabha Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85287 United States

ISBN: (纸本)9781605586380

Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (PEs). this reduction in energy consumption comes at the cost of the energy consumption of the level shifters between voltage islands. Moreover, from physical design perspective it is desirable to have a limited number of voltage islands. Considering voltage islanding during mapping of the PEs to the NoC routers can significantly reduce both the computational and the level-shifter energy consumptions and the communication energy consumption on the NoC links. In this paper, we formulate the problem as an optimization problem with an objective of minimizing the overall energy consumption constrained by the performance in terms of delay and the maximum number of voltage islands. We provide the optimal solution to our problem using Mixed Integer Linear Program (MILP) formulation. We also propose a heuristic based on random greedy selection to solve the problem. Experimental results using E3S benchmark applications and some real applications show that the heuristic finds near-optimal solution in almost all cases in a very small fraction of the time required to achieve the optimal solution. © 2010 acm.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Can complexity, coupling, and cohesion metrics be used as early indicators of vulnerabilities? 10

Can complexity, coupling, and cohesion metrics be used as ea...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Chowdhury, Istehad Zulkernine, Mohammad Dept. of Electrical and Computer Eng. Queen's University Kingston ON K7L3N6 Canada School of Computing Queen's University Kingston ON K7L3N6 Canada

ISBN: (纸本)9781605586380

It is difficult to detect vulnerabilities until they manifest themselves as security failures in the operational stage of software, because the security concerns are not addressed or known sufficiently early during software development. Complexity, coupling, and cohesion (CCC) related software metrics can be measured during the earlier phases of software development. If empirical relationships can be discovered between CCC metrics and vulnerabilities, these metrics could aid software developers to take proactive actions against potential vulnerabilities in software. In this paper, we conduct an extensive case study on Mozilla Firefox to provide empirical evidence on how vulnerabilities are related to complexity, coupling, and cohesion. We find that CCC metrics are correlated to vulnerabilities at a statistically significant level. We further examine the correlations to determine which level (design or code) of CCC metrics are better indicators of vulnerabilities. We also observe that the correlation patterns are stable across multiple releases of the software. these observations show that CCC metrics can be dependably used as early indicators of vulnerabilities in software. © 2010 acm.

关键词： Adhesion

来源：评论

学校读者我要写书评

暂无评论

Chordet: An efficient and transparent replication for improving availability of peer-to-peer networked systems 10

Chordet: An efficient and transparent replication for improv...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Park, Geunyoung Kim, Seokhyun Cho, Yookun Kook, Joongjin Hong, Jiman Seoul National University Korea Republic of School of Computing Soongsil University Korea Republic of

ISBN: (纸本)9781605586380

In Peer-to-Peer (P2P) networked systems, participating nodes can be frequently disconnected from the networks because of several reasons such as users' intentions, nodes' failures, and network problems. this may increase the loss-ratio of the data and some other routing information;it may spoil the reliability of the whole P2P networks. Several works have been made to improve their reliability and availability based on existing Distributed Hash Tables (DHT) schemes. However, they have some trade-off relation between the performance and the reliability of the P2P networks. In this paper, we present Chordet, which is an efficient and transparent replication scheme for Chord-based P2P networks. Chordet replicates the data stored in the participating nodes so that they are evenly distributed. Using Chordet, the nodes can reduce lookup failure rates and lookup path length. Moreover, not all nodes need to implement proposed replication algorithm. Our simulation results show that Chordet outperforms the previous schemes in terms of both performance and reliability of the whole P2P networks. © 2010 acm.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Improving automatic music genre classification with hybrid content-based feature vectors 10

Improving automatic music genre classification with hybrid c...

引用

25th Annual acm symposium on applied computing, SAC 2010

作者： Silla Jr., Carlos N. Koerich, Alessandro L. Kaestner, Celso A. A. School of Computing University of Kent Canterbury Canterbury Kent CT2 7NF United Kingdom Pontifical Catholic University of Paraná Curitiba PR 80215-901 Brazil Federal University of Technology of Paraná Curitiba PR 80230-901 Brazil

ISBN: (纸本)9781605586380

Current research on the task of automatic music genre classification has been focusing on new classification approaches based on combining information from other sources than the music signal. the reason for this is that the use of content-based approaches, i.e. using features extracted directly from the audio signal, seems to have reached a glass ceiling. In this work we show that by using different types of content-based features together it is possible to substantially improve the classification accuracy. this is an interesting result as different types of content-based features aim, at a conceptual level, to capture the same type of information. In order to identify which types of content-based features are responsible for the predictive accuracy gain, we also used a feature selection (FS) approach based on a genetic algorithm (GA). the analysis of the results in two databases shows that the use of the GA for FS succeeds in selecting a representative subset without significant loss in accuracy. It also shows that all the different types of content-based features employed are important for the improvement of the accuracy in classifying music genres. © 2010 acm.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：