Recently, there has been significant interest in linear regression the situation where predictors and responses are not observed matching pairs corresponding to same statistical unit as a consequence of separate data collection uncertainty integration. Mismatched can considerably impact model fit disrupt estimation parameters. In this article, we present method adjust for such mismatches under ...

Path planning evaluates and identifies an obstacle free path for a wheeled mobile robot (WMR) to traverse within its workspace. It emphasizes metric like, start goal coordinate, static or dynamic workspace, obstacles, computational time local minimum problem. play significant role toward WMR effective it workspace like industrial, military, hospital, school office. In this is optimal method inc...

The aim of this study is to focus on spectrum sensing in cognitive radio which is a recently introduced technology in order to increase the spectrum efficiency. We studied the Singular value decomposition based signal detector and its advantages over the energy based signal detection. Soft thresholding technique for spectrum sensing is optimized using SFLA (Shuffled Frog Leaping) and Ant Bee Co...

Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...

As Deep Learning (DL) models grow larger and more complex, training jobs are increasingly distributed across multiple Computing Units (CU) such as GPUs TPUs. Each CU processes a sub-part of the model synchronizes results with others. Communication among these CUs has emerged key bottleneck in process. In this work, we present SiPAC, Silicon Photonic Accelerated Compute cluster. SiPAC accelerate...

Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck is shuffled to create a random permutation. Shuffling is used to assure that an aggregate of data elements for a sequence S is randomly arranged, but avoids a...

We estimate the n-gram entropies of natural language texts in word-length representation and find that these are sensitive to text language and genre. We attribute this sensitivity to changes in the probability distribution of the lengths of single words and emphasize the crucial role of the uniformity of probabilities of having words with length between five and ten. Furthermore, comparison wi...

This paper studies wireless sensor networks node deployment problem and proposes intelligent single particle optimizer based wireless sensor networks adaptive coverage. According to the probability model measure characteristic of wireless sensor nodes, the method adaptively determines the optimal deployment of sensor nodes using intelligent single particle optimizer, achieving sensor node based...

Chaotic systems have been broadly exploited through the last two decades to build encryption methods. Recently, two new image encryption schemes have been proposed, where the encryption process involves a permutation operation and an XORlike transformation of the shuffled pixels, which are controlled by three chaotic systems. This paper discusses some defects of the schemes and how to break the...

We show that winning the game New Age Solitaire only depends on the number of rising sequences in the deck used. The probability of winning for the special case of a new deck that is shuffled using the GSR-shuffle (and two variants) are studied. We show that this game pinpoints the Achilles heel of the GSR-shuffle as is demonstrated using the variation distance.