In the book "Parallel Scientific Computing", we present the background and motivation for the development of solution methodologies for partial differential equations. The book is concentrated on the synergy between computer science and numerical analysis. It is written to provide a firm understanding of the described approaches to computer scientists, engineers or other experts who have to solve real problems. Different solution approaches are described in detail, with a description of the required algorithms and methods that are needed for the design of efficient computer programs. Most of the details are demonstrated on solutions of practical problems, from basic to more complicated ones. This book is a useful tool for readers interested in the implementation of complex computer simulations in various application domains.

COBISS.SI-ID: 28468007

Through detailed analysis of accesses to different memory levels (L1-L3 caches), we demonstrated and explained super-linear speedup in dealing with the unsteady thermo-fluid problem on a 4-processor system with a total of 40 cores. During the execution of the original simulation program, we counted accesses to different levels of cache. Analysis of the results showed that the super-linear speedup results from the combining of several L3 caches. The main message of the paper is that the execution time of the program strongly depends on the architecture of the computing system and not only on the power of the processors.

COBISS.SI-ID: 27339815

This book offers an original and informative view of the development of the fundamental concepts of the computability theory, which is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. The book starts the classical computability theory, continues with description of the quest for formalization, the Turing Machine and early successes such as defining incomputable problems, and concludes with discussion on relative computability, classification of insolvability into classes and levels, and the arithmetical hierarchy.

COBISS.SI-ID: 1536557251

This survey provides background information about interconnection networks, an analysis of previous developments, and an overview of the state of the art. The main contribution of this article is to highlight the importance of the interpolation and extrapolation of technological changes and physical constraints in order to predict the optimum future interconnection network. The technological changes are related to three of the most important attributes of interconnection networks: topology, routing, and flow-control algorithms. On the other hand, the physical constraints, that is, port counts, number of communication nodes, and communication speed, determine the realistic properties of the network. We present the state-of-the-art technology for the most commonly used interconnection networks and some background related to often-used network topologies. The interconnection networks of the best-performing petascale parallel computers from past and present Top500 lists are analysed. The lessons learned from this analysis indicate that computer networks need better performance in future exascale computers.

COBISS.SI-ID: 29774119

The book provides a comprehensive overview of electrocardiography from the aspect of wireless and mobile ECG monitoring and its potential for personalized health management. The main advantage of wireless and mobile ECG systems compared to traditional ones is that ECG can be monitored over time with one or a few wireless miniature and therefore non-obtrusive sensors. The book deals with both implementation and efficient application of user-friendly mobile health solutions (mHealth). In seven chapters, it successively presents the historical beginnings and basics of ECG, software support for system components in mHealth, two pilot studies with example recordings, the theoretical background of differential ECG and the synthesis of a standard 12-channel ECG, some commercial ECG sensors, final conclusions and perspectives of mHealth.

COBISS.SI-ID: 30759719

In this paper, we tackle the problem of power prediction of several photovoltaic (PV) plants spread over an extended geographic area and connected to a power grid. The paper is a comprehensive study of one-day forecast of PV energy production along several dimensions of analysis: 1) The consideration of the spatio-temporal autocorrelation, which characterizes geophysical phenomena, to obtain more accurate predictions. 2) The learning setting to be considered, i.e., using simple output prediction for each hour or structured output prediction for each day. 3) The learning algorithms: We compare artificial neural networks, most often used for PV prediction forecast, and regression trees for learning adaptive models. The results obtained on two PV power plant datasets show that: taking into account spatio/temporal autocorrelation is beneficial; the structured output prediction setting significantly outperforms the nonstructured output prediction setting; and regression trees provide better models than artificial neural networks.

COBISS.SI-ID: 29728807

Pri testiranju skladnosti reaktivnih sistemov po principu črne škatle pogosto privzamemo, da je sistem izvedba danega končnega avtomata in nima več stanj kot ta avtomat. Ključna aktivnost pri interpretaciji vhodno / izhodnega zaporedja, opaženega na sistemu, je nato prepoznati obiskana stanja kot stanja specifikacijskega avtomata. Članek predlaga posplošitev treh uveljavljenih vzorcev za prepoznavanje stanja (VPS) na dva VPS, ki sta dosti močnejša, a še vedno relativno enostavna za uporabo, in naprej na izredno močan in splošen VPS, iz katerega je nadaljnje praktično zanimive VPS mogoče razvijati preprosto s specializacijo.

COBISS.SI-ID: 25570087

The paper describes novel algorithm for obstacle detection based on image sequences, obtained with the monocular camera on-board a robotic waterborne vehicle. Method is based on semantic segmentation using Markov random fields, and is especially suited for small robotic vehicles, since it outperforms all other general state-of-the-art segmentation methods. Due to low processing load, the method is suited for robotic applications that work in real time.

COBISS.SI-ID: 1536310979

Deterministic job-shop scheduling with the makespan criterion is a well-known NP-complete combinatorial optimization problem. Consequently, it is often tackled with approximation algorithms, among which local search is a fairly popular approach. Here, the solution is improved iteratively, through a series of small perturbations. The omnipresent implementations of local search select the perturbation to be applied to the current solution solely by considering candidates' influence on the criterion's value. The article theoretically justifies and empirically verifies that there is room for improvement in this respect. We propose a new selection of perturbations, which delivers very strong results and surpasses the previous best-known solution of one of the well-known benchmark test instances.

COBISS.SI-ID: 10810196

The paper describes a new exact parallel maximum clique algorithm MaxCliquePara, which can be applied on general undirected graphs. It starts by explaining the new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in the state of the art sequential algorithms. Next, the sequential algorithm is parallelized into MaxCliquePara algorithm by splitting the branch-and-bound search tree to multiple cores. The ability to exploit all cores efficiently makes the new parallel MaxCliquePara algorithm markedly superior to other tested algorithms. On a 12-core computer, the parallel algorithm provides up to 2 orders of magnitude faster execution on large benchmark graphs and up to an order of magnitude faster execution on protein-based product graphs.

COBISS.SI-ID: 5297690