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

When Edge Computing Meets Microgrid: A Deep Reinforcement Learning Approach

IEEE INTERNET OF THINGS JOURNAL 2019年第5期6卷 7360-7374页

作者： Munir, Md. Shirajum Abedin, Sarder Fakhrul Tran, Nguyen H. Hong, Choong Seon Kyung Hee Univ Dept Comp Sci & Engn Seoul 17104 South Korea Univ Sydney Sch Comp Sci Sydney NSW 2006 Australia

The computational tasks at multiaccess edge computing (MEC) are unpredictable in nature, which raises uneven energy demand for MEC networks. Thus, to handle this problem, microgrid has the potentiality to provides seamless energy supply from its energy sources (i.e., renewable, non-renewable, and storage). However, supplying energy from the microgrid faces challenges due to the high uncertainty and irregularity of the renewable energy generation over the time horizon. Therefore, in this paper, we study about the microgrid-enabled MEC networks' energy supply plan, where we first formulate an optimization problem and the objective is to minimize the energy consumption of microgrid-enabled MEC networks. The problem is a mixed integer nonlinear optimization with computational and latency constraints for tasks fulfillment, and also coupled with the dependencies of uncertainty for both energy consumption and generation. Therefore, we show that the problem is an NP-hard problem. As a result, second, we decompose our formulated problem into two subproblems: 1) energy-efficient tasks assignment problem for MEC into community discovery problem and 2) energy supply plan problem into Markov decision process. Third, we apply a low complexity density-based spatial clustering of applications with noise to solve the first subproblem for each base station distributedly. Sequentially, we use the output of the first subproblem as a input for solving the second subproblem, where we apply a model-based deep reinforcement learning. Finally, the simulation results demonstrate the significant performance gain of the proposed model with a high accuracy energy supply plan.

关键词： computational tasks deep reinforcement learning (RL) demand response (DR) energy management Internet of Things (IoT) microgrid multiaccess edge computing (MEC) unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Applying an auction optimization algorithm to mobile edge computing for security

引用

IET COMMUNICATIONS 2022年第10期16卷 1130-1141页

作者： Wang, Yi Tang, Tao Jiang, Fang Xu, Yaohua Li, Liping Huang, Rong Anhui Univ Minist Educ Key Lab Intelligent Comp & Signal Proc Hefei 230601 Anhui Peoples R China Chinese Acad Sci Key Lab Wireless Sensor Network & Commun Shanghai Inst Microsyst & Informat Technol Shanghai 200050 Peoples R China

The great demand for mobile blockchain computing power is often unsatisfied by terminal devices, so computational tasks are offloaded to edge computing servers. This paper proposes a new mobile communication blockchain assumption, forms a computing power alliance (CPA), and builds a smart contract-based security model. First, mining difficulty compensates for the personal computing power outside the CPA to increase the block generation difficulty. Second, contract account funds are used to increase the cost of malicious nodes seeking to launch forking attacks, and the duration is used to limit mining. Finally, a court trial is opened to select validators to verify the fork. The auction algorithm is used to allocate computing power in the CPA, and a price utility function is constructed to maximize social welfare. The joint optimization algorithm increases the transaction price and improves the system security. Simulation results verify that the system security increases with the blocked funds and duration, and the forking attack success rate approaches zero as the number of validators increases. The proposed algorithm provides considerable sum utility and average revenue gains versus traditional methods under different numbers of mobile users and computational capabilities, and the security of the algorithm is also higher.

关键词： auction optimization algorithm block generation difficulty CPA mobile communication blockchain assumption price utility function contract account funds computational capabilities system security increases validators increases mobile blockchain computing power terminal devices joint optimization algorithm edge computing optimisation mobile edge blocked funds computer network security forking attack success rate approaches forking attacks blockchains computational tasks personal computing power mobile users mobile computing mining difficulty compensates smart contract-based security model contracts auction algorithm computing power alliance

来源：评论

学校读者我要写书评

暂无评论

BLOCK DIAGONAL STRUCTURE IN DISCRETE-TRANSFORMS

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1989年第4期136卷 239-246页

作者： WU, JL Department of Computer Science and Information Engineering National Taiwan University Taipei Republic of China

The author investigates and summarises some of the computational tasks of discrete transforms in which block diagonal structure plays a dominant role. Walsh-Hadamard transform (WHT) based algorithm designs for various well known discrete transforms are presented; it can be proved that, owing to their block diagonal structure, the WHT based discrete transforms are more efficient than those of the conventional radix-ralgorithms for transforms of lengthN≤ 64. It is proved that block diagonal structures exist in the running Waish-Hadamard transform, the running discrete Hartley transform (DHT), and the running discrete cosine transform (OCT).With regard to block diagonal structure in the transform conversions between DHT and DCT, some existing research results are summarised, and an efficient architecture for generating multiple discrete transform simultaneously is proposed. The two-stage DFT algorithm proposed by Ersoy is extended to that of the DHT and it is proved that two stage DHTs possess a somewhat more interesting 'balanced-block-diagonal' structure. In the context of VLSI system design, two factors are of particular importance: the regularity of processor cells and local communication between processors. The hardware implementation of the block diagonal algorithm, for moderateN, just meets the above requirements. An example of the WHT/DHT is also included.

