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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是851-860 订阅

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

详细简洁

排序：

A Quantitative Methodology for business Process-Based Data Privacy Risk Computation 6th

A Quantitative Methodology for Business Process-Based Data P...

引用

6th international Doctoral symposium on Applied Computation and Security Systems, ACSS 2019

作者： Manna, Asmita Sengupta, Anirban Mazumdar, Chandan Department of Computer Science and Engineering Jadavpur University Kolkata India Department of Computer Science and Engineering Centre for Distributed Computing Jadavpur University Kolkata India

ISBN: (纸本)9789811389689

The imminent introduction of the Data Protection Act in India would make it necessary for almost all enterprises, dealing with personal data, to implement privacy-specific controls. These controls would serve to mitigate the risks that breach the privacy properties of user data. Hence, the first step toward implementing such controls is the execution of privacy risk assessment procedures that would help elicit the privacy risks to user data. All user data are processed/managed by one or more business processes. Hence, assessment of privacy risks to user data should consider the vulnerabilities within, and threats to, corresponding business process. It should also consider different perspectives, namely business, legal and contractual needs, and users’ expectations, during the computation of data privacy values. This paper proposes such a comprehensive methodology for identifying data privacy risks and quantifying the same. The risk values are computed at different levels (privacy property level, business process level, etc.) to help both senior management and operational personnel, in assessing and mitigating privacy risks. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

The composition function and realization of maritime distress personnel search system

The composition function and realization of maritime distres...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Jin Ming School of Energy and Power Engineering Wuhan University of Technology Wuhan China

ISBN: (数字)9781728197241

ISBN: (纸本)9781728197258

This project plans to design a kind of identification system which can be used to identify the maritime personnel in distress and equipment to be rescued under the clear sea surface. The system can be carried on unmanned aerial vehic le (UAV), and the existing YOLOV3 algorithm is used for ta rget recognition. It can identify the maritime distress person nel and rescue equipment wearing life jackets under clear se a surface, so as to assist in further search and rescue decision making, and solve or partially resolve the existing problems i n search and rescue technology.

关键词： Handheld computers Hafnium distributed computing business

来源：评论

学校读者我要写书评

暂无评论

An e-1/2e-1-Approximation Algorithm for Maximizing Coverage Capability in Mobile Air Quality Monitoring Systems 19

An e-1/2e-1-Approximation Algorithm for Maximizing Coverage ...

引用

19th IEEE international symposium on Network computing and applications, NCA 2020

作者： Nguyen, Viet Dung Le Nguyen, Phi Nguyen, Trung Hieu Nguyen, Kien Do, Phan Thuan School of Information and Communication Technology Hanoi University of Science and Technology Hanoi Viet Nam Graduate School of Engineering Chiba University Chiba Japan

ISBN: (纸本)9781728183268

In this paper, we focus on broadening the monitoring area of a mobile air quality monitoring system, in which the sensors mounted on buses. In particular, we investigate the optimal buses to place the sensors and the optimal monitoring timings to maximize the number of monitored critical regions. We mathematically formulate the targeted problem. Then, we leverage the greedy approach to propose a polynomial-time e-1/2e-1 approximation algorithm. We use the data of real bus routes in Hanoi, Vietnam, for the experimentation and show that the proposed algorithm guarantees an average performance ratio of 63.87%. © 2020 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Chaos engineering For Understanding Consensus Algorithms Performance in Permissioned Blockchains

Chaos Engineering For Understanding Consensus Algorithms Per...

引用

IEEE international symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Shiv Sondhi Sherif Saad Kevin Shi Mohammad Mamun Issa Traore University of Windsor National Research Council of Canada University of Victoria

ISBN: (纸本)9781665421751

A critical component of any blockchain or distributed ledger technology (DLT) platform is the consensus algorithm. Blockchain consensus algorithms are the primary vehicle for the nodes within a blockchain network to reach an agreement. In recent years, many blockchain consensus algorithms have been proposed mainly for private and permissioned blockchain networks. However, the performance of these algorithms and their reliability in hostile environments or the presence of byzantine and other network failures are not well understood. In addition, the testing and validation of blockchain applications come with many technical challenges. In this paper, we apply chaos engineering and testing to understand the performance of consensus algorithms in the presence of different loads, byzantine failure and other communication failure scenarios. We apply chaos engineering to evaluate the performance of three different consensus algorithms (PBFT, Clique, Raft) and their respective blockchain platforms. We measure the blockchain network's throughput, latency, and success rate while executing chaos and load tests. We develop lightweight blockchain applications to execute our test in a semi-production environment. Our results show that using chaos engineering helps understand how different consensus algorithms perform in a hostile or unreliable environment and the limitations of blockchain platforms. Our work demonstrates the benefits of using chaos engineering in testing complex distributed systems such as blockchain networks.

