Maximum 2-satisfiability in radial basis function neural network

Maximum k-Satisfiability (MAX-kSAT) is the logic to determine the maximum number of satisfied clauses. Correctly, this logic plays a prominent role in numerous applications as a combinatorial optimization logic. MAX2SAT is a case of MAX-kSAT and is written in Conjunctive Normal Form (CNF) with two variables in each clause. This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). Hence, we restrict the analysis to MAX2SAT clauses. We utilize Dev C++ as the platform of training and testing our proposed algorithm. In this study, the effectiveness of RBFNN-MAX2SAT can be estimated by evaluating the proposed models with testing data sets. The results obtained are analysed using the ratio of satisfied clause (RSC), the root means square error (RMSE), and CPU time. The simulated results suggest that the proposed algorithm is effective in doing MAX2SAT logic programming by analysing the performance by obtaining lower Root Mean Square Error, high ratio of satisfied clauses and lesser CPU time

Rise of the Planet of Serverless Computing: A Systematic Review

Serverless computing is an emerging cloud computing paradigm, being adopted to develop a wide range of software applications. It allows developers to focus on the application logic in the granularity of function, thereby freeing developers from tedious and error-prone infrastructure management. Meanwhile, its unique characteristic poses new challenges to the development and deployment of serverless-based applications. To tackle these challenges, enormous research efforts have been devoted. This paper provides a comprehensive literature review to characterize the current research state of serverless computing. Specifically, this paper covers 164 papers on 17 research directions of serverless computing, including performance optimization, programming framework, application migration, multi-cloud development, testing and debugging, etc. It also derives research trends, focus, and commonly-used platforms for serverless computing, as well as promising research opportunities

Optimisation of the hydrotesting sequence in tank farm construction using an adaptive genetic algorithm with stochastic preferential logic

In the construction of tank farms there is a requirement for the tanks to be hydro-tested in order to verify that they are leak proof as well as proving the lack of differential settlement in the foundations. The tanks will be required to be filled to a predetermined level and then to maintain this loaded state for a certain period of time before being drained. In areas such as the Middle East water for hydro-testing is not freely available as sea water is often not suitable for this purpose, so fresh water needs to be produced or transported to the construction site for this purpose. It is therefore of major benefit to the project to schedule the hydro-testing of the tanks in such a manner as to minimize the utilization of hydro-test water. This problem is a special case of the Resource Constrained Project Scheduling Problem (RCPSP) and in this research we have modified our previously developed Fitness differential adaptive genetic algorithm [4, 6 & 7] to the solution of this real world problem. The Algorithm has been ported from the original MATLAB code into Microsoft Project using VBA in order to provide a more user friendly, practical interface

Fuzzy investment decision support for brownfield redevelopment

Tato disertační práce se zaměřuje na problematiku investování a podporu rozhodování pomocí moderních metod. Zejména pokud jde o analýzu, hodnocení a výběr tzv. brownfieldů pro jejich redevelopment (revitalizaci). Cílem této práce je navrhnout univerzální metodu, která usnadní rozhodovací proces. Proces rozhodování je v praxi komplikován též velkým počet relevantních parametrů ovlivňujících konečné rozhodnutí. Navržená metoda je založena na využití fuzzy logiky, modelování, statistické analýzy, shlukové analýzy, teorie grafů a na sofistikovaných metodách sběru a zpracování informací. Nová metoda umožňuje zefektivnit proces analýzy a porovnávání alternativních investic a přesněji zpracovat velký objem informací. Ve výsledku tak bude zmenšen počet prvků množiny nejvhodnějších alternativních investic na základě hierarchie parametrů stanovených investorem.This dissertation focuses on decision making, investing and brownfield redevelopment. Especially on the analysis, evaluation and selection of previously used real estates suitable for commercial use. The objective of this dissertation is to design a method that facilitates the decision making process with many possible alternatives and large number of relevant parameters influencing the decision. The proposed method is based on the use of fuzzy logic, modeling, statistic analysis, cluster analysis, graph theory and sophisticated methods of information collection and processing. New method allows decision makers to process much larger amount of information and evaluate possible investment alternatives efficiently.

LOT: Logic Optimization with Testability - new transformations for logic synthesis

A new approach to optimize multilevel logic circuits is introduced. Given a multilevel circuit, the synthesis method optimizes its area while simultaneously enhancing its random pattern testability. The method is based on structural transformations at the gate level. New transformations involving EX-OR gates as well as Reed–Muller expansions have been introduced in the synthesis of multilevel circuits. This method is augmented with transformations that specifically enhance random-pattern testability while reducing the area. Testability enhancement is an integral part of our synthesis methodology. Experimental results show that the proposed methodology not only can achieve lower area than other similar tools, but that it achieves better testability compared to available testability enhancement tools such as tstfx. Specifically for ISCAS-85 benchmark circuits, it was observed that EX-OR gate-based transformations successfully contributed toward generating smaller circuits compared to other state-of-the-art logic optimization tools

Memory-Based High-Level Synthesis Optimizations Security Exploration on the Power Side-Channel

High-level synthesis (HLS) allows hardware designers to think algorithmically and not worry about low-level, cycle-by-cycle details. This provides the ability to quickly explore the architectural design space and tradeoffs between resource utilization and performance. Unfortunately, security evaluation is not a standard part of the HLS design flow. In this article, we aim to understand the effects of memory-based HLS optimizations on power side-channel leakage. We use Xilinx Vivado HLS to develop different cryptographic cores, implement them on a Spartan-6 FPGA, and collect power traces. We evaluate the designs with respect to resource utilization, performance, and information leakage through power consumption. We have two important observations and contributions. First, the choice of resource optimization directive results in different levels of side-channel vulnerabilities. Second, the partitioning optimization directive can greatly compromise the hardware cryptographic system through power side-channel leakage due to the deployment of memory control logic. We describe an evaluation procedure for power side-channel leakage and use it to make best-effort recommendations about how to design more secure architectures in the cryptographic domain