In the age of edge/fog computing, it is important to consider not only computing resources but also network when hosting services. Since service composed multiple small functions in microservice architecture, we treat a as set BFs (basic functions) that fulfill single task. It required place at nodes considering and requirements within practical time. This paper proposes MANO (Management Networ...

Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The SBox of Advance Encryption Standard have also been generated using Irreducible Polynomials over Galois field GF(2 8 ) adding an additive constant in early twenty first century. ...

We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient we introduce a new algorithm, named Similarity-First-Search (SFS), which extends Lexicographic BreadthFirst S...

Recently, considerable effort has been spent on showing that Lexicographic Breadth First Search (LBFS) can be used to determine a tight bound on the diameter of graphs from various restricted classes. In this paper, we show that, in some cases, the full power of LBFS is not required and that other variations of Breadth First Search (BFS) suffice. The restricted graph classes that are amenable t...

Although Breadth-First Search (BFS) has several advantages over DepthFirst Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of space-e cient BFS (SEBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a lo...

We investigate the dependence of Brillouin gain spectra on large strain of > 20% in a perfluorinated graded-index polymer optical fiber, and prove, for the first time, that the dependence of Brillouin frequency shift (BFS) is highly non-monotonic. We predict that temperature sensors even with zero strain sensitivity can be implemented by use of this non-monotonic nature. Meanwhile, the Stokes p...

We report on experimental branching fractions (BFs) for 19 transitions from the three 3d5(6S)4s4p(3P) y6P levels in Fe II, measured in Fourier transform spectra of a Penning discharge lamp and a hollow cathode lamp. The transition wavelengths span the interval between 1600 and 2850 Å. Absolute oscillator strengths ( f -values) have been derived by combining the BFs with experimental radiative l...

Bitwise-Xor of two 4 bit binary numbers or 4-bit bit patterns entitled 4-bit differences carries information in Cryptography. The Method to Analyze Cryptographic cipher algorithms or 4-bit substitution boxes with 4-bit differences is known as Differential Cryptanalysis. In this paper a brief review of Differential Cryptanalysis of 4-bit bijective Crypto S-Boxes and a new algorithm to analyze th...

In the present research new algorithms for automatic minimal loop extraction and initialisation have been developed for water pipe network analysis. The present work converts water pipe networks into graph data structures with pipes as edges and nodes of the network as nodes of the graph. The Nested Breadth First Search (NBFS) algorithm has been developed for the automatic extraction of loops f...

In this paper we propose an operating system design for Ubicomp applications that are implemented on embedded sensor platforms. The OS provides support for both periodic sensor sampling and sequential appliation logic. Core component is a lightweight real-time runtime system guaranteeing predictable real-time behavior of periodic sampling processes. The design utilizes a novel method, called bu...