关键词： Chaos distributed ledger Scalability System performance Consensus algorithm Production Throughput

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Anomaly Detection with Variational Auto-Encoder and Local Outliers Factor for KPIs

Unsupervised Anomaly Detection with Variational Auto-Encoder...

引用

IEEE international Conference on Big Data and Cloud computing (BdCloud)

作者： Shili Yan Bing Tang Jincheng Luo Xing Fu Xiaoyuan Zhang School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

With the popularization of Internet application, online business systems is becoming more and more common. To ensure the normal running of online business systems, IT operations are required to closely monitor various KPIs (Key Performance Indicators), such as network throughput, page views, user’s order status, and discover the anomalies in the KPIs accurately in time. However, due to the diversity and complexity of anomalies, this task is confronted with great challenges, especially without labels. In this paper, we propose an unsupervised anomaly detection algorithm called LOF-VAE, based on LOF (Local Outliers Factor) and VAE (Variational Auto-Encoder). Our experiments using real-world data from large Internet companies show that, LOF-VAE’s best F-scores range from 0.89 to 0.99, and compared to the state-of-art unsupervised approach Donut, LOF-VAE improves the best F-score by 0.02 to 0.17. Even with low alert latency, LOF-VAE also performs well.

关键词： Key performance indicator Training data Companies Throughput Internet Complexity theory Task analysis

来源：评论

学校读者我要写书评

暂无评论

AgileWatts: An Energy-Efficient CPU Core Idle-State Architecture for Latency-Sensitive Server applications 22

AgileWatts: An Energy-Efficient CPU Core Idle-State Architec...

引用

Proceedings of the 55th Annual IEEE/ACM international symposium on Microarchitecture

作者： Jawad Haj Yahya Haris Volos Davide B. Bartolini Georgia Antoniou Jeremie S. Kim Zhe Wang Kleovoulos Kalaitzidis Tom Rollet Zhirui Chen Ye Geng Onur Mutlu Yiannakis Sazeides Rivos Inc Mountain View California United States Computer Architecture Laboratory Department of Computer Science University of Cyprus Computing Systems Lab Huawei Zurich Research Center Department of Information Technology and Electrical Engineering ETH Zurich Switzerland

ISBN: (纸本)9781665462723

User-facing applications running in modern datacenters exhibit irregular request patterns and are implemented using a multitude of services with tight latency requirements (30--250μs). These characteristics render existing energy-conserving techniques ineffective when processors are idle due to the long transition time (order of 100μs) from a deep CPU core idle power state (C-state). While prior works propose management techniques to mitigate this inefficiency, we tackle it at its root with AgileWatts (AW): a new deep CPU core C-state architecture optimized for datacenter server processors targeting latency-sensitive *** drastically reduces the transition latency from deep CPU core idle power states while retaining most of their power savings based on three key ideas. First, AW eliminates the latency (several microseconds) of saving/restoring the core context when powering-off/-on the core in a deep idle state by i) implementing medium-grained power-gates, carefully distributed across the CPU core, and ii) retaining context in the power-ungated domain. Second, AW eliminates the flush latency (several tens of microseconds) of the L1/L2 caches when entering a deep idle state by keeping L1/L2 content power-ungated. A small control logic also remains ungated to serve cache coherence traffic. AW implements cache sleep-mode and leakage reduction for the power-ungated domain by lowering a core's voltage to the minimum operational level. Third, using a state-of-the-art power efficient all-digital phase-locked loop (ADPLL) clock generator, AW keeps the PLL active and locked during the idle state, cutting microseconds of wake-up latency at negligible power *** evaluation with an accurate industrial-grade simulator calibrated against an Intel Skylake server shows that AW reduces the energy consumption of Memcached by up to 71% (35% on average) with <1% end-to-end performance degradation. We observe similar trends for other evaluated services (MySQL and Kafka).

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Review of DDoS Attacks and its Countermeasures in Cloud computing

A Review of DDoS Attacks and its Countermeasures in Cloud Co...

引用

international Conference on Information Systems and Computer Networks (ISCON)

作者： S.Asha Varma Karri.Ganesh Reddy School of Computer Science and Engineering VIT-AP University Amaravathi India

ISBN: (纸本)9781665447874

