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

Proceedings of the 50th ACM Technical Symposium on Computer Science Education

作者： Rafael del Vado Vírseda Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)9781450358903

The purpose of this poster is to provide practical arguments to stimulate debate and discussion on whether or not to introduce concepts of theoretical computer science in the pre-university education system, conveniently adapted within students' capability. Theoretical computer science is a hard subject to teach at the university level. Many students who enter the computer sciences courses have very little mathematical or theoretical background. For this reason, it is important that students acquire an appreciation of these concepts before they leave the secondary education. In anticipation that these contents would not be included or addressed in the context of a subject of Computer Science, a work in progress educational experience is presented during the 2018-2019 academic year for enhancing the algorithmic curriculum of pre-university computing and mathematical courses. We describe a collection of selected problems, puzzles and riddles from high school mathematics and introductory logic, to be added to the current secondary curriculum. We want to show attendees the use of our educational activities, offering practical aspects that could not be shown through the reading of a paper, so that they can learn to use them in their own classes. The preliminary experimental results show that the students who have undergone this educational experience have obtained a higher motivation that those who have followed the course in its traditional form. We believe that introducing these theoretical computer concepts can help students to perform better in some areas of computer science and be increasingly prepared and motivated for their university studies.

关键词： computing curricula curriculum issues algorithmic complexity computability theory undergraduate studies

来源：评论

学校读者我要写书评

暂无评论

Dynamic Base Station Sleeping Scheme for Potential Super Density Networks

Dynamic Base Station Sleeping Scheme for Potential Super Den...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Li, Guo Jin, Shi Zheng, Fuchun Gao, Xiqi Wang, Xiaoyu Southeast Univ Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781479903085

The concept of super density network (SDN), which is founded by the idea of a very dense deployment of base stations (BSs), offers tremendous potential in terms of satisfying high data rate traffic requirements. On the other hand, the energy consumption of the cellular network, which has become a serious problem, is mostly due to the BSs rather than the mobile terminals. In this paper, we focus on reducing the energy consumption of the SDN by adjusting the BSs' working mode (active or sleep). Specifically, taking algorithm complexity and user behavior into consideration, we propose a dynamic BS sleeping scheme to dynamically turn some BSs into sleep mode, and a two-stage algorithm is applied to specifically determine which BSs are going to sleep every a fixed time interval aiming to track the traffic variations in time domain. In addition, in our scheme, the active BSs will improve their maximum transmit power to guarantee coverage. Simulation results show that, the active BS pattern well meets the time variation. Moreover, our proposed scheme can reduce the energy consumption effectively while guaranteeing a tolerable blocking probability.

关键词： energy consumption Sleep Blind source separation BASE STATION algorithmic complexity sleeping mode mobile terminal Scheme Bahamas TIME-DOMAIN

来源：评论

学校读者我要写书评

暂无评论

A MOBILE SYSTEM FOR NON-CENTRALIZED TARGET TRACKING IN PRESENCE OF DYNAMIC INTERFERENCES

A MOBILE SYSTEM FOR NON-CENTRALIZED TARGET TRACKING IN PRESE...

引用

European Signal Processing Conference

作者： Monica F. Bugallo Jonathan Beaudeau Petar M. Djuric Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY 11794-2350

ISBN: (纸本)9781479936878

This paper focuses on the application of particle filtering to tracking a single target by a network of mobile agents using measurements affected by dynamic interferences. The proposed solution is of general value and can be applied to systems with limited resources, and constraints on sensing modes, power and bandwidth utilization, and algorithm complexity. The highlight of the method is on its ability to handle multiple unknown dynamic sources of interference by compensation, which does not require prior information about the number of interferers, their locations, mobilities and powers, and does not attempt direct estimation of the number of interferers and their parameters and dynamics. The solution relies on a model that introduces a bias in the measurement equation that accounts for the interference contributions. We provide simulation results which demonstrate the performance of the proposed system.

关键词： Mobile target tracking particle filtering interference compensation Particle filters interference Targets algorithmic complexity tracking Power (Psychology) Mobile agents presences

来源：评论

学校读者我要写书评

暂无评论

The Best-partitions Problem: How to Build Meaningful Aggregations

The Best-partitions Problem: How to Build Meaningful Aggrega...

引用

IEEE/WIC/ACM International Conference on Intelligence Agent Technology

