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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,387 篇 会议
1,230 篇 期刊文献
40 册 图书

馆藏范围

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

日期分布

学科分类号

1,610 篇 工学
- 1,204 篇 计算机科学与技术...
- 979 篇 软件工程
- 347 篇 信息与通信工程
- 234 篇 生物工程
- 233 篇 控制科学与工程
- 175 篇 生物医学工程（可授...
- 143 篇 电气工程
- 139 篇 光学工程
- 116 篇 电子科学与技术（可...
- 87 篇 机械工程
- 67 篇 化学工程与技术
- 64 篇 材料科学与工程（可...
- 60 篇 仪器科学与技术
- 59 篇 动力工程及工程热...
- 53 篇 建筑学
951 篇 理学
- 440 篇 数学
- 315 篇 物理学
- 269 篇 生物学
- 165 篇 统计学（可授理学、...
- 86 篇 系统科学
- 76 篇 化学
453 篇 管理学
- 246 篇 管理科学与工程(可...
- 215 篇 图书情报与档案管...
- 130 篇 工商管理
206 篇 医学
- 180 篇 临床医学
- 162 篇 基础医学(可授医学...
- 92 篇 药学(可授医学、理...
- 84 篇 公共卫生与预防医...
105 篇 法学
- 89 篇 社会学
58 篇 经济学
- 58 篇 应用经济学
54 篇 教育学
40 篇 农学
8 篇 文学
8 篇 艺术学
4 篇 军事学
1 篇 哲学

主题

63 篇 machine learning
55 篇 training
52 篇 accuracy
48 篇 deep learning
45 篇 computational mo...
44 篇 artificial intel...
36 篇 feature extracti...
35 篇 security
35 篇 data models
34 篇 analytical model...
33 篇 internet of thin...
33 篇 predictive model...
31 篇 educational inst...
31 篇 cloud computing
29 篇 computer archite...
29 篇 real-time system...
28 篇 convolutional ne...
26 篇 visualization
25 篇 covid-19
25 篇 informatics

机构

42 篇 department for p...
41 篇 department of ph...
41 篇 faculty of scien...
41 篇 departamento de ...
41 篇 department of ph...
41 篇 yerevan physics ...
41 篇 institute of phy...
40 篇 kirchhoff-instit...
40 篇 graduate school ...
39 篇 school of comput...
39 篇 dipartimento di ...
39 篇 fakultät für phy...
39 篇 institute of phy...
38 篇 department of ph...
38 篇 department of ph...
38 篇 department of ph...
38 篇 lehrstuhl für ex...
38 篇 west university ...
38 篇 institut für ast...
37 篇 faculté des scie...

作者

32 篇 c. alexa
32 篇 j. m. izen
32 篇 s. veneziano
32 篇 g. bella
32 篇 j. strandberg
32 篇 d. calvet
32 篇 c. amelung
32 篇 n. orlando
32 篇 h. a. gordon
32 篇 y. tayalati
32 篇 g. spigo
32 篇 v. chiarella
32 篇 f. siegert
32 篇 a. c. könig
32 篇 m. klein
32 篇 r. ströhmer
32 篇 h. sakamoto
32 篇 g. h. a. viehhau...
32 篇 s. nektarijevic
32 篇 m. rijssenbeek

语言

2,454 篇 英文
185 篇 其他
17 篇 中文
3 篇 德文
2 篇 日文
1 篇 西班牙文
1 篇 斯洛文尼亚文

检索条件"机构=School of Computing and Informatics Technology"

共 2657 条记录，以下是2031-2040 订阅

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

详细简洁

排序：

Efficient learning of user conformity on review score 8

Efficient learning of user conformity on review score

引用

8th International Conference on Social computing, Behavioral-Cultural Modeling, and Prediction, SBP 2015

作者： Saito, Kazumi Ohara, Kouzou Kimura, Masahir Motoda, Hiroshi School of Administration and Informatics University of Shizuoka Shizuoka Japan Department of Integrated Information Technology Aoyama Gakuin University Kanagawa Japan Department of Electronics and Informatics Ryukoku University Shiga Japan Institute of Scientific and Industrial Research Osaka University Osaka Japan School of Computing and Information Systems University of Tasmania Hobart Australia

ISBN: (纸本)9783319162676

We propose a simple and efficient method that learns and assesses the conformity of each user of an online review system from the observed review score record. The model we use is a modified Voter model that takes account of the conformity of each user. Conformity is learnable quite efficiently with a few tens of iterations by maximizing the log-likelihood given the observed data. The proposed method was evaluated and confirmed effective by two review datasets. It could identify both high and low conformity users. Users with high conformity are not necessarily early adopters. Their scores are influential to drive the consensus score. The user ranking of conformity was compared with Page Rank and HITS in which user network was roughly approximated by the directed graph induced by the observed data. The proposed method gives more interpretable ranking, and the global property of high conformity users was identified. © Springer International Publishing Switzerland 2015.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Information technology and computer science programs: How do we relate? 15

Information technology and computer science programs: How do...

引用

16th Annual ACM Conference on Information technology Education, SIGITE 2015

作者： MacKellar, Bonnie Sabin, Mihaela Hislop, Gregory Settle, Amber Div. of Computer Science Math and Science St John's University QueensNY United States Computing Technology University of New Hampshire ManchesterNH03101 United States College of Computing and Informatics Drexel University PhiladelphiaPA United States School of Computing DePaul University ChicagoIL60604 United States

ISBN: (纸本)9781450338356

In this panel session, the relationship between computer science programs and information technology programs at universities that house both will be explored. People outside the computing disciplines often find the distinction between these programs confusing. The panelists, who have experience with both types of program, will discuss strategies for differentiating the programs in the eyes of administrators, for advising students into the correct program, and for maintaining focus and excellence in both computer science and information technology programs.

关键词： Engineering education

来源：评论

学校读者我要写书评

暂无评论

Tight analysis of priority queuing for egress traffic

Tight analysis of priority queuing for egress traffic

引用

作者： Kawahara, Jun Kobayashi, Koji M. Maeda, Tomotaka Graduate School of Information Science Nara Institute of Science and Technology 8916-5 Takayama Ikoma Nara6300192 Japan National Institute of Informatics Japan Academic Center for Computing and Media Studies Kyoto University Japan

Recently, the problems of evaluating performances of switches and routers have been formulated as online problems, and a great amount of results have been presented. In this paper, we focus on managing outgoing packets (called egress traffic) on switches that support Quality of Service (QoS), and analyze the performance of one of the most fundamental scheduling policies Priority Queuing (PQ) using competitive analysis. We formulate the problem of managing egress queues as follows: An output interface is equipped with m queues, each of which has a buffer of size B. The size of a packet is unit, and each buffer can store up to B packets simultaneously. Each packet is associated with one of m priority values αj (1 12m, α1=1, and αm=α and the task of an online algorithm is to select one of m queues at each scheduling step. The purpose of this problem is to maximize the sum of the values of the scheduled packets. For any B and any m, we show that the competitive ratio of PQ is exactly 2-minx[1,m-1]{αx+1αj}. That is, we conduct a complete analysis of the performance of PQ using worst case analysis. Moreover, we show that no deterministic online algorithm can have a competitive ratio smaller than 1+α3+α2+αα4+4α3+3α2+4α+1. © 2015 Elsevier B.V..

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Leveraging and integrating Eastern and Western insights for human engagement studies in HCI 33

Leveraging and integrating Eastern and Western insights for ...

引用

33rd Annual CHI Conference on Human Factors in computing Systems, CHI EA 2015

作者： Law, Effie Lai-Chong Silpasuwanchai, Chaklam Ren, Xiangshi Bardzell, Jeffrey Clemmensen, Torkil Liu, Yan Department of Computer Science University of Leicester LeicesterLEI 7RH United Kingdom School of Information Kochi University of Technology Kami-Kochi Japan Centre for Human Computer Interaction Kochi University of Technology Kami-Kochi Japan School of Informatics and Computing Indiana University United States Dept. of IT Management Copenhagen Business School Denmark Department of Computing Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781450331463

Human engagement is at the heart of every interactive technology. However, a concrete framework for synergizing the capabilities of humans and technologies to allow fully engaging interactions to happen is yet to be developed. We posit that such a framework should be grounded in a deeper understanding of human nature (e.g., mind-body relations), which in the field of HCI has primarily been built upon the Western philosophies. There are scattered, underexplored Eastern philosophies (e.g., Yijing, Zen) that may provide new lens and tools to analyze how humans interact with resources in their environments, including technological artefacts. Discussions of leveraging and possibly integrating Eastern and Western insights for human engagement studies will be an exciting and a radical forum for the HCI community.

关键词： Philosophical aspects

来源：评论

学校读者我要写书评

暂无评论

Biomedical event trigger detection by dependency-based word embedding

Biomedical event trigger detection by dependency-based word ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jian Wang Jianhai Zhang Yuan An Hongfei Lin Zhihao Yang Yijia Zhang Yuanyuan Sun School of Computer Science and Technology Dalian University of Technology Dalian China College of Computing & Informatics Drexel University Philadelphia USA

ISBN: (纸本)9781467368001

Biomedical events can reveal crucial processes in biomedical research. As an important step in biomedical event extraction, biomedical event trigger detection has become a research hotspot. Traditional machine learning methods, which aim to manually design powerful features fed to the classifiers, greatly depend on the understanding of the specific task. In this paper, we propose an approach to automatically learn good features from raw input without manual intervention. The approach is based on dependency-based word embedding and first learns dependency-based word embedding from all available PubMed abstracts. The word embedding contains rich functional and semantic information. Then neural network architecture is used to learn better feature representation based on raw dependency-based word embedding. Meanwhile, we dynamically adjust the embedding while training for adapting to the trigger classification task. Finally, softmax classifier labels the examples by specific trigger class using the features learned by the model. The experimental results show that our approach achieves a micro F1 score of 78.27% and a macro F1 score of 76.94% in significant trigger classes, and performs better than baseline methods. In addition, we can achieve the semantic distributed representation of every trigger word.

关键词： Biology

来源：评论

学校读者我要写书评

暂无评论

Adaptive Recursive Doubling Algorithm for Collective Communication

Adaptive Recursive Doubling Algorithm for Collective Communi...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Omer Arap Martin Swany Geoffrey Brown Bryce Himebaugh Center for Research in Extreme Scale Technology Indiana University Bloomington IN School of Informatics and Computing Indiana University Bloomington IN

ISBN: (纸本)9781467376853

Process arrival times at MPI collective operations differ significantly. Addressing this fact with special handling for popular collective communication algorithms can yield performance improvements. The recursive doubling algorithm is one of the most efficient techniques for implementing collectives in MPI, especially for short messages and when the number of participating processes is a power of two. In the recursive doubling algorithm, all the processes must complete a given step before the algorithm continues to the next step. In this paper, we present a recursive doubling algorithm that makes use of available data and removes the requirement for each process to arrive at each step before proceeding. Our approach makes use of the multicast feature of the underlying network and progress tagging of messages, describing the currently available partial results. Our approach could be implemented in any parallel execution environment that supports multicasting. Our prototype implementation is based upon a network interface card with an FPGA, the Net FPGA. The Net FPGA provides hardware level programmability to offload processing, precise and controlled timing for accounting for packet and algorithm behavior, allowing classification of skew scenarios. Our algorithm provides up to 10% saving in synchronization delay in the presence of skew and up to 37% saving in number of messages generated, and up to 32% saving in reduction operations performed in MPI Allreduce.

关键词： Hardware Synchronization Multicast communication Clustering algorithms Tagging Delays Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Virtual Standardized Patient as a Training Tool for Mild TBI Screening

Virtual Standardized Patient as a Training Tool for Mild TBI...

引用

IEEE International Conference on Healthcare informatics (ICHI)

作者： Raghavi Sakpal Dale-Marie Wilson Christine Elnitsky Katherine Taber Timothy W. Brearly Institute of Technology University of Washington Tacoma College of Computing & Informatics University of North Carolina at Charlotte School of Nursing University of North Carolina at Charlotte Mid-Atlantic Mental Illness Research Education and Clinical Center W.G. (Bill) Hefner VAMC Salisbury NC Mid-Atlantic Mental Illness Res. W.G. (Bill) Hefner VAMC Salisbury NC USA

ISBN: (纸本)9781509061181

The Veterans Health Administration (VHA) has recognized Traumatic Brain Injury (TBI) as a priority condition for healthcare services. However, diagnosis rates of TBI in the VA TBI screening tool (VATBIST) vary quite widely across the Veterans Affairs (VA) facilities. Factors that make this diagnostic decision difficult include the reliance on patient self-report, the symptom overlap of mild TBI with other conditions (especially behavioral health and pain), and the need for nuanced diagnostic understanding by the clinician. With the objective of standardizing the TBI screening process, a Virtual Standardized Patient (VSP) portraying an OEF (Operation Enduring Freedom) veteran with mild TBI was proposed as a training tool. This paper presents the design and development of the VSP and describes the results from the preliminary study conducted to validate the usability of a VSP for training within this context.

关键词： Brain injuries Training History Testing

来源：评论

学校读者我要写书评

暂无评论

SmartGuide: Towards single-image building localization with smartphone 15

SmartGuide: Towards single-image building localization with ...

引用

16th ACM International Symposium on Mobile Ad Hoc Networking and computing, MobiHoc 2015

作者： Xiong, Xi Yang, Zheng Shangguan, Longfei Fei, Yun Stojmenovic, Milos Liu, Yunhao School of Software TNList Tsinghua University China CSE Hong Kong University of Science and Technology Hong Kong Hong Kong Department of Computer Science Columbia University New York United States Department of Informatics and Computing Singidunum University Serbia

ISBN: (纸本)9781450334891

We introduce SmartGuide, a light-weighted and efficient approach to localize and recognize a distant unknown building. Our approach relies on shooting only a single photo of a target building via a smartphone and a local 2D Google map. SmartGuide first extracts a partial top view contour of a building from its side-view photo by applying vanishing point and the Manhattan World Assumption, and then fetches a candidate building set from a local 2D Google map based on smartphone’s GPS readings. Partial top view shape, orientation and distance relative to the camera are used as input parameters in a probability model, which adversely recognizes the best candidate building in the local map. Our model is developed based on kernel density estimation that helps reduce noise in the smartphone sensors, such as GPS readings and camera ray direction reported by noisy accelerometer and compass. Experimental results demonstrate that our approach recognizes buildings ranging from 20m to 520m and achieves 92.7% accuracy in downtown areas where the Manhattan World Assumption is applicable. In addition, the processing time is no more than 6 seconds for 87% of cases. Compared with existing building localization schemes, SmartGuide offers numerous advantages. Our method avoids taking multiple photos, intricate 3D reconstruction or any initial deployment cost of database construction, making it faster and less labor-intensive than existing solutions. Copyright © 2015 ACM.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

A tight approximation bound for the stable marriage problem with restricted ties

A tight approximation bound for the stable marriage problem ...

引用

18th International Workshop on ApproximationAlgorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015

作者： Huang, Chien-Chung Iwama, Kazuo Miyazaki, Shuichi Yanagisawa, Hiroki Department of Computer Science and Engineering Chalmers University of Technology Göteborg Sweden School of Informatics Kyoto University Kyoto Japan Academic Center for Computing and Media Studies Kyoto University Kyoto Japan IBM Research - Tokyo IBM Japan Tokyo Japan

ISBN: (纸本)9783939897897

The problem of finding a maximum cardinality stable matching in the presence of ties and unacceptable partners, called MAX SMTI, is a well-studied NP-hard problem. The MAX SMTI is NP-hard even for highly restricted instances where (i) ties appear only in women's preference lists and (ii) each tie appears at the end of each woman's preference list. The current best lower bounds on the approximation ratio for this variant are 1.1052 unless P=NP and 1.25 under the unique games conjecture, while the current best upper bound is 1.4616. In this paper, we improve the upper bound to 1.25, which matches the lower bound under the unique games conjecture. Note that this is the first special case of the MAX SMTI where the tight approximation bound is obtained. The improved ratio is achieved via a new analysis technique, which avoids the complicated case-by-case analysis used in earlier studies. As a by-product of our analysis, we show that the integrality gap of natural IP and LP formulations for this variant is 1.25. We also show that the unrestricted MAX SMTI cannot be approximated with less than 1.5 unless the approximation ratio of a certain special case of the minimum maximal matching problem can be improved. © Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, and Hiroki Yanagisawa.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Inferring an indeterminate string from a prefix graph

Inferring an indeterminate string from a prefix graph

引用

作者： Alatabbi, Ali Sohel Rahman, M. Smyth, W.F. Department of Informatics King's College London United Kingdom Department of Computer Science and Engineering Bangladesh University of Engineering and Science Bangladesh Algorithms Research Group Department of Computing and Software McMaster University Canada School of Engineering and Information Technology Murdoch University Australia

An indeterminate string (or, more simply, just a string) x=x[1.n] on an alphabet Σ is a sequence of nonempty subsets of Σ. We say that x[i1] and x[i2] match (written x[i1]≈x[i2]) if and only if x[i1]∩x[i2]∗. A feasible array is an array y=y[1.n] of integers such that y[1]=n and for every i∈2.n, y[i]∈0.n-i+1. A prefix table of a string x is an array π=π[1.n] of integers such that, for every i∈1.n, π[i]=j if and only if x[i.i+j-1] is the longest substring at position i of x that matches a prefix of x. It is known from [6] that every feasible array is a prefix table of some indeterminate string. A prefix graph P=Py is a labelled simple graph whose structure is determined by a feasible array y. In this paper we show, given a feasible array y, how to use Py to construct a lexicographically least indeterminate string on a minimum alphabet whose prefix table π=y. © 2014 Elsevier B.V. All rights reserved.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共266页 << < 200 201 202 203 204 205 206 207 208 209 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：