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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,863 篇 会议
570 篇 期刊文献
52 册 图书

馆藏范围

2,485 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,653 篇 工学
- 1,197 篇 计算机科学与技术...
- 998 篇 软件工程
- 352 篇 生物医学工程（可授...
- 308 篇 信息与通信工程
- 271 篇 生物工程
- 226 篇 控制科学与工程
- 176 篇 光学工程
- 155 篇 电子科学与技术（可...
- 150 篇 电气工程
- 105 篇 机械工程
- 88 篇 仪器科学与技术
- 87 篇 化学工程与技术
- 53 篇 动力工程及工程热...
- 42 篇 安全科学与工程
- 39 篇 建筑学
944 篇 理学
- 502 篇 数学
- 299 篇 生物学
- 241 篇 物理学
- 156 篇 统计学（可授理学、...
- 101 篇 系统科学
- 84 篇 化学
458 篇 管理学
- 256 篇 图书情报与档案管...
- 221 篇 管理科学与工程(可...
- 129 篇 工商管理
274 篇 医学
- 244 篇 临床医学
- 217 篇 基础医学(可授医学...
- 152 篇 药学(可授医学、理...
- 83 篇 公共卫生与预防医...
64 篇 法学
- 58 篇 社会学
46 篇 经济学
- 46 篇 应用经济学
42 篇 农学
37 篇 教育学
7 篇 文学
6 篇 艺术学
5 篇 哲学
4 篇 历史学
3 篇 军事学

主题

52 篇 artificial intel...
50 篇 accuracy
44 篇 feature extracti...
40 篇 training
37 篇 computational mo...
37 篇 semantics
36 篇 data mining
35 篇 image segmentati...
32 篇 machine learning
31 篇 predictive model...
31 篇 visualization
28 篇 computer science
26 篇 deep learning
24 篇 support vector m...
22 篇 biological syste...
22 篇 data models
21 篇 informatics
20 篇 real-time system...
20 篇 clustering algor...
19 篇 convolutional ne...

机构

19 篇 national institu...
13 篇 school of comput...
12 篇 school of inform...
11 篇 dept. of compute...
11 篇 university of th...
10 篇 ming young biome...
10 篇 dept. of biomedi...
10 篇 dept. of informa...
10 篇 dept. of biomedi...
9 篇 dept. of informa...
9 篇 dept. of informa...
9 篇 dept. of compute...
8 篇 department of ph...
8 篇 faculty of scien...
8 篇 bahcesehir unive...
8 篇 kirchhoff-instit...
8 篇 department physi...
8 篇 institute of phy...
8 篇 department of ph...
8 篇 department of ph...

作者

15 篇 yoon euisik
13 篇 szalas andrzej
13 篇 maglogiannis ili...
12 篇 chen yu-chih
12 篇 catalyurek umit
11 篇 iliopoulos costa...
11 篇 saltz joel
10 篇 shoeibi afshin
10 篇 alizadehsani roo...
10 篇 dimitrios i. fot...
9 篇 kakarountas atha...
9 篇 nguyen linh anh
9 篇 gunopulos dimitr...
9 篇 kurc tahsin
8 篇 bellos p.
8 篇 bona m.
8 篇 bachacou h.
8 篇 bressler s.
8 篇 malik bader alaz...
8 篇 yen neil y.

语言

2,203 篇 英文
266 篇 其他
8 篇 中文
6 篇 日文
2 篇 朝鲜文
1 篇 德文

检索条件"机构=Dept. of Computer Science and Biomedical informatics"

共 2485 条记录，以下是2131-2140 订阅

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

详细简洁

排序：

Engineering organisation-oriented software

Engineering organisation-oriented software

引用

2nd International Workshop on Interdisciplinary Software Engineering Research, WISER'06, Co-located with the 28th International Conference on Software Engineering, ICSE 2006

作者： Kollingbaum, M. Norman, T. Mehandjiev, N. Brown, K. Dept. Computing Science University of Aberdeen United Kingdom School of Informatics University of Manchester United Kingdom Cork Constraint Comp. Centre Dept. Computer Science University College Cork Ireland

ISBN: (纸本)159593409X

The conventional ways of building software are accepted to produce rigid systems that impede the processes of change typical for contemporary organisations. In this paper, we propose that software can be made more adaptable and tuned to the needs of changing organisations, if it is built using organisation-inspired principles and software structures such as Virtual Organisations, roles and norms. Agent-based software engineering is already using these principles, and we extend the state of the art in that domain by proposing an "open systems" approach, where agents can join and leave Virtual Organisations at will, taking on different roles as needed. Reasoning on organisational roles and norms is facilitated by formalised contract templates and automatic conflict resolution strategies. In terms of overall lifecycle, a system is initiated to satisfy a set of formalised requirements. Agents respond to bids for joining a Virtual Organisation, where each bid is for a contract-based coalition. In this paper, we describe our approach and outline a set of research challenges. Copyright 2006 ACM.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Designing ethical phishing experiments: A study of (ROT13) rOnl query features

Designing ethical phishing experiments: A study of (ROT13) r...

引用

15th International Conference on World Wide Web, WWW'06

作者： Jakobsson, Markus Ratkiewicz, Jacob School of Informatics Indiana University Bloomington IN 47406 United States Dept. of Computer Science Indiana University Bloomington IN 47406 United States

ISBN: (纸本)9781595933232

We study how to design experiments to measure the success rates of phishing attacks that are ethical and accurate, which are two requirements of contradictory forces. Namely, an ethical experiment must not expose the participants to any risk;it should be possible to locally verify by the participants or representatives thereof that this was the case. At the same time, an experiment is accurate if it is possible to argue why its success rate is not an upper or lower bound of that of a real attack - this may be difficult if the ethics considerations make the user perception of the experiment different from the user perception of the attack. We introduce several experimental techniques allowing us to achieve a balance between these two requirements, and demonstrate how to apply these, using a context aware phishing experiment on a popular online auction site which we call "rOnlWe study how to design experiments to measure the success rates of phishing attacks that are ethical and accurate,which are two requirements of contradictory forces. Namely, an ethical experiment must not expose the participants to any risk;it should be possible to locally verify by the participants or representatives thereof that this was the case. At the same time, an experiment is accurate if it is possible to argue why its success rate is not an upper or lower bound of that of a real attack - this may be difficult if the ethics considerations make the user perception of the experiment different from the user perception of the attack. We introduce several experimental techniques allowing us to achieve a balance between these two requirements, and demonstrate how to apply these, using a context aware phishing experiment on a popular online auction site which we call "rOnl". Our experiments exhibit a measured average yield of 11% per collection of unique users. This study was authorized by the Human Subjects Committee at Indiana University (Study #05-10306).. Our experiments exhibit a measured a

关键词： Philosophical aspects

来源：评论

学校读者我要写书评

暂无评论

AlignScope : A visual mining tool for gene team finding with whole genome alignment

引用

4th Asia-Pacific Bioinformatics Conference, APBC 2006

作者： Jin, Hee-Jeong Kim, Hye-Jung Choi, Jeong-Hyeon Cho, Hwan-Gue Dept. of Computer Science and Engineering Pusan National University Korea Republic of School of Informatics Indiana University Bloomington IN 47404 United States

ISBN: (纸本)1860946232

One of the main issues in comparative genomics is the study of chromosomal gene order in one or more related species. Recently identifying sets of orthologous genes in several genomes has become getting important, since a cluster of similar genes helps us to predict the function of unknown genes. For this purpose, the whole genome alignment is usually used to determine horizontal gene transfer, gene duplication, and gene loss between two related genomes. Also it is well known that a novel visualization tool of the whole genome alignment would be very useful for understanding genome organization and the evolutionary process. In this paper, we propose a method for identifying and visualizing the alignment of the whole genome alignment, especially for detecting gene clusters between two aligned genomes. Since the current rigorous algorithm for finding gene clusters has strong and artificial constraints, they are not useful for coping with "noisy" alignments. We developed the system AlignScope to provide a simplified structure for genome alignment at any level, and also to help us to find gene clusters. In this experiment, we have tested AlignScope on several microbial genomes.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

Evaluation of fluid flow through micromachined nanoporous membranes using a custom-built automated testing and data acquisition system

Evaluation of fluid flow through micromachined nanoporous me...

引用

2006 6th IEEE Conference on Nanotechnology, IEEE-NANO 2006

作者： Smith, Ross A. Zorman, Christian A. Fleischman, Aaron J. Roy, Shuvo Dept. of Electrical Engineering and Computer Science Case Western Reserve University Cleveland OH United States Dept. of Biomedical Engineering Cleveland Clinic Cleveland OH United States

ISBN: (纸本)1424400783

Evaluation of fluid flow through micromachined nanoporous membranes using a custom-built automated system designed specifically for nanofluidic applications is presented. The nanoporous membranes are fabricated by a process that combines Si micromachining with sacrificial etching of a nanoscale oxide film. The automated system consists of a precision electronic mass balance, a differential pressure transducer, and a laptop computer with a data acquisition and control card configured to collect data from the balance and differential pressure transducer. Performance of the system was first evaluated for microfluidic applications by measuring the flow of deionized (DI) water through narrow diameter (133 μm) tubing and comparing the measured values to those calculated using theoretical considerations. The system was then used to measure flow rates of DI water through a micromachined nanoporous silicon membrane. The data shows that the system performed within the limits of experimental uncertainty. © 2006 IEEE.

关键词： Nanofluidics

来源：评论

学校读者我要写书评

暂无评论

Visualizing a temporally - Enhanced ontology 06

Visualizing a temporally - Enhanced ontology

引用

AVI '06 - Working Conference on Advanced Visual Interfaces 2006

作者： Akrivi, Katifori Costas, Vassilakis Georgios, Lepouras Ilias, Daradimos Constantin, Halatsis Dept. of Informatics Telcommunications University of Athens University Campus Ilissia Athens 157 84 Greece Dept. of Computer Science and Technology University of Peloponnese End of Karaiskaki 22100 Tripolis Greece

ISBN: (纸本)1595933530

Most ontology development methodologies and tools for ontology management deal with ontology snapshots, i.e. they model and manage only the most recent version of ontologies, which is inadequate for contexts where the history of the ontology is of interest, such as historical archives. This work presents a modeling for entity and relationship timelines in the Protégé tool, complemented with a visualization plug-in, which enables users to examine entity evolution along the timeline. Copyright 2006 ACM.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

An analytic solution to discrete bayesian reinforcement learning 06

An analytic solution to discrete bayesian reinforcement lear...

引用

ICML 2006: 23rd International Conference on Machine Learning

作者： Poupart, Pascal Vlassis, Nikos Hoey, Jesse Regan, Kevin Cheriton School of Computer Science University of Waterloo Waterloo Ont. Canada Informatics Institute University of Amsterdam Amsterdam Netherlands Dept. of Computer Science University of Toronto Toronto Ont. Canada

ISBN: (纸本)1595933832

Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms come short of achieving this goal because the amount of exploration required is often too costly and/or too time consuming for online learning. As a result, RL is mostly used for offline learning in simulated environments. We propose a new algorithm, called BEETLE, for effective online learning that is computationally efficient while minimizing the amount of exploration. We take a Bayesian model-based approach, framing RL as a partially observable Markov decision process. Our two main contributions are the analytical derivation that the optimal value function is the upper envelope of a set of multivariate polynomials, and an efficient point-based value iteration algorithm that exploits this simple parameterization.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Efficient kernel feature extraction for massive data sets 06

Efficient kernel feature extraction for massive data sets

引用

KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

作者： Tsang, Ivor W. Kocsor, Andras Kwok, James T. Dept. of Computer Science Hong Kong University of Science and Technology Clear Water Bay Hong Kong Hong Kong Dept. of Informatics University of Szeged Aradi vrt. 1 H-6720 Szeged Hungary

ISBN: (纸本)1595933395

Maximum margin discriminant analysis (MMDA) was proposed that uses the margin idea for feature extraction. It often outperforms traditional methods like kernel principal component analysis (KPCA) and kernel Fisher discriminant analysis (KFD). However, as in other kernel methods, its time complexity is cubic in the number of training points m, and is thus computationally inefficient on massive data sets. In this paper, we propose an (1 + Ε) 2-approximation algorithm for obtaining the MMDA features by extending the core vector machines. The resultant time complexity is only linear in m, while its space complexity is independent of m. Extensive comparisons with the original MMDA, KPCA, and KFD on a number of large data sets show that the proposed feature extractor can improve classification accuracy, and is also faster than these kernel-based methods by more than an order of magnitude. Copyright 2006 ACM.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Scheduling of tasks with batch-shared I/O on heterogeneous systems 06

Scheduling of tasks with batch-shared I/O on heterogeneous s...

引用

Proceedings of the 20th international conference on Parallel and distributed processing

作者： Nagavijayalakshmi Vydyanathan Gaurav Khanna Umit Catalyurek Tahsin Kurc P. Sadayappan Joel Saltz Dept. of Computer Science and Engineering The Ohio State University Columbus OH Dept. of Biomedical Informatics The Ohio State University Columbus OH and Dept. of Electrical and Computer Engineering The Ohio State University Columbus OH Dept. of Biomedical Informatics The Ohio State University Columbus OH Dept. of Computer Science and Engineering The Ohio State University Columbus OH and Dept. of Biomedical Informatics The Ohio State University Columbus OH

ISBN: (纸本)9781424400546

This paper proposes a novel strategy that uses hypergraph partitioning and K-way iterative mapping-refinement heuristics for scheduling a batch of data-intensive tasks with batch-shared I/O behavior on heterogeneous collections of storage and compute clusters. The strategy formulates file sharing among tasks as a hypergraph to minimize the I/O overheads due to duplicate file transfers and employs a K-way iterative mapping-refinement scheme to adapt to the heterogeneity of compute clusters and storage networks in the system. We evaluate the proposed approach through real experiments and simulations on application scenarios from two application domains; satellite data processing and biomedical imaging. Our experimental results show that our approach can achieve significant performance improvement over algorithms such as HPS, Shortest Job First, MinMin, MaxMin and Sufferage for workloads with high degree of shared I/O among tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An extensible global address space framework with decoupled task and data abstractions 20

An extensible global address space framework with decoupled ...

引用

20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006

作者： Krishnamoorthy, Sriram Catalyurek, Umit Nieplocha, Jarek Rountev, Atanas Sadayappan, P. Dept. of Computer Science and Engineering Ohio State University Columbus OH 43210 United States Dept. of Biomedical Informatics Ohio State University Columbus OH 43210 United States Computational Sciences and Mathematics Pacific Northwest National Laboratory Richland WA 99352 United States

ISBN: (纸本)1424400546

Although message passing using MPI is the dominant model for parallel programming today, the significant effort required to develop high-performance MPI applications has prompted the development of several parallel programming models that are more convenient. Programming models such as Co-Array Fortran, Global Arrays, Titanium, and UPC provide a more convenient global view of the data, but face significant challenges in delivering high performance over a range of applications. It is particularly challenging to achieve high performance using global-address-space languages for unstructured applications with irregular data structures. In this paper, we describe a global-address-space parallel programming framework with decoupled task and data abstractions. The framework centers around the use of task pools, where tasks specify operands in a distributed, globally addressable pool of data chunks. The data chunks can be addressed in a logical multi-dimensional "tuple" space, and are distributed among the nodes of the system. Locality-aware load balancing of tasks in the task pool is achieved through judicious mapping via hyper-graph partitioning, as well as dynamic task/data migration. The framework implements a transparent interface for out-of-core data, so that explicit orchestration of movement of data between disks and memory is not required of the programmer. The use of the framework for implementation of parallel blocksparse tensor computations in the context of a quantum chemistry application is illustrated. © 2006 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Distinguishing lesions from posterior acoustic shadowing in breast ultrasound via non-linear dimensionality reduction

Distinguishing lesions from posterior acoustic shadowing in ...

引用

28th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS'06

作者： Madabhushi, Anant Peng, Yang Rosen, Mark Weinstein, Susan Dept. of Biomedical Engineering Rutgers University Piscataway NJ 08854 United States Dept. of Computer Science Rutgers University Piscataway NJ 08854 United States Dept. of Radiology University of Pennsylvania Philadelphia PA 19104 United States

ISBN: (纸本)1424400325

Breast ultrasound (US) in conjunction with digital mammography has come to be regarded as the gold standard for breast cancer diagnosis. While breast US has certain advantages over digital mammography, it suffers from image artifacts such as posterior acoustic shadowing (PAS), presence of which often obfuscates lesion margins. Since classification of lesions as either malignant or benign is largely dictated by lesion's shape and margin characteristics, it is important to distinguish lesion area from PAS. This paper represents the first attempt to extract and identify those image features that can help distinguish between lesion and PAS. Our methodology comprises of extracting over 100 statistical, gradient, and Gabor features at multiple scales and orientations at every pixel in the breast US image. Adaboost, a powerful feature ensemble technique is used to discriminate between lesions and PAS by combining the different image features. A non-linear dimensionality reduction method called Graph Embedding is then used to visualize separation and inter-class dependencies between lesions and PAS in a lower dimensional space. Results of quantitative evaluation on a database of 45 breast US images indicate that our methodology allows for greater discriminability between the lesion and PAS classes compared to that achievable by any individual image texture or intensity feature. © 2006 IEEE.

关键词： Ultrasonic imaging

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共249页 << < 210 211 212 213 214 215 216 217 218 219 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：