作者： Robin Lamarche-Perrin Yves Demazeau Jean-Marc Vincent Univ. Grenoble Alpes LIG CNRS LIG

ISBN: (纸本)9781479939329

The design and the debugging of large distributed AI systems require abstraction tools to build tractable macroscopic descriptions. Data aggregation provides such tools by partitioning the system dimensions into aggregated pieces of information. Since this process leads to information losses, the partitions should be chosen with the greatest caution. While the number of possible partitions grows exponentially with the size of the system, this paper proposes an algorithm that exploits exogenous constraints regarding the system semantics in order to find the best partitions in a linear or polynomial time. Two constrained sets of partitions (hierarchical and ordered) are detailed and applied to spatial and temporal aggregation of an agent-based model of international relations. The algorithm succeeds in providing meaningful high-level abstractions for the system analysis.

关键词： Data aggregation Large-scale MAS algorithmic complexity Spatial and temporal analysis News analysis

来源：评论

学校读者我要写书评

暂无评论

H-Trust: A Robust and Lightweight Group Reputation System for Peer-to-Peer Desktop Grid

H-Trust: A Robust and Lightweight Group Reputation System fo...

引用

International Conference on Distributed Computing Systems Workshop

作者： Huanyu Zhao Xiaolin Li Scalable Software Systems Laboratory Department of Computer Science Oklahoma State University Stillwater OK USA

ISBN: (纸本)9781424431755

We propose a robust and lightweight group reputation system, called H-Trust, inspired by the h-index aggregation technique. Leveraging the robustness of the h-index algorithm under incomplete and uncertain circumstances, H-Trust offers a robust reputation evaluation mechanism for both individual and group trusts with minimal communication and computation overheads. The five phases of H-Trust scheme are presented in detail, including trust recording, local trust evaluation, trust query phase, spatial-temporal update phase, and group reputation evaluation phases. The rationale for its design, the analysis of the algorithm complexity and security level are further elaborated. To validate the performance of H-Trust scheme, we conduct multi-agent based simulations. Simulation results demonstrate that H-Trust is robust and can aggregate cooperative groups in systems even when the majority of users are malicious.

关键词： algorithmic complexity Reputation Nonprofit Organizations Robustness trust Trust Security level Lightweight Phase peer to peer

来源：评论

学校读者我要写书评

暂无评论

Dichotomy for Holant* Problems with a Function on Domain Size 3 13

Dichotomy for Holant* Problems with a Function on Domain Siz...

引用

Symposium on Discrete Algorithms

作者： Jin-Yi Cai Pinyan Lu Mingji Xia University of Wisconsin-Madison and Peking University. Microsoft Research Asia. Max-Planck Institut für Informatik.

ISBN: (纸本)9781627484855

Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the Boolean domain. In this paper, we give the first dichotomy theorem for Holant problems for domain size greater than two. We discover unexpected tractable families of counting problems, by giving new polynomial time algorithms. This paper also initiates holographic reductions in domains of size greater than two. This is our main algorithmic technique, and is used for both tractable families and hardness reductions. The dichotomy theorem is the following: For any complex-valued symmetric function F with arity 3 on domain size 3, we give an explicit criterion on F, such that if F satisfies the criterion then the problem Holant* (F) is computable in polynomial time, otherwise Holant* (F) is #P-hard.

关键词： Holant problems constraint satisfaction problem Holant constraint satisfaction problems dichotomies Fluorine (F) Domain algorithmic complexity Polynomial time

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Model Predictive Control for Resource Distribution

Hierarchical Model Predictive Control for Resource Distribut...

引用

2010 49th IEEE Conference on Decision and Control

作者： Jan Bendtsen Klaus Trangbaek Jakob Stoustrup Department of Electronic Systems Automation and Control Aalborg University Denmark

ISBN: (纸本)9781424477456

This paper deals with hierarchical model predictive control (MPC) of distributed systems. A three-level hierarchical approach is proposed, consisting of a high level MPC controller, a second level of so-called aggregators, controlled by an online MPC-like algorithm, and a lower level of autonomous units. The approach is inspired by smart-grid electric power production and consumption systems, where the flexibility of a large number of power producing and/or consuming units can be exploited in a smart-grid solution. The objective is to accommodate load variations on the grid, arising from varying consumption and natural variations in power production, e.g. from wind turbines. The approach presented is based on quadratic optimi-sation and has low algorithmic complexity as well as good scalability. In particular, the proposed design methodology facilitates plug-and-play addition of subsystems without controller redesign. The method is verified by simulating a three-level smart-grid power control system for a small isolated power grid.

