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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

324 篇 会议
10 篇 期刊文献

馆藏范围

334 篇 电子文献
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

语言

334 篇 英文

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

共 334 条记录，以下是101-110 订阅

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

详细简洁

排序：

Session details: theme: Information systems: SFECS - Sustainability of fog/edge computing systems track 19

Session details: Theme: Information systems: SFECS - Sustain...

引用

proceedings of the 34th acm/sigapp symposium on applied computing

作者： Christian Esposito Florin Pop Chang Choi University of Napoli "Federico II" Italy University Politehnica of Bucharest and National Institute of Research and Development in Informatics Romania Chosun University Rep. of Korea

ISBN: (纸本)9781450359337

Fog/Edge computing paradigms are widely used in enterprises to address the emerging challenges of big data analysis, because of their underlying scalable, flexible and distributed data management schemes. the data centers in the Clouds are facing great challenges on the burden of the consequent increasing the amount of data to be man- aged and the additional requirements of location awareness and low latency at the edge of network necessary by smart cites and factories. these are the reasons why a centralized model cannot be an efficient solution for generated or required data by the IoT devices in those applications and there is the progressive shift towards fog nodes and smarted edge nodes mediating between the cloud and the IoT devices. the Fog/Edge computing paradigm is a decentralized model that transfers a part of low computing data analysis from the cloud to the intermediate (fog) nodes or the edges, performing only high computing tasks in the cloud. this new approach tries to minimize the three factors that negatively compromise the effective and efficient application of the Cloud computing to smart cities and factories, or similar application domains: the network bandwidth usage, decentralization of the data processing tasks and reduced response latency for clients (IoT devices). Fog/Edge computing is a hierarchical approach where the overall infrastructure is structured in multiple layers, each responsible of offering a good coordination and data management to the nodes at the lower layer. the lowest layer is usually composed of sensors and/or actuators that measure and/or control the environment or a given business process, implemented as mobile devices that are running a sensing/controlling application. In this case, combining Sustainable computing with Fog and Edge computing represents a new approach for increasing quality-of- service and efficiency of the system, creating the capability to present temporal and geo-coded information, and increasing inno

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deeper networks for pavement crack detection 34

Deeper networks for pavement crack detection

引用

34th International symposium on Automation and Robotics in Construction, ISARC 2017

作者： Pauly, Leo Peel, Harriet Luo, Shan Hogg, David Fuentes, Raul School of Civil Engineering University of Leeds United Kingdom School of Computing University of Leeds United Kingdom

Pavement crack detection using computer vision techniques has been studied widely over the past several years. However, these techniques have faced several limitations when applied to real world situations due to for example changes of lightning conditions or variation in textures. But the recent advancements in the field of artificial neural networks, especially in deep learning, have paved a new way for applying computer vision methods to pavement crack detection. Even though deep learning has been used before for crack detection, the network used is rather shallow when compared to the current networks used for other applications. In this paper we demonstrate the effectiveness of using deeper networks in computer vision based pavement crack detection for improved accuracy. We also show how variations in location of training and testing datasets affect the performance of the deep learning based pavement crack detection method.

关键词： Crack detection

来源：评论

学校读者我要写书评

暂无评论

Japanese HCI symposium: Emerging Japanese HCI research collection

Japanese HCI symposium: Emerging Japanese HCI research colle...

引用

34th Annual CHI Conference on Human Factors in computing Systems, CHI EA 2016

作者： Matsumura, Kohei Ogata, Masa Sakaguchi, Saki Ijiri, Takashi Nishida, Takeshi Kato, Jun Nakamura, Hiromi Sakamoto, Daisuke Kitamura, Yoshifumi Ritsumeikan University Japan Keio University Japan Kansai University Japan Kobe University Japan National Institute of Advanced Industrial Science and Technology Japan University of Tokyo Japan Tohoku University Japan

ISBN: (纸本)9781450340823

this symposium showcases the latest work from Japan on interactive systems and user interfaces that address under-explored problems and demonstrate unique approaches. In addition to circulating ideas and sharing a vision of future research in human-computer interaction, this symposium aims to foster social networks among young researchers and students and create a fresh research community. © 2016 Authors.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Chinese CHI 2016 symposium

