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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,400 篇 会议
95 册 图书
73 篇 期刊文献

馆藏范围

3,566 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

1,909 篇 工学
- 1,558 篇 计算机科学与技术...
- 972 篇 软件工程
- 339 篇 信息与通信工程
- 212 篇 电气工程
- 178 篇 控制科学与工程
- 138 篇 机械工程
- 102 篇 网络空间安全
- 98 篇 仪器科学与技术
- 96 篇 电子科学与技术（可...
- 68 篇 生物工程
- 68 篇 安全科学与工程
- 66 篇 动力工程及工程热...
- 56 篇 交通运输工程
- 40 篇 建筑学
- 37 篇 环境科学与工程（可...
- 35 篇 生物医学工程（可授...
- 29 篇 光学工程
569 篇 管理学
- 459 篇 管理科学与工程(可...
- 159 篇 工商管理
- 133 篇 图书情报与档案管...
475 篇 理学
- 302 篇 数学
- 80 篇 生物学
- 71 篇 系统科学
- 68 篇 统计学（可授理学、...
- 57 篇 物理学
- 31 篇 化学
85 篇 经济学
- 83 篇 应用经济学
61 篇 法学
- 42 篇 社会学
41 篇 医学
- 35 篇 临床医学
- 32 篇 基础医学(可授医学...
18 篇 农学
15 篇 军事学
12 篇 教育学
9 篇 文学
6 篇 艺术学

主题

274 篇 distributed comp...
237 篇 application soft...
229 篇 computer science
193 篇 computational mo...
142 篇 computer archite...
129 篇 business
122 篇 cloud computing
112 篇 grid computing
105 篇 concurrent compu...
105 篇 resource managem...
85 篇 quality of servi...
85 篇 processor schedu...
84 篇 parallel process...
79 篇 computer network...
77 篇 servers
77 篇 web services
75 篇 middleware
72 篇 costs
71 篇 software enginee...
67 篇 internet

机构

33 篇 school of comput...
14 篇 school of scienc...
14 篇 institute of inf...
13 篇 department of co...
13 篇 changsha univers...
12 篇 naval research i...
12 篇 college of mathe...
11 篇 school of intern...
10 篇 university of ch...
10 篇 jiangnan univers...
10 篇 department of co...
9 篇 school of iot en...
9 篇 university of ch...
9 篇 hannam universit...
8 篇 huazhong univers...
8 篇 school of comput...
8 篇 wuhan university...
8 篇 school of comput...
8 篇 school of busine...
8 篇 the islamic univ...

作者

19 篇 jun sun
18 篇 quanyin zhu
16 篇 meiqing wang
13 篇 h. casanova
13 篇 shesheng zhang
13 篇 ioana banicescu
12 篇 yang yang
11 篇 wenbo xu
10 篇 min huang
10 篇 peng wang
10 篇 minyi guo
10 篇 florina m. ciorb...
9 篇 qiang yang
9 篇 wang guojun
9 篇 xingwei wang
9 篇 souheil khaddaj
9 篇 tai-hoon kim
9 篇 wang wei
9 篇 dominik ślęzak
9 篇 hai jin

语言

3,459 篇 英文
103 篇 其他
7 篇 中文

检索条件"任意字段=International Symposium Distributed Computing and Applications Business Engineering and Science"

共 3568 条记录，以下是1301-1310 订阅

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

详细简洁

排序：

An accurate FDD-based approach for discovering distributed firewalls misconfigurations 15

An accurate FDD-based approach for discovering distributed f...

引用

Joint 15th IEEE international Conference on Trust, Security and Privacy in computing and Communications, 10th IEEE international Conference on Big Data science and engineering and 14th IEEE international symposium on Parallel and distributed Processing with applications, IEEE TrustCom/BigDataSE/ISPA 2016

作者： Saâdaoui, Amina Souayeh, Nihel Ben Youssef Ben Bouhoula, Adel University of Carthage Tunisia

ISBN: (纸本)9781509032051

Problems arising from firewalls are common, cost time and money and have dramatic consequences for the operations of networks, especially in multi-firewall enterprise network. In fact, any misconfiguration that can arise between rules creates ambiguity in classification and filtering of the traffic. The discovery and removal of these misconfigurations is a serious and complex problem to solve. Several solutions have been proposed, though these methods are useful for discovering anomalies, most of them identify each overlap between two rules with different actions as a configuration error while, in some cases, network administrator add, intentionally, overlapping rules. Also, in a distributed environment, they deal only with pair-wise filtering rules in a simple firewall and they consider relations between only two firewalls even if a network path could contain more than two firewalls and anomaly could happen between different rules from different firewalls. In this paper, we present (1) a new classification of anomalies in multi-firewall environment bringing out real configurations errors, (2) we use a data structure (FDD) to represent relations between different rules in different firewalls in the network, (3) a new approach to rule-set optimization and clean-up by removing superfluous rules from a simple firewall and firewalls in a distributed environment and (4) formal specification and validation of proposed techniques, we also proved its correctness and completeness and demonstrated its scalability and applicability. © 2016 IEEE.

关键词： Computer system firewalls

来源：评论

学校读者我要写书评

暂无评论

Cyber Foraging and Offloading Framework for Internet of Things 40

Cyber Foraging and Offloading Framework for Internet of Thin...

引用

40th Annual IEEE Computer Software and applications Conference symposium (COMPSAC) / symposium on Software engineering Technology and applications (SETA)

作者： Patil, Prithviraj Hakiri, Akram Gokhale, Aniruddha Vanderbilt Univ ISIS Dept EECS 221 Kirkland Hall Nashville TN 37235 USA Univ Carthage SYSCOM ENIT ISSAT Mateur Carthage Tunisia

ISBN: (纸本)9781467388450

Computation offloading or cyber foraging is a key capability required to achieve effective resource utilization in mobile cloud computing. It enables the dynamic offloading of computations to either neighboring mobile nodes or remote cloud-based servers, retrieve results from the offloaded computations, and thereafter continue execution of the mobile business logic. A number of computational mobility solutions have emerged recently for mobile cloud computing involving smartphones and tablets. However, these solutions incur limitations in the context of Internet of Things (IoT) due to the significant heterogeneity illustrated by the range of objects involved in IoT and the fact that existing solutions tend to be tightly coupled to their underlying frameworks, which makes it hard to seamlessly adapt these solutions to the IoT scenarios. To address these concerns, this paper makes three contributions. First, it presents a novel modular and highly configurable framework for providing seamless computational mobility in the IoT realm. Second, it provides implementation details for key capabilities of this framework. Third, it provides qualitative evaluation of the framework's capabilities.

关键词： Mobile cloud computing IoT software engineering modular and configurable framework

来源：评论

学校读者我要写书评

暂无评论

SpatialGraphx: A distributed Graph computing Framework for Spatial and Temporal Data at Scale 40

SpatialGraphx: A Distributed Graph Computing Framework for S...

引用

40th Annual IEEE Computer Software and applications Conference symposium (COMPSAC) / symposium on Software engineering Technology and applications (SETA)

作者： Wang, Changyuan Lu, Zongfei Liu, Yang Guo, Shanqing Xu, Xinshun Liu, Shijun Cui, Lizhen Shandong Univ Sch Comp Sci & Technol Jinan Peoples R China Shandong Univ Minist Educ Key Lab Cryptol Technol & Informat Secur Jinan Peoples R China

ISBN: (纸本)9781467388450

Development of the Smart City has produced much data with attributions of timestamp and location, but in some applications like investigation of the large bomb explosion in New York, the government takes precedence to investigate the relation data from New York city rather than the whole Country, which prompts us to do some research works in computing partial graph more fast. So we propose SpatialGraphx, a graph parallel computing framework supporting direct and fast partial graph construction and partial graph computation. Leveraging the spatial and temporal attributions of data, SpatialGraphx presents two extensions on the partial graph construction by building a spatio-temporal tree index and on the computation by a new location-based partition strategy. Using mobile network's data with hundred million edges, we demonstrate SpatialGraphx can support direct and fast partial graph construction and enables efficient partial graph analysis for spatial and temporal data. And compared to original Graphx, the improvement of SpatialGraphx is 3x to several orders of magnitude for large enough dataset.

关键词： partial graph computations spatio-temporal index Location-based partition strategy

来源：评论

学校读者我要写书评

暂无评论

Data Structure for Supporting Patch Refinement in Adaptive Isogeometric Analysis 19

Data Structure for Supporting Patch Refinement in Adaptive I...

引用

第十五届分布式计算及其应用国际学术研讨会

作者： Anna Perduta Roman Putanowicz Institute for Computational Civil Engineering Cracow University of Technology

ISBN: (纸本)9781509035946

Isogeometric Analysis(IGA) is relatively young computational method built on the assumption that NonUniform Rational B-Splines(NURBS) are used both for modelling curved objects and as the base functions for approximating unknown *** single patch IGA implementation is relatively easy,implementation of multi-patch IGA with local patch refinement is more difficult,especially with respect to providing flexible data *** paper describes the use of generic framework for handling mesh data(MOAB) to build flexible data structure supporting adaptive,multipatch version of *** key issue of such data structure is an appropriate numbering of mesh vertices to help building projection operator between patches,that ensures continuity of geometry *** paper presents the idea of special tagging of vertices and specific order of their enumeration that serves well this purpose.

关键词： Splines (mathematics) Surface topography Surface reconstruction Data structures Solid modeling Finite element analysis

来源：评论

学校读者我要写书评

暂无评论

Intelligent distributed computing

Intelligent Distributed Computing

引用

作者： Venticinque, Salvatore Camacho, David Industrial and Information Engineering Department Second University of Naples Naples Italy Computer Science Department Universidad Autõnoma de Madrid Madrid Spain

The Special Issue of Concurrency and Computation: Practice and Experience journal presents papers presented at the international symposium on Intelligent distributed computing (IDC) held in 2014 in Madrid. Alexander Pokahr and and Lars Braubach focus on the effective utilization of theoretically unlimited distributed and virtual resources, which are provided by the Cloud computing paradigm. They present a component-based Cloud platform that provides autonomic management of applications using scale-out and on-demand deployment of computing resources at IaaS (Infrastructure as a Service) level. Tri Nguyen Tuong, Dosam Hwang and Jason J. Jung propose a method to predict the location of unlabeled resources on social networking services. The described approach uses the Naive Bayes and Support Vector Machine methods to classify the resources that are collected by using the term frequency of the tags in each class. Davide Carneiro, AndreÁ Pimenta, Sérgio GoncAalves, JoseÁ Neves and Paulo Novais discuss about monitoring and management of individual's performance in workplace contexts.

关键词： Infrastructure as a service (IaaS)

来源：评论

学校读者我要写书评

暂无评论

Automatic hybridization of runtime systems 16

Automatic hybridization of runtime systems

引用

25th ACM international symposium on High-Performance Parallel and distributed computing, HPDC 2016

作者： Hale, Kyle C. Hetland, Conor J. Dinda, Peter A. Department of Electrical Engineering and Computer Science Northwestern University United States

ISBN: (纸本)9781450343145

The hybrid runtime (HRT) model offers a plausible path towards high performance and efficiency. By integrating the OS kernel, parallel runtime, and application, an HRT allows the runtime developer to leverage the full privileged feature set of the hardware and specialize OS services to the runtime's needs. However, conforming to the HRT model currently requires a complete port of the runtime and application to the kernel level, for example to our Nautilus kernel framework, and this requires knowledge of kernel internals. In response, we developed Multiverse, a system that bridges the gap between a built-from-scratch HRT and a legacy runtime system. Multiverse allows existing, unmodified applications and runtimes to be brought into the HRT model without any porting effort whatsoever. Developers simply recompile their package with our compiler toolchain, and Multiverse automatically splits the execution of the application between the domains of a legacy OS and an HRT environment. To the user, the package appears to run as usual on Linux, but the bulk of it now runs as a kernel. The developer can then incrementally extend the runtime and application to take advantage of the HRT model. We describe the design and implementation of Multiverse, and illustrate its capabilities using the Racket runtime system. Copyright © 2016 by the Association for computing Machinery, Inc. (ACM).

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Doctoral symposium: Automating computational placement in IoT environments 10

Doctoral symposium: Automating computational placement in Io...

引用

10th ACM international Conference on distributed and Event-Based Systems, DEBS 2016

作者： Michalák, Peter Heaps, Sarah Trenell, Michael Watson, Paul School of Computing Science Newcastle University United Kingdom School of Mathematics and Statistics Newcastle University United Kingdom Institute of Cellular Medicine Newcastle University United Kingdom

ISBN: (纸本)9781450340212

The growth in the number of Internet of Things (IoT) devices and applications, and an increase in the capabilities of sensors creates an opportunity to optimise IoT applications by partitioning the computation across all components in the processing chain: sensors, field gateways and clouds. This can be done to optimise a range of factors including performance, energy and cost. This paper presents an overview of an optimiser designed to achieve this. It takes as input a high-level, declarative description of the computation, along with a set of non-functional requirements. From this it aims to generate the best deployment plan. The main use case, described in the paper is the use of wearable sensors for the real-time monitoring of the activity and glucose levels of type II diabetes patients. This paper describes the architecture of the optimiser, gives an example of an energy-based cost model, and shows how the approach applies to the diabetes use case. © 2016 ACM.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Towards scalable and reliable in-memory storage system: A case study with Redis 15

Towards scalable and reliable in-memory storage system: A ca...

引用

作者： Chen, Shanshan Tang, Xiaoxin Wang, Hongwei Zhao, Han Guo, Minyi Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Overseas Education Nanjing University of Posts and Telecommunications China School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781509032051

In recent years, in-memory key-value storage systems have become more and more popular in solving real-time and interactive tasks. Compared with disks, memories have much higher throughput and lower latency which enables them to process data requests with much higher performance. However, since memories have much smaller capacity than disks, how to expand the capacity of in-memory storage system while maintain its high performance become a crucial problem. At the same time, since data in memories are non-persistent, the data may be lost when the system is down. In this paper, we make a case study with Redis, which is one popular in-memory key-value storage system. We find that although the latest release of Redis support clustering so that data can be stored in distributed nodes to support a larger storage capacity, its performance is limited by its decentralized design that clients usually need two connections to get their request served. To make the system more scalable, we propose a Clientside Key-to-Node Caching method that can help direct request to the right service node. Experimental results show that by applying this technique, it can significantly improve the system's performance by near 2 times. We also find that although Redis supports data replication on slave nodes to ensure data safety, it still gets a chance of losing a part of the data due to a weak consistency between master and slave nodes that its defective order of data replication and request reply may lead to losing data without notifying the client. To make it more reliable, we propose a Master-slave Semi Synchronization method which utilizes TCP protocol to ensure the order of data replication and request reply so that when a client receives an 'OK' message, the corresponding data must have been replicated. With a significant improvement in data reliability, its performance overhead is limited within 5%. © 2016 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

SLA and profit-aware SaaS provisioning through proactive renegotiation 15

SLA and profit-aware SaaS provisioning through proactive ren...

引用

15th IEEE international symposium on Network computing and applications, NCA 2016

作者： Omezzine, Aya Bellamine Ben Saoud, Narjes Tazi, Said Cooperman, Gene Univ. Manouba ENSI RIADI LR99ES26 Campus Universitaire Manouba2010 Tunisia Université Fédérale Toulouse Midi-Pyrénées CNRS/LAAS ToulouseF-31400 France Univ. de Toulouse UT1 Capitole LAAS ToulouseF-31000 France College of Computer and Information Science Northeastern University BostonMA United States

ISBN: (纸本)9781509032167

Software-as-a-Service (SaaS) providers offer on-demand, highly scalable applications to the end users. To maximize their profit, the providers must make profit-aware scheduling decisions about assigning client requests to virtual resources, while respecting the agreed upon Service-Level Agreement (SLA). Given the highly dynamic nature of the cloud environment, unexpected events may affect the initial scheduling plans, which leads to unanticipated SLA violations. Thus, an unaccounted event may create a lose-lose situation between provider and client. If the SLA is violated the provider must pay the potentially high penalty that is negotiated within the original SLA. But from the client's viewpoint, an SLA violation may cause cancellation of a business-critical job, and no ordinary SLA penalty can compensate for the loss of the client's business. The provider's reputation could also suffers as the number of such SLA violations grows, resulting in loss of future clients. On the contrary of most existing work that assume that once established the SLA cannot be modified, we propose to convert the lose-lose situation into a win-win one through an automated renegotiation mechanism. When an event threatens a lose-lose violation of the SLA, the renegotiation mechanism is launched to establish a new SLA that limits the losses on the two sides. Experiments show that this new approach minimizes the loss in profit of the provider and minimizes the number of cancelled jobs experienced by the client, as compared with enforcing the original SLA. © 2016 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Fixed Points on Dependency Graphs 1

引用

2nd international symposium on Dependable Software engineering - Theories, Tools and applications (SETTA)

作者： Dalsgaard, Andreas Engelbredt Enevoldsen, Soren Larsen, Kim Guldstrand Srba, Jiri Aalborg Univ Dept Comp Sci Selma Lagerlofs Vej 300 DK-9220 Aalborg Denmark

ISBN: (数字)9783319476773

ISBN: (纸本)9783319476773;9783319476766

Dependency graph is an abstract mathematical structure for representing complex causal dependencies among its vertices. Several equivalence and model checking questions, boolean equation systems and other problems can be reduced to fixed-point computations on dependency graphs. We develop a novel distributed algorithm for computing such fixed points, prove its correctness and provide an efficient, open-source implementation of the algorithm. The algorithm works in an on-the-fly manner, eliminating the need to generate a priori the entire dependency graph. We evaluate the applicability of our approach by a number of experiments that verify weak simulation/bisimulation equivalences between CCS processes and we compare the performance with the well-known CWB tool. Even though the fixed-point computation, being a P-complete problem, is difficult to parallelize in theory, we achieve significant speed-ups in the performance as demonstrated on a Linux cluster with several hundreds of cores.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共357页 << < 127 128 129 130 131 132 133 134 135 136 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：