关键词： Smart grids Power production hierarchical models algorithmic complexity Predictive control load changes Power grids Controllers HIGH POWER SUB-SYSTEM three-level Power system control

来源：评论

学校读者我要写书评

暂无评论

SLA Guaranteed Virtual Machine Consolidation for Computing Clouds

SLA Guaranteed Virtual Machine Consolidation for Computing C...

引用

IEEE International Conference on Communications

作者： Zhe Huang Danny H. K. Tsang Department of Electronic & Computer Engineering The Hong Kong University of Science and Technology

ISBN: (纸本)9781457720529

One of the most attractive features that computing clouds can offer is that the data center maintenance cost can be reduced by consolidating the workload generated by the virtual machines (VMs) into a few powerful physical servers. In this paper, the problem of maximally consolidating heterogeneous virtual machines into servers while protecting the service level agreement of each virtual machine is investigated. A generic and robust VM workload consolidation framework is proposed. The proposed framework achieves several attractive properties like low maintenance cost, low algorithm complexity, adjustable resource provisioning aggressiveness, and good scalability.

关键词： virtual machines Service level agreements algorithmic complexity Servers low-maintenance Clouds Consolidation SLA gene Maintenance costs Workload

来源：评论

学校读者我要写书评

暂无评论

Overlapping Coalition Formation Games: Charting the Tractability Frontier 12

Overlapping Coalition Formation Games: Charting the Tractabi...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Yair Zick Georgios Chalkiadakis Edith Elkind School of Physical and Mathematical Sciences Nanyang Technological University Department of Electronic and Computer Engineering Technical University of Crete

ISBN: (纸本)9781627481564

Cooperative games with overlapping coalitions (OCF games) model scenarios where agents can distribute their resources among several tasks; each task generates a profit which may be freely divided among the agents participating in the task. The goal of this work is to initiate a systematic investigation of algorithmic aspects of OCF games. We propose a discretized model of overlapping coalition formation, where each agent i ∈ N has a weight w_i ∈ N and may allocate an integer amount of weight to any task. Within this framework, we focus on the computation of outcomes that are socially optimal and/or stable. We discover that the algorithmic complexity of the associated problems crucially depends on the amount of resources that each agent possesses, the maximum coalition size, and the pattern of interaction among the agents. We identify several constraints that lead to tractable subclasses of OCF games, and provide efficient algorithms for games that belong to these subclasses. We supplement our tractability results by hardness proofs, which clarify the role of our constraints.

关键词： Overlapping Coalition Formation complexity Bounded Tree width Game theory Agents Subclasses algorithmic complexity Drafting Frontier

来源：评论

学校读者我要写书评

暂无评论

A GENERAL-APPROACH TO REMOVING DEGENERACIES

引用

SIAM JOURNAL ON COMPUTING 1995年第3期24卷 650-664页

作者： EMIRIS, IZ CANNY, JF

We wish to increase the power of an arbitrary algorithm designed for nondegenerate input by allowing it to execute on all inputs. We concentrate on infinitesimal symbolic perturbations that do nor affect the output for inputs in general position. Otherwise, if the problem mapping is continuous, the input and output space topology are at least as coarse as the real euclidean one, and the output space is connected, then our perturbations make the algorithm produce an output arbitrarily close or identical to the correct one, For a special class of algorithms, which includes several important algorithms in computational geometry, we describe a deterministic method that requires no symbolic computation. Ignoring polylogarithmic factors, this method increases the worst-case bit complexity only by a multiplicative factor which is linear in the dimension of the geometric space. For general algorithms, a randomized scheme with an arbitrarily high probability of success is proposed: the bit complexity is then bounded by a small-degree polynomial in the original worst-case complexity. In addition to brine simpler than previous ones, these are the first efficient perturbation methods.

关键词： INPUT DEGENERACY ILL-CONDITIONED PROBLEMS SYMBOLIC PERTURBATION INFINITESIMALS RANDOMIZATION DETERMINANTS ROOTS OF POLYNOMIALS algorithmic complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：