Chinese CHI 2016 Symposium

引用

34th Annual CHI Conference on Human Factors in computing Systems, CHI EA 2016

作者： Bi, Xiaojun Xiao, Lu Tian, Feng Ding, Xianghua Kow, Yong Ming Google Inc. Mountain ViewCA94043 United States University of Western Ontario 1151 Richmond St. LondonONN6A3B7 Canada Chinese Academy of Sciences 4# South Fourth Street Zhong Guan Cun Beijing100190 China Fudan University 825 Zhangheng Road Shanghai201203 China City University of Hong Kong 18 Tat Hong Ave. Kowloon Tong Hong Kong

ISBN: (纸本)9781450340823

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Update on Nf = 3 finite temperature QCD phase structure with Wilson-Clover fermion action 34

Update on Nf = 3 finite temperature QCD phase structure with...

引用

34th Annual International symposium on Lattice Field theory, LATTICE 2016

作者： Takeda, Shinji Jin, Xiao-Yong Kuramashi, Yoshinobu Nakamura, Yoshifumi Ukawa, Akira Institute of Physics Kanazawa University Kanazawa920-1192 Japan RIKEN Advanced Institute for Computational Science Kobe Hyogo650-0047 Japan Argonne Leadership Computing Facility Argonne National Laboratory ArgonneIL60439 United States Graduate School of Pure and Applied Sciences University of Tsukuba Tsukuba Ibaraki305-8571 Japan Center for Computational Sciences University of Tsukuba Tsukuba Ibaraki305-8577 Japan Graduate School of System Informatics Department of Computational Sciences Kobe University Kobe Hyogo657-8501 Japan

We present an update of the finite temperature phase structure analysis for three flavor QCD. In the study the Iwasaki gauge action and non-perturvatively O(a) improved Wilson-Clover fermion action are employed. We discuss finite size scaling analysis including mixings of magnetization- like and energy-like observables. Preliminary results are shown of the continuum limit of the critical point using newly generated data at Nτ = 8;10, including estimates of the critical pseudo- scalar meson mass and critical temperature. © Copyright owned by the author(s).

关键词： Phase structure

来源：评论

学校读者我要写书评

暂无评论

Progress report on staggered multigrid 34

Progress report on staggered multigrid

引用

34th Annual International symposium on Lattice Field theory, LATTICE 2016

作者： Brower, Richard C. Clark, M.A. Strelchenko, Alexei Weinberg, Evan S. Boston University BostonMA02215 United States NVIDIA Corporation Santa ClaraCA95050 United States Scientific Computing Division Fermilab BataviaIL60510-5011 United States

Multigrid methods have become the optimal solvers for Lattice QCD, first for the Wilson-clover discrete representation [1] and more recently for the domain wall formulation [2]. However, at present, the ensembles with the largest lattices use a third discretization, staggered. At the physical pion mass, propagator inversions with the staggered operator require O(10;000) iterations using the Conjugate Gradient algorithm. the staggered discretization raises new challenges for a multigrid implementation. It is a first order discretization which in four-dimensions corresponds to four copies of a Dirac fermion in the continuum. Here we report on our investigation into a new geometric adaptive multigrid for staggered fermions both for the normal equations and for a first order projection based on a novel blocking scheme stabilized by a second order gauged Laplacian. Current numerical tests, applied to the two-dimensional staggered representation of the two-flavor Schwinger model, are promising. Further improvements are under way as well as generalizations and tests for four-dimensional QCD using multigrid preconditioned staggered solvers in the QUDA library [3] for multi-GPU architectures. © Copyright owned by the author(s).

关键词： Lattice theory

来源：评论

学校读者我要写书评

暂无评论

Improve general contextual SLIM recommendation algorithms by factorizing contexts 15

Improve general contextual SLIM recommendation algorithms by...

引用

30th Annual acm symposium on applied computing, SAC 2015

作者： Zheng, Yong School of Computing DePaul University ChicagoIL United States

