In this paper, we investigate the problem of obtaining new construction methods for resilient Boolean functions. Given n (n odd and n ≥ 35), we firstly provide degree optimized 1-resilient n-variable functions with currently best known nonlinearity. Then we extend our method to obtain m-resilient (m > 1) Boolean functions with degree n − m − 1, we show that these Boolean functions also achieve ...

We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit p...

Steam is a key energy vector for industrial sites, most commonly used for process heating and cooling, cogeneration of heat and mechanical power as a motive fluid or for stripping. Steam networks are used to carry steam from producers to consumers and between pressure levels through letdowns and steam turbines. The steam producers (boilers, heat and power cogeneration units, heat exchangers, ch...

Large scale outages on real-world critical infrastructures (CIs), although infrequent, are increasingly disastrous to society. In this paper, we model CIs as complex networks and consider the problem of facility allocation on nodes of the network for maximizing the efficiency of supply to other nodes and the resilience of the overall network in resisting to cascading failures. Of course, the in...

Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in nite set theory. Solutions to so...

Pheromones are a chemical substance produced and released by ants as means of communication. In this work we present the minimum amount of pheromones necessary and sufficient for a colony of ants (identical mobile agents) to deterministically find a food source (treasure), assuming that each ant has the computational capabilities of either a Finite State Machine (FSM) or a Turing Machine (TM). ...

We propose the first deterministic algorithm that tolerates up to f byzantine faults in 3f + 1-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimens...

We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the network. Motivated by earlier work using a rank-based approach, i.e., Rooted-PageRank, we introduce a novel timesensitive method, called T-RPR, that captures and exploits the dynamics and evolution of the interaction patterns in the network ...

Hurricane, as one of the most frequent natural events, causes damage to infrastructure upstream networks multiple energy carrier microgrids (MECMs). Thus, supply continuity critical loads is threatened due sudden islanding MECMs from networks. Therefore, providing a framework enhance resilience against this threat necessary. In response issue, paper presents proactive optimal operation scheduli...