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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

620 篇 会议
12 册 图书
12 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

480 篇 工学
- 389 篇 计算机科学与技术...
- 335 篇 软件工程
- 66 篇 控制科学与工程
- 57 篇 信息与通信工程
- 41 篇 电气工程
- 36 篇 机械工程
- 27 篇 生物工程
- 26 篇 动力工程及工程热...
- 26 篇 电子科学与技术（可...
- 21 篇 生物医学工程（可授...
- 18 篇 材料科学与工程（可...
- 18 篇 环境科学与工程（可...
- 17 篇 仪器科学与技术
- 16 篇 化学工程与技术
- 15 篇 冶金工程
- 15 篇 土木工程
- 12 篇 力学（可授工学、理...
- 12 篇 建筑学
220 篇 理学
- 141 篇 数学
- 38 篇 物理学
- 30 篇 生物学
- 30 篇 系统科学
- 22 篇 统计学（可授理学、...
- 15 篇 化学
130 篇 管理学
- 95 篇 管理科学与工程(可...
- 62 篇 工商管理
- 38 篇 图书情报与档案管...
30 篇 教育学
- 30 篇 教育学
23 篇 经济学
- 23 篇 应用经济学
16 篇 医学
- 15 篇 临床医学
11 篇 法学
10 篇 农学
5 篇 文学
3 篇 艺术学
1 篇 哲学
1 篇 军事学

主题

25 篇 programming
16 篇 software enginee...
15 篇 students
15 篇 dynamic programm...
14 篇 linear programmi...
12 篇 programming prof...
12 篇 python
10 篇 genetic algorith...
9 篇 object oriented ...
9 篇 optimization
8 篇 computer languag...
8 篇 real-time system...
7 篇 internet of thin...
7 篇 computer science
7 篇 software enginee...
7 篇 education
7 篇 java
7 篇 scheduling
6 篇 libraries
6 篇 application soft...

机构

4 篇 al-farahidi univ...
4 篇 national univers...
4 篇 al-turath univer...
3 篇 department of co...
3 篇 galgotias univer...
3 篇 school of electr...
3 篇 al-kunooze unive...
2 篇 department of co...
2 篇 departemen of nu...
2 篇 wuhan university...
2 篇 school of inform...
2 篇 informatics engi...
2 篇 computer science...
2 篇 department of in...
2 篇 department of co...
2 篇 electronics and ...
2 篇 department of co...
2 篇 amrita school of...
2 篇 school of comput...
2 篇 school of inform...

作者

3 篇 hussam ragheed
3 篇 zhang minghui
2 篇 xie hao
2 篇 he zhongzheng
2 篇 li yang
2 篇 prosser patrick
2 篇 weng tien-hsiung
2 篇 m. shirali-shahr...
2 篇 zhou jianzhong
2 篇 suraj malik
2 篇 chakraborti debj...
2 篇 jia benjun
2 篇 ghoshal sanjoy k...
2 篇 zhao youbing
2 篇 erliana cut ita
2 篇 pham hoa
2 篇 hu qihan
2 篇 machado penousal
2 篇 li jinna
2 篇 murphy gail c.

语言

575 篇 英文
67 篇 其他
14 篇 中文

检索条件"任意字段=1st International Conference on the Art, Science and Engineering of Programming, Programming 2017"

共 644 条记录，以下是521-530 订阅

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

详细简洁

排序：

Quantified logic programs, revisited 1

Quantified logic programs, revisited

引用

1st Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2008, collocated with the 24th international conference on Logic programming, ICLP 2008

作者： Ben-Eliyahu-Zohary, Rachel Ben-Gurion University Jerusalem College of Engineering Israel

We consider again quantified logic programs (QLP). QLP is a logic program where a positive number not greater than 1 called dominance is associated with each rule in the program. The intuition is that rules with higher dominance are more plausible or more reliable. Literals in the answer sets of QLPs are also annotated with weights, with the intuition that a literal with a higher weight is more likely to be true. We present three different applications of QLPs: Ontology Matching, Ranking of search results, and Inheritance Networks. We also address the problem of computing answer sets of QLPs. We show that we can compute the answer sets by first using existing state of the art tools for answer set generation, and then applying a polynomial time forward-chaining like algorithm, called the Proof-Rank Algorithm in order to compute the weight of each literal in the answer set. © 2008 Association for Computing Machinery. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Optimal Boolean matrix decomposition: Application to role engineering

Optimal Boolean matrix decomposition: Application to role en...

引用

24th IEEE international conference on Data engineering/ 1st international Workshop on Secure Semantic Web

作者： Lu, Haibing Vaidya, Jaideep Atluri, Vijayalakshmi Rutgers State Univ MSIS Dept 180 Univ Ave Newark NJ 07102 USA

ISBN: (纸本)9781424418367

A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solutions are useful in a number of application domains including text mining, role engineering as well as knowledge discovery. While a binary matrix can be decomposed in several ways, however, certain decompositions better characterize the semantics associated with the original matrix in a succinct but comprehensive way. Indeed, one can find different decompositions optimizing different criteria matching various semantics. In this paper, we first present a number of variants to the optimal Boolean matrix decomposition problem that have pragmatic implications. We then present a unified framework for modeling the optimal binary matrix decomposition and its variants using binary integer programming. Such modeling allows us to directly adopt the huge body of heuristic solutions and tools developed for binary integer programming. Although the proposed solutions are applicable to any domain of interest, for providing more meaningful discussions and results, in this paper, we present the binary matrix decomposition problem in a role engineering context, whose goal is to discover an optimal and correct set of roles from existing permissions, referred to as the role mining problem (RMP). This problem has gained significant interest in recent years as role based access control has become a popular means of enforcing security in databases. We consider several variants of the above basic RMP, including the min-noise RMP, delta-approximate RMP and edge-RMP. Solutions to each of them aid security administrators in specific scenarios. We then model these variants as Boolean matrix decomposition and present efficient heuristics to solve them.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

standing out in a crowd: Selecting attributes for maximum visibility

Standing out in a crowd: Selecting attributes for maximum vi...

引用

24th IEEE international conference on Data engineering/ 1st international Workshop on Secure Semantic Web

作者： Miah, Muhammed Das, Gautam Hristidis, Vagelis Mannila, Heikki Univ Texas Arlington Dept Comp Sci & Engn 416 Yates St Arlington TX 76019 USA Florida Int Univ Sch Comp & Informat Sci Miami FL 33199 USA Univ Helsinki Helsinki Univ Technol HIIT FI-00014 Helsinki Finland

ISBN: (纸本)9781424418367

In recent years, there has been significant interest in development of ranking functions and efficient top-kappa retrieval algorithms to help users in ad-hoe search and retrieval in databases (e.g., buyers searching for products in a catalog). In this paper we focus on a novel and complementary problem: how to guide a seller in selecting the best attributes of a new tuple (e.g., new product) to highlight such that it stands out in the crowd of existing competitive products and is widely visible to the pool of potential buyers. We develop several interesting formulations of this problem. Although these problems are NP-complete, we can give several exact algorithms as well as approximation heuristics that work well in practice. Our exact algorithms are based on Integer programming (IP) formulations of the problems, as well as on adaptations of maximal frequent itemset mining algorithms, while our approximation algorithms are based on greedy heuristics. We conduct a performance study illustrating the benefits of our methods on real as well as synthetic data.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Live wire segmentation tool for osteophyte detection in lumbar spine x-ray images

Live wire segmentation tool for osteophyte detection in lumb...

引用

1st international conference on Emerging Trends in engineering and Technology, ICETET 2008

作者： Seetharaman, Santosh stanley, R. Joe De, Soumya Antani, Sameer Long, Rodney Thoma, George Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO United States Communications Engineering Branch National Library of Medicine Bethesda MD United States

ISBN: (纸本)9780769532677

Computer-assisted vertebra segmentation in x-ray images is a challenging problem. Inter-subject variability and the generally poor contrast of digitized radiograph images contribute to the segmentation difficulty. In this paper, a semi-automated live wire approach is investigated for vertebrae segmentation. The live wire approach integrates initially selected user points with dynamic programming to generate a closed vertebra boundary. In order to assess the degree to which vertebra features are conserved using the live wire technique, convex hull-based features to characterize anterior osteophytes in lumbar vertebrae are determined for live wire and manually segmented vertebrae. Anterior osteophyte discrimination was performed over 405 lumbar vertebrae, 204 abnormal vertebrae with anterior osteophytes and 201 normal vertebrae. A leave-one-out standard back propagation neural network was used for vertebrae segmentation. Experimental results show that manual segmentation yielded slightly better discrimination results than the live wire technique.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Real-time tracking for sensor networks via sdp and gradient method

Real-time tracking for sensor networks via sdp and gradient ...

引用

2008 international conference on Mobile Computing and Networking, MobiCom'08 - 1st ACM international Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, MELT'08

作者： Wang, Zizhuo Ding, Yichuan Department of Management Science and Engineering Stanford University United States

ISBN: (纸本)9781605581897

The sensor tracking problem is an important problem studied in many different fields. But many of those studies use analysis or machine learning method rather than optimization method. Recently, several approaches have been proposed to solve the static version of the tracking problem, the sensor network localization problem, via Semi-definite programming(SDP). In this paper, we analyze a new real-time sensor tracking scheme by combining the SDP approach and the gradient method. We show that this approach provides fast and accurate tracking for network sensors. We also discuss the problem of extracting information from the moving sensors, which could be used to predict their movements.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

A note on the trackability of dynamic sensor networks

A note on the trackability of dynamic sensor networks

引用

2008 international conference on Mobile Computing and Networking, MobiCom'08 - 1st ACM international Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, MELT'08

作者： Ding, Yichuan Department of Management Science and Engineering Stanford University United States

ISBN: (纸本)9781605581897

Since the last decade, Semidefinite programming (SDP) has found its important application in locating the ad hoc wireless sensor networks. By choosing proper decomposition and computation schemes, SDP has been shown very efficient to handle the localization problem. Previous research also has shown that the SDP locates the sensor networks in Rd correctly provided the underlying framework is strong uniquely localizable. In this paper, we consider the localization problem in a more general and practical scenario, that is, the sensors are in movement following a certain trajectory. We show that given the initial position of each sensor and the instantaneous distance data, the dynamic sensor networks can be can be tracked correctly in the near future when the underlying framework is infinitesimal rigid and the trajectories of the sensors are subject to mild conditions. Our result also provides a way to approximate the sensor trajectories using Taylor series based on the distance data.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

SPENK: Adding another level of parallelism on the cell broadband engine 08

SPENK: Adding another level of parallelism on the cell broad...

引用

1st international Forum on Next-Generation Multicore / Manycore Technologies, IFMT'08

作者： Ahmed, Mohamed F. Ammar, Reda A. Rajasekaran, Sanguthevar Department of Computer Science and Engineering University of Connecticut 71 Fairfield Road Unit 2155 Storrs CT 06269-2155 United States

ISBN: (纸本)9781605584072

The Cell Broadband Engine (CBE) is a heterogeneous multi-core processor with unique design properties for high-performance computing. It consists of one Power Processing Element (PPE) and eight Synergistic Processing Elements (SPEs) connected with the Elements Interconnect Network (EIB). It employs novel techniques, such as software managed cache, to hide memory latency and guarantee, by default, maximum utilization for the overall system resources. However, utilization of these facilities requires complex designs and implementations of algorithms to get best performance. In this paper we discuss our micro-threading model realized by a nano-kernel implemented on top of each SPE. SPE's Nano-kernel, or SPENK, employs the micro-threading model to increase the utilization of the CBE resources while simplifying the programming model. Our framework boosted processor's overall performance by a factor of five compared to the current threading model. It allowed us to build a distributed model for the SPEs' tasks management and automated Local storage (LS) management. We further utilized the micro-threading model to build an event based programming model on top of the CBE architecture. We tested our framework on two types of algorithms: (1) Uniform memory access algorithms, such as parallel summation, and (2) Non-uniform or irregular memory access algorithms, specifically tree spanning algorithms. For the first type of algorithms we could obtain up to three times performance improvement and fivefold performance improvement in the second type of algorithms. © ACM 2008.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Developing robot motions by simulated touch sensors

Developing robot motions by simulated touch sensors

引用

1st international conference on Simulation, Modeling, and programming for Autonomous Robots, SIMPAR 2008

作者： Dalla Libera, Fabio Minato, Takashi Ishiguro, Hiroshi Pagello, Enrico Menegatti, Emanuele Faculty of Engineering University of Padua Via Gradenigo 6/a I-35131 Padua Italy Department of Adaptive Machine Systems Osaka University Suita Osaka 565-0871 Japan ERATO Japan Science and Technology Agency Osaka University Suita Osaka 565-0871 Japan

ISBN: (纸本)3540890750

Touch is a very powerful but not much studied communication mean in human-robot interaction. Nonetheless many robots are not equipped with touch sensors, because it is often difficult to place such sensors over the robot surface or simply because the main task of the robot does not require them. We propose an approach that allows developing motions for a real humanoid robot by touching its 3D representation. This simulated counterpart can be equipped with touch sensors not physically available and allows the user to interact with a robot moving in slow-play, which is not possible in real world due to the changes in the dynamics. The developed interface, employing simulated touch sensors, allows inexperienced users to program robot movements in an intuitive way without any modification of the robot's hardware. Thanks to this tool we can also study how humans employ touch for communication. We then report how simulation can be used to study user dependence of touch instructions assuring all the subjects to be in exactly the same conditions. © 2008 Springer Berlin Heidelberg.

关键词： Tactile sensors

来源：评论

学校读者我要写书评

暂无评论

Detecting and Repairing Inconsistencies across Heterogeneous Models

Detecting and Repairing Inconsistencies across Heterogeneous...

引用

international conference on Software Testing, Verification, and Validation, ICst

作者： Dimitrios Kolovos Richard Paige Fiona Polack Department of Computer Science University of York York UK

With the advent of domain specific languages for model engineering, detecting inconsistencies between models is becoming increasingly challenging. Nowadays, it is not uncommon for models participating in the same development process to be captured using different modelling languages and even different modelling technologies. We present a classification of the types of relationships that can arise between models participating in a software development process and outline the types of inconsistencies each relationship can suffer from. From this classification we identify a set of requirements for a generic inconsistency detection and reconciliation mechanism and use a case study to demonstrate how those requirements are implemented in the Epsilon validation language (EVL), a task-specific language developed in the context of the Epsilon GMT component.

关键词： Context modeling Domain specific languages Software testing Computer science programming Prototypes Project management Technology management engineering management Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

Learning objects for programming

Learning objects for programming

引用

1st international conference on Information and Communication Technology and Accessibility, ICTA 2007

作者： Mierlus-Mazilu, Ion Vaduva, Maria Alina Department of Mathematics and Computer Science Technical University of Civil Engineering 122-124 Lacul Tei Bucharest Romania Sirineasa's Primary and Secondary School Sirineasa Valcea Romania

ISBN: (纸本)9789973879141

The Codewitz Learning Objects for programming are interactive visualizations of program code examples or programming tasks. They have been developed to help students to understand programming structures more easily. A Codewitz Learning Object can cover any specific programming problem in any programming language. Learning Objects can also cover the problem-solving logic at the algorithmic level. A learning object focuses on one specific learning goal. Each learning object has to be independent, without links to other objects or resources. Thus for example, server-side generated web pages are not valid as Codewitz Learning Objects. This independence ensures the real reusability of the learning object.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共65页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：