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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78,668 篇 会议
4,290 篇 期刊文献

馆藏范围

82,958 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,626 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,761 篇 电气工程
- 2,980 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,958 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,760 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 82958 条记录，以下是701-710 订阅

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

详细简洁

排序：

Augmenting Practical Cross-layer MAC Schedulers via Offline Reinforcement Learning 28

Augmenting Practical Cross-layer MAC Schedulers via Offline ...

引用

28th Annual IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Pianese, Fabio Danielsen, Peter J. Nokia Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)9781538635315

An automated offline design process for optimized cross-layer schedulers can produce augmented scheduling algorithms tailored to a target deployment scenario. We discuss the application of ODDS, a reinforcement learning technique we introduced, for augmenting LTE MAC scheduler algorithms of practical significance. ODDS observes the correlation between the value of a utility function and the cross-layer state parameters seen by an instrumented baseline scheduler, determining the best actions via an offline Monte Carlo exploration of the problem space. The result of the ODDS process is a compact definition of a scheduling policy that has been optimized for a target scenario and utility function. In this paper we instrument a production scheduler definition to evaluate the potential of augmented schedulers in practical use, and experiment with awareness to application traffic properties by using a multi-class utility function, yielding scheduling policies that behave differently depending on the features of individual traffic classes.

关键词： Optimization algorithm design and analysis Training Measurement Production Throughput Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed, Multi-Level Network Anomaly Detection for Datacentre Networks

Distributed, Multi-Level Network Anomaly Detection for Datac...

引用

IEEE International Conference on Communications (ICC)

作者： Iordache, Mircea Jouet, Simon Marnerides, Angelos K. Pezaros, Dimitrios P. Univ Glasgow Sch Comp Sci Glasgow G12 8QQ Lanark Scotland Univ Lancaster Sch Comp & Commun InfoLab21 Lancaster LA1 4WA England

ISBN: (纸本)9781467389990

Over the past decade, numerous systems have been proposed to detect and subsequently prevent or mitigate security vulnerabilities. However, many existing intrusion or anomaly detection solutions are limited to a subset of the traffic due to scalability issues, hence failing to operate at line-rate on large, highspeed datacentre networks. In this paper, we present a two-level solution for anomaly detection leveraging independent execution and message passing semantics. We employ these constructs within a network-wide distributed anomaly detection framework that allows for greater detection accuracy and bandwidth cost saving through attack path reconstruction. Experimental results using real operational traffic traces and known network attacks generated through the Pytbull IDS evaluation framework, show that our approach is capable of detecting anomalies in a timely manner while allowing reconstruction of the attack path, hence further enabling the composition of advanced mitigation strategies. The resulting system shows high detection accuracy when compared to similar techniques, at least 20% better at detecting anomalies, and enables full path reconstruction even at smallto- moderate attack traffic intensities (as a fraction of the total traffic), saving up to 75% of bandwidth due to early attack detection.

关键词： Measurement Monitoring Entropy Internet algorithm design and analysis Semantics Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Testing Proportional-Integral-Derivative (PID) Controller with Metamorphic Testing 28

Testing Proportional-Integral-Derivative (PID) Controller wi...

引用

28th IEEE International Symposium on Software Reliability Engineering

作者： Qiu, Kun Zheng, Zheng Chen, Tsong Yueh Beihang Univ Beijing Peoples R China Swinburne Univ Technol Melbourne Vic Australia

ISBN: (纸本)9781538623879

The controller program is the core of a safety-critical control system. However, the testing of controller program has been facing challenges because of the oracle problem. Since Proportional-Integral-Derivative (PID) controller is the most commonly used controller in the industry, this paper proposes to apply Metamorphic Testing (MT) to test it. Our experimental results show that MT is effective in testing PID controller.

关键词： Testing algorithm design and analysis Mathematical model PD control Electronic mail Feedback loop Proportional derivative control algorithm design and analysis electronic mail Feedback loop Proportional Integral Derivative Control Mathematical Model Proportional integral derivative Metamorphic MT machine translation

来源：评论

学校读者我要写书评

暂无评论

A Novel Intelligent Mechanism for Monitoring in Wireless Sensor Networks

A Novel Intelligent Mechanism for Monitoring in Wireless Sen...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Khelifi, Fekher Bradai, Abbas Kaddachi, Med Lassaad Rawat, Priyanka Univ Monastir Lab Elect & Microelect Monastir 5019 Tunisia Univ Poitiers XLIM Inst F-86130 Poitiers France Univ Avignon LIA CERI Avignon France