In the present scenario, cloud computing has become a marketable technology that allows consumers to easily access resources through the internet, based on pay per use model. These resources are provided as services to the customer. Infrastructure as a Service, Platform as a Service, and Software as a Service are the 3 service models provided by the cloud. With the huge advancement in cloud computing technologies, it is widely used by many business applications, industry applications, Enterprise organizations that are committing to multi-cloud architectures, and finally, most IT expenditures are based on the cloud. However, security is the key challenge that needs more concern. According to recent studies, the most critical security concern that is confronted by cloud users is resource availability. This availability issue is mostly affected by the distributed Denial of service attack. The distributed Denial of service attack is an enhanced model of Denial of service. The main intention behind the distributed Denial of Service attack is to bring down a specific service by flooding the servers and network with malformed packets which leads to the unavailability of resources to legitimate users in a cloud. Recently, cloud infrastructures also have been severely impacted by denial of service attacks. The attacker always tries to break the security at the infrastructure level as it provides the basic computing infrastructure for all cloud delivery models. This paper frames the cloud computing services and distributed Denial of Service attack scenarios and their different defense mechanisms.

关键词： Computers Cloud computing Computational modeling Software as a service Platform as a service Organizations Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Finite-time Combination Projective Synchronization for Memristive Systems

Finite-time Combination Projective Synchronization for Memri...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Yibo Wang Fuhong Min Hongliang Zheng School of Electrical and Automation Engineering Nanjing Normal University Nanjing

ISBN: (数字)9781728197241

ISBN: (纸本)9781728197258

In this article, based on the sliding-mode controller, the finite-time combination synchronization of three memristive FitzHugh-Nagumo(FHN) systems is carried out. This controller drives the system to achieve combination synchronization faster. The synchronization characteristics are investigated by the error curve of the combination systems, the curve of the sliding mode switching surface, and relationship curves of system variables, respectively. Numerical results are certified the correctness of the controller.

关键词： Synchronization Chaotic communication Memristors Switches Solitons Signal processing algorithms Numerical models

来源：评论

学校读者我要写书评

暂无评论

Launch overheads of spark applications on standalone and hadoop yarn clusters 1

引用

1st international Conference on Advances in Electrical and Computer Technologies, ICAECT 2019

作者： Janardhanan, P.S. Samuel, Philip SunTec Business Solutions Pvt Ltd Thejaswini TechnoPark Trivandrum India Department of Computer Science Cochin University of Science and Technology Kochi India

ISBN: (数字)9789811555589

ISBN: (纸本)9789811555572

Spark is widely used as a distributed computing framework for in-memory parallel processing of iterative applications. The basic unit of execution in Spark is executor. Spark applications perform well for applications in which repeated iterations are done on data stored in resilient distributed datasets (RDD). The RDDs reside on executors hosted on exclusively allocated JVMs. Application jobs are split and distributed on executors running in parallel on the nodes of a cluster. High performance for Spark applications is achieved by increasing parallelism by scaling up the number of executors. Spark can be configured to run on native standalone clusters or Hadoop YARN clusters. The run time of Spark applications can be divided into launch time and execution time. Launching Spark applications incurs overheads depending on the clustering framework. The execution time depends on the hardware capabilities of the servers of the node and the clustering framework. The launch overhead is proportional to the number of executors. This paper presents the results of the study done to determine the application launch overheads of Spark applications on two commonly used clustering platforms used for deploying Spark applications, namely standalone and Hadoop YARN clusters. To minimize the dependency of I/O overheads, a CPU intensive job is used for evaluating the launch overheads. On both types of clusters, the overheads are determined experimentally. The results of this study help in deciding the number of executors to minimize the impact of the launch overheads on run time. Models are developed using regression methods that can be used to predict the launch overheads of Spark applications on both types of clusters. © Springer Nature Singapore Pte Ltd 2020.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

Performance Evaluations of Noisy Approximate Quantum Fourier...

引用

IEEE international symposium on Parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Robert Basili Wenyang Qian Shuo Tang Austin Castellino Mary Eshaghian-Wilner Ashfaq Khokhar Glenn Luecke James P. Vary Department of Mathematics Department of Physics and Astronomy Iowa State University Ames Iowa USA Department of Physics and Astronomy Department of Mathematics Iowa State University Ames Iowa USA Department of Physics and Astronomy Iowa State University Ames Iowa USA Iowa State University Ames Iowa USA Department of Mathematics Iowa State University Ames Iowa USA Department of Electrical and Computer Engineering Iowa State University Ames Iowa USA

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor's algorithm, weighted sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM's superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands' superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. We analyze performance trends in our results and speculate on possible future development within this computational paradigm.

关键词： Performance evaluation Quantum computing Quantum algorithm Error analysis Computational modeling Qubit Logic gates

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共357页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：