关键词： transforms Walsh-Hadamard transform local communication block diagonal structure discrete cosine transform hardware implementation Other numerical methods VLSI system design computational tasks discrete transforms discrete Hartley transform balanced-block-diagonal

来源：评论

学校读者我要写书评

暂无评论

Mapping function onto neuronal morphology

引用

JOURNAL OF NEUROPHYSIOLOGY 2007年第1期98卷 513-526页

作者： Stiefel, Klaus M. Sejnowski, Terrence J. Salk Inst Biol Studies Howard Hughes Med Inst Comp Neurol Lab San Diego CA 92138 USA Univ Calif San Diego Dept Biol San Diego CA USA

Mapping functions onto neuronal morphology. J Neurophysiol 98: 513-526, 2007;doi: 10.1152/jn.00865.2007. Neurons have a wide range of dendritic morphologies the functions of which are largely unknown. We used an optimization procedure to find neuronal morphological structures for two computational tasks: first, neuronal morphologies were selected for linearly summing excitatory synaptic potentials ( EPSPs);second, structures were selected that distinguished the temporal order of EPSPs. The solutions resembled the morphology of real neurons. In particular the neurons optimized for linear summation electrotonically separated their synapses, as found in avian nucleus laminaris neurons, and neurons optimized for spike-order detection had primary dendrites of significantly different diameter, as found in the basal and apical dendrites of cortical pyramidal neurons. This similarity makes an experimentally testable prediction of our theoretical approach, which is that pyramidal neurons can act as spike-order detectors for basal and apical inputs. The automated mapping between neuronal function and structure introduced here could allow a large catalog of computational functions to be built indexed by morphological structure.

关键词： .dendrites optimized Innovative Methodology optimization procedure nucleus laminaris temporal order EPSPs synaptic potentials Neuronal Morphology Function Onto dendritic morphologies computational tasks real neurons linear summation spike-order

来源：评论

学校读者我要写书评

暂无评论

The emergence of cellular computing

引用

COMPUTER 1999年第7期32卷 18-+页

作者： Sipper, M Swiss Fed Inst Technol Log Syst Lab CH-1015 Lausanne Switzerland

The von Neumann architecture-which is based upon the principle of one he von Neumann architecture-which is based upon the principle of one complex processor that sequentially performs a single complex task at a given moment-has dominated computing technology for the past 50 years. Recently, however, researchers have begun exploring alternative computational systems based on entirely different principles. Although emerging from disparate domains, the work behind these systems shares a common computational philosophy, which the author calls cellular computing. This philosophy promises to provide new means for doing computation more efficiently-in terms of speed, cost, power dissipation, information storage, and solution quality. Simultaneously, cellular computing offers the potential of addressing much larger problem instances than previously possible, at least for some application domains. Cellular computing has attracted increasing research interest. Work in this field has produced results that hold prospects for a bright future. Yet questions must be answered before cellular computing can become a mainstream paradigm. What classes of computational tasks are most suited to it? How do we match the specific properties and behaviors of a given model to a suitable class of problems?

关键词： alternative computational systems cellular arrays cellular computing computational tasks large problem instances locality parallel processing parallelism

来源：评论

学校读者我要写书评

暂无评论

computational Advantages in High Dimensions

Computational Advantages in High Dimensions

引用

作者： White, Stephen The Pennsylvania State University

学位级别：Ph.D., Doctor of Philosophy

Although computational tasks in high dimensions are often characterized as suffering from a “curse of dimensionality,” many random objects in high dimensions also exhibit significant concentration of measure, a phenomenon which has been characterized as a countervailing “blessing of dimensionality.” With high-dimensional data more prevalent than ever, understanding both how to avoid the pitfalls and how to leverage the advantages of high-dimensional randomness are now essential skills for any practitioner of data science, statistics, or applied *** this dissertation, we present three examples whereby the dimensional structure of a problem can be exploited to improve upon existing results or solve otherwise intractable problems. In Chapter 2, we study the sparse phase retrieval problem of recovering a sparse signal from only the magnitude of its Fourier transform. By exploiting the additional freedom provided in multiple dimensions, we show that in dimension greater than one the sparse phase retrieval problem admits solutions which are several orders of magnitude faster than comparable one-dimensional approaches. In Chapter 3, we consider the problem of sparse dictionary learning, a problem in machine learning in which we seek to recover a sparsely-used dictionary matrix D from many samples of the form yi = Dxi . We present a polynomial-time algorithm which recovers overcomplete matrices satisfying the restricted isometry property even when sparsity is nearly linear in the dimension of the samples yi. We prove recovery guarantees which are significantly stronger than previously known alternatives for the overcomplete, linear-sparsity regime. Finally, in Chapter 4 we present a solution to the problem of organism detection in metagenomics. By leveraging the high dimensional structure of genomic data and its interaction with existing dimension reduction strategies, we are able to develop a surprisingly simple algorithm that significantly outperforms existing

关键词： computational tasks High dimensions Dimensionality Metagenomics Fourier transform

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：