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

Dispersed Automation for Industrial Internet of Things

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2020年第3期17卷 1176-1181页

作者： Quiros, Gustavo Cao, Diansong Canedo, Arquimedes Siemens Corp Technol Princeton NJ 08540 USA Siemens Corp Technol Beijing 100102 Peoples R China

This position article presents dispersed automation, a novel approach for reprogramming the omnipresent industrial Internet of Things (IIoT) devices in critical infrastructure for the co-execution of general-purpose computation workloads in an optimal and reliable manner. The key observation is that IIoT devices are available in large quantities in critical infrastructure. However, these devices are often underutilized due to the conservative allocation of resources, static task assignment, and lack of exploitation of parallelism. Dispersed automation gives new life to IIoT devices, some of them as powerful as general-purpose computers, and makes them accessible for the co-execution of various computational workloads, while dynamically adapting to different applications and operational environments. Two key contributions make this possible: the use of a domain-specific language and on-channel computation. We present dispersed automation as an enabling technology for the implementation of future smart and adaptive IIoT systems. Note to Practitioners-In this article, we explain our concept and vision on how programs can be created and designed in a way that makes it possible to run them on IIoT networks with a greater amount of flexibility than we have today. With this technology, it will be possible for programs to adapt to changes in their operation, and to changes in the network environment, in order to better utilize the available hardware resources. This means that a dispersed automation system can continue its operation in certain situations where a traditionally deployed system would fail due to insufficient resources (e.g., memory, processing speed). It also means that the software can make better use of the underlying hardware whenever a special task needs to be carried out (e.g., a "heavy" diagnostic process). We show some experimental results of using our approach based on simulation. The way forward is to implement and evaluate this technology in an indust

关键词： Automation Real-time systems Task analysis Programming DSL Runtime Internet of Things Automation computer languages distributed computing dynamic compiler Internet of Things (IoT)

来源：评论

学校读者我要写书评

暂无评论

A METHOD FOR IMPROVED DISTRIBUTION CONCENTRATION IN THE TIME-FREQUENCY ANALYSIS OF MULTICOMPONENT SIGNALS USING THE L-WIGNER DISTRIBUTION

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1995年第5期43卷 1262-1268页

作者： STANKOVIC, L Elektrotehnicki fakultet Montenegro

The energy location in the Cohen class of time-frequency distributions is analyzed, If the instantaneous frequency is linear, then only the Wigner distribution produces the ideal energy concentration, The scaled version of the Wigner distribution (L-Wigner distribution), is used to improve the time-frequency representation of signals with nonlinear instantaneous frequencies. In the case of multicomponent signals, the cross terms, appearing in the Wigner distribution and in the L-Wigner distribution, can be easily removed or reduced in a computationally very efficient way. The theory is illustrated on the numerical examples with multicomponent noisy signals.

关键词： Time frequency analysis Fourier transforms Signal analysis Kernel distributed computing

来源：评论

学校读者我要写书评

暂无评论

COMPUTER-ANALYSIS OF IMPEDANCE EFFECTS IN LARGE GROUNDING SYSTEMS

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 1987年第3期23卷 490-497页

作者： SIMPSON, IBK BENSTED, DJ DAWALIBI, F BLIX, ED ALCAN SMELTERS & CHEM LTD BC POWER OPERATKITIMAT V8C 2H2BCCANADA SAFE ENGN SERV LTD MONTREAL H3M 2Z9QUEBECCANADA

In large plants with high primary fault levels, the whole plant must be considered as forming the ground grid for the return of primary fault current. The internal impedance of the equivalent ground grid must be taken into account in grid potential rise calculations, as grid potentials transferred from one area of the plant may cause hazardous touch potentials at other locations. Field measurements and computer analyses to calculate the distribution of grid potential rise in a large grounding system are presented.

关键词： Impedance Grounding Bonding Fault currents Smelting Power system interconnection Substations distributed computing Power system security Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Combining analytical modeling, realistic simulation and real experimentation for the optimization of Monte-Carlo applications on the European Grid Infrastructure

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2016年 57卷 13-23页