ISBN: (纸本)9781509055449

One of the main fundamental problems in designing a sensor network is to detect and locate their positions. Hence, sensors can be utilized for data collection in order to detect and organize the objects of interest. In this paper, we present a novel mechanism for object localization and detection in protected areas and surveillance zones. The goal of the proposed approach is to enhance area supervision and localize objects efficiently in wireless sensor networks.

关键词： Wireless sensor networks Clustering algorithms Base stations Monitoring algorithm design and analysis Communication system security Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Computational Resource Constrained Multi-Cell Joint Processing in Cloud Radio Access Networks

Computational Resource Constrained Multi-Cell Joint Processi...

引用

IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)

作者： Han, Chao Wang, Wei Wang, Yitu Zhang, Zhaoyang Zhejiang Univ Zhejiang Prov Key Lab Informat Proc Commun & Netw Coll Informat Sci & Elect Engn Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9781467389990

Centralized joint processing has been demonstrated to achieve significant performance gain over the conventional per-cell processing by avoiding the inter-cell interference in cloud radio access networks (C-RANs), but full scale cooperation over the entire network is infeasible due to its huge computational complexity. The goal of this paper is to design remote radio head (RRH) clustering and the associated power allocation algorithm under computational resource constraint for C-RANs, which is challenging due to the combinatorial clustering problem with non-convex constraints. To overcome the challenge, our design consists of two technical steps. 1) Considering the maximization of the sum data rate, we reformulate both the objective function and the computational resource constraint via relaxation and successive convex approximation (SCA) technique. 2) By exploiting the structure of this problem, we propose a low-complexity algorithm to decouple RRH clustering and power allocation and solve them iteratively. Furthermore, we prove the convergence property of the proposed iterative algorithm. Finally, our proposed algorithm is evaluated by simulation to show its superiority on throughput performance over conventional algorithms.

关键词： Resource management Optimization Clustering algorithms Signal processing algorithms algorithm design and analysis Approximation algorithms Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Energy Trading between Microgrids towards Individual Cost and Social Welfare Optimization 13

Energy Trading between Microgrids towards Individual Cost an...

引用

13th IEEE Conference on Automation Science and Engineering (IEEE CASE)

作者： Qiao, Zhenyu Yang, Bo Xu, Qimin Xiong, Fei Chen, Cailian Guan, Xinping Chen, Bei Shanghai Jiao Tong Univ Dept Automat Shanghai Peoples R China Minist Educ China Key Lab Syst Control & Informat Proc Shanghai Peoples R China Collaborat Innovat Ctr Adv Ship & Deep Sea Explor Shanghai Peoples R China Shanghai Univ Engn Sci Shanghai Peoples R China

ISBN: (纸本)9781509067817

High penetration of renewable energy source makes microgrid (MGs) be environment friendly. However, the stochastic input from renewable energy resource brings difficulty in balancing the energy supply and demand. Purchasing extra energy from macrogrid to deal with energy shortage will increase MG energy cost. To mitigate intermittent nature of renewable energy, energy trading and energy storage which can exploit diversity of renewable energy generation across space and time are efficient and cost-effective methods. But a storage with large capacity will incur additional cost. In addition, due to MG participating energy trading as prosumer, it calls for an efficient trading mechanism. Therefore, this paper focuses on the problem of MG energy management and trading. Energy trading problem is formulated as a stochastic optimization one with both individual profit and social welfare maximization. Firstly a Lyapunov optimization based algorithm is developed to solve the stochastic problem. Secondly the double-auction based mechanism is provided to attract MGs' truthful bidding for buying and selling energy. Through theoretical analysis, we demonstrate that individual MG can achieve a time average energy cost close to offline optimum with tradeoff between storage capacity and energy trading cost. Meanwhile the social welfare is also asymptotically maximized under double auction. Simulation results based on real world data show the effectiveness of our algorithm.

关键词： Energy storage Renewable energy sources Optimization algorithm design and analysis Microgrids Energy loss

来源：评论

学校读者我要写书评

暂无评论

Fair Caching algorithms for Peer Data Sharing in Pervasive Edge Computing Environments 37

Fair Caching Algorithms for Peer Data Sharing in Pervasive E...

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Huang, Yaodong Song, Xintong Ye, Fan Yang, Yuanyuan Li, Xiaoming SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China

ISBN: (纸本)9781538617915

