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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,327 篇 会议
1,964 篇 期刊文献
96 册 图书

馆藏范围

4,387 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,724 篇 工学
- 1,946 篇 计算机科学与技术...
- 1,571 篇 软件工程
- 512 篇 信息与通信工程
- 434 篇 生物工程
- 407 篇 控制科学与工程
- 342 篇 生物医学工程（可授...
- 257 篇 电气工程
- 241 篇 光学工程
- 211 篇 电子科学与技术（可...
- 190 篇 机械工程
- 111 篇 化学工程与技术
- 111 篇 安全科学与工程
- 108 篇 交通运输工程
- 106 篇 动力工程及工程热...
- 99 篇 材料科学与工程（可...
- 98 篇 仪器科学与技术
1,574 篇 理学
- 831 篇 数学
- 482 篇 生物学
- 435 篇 物理学
- 311 篇 统计学（可授理学、...
- 177 篇 系统科学
- 111 篇 化学
744 篇 管理学
- 433 篇 管理科学与工程(可...
- 335 篇 图书情报与档案管...
- 240 篇 工商管理
328 篇 医学
- 288 篇 临床医学
- 275 篇 基础医学(可授医学...
- 166 篇 药学(可授医学、理...
- 124 篇 公共卫生与预防医...
156 篇 法学
- 140 篇 社会学
88 篇 经济学
75 篇 教育学
63 篇 农学
12 篇 军事学
5 篇 文学
5 篇 艺术学

主题

102 篇 machine learning
91 篇 computational mo...
83 篇 semantics
73 篇 deep learning
67 篇 feature extracti...
65 篇 artificial intel...
65 篇 training
60 篇 data models
58 篇 visualization
58 篇 accuracy
57 篇 computer archite...
53 篇 cloud computing
47 篇 informatics
47 篇 predictive model...
47 篇 forecasting
45 篇 internet of thin...
44 篇 software
43 篇 educational inst...
42 篇 optimization
42 篇 real-time system...

机构

104 篇 school of comput...
93 篇 school of comput...
50 篇 school of comput...
48 篇 school of comput...
44 篇 school of comput...
41 篇 department for p...
40 篇 department of ph...
40 篇 faculty of scien...
40 篇 departamento de ...
40 篇 department of ph...
40 篇 yerevan physics ...
40 篇 luddy school of ...
39 篇 kirchhoff-instit...
39 篇 graduate school ...
39 篇 institute of phy...
38 篇 department of ph...
38 篇 department of ph...
38 篇 department of ph...
38 篇 dipartimento di ...
38 篇 fakultät für phy...

作者

35 篇 liu lantao
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

语言

3,871 篇 英文
475 篇 其他
42 篇 中文
4 篇 德文
2 篇 日文

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

共 4387 条记录，以下是4041-4050 订阅

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

详细简洁

排序：

Parameterized Maximum and Average Degree Approximation in Topic-based Publish-Subscribe Overlay Network Design

Parameterized Maximum and Average Degree Approximation in To...

引用

IEEE International Conference on Distributed computing Systems

作者： Melih Onus Andrea W. Richa Department of Computer Engineering TOBB University of Economics and Technology Computer Science and Engineering School of Computing Informatics and Decision Systems Engineering Arizona State University

ISBN: (纸本)9781424472611;9780769540597

Publish/subscribe communication systems where nodes subscribe to many different topics of interest are becoming increasingly more common. Designing overlay networks that connect the nodes subscribed to each distinct topic is hence a fundamental problem in these systems. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. Ideally one would like to be able not only to keep the average degree of the nodes low, but also to ensure that all nodes have equally the same degree, giving rise to the following problem: Given a collection of nodes and their topic subscriptions, connect the nodes into a graph with low average and maximum degree such that for each topic t, the graph induced by the nodes interested in t is connected. We present the first polynomial time parameterized sublinear approximation algorithm for this problem. We also propose two heuristics for constructing topic-connected networks with low average degree and constant diameter and validate our results through simulations. In fact, the results in this section are a refinement of the preliminary results by Onus and Richa in INFOCOM'09.

关键词： Ganglia overlay network Publish-subscribe parameterization

来源：评论

学校读者我要写书评

暂无评论

A User-Centric Approach to Assessing Confidentiality and Integrity of Service-Based Workflows

A User-Centric Approach to Assessing Confidentiality and Int...

引用

International Conference on Human-Centric computing (HumanCom)

作者： Stephen S. Yau Jing Huang Information Assurance Center and School of Computing Informatics and Decision System Engineering Arizona State University Tempe AZ USA

In service-based systems (SBS), workflows are composed of loosely coupled services. The quality of service (QoS) of composite service-based workflows needs to be considered. In doing so, various aspects of the QoS of these workflows need to be assessed. In this paper, a user-centric approach is presented to assessing the confidentiality and integrity of service-based workflows, given the QoS of constituent services. Our approach incorporates the users' preferences for data sensitivity on the data processed by the workflow. It allows users to compare the amount of risk incurred by possible failure of the confidentiality or integrity functions of component services of a workflow.

关键词： Security Quality of service Silicon Credit cards TV Computational modeling Web services

来源：评论

学校读者我要写书评

暂无评论

computing the cutwidth of bipartite permutation graphs in linear time 1

引用

36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2010

作者： Heggernes, Pinar Van 't Hof, Pim Lokshtanov, Daniel Nederlof, Jesper Department of Informatics University of Bergen P.O. Box 7803 N-5020 Bergen Norway School of Engineering and Computing Sciences Durham University Science Laboratories South Road Durham DH1 3LE United Kingdom

ISBN: (数字)9783642169267

ISBN: (纸本)3642169252

The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial polynomial-time cutwidth algorithms were known only for subclasses of graphs of bounded treewidth. In WG 2008, Heggernes et al. initiated the study of cutwidth on graph classes containing graphs of unbounded treewidth, and showed that a greedy algorithm computes the cutwidth of threshold graphs. We continue this line of research and present the first polynomial-time algorithm for computing the cutwidth of bipartite permutation graphs. Our algorithm runs in linear time. We stress that the cutwidth problem is NP-complete on bipartite graphs and its computational complexity is open even on small subclasses of permutation graphs, such as trivially perfect graphs. © 2010 Springer-Verlag.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Malicious Hubs: Detecting Abnormally Malicious Autonomous Systems

Malicious Hubs: Detecting Abnormally Malicious Autonomous Sy...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Andrew J. Kalafut Craig A. Shue Minaxi Gupta School of Informatics and Computing Indiana University of Bloomington USA Computational Sciences and Engineering Oak Ridge National Laboratory USA

ISBN: (纸本)9781424458387

While many attacks are distributed across botnets, investigators and network operators have recently targeted malicious networks through high profile autonomous system (AS) de-peerings and network shut-downs. In this paper, we explore whether some ASes indeed are safe havens for malicious activity. We look for ISPs and ASes that exhibit disproportionately high malicious behavior using 12 popular blacklists. We find that some ASes have over 80% of their routable IP address space blacklisted and others account for large fractions of blacklisted IPs. Overall, we conclude that examining malicious activity at the AS granularity can unearth networks with lax security or those that harbor cybercrime.

关键词： Computer networks Distributed computing Peer to peer computing Computer crime Telecommunication traffic US Government informatics Computer security Internet Communications Society

来源：评论

学校读者我要写书评

暂无评论

Comparative performance analysis of MPEG4, FLV and 3GP multimedia file formats using wireless network parameters

Comparative performance analysis of MPEG4, FLV and 3GP multi...

引用

International Conference on Computer and Information Technology (ICCIT)

作者： Mohammad A. R. Mustafa Mohammad Mamun Elahi M. Alamgir Hossain Mohammad Mahfuzul Islam School of Computing Informatics and Media University of Bradford Bradford UK Department of CSE Bangladesh University of Engineering and Technology Dhaka Bangladesh

Many recommendations are proposed for accommodating multimedia content into wireless media with lower bandwidth. These formats of the content have been developed with different objectives. Now it has become really challenging to compare all these diversified formats. In this paper, we proposed an algorithm to compare the FLV, MPEG4 and 3GP format of multimedia content using the parameters that determines their performance in wireless network. Finally, exhaustive experiments are done and the results are shown to demonstrate the merits and capabilities of the different file formats.

关键词： MPEG 4 Standard Multimedia communication Transform coding Streaming media Image coding PSNR

来源：评论

学校读者我要写书评

暂无评论

Hiding in Plain Sight: Exploiting Broadcast for Practical Host Anonymity

Hiding in Plain Sight: Exploiting Broadcast for Practical Ho...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： Craig A. Shue Minaxi Gupta Computational Sciences and Engineering Division Oak Ridge National Laboratory USA School of Informatics and Computing Indiana University Bloomington USA

Users are being tracked on the Internet more than ever before as Web sites and search engines gather pieces of information sufficient to identify and study their behavior. While many existing schemes provide strong anonymity, they are inappropriate when high bandwidth and low latency are required. In this work, we explore an anonymity scheme for end hosts whose performance makes it possible to have it always on. The scheme leverages the natural grouping of hosts in the same subnet and the universally available broadcast primitive to provide anonymity at line speeds. Our scheme is strongly resistant against all active or passive adversaries as long as they are outside the subnet. Even within the subnet, our scheme provides reasonable resistance against adversaries, providing anonymity that is suitable for common Internet applications.

关键词： Broadcasting Delay Bandwidth Privacy US Government Search engines Web and internet services Network servers Network address translation IP networks

来源：评论

学校读者我要写书评

暂无评论

Impact of Web 2.0 and Cloud computing Platform on Software engineering

Impact of Web 2.0 and Cloud Computing Platform on Software E...

引用

International Symposium on Electronic System Design (ISED)

作者： Radha Guha David Al-Dabass Department of Engineering Mathematics and Science Texas A and M International University TX USA School of Computing and Informatics Nottingham Trent University UK

Current era of Web 2.0 is enabling new business models for using the semantic web. One such business model is leasing out computing platform of hardware and software over the internet to the tenants and is dubbed as Cloud computing. The anticipated future trend of computing is believed to be this cloud computing as it promises a lot of benefits like no capital expenditure, speed of application deployment, shorter time to market, lower cost of operation and easier maintenance for the tenants. This paper analyses how cloud computing on the background of Web 2.0 is going to impact the software engineering process to develop quality software. As the cloud provider is an external entity or third party, how difficult will be the interaction with them? How to separate the roles of SW engineers and cloud providers? SW engineering should include framework activities to leverage all the benefits of cloud computing systematically and strategically. This paper extends the traditional agile process model named Extreme Programming (XP) and integrates interaction with the cloud provider to facilitate acceptance of cloud computing.

关键词： Cloud computing Software Computational modeling Programming Biological system modeling Software engineering

来源：评论

学校读者我要写书评

暂无评论

Real-Time Service-Oriented Cloud computing

Real-Time Service-Oriented Cloud Computing

引用

IEEE World Congress on Services (SERVICES)

作者： Wei-Tek Tsai Qihong Shao Xin Sun Jay Elston Computer Science and Technology Tsinghua University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University USA

Cloud computing has received significant attention recently. This paper presents real-time issues related to cloud computing, such as multi-tenancy architecture, scheduling, paralleled computing and proposes a framework for real-time service-oriented cloud computing. Specially, we propose a novel real time architecture which solve the new challenges in Cloud computing.

关键词： Clouds Databases Real time systems Cloud computing Program processors Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Two-Tier Multi-tenancy Scaling and Load Balancing

Two-Tier Multi-tenancy Scaling and Load Balancing

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Wei-Tek Tsai Xin Sun Qihong Shao Guanqiu Qi Computer Science and Technology Tsinghua University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University USA

Cloud computing often uses the multi-tenancy architecture where tenants share system software. To support dynamically increasing demands from multi-tenants, the cloud service providers have to duplicate computing resources to cope with the fluctuation of requests from tenants. This is currently handled by virtualization and duplication at the application level in the existing cloud environment, such as Google App Engine. However, duplicating at the application level only may result in significant resource waste as the entire application is duplicated. This paper proposes a two-tier SaaS scaling and scheduling architecture that works at both service and application levels to save resources, and the key idea is to increase the resources to those bottleneck components only. Several duplication strategies are proposed, including lazy duplication and pro-active duplication to achieve better system performance. Additionally, a resource allocation algorithm is proposed in a clustered cloud environment. The experiment results showed that the proposed algorithms can achieve a better resource utilization rate.

关键词： Servers Resource management Clustering algorithms Computer architecture Monitoring Containers Scheduling

来源：评论

学校读者我要写书评

暂无评论

Prioritizing Service Requests on Cloud with Multi-tenancy

Prioritizing Service Requests on Cloud with Multi-tenancy

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Wei-Tek Tsai Qihong Shao Jay Elston Department of Computer Science and Technology Tsinghua University China School of Computing Informatics and Decision Systems Engineering Arizona State University USA

Cloud computing often uses a multi-tenant architecture where tenants share application and system software. Request prioritization presents a challenge in this architecture. Tenant may have individual (local) prioritization requirements, and these requirements can be different for different tenants. The shared application must use a global priority scheme for requests from all the tenants. This paper proposes an effective model to prioritize service requests from multiple tenants while preserving local priorities from individual tenant requests. This paper proposes the Crystalline Mapping (CM) algorithm which maps local priorities from individual tenants to global priorities. The algorithm also maximizes revenues within the local-to global priority mapping constraints. The performance of the model is evaluated by the total business value, the QoS measurement, and a fairness measure. The model has been evaluated using simulation based on real-world data, and the results are consistent with the mathematical model.

关键词： Servers Computational modeling Cloud computing Biological system modeling Companies Mathematical model Data models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共439页 << < 401 402 403 404 405 406 407 408 409 410 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：