作者： Camarasu-Pop, Sorina Glatard, Tristan Benoit-Cattin, Hugues Univ Lyon 1 CREATIS CNRS UMR5220 Inserm U1044INSA Lyon F-69622 Villeurbanne France

Evaluating the performance of distributed systems through real experimentation is resource-consuming and by essence very difficult to reproduce. Conversely, analytical modeling and simulation facilitate investigation, but their level of realism needs to be evaluated to avoid misinterpretation. In this paper, we combine production experiments and realistic simulation for performance modeling and optimization of application workflows deployed on the European Grid Infrastructure (EGI), one of the largest distributed systems in the world. We use a validated simulator to (i) exhaustively evaluate an analytical model of the application makespan and (ii) study the influence and calibrate the parameters of the application workflow, in particular the checkpointing period. Experimental results show that the model fits the simulated makespan with a relative error of at most 15%, and that simulation allows us to validate analytical models in a more exhaustive manner than what is possible with production experiments. Results also show that, provided that the simulator is correctly validated and instantiated, simulation can be safely used for exhaustive parameter studies, allowing for a quick and fine tuning of sensitive application parameters. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Simulation distributed computing Modeling Optimization EGI

来源：评论

学校读者我要写书评

暂无评论

A STOCHASTIC COMPUTER-MODEL FOR HEATING AND COOLING LOADS

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1988年第3期3卷 1213-1219页

作者： MORTENSEN, RE HAGGERTY, KP HUGHES AIRCRAFT CO EL SEGUNDO CA 90245 USA

The authors review the concept of demand-side management, particularly in regard to utility intervention into the setpoint adjustment of customers' thermostats for heating and/or cooling loads. As part of a larger effort to develop a large simulation to evaluate performance of various management strategies, they have created a simple, realistic, easily implementable model for the temperature of a house having a heater/air-conditioner which is regulated by a thermostat and operates in an environment that contains random elements. Two models previously given in the literature are reviewed before giving the details of the model, the feature of which is that it is a stochastic model operating in discrete time. Computer results show good agreement with basic physical principles, and suggest that the probability distributions of on-time and off-time are negative binomial. It is concluded that this model will provide a useful tool in the evaluation of load-management strategies.< >

关键词： Stochastic processes Heating Cooling Thermal management Thermostats Computational modeling Environmental management Temperature distributed computing Physics computing

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing c-wave algorithms for arbitrary networks

引用

computing 2023年第1期105卷 53-88页

作者： Karaata, Mehmet Hakan Alrashed, Ebrahim Allaho, Mohammad Kuwait Univ Dept Comp Engn 13060 POB 5969 Safat Kuwait

In this paper, we propose the first self-stabilizing c-wave algorithm for broadcasting large size messages from multiple initiator processes such that every process receives at least one of these messages broadcast by the initiators. The proposed algorithm first splits each message into a sequence of message shares and then broadcasts the message shares in a pipelined manner in order. We then present an improved maximally concurrent self-stabilizing c-wave algorithm called dynamic clusteringc-wavealgorithm that constructs dynamic broadcast trees by allowing a process to dynamically change its parent to a neighbouring process with the most message shares to implement a maximally concurrent broadcasting of large size messages. The improved algorithm is maximally concurrent in the sense that a process is allowed to receive a message share from any neighbouring process with a larger sequence of message shares than its current parent from which it receives message shares in the broadcast trees constructed by the initiators when available. We implemented and experimentally evaluated the c-wave algorithm to compare its message propagation delay to those of the m and the k-wave algorithms. Simulation results show that the proposed algorithm significantly reduces the broadcast propagation delays compared to that of the m and the k-wave algorithms. The improvement is more evident over the m-wave algorithm. Solutions to global-snapshots, distributed broadcast and various synchronization problems can be solved efficiently using c-wave algorithms. In addition, the proposed algorithms have applications in blockchain, mobile wireless sensor networks, VANETs and military communication networks.

关键词： c-wave distributed computing Multi-node broadcast m-wave Self-stabilization Wave algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast and Secure Computational Offloading With Lagrange Coded Mobile Edge computing

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第5期70卷 4924-4942页

作者： Asheralieva, Alia Niyato, Dusit Southern Univ Sci & Technol Dept Comp Sci & Engn Shenzhen 518055 Guangdong Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore

