A Map-Reduce Approach for the Dijkstra Algorithm in SDN Over Osmotic Computing Systems

2021 ◽  
Author(s):  
Maria Fazio ◽  
Alina Buzachis ◽  
Antonino Galletta ◽  
Antonio Celesti ◽  
Jiafu Wan ◽  
...  
Keyword(s):  
Map Reduce ◽  
Dijkstra Algorithm ◽  
Computing Systems

scholarly journals Dimensioning Scientific Computing Systems to Improve Performance of Map-Reduce based Applications

2012 ◽  
Vol 9 ◽  
pp. 226-235 ◽  
Author(s):  
Gabriel G. Castañè ◽  
Alberto Núneñ ◽  
Rosa Filgueira ◽  
Jesús Carretero
Keyword(s):  
Scientific Computing ◽  
Map Reduce ◽  
Improve Performance ◽  
Computing Systems

Artefact in 20Å-Resolution Electron Images of Negatively Stained Twodimensional Membrane Protein Crystals

1982 ◽  
Vol 40 ◽  
pp. 92-93
Author(s):  
Douglas L. Dorset ◽  
Barbara Moss
Keyword(s):  
Electron Scattering ◽  
Cross Correlation ◽  
Transmission Function ◽  
Group Symmetry ◽  
Asymmetric Structure ◽  
Object Model ◽  
Phase Object ◽  
Computing Systems ◽  
Resolution Electron ◽  
Plane Group

A number of computing systems devoted to the averaging of electron images of two-dimensional macromolecular crystalline arrays have facilitated the visualization of negatively-stained biological structures. Either by simulation of optical filtering techniques or, in more refined treatments, by cross-correlation averaging, an idealized representation of the repeating asymmetric structure unit is constructed, eliminating image distortions due to radiation damage, stain irregularities and, in the latter approach, imperfections and distortions in the unit cell repeat. In these analyses it is generally assumed that the electron scattering from the thin negativelystained object is well-approximated by a phase object model. Even when absorption effects are considered (i.e. “amplitude contrast“), the expansion of the transmission function, q(x,y)=exp (iσɸ (x,y)), does not exceed the first (kinematical) term. Furthermore, in reconstruction of electron images, kinematical phases are applied to diffraction amplitudes and obey the constraints of the plane group symmetry.

Recovery boiler sootblowers: History and technological advances

TAPPI Journal ◽  
2015 ◽  
Vol 14 (1) ◽  
pp. 51-60
Author(s):  
HONGHI TRAN ◽  
DANNY TANDRA
Keyword(s):  
Cfd Modeling ◽  
Computing Systems ◽  
The Past ◽  
Technological Advances ◽  
Recovery Boilers ◽  
Computational Fluid Dynamics Cfd ◽  
Recovery Boiler ◽  
Steam Parameters ◽  
Insight Into ◽  
Deposit Removal

Sootblowing technology used in recovery boilers originated from that used in coal-fired boilers. It started with manual cleaning with hand lancing and hand blowing, and evolved slowly into online sootblowing using retractable sootblowers. Since 1991, intensive research and development has focused on sootblowing jet fundamentals and deposit removal in recovery boilers. The results have provided much insight into sootblower jet hydrodynamics, how a sootblower jet interacts with tubes and deposits, and factors influencing its deposit removal efficiency, and have led to two important innovations: fully-expanded sootblower nozzles that are used in virtually all recovery boilers today, and the low pressure sootblowing technology that has been implemented in several new recovery boilers. The availability of powerful computing systems, superfast microprocessors and data acquisition systems, and versatile computational fluid dynamics (CFD) modeling capability in the past two decades has also contributed greatly to the advancement of sootblowing technology. High quality infrared inspection cameras have enabled mills to inspect the deposit buildup conditions in the boiler during operation, and helped identify problems with sootblower lance swinging and superheater platens and boiler bank tube vibrations. As the recovery boiler firing capacity and steam parameters have increased markedly in recent years, sootblowers have become larger and longer, and this can present a challenge in terms of both sootblower design and operation.

Implementasi Algoritma Dijkstra Pada Game Pacman

CCIT Journal ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 170-176
Author(s):  
Anggit Dwi Hartanto ◽  
Aji Surya Mandala ◽  
Dimas Rio P.L. ◽  
Sidiq Aminudin ◽  
Andika Yudirianto
Keyword(s):  
Artificial Intelligence ◽  
Greedy Algorithm ◽  
Dijkstra Algorithm ◽  
Testing Phase ◽  
A Value ◽  
Route Problem ◽  
Starting Point ◽  
The Greedy Algorithm

Pacman is one of the labyrinth-shaped games where this game has used artificial intelligence, artificial intelligence is composed of several algorithms that are inserted in the program and Implementation of the dijkstra algorithm as a method of solving problems that is a minimum route problem on ghost pacman, where ghost plays a role chase player. The dijkstra algorithm uses a principle similar to the greedy algorithm where it starts from the first point and the next point is connected to get to the destination, how to compare numbers starting from the starting point and then see the next node if connected then matches one path with the path). From the results of the testing phase, it was found that the dijkstra algorithm is quite good at solving the minimum route solution to pursue the player, namely by getting a value of 13 according to manual calculations

Methods of the multiparametric adaptation of spaceborne control and computing systems with separate majority reservation

1999 ◽  
Vol 5 (5-6) ◽  
pp. 81-91
Author(s):  
V.S. Kharchenko ◽  
◽  
A.P. Zenin ◽  
V.V. Sklyar
Keyword(s):  
Computing Systems

Fast Pruning Algorithm and Task Scheduling under Map/Reduce

2020 ◽  
Vol 16 (10) ◽  
pp. 1627
Author(s):  
Pei Shujun ◽  
Zhang Yu ◽  
Liang Chao
Keyword(s):  
Task Scheduling ◽  
Map Reduce ◽  
Pruning Algorithm ◽  
And Task
Sign in / Sign up

Export Citation Format

Share Document