ISBN: (纸本)9781450331968

Context-aware recommender systems (CARS) emerged during recent years in order to adapt to users' preferences in different contextual situations. For example, users may choose different movies if they are going to see movies with their partners rather than with kids. the motivation behind is that users' preferences on items are always changing from contexts to contexts. Copyright 2015 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

proceedings of the acm symposium on applied computing

Proceedings of the ACM Symposium on Applied Computing

引用

30th Annual acm symposium on applied computing, SAC 2015

ISBN: (纸本)9781450331968

the proceedings contain 367 papers. the topics discussed include: inference of disease-specific gene interaction network using a Bayesian network learned by genetic algorithm;P-SaMI: a data-flow pattern to perform massively-parallel molecular docking experiments using a fully-flexible receptor model;a new approach to biometric recognition based on hand geometry;shape description based on bag of salience points;OR-PCA with dynamic feature selection for robust background subtraction;compact and discriminative approach for encoding spatial-relationship of visual words;an architecture of recommender system for scientific paper;evolving decision-tree induction algorithms with a multi-objective hyper-heuristic;collective preferences in evolutionary multi-objective optimization: techniques and potential contributions of collective intelligence;color image quantization using interactive genetic algorithm;and benchmarking motion sensing devices for rehabilitative gaming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Safety-Liveness Exclusion in Distributed computing 15

Safety-Liveness Exclusion in Distributed Computing

引用

34th Annual acm symposium on Principles of Distributed computing (PODC)

作者： Bushkov, Victor Guerraoui, Rachid Ecole Polytech Fed Lausanne IC LPD Lausanne Switzerland

ISBN: (纸本)9781450336178

the history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system basically says that we cannot devise an algorithm that deterministically ensures consensus agreement and validity (i.e., safety) on the one hand, and consensus wait-freedom (i.e., liveness) on the other hand. the motivation of this work is to study the extent to which safety and liveness properties inherently exclude each other. More specifically, we ask, given any safety property S, whether we can determine the strongest (resp. weakest) liveness property that can (resp. cannot) be achieved with S. We show that, maybe surprisingly, the answers to these safety-liveness exclusion questions are in general negative. this has several ramifications in various distributed computing contexts. In the context of consensus for example, this means that it is impossible to determine the strongest (resp. the weakest) liveness property that can (resp. cannot) be ensured with linearizability. However, we present a way to circumvent these impossibilities and answer positively the safety-liveness question by considering a restricted form of liveness. We consider a definition that gathers generalized forms of obstruction-freedom and lock-freedom while enabling to determine the strongest (resp. weakest) liveness property that can (resp. cannot) be implemented in the context of consensus and transactional memory.

关键词： Concurrency Safety Liveness Impossibility Results Consensus Transactional Memory

来源：评论

学校读者我要写书评

暂无评论

Algebraic Methods in the Congested Clique 15

Algebraic Methods in the Congested Clique

引用

34th Annual acm symposium on Principles of Distributed computing (PODC)

作者： Censor-Hillel, Keren Kaski, Petteri Korhonen, Janne H. Lenzen, Christoph Paz, Ami Suomela, Jukka Technion Haifa Israel Helsinki Inst Informat Technol Helsinki Finland Aalto Univ Espoo Finland Univ Helsinki Helsinki Finland MPI Informat Saarbrucken Germany

ISBN: (纸本)9781450336178

In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n(1-2/omega)) round matrix multiplication algorithm, where omega < 2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. the highlight results include: - triangle and 4-cycle counting in O(n(0.158)) rounds, improving upon the O(n(1/3)) triangle detection algorithm of Dolev et al. [DISC 2012], - a (1+o(1))-approximation of all-pairs shortest paths in O(n(0.158)) rounds, improving upon the <(O)over tilde>(n(1/2))-round (2+o(1))-approximation algorithm of Nanongkai [STOC 2014], and - computing the girth in O(n(0.158)) rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.

关键词： Distributed computing congested clique model lower bounds matrix multiplication subgraph detection distance computation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共34页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：