Edge devices (e.g., smartphones, tablets, connected vehicles, IoT nodes) with sensing, storage and communication resources are increasingly penetrating our environments. Many novel applications can be created when nearby peer edge devices share data. Caching can greatly improve the data availability, retrieval robustness and latency. In this paper, we study the unique issue of caching fairness in edge environment. Due to distinct ownership of peer devices, caching load balance is critical. We consider fairness metrics and formulate an integer linear programming problem, which is shown as summation of multiple Connected Facility Location (ConFL) problems. We propose an approximation algorithm leveraging an existing ConFL approximation algorithm, and prove that it preserves a 6.55 approximation ratio. We further develop a distributed algorithm where devices exchange data reachability and identify popular candidates as caching nodes. Extensive evaluation shows that compared with existing wireless network caching algorithms, our algorithms significantly improve data caching fairness while keeping the contention induced latency similar to the best existing algorithms.

关键词： Approximation algorithms Delays algorithm design and analysis Peer-to-peer computing Wireless networks Distributed databases Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Differential Privacy in Quantum Computation 30

Differential Privacy in Quantum Computation

引用

30th IEEE Computer Security Foundations Symposium (CSF)

作者： Zhou, Li Ying, Mingsheng Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Univ Technol Sydney CQSI FEIT Sydney NSW Australia Chinese Acad Sci SKLCS Inst Software Beijing Peoples R China

ISBN: (纸本)9781538632178

More and more quantum algorithms have been designed for solving problems in machine learning, database search and data analytics. An important problem then arises: how privacy can be protected when these algorithms are used on private data? For classical computing, the notion of differential privacy provides a very useful conceptual framework in which a great number of mechanisms that protect privacy by introducing certain noises into algorithms have been successfully developed. This paper defines a notion of differential privacy for quantum information processing. We carefully examine how the mechanisms using three important types of quantum noise, the amplitude/phase damping and depolarizing, can protect differential privacy. A composition theorem is proved that enables us to combine multiple privacy-preserving operations in quantum information processing.

关键词： Privacy Quantum computing Data privacy Quantum mechanics algorithm design and analysis Hilbert space Damping

来源：评论

学校读者我要写书评

暂无评论

On Energy-Efficient Congestion Control for Multipath TCP 37

On Energy-Efficient Congestion Control for Multipath TCP

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Zhao, Jia Liu, Jiangchuan Wang, Haiyang Simon Fraser Univ Sch Comp Sci Burnaby BC Canada Univ Minnesota Dept Comp Sci Duluth MN 55812 USA

ISBN: (纸本)9781538617915

Multipath TCP ( MPTCP) enables transmission via multiple routes for an end-to-end connection to improve resource usage of regular TCP. Due to the increasing concern in green computing, there has been significant interest in designing energyefficient multipath transport. For existing MPTCP congestion control algorithms, the research community still lacks a comprehensive understanding of which components in such an algorithm play the fundamental role in energy efficiency, how various algorithms compare against each other from energy-consuming perspective, or whether there exist potentially better solutions for energy saving. In this paper, we take a first step to answer these questions. Based on the MPTCP Linux kernel experiments, we first summarize that the energy consumption is related to three aspects: average throughput, path delay and different network scenarios. In order to bridge congestion control to the three aspects, we analyze the existing algorithms and capture the essential parameters of multipath congestion control model related to MPTCP's energy-efficiency. Then we design a window increase factor to shift traffic to low-delay energy-efficient paths. We further extend this design by using an energy-aware compensative parameter to fit the general hierarchical Internet topology. We evaluate the performance of existing multipath congestion control algorithms and our proposed algorithm in different network scenarios. The results successfully validate the improved energy efficiency of our design.

关键词： algorithm design and analysis Throughput Energy consumption Power demand Wireless fidelity Kernel Linux

来源：评论

学校读者我要写书评

暂无评论

A distributed primal-dual algorithm for computation of generalized Nash equilibria via operator splitting methods 56

A distributed primal-dual algorithm for computation of gener...

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Yi, Peng Pavel, Lacra Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781509028733

In this paper, we propose a distributed algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over networks. We consider games in which the feasible decision sets of all players are coupled together by a globally shared affine constraint. Adopting the variational GNE as a refined solution, we reformulate the problem as that of finding the zeros of a sum of monotone operators through a primal-dual analysis and an augmentation of variables. Then we introduce a distributed algorithm based on forward-backward operator splitting methods. Each player only needs to know its local objective function, local feasible set, and a local block of the affine constraint, and share information with its neighbours. We show convergence of the proposed algorithm for fixed step-sizes. Numerical simulations are given for networked Cournot competition with bounded market capacities.

关键词： Games Linear programming Couplings Convergence Distributed algorithms algorithm design and analysis Computational modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：