This paper proposes a novel framework based on Lagrange coded computing (LCC) for fast and secure offloading of computing tasks in the mobile edge computing (MEC) network. The network is formed by multiple base stations (BSs) acting as "masters" which offload their computations to edge devices acting as "workers". The framework aims to ensure efficient allocation of computing loads and bandwidths to workers, and providing them with proper incentives to finish their tasks by the specified deadlines. Thus, each master must decide on the amounts of allocated load and bandwidth, and a service fee paid to each worker given that: i) other masters, i.e., BSs, can be privately-owned or controlled by different operators, i.e., they do not communicate/coordinate their decisions with the master;ii) workers are heterogeneous non-dedicated edge devices with constrained and nondeterministic computing resources. As such, masters compete for the best workers in a stochastic and partially-observable environment. To describe interactions between masters and workers, we formulate a new stochastic auction model with contingent values of bidders, i.e., masters and contingent payments to auctioneers, i.e., workers. To solve the auction, we represent it as a stochastic Bayesian game and develop machine learning algorithms to improve the auction solution.

关键词： Task analysis Stochastic processes distributed computing Resilience Servers Security Resource management Auction theory Bayesian methods coded distributed computing game theory incomplete information Internet of things machine learning Markov processes mobile edge computing resiliency resource allocation and pricing security

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT ALGORITHMS FOR A CLASS OF PARTITIONING PROBLEMS

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1995年第2期6卷 170-175页

作者： IQBAL, MA BOKHARI, SH Department of Electrical Engineering University of Engineering and Technology Lahore Pakistan

We address the problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. We describe polynomial exact and approximate algorithms for this class that are better than any of the previously reported algorithms. Our approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic task can then be carried out using fast search techniques.

关键词： APPROXIMATION ALGORITHMS ASSIGNMENTS CHAINS distributed computing HOST-SATELLITE SYSTEMS LOAD BALANCING PARTITIONING PARALLEL PROCESSING TREES

来源：评论

学校读者我要写书评

暂无评论

Fast approximate shortest paths in the congested clique

引用

distributed computing 2021年第6期34卷 463-487页

作者： Censor-Hillel, Keren Dory, Michal Korhonen, Janne H. Leitersdorf, Dean Technion Dept Comp Sci Haifa Israel IST Austria Klosterneuburg Austria

We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include: - A (2 + epsilon)-approximation for all-pairs shortest paths in O(log(2) n/epsilon) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model. - A(1 + epsilon)-approximation for multi-source shortest paths from O(root n) sources in O(log(2) n/epsilon) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in (O) over tilde (n(1/6)) rounds.

关键词： distributed computing Congested clique model All-pairs shortest paths Matrix multiplication Hopsets

来源：评论

学校读者我要写书评

暂无评论

A FIELD CONJUGATION METHOD FOR DIRECT SYNTHESIS OF HYPERTHERMIA PHASED-ARRAY HEATING PATTERNS

引用

IEEE TRANSACTIONS ON ULTRASONICS FERROELECTRICS AND FREQUENCY CONTROL 1989年第1期36卷 3-9页

作者： IBBINI, MS CAIN, CA UNIV ILLINOIS FAC BIOENGNURBANAIL 61801

A phased-array field conjugation method is investigated as a means for synthesizing directly many ultrasound field patterns useful for tumor heating. For virtually any ultrasound phased array, the method permits the computation of element driving amplitude and phase distributions appropriate for synthesizing directly diffuse heating patterns without the need for mechanical or electrical scanning. Moreover, the proposed method offers the possibility of creating simultaneously, at different sites, more than one focus, which can then be scanned electronically. This attractive feature eliminates the need for operating at high spatial-peak temporal-peak focal intensities, a potential problem associated with conventional scanning, while achieving a desired heating pattern. The method is applied to two different applicator configurations: a concentric-ring and a square n*n array. Computer simulations of different heating patterns, synthesized using the field conjugation method, are presented. Important practical design parameters, such as the size and number of the array elements, are discussed.< >

关键词： Hyperthermia Phased arrays Ultrasonic imaging Neoplasms Applicators Production Shape distributed computing Resistance heating

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：